Struct rs_graph::attributed::GraphAttrs

source ·

pub struct GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
    G: 'a + Graph<'a>,
    Gx: 'a,
    Nx: 'a,
    Ex: 'a,
    Ax: 'a,{ /* private fields */ }

Expand description

Accessor for graph attributes.

Trait Implementations

source

impl<'a, G, Gx, Nx, Ex, Ax> Attributes for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexGraph<'a>,

type Node = <G as Graph<'a>>::Node

Type of nodes of the associated graph.

type Edge = <G as Graph<'a>>::Edge

Type of edges of the associated graph.

type GraphAttr = Gx

Type of graph attributes.

type NodeAttr = Nx

Type of node attributes.

type EdgeAttr = Ex

Type of edge attributes.

source

fn attr(&self) -> &Self::GraphAttr

Return the graph attributes.

source

fn attr_mut(&mut self) -> &mut Self::GraphAttr

Return the graph attributes.

source

fn node(&self, u: Self::Node) -> &Self::NodeAttr

Return the attributes of a node.

source

fn node_mut(&mut self, u: Self::Node) -> &mut Self::NodeAttr

Return the attributes of a node.

source

fn edge(&self, e: Self::Edge) -> &Self::EdgeAttr

Return the attributes of an edge.

source

fn edge_mut(&mut self, e: Self::Edge) -> &mut Self::EdgeAttr

Return the attributes of an edge.

source

impl<'a, G, Gx, Nx, Ex, Ax> Deref for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexGraph<'a>,

type Target = Gx

The resulting type after dereferencing.

source

fn deref(&self) -> &Gx

Dereferences the value.

source

impl<'a, G, Gx, Nx, Ex, Ax> DerefMut for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexGraph<'a>,

source

fn deref_mut(&mut self) -> &mut Gx

Mutably dereferences the value.

source

impl<'a, G, Gx, Nx, Ex, Ax> NetworkAttributes for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexNetwork<'a>,

type BiEdgeAttr = Ax

Type of biedge attributes.

source

fn biedge(&self, e: Self::Edge) -> &Self::BiEdgeAttr

Return the attributes of a biedge.

source

fn biedge_mut(&mut self, e: Self::Edge) -> &mut Self::BiEdgeAttr

Return the attributes of a biedge.

Auto Trait Implementations

impl<'a, G, Gx, Nx, Ex, Ax> RefUnwindSafe for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
 Ax: RefUnwindSafe,
 Ex: RefUnwindSafe,
 G: RefUnwindSafe,
 Gx: RefUnwindSafe,
 Nx: RefUnwindSafe,

impl<'a, G, Gx, Nx, Ex, Ax> Send for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
 Ax: Send,
 Ex: Send,
 G: Sync,
 Gx: Send,
 Nx: Send,

impl<'a, G, Gx, Nx, Ex, Ax> Sync for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
 Ax: Sync,
 Ex: Sync,
 G: Sync,
 Gx: Sync,
 Nx: Sync,

impl<'a, G, Gx, Nx, Ex, Ax> Unpin for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>

impl<'a, G, Gx, Nx, Ex, Ax> !UnwindSafe for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>

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

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.

Struct rs_graph::attributed::GraphAttrs

Trait Implementations

impl<'a, G, Gx, Nx, Ex, Ax> Attributes for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where G: IndexGraph<'a>,

type Node = <G as Graph<'a>>::Node

type Edge = <G as Graph<'a>>::Edge

type GraphAttr = Gx

type NodeAttr = Nx

type EdgeAttr = Ex

fn attr(&self) -> &Self::GraphAttr

fn attr_mut(&mut self) -> &mut Self::GraphAttr

fn node(&self, u: Self::Node) -> &Self::NodeAttr

fn node_mut(&mut self, u: Self::Node) -> &mut Self::NodeAttr

fn edge(&self, e: Self::Edge) -> &Self::EdgeAttr

fn edge_mut(&mut self, e: Self::Edge) -> &mut Self::EdgeAttr

impl<'a, G, Gx, Nx, Ex, Ax> Deref for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where G: IndexGraph<'a>,

type Target = Gx

fn deref(&self) -> &Gx

impl<'a, G, Gx, Nx, Ex, Ax> DerefMut for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where G: IndexGraph<'a>,

fn deref_mut(&mut self) -> &mut Gx

impl<'a, G, Gx, Nx, Ex, Ax> NetworkAttributes for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where G: IndexNetwork<'a>,

type BiEdgeAttr = Ax

fn biedge(&self, e: Self::Edge) -> &Self::BiEdgeAttr

fn biedge_mut(&mut self, e: Self::Edge) -> &mut Self::BiEdgeAttr

Auto Trait Implementations

impl<'a, G, Gx, Nx, Ex, Ax> RefUnwindSafe for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where Ax: RefUnwindSafe, Ex: RefUnwindSafe, G: RefUnwindSafe, Gx: RefUnwindSafe, Nx: RefUnwindSafe,

impl<'a, G, Gx, Nx, Ex, Ax> Send for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where Ax: Send, Ex: Send, G: Sync, Gx: Send, Nx: Send,

impl<'a, G, Gx, Nx, Ex, Ax> Sync for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where Ax: Sync, Ex: Sync, G: Sync, Gx: Sync, Nx: Sync,

impl<'a, G, Gx, Nx, Ex, Ax> Unpin for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>

impl<'a, G, Gx, Nx, Ex, Ax> !UnwindSafe for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>

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, 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<'a, G, Gx, Nx, Ex, Ax> Attributes for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexGraph<'a>,

impl<'a, G, Gx, Nx, Ex, Ax> Deref for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexGraph<'a>,

impl<'a, G, Gx, Nx, Ex, Ax> DerefMut for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexGraph<'a>,

impl<'a, G, Gx, Nx, Ex, Ax> NetworkAttributes for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
G: IndexNetwork<'a>,

impl<'a, G, Gx, Nx, Ex, Ax> RefUnwindSafe for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
Ax: RefUnwindSafe,
Ex: RefUnwindSafe,
G: RefUnwindSafe,
Gx: RefUnwindSafe,
Nx: RefUnwindSafe,

impl<'a, G, Gx, Nx, Ex, Ax> Send for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
Ax: Send,
Ex: Send,
G: Sync,
Gx: Send,
Nx: Send,

impl<'a, G, Gx, Nx, Ex, Ax> Sync for GraphAttrs<'a, G, Gx, Nx, Ex, Ax>where
Ax: Sync,
Ex: Sync,
G: Sync,
Gx: Sync,
Nx: Sync,

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

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

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