Crate radix_trees

This crate contains various implementations of radix trees (also called tries), which provide efficient storage and lookup of data that shares long common prefixes.

Modules

ptree

An implementation of a Patricia tree that provides associative storage via PTreeMap.

Macros

impl_from_zerocopy

Safely implement TrieKey for a type which already implements IntoBytes + Immutable.

Traits

Equivalent

Key equivalence trait.

TrieKey

Trait definition for keys which are suitable to use in one of this crate’s tries.