(
&self,
adj: &mut InodeAdjState,
)
| 90 | } |
| 91 | |
| 92 | fn next_inode_adj( |
| 93 | &self, |
| 94 | adj: &mut InodeAdjState, |
| 95 | ) -> Option<Result<SerializedGraphEdge, Self::InodeError>> { |
| 96 | if adj.is_exhausted() { |
| 97 | return None; |
| 98 | } |
| 99 | |
| 100 | // Filter inode edges by the view's visible change set, |
| 101 | // same as iter_adjacent does for the global GRAPH. |
| 102 | loop { |
| 103 | match self.inner.next_inode_adj(adj) { |
| 104 | Some(Ok(edge)) => { |
| 105 | let introduced = edge.introduced_by(); |
| 106 | if introduced.is_root() || self.visibility.contains(introduced) { |
| 107 | return Some(Ok(edge)); |
| 108 | } |
| 109 | // Edge from a non-visible change — skip it |
| 110 | continue; |
| 111 | } |
| 112 | Some(Err(error)) => { |
| 113 | adj.mark_exhausted(); |
| 114 | return Some(Err(error)); |
| 115 | } |
| 116 | None => return None, |
| 117 | } |
| 118 | } |
| 119 | } |
| 120 | |
| 121 | fn find_block_in_inode( |
| 122 | &self, |
nothing calls this directly
no test coverage detected