Enum listinfo::EntryNode

pub enum EntryNode<'a> {
    Unique(EntryData<'a>),
    Many(Vec<EntryData<'a>>),
}

Represents one node in an ListInfo entry.

Note: The split between Unique and Many is mostly for performance reasons to avoid unnescessary allocations.

Instead of matching the EntryNode, useEntryFragment::get_unique() and EntryFragment::get_iter() to access EntryData per expectations.

Variants

Unique(EntryData<'a>)

A uniquely keyed node (only one of such key exists in the entry)

Many(Vec<EntryData<'a>>)

Multiple nodes with the same key.

Implementations

impl<'a> EntryNode<'a>

pub fn iter(&'a self) -> impl Iterator<Item = &EntryData>

Gets the values with the given key.

If the provided key is a unique value, returns an iterator that yields that single value.

pub fn unique(&'a self) -> &EntryData

Gets a single value with the given key.

If the provided key is not unique, retrieves the first value of the many-set with the given key.

Trait Implementations

impl<'a> Debug for EntryNode<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for EntryNode<'a>

impl<'a> PartialEq<EntryNode<'a>> for EntryNode<'a>

fn eq(&self, other: &EntryNode<'a>) -> bool

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

fn ne(&self, other: &EntryNode<'a>) -> bool

This method tests for !=.

impl<'a> StructuralEq for EntryNode<'a>

impl<'a> StructuralPartialEq for EntryNode<'a>