#include <sql_list.h>
◆ base_list_iterator() [1/2]
base_list_iterator::base_list_iterator |
( |
| ) |
|
|
inline |
◆ base_list_iterator() [2/2]
base_list_iterator::base_list_iterator |
( |
base_list & |
list_par | ) |
|
|
inline |
◆ after() [1/2]
bool base_list_iterator::after |
( |
void * |
a, |
|
|
MEM_ROOT * |
mem_root |
|
) |
| |
|
inline |
◆ after() [2/2]
void base_list_iterator::after |
( |
void * |
element | ) |
|
|
inline |
◆ init()
void base_list_iterator::init |
( |
base_list & |
list_par | ) |
|
|
inline |
◆ is_before_first()
bool base_list_iterator::is_before_first |
( |
| ) |
const |
|
inline |
◆ is_last()
bool base_list_iterator::is_last |
( |
void |
| ) |
|
|
inline |
◆ next()
void * base_list_iterator::next |
( |
void |
| ) |
|
|
inline |
◆ next_fast()
void * base_list_iterator::next_fast |
( |
void |
| ) |
|
|
inline |
◆ prepend()
bool base_list_iterator::prepend |
( |
void * |
a, |
|
|
MEM_ROOT * |
mem_root |
|
) |
| |
|
inline |
◆ ref()
void ** base_list_iterator::ref |
( |
void |
| ) |
|
|
inline |
◆ remove()
void base_list_iterator::remove |
( |
void |
| ) |
|
|
inline |
◆ replace() [1/2]
void * base_list_iterator::replace |
( |
base_list & |
new_list | ) |
|
|
inline |
◆ replace() [2/2]
void * base_list_iterator::replace |
( |
void * |
element | ) |
|
|
inline |
◆ rewind()
void base_list_iterator::rewind |
( |
void |
| ) |
|
|
inline |
◆ sublist()
void base_list_iterator::sublist |
( |
base_list & |
ls, |
|
|
uint |
elm |
|
) |
| |
|
inlineprotected |
◆ error_list_iterator
friend class error_list_iterator |
|
friend |
◆ current
◆ el
◆ list
◆ prev
The documentation for this class was generated from the following file: