Struct linera_views::views::map_view::ByteMapView

source ·
pub struct ByteMapView<C, V> { /* private fields */ }
Expand description

A view that supports inserting and removing values indexed by Vec<u8>.

Implementations§

source§

impl<C, V> ByteMapView<C, V>
where C: Context, ViewError: From<C::Error>,

source

pub fn insert(&mut self, short_key: Vec<u8>, value: V)

Inserts or resets the value of a key of the map.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
assert_eq!(map.keys().await.unwrap(), vec![vec![0, 1]]);
source

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

Removes a value. If absent then nothing is done.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], "Hello");
map.remove(vec![0, 1]);
source

pub fn remove_by_prefix(&mut self, key_prefix: Vec<u8>)

Removes a value. If absent then nothing is done.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
map.insert(vec![0, 2], String::from("Bonjour"));
map.remove_by_prefix(vec![0]);
assert!(map.keys().await.unwrap().is_empty());
source

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

Obtains the extra data.

source

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

Returns true if the map contains a value for the specified key.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
assert!(map.contains_key(&[0, 1]).await.unwrap());
assert!(!map.contains_key(&[0, 2]).await.unwrap());
source§

impl<C, V> ByteMapView<C, V>
where C: Context + Sync, ViewError: From<C::Error>, V: Clone + DeserializeOwned + 'static,

source

pub async fn get(&self, short_key: &[u8]) -> Result<Option<V>, ViewError>

Reads the value at the given position, if any.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
assert_eq!(map.get(&[0, 1]).await.unwrap(), Some(String::from("Hello")));
source

pub async fn multi_get( &self, short_keys: Vec<Vec<u8>>, ) -> Result<Vec<Option<V>>, ViewError>

Reads the values at the given positions, if any.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
let values = map.multi_get(vec![vec![0, 1], vec![0, 2]]).await.unwrap();
assert_eq!(values, vec![Some(String::from("Hello")), None]);
source

pub async fn get_mut( &mut self, short_key: &[u8], ) -> Result<Option<&mut V>, ViewError>

Obtains a mutable reference to a value at a given position if available.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
let value = map.get_mut(&[0, 1]).await.unwrap().unwrap();
assert_eq!(*value, String::from("Hello"));
*value = String::from("Hola");
assert_eq!(map.get(&[0, 1]).await.unwrap(), Some(String::from("Hola")));
source§

impl<C, V> ByteMapView<C, V>
where C: Context, ViewError: From<C::Error>, V: Clone + Serialize + DeserializeOwned + 'static,

source

pub async fn for_each_key_while<F>( &self, f: F, prefix: Vec<u8>, ) -> Result<(), ViewError>
where F: FnMut(&[u8]) -> Result<bool, ViewError> + Send,

Applies the function f on each index (aka key) which has the assigned prefix. Keys are visited in the lexicographic order. The shortened key is send to the function and if it returns false, then the loop exits

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
map.insert(vec![1, 2], String::from("Bonjour"));
map.insert(vec![1, 3], String::from("Bonjour"));
let prefix = vec![1];
let mut count = 0;
map.for_each_key_while(
    |_key| {
        count += 1;
        Ok(count < 3)
    },
    prefix,
)
.await
.unwrap();
assert_eq!(count, 2);
source

pub async fn for_each_key<F>( &self, f: F, prefix: Vec<u8>, ) -> Result<(), ViewError>
where F: FnMut(&[u8]) -> Result<(), ViewError> + Send,

Applies the function f on each index (aka key) having the specified prefix. The shortened keys are sent to the function f. Keys are visited in the lexicographic order.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
let mut count = 0;
let prefix = Vec::new();
map.for_each_key(
    |_key| {
        count += 1;
        Ok(())
    },
    prefix,
)
.await
.unwrap();
assert_eq!(count, 1);
source

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

Returns the list of keys of the map in lexicographic order.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
map.insert(vec![1, 2], String::from("Bonjour"));
map.insert(vec![2, 2], String::from("Hallo"));
assert_eq!(
    map.keys().await.unwrap(),
    vec![vec![0, 1], vec![1, 2], vec![2, 2]]
);
source

pub async fn keys_by_prefix( &self, prefix: Vec<u8>, ) -> Result<Vec<Vec<u8>>, ViewError>

Returns the list of keys of the map having a specified prefix in lexicographic order.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
map.insert(vec![1, 2], String::from("Bonjour"));
map.insert(vec![1, 3], String::from("Hallo"));
assert_eq!(
    map.keys_by_prefix(vec![1]).await.unwrap(),
    vec![vec![1, 2], vec![1, 3]]
);
source

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

Returns the number of keys of the map

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
map.insert(vec![1, 2], String::from("Bonjour"));
map.insert(vec![2, 2], String::from("Hallo"));
assert_eq!(map.count().await.unwrap(), 3);
source

pub async fn for_each_key_value_while<'a, F>( &'a self, f: F, prefix: Vec<u8>, ) -> Result<(), ViewError>
where F: FnMut(&[u8], Cow<'a, V>) -> Result<bool, ViewError> + Send,

Applies a function f on each index/value pair matching a prefix. Keys and values are visited in the lexicographic order. The shortened index is send to the function f and if it returns false then the loop ends prematurely

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
map.insert(vec![1, 2], String::from("Bonjour"));
map.insert(vec![1, 3], String::from("Hallo"));
let mut part_keys = Vec::new();
let prefix = vec![1];
map.for_each_key_value_while(
    |key, _value| {
        part_keys.push(key.to_vec());
        Ok(part_keys.len() < 2)
    },
    prefix,
)
.await
.unwrap();
assert_eq!(part_keys.len(), 2);
source

pub async fn for_each_key_value<'a, F>( &'a self, f: F, prefix: Vec<u8>, ) -> Result<(), ViewError>
where F: FnMut(&[u8], Cow<'a, V>) -> Result<(), ViewError> + Send,

Applies a function f on each key/value pair matching a prefix. The shortened key and value are send to the function f. Keys and values are visited in the lexicographic order.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
let mut count = 0;
let prefix = Vec::new();
map.for_each_key_value(
    |_key, _value| {
        count += 1;
        Ok(())
    },
    prefix,
)
.await
.unwrap();
assert_eq!(count, 1);
source§

impl<C, V> ByteMapView<C, V>
where C: Context, ViewError: From<C::Error>, V: Clone + Send + Serialize + DeserializeOwned + 'static,

source

pub async fn key_values_by_prefix( &self, prefix: Vec<u8>, ) -> Result<Vec<(Vec<u8>, V)>, ViewError>

Returns the list of keys and values of the map matching a prefix in lexicographic order.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![1, 2], String::from("Hello"));
let prefix = vec![1];
assert_eq!(
    map.key_values_by_prefix(prefix).await.unwrap(),
    vec![(vec![1, 2], String::from("Hello"))]
);
source

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

Returns the list of keys and values of the map in lexicographic order.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![1, 2], String::from("Hello"));
assert_eq!(
    map.key_values().await.unwrap(),
    vec![(vec![1, 2], String::from("Hello"))]
);
source§

impl<C, V> ByteMapView<C, V>
where C: Context + Sync, ViewError: From<C::Error>, V: Default + DeserializeOwned + 'static,

source

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

Obtains a mutable reference to a value at a given position. Default value if the index is missing.

let mut map = ByteMapView::load(context).await.unwrap();
map.insert(vec![0, 1], String::from("Hello"));
assert_eq!(map.get_mut_or_default(&[7]).await.unwrap(), "");
let value = map.get_mut_or_default(&[0, 1]).await.unwrap();
assert_eq!(*value, String::from("Hello"));
*value = String::from("Hola");
assert_eq!(map.get(&[0, 1]).await.unwrap(), Some(String::from("Hola")));

Trait Implementations§

source§

impl<C, V> ClonableView<C> for ByteMapView<C, V>
where C: Context + Send + Sync, ViewError: From<C::Error>, V: Clone + Send + Sync + Serialize,

source§

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.
source§

impl<C, V> ContainerType for ByteMapView<C, V>
where C: Context + Send + Sync, V: OutputType + Serialize + DeserializeOwned + Clone + Send + Sync + 'static,

source§

async fn resolve_field(&self, ctx: &Context<'_>) -> ServerResult<Option<Value>>

Resolves a field value and outputs it as a json value async_graphql::Value. Read more
source§

async fn find_entity( &self, ctx: &Context<'_>, params: &Value, ) -> ServerResult<Option<Value>>

Find the GraphQL entity with the given name from the parameter. Read more
source§

fn collect_all_fields<'a>( &'a self, ctx: &ContextBase<'a, &'a Positioned<SelectionSet>>, fields: &mut Fields<'a>, ) -> Result<(), ServerError>
where Self: Send + Sync,

Collect all the fields of the container that are queried in the selection set. Read more
source§

impl<C: Debug, V: Debug> Debug for ByteMapView<C, V>

source§

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

Formats the value using the given formatter. Read more
source§

impl<C, V> HashableView<C> for ByteMapView<C, V>
where C: Context + Send + Sync, ViewError: From<C::Error>, V: Clone + Send + Sync + Serialize + DeserializeOwned + 'static,

§

type Hasher = CoreWrapper<Sha3_256Core>

How to compute hashes.
source§

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. Read more
source§

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. Read more
source§

impl<C, V> OutputType for ByteMapView<C, V>
where C: Context + Send + Sync, V: OutputType + Serialize + DeserializeOwned + Clone + Send + Sync + 'static,

source§

fn type_name() -> Cow<'static, str>

Type the name.
source§

fn create_type_info(registry: &mut Registry) -> String

Create type information in the registry and return qualified typename.
source§

async fn resolve( &self, ctx: &ContextSelectionSet<'_>, _field: &Positioned<Field>, ) -> ServerResult<Value>

Resolve an output value to async_graphql::Value.
source§

fn qualified_type_name() -> String

Qualified typename.
source§

fn introspection_type_name(&self) -> Cow<'static, str>

Introspection type name Read more
source§

impl<C: Send + Sync, V: OutputType> TypeName for ByteMapView<C, V>

source§

fn type_name() -> Cow<'static, str>

Returns a GraphQL type name.
source§

impl<C, V> View<C> for ByteMapView<C, V>
where C: Context + Send + Sync, ViewError: From<C::Error>, V: Send + Sync + Serialize,

source§

const NUM_INIT_KEYS: usize = 0usize

The number of keys used for the initialization
source§

fn context(&self) -> &C

Obtains a mutable reference to the internal context.
source§

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

Creates the keys needed for loading the view
source§

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

Loads a view from the values
source§

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

Loads a view
source§

fn rollback(&mut self)

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

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.
source§

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.
source§

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.
source§

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

Builds a trivial view that is already deleted
source§

impl<C, V> ObjectType for ByteMapView<C, V>
where C: Context + Send + Sync, V: OutputType + Serialize + DeserializeOwned + Clone + Send + Sync + 'static,

Auto Trait Implementations§

§

impl<C, V> Freeze for ByteMapView<C, V>
where C: Freeze,

§

impl<C, V> RefUnwindSafe for ByteMapView<C, V>

§

impl<C, V> Send for ByteMapView<C, V>
where C: Send, V: Send,

§

impl<C, V> Sync for ByteMapView<C, V>
where C: Sync, V: Sync,

§

impl<C, V> Unpin for ByteMapView<C, V>
where C: Unpin,

§

impl<C, V> UnwindSafe for ByteMapView<C, V>

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> ArchivePointee for T

§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
source§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Choices> CoproductSubsetter<CNil, HNil> for Choices

§

type Remainder = Choices

source§

fn subset( self, ) -> Result<CNil, <Choices as CoproductSubsetter<CNil, HNil>>::Remainder>

Extract a subset of the possible types in a coproduct (or get the remaining possibilities) Read more
source§

impl<F, W, T, D> Deserialize<With<T, W>, D> for F
where W: DeserializeWith<F, T, D>, D: Fallible + ?Sized, F: ?Sized,

source§

fn deserialize( &self, deserializer: &mut D, ) -> Result<With<T, W>, <D as Fallible>::Error>

Deserializes using the given deserializer
source§

impl<To, From> DynInto<To> for From
where From: Into<To>,

source§

fn into_box(self: Box<From>) -> To

Converts a boxed object into the target type.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<Unshared, Shared> IntoShared<Shared> for Unshared
where Shared: FromUnshared<Unshared>,

source§

fn into_shared(self) -> Shared

Creates a shared type from an unshared type.
source§

impl<T> LayoutRaw for T

source§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>

Gets the layout of the type.
source§

impl<T, U, I> LiftInto<U, I> for T
where U: LiftFrom<T, I>,

source§

fn lift_into(self) -> U

Performs the indexed conversion.
source§

impl<T> MockResults for T

§

type Results = T

The mock native type of the results for the MockInstance.
source§

impl<T> Pointable for T

source§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Pointee for T

§

type Metadata = ()

The type for metadata in pointers and references to Self.
source§

impl<M, I> RuntimeMemory<&mut I> for M
where M: RuntimeMemory<I>,

source§

fn read<'instance>( &self, instance: &'instance &mut I, location: GuestPointer, length: u32, ) -> Result<Cow<'instance, [u8]>, RuntimeError>

Reads length bytes from memory from the provided location.

source§

fn write( &mut self, instance: &mut &mut I, location: GuestPointer, bytes: &[u8], ) -> Result<(), RuntimeError>

Writes the bytes to memory at the provided location.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<Source> Sculptor<HNil, HNil> for Source

§

type Remainder = Source

source§

fn sculpt(self) -> (HNil, <Source as Sculptor<HNil, HNil>>::Remainder)

Consumes the current HList and returns an HList with the requested shape. Read more
source§

impl<AnyTail> Split<HNil> for AnyTail

§

type Remainder = AnyTail

The tail of remaining elements after splitting up the list.
source§

fn split(self) -> (HNil, <AnyTail as Split<HNil>>::Remainder)

Splits the current heterogeneous list in two.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> Upcastable for T
where T: Any + Send + Sync + 'static,

source§

fn upcast_any_ref(&self) -> &(dyn Any + 'static)

upcast ref
source§

fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)

upcast mut ref
source§

fn upcast_any_box(self: Box<T>) -> Box<dyn Any>

upcast boxed dyn
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<T> ErasedDestructor for T
where T: 'static,

source§

impl<T> MaybeSendSync for T

source§

impl<T> Post for T
where T: Send + Sync,