117 void clear() { elements=0; first= &end_of_list; last=&first;}
118 base_list() { clear(); }
130 elements= tmp.elements;
132 last= elements ? tmp.last : &first;
136 elements= tmp.elements;
138 last= elements ? tmp.last : &first;
142 void push_back(
void *info)
144 *last =
new list_node(info, &end_of_list);
145 last= &(*last)->next;
148 void push_back(
void *info, memory::Root& mem)
150 *last =
new (mem) list_node(info, &end_of_list);
151 last= &(*last)->next;
154 void push_front(
void *info)
156 list_node *node=
new list_node(info,first);
162 void remove(list_node **prev)
164 list_node *node=(*prev)->next;
167 else if (last == &(*prev)->next)
172 void concat(base_list *list)
174 if (!list->is_empty())
178 elements+= list->elements;
183 if (first == &end_of_list)
return 0;
184 list_node *tmp=first;
190 void disjoin(base_list *list)
192 list_node **prev= &first;
193 list_node *node= first;
194 list_node *list_first= list->first;
196 while (node && node != list_first)
205 void prepand(base_list *list)
207 if (!list->is_empty())
211 elements+= list->elements;
219 std::swap(first, rhs.first);
220 std::swap(last, rhs.last);
221 std::swap(elements, rhs.elements);
223 bool is_empty() {
return first == &end_of_list ; }
224 friend class base_list_iterator;
226#ifdef LIST_EXTRA_DEBUG
242 bool check_list(
const char *name)
244 list_node *node= first;
247 while (node->next != &end_of_list)
256 if (last != &(node->next))
260 if (cnt+1 != elements)
269 void after(
void *info,list_node *node)
271 list_node *new_node=
new list_node(info,node->next);
274 if (last == &(node->next))
275 last= &new_node->next;
280class base_list_iterator
286 void sublist(
base_list &ls, uint32_t elm)
const
293 :list(0), el(0), prev(0), current(0)
297 :list(&list_par), el(el0), prev(0), current(0)
303 void *ret_value=current->info;
304 if (!new_list.is_empty())
306 *new_list.last=current->next;
307 current->info=new_list.first->info;
308 current->next=new_list.first->next;
309 if (list->last == ¤t->next && new_list.elements > 1)
310 list->last= new_list.last;
311 list->elements+=new_list.elements-1;
321 void after(
void *element)
323 list->after(element,current);
324 current=current->next;
331template <
class T>
class List :
public base_list
339 List(
const List<T> &tmp) : base_list(tmp) {}
340 List<T>& operator=(
const List<T> &tmp)
342 base_list::operator=(tmp);
345 List(
const List<T> &tmp,
memory::Root *mem_root) : base_list(tmp, mem_root) {}
346 T& front() {
return *
static_cast<T*
>(first->info); }
347 T* pop() {
return static_cast<T*
>(base_list::pop()); }
348 void concat(List<T> *list) { base_list::concat(list); }
349 void disjoin(List<T> *list) { base_list::disjoin(list); }
350 void prepand(List<T> *list) { base_list::prepand(list); }
351 void delete_elements()
354 for (element=first; element != &end_of_list; element=next)
357 delete (T*) element->info;
364 return iterator(*
this, &first);
372 void set_size(
size_t v)