Struct mvhashmap::MVHashMap

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

Implementations

impl<K: Hash + Clone + Eq, V> MVHashMap<K, V>

pub fn new_from(possible_writes: Vec<(K, Version)>) -> (Self, usize)

Create the MVHashMap structure from a list of possible writes. Each element in the list indicates a key that could potentially be modified at its given version.

Returns the MVHashMap, and the maximum number of writes that can write to one single key.

pub fn len(&self) -> usize

Get the number of keys in the MVHashMap.

pub fn write(&self, key: &K, version: Version, data: V) -> Result<(), Error>

Write to key at version. Function will return an error if the write is not in the initial possible_writes list.

pub fn skip_if_not_set(&self, key: &K, version: Version) -> Result<(), Error>

Skips writing to key at version if that entry hasn’t been assigned. Function will return an error if the write is not in the initial possible_writes list.

pub fn skip(&self, key: &K, version: Version) -> Result<(), Error>

Skips writing to key at version. Function will return an error if the write is not in the initial possible_writes list. skip should only be invoked when key at version hasn’t been assigned.

pub fn read(&self, key: &K, version: Version) -> Result<&V, Option<Version>>

Get the value of key at version. Returns Ok(val) if such key is already assigned by previous transactions. Returns Err(None) if version is smaller than the write of all previous versions. Returns Err(Some(version)) if such key is dependent on the version-th transaction.

pub fn view(&self, version: Version) -> MVHashMapView<'_, K, V>

impl<K, V> MVHashMap<K, V>where K: PartialOrd + Send + Clone + Hash + Eq, V: Send,

pub fn new_from_parallel(possible_writes: Vec<(K, Version)>) -> (Self, usize)

Create the MVHashMap structure from a list of possible writes in parallel.