Struct HashMapStorage

pub struct HashMapStorage<K, Hasher = FxBuildHasher>
where
    K: OutputType + Eq + Hash,
    Hasher: BuildHasher,
{ /* private fields */ }

Trait Implementations

impl<K, H> Default for HashMapStorage<K, H>

where K: OutputType + Eq + Hash, H: Default + BuildHasher,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K, H> Deserialize<'de> for HashMapStorage<K, H>

where K: Deserialize<'de> + Hash + Eq + OutputType + Clone, K::Output: Deserialize<'de>, H: Default + BuildHasher,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, H> Serialize for HashMapStorage<K, H>

where K: Serialize + OutputType + Eq + Hash + Clone, K::Output: Serialize + Clone, H: BuildHasher,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<K, H> StorageFor<K> for HashMapStorage<K, H>

where K: Clone + Eq + Hash + OutputType, K::Output: Eq + Clone, H: BuildHasher,

fn get_cell_for_computation(&self, key: &K) -> Option<Cell>

Given a computation key, return the cell associated with it, if it exists.

fn insert_new_cell(&self, cell: Cell, key: K)

Insert a new Cell with the given computation that has yet to be run

fn get_input(&self, cell: Cell) -> K

Retrieve the input for this computation. The input is expected to already be inserted into this storage.

fn get_output(&self, cell: Cell) -> Option<K::Output>

Retrieve the output for the given cell, if it exists

fn update_output(&self, cell: Cell, new_value: K::Output) -> bool

C has been re-run and has returned the output new_value, return true if new_value has changed from its previous value, and cache the new value if needed.