Enum Keys 

pub enum Keys {
    One(Key),
    PerItem(Vec<Key>),
}

What a node’s output is called: one name, or one per item.

The second is what a .mapped() node produces: with one name per node, adding a document to a list of a thousand misses all thousand; with one per item, the thousand hit and the new one runs.

Variants

One(Key)

The output is one thing and has one name.

PerItem(Vec<Key>)

The output is a list, and each item is named on its own — in order, and as long as the list.

Implementations

impl Keys

pub fn one(&self) -> Option<&Key>

The one name, if there is one. None for a list of them: what a single name over many is made of is Keeper::combine’s to decide.

pub fn each(&self) -> &[Key]

Every name in it, in order: one, or as many as there are items.

Trait Implementations

impl Clone for Keys

fn clone(&self) -> Keys

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Keys

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Keys

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Keys

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

Formats the value using the given formatter.

impl PartialEq for Keys

fn eq(&self, other: &Keys) -> 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 Serialize for Keys

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Keys

impl StructuralPartialEq for Keys