Struct Table

pub struct Table<'key, V: Keyed<'key>> { /* private fields */ }

Implementations

impl<'key, V: Keyed<'key>> Table<'key, V>

pub fn new() -> Self

pub fn insert(&mut self, value: V)

pub fn len(&self) -> usize

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

pub fn is_empty(&self) -> bool

pub fn values(&self) -> Values<'_, &'key str, V>

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

pub fn keys(&self) -> Keys<'_, &'key str, V>

pub fn iter(&self) -> Iter<'_, &'key str, V>

pub fn pop(&mut self) -> Option<V>

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

Trait Implementations

impl<'key, V: Debug + Keyed<'key>> Debug for Table<'key, V>

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

Formats the value using the given formatter.

impl<'key, V: Keyed<'key>> Default for Table<'key, V>

fn default() -> Self

Returns the “default value” for a type.

impl<'key, V: Keyed<'key>> FromIterator<V> for Table<'key, V>

fn from_iter<I: IntoIterator<Item = V>>(iter: I) -> Self

Creates a value from an iterator.

impl<'key, V: Keyed<'key>> Index<&'key str> for Table<'key, V>

type Output = V

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'table, V: Keyed<'table> + 'table> IntoIterator for &'table Table<'table, V>

type IntoIter = Iter<'table, &'table str, V>

Which kind of iterator are we turning this into?

type Item = (&'table &'table str, &'table V)

The type of the elements being iterated over.

fn into_iter(self) -> Iter<'table, &'table str, V>

Creates an iterator from a value.

impl<'key, V: Keyed<'key>> IntoIterator for Table<'key, V>

type IntoIter = IntoIter<&'key str, V>

Which kind of iterator are we turning this into?

type Item = (&'key str, V)

The type of the elements being iterated over.

fn into_iter(self) -> IntoIter<&'key str, V>

Creates an iterator from a value.

impl<'key, V: PartialEq + Keyed<'key>> PartialEq for Table<'key, V>

fn eq(&self, other: &Table<'key, V>) -> 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<'key, V> Serialize for Table<'key, V>

where V: Serialize + Keyed<'key>,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'key, V: Keyed<'key>> StructuralPartialEq for Table<'key, V>