pub struct RecordingMap<K, V> { /* private fields */ }Expand description
A RecordingMap that records read requests to the underlying key-value map.
The data recorder is used to generate a proof for read requests.
The RecordingMap is composed of three parts:
data: which contains the current set of key-value pairs in the map.updates: which tracks keys for which values have been changed since the map was instantiated. updates include both insertions, removals and updates of values under existing keys.trace: which contains the key-value pairs from the original data which have been accesses since the map was instantiated.
Implementations§
Source§impl<K, V> RecordingMap<K, V>
impl<K, V> RecordingMap<K, V>
Sourcepub fn new(init: impl IntoIterator<Item = (K, V)>) -> RecordingMap<K, V>
pub fn new(init: impl IntoIterator<Item = (K, V)>) -> RecordingMap<K, V>
Returns a new RecordingMap instance initialized with the provided key-value pairs. (BTreeMap).
pub fn inner(&self) -> &BTreeMap<K, V>
Sourcepub fn finalize(self) -> (BTreeMap<K, V>, BTreeMap<K, V>)
pub fn finalize(self) -> (BTreeMap<K, V>, BTreeMap<K, V>)
Consumes the RecordingMap and returns a (BTreeMap, BTreeMap) tuple. The first
element of the tuple is a map that represents the state of the map at the time .finalize()
is called. The second element contains the key-value pairs from the initial data set that
were read during recording.
Trait Implementations§
Source§impl<K, V> Clone for RecordingMap<K, V>
impl<K, V> Clone for RecordingMap<K, V>
Source§fn clone(&self) -> RecordingMap<K, V>
fn clone(&self) -> RecordingMap<K, V>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<K, V> Debug for RecordingMap<K, V>
impl<K, V> Debug for RecordingMap<K, V>
Source§impl<K, V> Default for RecordingMap<K, V>
impl<K, V> Default for RecordingMap<K, V>
Source§fn default() -> RecordingMap<K, V>
fn default() -> RecordingMap<K, V>
Source§impl<K, V> Extend<(K, V)> for RecordingMap<K, V>
impl<K, V> Extend<(K, V)> for RecordingMap<K, V>
Source§fn extend<T>(&mut self, iter: T)where
T: IntoIterator<Item = (K, V)>,
fn extend<T>(&mut self, iter: T)where
T: IntoIterator<Item = (K, V)>,
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one)Source§impl<K, V> FromIterator<(K, V)> for RecordingMap<K, V>
impl<K, V> FromIterator<(K, V)> for RecordingMap<K, V>
Source§fn from_iter<T>(iter: T) -> RecordingMap<K, V>where
T: IntoIterator<Item = (K, V)>,
fn from_iter<T>(iter: T) -> RecordingMap<K, V>where
T: IntoIterator<Item = (K, V)>,
Source§impl<K, V> IntoIterator for RecordingMap<K, V>
impl<K, V> IntoIterator for RecordingMap<K, V>
Source§impl<K, V> KvMap<K, V> for RecordingMap<K, V>
impl<K, V> KvMap<K, V> for RecordingMap<K, V>
Source§fn get(&self, key: &K) -> Option<&V>
fn get(&self, key: &K) -> Option<&V>
Returns a reference to the value associated with the given key if the value exists.
If the key is part of the initial data set, the key access is recorded.
Source§fn contains_key(&self, key: &K) -> bool
fn contains_key(&self, key: &K) -> bool
Returns a boolean to indicate whether the given key exists in the data set.
If the key is part of the initial data set, the key access is recorded.
Source§fn insert(&mut self, key: K, value: V) -> Option<V>
fn insert(&mut self, key: K, value: V) -> Option<V>
Inserts a key-value pair into the data set.
If the key already exists in the data set, the value is updated and the old value is returned.
Source§fn remove(&mut self, key: &K) -> Option<V>
fn remove(&mut self, key: &K) -> Option<V>
Removes a key-value pair from the data set.
If the key exists in the data set, the old value is returned.
Source§fn iter(&self) -> Box<dyn Iterator<Item = (&K, &V)> + '_>
fn iter(&self) -> Box<dyn Iterator<Item = (&K, &V)> + '_>
Returns an iterator over the key-value pairs in the data set.