Struct Loaded 

pub struct Loaded<K, V> { /* private fields */ }

A tree loaded in memory.

Trait Implementations

impl<K, V> Change for Loaded<K, V>

where K: 'static + Clone + Send + Sync + Ord, V: 'static + Clone + Send + Sync,

type Key = K

The type of key that is used on inserts and removals.

type Value = V

The type of value expected on removal.

type Insert = V

The type of value expected on inserts.

fn insert_owned( &self, key: K, value: V, ) -> Result<Option<<Self as Change>::Value>>

Inserts an owned key-value pair into the tree.

fn remove_ref( &self, key: &<Self as Change>::Key, ) -> Result<Option<<Self as Change>::Value>>

Removes a key reference.

fn clear(&self) -> Result<()>

Clears the tree.

fn fetch_and_update( &self, key: &Self::Key, f: impl FnMut(Option<Self::Value>) -> Option<Self::Value>, ) -> Result<Option<Self::Value>>

Updates an entry atomically

fn insert_ref( &self, key: &Self::Key, value: &Self::Insert, ) -> Result<Option<<Self as Change>::Value>>

Inserts a reference key-value pair into the tree.

fn insert<IK: Into<Self::Key>, IV: Into<Self::Insert>>( &self, key: IK, value: IV, ) -> Result<Option<<Self as Change>::Value>>

Inserts a key-value pair into the tree.

fn entry_ref<'a>( &'a self, key: &'a <Self as Change>::Key, ) -> Result<Entry<'a, Self>>

where Self: View + Change<Key = <Self as View>::Key, Value = <Self as View>::Value, Insert = <Self as View>::Value>,

Gets an Entry from a key reference.

fn entry<K: Into<<Self as Change>::Key>>( &self, key: K, ) -> Result<Entry<'_, Self>>

where Self: View + Change<Key = <Self as View>::Key, Value = <Self as View>::Value, Insert = <Self as View>::Value>,

Gets an Entry from a key.

fn push_owned(&self, value: <Self as Change>::Insert) -> Result<()>

where Self: View<Key = <Self as Change>::Key>, <Self as View>::Key: AutoInc + Ord,

Pushes a value onto the end of the tree.

fn push<V>(&self, value: V) -> Result<()>

where Self: View<Key = <Self as Change>::Key>, <Self as View>::Key: AutoInc + Ord, V: Into<<Self as Change>::Insert>,

Pushes a value onto the end of the tree.

fn remove_owned( &self, key: <Self as Change>::Key, ) -> Result<Option<<Self as Change>::Value>>

Removes an owned key.

fn remove<K: Into<Self::Key>>( &self, key: K, ) -> Result<Option<<Self as Change>::Value>>

Removes a key.

impl<K, V> Clone for Loaded<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> View for Loaded<K, V>

where K: 'static + Clone + Send + Sync + Ord, V: 'static + Clone + Send + Sync,

type Key = K

The key used on fetch.

type Value = V

The value expected on fetch.

type Iter = Box<dyn Iterator<Item = Result<(K, V), Error>>>

The type of iterator returned by iter.

fn get_ref(&self, key: &Self::Key) -> Result<Option<Self::Value>>

Gets a value from a key by reference.

fn iter(&self) -> Self::Iter

Gets an iterator over the entries in the tree.

fn contains_key_ref(&self, key: &Self::Key) -> Result<bool>

Checks if tree contains a key by reference.

fn get_lt_ref( &self, key: &Self::Key, ) -> Result<Option<(Self::Key, Self::Value)>>

Gets the immediate lesser item by key reference.

fn get_gt_ref( &self, key: &Self::Key, ) -> Result<Option<(Self::Key, Self::Value)>>

Gets the immediate greater item by key reference.

fn first(&self) -> Result<Option<(Self::Key, Self::Value)>>

Gets the first item.

fn last(&self) -> Result<Option<(Self::Key, Self::Value)>>

Gets the last item.

fn is_empty(&self) -> Option<bool>

Checks if tree is empty

fn range(&self, range: impl RangeBounds<Self::Key>) -> Result<Self::Iter>

Gets an iterator over a key range in the tree

fn get<K: Into<Self::Key>>(&self, key: K) -> Result<Option<Self::Value>>

Gets a value from a key.

fn contains_key<K: Into<Self::Key>>(&self, key: K) -> Result<bool>

Checks if tree contains a key.

fn get_lt<K: Into<Self::Key>>( &self, key: K, ) -> Result<Option<(Self::Key, Self::Value)>>

where Self::Key: Ord,

Gets the immediate lesser item by key.

fn get_gt<K: Into<Self::Key>>( &self, key: K, ) -> Result<Option<(Self::Key, Self::Value)>>

where Self::Key: Ord,

Gets the immediate greater item by key.