Enumerate every `(inode, path)` pair in `REV_TREE`. Healthy databases contain the exact inverse of `TREE`. Legacy reverse-only rows may be inspected during migration, but durable name claims belong in `PATH_CLAIMS` and must not be created here.
(&self)
| 133 | /// reverse-only rows may be inspected during migration, but durable name |
| 134 | /// claims belong in `PATH_CLAIMS` and must not be created here. |
| 135 | pub fn iter_rev_tree(&self) -> PristineResult<Vec<(Inode, String)>> { |
| 136 | let table = self.txn.open_table(REV_TREE)?; |
| 137 | let mut results = Vec::new(); |
| 138 | for entry in table.iter()? { |
| 139 | let (k, v) = entry?; |
| 140 | results.push((Inode::new(k.value()), v.value().to_string())); |
| 141 | } |
| 142 | Ok(results) |
| 143 | } |
| 144 | } |
| 145 | |
| 146 | impl SetIdIndexTxnT for ReadTxn { |
no test coverage detected