7 List<T>::List(List const&src)
10 // probably el stupido
11 for (Cursor<T> c(src); c.ok(); c++)
41 Cursor<T> next(*this);
42 for ( Cursor<T> c( *this ); c.ok(); c = next ) {
51 List<T>::add( const T& thing, Cursor<T> &after_me )
53 if (!size_) { // not much choice if list is empty
54 bottom_ = top_ = new Link<T>( thing );
57 } else { // add at aprioprate place
60 Link<T> *p =after_me.pointer();
62 if (p == bottom_) // adjust bottom_ if necessary.
72 \item if #after_me# is #ok()#, add after #after_me#, else
73 \item if list !empty simply add to bottom, else
74 \item list is empty: create first \Ref{Link} and initialize
81 List<T>::insert( const T& thing, Cursor<T> &before_me )
84 bottom_ = top_ = new Link<T>( thing );
92 Link<T> *p = before_me.pointer() ;
105 List<T>::concatenate(List<T> const&s)
107 Cursor<T> b(bottom());
108 for (Cursor<T> c(s); c.ok(); c++) {