Trait TryApply

pub trait TryApply<V, K: Kind + ?Sized, D: Dedup + ?Sized>: Container<V> {
    // Required method
    fn try_apply(&mut self, value: V) -> Result<()>;
}

Applying a value to a field::Container according to a parsing Kind and Deduplication strategy.

Required Methods

fn try_apply(&mut self, value: V) -> Result<()>

Applies the provided value to this field::Container.

Errors

If this field::Container refuses to apply the value according to the Deduplication strategy.

Implementations on Foreign Types

impl<K, V> TryApply<(K, V), Map, First> for BTreeMap<K, V>

where K: Ord,

fn try_apply(&mut self, val: (K, V)) -> Result<()>

impl<K, V> TryApply<(K, V), Map, Last> for BTreeMap<K, V>

where K: Ord,

fn try_apply(&mut self, val: (K, V)) -> Result<()>

impl<K, V> TryApply<(K, V), Map, Unique> for BTreeMap<K, V>

where for<'a> &'a K: IntoSpan, K: Ord,

fn try_apply(&mut self, val: (K, V)) -> Result<()>

impl<K, V, S: BuildHasher> TryApply<(K, V), Map, Unique> for HashMap<K, V, S>

where for<'a> &'a K: IntoSpan, K: Eq + Hash,

fn try_apply(&mut self, val: (K, V)) -> Result<()>

impl<K: Eq + Hash, V, S: BuildHasher> TryApply<(K, V), Map, First> for HashMap<K, V, S>

fn try_apply(&mut self, val: (K, V)) -> Result<()>

impl<K: Eq + Hash, V, S: BuildHasher> TryApply<(K, V), Map, Last> for HashMap<K, V, S>

fn try_apply(&mut self, val: (K, V)) -> Result<()>

impl<V> TryApply<V, Nested, Unique> for BTreeSet<V>

where for<'a> &'a V: IntoSpan, V: Ord,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V> TryApply<V, Nested, Unique> for Vec<V>

where for<'a> &'a V: IntoSpan, V: PartialEq,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V> TryApply<V, Value, Unique> for BTreeSet<V>

where for<'a> &'a V: IntoSpan, V: Ord,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V> TryApply<V, Value, Unique> for Vec<V>

where for<'a> &'a V: IntoSpan, V: PartialEq,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, K> TryApply<V, K, First> for Option<V>

where K: Kind + Single + ?Sized,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, K> TryApply<V, K, Last> for Option<V>

where K: Kind + Single + ?Sized,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, K> TryApply<V, K, Unique> for Option<V>

where for<'a> &'a V: IntoSpan, K: Kind + Single + ?Sized,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, S> TryApply<V, Nested, First> for HashSet<V, S>

where V: Eq + Hash, S: BuildHasher,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, S> TryApply<V, Nested, Last> for HashSet<V, S>

where V: Eq + Hash, S: BuildHasher,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, S> TryApply<V, Nested, Unique> for HashSet<V, S>

where for<'a> &'a V: IntoSpan, V: Eq + Hash, S: BuildHasher,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, S> TryApply<V, Value, First> for HashSet<V, S>

where V: Eq + Hash, S: BuildHasher,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, S> TryApply<V, Value, Last> for HashSet<V, S>

where V: Eq + Hash, S: BuildHasher,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V, S> TryApply<V, Value, Unique> for HashSet<V, S>

where for<'a> &'a V: IntoSpan, V: Eq + Hash, S: BuildHasher,

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: Ord> TryApply<V, Nested, First> for BTreeSet<V>

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: Ord> TryApply<V, Nested, Last> for BTreeSet<V>

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: Ord> TryApply<V, Value, First> for BTreeSet<V>

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: Ord> TryApply<V, Value, Last> for BTreeSet<V>

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: PartialEq> TryApply<V, Nested, First> for Vec<V>

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: PartialEq> TryApply<V, Nested, Last> for Vec<V>

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: PartialEq> TryApply<V, Value, First> for Vec<V>

fn try_apply(&mut self, val: V) -> Result<()>

impl<V: PartialEq> TryApply<V, Value, Last> for Vec<V>

fn try_apply(&mut self, val: V) -> Result<()>

Implementors

impl<V, K> TryApply<V, K, First> for Required<V>

where K: Kind + Single + ?Sized,

impl<V, K> TryApply<V, K, Last> for Required<V>

where K: Kind + Single + ?Sized,

impl<V, K> TryApply<V, K, Unique> for Required<V>

where for<'a> &'a V: IntoSpan, K: Kind + Single + ?Sized,