MCPcopy Create free account
hub / github.com/atomicdotdev/atomic / iter_rev_tree

Method iter_rev_tree

atomic-core/src/pristine/txn/read.rs:135–143  ·  view source on GitHub ↗

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)

Source from the content-addressed store, hash-verified

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
146impl SetIdIndexTxnT for ReadTxn {

Callers 3

iter_rev_tree_pairsMethod · 0.80
collect_name_conflictsFunction · 0.80
visible_file_pathsMethod · 0.80

Calls 3

valueMethod · 0.80
iterMethod · 0.45
pushMethod · 0.45

Tested by

no test coverage detected