Trait wood::Dewooder

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

Required methods

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

Loading content...

Implementors

impl<'a, K, V, KeyTran, ValTran> Dewooder<HashMap<K, V, RandomState>> for TaggedHashMapBi<'a, KeyTran, ValTran> where
    KeyTran: Dewooder<K>,
    ValTran: Dewooder<V>,
    K: Eq + Hash,
    V: Eq + Hash, 

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

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

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

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

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

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

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

impl<K, V, KeyTran, ValTran> Dewooder<HashMap<K, V, RandomState>> for HashMapBi<KeyTran, ValTran> where
    KeyTran: Dewooder<K>,
    ValTran: Dewooder<V>,
    K: Eq + Hash,
    V: Eq + Hash, 

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

impl<T> Dewooder<T> for Iden where
    T: Dewoodable, 

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

impl<T, B: ?Sized> Dewooder<T> for OptionalBoxBiwooder<B> where
    B: Dewooder<T>, 

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

impl<T, SubTran> Dewooder<Vec<T, Global>> for SequenceBi<SubTran> where
    SubTran: Dewooder<T>, 

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

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

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

Loading content...