Struct rs_graph::filtered::FilterEdgeIt[−][src]

pub struct FilterEdgeIt<I>(_);

Trait Implementations

`impl<I: Clone> Clone for FilterEdgeIt`[src]

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

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

`impl<'a, G, P> GraphIterator<FilteredGraph<'a, G, P>> for FilterEdgeIt<G::EdgeIt> where G: GraphSize<'a>, P: for<'r> Fn(&'r G::Edge) -> bool,` [src]

`type Item = G::Edge`

`fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<G::Edge>`[src]

`fn size_hint(&self, _g: &G) -> (usize, Option<usize>)`[src]

`fn count(self, g: &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 RefUnwindSafe for FilterEdgeIt where I: RefUnwindSafe,`

`impl Send for FilterEdgeIt where I: Send,`

`impl Sync for FilterEdgeIt where I: Sync,`

`impl Unpin for FilterEdgeIt where I: Unpin,`

`impl UnwindSafe for FilterEdgeIt where I: 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::filtered::FilterEdgeIt[−][src]

Trait Implementations

`impl<I: Clone> Clone for FilterEdgeIt<I>`[src]

`fn clone(&self) -> FilterEdgeIt<I>`[src]

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

`impl<'a, G, P> GraphIterator<FilteredGraph<'a, G, P>> for FilterEdgeIt<G::EdgeIt> where G: GraphSize<'a>, P: for<'r> Fn(&'r G::Edge) -> bool,` [src]

`type Item = G::Edge`

`fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<G::Edge>`[src]

`fn size_hint(&self, _g: &G) -> (usize, Option<usize>)`[src]

`fn count(self, g: &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<I> RefUnwindSafe for FilterEdgeIt<I> where I: RefUnwindSafe,`

`impl<I> Send for FilterEdgeIt<I> where I: Send,`

`impl<I> Sync for FilterEdgeIt<I> where I: Sync,`

`impl<I> Unpin for FilterEdgeIt<I> where I: Unpin,`

`impl<I> UnwindSafe for FilterEdgeIt<I> where I: 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::filtered::FilterEdgeIt⎘[−][src]

Trait Implementations

impl<I: Clone> Clone for FilterEdgeIt<I>[src]

fn clone(&self) -> FilterEdgeIt<I>[src]

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

impl<'a, G, P> GraphIterator<FilteredGraph<'a, G, P>> for FilterEdgeIt<G::EdgeIt> where G: GraphSize<'a>, P: for<'r> Fn(&'r G::Edge) -> bool, [src]

type Item = G::Edge

fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<G::Edge>[src]

fn size_hint(&self, _g: &G) -> (usize, Option<usize>)[src]

fn count(self, g: &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<I> RefUnwindSafe for FilterEdgeIt<I> where I: RefUnwindSafe,

impl<I> Send for FilterEdgeIt<I> where I: Send,

impl<I> Sync for FilterEdgeIt<I> where I: Sync,

impl<I> Unpin for FilterEdgeIt<I> where I: Unpin,

impl<I> UnwindSafe for FilterEdgeIt<I> where I: 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::filtered::FilterEdgeIt[−][src]

`impl<I: Clone> Clone for FilterEdgeIt<I>`[src]

`fn clone(&self) -> FilterEdgeIt<I>`[src]

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

`impl<'a, G, P> GraphIterator<FilteredGraph<'a, G, P>> for FilterEdgeIt<G::EdgeIt> where G: GraphSize<'a>, P: for<'r> Fn(&'r G::Edge) -> bool,` [src]

`type Item = G::Edge`

`fn next(&mut self, g: &FilteredGraph<'a, G, P>) -> Option<G::Edge>`[src]

`fn size_hint(&self, _g: &G) -> (usize, Option<usize>)`[src]

`fn count(self, g: &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<I> RefUnwindSafe for FilterEdgeIt<I> where I: RefUnwindSafe,`

`impl<I> Send for FilterEdgeIt<I> where I: Send,`

`impl<I> Sync for FilterEdgeIt<I> where I: Sync,`

`impl<I> Unpin for FilterEdgeIt<I> where I: Unpin,`

`impl<I> UnwindSafe for FilterEdgeIt<I> where I: 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]