| 
|   | WDataSet () | 
|   | 
| void  | load_description (const EST_String &descfname, LISP ignores) | 
|   | 
| void  | ignore_non_numbers () | 
|   | 
| int  | ftype (const int &i) const  | 
|   | 
| int  | ignore (int i) const  | 
|   | 
| void  | set_ignore (int i, int value) | 
|   | 
| const EST_String &  | feat_name (const int &i) const  | 
|   | 
| int  | samples (void) const  | 
|   | 
| int  | width (void) const  | 
|   | 
| void  | init () | 
|   | 
|   | EST_TList () | 
|   | default constructor  More...
  | 
|   | 
|   | EST_TList (const EST_TList< T > &l) | 
|   | copy constructor  More...
  | 
|   | 
|   | ~EST_TList () | 
|   | 
| T &  | item (const EST_Litem *p) | 
|   | 
| const T &  | item (const EST_Litem *p) const  | 
|   | 
| T &  | nth (int n) | 
|   | return the Nth value  More...
  | 
|   | 
| const T &  | nth (int n) const  | 
|   | return a const Nth value  More...
  | 
|   | 
| const T &  | first () const  | 
|   | return const reference to first item in list  More...
  | 
|   | 
| const T &  | last () const  | 
|   | return const reference to last item in list  More...
  | 
|   | 
| T &  | first () | 
|   | 
| T &  | last () | 
|   | return reference to last item in list  More...
  | 
|   | 
| const T &  | operator() (const EST_Litem *ptr) const  | 
|   | return const reference to item in list pointed to by ptr  More...
  | 
|   | 
| T &  | operator() (const EST_Litem *ptr) | 
|   | return non-const reference to item in list pointed to by ptr  More...
  | 
|   | 
| EST_Litem *  | remove (EST_Litem *ptr) | 
|   | 
| EST_Litem *  | remove_nth (int n) | 
|   | remove nth item, return pointer to previous item  More...
  | 
|   | 
| void  | append (const T &item) | 
|   | add item onto end of list  More...
  | 
|   | 
| void  | prepend (const T &item) | 
|   | add item onto start of list  More...
  | 
|   | 
| EST_Litem *  | insert_after (EST_Litem *ptr, const T &item) | 
|   | 
| EST_Litem *  | insert_before (EST_Litem *ptr, const T &item) | 
|   | 
| void  | exchange (EST_Litem *a, EST_Litem *b) | 
|   | exchange 1  More...
  | 
|   | 
| void  | exchange (int i, int j) | 
|   | exchange 2  More...
  | 
|   | 
| EST_TList< T > &  | operator= (const EST_TList< T > &a) | 
|   | make full copy of list  More...
  | 
|   | 
| EST_TList< T > &  | operator+= (const EST_TList< T > &a) | 
|   | Add list onto end of existing list.  More...
  | 
|   | 
| void  | clear (void) | 
|   | remove all items in list  More...
  | 
|   | 
|   | EST_UList () | 
|   | 
| virtual  | ~EST_UList () | 
|   | 
| EST_UItem *  | nth_pointer (int n) const  | 
|   | 
| EST_UItem *  | insert_after (EST_UItem *ptr, EST_UItem *new_item) | 
|   | 
| EST_UItem *  | insert_before (EST_UItem *ptr, EST_UItem *new_item) | 
|   | 
| EST_UItem *  | remove (EST_UItem *ptr, void(*item_free)(EST_UItem *item)) | 
|   | 
| EST_UItem *  | remove (int n, void(*item_free)(EST_UItem *item)) | 
|   | 
| void  | exchange (EST_UItem *a, EST_UItem *b) | 
|   | 
| void  | exchange (int i, int j) | 
|   | 
| void  | reverse () | 
|   | 
| int  | length () const  | 
|   | 
| int  | index (EST_UItem *item) const  | 
|   | 
| int  | empty () const  | 
|   | 
| void  | clear (void) | 
|   | 
| void  | append (EST_UItem *item) | 
|   | 
| void  | prepend (EST_UItem *item) | 
|   | 
| EST_UItem *  | head () const  | 
|   | 
| EST_UItem *  | tail () const  | 
|   | 
 | 
| typedef T  | Entry | 
|   | 
| typedef EST_TIterator< EST_TList< T >, IPointer, T >  | Entries | 
|   | 
| typedef EST_TRwIterator< EST_TList< T >, IPointer, T >  | RwEntries | 
|   | 
| static void  | free_item (EST_UItem *item) | 
|   | 
| static void  | exchange_contents (EST_Litem *a, EST_Litem *b) | 
|   | exchange 3  More...
  | 
|   | 
| static bool  | operator_eq (const EST_UList &a, const EST_UList &b, bool(*eq)(const EST_UItem *item1, const EST_UItem *item2)) | 
|   | 
| static int  | index (const EST_UList &l, const EST_UItem &b, bool(*eq)(const EST_UItem *item1, const EST_UItem *item2)) | 
|   | 
| static void  | sort (EST_UList &a, bool(*gt)(const EST_UItem *item1, const EST_UItem *item2)) | 
|   | 
| static void  | qsort (EST_UList &a, bool(*gt)(const EST_UItem *item1, const EST_UItem *item2), void(*exchange)(EST_UItem *item1, EST_UItem *item2)) | 
|   | 
| static void  | sort_unique (EST_UList &l, bool(*eq)(const EST_UItem *item1, const EST_UItem *item2), bool(*gt)(const EST_UItem *item1, const EST_UItem *item2), void(*item_free)(EST_UItem *item)) | 
|   | 
| static void  | merge_sort_unique (EST_UList &l, EST_UList &m, bool(*eq)(const EST_UItem *item1, const EST_UItem *item2), bool(*gt)(const EST_UItem *item1, const EST_UItem *item2), void(*item_free)(EST_UItem *item)) | 
|   | 
| void  | point_to_first (IPointer &ip) const  | 
|   | 
| void  | move_pointer_forwards (IPointer &ip) const  | 
|   | 
| bool  | points_to_something (const IPointer &ip) const  | 
|   | 
| T &  | points_at (const IPointer &ip) | 
|   | 
| void  | init () | 
|   | 
| void  | clear_and_free (void(*item_free)(EST_UItem *item)) | 
|   | 
| EST_UItem *  | h | 
|   | 
| EST_UItem *  | t | 
|   | 
Definition at line 78 of file EST_Wagon.h.