Trait wood::Dewooder

pub trait Dewooder<T> {
    // Required method
    fn dewoodify(&self, v: &Wood) -> Result<T, Box<WoodError>>;
}

Required Methods

fn dewoodify(&self, v: &Wood) -> Result<T, Box<WoodError>>

Implementors

impl Dewooder<bool> for YesNo

impl<'a, K, V, KeyTran, ValTran> Dewooder<HashMap<K, V>> for TaggedHashMapBi<'a, KeyTran, ValTran>

where KeyTran: Dewooder<K>, ValTran: Dewooder<V>, K: Eq + Hash, V: Eq + Hash,

impl<'a, T, SubTran> Dewooder<Vec<T>> for TaggedSequenceBi<'a, SubTran>

where SubTran: Dewooder<T>,

impl<D, L> Dewooder<D> for LambdaDewooder<L>

where L: Fn(&Wood) -> Result<D, Box<WoodError>>,

impl<K, V, KeyTran, ValTran> Dewooder<(K, V)> for PairBi<KeyTran, ValTran>

where KeyTran: Dewooder<K>, ValTran: Dewooder<V>,

impl<K, V, KeyTran, ValTran> Dewooder<HashMap<K, V>> for HashMapBi<KeyTran, ValTran>

where KeyTran: Dewooder<K>, ValTran: Dewooder<V>, K: Eq + Hash, V: Eq + Hash,

impl<T> Dewooder<T> for Iden

where T: Dewoodable,

impl<T, B> Dewooder<T> for OptionalBoxBiwooder<B>

where B: Dewooder<T> + ?Sized,

impl<T, SubTran> Dewooder<Vec<T>> for SequenceBi<SubTran>

where SubTran: Dewooder<T>,

impl<T, W, D> Dewooder<T> for CompositeBiwooder<W, D>

where D: Dewooder<T>,