Struct Fields 

pub struct Fields(/* private fields */);

Field names and values in insertion order. Inserting a name that is already there keeps its place; removing one keeps the order of the others. Equality ignores the order, as for protobuf maps.

Implementations

impl Fields

pub fn new() -> Fields

pub fn with_capacity(capacity: usize) -> Fields

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn get_mut(&mut self, key: &str) -> Option<&mut Value>

pub fn contains_key(&self, key: &str) -> bool

pub fn insert(&mut self, key: String, value: Value) -> Option<Value>

Sets key, in place if it is there, else at the end.

pub fn remove(&mut self, key: &str) -> Option<Value>

Removes key; the fields after it keep their order.

pub fn push(&mut self, key: String, value: Value)

Sets key at the end, moving it there if it is already present.

pub fn entry(&mut self, key: String) -> Entry<'_, String, Value>

pub fn iter(&self) -> Iter<'_, String, Value>

pub fn iter_mut(&mut self) -> IterMut<'_, String, Value>

pub fn keys(&self) -> Keys<'_, String, Value>

pub fn values(&self) -> Values<'_, String, Value>

pub fn values_mut(&mut self) -> ValuesMut<'_, String, Value>

pub fn sorted(&self) -> Vec<(&String, &Value)>

The fields in Firestore’s canonical order: names by UTF-8 bytes, which is String’s Ord. Comparisons and index keys use this order, never the stored one.

pub fn clear(&mut self)

Trait Implementations

impl Clone for Fields

fn clone(&self) -> Fields

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Fields

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

Formats the value using the given formatter.

impl Default for Fields

fn default() -> Fields

Returns the “default value” for a type.

impl Extend<(String, Value)> for Fields

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = (String, Value)>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<const N: usize> From<[(String, Value); N]> for Fields

fn from(entries: [(String, Value); N]) -> Fields

Converts to this type from the input type.

impl FromIterator<(String, Value)> for Fields

fn from_iter<I>(iter: I) -> Fields

where I: IntoIterator<Item = (String, Value)>,

Creates a value from an iterator.

impl Index<&str> for Fields

Panics when key is missing, as BTreeMap does.

type Output = Value

The returned type after indexing.

fn index(&self, key: &str) -> &Value

Performs the indexing (container[index]) operation.

impl IntoIterator for Fields

type Item = (String, Value)

The type of the elements being iterated over.

type IntoIter = IntoIter<String, Value>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <Fields as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a> IntoIterator for &'a Fields

type Item = (&'a String, &'a Value)

The type of the elements being iterated over.

type IntoIter = Iter<'a, String, Value>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a Fields as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a> IntoIterator for &'a mut Fields

type Item = (&'a String, &'a mut Value)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, String, Value>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a mut Fields as IntoIterator>::IntoIter

Creates an iterator from a value.

impl PartialEq for Fields

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Fields