Crate blart

Source
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Β§

ModulesΒ§

  • alloc πŸ”’
  • bytes πŸ”’
  • collections πŸ”’
  • Module containing implementations of the TreeMap and associated iterators/etc.
  • Trie node representation and manipulation
  • Module containing copies of Rust standard library unstable functions for use outside of the nightly distribution.
  • tagged_pointer πŸ”’
    A tagged pointer is a pointer (concretely a memory address) with additional data associated with it, such as an indirection bit or reference count. This additional data is often β€œfolded” into the pointer, meaning stored inline in the data representing the address, taking advantage of certain properties of memory addressing.

StructsΒ§

  • This type implements a BytesMapping for tuples of types, concatenating their byte representations together.
  • This type implements a BytesMapping that preserves the original type without converting it to bytes.
  • A container for the bytestring that is produced from BytesMapping conversion
  • 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.
  • This struct represents a conversion of IP addresses (V4 and V6) into their component bytes.
  • 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.
  • An ordered map based on an adaptive radix tree.

TraitsΒ§

  • Any type implementing AsBytes can be decomposed into bytes.
  • Trait representing a reversible conversion from a type to some sort of byte string.
  • 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.
  • 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 by Ord).