1 /*-----------------------------------------------------------------------------
3 Written by Francois Fleuret <francois.fleuret@inria.fr>
4 -----------------------------------------------------------------------------*/
11 //-----------------------------------------------------------------------------
30 NodeList<T> *DeleteNext(NodeList<T> *node);
36 //-----------------------------------------------------------------------------
39 List<T>::List() { first = NULL; }
44 NodeList<T> *node, *suivant;
45 for(node=first; node != NULL;)
54 void List<T>::Insert(T t)
57 node = new NodeList<T>;
64 NodeList<T> *List<T>::DeleteNext(NodeList<T> *node)
81 void List<T>::Remove(T t)
83 NodeList<T> *node, *pred, *next;
91 if(pred == NULL) first = next;
92 else pred->next = next;
105 void List<T>::Reverse()
107 NodeList<T> *node, *next, *pred;
121 int List<T>::Lenght()
126 for(node=first; node != NULL; node = node->next) l++;
130 //-----------------------------------------------------------------------------
134 //-----------------------------------------------------------------------------