Method iter_parents

atomic-core/src/pristine/traits/graph.rs:242–272

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

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

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

        let adj = self.iter_adjacent(node, min_flag, max_flag)?;
        let mut result = Vec::new();
        for edge_result in adj {
            let edge = edge_result?;
            if !edge.flag().contains(EdgeFlags::PARENT) {
                continue;
            }
            if let Some(parent) = ParentEdge::from_serialized(&edge) {
                result.push(parent);
            }
        }
        Ok(result)
    }
}