This directory contains various example of using bgen, a B-tree generator for C.
The following examples show how a bgen btree can be used for various collection types.
- deque.c - Double-ended queue
- map.c - Collection of key-value pairs, sorted by keys, keys are unique
- set.c - Collection of unique keys
- priority_queue.c - Priority queue
- queue.c - Queue (FIFO data structure)
- stack.c - Stack (LIFO data structure)
- spatial.c - Spatial B-tree. Example using geospatial data.
- vector.c - Vector B-tree. Dynamic array, unsorted.
- iteration.c - Shows how to iterate over items in btree