fn len(&self) -> usize {
        match self {
            &Node::List(&items) | Node::BracketedList(&(_, items, _)) => items.len(),
            n if n.is_ignored() => 0,
            _ => 1,
        }
    }
// The number of elements which would be yielded by `self.iter()`.
// Must return the upper bound returned by NodeIterHelper::size_hint.
The number of elements which would be yielded by `self.iter()`.
Must return the upper bound returned by NodeIterHelper::size_hint.
The number of elements which would be yielded by ` self . iter () ` . Must return the upper bound returned by NodeIterHelper :: size_hint .
fn len(&self) -> usize {
        match self {
            &Node::List(&items) | Node::BracketedList(&(_, items, _)) => items.len(),
            n if n.is_ignored() => 0,
            _ => 1,
        }
    }
fn len ( & self ) -> usize { match self { & Node :: List ( & items ) | Node :: BracketedList ( & ( _ , items , _ ) ) => items . len ( ) , n if n . is_ignored ( ) => 0 , _ => 1 , } }
The number of elements which would be yielded by `self.iter()`.
The number of elements which would be yielded by ` self . iter () ` .
&self