Method iter_forward

atomic-core/src/pristine/traits/graph.rs:201–232

Iterate forward (non-parent) edges from a vertex. Returns typed [`ForwardEdge`] values. When `include_deleted` is true, deleted edges (`BlockDeleted`, `FolderDeleted`) are included; otherwise they are filtered out. This is the typed replacement for [`iter_adjacent`](Self::iter_adjacent) with forward-edge flag ranges. New code should prefer this over `iter_adjacent`.

(
        &self,
        node: GraphNode<NodeId>,
        include_deleted: bool,
    )

    /// with forward-edge flag ranges. New code should prefer this over
    /// `iter_adjacent`.
    fn iter_forward(
        &self,
        node: GraphNode<NodeId>,
        include_deleted: bool,
    ) -> Result<Vec<ForwardEdge>, PristineError> {
        // Flag-range bounds:
        //   alive only  → [0x00, 0x14]  (empty ..= PSEUDO|FOLDER)
        //   with deleted → [0x00, 0x90]  (empty ..= DELETED|FOLDER)
        //
        // The wider range may include PARENT edges (0x20–0x34) when
        // include_deleted is true; the loop filters them out.
        let min_flag = EdgeFlags::empty();
        let max_flag = if include_deleted {
            EdgeFlags::DELETED | EdgeFlags::FOLDER
        } else {
            EdgeFlags::PSEUDO | EdgeFlags::FOLDER
        };

        let adj = self.iter_adjacent(node, min_flag, max_flag)?;
        let mut result = Vec::new();
        for edge_result in adj {
            let edge = edge_result?;
            // Skip any parent edges that snuck into the range
            if edge.flag().contains(EdgeFlags::PARENT) {
                continue;
            }
            if let Some(forward) = ForwardEdge::from_serialized(&edge) {
                result.push(forward);
            }
        }
        Ok(result)
    }

    /// Iterate parent (reverse) edges of a vertex.
    ///