(
&self,
)
| 885 | } |
| 886 | |
| 887 | fn iter_tree( |
| 888 | &self, |
| 889 | ) -> PristineResult<Box<dyn Iterator<Item = Result<(String, Inode), PristineError>> + '_>> { |
| 890 | let table = self.txn.open_table(TREE)?; |
| 891 | // Collect to avoid lifetime issues while preserving lazy iterator errors. |
| 892 | let results = collect_until_error(table.iter()?.map(|result| { |
| 893 | result |
| 894 | .map(|(key, value)| (key.value().to_string(), Inode::new(value.value()))) |
| 895 | .map_err(|error| PristineError::Storage(Box::new(error))) |
| 896 | })); |
| 897 | Ok(Box::new(results.into_iter())) |
| 898 | } |
| 899 | |
| 900 | fn iter_inode_vertices( |
| 901 | &self, |
no test coverage detected