New method to iterate on a graph: libpijul::pristine::GraphIter::iter_graph
Dependencies
- [2]
I24UEJQLVarious post-fire fixes - [3]
I52XSRUHMassive cleanup, and simplification - [4]
DNQHXWRZaddress clippy hard errors - [5]
VO5OQW4WRemoving anyhow in libpijul - [6]
CCLLB7OIUpgrading to Sanakirja 0.15 + version bump - [7]
GHO6DWPIRefactoring iterators - [8]
YN63NUZOSanakirja 1.0 - [9]
QMTANHVNReset: only output changed files - [10]
TKEVOH7HFixing a bug when downloading changes, and making change download more efficient (more async) - [11]
AAXP2534Tags: completing the subcommand - [12]
QL6K2ZM3Tags - [*]
SXEYMYF7Fixing the bad changes in history (unfortunately, by rebooting).
Change contents
- replacement in libpijul/src/pristine/mod.rs at line 478
fn iter_graph(fn graph_cursor( - edit in libpijul/src/pristine/mod.rs at line 488
fn iter_graph<'a>(&'a self,g: &'a Self::Graph,s: Option<&Vertex<ChangeId>>,) -> Result<GraphIterator<'a, Self>, TxnErr<Self::GraphError>> {Ok(GraphIterator {cursor: self.graph_cursor(g, s)?,txn: self,g: g,})} - edit in libpijul/src/pristine/mod.rs at line 502
pub struct GraphIterator<'a, T: GraphIter> {txn: &'a T,g: &'a T::Graph,cursor: T::GraphCursor,}impl<'a, T: GraphIter> Iterator for GraphIterator<'a, T> {type Item = Result<(&'a Vertex<ChangeId>, &'a SerializedEdge), TxnErr<T::GraphError>>;fn next(&mut self) -> Option<Self::Item> {self.txn.next_graph(self.g, &mut self.cursor)}} - replacement in libpijul/src/pristine/mod.rs at line 1090
let mut cursor = txn.iter_graph(&channel, None).unwrap();let mut cursor = txn.graph_cursor(&channel, None).unwrap(); - replacement in libpijul/src/pristine/mod.rs at line 1138
let mut cursor = txn.iter_graph(&channel, None).unwrap();let mut cursor = txn.graph_cursor(&channel, None).unwrap(); - replacement in libpijul/src/pristine/sanakirja.rs at line 631
fn iter_graph(fn graph_cursor(