Struct pour::InnerMap

pub struct InnerMap<K: RadixKey, V: Clone> { /* fields omitted */ }

An IdMap's internal data.

Implementations

impl<K: RadixKey, V: Clone> InnerMap<K, V>

pub fn len(&self) -> usize

The size of the map this InnerMap represents

pub fn depth(&self) -> usize

The depth of this InnerMap

pub fn is_root(&self) -> bool

Whether this InnerMap is a root InnerMap, i.e. can be placed directly into a Set

pub fn is_empty(&self) -> bool

Whether this InnerMap is empty

pub fn singleton(key: K, value: V) -> InnerMap<K, V>

Create an InnerMap representing a singleton

impl<K: RadixKey, V: Clone + Eq> InnerMap<K, V>

pub fn rec_eq(&self, other: &InnerMap<K, V>) -> bool

Check whether two InnerMaps are recursively equal, i.e. contain the same data versus point to the same data

Trait Implementations

impl<K: Clone + RadixKey, V: Clone> Clone for InnerMap<K, V> where
    K::PatternType: Clone,
    K::DepthType: Clone, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: RadixKey + Debug, V: Clone + Debug> Debug for InnerMap<K, V>

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

Formats the value using the given formatter.

impl<K: RadixKey, V: Clone + Eq> Eq for InnerMap<K, V>

impl<K: RadixKey + Hash, V: Clone + Hash> Hash for InnerMap<K, V>

fn hash<H: Hasher>(&self, hasher: &mut H)

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<K: RadixKey + Eq + Ord, V: Clone + Eq + Ord> Ord for InnerMap<K, V>

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

This method returns an Ordering between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<K: RadixKey, V: Clone + Eq> PartialEq<InnerMap<K, V>> for InnerMap<K, V>

fn eq(&self, other: &InnerMap<K, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<K: RadixKey + PartialOrd, V: Clone + Eq + PartialOrd> PartialOrd<InnerMap<K, V>> for InnerMap<K, V>

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

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

#[must_use]fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]fn le(&self, other: &Rhs) -> bool

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

#[must_use]fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]fn ge(&self, other: &Rhs) -> bool

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