pub struct NeighborIterator<'a, T: Transaction> { /* private fields */ }Expand description
Iterator over single-hop neighbors.
Implementations§
Source§impl<'a, T: Transaction> NeighborIterator<'a, T>
impl<'a, T: Transaction> NeighborIterator<'a, T>
Sourcepub const fn new(tx: &'a T, node: EntityId, direction: Direction) -> Self
pub const fn new(tx: &'a T, node: EntityId, direction: Direction) -> Self
Create a new neighbor iterator.
Sourcepub fn with_edge_type(self, edge_type: impl Into<EdgeType>) -> Self
pub fn with_edge_type(self, edge_type: impl Into<EdgeType>) -> Self
Filter to a specific edge type.
Sourcepub fn collect_all(self) -> GraphResult<Vec<ExpandResult>>
pub fn collect_all(self) -> GraphResult<Vec<ExpandResult>>
Collect all neighbors.
Auto Trait Implementations§
impl<'a, T> Freeze for NeighborIterator<'a, T>
impl<'a, T> RefUnwindSafe for NeighborIterator<'a, T>where
T: RefUnwindSafe,
impl<'a, T> Send for NeighborIterator<'a, T>where
T: Sync,
impl<'a, T> Sync for NeighborIterator<'a, T>where
T: Sync,
impl<'a, T> Unpin for NeighborIterator<'a, T>
impl<'a, T> UnsafeUnpin for NeighborIterator<'a, T>
impl<'a, T> UnwindSafe for NeighborIterator<'a, T>where
T: RefUnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more