#include <sql_list.h>
Inheritance diagram for List< T >:


Public Member Functions | |
| List () | |
| List (const List< T > &tmp) | |
| bool | push_back (T *a) |
| bool | push_back (T *a, MEM_ROOT *mem_root) |
| bool | push_front (T *a) |
| T * | head () |
| T ** | head_ref () |
| T * | pop () |
| void | concat (List< T > *list) |
| void | disjoin (List< T > *list) |
| void | prepand (List< T > *list) |
| void | delete_elements (void) |
|
|||||||||
|
00288 :base_list() {}
|
|
||||||||||
|
00289 :base_list(tmp) {}
|
|
||||||||||
|
00297 { base_list::concat(list); }
|
|
||||||||||
|
00301 {
00302 list_node *element,*next;
00303 for (element=first; element != &end_of_list; element=next)
00304 {
00305 next=element->next;
00306 delete (T*) element->info;
00307 }
00308 empty();
00309 }
|
|
||||||||||
|
00298 { base_list::disjoin(list); }
|
|
|||||||||
|
Reimplemented from base_list. 00294 {return (T*) base_list::head(); }
|
|
|||||||||
|
Reimplemented from base_list. 00295 {return (T**) base_list::head_ref(); }
|
|
||||||||||
|
Reimplemented from base_list. 00296 {return (T*) base_list::pop(); }
|
|
||||||||||
|
00299 { base_list::prepand(list); }
|
|
||||||||||||||||
|
00292 { return base_list::push_back(a, mem_root); }
|
|
||||||||||
|
00290 { return base_list::push_back(a); }
|
|
||||||||||
|
00293 { return base_list::push_front(a); }
|
1.3.9.1