Struct splinter::sets::mem::DurableBTreeSet

pub struct DurableBTreeSet<V: Ord + Send> { /* fields omitted */ }

An in-memory, DurableOrderedSet, backed by a BTreeSet.

This set is bounded, where in it will drop the first item in the set, based on the natural order of the items stored.

Implementations

impl<V: Ord + Send> DurableBTreeSet<V>

pub fn new_boxed<Index>() -> Box<dyn DurableOrderedSet<V, Index>> where
    Index: Ord + Send + Clone,
    V: Send + Ord + Borrow<Index> + Clone + 'static, 

pub fn new_boxed_with_bound<Index>(
    bound: NonZeroUsize
) -> Box<dyn DurableOrderedSet<V, Index>> where
    Index: Ord + Send + Clone,
    V: Send + Ord + Borrow<Index> + Clone + 'static, 

Trait Implementations

impl<V: Clone + Ord + Send> Clone for DurableBTreeSet<V>

fn clone(&self) -> DurableBTreeSet<V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<V: Default + Ord + Send> Default for DurableBTreeSet<V>

fn default() -> DurableBTreeSet<V>

Returns the “default value” for a type.

impl<V, Index> DurableOrderedSet<V, Index> for DurableBTreeSet<V> where
    Index: Ord + Send,
    V: Send + Ord + Borrow<Index> + Clone + 'static, 

fn range_iter<'a>(
    &'a self,
    range: DurableRange<&Index>
) -> Result<Box<dyn Iterator<Item = Self::Item> + 'a>, DurableSetError>

Returns an iterator over a range

fn get_by_index(
    &self,
    index_value: &Index
) -> Result<Option<Self::Item>, DurableSetError>

Get a value based on the index.

fn contains_by_index(
    &self,
    index_value: &Index
) -> Result<bool, DurableSetError>

Check for the existence of a value based on the index.

fn first(&self) -> Result<Option<Self::Item>, DurableSetError>

Returns the first item in the set, based on the natural Item order.

fn last(&self) -> Result<Option<Self::Item>, DurableSetError>

Returns the last item in the set, based on the natural Item order.

fn clone_boxed_ordered_set(&self) -> Box<dyn DurableOrderedSet<V, Index>>

Clones this instance into a boxed durable ordered set.

impl<V> DurableSet for DurableBTreeSet<V> where
    V: Send + Ord + Clone, 

fn add(&mut self, item: Self::Item) -> Result<(), DurableSetError>

Add an item to the set.

fn remove(
    &mut self,
    item: &Self::Item
) -> Result<Option<Self::Item>, DurableSetError>

Remove an item to the set.

type Item = V

fn iter<'a>(
    &'a self
) -> Result<Box<dyn Iterator<Item = Self::Item> + 'a>, DurableSetError>

Returns an iterator over the contents of the set.

fn contains(&self, item: &Self::Item) -> Result<bool, DurableSetError>

Get a value based on the query item.

fn len(&self) -> Result<u64, DurableSetError>

Returns the count of the values in the set.

fn is_empty(&self) -> Result<bool, DurableSetError>