Struct RcMap 

pub struct RcMap<D: DB = DefaultDB> { /* private fields */ }

Reference count map for tracking charged keys in write and delete costing.

Internally we use ChildRef to ensure that nodes for all keys in the RcMap will be persisted as long a the RcMap itself is.

Trait Implementations

impl<D: DB> Clone for RcMap<D>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<D: DB> Debug for RcMap<D>

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

Formats the value using the given formatter.

impl<D: DB> Default for RcMap<D>

fn default() -> Self

Returns the “default value” for a type.

impl<D: DB> Deserializable for RcMap<D>

fn deserialize(__reader: &mut impl Read, recursion_depth: u32) -> Result<Self>

const LIMIT_RECURSION: bool = true

fn check_rec(depth: &mut u32) -> Result<(), Error>

impl<D: DB> Distribution<RcMap<D>> for Standard

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> RcMap<D>

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl<D: DB> PartialEq for RcMap<D>

fn eq(&self, __other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<D: DB> Serializable for RcMap<D>

fn serialize(&self, __writer: &mut impl Write) -> Result<()>

fn serialized_size(&self) -> usize

impl<D: DB> Storable<D> for RcMap<D>

fn children(&self) -> Vec<ArenaKey<<D as DB>::Hasher>>

Provides an iterator over hashes of child Sps, if any. These hashes will be passed back into from_binary_repr when deserializing.

fn to_binary_repr<W: Write>(&self, writer: &mut W) -> Result<(), Error>

Serializes self, omitting any children.

fn from_binary_repr<R: Read>( reader: &mut R, child_hashes: &mut impl Iterator<Item = ArenaKey<<D as DB>::Hasher>>, loader: &impl Loader<D>, ) -> Result<Self, Error>

Instantiates self, given hashes of any children, and loader that loads children given their hash.

fn check_invariant(&self) -> Result<(), Error>

An invariant to check on deserialization. Should be invoked from within from_binary_repr.

fn as_child(&self) -> ArenaKey<<D as DB>::Hasher>

Represents self as a ArenaKey

impl<D: DB> Tagged for RcMap<D>

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

Retrieves the tag of Self. Returns a [Cow] as type arguments require allocation, but no allocation is preferred.

fn tag_unique_factor() -> String

A decomposition of this tag into primitive types (any type whose representation is not defined through other types), tuples (via (a,b)), and sum types (via [a,b]).

impl<D: DB> Eq for RcMap<D>