Struct SharedBTreeMap 

pub struct SharedBTreeMap<K: Copy + Ord + Default + 'static, V: Copy + Default + 'static> { /* private fields */ }

Implementations

impl<K: Copy + Ord + Default + 'static, V: Copy + Default + 'static> SharedBTreeMap<K, V>

pub fn create( path: impl AsRef<Path>, capacity: usize, ) -> Result<Self, BTreeError>

Obtain the map at path, initializing an empty one if the path does not yet exist and attaching to it if it does. Attaching leaves the live tree in place; a region built with a different capacity is a LayoutMismatch. reset reinitializes.

pub fn reset( path: impl AsRef<Path>, capacity: usize, ) -> Result<Self, BTreeError>

Truncate the map at path and initialize an empty one, discarding the tree live peers share. For a caller that knows it owns the path.

pub fn open( path: impl AsRef<Path>, expected_capacity: usize, ) -> Result<Self, BTreeError>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize

pub fn node_count(&self) -> usize

Number of nodes bump-allocated so far (resident-memory witness: node_count() * size_of::<BTreeNode>()).

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

Look up key. Lock-free read against a quiescent tree.

pub fn contains_key(&self, key: &K) -> bool

True if key is present.

pub fn insert(&self, key: K, value: V) -> Result<Option<V>, BTreeError>

Insert / update. Single-writer (serialise externally). Returns the previous value if key was present.

pub fn remove(&self, key: &K) -> Result<Option<V>, BTreeError>

Remove key, returning its previous value if present. Single-writer (serialise externally, as with insert).

pub fn first(&self) -> Option<(K, V)>

Smallest (key, value) in the map, or None if empty.

pub fn iter_ascending(&self) -> Vec<(K, V)>

Collect all (K, V) in ascending key order (validation / iteration).

pub fn flush(&self) -> Result<(), BTreeError>

Trait Implementations

impl<K: Copy + Ord + Default + Send + Sync + 'static, V: Copy + Default + Send + Sync + 'static> AdaptiveInstance for SharedBTreeMap<K, V>

fn header(&self) -> &HandshakeHeader

fn ring(&self) -> &ObservationRing

fn make_policy(&self) -> Box<dyn Policy>

fn apply_migration(&self, new_tag: u32)

Called by the sidecar when the policy returns a new strategy tag. Default implementation: just set the tag on the header. Primitives that need heavier migration (data-layout swap) override this to perform the swap before (or after) updating the tag.

impl<K: Copy + Ord + Default + Send + 'static, V: Copy + Default + Send + 'static> Send for SharedBTreeMap<K, V>

impl<K: Copy + Ord + Default + Sync + 'static, V: Copy + Default + Sync + 'static> Sync for SharedBTreeMap<K, V>