|
Rabbit Tree
Radix bit tries for implementing associative arrays and sets in C.
|
- bits : RBT_KEY_DATA_T, RBT_NODE_T
- bytes : RBT_KEY_DATA_T
- bytes_in_key_prefix : _RBT_NODE_TRAVERSE_WITH_KEY_STACK_T
- cond : RBT_NODE_ROOT_T
- height : _RBT_NODE_TRAVERSE_WITH_KEY_STACK_T
- key : RBT_KEY_DATA_T, RBT_NODE_T
- left : RBT_NODE_T
- mutex : RBT_NODE_ROOT_T
- next : _RBT_NODE_TRAVERSE_WITH_KEY_STACK_T, RBT_NODE_STACK_T
- node : _RBT_NODE_TRAVERSE_WITH_KEY_STACK_T, RBT_KEY_DATA_T, RBT_NODE_ROOT_T, RBT_NODE_STACK_T
- readers : RBT_NODE_ROOT_T
- right : RBT_NODE_T
- value : RBT_NODE_T
- writers : RBT_NODE_ROOT_T
Generated on Fri Jul 15 2022 14:40:16 for Rabbit Tree by
1.9.3
- Contact
- echo xyne.archlinux.org | sed 's/\./@/'