Struct rs_graph::adapters::network::NetworkNeighIt[−][src]

pub struct NetworkNeighIt<G, I>(_, _)
 where
    I: GraphIterator<G>;

Trait Implementations

`impl<'a, G, I> Clone for NetworkNeighIt<G, I> where I: GraphIterator<G>, I::Item: Clone,` [src]

`fn clone(&self) -> Self`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0 [src]

`impl<'a, G, I, N, E> GraphIterator<Network<'a, G>> for NetworkNeighIt<G, I> where N: Clone, E: Clone, I: GraphIterator<G, Item = (E, N)>,` [src]

`type Item = (NetworkEdge<E>, N)`

`fn next(&mut self, net: &Network<'a, G>) -> Option<Self::Item>`[src]

`fn size_hint(&self, net: &Network<'a, G>) -> (usize, Option<usize>)`[src]

`fn count(self, net: &Network<'a, G>) -> usize`[src]

`fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘNotable traits for GraphIter<'a, G, I> impl<'a, G, I> Iterator for GraphIter<'a, G, I> where I: GraphIterator<G>, type Item = I::Item; where G: Sized,` [src]

Auto Trait Implementations

`impl<G, I> RefUnwindSafe for NetworkNeighIt<G, I> where I: RefUnwindSafe, >::Item: RefUnwindSafe,`

`impl<G, I> Send for NetworkNeighIt<G, I> where I: Send, >::Item: Send,`

`impl<G, I> Sync for NetworkNeighIt<G, I> where I: Sync, >::Item: Sync,`

`impl<G, I> Unpin for NetworkNeighIt<G, I> where I: Unpin, >::Item: Unpin,`

`impl<G, I> UnwindSafe for NetworkNeighIt<G, I> where I: UnwindSafe, >::Item: UnwindSafe,`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

The resulting type after obtaining ownership.

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

Struct rs_graph::adapters::network::NetworkNeighIt[−][src]

Trait Implementations

`impl<'a, G, I> Clone for NetworkNeighIt<G, I> where I: GraphIterator<G>, I::Item: Clone,` [src]

`fn clone(&self) -> Self`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0 [src]

`impl<'a, G, I, N, E> GraphIterator<Network<'a, G>> for NetworkNeighIt<G, I> where N: Clone, E: Clone, I: GraphIterator<G, Item = (E, N)>,` [src]

`type Item = (NetworkEdge<E>, N)`

`fn next(&mut self, net: &Network<'a, G>) -> Option<Self::Item>`[src]

`fn size_hint(&self, net: &Network<'a, G>) -> (usize, Option<usize>)`[src]

`fn count(self, net: &Network<'a, G>) -> usize`[src]

`fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘNotable traits for GraphIter<'a, G, I> impl<'a, G, I> Iterator for GraphIter<'a, G, I> where I: GraphIterator<G>, type Item = I::Item; where G: Sized,` [src]

Notable traits for GraphIter<'a, G, I>

Auto Trait Implementations

`impl<G, I> RefUnwindSafe for NetworkNeighIt<G, I> where I: RefUnwindSafe, <I as GraphIterator<G>>::Item: RefUnwindSafe,`

`impl<G, I> Send for NetworkNeighIt<G, I> where I: Send, <I as GraphIterator<G>>::Item: Send,`

`impl<G, I> Sync for NetworkNeighIt<G, I> where I: Sync, <I as GraphIterator<G>>::Item: Sync,`

`impl<G, I> Unpin for NetworkNeighIt<G, I> where I: Unpin, <I as GraphIterator<G>>::Item: Unpin,`

`impl<G, I> UnwindSafe for NetworkNeighIt<G, I> where I: UnwindSafe, <I as GraphIterator<G>>::Item: UnwindSafe,`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into<U> for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom<U> for T where U: Into<T>,` [src]

`type Error = Infallible`

`pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>`[src]

`impl<T, U> TryInto<U> for T where U: TryFrom<T>,` [src]

`type Error = <U as TryFrom<T>>::Error`

`pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>`[src]

Struct rs_graph::adapters::network::NetworkNeighIt⎘[−][src]

Trait Implementations

impl<'a, G, I> Clone for NetworkNeighIt<G, I> where I: GraphIterator<G>, I::Item: Clone, [src]

fn clone(&self) -> Self[src]

pub fn clone_from(&mut self, source: &Self)1.0.0[src]

impl<'a, G, I, N, E> GraphIterator<Network<'a, G>> for NetworkNeighIt<G, I> where N: Clone, E: Clone, I: GraphIterator<G, Item = (E, N)>, [src]

type Item = (NetworkEdge<E>, N)

fn next(&mut self, net: &Network<'a, G>) -> Option<Self::Item>[src]

fn size_hint(&self, net: &Network<'a, G>) -> (usize, Option<usize>)[src]

fn count(self, net: &Network<'a, G>) -> usize[src]

fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘNotable traits for GraphIter<'a, G, I>impl<'a, G, I> Iterator for GraphIter<'a, G, I> where I: GraphIterator<G>, type Item = I::Item; where G: Sized, [src]

Notable traits for GraphIter<'a, G, I>

Auto Trait Implementations

impl<G, I> RefUnwindSafe for NetworkNeighIt<G, I> where I: RefUnwindSafe, <I as GraphIterator<G>>::Item: RefUnwindSafe,

impl<G, I> Send for NetworkNeighIt<G, I> where I: Send, <I as GraphIterator<G>>::Item: Send,

impl<G, I> Sync for NetworkNeighIt<G, I> where I: Sync, <I as GraphIterator<G>>::Item: Sync,

impl<G, I> Unpin for NetworkNeighIt<G, I> where I: Unpin, <I as GraphIterator<G>>::Item: Unpin,

impl<G, I> UnwindSafe for NetworkNeighIt<G, I> where I: UnwindSafe, <I as GraphIterator<G>>::Item: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<T> ToOwned for T where T: Clone, [src]

type Owned = T

pub fn to_owned(&self) -> T[src]

pub fn clone_into(&self, target: &mut T)[src]

impl<T, U> TryFrom<U> for T where U: Into<T>, [src]

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]

impl<T, U> TryInto<U> for T where U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

Struct rs_graph::adapters::network::NetworkNeighIt[−][src]

`impl<'a, G, I> Clone for NetworkNeighIt<G, I> where I: GraphIterator<G>, I::Item: Clone,` [src]

`fn clone(&self) -> Self`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0 [src]

`impl<'a, G, I, N, E> GraphIterator<Network<'a, G>> for NetworkNeighIt<G, I> where N: Clone, E: Clone, I: GraphIterator<G, Item = (E, N)>,` [src]

`type Item = (NetworkEdge<E>, N)`

`fn next(&mut self, net: &Network<'a, G>) -> Option<Self::Item>`[src]

`fn size_hint(&self, net: &Network<'a, G>) -> (usize, Option<usize>)`[src]

`fn count(self, net: &Network<'a, G>) -> usize`[src]

`fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘNotable traits for GraphIter<'a, G, I> impl<'a, G, I> Iterator for GraphIter<'a, G, I> where I: GraphIterator<G>, type Item = I::Item; where G: Sized,` [src]

`impl<G, I> RefUnwindSafe for NetworkNeighIt<G, I> where I: RefUnwindSafe, <I as GraphIterator<G>>::Item: RefUnwindSafe,`

`impl<G, I> Send for NetworkNeighIt<G, I> where I: Send, <I as GraphIterator<G>>::Item: Send,`

`impl<G, I> Sync for NetworkNeighIt<G, I> where I: Sync, <I as GraphIterator<G>>::Item: Sync,`

`impl<G, I> Unpin for NetworkNeighIt<G, I> where I: Unpin, <I as GraphIterator<G>>::Item: Unpin,`

`impl<G, I> UnwindSafe for NetworkNeighIt<G, I> where I: UnwindSafe, <I as GraphIterator<G>>::Item: UnwindSafe,`

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into<U> for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom<U> for T where U: Into<T>,` [src]

`type Error = Infallible`

`pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>`[src]

`impl<T, U> TryInto<U> for T where U: TryFrom<T>,` [src]

`type Error = <U as TryFrom<T>>::Error`

`pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>`[src]