Struct wood::wooder::FieldScanning

pub struct FieldScanning<'a> {
    pub v: &'a Wood,
    pub li: &'a [Wood],
    pub eye: usize,
}

Used by woods_derive, but you can use it too if you want. It’s for scanning over structs with named pairs where the order is usually the same. Guesses that each queried field will be after the last, and only does a full scanaround when it finds that’s not the case.

Fields

v: &'a Wood

li: &'a [Wood]

eye: usize

Implementations

impl<'a> FieldScanning<'a>

pub fn new(v: &'a Wood) -> Self

pub fn find(&mut self, key: &str) -> Result<&Wood, Box<WoodError>>