22#ifndef QDENGINE_QDCORE_QD_LIST_H
23#define QDENGINE_QDCORE_QD_LIST_H
61 if (cnt != numElements)
62 ErrH.Abort(
"List", XERR_USER, code);
67inline qdList<Type>::qdList() {
73inline qdList<Type>::~qdList() {
78inline void qdList<Type>::clear() {
84inline void qdList<Type>::delete_all() {
86 while ((p = first()) != 0) {
93inline int qdList<Type>::size() {
98inline Type *qdList<Type>::first() {
103inline Type *qdList<Type>::last() {
104 return firstElement ? firstElement->prev : 0;
108inline void qdList<Type>::insert(
Type *p) {
110 ErrH.Abort(
"Element is already in list");
113 p->next = firstElement;
114 p->prev = firstElement->prev;
115 firstElement->prev = p;
126inline void qdList<Type>::insert(
Type *pointer,
Type *p) {
127 if (!firstElement || firstElement == pointer) {
137 ErrH.Abort(
"Element is already in list");
140 p->prev = pointer->prev;
141 pointer->prev->next = p;
149inline void qdList<Type>::append(
Type *p) {
155 p->prev = firstElement->prev;
156 firstElement->prev->next = p;
157 firstElement->prev = p;
160 p->prev = firstElement = p;
167inline void qdList<Type>::remove(
Type *p) {
172 p->next->prev = p->prev;
174 firstElement->prev = p->prev;
176 if (p != firstElement)
177 p->prev->next = p->next;
179 firstElement = p->next;
181 firstElement->prev = p->prev;
184 p->next = p->prev = 0;
190inline Type *qdList<Type>::search(
int ID) {
It remove(It first, It last, const T &val)
Definition: algorithm.h:466
Базовый класс для игровых ресурсов.
Definition: console.h:28