Struct fera_graph::props::Map

source ·

pub struct Map<P, F>(_, _);

Expand description

A property that maps the value of a wrapped property with a function.

This struct is created by PropGet::map.

Trait Implementations

source

impl<K, P, F, O> PropGet<K> for Map<P, F>where
P: PropGet<K>,
F: Fn(P::Output) -> O,

type Output = O

source

fn get(&self, k: K) -> Self::Output

Returns the value associated with key.

source

fn map<F, O>(self, fun: F) -> Map<Self, F>where
Self: Sized,
F: Fn(Self::Output) -> O,

Creates a mapped property that maps each property value using fun.

source

fn by_ref(&self) -> &Self

Returns a reference to this property.

Auto Trait Implementations

impl<P, F> RefUnwindSafe for Map<P, F>where
F: RefUnwindSafe,
P: RefUnwindSafe,

impl<P, F> Send for Map<P, F>where
F: Send,
P: Send,

impl<P, F> Sync for Map<P, F>where
F: Sync,
P: Sync,

impl<P, F> Unpin for Map<P, F>where
F: Unpin,
P: Unpin,

impl<P, F> UnwindSafe for Map<P, F>where
F: UnwindSafe,
P: UnwindSafe,

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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 vertices_complement(&self, vertices: I) -> VerticesComplement<'_, Self> ⓘwhere
 Self: VertexList + WithVertexProp<bool>,
 I: IntoIterator,
 I::Item: IntoOwned<Vertex<Self>>,

source

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

source

fn independent_vertex_set_from_iter(
 &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(&self, vertices: I) -> boolwhere
 Self: Adjacency + WithVertexProp<bool>,
 I: IntoIterator,
 I::Item: IntoOwned<Vertex<Self>>,

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

impl<P, G, T> EdgePropGet<G, T> for Pwhere
G: WithEdge,
P: PropGet<<G as WithEdge>::Edge, Output = T>,

source

Struct fera_graph::props::Map

Trait Implementations

impl<K, P, F, O> PropGet<K> for Map<P, F>where
P: PropGet<K>,
F: Fn(P::Output) -> O,

type Output = O

fn get(&self, k: K) -> Self::Output

fn map<F, O>(self, fun: F) -> Map<Self, F>where
Self: Sized,
F: Fn(Self::Output) -> O,

fn by_ref(&self) -> &Self

Auto Trait Implementations

impl<P, F> RefUnwindSafe for Map<P, F>where
F: RefUnwindSafe,
P: RefUnwindSafe,

impl<P, F> Send for Map<P, F>where
F: Send,
P: Send,

impl<P, F> Sync for Map<P, F>where
F: Sync,
P: Sync,

impl<P, F> Unpin for Map<P, F>where
F: Unpin,
P: Unpin,

impl<P, F> UnwindSafe for Map<P, F>where
F: UnwindSafe,
P: 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<G> Sets for G

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

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

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

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

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> EdgePropGet<G, T> for Pwhere
G: WithEdge,
P: PropGet<<G as WithEdge>::Edge, Output = T>,

impl<P, G, T> VertexPropGet<G, T> for Pwhere
G: WithVertex,
P: PropGet<<G as WithVertex>::Vertex, Output = T>,

Struct fera_graph::props::Map

Trait Implementations

impl<K, P, F, O> PropGet<K> for Map<P, F>where P: PropGet<K>, F: Fn(P::Output) -> O,

type Output = O

fn get(&self, k: K) -> Self::Output

fn map<F, O>(self, fun: F) -> Map<Self, F>where Self: Sized, F: Fn(Self::Output) -> O,

fn by_ref(&self) -> &Self

Auto Trait Implementations

impl<P, F> RefUnwindSafe for Map<P, F>where F: RefUnwindSafe, P: RefUnwindSafe,

impl<P, F> Send for Map<P, F>where F: Send, P: Send,

impl<P, F> Sync for Map<P, F>where F: Sync, P: Sync,

impl<P, F> Unpin for Map<P, F>where F: Unpin, P: Unpin,

impl<P, F> UnwindSafe for Map<P, F>where F: UnwindSafe, P: 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<G> Sets for G

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

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

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

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

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> EdgePropGet<G, T> for Pwhere G: WithEdge, P: PropGet<<G as WithEdge>::Edge, Output = T>,

impl<P, G, T> VertexPropGet<G, T> for Pwhere G: WithVertex, P: PropGet<<G as WithVertex>::Vertex, Output = T>,

impl<K, P, F, O> PropGet<K> for Map<P, F>where
P: PropGet<K>,
F: Fn(P::Output) -> O,

fn map<F, O>(self, fun: F) -> Map<Self, F>where
Self: Sized,
F: Fn(Self::Output) -> O,

impl<P, F> RefUnwindSafe for Map<P, F>where
F: RefUnwindSafe,
P: RefUnwindSafe,

impl<P, F> Send for Map<P, F>where
F: Send,
P: Send,

impl<P, F> Sync for Map<P, F>where
F: Sync,
P: Sync,

impl<P, F> Unpin for Map<P, F>where
F: Unpin,
P: Unpin,

impl<P, F> UnwindSafe for Map<P, F>where
F: UnwindSafe,
P: UnwindSafe,

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

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

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

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

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

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

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

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

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

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

impl<P, G, T> EdgePropGet<G, T> for Pwhere
G: WithEdge,
P: PropGet<<G as WithEdge>::Edge, Output = T>,

impl<P, G, T> VertexPropGet<G, T> for Pwhere
G: WithVertex,
P: PropGet<<G as WithVertex>::Vertex, Output = T>,