Struct Art

pub struct Art<ValueType, const KEY_LENGTH: usize> { /* private fields */ }

An Adaptive Radix Trie (ART) for fixed-length keys.

Implementations

impl<V, const K: usize> Art<V, K>

pub const fn new() -> Art<V, K>

pub const fn len(&self) -> usize

pub const fn is_empty(&self) -> bool

pub fn insert(&mut self, key: [u8; K], value: V) -> Option<V>

pub fn remove(&mut self, key: &[u8; K]) -> Option<V>

pub fn get(&self, key: &[u8; K]) -> Option<&V>

pub fn iter(&self) -> Iter<'_, V, K>

pub fn range<'a, R>(&'a self, range: R) -> Iter<'a, V, K>

where R: RangeBounds<[u8; K]>,

Trait Implementations

impl<ValueType: Clone, const KEY_LENGTH: usize> Clone for Art<ValueType, KEY_LENGTH>

fn clone(&self) -> Art<ValueType, KEY_LENGTH>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<V: Debug, const K: usize> Debug for Art<V, K>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<V, const K: usize> Default for Art<V, K>

fn default() -> Art<V, K>

Returns the “default value” for a type.

impl<V, const K: usize> FromIterator<([u8; K], V)> for Art<V, K>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = ([u8; K], V)>,

Creates a value from an iterator.

impl<'a, V, const K: usize> IntoIterator for &'a Art<V, K>

type IntoIter = Iter<'a, V, K>

Which kind of iterator are we turning this into?

type Item = ([u8; K], &'a V)

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<V: PartialEq, const K: usize> PartialEq for Art<V, K>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<V: Eq, const K: usize> Eq for Art<V, K>