Expand description
Adaptive radix trie implementation
§References
- Leis, V., Kemper, A., & Neumann, T. (2013, April). The adaptive radix tree: ARTful indexing for main-memory databases. In 2013 IEEE 29th International Conference on Data Engineering (ICDE) (pp. 38-49). IEEE. Link to PDF
Re-exports§
pub use raw::visitor;
Modules§
- map
- Module containing implementations of the
TreeMapand associated iterators/etc. - raw
- Trie node representation and manipulation
Structs§
- Concat
Tuple - This type implements a
BytesMappingfor tuples of types, concatenating their byte representations together. - Identity
- This type implements a
BytesMappingthat preserves the original type without converting it to bytes. - Mapped
- A container for the bytestring that is produced from
BytesMappingconversion - ToIBE
- This struct represents a conversion of signed integers to a format that allows the natural ordering of the numbers to match the lexicographic ordering of the bytes.
- ToOctets
- This struct represents a conversion of IP addresses (V4 and V6) into their component bytes.
- ToUBE
- This struct represents a conversion of unsigned integers to the big endian format, so that the natural ordering of the numbers matches the lexicographic ordering of the bytes.
- TreeMap
- An ordered map based on an adaptive radix tree.
Traits§
- AsBytes
- Any type implementing
AsBytescan be decomposed into bytes. - Bytes
Mapping - Trait representing a reversible conversion from a type to some sort of byte string.
- NoPrefixes
Bytes - This trait is used to mark types which have a byte representation which is guaranteed to not be a prefix of any other value of the same type.
- Ordered
Bytes - This trait is used to mark types where the lexicographic ordering of their
byte representation (as output by
AsBytes::as_bytes) matches their normal ordering (as determined byOrd).