| 898 | } |
| 899 | |
| 900 | fn iter_inode_vertices( |
| 901 | &self, |
| 902 | inode: Inode, |
| 903 | ) -> PristineResult< |
| 904 | Box< |
| 905 | dyn Iterator<Item = Result<(GraphNode<NodeId>, SerializedGraphEdge), PristineError>> |
| 906 | + '_, |
| 907 | >, |
| 908 | > { |
| 909 | let table = self.txn.open_multimap_table(INODE_GRAPH)?; |
| 910 | |
| 911 | let inode_id = inode.get(); |
| 912 | let start_key = encode_inode_vertex(inode_id, 0, 0, 0); |
| 913 | let end_key = encode_inode_vertex(inode_id, u64::MAX, u64::MAX, u64::MAX); |
| 914 | |
| 915 | // Collect to avoid lifetime issues while preserving lazy iterator errors. |
| 916 | let mut results = Vec::new(); |
| 917 | 'entries: for result in table.range::<&[u8; 32]>(&start_key..=&end_key)? { |
| 918 | let (key, values) = match result { |
| 919 | Ok(entry) => entry, |
| 920 | Err(error) => { |
| 921 | results.push(Err(PristineError::Storage(Box::new(error)))); |
| 922 | break; |
| 923 | } |
| 924 | }; |
| 925 | let (_, change_id, start, end) = decode_inode_vertex(key.value()); |
| 926 | let node = GraphNode { |
| 927 | change: NodeId::new(change_id), |
| 928 | start: ChangePosition::new(start), |
| 929 | end: ChangePosition::new(end), |
| 930 | }; |
| 931 | |
| 932 | for value in values { |
| 933 | match value { |
| 934 | Ok(value) => { |
| 935 | let edge = deserialize_edge(value.value()); |
| 936 | results.push(Ok((node, edge))); |
| 937 | } |
| 938 | Err(error) => { |
| 939 | results.push(Err(PristineError::Storage(Box::new(error)))); |
| 940 | break 'entries; |
| 941 | } |
| 942 | } |
| 943 | } |
| 944 | } |
| 945 | |
| 946 | Ok(Box::new(results.into_iter())) |
| 947 | } |
| 948 | |
| 949 | fn get_file_index(&self, path: &str) -> PristineResult<Option<FileIndexMetadata>> { |
| 950 | let table = self.txn.open_table(FILE_INDEX)?; |