|
| 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)) |
| |
Definition at line 60 of file EST_UList.h.
◆ EST_UList()
◆ ~EST_UList()
| EST_UList::~EST_UList |
( |
| ) |
|
|
inline |
◆ init()
| void EST_UList::init |
( |
void |
| ) |
|
|
inlineprotected |
◆ clear_and_free()
| void EST_UList::clear_and_free |
( |
void(*)(EST_UItem *item) |
item_free | ) |
|
|
protected |
◆ nth_pointer()
| EST_UItem * EST_UList::nth_pointer |
( |
int |
n | ) |
const |
◆ insert_after()
◆ insert_before()
◆ remove() [1/2]
◆ remove() [2/2]
◆ exchange() [1/2]
◆ exchange() [2/2]
| void EST_UList::exchange |
( |
int |
i, |
|
|
int |
j |
|
) |
| |
◆ reverse()
| void EST_UList::reverse |
( |
| ) |
|
◆ length()
| int EST_UList::length |
( |
void |
| ) |
const |
◆ index() [1/2]
| int EST_UList::index |
( |
EST_UItem * |
item | ) |
const |
◆ empty()
| int EST_UList::empty |
( |
| ) |
const |
|
inline |
◆ clear()
| void EST_UList::clear |
( |
void |
| ) |
|
|
inline |
◆ append()
◆ prepend()
◆ head()
◆ tail()
◆ operator_eq()
◆ index() [2/2]
◆ sort()
◆ qsort()
◆ sort_unique()
◆ merge_sort_unique()
The documentation for this class was generated from the following files: