| 126 | } |
| 127 | |
| 128 | fn iter_inode_vertices( |
| 129 | &self, |
| 130 | inode: Inode, |
| 131 | ) -> PristineResult< |
| 132 | Box< |
| 133 | dyn Iterator<Item = Result<(GraphNode<NodeId>, SerializedGraphEdge), PristineError>> |
| 134 | + '_, |
| 135 | >, |
| 136 | > { |
| 137 | let table = self.txn.open_multimap_table(INODE_GRAPH)?; |
| 138 | |
| 139 | let inode_id = inode.get(); |
| 140 | let start_key = encode_inode_vertex(inode_id, 0, 0, 0); |
| 141 | let end_key = encode_inode_vertex(inode_id, u64::MAX, u64::MAX, u64::MAX); |
| 142 | |
| 143 | let mut results = Vec::new(); |
| 144 | 'entries: for result in table.range::<&[u8; 32]>(&start_key..=&end_key)? { |
| 145 | let (key, values) = match result { |
| 146 | Ok(entry) => entry, |
| 147 | Err(error) => { |
| 148 | results.push(Err(PristineError::Storage(Box::new(error)))); |
| 149 | break; |
| 150 | } |
| 151 | }; |
| 152 | let (_, change_id, start, end) = decode_inode_vertex(key.value()); |
| 153 | let node = GraphNode { |
| 154 | change: NodeId::new(change_id), |
| 155 | start: ChangePosition::new(start), |
| 156 | end: ChangePosition::new(end), |
| 157 | }; |
| 158 | |
| 159 | for value in values { |
| 160 | match value { |
| 161 | Ok(value) => { |
| 162 | let edge = deserialize_edge(value.value()); |
| 163 | results.push(Ok((node, edge))); |
| 164 | } |
| 165 | Err(error) => { |
| 166 | results.push(Err(PristineError::Storage(Box::new(error)))); |
| 167 | break 'entries; |
| 168 | } |
| 169 | } |
| 170 | } |
| 171 | } |
| 172 | |
| 173 | Ok(Box::new(results.into_iter())) |
| 174 | } |
| 175 | |
| 176 | fn get_file_index(&self, path: &str) -> PristineResult<Option<FileIndexMetadata>> { |
| 177 | let table = self.txn.open_table(FILE_INDEX)?; |