Expand description
A treebitmap based IP Prefix Store IP prefixes storage and retrieval data structures for IPv4 and IPv6 prefixes. This crate contains structures for both single and multi-threaded contexts, as well as async contexts.
The underlying tree structure is based on the tree bitmap as outlined in this paper.
Part of the Rotonda modular BGP engine. Read more about the data-structure in this blog post.
Re-exports§
pub use crossbeam_epoch as epoch;
Modules§
- IP address resources.
- Some simple metadata implementations
- Statistics for the two trees (IPv4 and IPv6).
Structs§
- A guard that keeps the current thread pinned.
- The publicly available devices Options for the
match_prefix
method - A concurrently read/writable, lock-free Prefix Store, for use in a multi-threaded context.
- The publicly available devices
- The publicly available devices The type that is returned by a query.
- A fast, memory-efficient Prefix Store, for use in single-threaded contexts.
- The publicly available devices
- The publicly available devices
Enums§
- The publicly available devices
Constants§
- The publicly available devices
Traits§
- The address family of an IP address as a Trait.
- Trait that describes how an existing record gets merged
Type Aliases§
- Exactly fitting IPv4 bytes (4 octets).
- Exactly fitting IPv6 bytes (16 octets).