Go to the documentation of this file.
57 inline void Put(T *V) ;
92 inline void Push(T* V) ;
103 class ListWS:
public List<T> {
107 inline ListWS() :
List<T>() {} ;
108 inline ListWS(
const ListWS &L) :
List<T>(L) { } ;
109 virtual ~ListWS() { } ;
111 inline void PushPos() ;
112 inline void PopPos() ;
int IsEnd()
Definition: t_list.hpp:261
T * Pop()
Definition: t_list.hpp:19
Node< T > * Next
Definition: t_list.h:32
T * Get()
Definition: t_list.hpp:161
List()
Pointer to current position in the list.
Definition: t_list.hpp:27
virtual ~Stack()
Definition: t_list.h:90
void InsertAfter(T *V)
Definition: t_list.hpp:119
Node< T > * Start
Pointer to Start of list.
Definition: t_list.h:43
virtual ~List()
Definition: t_list.hpp:46
List & operator>>(T *V)
Definition: t_list.hpp:229
void First()
Definition: t_list.hpp:249
void Next()
Definition: t_list.hpp:237
Node< T > * End
Pointer to end of list.
Definition: t_list.h:44
int SizeList()
Definition: t_list.hpp:55
List operator+(const List &L)
Definition: t_list.hpp:292
List & operator=(const List &L)
Definition: t_list.hpp:313
List & operator+=(const List &L)
Definition: t_list.hpp:300
void Append(T *V)
Definition: t_list.hpp:95
int IsStart()
Definition: t_list.hpp:267
Node< T > * Prev
Definition: t_list.h:32
void Clear()
Definition: t_list.hpp:181
void Prev()
Definition: t_list.hpp:243
Stack()
Definition: t_list.h:89
List< T > L
Definition: t_list.h:87
void InsertBefore(T *V)
Definition: t_list.hpp:138
List & operator<<(T *V)
Definition: t_list.hpp:221
Node< T > * Current
Definition: t_list.h:45
void Destroy()
Definition: t_list.hpp:214
void InsertAtStart(T *V)
Definition: t_list.hpp:71
void Swap()
Definition: t_list.hpp:273
void Push(T *V)
Definition: t_list.hpp:14
void Last()
Definition: t_list.hpp:255
void Put(T *V)
Definition: t_list.hpp:175
T * Val
Definition: t_list.h:33