//! This crate contains various implementations of radix trees (also called tries),
//! which provide efficient storage and lookup of data that shares long common prefixes.
#![no_std]modkey_trait;pubmodptree;externcrate alloc;#[cfg(feature ="std")]externcrate std;pubusecrate::key_trait::*;