Struct valence_nbt::compound::Compound

pub struct Compound<S = String> { /* private fields */ }

A map type with String keys and Value values.

Implementations

impl<S> Compound<S>

pub fn new() -> Self

pub fn with_capacity(cap: usize) -> Self

pub fn clear(&mut self)

impl<S> Compound<S>

where S: Ord + Hash,

pub fn get<Q>(&self, k: &Q) -> Option<&Value<S>>

where Q: ?Sized + AsBorrowed<S>, <Q as AsBorrowed<S>>::Borrowed: Hash + Ord, S: Borrow<<Q as AsBorrowed<S>>::Borrowed>,

pub fn contains_key<Q>(&self, k: &Q) -> bool

where Q: ?Sized + AsBorrowed<S>, <Q as AsBorrowed<S>>::Borrowed: Hash + Ord, S: Borrow<<Q as AsBorrowed<S>>::Borrowed>,

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut Value<S>>

where Q: ?Sized + AsBorrowed<S>, <Q as AsBorrowed<S>>::Borrowed: Hash + Ord, S: Borrow<<Q as AsBorrowed<S>>::Borrowed>,

pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&S, &Value<S>)>

where Q: ?Sized + AsBorrowed<S>, <Q as AsBorrowed<S>>::Borrowed: Hash + Ord, S: Borrow<<Q as AsBorrowed<S>>::Borrowed>,

pub fn insert<K, V>(&mut self, k: K, v: V) -> Option<Value<S>>

where K: Into<S>, V: Into<Value<S>>,

pub fn remove<Q>(&mut self, k: &Q) -> Option<Value<S>>

where Q: ?Sized + AsBorrowed<S>, <Q as AsBorrowed<S>>::Borrowed: Hash + Ord, S: Borrow<<Q as AsBorrowed<S>>::Borrowed>,

pub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(S, Value<S>)>

where S: Borrow<Q>, Q: ?Sized + Ord + Hash,

pub fn append(&mut self, other: &mut Self)

pub fn entry<K>(&mut self, k: K) -> Entry<'_, S>

where K: Into<S>,

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

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

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

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

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&S, &mut Value<S>) -> bool,

pub fn merge(&mut self, other: Compound<S>)

Inserts all items from other into self recursively.

Example

use valence_nbt::compound;

let mut this = compound! {
    "foo" => 10,
    "bar" => compound! {
        "baz" => 20,
    }
};

let other = compound! {
    "foo" => 15,
    "bar" => compound! {
        "quux" => "hello",
    }
};

this.merge(other);

assert_eq!(
    this,
    compound! {
        "foo" => 15,
        "bar" => compound! {
            "baz" => 20,
            "quux" => "hello",
        }
    }
);

Trait Implementations

impl<S: Clone> Clone for Compound<S>

fn clone(&self) -> Compound<S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for Compound<S>

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

Formats the value using the given formatter.

impl<S: Default> Default for Compound<S>

fn default() -> Compound<S>

Returns the “default value” for a type.

impl<S> Extend<(S, Value<S>)> for Compound<S>

where S: Ord + Hash,

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

where T: IntoIterator<Item = (S, Value<S>)>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬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<'a, S> From<&'a Compound<S>> for ValueRef<'a, S>

fn from(v: &'a Compound<S>) -> Self

Converts to this type from the input type.

impl<'a, S> From<&'a mut Compound<S>> for ValueMut<'a, S>

fn from(v: &'a mut Compound<S>) -> Self

Converts to this type from the input type.

impl<S> From<Compound<S>> for Value<S>

fn from(v: Compound<S>) -> Self

Converts to this type from the input type.

impl<S> FromIterator<(S, Value<S>)> for Compound<S>

where S: Ord + Hash,

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = (S, Value<S>)>,

Creates a value from an iterator.

impl<S, Q> Index<&Q> for Compound<S>

where S: Borrow<Q> + Ord + Hash, Q: ?Sized + Ord + Hash,

type Output = Value<S>

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<S, Q> IndexMut<&Q> for Compound<S>

where S: Borrow<Q> + Hash + Ord, Q: ?Sized + Ord + Hash,

fn index_mut(&mut self, index: &Q) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, S> IntoIterator for &'a Compound<S>

type Item = (&'a S, &'a Value<S>)

The type of the elements being iterated over.

type IntoIter = Iter<'a, S>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, S> IntoIterator for &'a mut Compound<S>

type Item = (&'a S, &'a mut Value<S>)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, S>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<S> IntoIterator for Compound<S>

type Item = (S, Value<S>)

The type of the elements being iterated over.

type IntoIter = IntoIter<S>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<S> PartialEq for Compound<S>

where S: Ord + Hash,

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.