Struct linera_views::views::collection_view::ByteCollectionView

pub struct ByteCollectionView<C, W> { /* private fields */ }

A view that supports accessing a collection of views of the same kind, indexed by a Vec<u8>, one subview at a time.

Implementations

impl<C, W> ByteCollectionView<C, W>

where C: Context + Send, ViewError: From<C::Error>, W: View<C>,

pub async fn load_entry_mut( &mut self, short_key: &[u8], ) -> Result<&mut W, ViewError>

Loads a subview for the data at the given index in the collection. If an entry is absent then a default entry is added to the collection. The resulting view can be modified.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
let subview = view.load_entry_mut(&[0, 1]).await.unwrap();
let value = subview.get();
assert_eq!(*value, String::default());

pub async fn load_entry_or_insert( &mut self, short_key: &[u8], ) -> Result<&W, ViewError>

Loads a subview for the data at the given index in the collection. If an entry is absent then a default entry is added to the collection. The resulting view is read-only.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
view.load_entry_mut(&[0, 1]).await.unwrap();
let subview = view.load_entry_or_insert(&[0, 1]).await.unwrap();
let value = subview.get();
assert_eq!(*value, String::default());

pub async fn try_load_entry( &self, short_key: &[u8], ) -> Result<Option<ReadGuardedView<'_, W>>, ViewError>

Loads a subview for the data at the given index in the collection. If an entry is absent then None is returned. The resulting view cannot be modified. May fail if one subview is already being visited.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
{
    let _subview = view.load_entry_or_insert(&[0, 1]).await.unwrap();
}
{
    let subview = view.try_load_entry(&[0, 1]).await.unwrap().unwrap();
    let value = subview.get();
    assert_eq!(*value, String::default());
}
assert!(view.try_load_entry(&[0, 2]).await.unwrap().is_none());

pub fn reset_entry_to_default( &mut self, short_key: &[u8], ) -> Result<(), ViewError>

Resets an entry to the default value.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
let subview = view.load_entry_mut(&[0, 1]).await.unwrap();
let value = subview.get_mut();
*value = String::from("Hello");
view.reset_entry_to_default(&[0, 1]).unwrap();
let subview = view.load_entry_mut(&[0, 1]).await.unwrap();
let value = subview.get_mut();
assert_eq!(*value, String::default());

pub async fn contains_key(&self, short_key: &[u8]) -> Result<bool, ViewError>

Tests if the collection contains a specified key and returns a boolean.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
{
    let _subview = view.load_entry_mut(&[0, 1]).await.unwrap();
}
assert!(view.contains_key(&[0, 1]).await.unwrap());
assert!(!view.contains_key(&[0, 2]).await.unwrap());

pub fn remove_entry(&mut self, short_key: Vec<u8>)

Marks the entry as removed. If absent then nothing is done.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
let subview = view.load_entry_mut(&[0, 1]).await.unwrap();
let value = subview.get_mut();
assert_eq!(*value, String::default());
view.remove_entry(vec![0, 1]);
let keys = view.keys().await.unwrap();
assert_eq!(keys.len(), 0);

pub fn extra(&self) -> &C::Extra

Gets the extra data.

impl<C, W> ByteCollectionView<C, W>

where C: Context + Send, ViewError: From<C::Error>, W: View<C> + Sync,

pub async fn for_each_key_while<F>(&self, f: F) -> Result<(), ViewError>

where F: FnMut(&[u8]) -> Result<bool, ViewError> + Send,

Applies a function f on each index (aka key). Keys are visited in the lexicographic order. If the function returns false, then the loop ends prematurely.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
view.load_entry_mut(&[0, 1]).await.unwrap();
view.load_entry_mut(&[0, 2]).await.unwrap();
let mut count = 0;
view.for_each_key_while(|_key| {
    count += 1;
    Ok(count < 1)
})
.await
.unwrap();
assert_eq!(count, 1);

pub async fn for_each_key<F>(&self, f: F) -> Result<(), ViewError>

where F: FnMut(&[u8]) -> Result<(), ViewError> + Send,

Applies a function f on each index (aka key). Keys are visited in a lexicographic order.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
view.load_entry_mut(&[0, 1]).await.unwrap();
view.load_entry_mut(&[0, 2]).await.unwrap();
let mut count = 0;
view.for_each_key(|_key| {
    count += 1;
    Ok(())
})
.await
.unwrap();
assert_eq!(count, 2);

pub async fn keys(&self) -> Result<Vec<Vec<u8>>, ViewError>

Returns the list of keys in the collection. The order is lexicographic.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
view.load_entry_mut(&[0, 1]).await.unwrap();
view.load_entry_mut(&[0, 2]).await.unwrap();
let keys = view.keys().await.unwrap();
assert_eq!(keys, vec![vec![0, 1], vec![0, 2]]);

pub async fn count(&self) -> Result<usize, ViewError>

Returns the number of entries in the collection.

let mut view: ByteCollectionView<_, RegisterView<_, String>> =
    ByteCollectionView::load(context).await.unwrap();
view.load_entry_mut(&[0, 1]).await.unwrap();
view.load_entry_mut(&[0, 2]).await.unwrap();
assert_eq!(view.count().await.unwrap(), 2);

Trait Implementations

impl<C, W> ClonableView<C> for ByteCollectionView<C, W>

where C: Context + Send + Sync, ViewError: From<C::Error>, W: ClonableView<C> + Send + Sync,

fn clone_unchecked(&mut self) -> Result<Self, ViewError>

Creates a clone of this view, sharing the underlying storage context but prone to data races which can corrupt the view state.

impl<C: Debug, W: Debug> Debug for ByteCollectionView<C, W>

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

Formats the value using the given formatter.

impl<C, W> HashableView<C> for ByteCollectionView<C, W>

where C: Context + Send + Sync, ViewError: From<C::Error>, W: HashableView<C> + Send + Sync + 'static,

type Hasher = CoreWrapper<Sha3_256Core>

How to compute hashes.

fn hash_mut<'life0, 'async_trait>( &'life0 mut self, ) -> Pin<Box<dyn Future<Output = Result<<Self::Hasher as Hasher>::Output, ViewError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Computes the hash of the values.

fn hash<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<<Self::Hasher as Hasher>::Output, ViewError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Computes the hash of the values.

impl<C, W> View<C> for ByteCollectionView<C, W>

where C: Context + Send + Sync, ViewError: From<C::Error>, W: View<C> + Send + Sync,

const NUM_INIT_KEYS: usize = 0usize

The number of keys used for the initialization

fn context(&self) -> &C

Obtains a mutable reference to the internal context.

fn pre_load(_context: &C) -> Result<Vec<Vec<u8>>, ViewError>

Creates the keys needed for loading the view

fn post_load(context: C, _values: &[Option<Vec<u8>>]) -> Result<Self, ViewError>

Loads a view from the values

fn load<'async_trait>( context: C, ) -> Pin<Box<dyn Future<Output = Result<Self, ViewError>> + Send + 'async_trait>>

where Self: 'async_trait,

Loads a view

fn rollback(&mut self)

Discards all pending changes. After that flush should have no effect to storage.

fn has_pending_changes<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = bool> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Returns true if flushing this view would result in changes to the persistent storage.

fn flush(&mut self, batch: &mut Batch) -> Result<bool, ViewError>

Persists changes to storage. This leaves the view still usable and is essentially neutral to the program running. Crash-resistant storage implementations are expected to accumulate the desired changes in the batch variable first. If the view is dropped without calling flush, staged changes are simply lost. The returned boolean indicates whether the operation removes the view or not.

fn clear(&mut self)

Clears the view. That can be seen as resetting to default. If the clear is followed by a flush then all the relevant data is removed on the storage.

fn new(context: C) -> Result<Self, ViewError>

Builds a trivial view that is already deleted