#include <dktypes.h>
Data Fields | |
dk_storage_node_p * | d |
Critical path for delete operations. | |
short | l |
Path length of critical path (buffer size). | |
dk_storage_node_t * | r |
The trees root element, lists left. | |
int | h |
Comparison/evaluation algorithm. | |
int | c |
Comparison/evaluation criteria. | |
int | t |
Flag: tree or sorted list. | |
union { | |
dk_fct_eval_c_t * c | |
dk_fct_eval_uc_t * uc | |
dk_fct_eval_s_t * s | |
dk_fct_eval_us_t * us | |
dk_fct_eval_i_t * i | |
dk_fct_eval_ui_t * ui | |
dk_fct_eval_l_t * l | |
dk_fct_eval_ul_t * ul | |
dk_fct_eval_f_t * f | |
dk_fct_eval_d_t * d | |
dk_fct_comp_t * comp | |
} | e |
Comparison or evaluation function. | |
void * | i |
Double linked list of iterators. |
A storage can be used to store pointers to objects.
int dk_storage_t::c |
Comparison/evaluation criteria.
Critical path for delete operations.
union { ... } dk_storage_t::e |
Comparison or evaluation function.
int dk_storage_t::h |
void* dk_storage_t::i |
Double linked list of iterators.
short dk_storage_t::l |
Path length of critical path (buffer size).
int dk_storage_t::t |