Struct Row 

pub struct Row<T>(/* private fields */);

An insertion-ordered map from NameSegment to T.

Also stores a “label” for each entry, which may not be the same as the NameSegment in the case that the NameSegment is a UUID.

This is called “row” because it’s a short name, and it corresponds to the idea of a row in a database, which is a map from fields to values.

Create this using the FromIterator implementation.

Implementations

impl<T> Row<T>

pub fn get(&self, name: NameSegment) -> Option<&T>

Lookup the field name if it exists.

Also see the Index implementation, which just unwraps this.

pub fn get_mut(&mut self, name: NameSegment) -> Option<&mut T>

Lookup the field name by mutable reference.

pub fn get_with_label(&self, name: NameSegment) -> Option<&(LabelSegment, T)>

Lookup the field name if it exists, and get its value and label.

pub fn iter(&self) -> impl Iterator<Item = (&NameSegment, &(LabelSegment, T))>

Iterate through the fields in insertion order.

pub fn len(&self) -> usize

Return the number of fields.

pub fn is_empty(&self) -> bool

Return whether the row is empty.

pub fn has(&self, field_name: NameSegment) -> bool

Return whether the row contains the given field.

pub fn empty() -> Self

Construct the empty row.

pub fn map<S>(&self, f: impl Fn(&T) -> S) -> Row<S>

Map a function to produce a new row.

pub fn insert(&mut self, field: NameSegment, label: LabelSegment, value: T)

Insert a new field.

Trait Implementations

impl<T: Clone> Clone for Row<T>

fn clone(&self) -> Row<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Default for Row<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> From<IndexMap<NameSegment, (LabelSegment, T)>> for Row<T>

fn from(value: IndexMap<NameSegment, (LabelSegment, T)>) -> Self

Converts to this type from the input type.

impl<T> FromIterator<(NameSegment, (LabelSegment, T))> for Row<T>

fn from_iter<I: IntoIterator<Item = (NameSegment, (LabelSegment, T))>>( iter: I, ) -> Self

Creates a value from an iterator.

impl<S: Clone + Into<Ustr>, T> FromIterator<(S, T)> for Row<T>

fn from_iter<I: IntoIterator<Item = (S, T)>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> Index<NameSegment> for Row<T>

type Output = T

The returned type after indexing.

fn index(&self, index: NameSegment) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T: PartialEq> PartialEq for Row<T>

fn eq(&self, other: &Row<T>) -> 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<T: Eq> Eq for Row<T>

impl<T> StructuralPartialEq for Row<T>