I addressed many of these mistakes when I refactored the qp-trie implementation in Knot DNS to support concurrent access, but I have not done so for this experimental implementation. (The code here is public domain; Knot DNS is GPL.)
I originally used "index" to refer to the position of a nybble in a key, but that didn't leave me with a good word to describe the word that summarizes a node. Using "offset" for the position of a nybble allows me to use "index" for the word as a whole, which I like better because it's like a miniature database index, where a twigs vector is like a miniature database table.
either a pointer or an index word, typically 64 bits
contains metadata about a twig vector, including key offset and bitmap
identifies the nybble within a key that is checked against the index
originally a string of 4 bits but now 5 bits from the key
either a leaf or a branch
a pair of a key and a value
a pair of an index word and a pointer to twigs
a vector of nodes
A disastrous choice for portability.
It is much better to define the index word as a large-enough integer type, and use macros or inline functions to extract or update fields within it.
This makes it trivial to ensure that the tag bits appear in the least significant bits of the word, without endianness issues.
In a leaf the index word is not an index but instead is a pointer to a key or a value (depending on which guarantees word alignment), and it's just as easy to cast the integer to a pointer as it is to access a field of a union.
The large-enough integer type is at least
uint64_t, though it needs
uintptr_t if the platform's pointers are bigger than that (for
example, CHERI capabilities).
Written by Tony Finch firstname.lastname@example.org https://dotat.at/; You may do anything with this. It has no warranty. https://creativecommons.org/publicdomain/zero/1.0/