Struct Mapping 

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

Apply the respective strategies to keys and values.

Trait Implementations

impl<K: Clone, V: Clone> Clone for Mapping<K, V>

fn clone(&self) -> Mapping<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for Mapping<K, V>

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

Formats the value using the given formatter.

impl<K: Default, V: Default> Default for Mapping<K, V>

fn default() -> Mapping<K, V>

Returns the “default value” for a type.

impl<K: Ord, SK: EncodingStrategy<K>, V, SV: EncodingStrategy<V>> EncodingStrategy<BTreeMap<K, V>> for Mapping<SK, SV>

type Context = MapContext<K, V, SK, SV>

The conext (i.e. probability model) for this encoding strategy applied to this type.

fn encode<W: Write>( value: &BTreeMap<K, V>, writer: &mut Writer<W>, ctx: &mut Self::Context, ) -> Result<(), Error>

Encode the value with this strategy.

fn decode<R: Read>( reader: &mut Reader<R>, ctx: &mut Self::Context, ) -> Result<BTreeMap<K, V>, Error>

Decode the value using this strategy.

fn millibits(value: &T, ctx: &mut Self::Context) -> Option<usize>

Estimate the size of the encoded value using this stratgy.

impl<K: Ord, SK: EncodingStrategy<K>, V, SV: EncodingStrategy<V>> EncodingStrategy<BTreeMap<K, V>> for Mapping<SK, SV>

type Context = MapContext<K, V, SK, SV>

The conext (i.e. probability model) for this encoding strategy applied to this type.

fn encode<E: EntropyCoder>( value: &BTreeMap<K, V>, writer: &mut E, ctx: &mut Self::Context, )

Encode the value with this strategy.

fn decode<D: EntropyDecoder>( reader: &mut D, ctx: &mut Self::Context, ) -> Result<BTreeMap<K, V>, Error>

Decode the value using this strategy.

impl<K: Hash + Eq, SK: EncodingStrategy<K>, V, SV: EncodingStrategy<V>> EncodingStrategy<HashMap<K, V>> for Mapping<SK, SV>

type Context = MapContext<K, V, SK, SV>

The conext (i.e. probability model) for this encoding strategy applied to this type.

fn encode<W: Write>( value: &HashMap<K, V>, writer: &mut Writer<W>, ctx: &mut Self::Context, ) -> Result<(), Error>

Encode the value with this strategy.

fn decode<R: Read>( reader: &mut Reader<R>, ctx: &mut Self::Context, ) -> Result<HashMap<K, V>, Error>

Decode the value using this strategy.

fn millibits(value: &T, ctx: &mut Self::Context) -> Option<usize>

Estimate the size of the encoded value using this stratgy.

impl<K: Hash + Eq, SK: EncodingStrategy<K>, V, SV: EncodingStrategy<V>> EncodingStrategy<HashMap<K, V>> for Mapping<SK, SV>

type Context = MapContext<K, V, SK, SV>

The conext (i.e. probability model) for this encoding strategy applied to this type.

fn encode<E: EntropyCoder>( value: &HashMap<K, V>, writer: &mut E, ctx: &mut Self::Context, )

Encode the value with this strategy.

fn decode<D: EntropyDecoder>( reader: &mut D, ctx: &mut Self::Context, ) -> Result<HashMap<K, V>, Error>

Decode the value using this strategy.

impl<K: Hash, V: Hash> Hash for Mapping<K, V>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K: Ord, V: Ord> Ord for Mapping<K, V>

fn cmp(&self, other: &Mapping<K, V>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<K: PartialEq, V: PartialEq> PartialEq for Mapping<K, V>

fn eq(&self, other: &Mapping<K, V>) -> 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<K: PartialOrd, V: PartialOrd> PartialOrd for Mapping<K, V>

fn partial_cmp(&self, other: &Mapping<K, V>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<K: Copy, V: Copy> Copy for Mapping<K, V>

impl<K: Eq, V: Eq> Eq for Mapping<K, V>

impl<K, V> StructuralPartialEq for Mapping<K, V>