Struct Keywords 

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

A template instance’s keywordToValue: one value per keyword, kept in the order the venue hashes them, which is bytewise by keyword, so Zone comes before apple. Built sorted, so no caller can send them otherwise.

Implementations

impl Keywords

pub const fn new() -> Self

No keywords, which a template that declares none is instanced with.

pub fn from_pairs<K: Into<String>, V: Into<String>>( pairs: impl IntoIterator<Item = (K, V)>, ) -> Result<Self, BadValue>

Pairs in any order. A keyword given twice is refused, not replaced.

pub fn with( self, keyword: impl Into<String>, value: impl Into<String>, ) -> Result<Self, BadValue>

One more pair. A keyword given twice is refused, not replaced.

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

The pairs in the order they are hashed in.

pub fn wire(&self) -> Value

[[keyword, value], ...], or [] for none.

pub fn check<'a>( &self, declared: impl IntoIterator<Item = (&'a str, Hint)>, now_ms: u64, ) -> Vec<BadValue>

Everything wrong with these as an instance of a template declaring declared, each keyword with its hint: a declared keyword with no value, a value for a keyword it does not declare, and each value its hint refuses at now_ms. Empty when nothing is.

Trait Implementations

impl Clone for Keywords

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Keywords

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

Formats the value using the given formatter.

impl Default for Keywords

fn default() -> Self

Returns the “default value” for a type.

impl Eq for Keywords

impl PartialEq for Keywords

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Keywords