1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
use super::id::NodeId; use super::tree::{Node, NodeTree}; pub(crate) struct NodeDfsIter<'a> { pub(crate) tree: &'a NodeTree, pub(crate) stack: Vec<NodeId>, } impl<'a> Iterator for NodeDfsIter<'a> { type Item = &'a Node; fn next(&mut self) -> Option<Self::Item> { loop { let id = self.stack.pop()?; if !self.tree.is_valid(id) { continue; } let node = self.tree.node(id); for &child in node.children.iter().rev() { if self.tree.is_valid(child) { self.stack.push(child); } } return Some(node); } } }