Edinburgh Speech Tools  2.1-release
EST_TList< T > Member List

This is the complete list of members for EST_TList< T >, including all inherited members.

append(const T &item)EST_TList< T >inline
EST_UList::append(EST_UItem *item)EST_UList
clear(void)EST_TList< T >inline
clear_and_free(void(*item_free)(EST_UItem *item))EST_UListprotected
empty() const EST_UListinline
Entries typedefEST_TList< T >
Entry typedefEST_TList< T >
EST_TIterator< EST_TList< T >, IPointer, T > classEST_TList< T >friend
EST_TList()EST_TList< T >inline
EST_TList(const EST_TList< T > &l)EST_TList< T >
EST_TRwIterator< EST_TList< T >, IPointer, T > classEST_TList< T >friend
EST_UList()EST_UListinline
exchange(EST_Litem *a, EST_Litem *b)EST_TList< T >inline
exchange(int i, int j)EST_TList< T >inline
exchange_contents(EST_Litem *a, EST_Litem *b)EST_TList< T >static
first() const EST_TList< T >inline
first()EST_TList< T >inline
free_item(EST_UItem *item)EST_TList< T >static
hEST_UListprotected
head() const EST_UListinline
index(EST_UItem *item) const EST_UList
index(const EST_UList &l, const EST_UItem &b, bool(*eq)(const EST_UItem *item1, const EST_UItem *item2))EST_UListstatic
init()EST_TList< T >inline
insert_after(EST_Litem *ptr, const T &item)EST_TList< T >inline
EST_UList::insert_after(EST_UItem *ptr, EST_UItem *new_item)EST_UList
insert_before(EST_Litem *ptr, const T &item)EST_TList< T >inline
EST_UList::insert_before(EST_UItem *ptr, EST_UItem *new_item)EST_UList
item(const EST_Litem *p)EST_TList< T >inline
item(const EST_Litem *p) const EST_TList< T >inline
last() const EST_TList< T >inline
last()EST_TList< T >inline
length() const EST_UList
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))EST_UListstatic
move_pointer_forwards(IPointer &ip) const EST_TList< T >inlineprotected
nth(int n)EST_TList< T >inline
nth(int n) const EST_TList< T >inline
nth_pointer(int n) const EST_UList
operator()(const EST_Litem *ptr) const EST_TList< T >inline
operator()(const EST_Litem *ptr)EST_TList< T >inline
operator+=(const EST_TList< T > &a)EST_TList< T >
operator<<(std::ostream &st, EST_TList< T > const &list)EST_TList< T >friend
operator=(const EST_TList< T > &a)EST_TList< T >
operator_eq(const EST_UList &a, const EST_UList &b, bool(*eq)(const EST_UItem *item1, const EST_UItem *item2))EST_UListstatic
point_to_first(IPointer &ip) const EST_TList< T >inlineprotected
points_at(const IPointer &ip)EST_TList< T >inlineprotected
points_to_something(const IPointer &ip) const EST_TList< T >inlineprotected
prepend(const T &item)EST_TList< T >inline
EST_UList::prepend(EST_UItem *item)EST_UList
qsort(EST_UList &a, bool(*gt)(const EST_UItem *item1, const EST_UItem *item2), void(*exchange)(EST_UItem *item1, EST_UItem *item2))EST_UListstatic
remove(EST_Litem *ptr)EST_TList< T >inline
EST_UList::remove(EST_UItem *ptr, void(*item_free)(EST_UItem *item))EST_UList
EST_UList::remove(int n, void(*item_free)(EST_UItem *item))EST_UList
remove_nth(int n)EST_TList< T >inline
reverse()EST_UList
RwEntries typedefEST_TList< T >
sort(EST_UList &a, bool(*gt)(const EST_UItem *item1, const EST_UItem *item2))EST_UListstatic
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))EST_UListstatic
tEST_UListprotected
tail() const EST_UListinline
~EST_TList()EST_TList< T >inline
~EST_UList()EST_UListinlinevirtual