#include <elst.h>
◆ ELIST()
◆ add_sorted()
bool ELIST::add_sorted |
( |
int |
comparatorconst void *, const void *, |
|
|
bool |
unique, |
|
|
ELIST_LINK * |
new_link |
|
) |
| |
|
inline |
◆ add_sorted_and_find()
ELIST_LINK * ELIST::add_sorted_and_find |
( |
int |
comparatorconst void *, const void *, |
|
|
bool |
unique, |
|
|
ELIST_LINK * |
new_link |
|
) |
| |
◆ assign_to_sublist()
◆ empty()
bool ELIST::empty |
( |
| ) |
const |
|
inline |
◆ First()
◆ internal_clear()
void ELIST::internal_clear |
( |
void(*)(ELIST_LINK *) |
zapper | ) |
|
◆ internal_deep_copy()
◆ length()
int32_t ELIST::length |
( |
| ) |
const |
◆ shallow_copy()
void ELIST::shallow_copy |
( |
ELIST * |
from_list | ) |
|
|
inline |
◆ singleton()
bool ELIST::singleton |
( |
| ) |
const |
|
inline |
◆ sort()
void ELIST::sort |
( |
int |
comparator const void *, const void * | ) |
|
◆ ELIST_ITERATOR
◆ last
The documentation for this class was generated from the following files:
- /home/stephane/src/tesseract/src/ccutil/elst.h
- /home/stephane/src/tesseract/src/ccutil/elst.cpp