#include <fcb/key.hpp>
#include <fcb/stree.hpp>
#include <cstdint>
#include <vector>
Go to the source code of this file.
|
| struct | fcb::BtreeEntry |
| | One (key, feature byte offset) pair to be indexed. More...
|
| |
| struct | fcb::BuiltBtreeIndex |
| | The finished index: the flat node array concatenated with the payload section (mirrors Stree::stream_write, stree.rs:1575-1589), plus the two header fields (AttributeIndexInfo.branching_factor/ .num_unique_items, M4's header_serializer.hpp) that only the builder itself can compute – branching_factor here is just the caller's own value echoed back (kept alongside the bytes so a caller building several columns' indices doesn't have to separately remember what it asked for each one), and num_unique_items counts distinct KEYS, not input entries. More...
|
| |
|
| constexpr std::uint16_t | fcb::kDefaultBranchingFactor = 16 |
| | Mirrors static_btree::DEFAULT_BRANCHING_FACTOR (static_btree/mod.rs:19), used whenever a caller requests an attribute index without naming an explicit branching factor.
|
| |