AllEdges

fera_graph::params

Struct AllEdges 

Source 
pub struct AllEdges<'a, G: 'a>(pub &'a G);

Tuple Fields§

§0: &'a G

Trait Implementations§

Source§

impl<'a, G> IntoIterator for AllEdges<'a, G>
where G: 'a + EdgeList,

Source§

type Item = <G as WithEdge>::Edge

The type of the elements being iterated over.
Source§

type IntoIter = <G as EdgeTypes<'a, G>>::EdgeIter

Which kind of iterator are we turning this into?
Source§

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations§

§

impl<'a, G> Freeze for AllEdges<'a, G>

§

impl<'a, G> RefUnwindSafe for AllEdges<'a, G>
where G: RefUnwindSafe,

§

impl<'a, G> Send for AllEdges<'a, G>
where G: Sync,

§

impl<'a, G> Sync for AllEdges<'a, G>
where G: Sync,

§

impl<'a, G> Unpin for AllEdges<'a, G>

§

impl<'a, G> UnwindSafe for AllEdges<'a, G>
where G: RefUnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoOwned<T> for T

Source§

fn into_owned(self) -> T

Source§

impl<G> Sets for G

Source§

fn vertices_complement<I>(&self, vertices: I) -> VerticesComplement<'_, Self> ⓘ
where Self: VertexList + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source§

fn edges_complement<I>(&self, edges: I) -> EdgesComplement<'_, Self> ⓘ
where Self: EdgeList + WithEdgeProp<bool>, I: IntoIterator, I::Item: IntoOwned<Edge<Self>>,

Source§

fn independent_vertex_set_from_iter<I>( &self, vertices: I, ) -> IndependentVertexSetFromIter<'_, Self, I::IntoIter> ⓘ
where Self: Adjacency + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source§

fn is_independent_vertex_set<I>(&self, vertices: I) -> bool
where Self: Adjacency + WithVertexProp<bool>, I: IntoIterator, I::Item: IntoOwned<Vertex<Self>>,

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.