Struct DeltaBTreeMap

pub struct DeltaBTreeMap<'a, K: Ord, V> {
    pub(crate) snapshot: &'a BTreeMap<K, V>,
    pub(crate) delta: &'a BTreeMap<K, Change<V>>,
    pub(crate) first_key: Option<&'a K>,
    pub(crate) last_key: Option<&'a K>,
}

DeltaBTreeMap wraps two BTreeMap references respectively as snapshot and delta, providing cursor that can iterate over the updated version of the snapshot.

Fields

snapshot: &'a BTreeMap<K, V>

delta: &'a BTreeMap<K, Change<V>>

first_key: Option<&'a K>

last_key: Option<&'a K>

Implementations

impl<'a, K: Ord, V> DeltaBTreeMap<'a, K, V>

pub fn new( snapshot: &'a BTreeMap<K, V>, delta: &'a BTreeMap<K, Change<V>>, ) -> Self

Create a new DeltaBTreeMap from the given snapshot and delta. Best case time complexity: O(1), worst case time complexity: O(m), where m is delta.len().

pub fn snapshot(&self) -> &'a BTreeMap<K, V>

Get a reference to the snapshot.

pub fn delta(&self) -> &'a BTreeMap<K, Change<V>>

Get a reference to the delta.

pub fn first_key(&self) -> Option<&'a K>

Get the first key in the updated version of the snapshot. Complexity: O(1).

pub fn last_key(&self) -> Option<&'a K>

Get the last key in the updated version of the snapshot. Complexity: O(1).

pub fn before(&self, key: &K) -> Option<CursorWithDelta<'a, K, V>>

Get a CursorWithDelta pointing at the gap before the given given key. If the given key is not found in either the snapshot or the delta, None is returned.

pub fn after(&self, key: &K) -> Option<CursorWithDelta<'a, K, V>>

Get a CursorWithDelta pointing at the gap after the given given key. If the given key is not found in either the snapshot or the delta, None is returned.

pub fn lower_bound(&self, bound: Bound<&K>) -> CursorWithDelta<'a, K, V>

Get a CursorWithDelta pointing at the gap before the smallest key greater than the given bound.

pub fn upper_bound(&self, bound: Bound<&K>) -> CursorWithDelta<'a, K, V>

Get a CursorWithDelta pointing at the gap after the greatest key smaller than the given bound.

Trait Implementations

impl<'a, K: Ord, V> Clone for DeltaBTreeMap<'a, K, V>

where &'a BTreeMap<K, V>: Copy, &'a BTreeMap<K, Change<V>>: Copy, Option<&'a K>: Copy,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, K: Debug + Ord, V: Debug> Debug for DeltaBTreeMap<'a, K, V>

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

Formats the value using the given formatter.

impl<'a, K: Ord, V> Copy for DeltaBTreeMap<'a, K, V>

where &'a BTreeMap<K, V>: Copy, &'a BTreeMap<K, Change<V>>: Copy, Option<&'a K>: Copy,