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,
)
| 241 | /// with forward-edge flag ranges. New code should prefer this over |
| 242 | /// `iter_adjacent`. |
| 243 | fn iter_forward( |
| 244 | &self, |
| 245 | node: GraphNode<NodeId>, |
| 246 | include_deleted: bool, |
| 247 | ) -> Result<Vec<ForwardEdge>, PristineError> { |
| 248 | // Flag-range bounds: |
| 249 | // alive only → [0x00, 0x14] (empty ..= PSEUDO|FOLDER) |
| 250 | // with deleted → [0x00, 0x90] (empty ..= DELETED|FOLDER) |
| 251 | // |
| 252 | // The wider range may include PARENT edges (0x20–0x34) when |
| 253 | // include_deleted is true; the loop filters them out. |
| 254 | let min_flag = EdgeFlags::empty(); |
| 255 | let max_flag = if include_deleted { |
| 256 | EdgeFlags::DELETED | EdgeFlags::FOLDER |
| 257 | } else { |
| 258 | EdgeFlags::PSEUDO | EdgeFlags::FOLDER |
| 259 | }; |
| 260 | |
| 261 | let adj = self.iter_adjacent(node, min_flag, max_flag)?; |
| 262 | let mut result = Vec::new(); |
| 263 | for edge_result in adj { |
| 264 | let edge = edge_result?; |
| 265 | // Skip any parent edges that snuck into the range |
| 266 | if edge.flag().contains(EdgeFlags::PARENT) { |
| 267 | continue; |
| 268 | } |
| 269 | if let Some(forward) = ForwardEdge::from_serialized(&edge) { |
| 270 | result.push(forward); |
| 271 | } |
| 272 | } |
| 273 | Ok(result) |
| 274 | } |
| 275 | |
| 276 | /// Iterate parent (reverse) edges of a vertex. |
| 277 | /// |