Struct Row 

pub struct Row { /* private fields */ }

One row: named columns, in insertion order.

Ordered rather than a map because a key row’s column order is the table’s key order, and a lookup that reordered the key columns would ask for a different row. BTreeMap would silently sort them.

Implementations

impl Row

pub fn new() -> Self

pub fn with(self, name: impl Into<String>, value: impl Into<Value>) -> Self

Adds a column, keeping the order it was added in.

pub fn set(&mut self, name: impl Into<String>, value: impl Into<Value>)

Adds a column in place.

pub fn get(&self, name: &str) -> Option<&Value>

The value of a column, if the row has one.

pub fn columns(&self) -> &[(String, Value)]

The columns, in order.

pub fn names(&self) -> impl Iterator<Item = &str>

The column names, in order.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn to_map(&self) -> BTreeMap<&str, &Value>

The row as a map, for callers that would rather look columns up than walk them. Loses the ordering, which is why it is not the representation.

Trait Implementations

impl Clone for Row

fn clone(&self) -> Row

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Row

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

Formats the value using the given formatter.

impl Default for Row

fn default() -> Row

Returns the “default value” for a type.

impl Display for Row

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

Formats the value using the given formatter.

impl FromIterator<(String, Value)> for Row

fn from_iter<I: IntoIterator<Item = (String, Value)>>(iterator: I) -> Self

Creates a value from an iterator.

impl PartialEq for Row

fn eq(&self, other: &Row) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Row