Method visible_items

perro_source/core/perro_ui/src/tree.rs:134–150

(&self)

    }

    pub fn visible_items(&self) -> Vec<UiTreeListVisibleItem> {
        // Adjacency built in one pass; slot 0 = roots, slot idx+1 = children
        // of item idx. Keeps the walk O(n) instead of re-scanning all items
        // per node.
        let len = self.items.len();
        let mut children: Vec<Vec<usize>> = vec![Vec::new(); len + 1];
        for (idx, item) in self.items.iter().enumerate() {
            match item.parent {
                None => children[0].push(idx),
                Some(parent) if parent < len => children[parent + 1].push(idx),
                Some(_) => {}
            }
        }
        let mut out = Vec::new();
        self.push_visible_children(&children, 0, 0, &mut out);
        out
    }

    pub fn clear_items(&mut self) {
        self.items.clear();