Struct ConcurrentART 

pub struct ConcurrentART { /* private fields */ }

Concurrent Adaptive Radix Tree

Provides lock-free read operations and CAS-based write operations. Uses epoch-based reclamation for safe memory management.

Implementations

impl ConcurrentART

pub fn new() -> Self

Create a new empty ART

pub fn get(&self, key: &[u8]) -> Option<(Option<Vec<u8>>, u64)>

Get a value by key (lock-free)

Returns the value and sequence number if found.

pub fn insert( &self, key: Vec<u8>, value: Option<Vec<u8>>, seqno: u64, ) -> Option<(Option<Vec<u8>>, u64)>

Insert a key-value pair

Returns the old value if the key existed.

pub fn len(&self) -> u64

Get approximate size

pub fn is_empty(&self) -> bool

Check if empty

pub fn memory_usage(&self) -> u64

Get approximate memory usage

Trait Implementations

impl Default for ConcurrentART

fn default() -> Self

Returns the “default value” for a type.