DF23IIGWXAIVX4EDVYTJ33Y65SIW7LJIZS2Z3QVADIJCIT6NEF4AC
I24UEJQLCH2SOXA4UHIYWTRDCHSOPU7AFTRUOTX7HZIAV4AZKYEQC
GHO6DWPILBBTL6CVZKERJBTFL3EY6ZT4YM4E5R4S6YPGVFKFHCVAC
TKEVOH7HXON7SOBGXTUDHAHO2U2GPTQRNESP6ERKUQAS526OZIRAC
SXEYMYF7P4RZMZ46WPL4IZUTSQ2ATBWYZX7QNVMS3SGOYXYOHAGQC
YN63NUZO4LVJ7XPMURDULTXBVJKW5MVCTZ24R7Z52QMHO3HPDUVQC
VO5OQW4W2656DIYYRNZ3PO7TQ4JOKQ3GVWE5ALUTYVMX3WMXJOYQC
I52XSRUH5RVHQBFWVMAQPTUSPAJ4KNVID2RMI3UGCVKFLYUO6WZAC
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)
}
}