fera::graph::props

Struct DelegateEdgeProp

pub struct DelegateEdgeProp<G, T>(/* private fields */)
where
    G: WithEdgeProp<T>;

Expand description

An edge property that delegates all operations to a wrapped property.

Trait Implementations§

Source §

impl<G, D, T> EdgePropMutNew<G, T> for DelegateEdgeProp<D, T>
where G: WithEdge<Edge = <D as WithEdge>::Edge, OptionEdge = <D as WithEdge>::OptionEdge> + AsRef<D>, D: WithEdgeProp<T>,

Source §

fn new_edge_prop(g: &G, value: T) -> DelegateEdgeProp<D, T>
where T: Clone,

Creates a new edge prop. Read more

Source §

impl<G, T> Index<<G as WithEdge>::Edge> for DelegateEdgeProp<G, T>
where G: WithEdgeProp<T>,

Source §

type Output = T

The returned type after indexing.

Source §

fn index( &self, v: <G as WithEdge>::Edge, ) -> &<DelegateEdgeProp<G, T> as Index<<G as WithEdge>::Edge>>::Output

Performs the indexing (container[index]) operation. Read more

Source §

impl<G, T> IndexMut<<G as WithEdge>::Edge> for DelegateEdgeProp<G, T>
where G: WithEdgeProp<T>,

Source §

fn index_mut( &mut self, v: <G as WithEdge>::Edge, ) -> &mut <DelegateEdgeProp<G, T> as Index<<G as WithEdge>::Edge>>::Output

Performs the mutable indexing (container[index]) operation. Read more

Auto Trait Implementations§

§

impl<G, T> Freeze for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Freeze,

§

impl<G, T> RefUnwindSafe for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: RefUnwindSafe,

§

impl<G, T> Send for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Send,

§

impl<G, T> Sync for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Sync,

§

impl<G, T> Unpin for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Unpin,

§

impl<G, T> UnwindSafe for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: UnwindSafe,

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 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 §

fn set_values_from<P, I>(&mut self, iter: I, source: &P)
where I: IntoIterator, ::Item: IntoOwned<Idx>, Idx: Clone, P: Index<Idx, Output = Self::Output>, Self::Output: Clone,

Set the value associated with each key produced by iter to the value associated with the key in the property source.

Source §

fn set_values(&mut self, iter: I, value: Self::Output)
where I: IntoIterator, ::Item: IntoOwned<Idx>, Self::Output: Clone,

Set the value associated with keys produced by iter to value.

Source §

impl<G> Sets for G

Source §

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

Source §

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

Source §

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

Source §

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

Source §

impl<T, U> TryFrom 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>::Error>

Performs the conversion.

Source §

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

Source §

type Error = >::Error

The type returned in the event of a conversion error.

Source §

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

Performs the conversion.

Source §

impl<P, G, T> EdgeProp<G, T> for P
where G: WithEdge, P: Index<<G as WithEdge>::Edge, Output = T>,

Source §

impl<P, G, T> EdgePropMut<G, T> for P
where G: WithEdge, P: IndexMut<<G as WithEdge>::Edge, Output = T>,

Source §

impl<P, G, T> VertexProp<G, T> for P
where G: WithVertex, P: Index<<G as WithVertex>::Vertex, Output = T>,

Source §

DelegateEdgeProp

Struct DelegateEdgeProp Copy item path

Trait Implementations§

impl<G, D, T> EdgePropMutNew<G, T> for DelegateEdgeProp<D, T>where G: WithEdge<Edge = <D as WithEdge>::Edge, OptionEdge = <D as WithEdge>::OptionEdge> + AsRef<D>, D: WithEdgeProp<T>,

fn new_edge_prop(g: &G, value: T) -> DelegateEdgeProp<D, T>where T: Clone,

impl<G, T> Index<<G as WithEdge>::Edge> for DelegateEdgeProp<G, T>where G: WithEdgeProp<T>,

type Output = T

fn index( &self, v: <G as WithEdge>::Edge, ) -> &<DelegateEdgeProp<G, T> as Index<<G as WithEdge>::Edge>>::Output

impl<G, T> IndexMut<<G as WithEdge>::Edge> for DelegateEdgeProp<G, T>where G: WithEdgeProp<T>,

fn index_mut( &mut self, v: <G as WithEdge>::Edge, ) -> &mut <DelegateEdgeProp<G, T> as Index<<G as WithEdge>::Edge>>::Output

Auto Trait Implementations§

impl<G, T> Freeze for DelegateEdgeProp<G, T>where <G as WithEdgeProp<T>>::EdgeProp: Freeze,

impl<G, T> RefUnwindSafe for DelegateEdgeProp<G, T>where <G as WithEdgeProp<T>>::EdgeProp: RefUnwindSafe,

impl<G, T> Send for DelegateEdgeProp<G, T>where <G as WithEdgeProp<T>>::EdgeProp: Send,

impl<G, T> Sync for DelegateEdgeProp<G, T>where <G as WithEdgeProp<T>>::EdgeProp: Sync,

impl<G, T> Unpin for DelegateEdgeProp<G, T>where <G as WithEdgeProp<T>>::EdgeProp: Unpin,

impl<G, T> UnwindSafe for DelegateEdgeProp<G, T>where <G as WithEdgeProp<T>>::EdgeProp: UnwindSafe,

Blanket Implementations§

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> IntoOwned<T> for T

fn into_owned(self) -> T

impl<P, Idx> PropIndexMut<Idx> for Pwhere P: IndexMut<Idx>,

fn set_values_from<P, I>(&mut self, iter: I, source: &P)where I: IntoIterator, <I as IntoIterator>::Item: IntoOwned<Idx>, Idx: Clone, P: Index<Idx, Output = Self::Output>, Self::Output: Clone,

fn set_values<I>(&mut self, iter: I, value: Self::Output)where I: IntoIterator, <I as IntoIterator>::Item: IntoOwned<Idx>, Self::Output: Clone,

impl<G> Sets for G

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

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

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

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

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

type Error = Infallible

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

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

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

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

impl<P, G, T> EdgeProp<G, T> for Pwhere G: WithEdge, P: Index<<G as WithEdge>::Edge, Output = T>,

impl<P, G, T> EdgePropMut<G, T> for Pwhere G: WithEdge, P: IndexMut<<G as WithEdge>::Edge, Output = T>,

impl<P, G, T> VertexProp<G, T> for Pwhere G: WithVertex, P: Index<<G as WithVertex>::Vertex, Output = T>,

impl<P, G, T> VertexPropMut<G, T> for Pwhere G: WithVertex, P: IndexMut<<G as WithVertex>::Vertex, Output = T>,

Struct DelegateEdgeProp

impl<G, D, T> EdgePropMutNew<G, T> for DelegateEdgeProp<D, T>
where G: WithEdge<Edge = <D as WithEdge>::Edge, OptionEdge = <D as WithEdge>::OptionEdge> + AsRef<D>, D: WithEdgeProp<T>,

fn new_edge_prop(g: &G, value: T) -> DelegateEdgeProp<D, T>
where T: Clone,

impl<G, T> Index<<G as WithEdge>::Edge> for DelegateEdgeProp<G, T>
where G: WithEdgeProp<T>,

impl<G, T> IndexMut<<G as WithEdge>::Edge> for DelegateEdgeProp<G, T>
where G: WithEdgeProp<T>,

impl<G, T> Freeze for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Freeze,

impl<G, T> RefUnwindSafe for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: RefUnwindSafe,

impl<G, T> Send for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Send,

impl<G, T> Sync for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Sync,

impl<G, T> Unpin for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: Unpin,

impl<G, T> UnwindSafe for DelegateEdgeProp<G, T>
where <G as WithEdgeProp<T>>::EdgeProp: UnwindSafe,

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

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

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

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

impl<P, Idx> PropIndexMut<Idx> for P
where P: IndexMut<Idx>,

fn set_values_from<P, I>(&mut self, iter: I, source: &P)
where I: IntoIterator, <I as IntoIterator>::Item: IntoOwned<Idx>, Idx: Clone, P: Index<Idx, Output = Self::Output>, Self::Output: Clone,

fn set_values<I>(&mut self, iter: I, value: Self::Output)
where I: IntoIterator, <I as IntoIterator>::Item: IntoOwned<Idx>, Self::Output: Clone,

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

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

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

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

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

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

impl<P, G, T> EdgeProp<G, T> for P
where G: WithEdge, P: Index<<G as WithEdge>::Edge, Output = T>,

impl<P, G, T> EdgePropMut<G, T> for P
where G: WithEdge, P: IndexMut<<G as WithEdge>::Edge, Output = T>,

impl<P, G, T> VertexProp<G, T> for P
where G: WithVertex, P: Index<<G as WithVertex>::Vertex, Output = T>,

impl<P, G, T> VertexPropMut<G, T> for P
where G: WithVertex, P: IndexMut<<G as WithVertex>::Vertex, Output = T>,