Method iter_rev_tree

atomic-core/src/pristine/txn/read.rs:62–70

Enumerate every `(inode, path)` pair in `REV_TREE`. Unlike [`TreeTxnT::iter_tree`], which walks the single-valued `path -> inode` `TREE` index (so it hides every inode a later same-path create overwrote), this walks the inode-keyed `REV_TREE` and therefore exposes ALL inodes that ever claimed a path. Callers use it to detect name conflicts: a path with two distinct inodes that are both visible an

(&self)

    /// use it to detect name conflicts: a path with two distinct inodes that
    /// are both visible and alive under a view's change filter.
    pub fn iter_rev_tree(&self) -> PristineResult<Vec<(Inode, String)>> {
        let table = self.txn.open_table(REV_TREE)?;
        let mut results = Vec::new();
        for entry in table.iter()? {
            let (k, v) = entry?;
            results.push((Inode::new(k.value()), v.value().to_string()));
        }
        Ok(results)
    }
}

// GraphTxnT Implementation