Struct PartialMap 

pub struct PartialMap<V>(/* private fields */);

A map whose keys may contain holes (unresolved placeholders).

Backed by a Vec rather than IndexMap because hole keys are not unconditionally deduplicated: anonymous holes (!) always create new entries. Labeled holes (!label) and resolved keys are deduplicated by value on lookup, matching the behavior of regular Map.

Use PartialMap::find to look up an existing entry before inserting.

Implementations

impl<V> PartialMap<V>

pub fn new() -> Self

pub fn push(&mut self, key: PartialObjectKey, value: V)

Append a (key, value) pair unconditionally. Callers should call Self::find first to avoid duplicate labeled entries.

pub fn find(&self, key: &PartialObjectKey) -> Option<&V>

Find the first entry matching key.

Keys containing anonymous holes never match — they are always unique.

pub fn iter(&self) -> impl Iterator<Item = (&PartialObjectKey, &V)>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<V: Clone> Clone for PartialMap<V>

fn clone(&self) -> PartialMap<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for PartialMap<V>

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

Formats the value using the given formatter.

impl<V: Default> Default for PartialMap<V>

fn default() -> PartialMap<V>

Returns the “default value” for a type.

impl<V: PartialEq> PartialEq for PartialMap<V>

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.