Struct Attrs 

pub struct Attrs<I = usize, K = Undirected> { /* private fields */ }

Attrs is a generic implementation of the GraphProps trait, enabling the definition of hypergraphs with different index types and graph kinds (i.e., Directed or Undirected).

Implementations

impl<I, K> Attrs<I, K>

pub const fn new() -> Self

where I: RawIndex, K: GraphType,

returns a new instance of Attrs initialized with the given index and kind.

pub fn with_kind<K2>(self) -> Attrs<I, K2>

where K2: GraphType,

consumes the current instance to create another with the given kind

pub fn with_index<I2>(self) -> Attrs<I2, K>

where I2: RawIndex,

consumes the current instance to create another with the given index type

pub fn is_kind<K2: 'static>(&self) -> bool

where K: GraphType,

returns true if the current kind K is the same as the given kind K2

pub fn is_index<I2: 'static>(&self) -> bool

where I: RawIndex,

returns true if the current index type I is the same as the given index type I2

pub fn is_directed(&self) -> bool

where K: GraphType,

returns true if the current kind is Directed

pub fn is_undirected(&self) -> bool

where K: GraphType,

returns true if the current kind is Undirected

pub fn mode(&self) -> Mode

where K: GraphType,

returns the kind of the graph as an enum variant of Mode

impl<I> Attrs<I, Directed>

where I: RawIndex,

pub const fn directed() -> Self

initializes a new instance of Attrs with the kind set to Directed.

impl<I> Attrs<I, Undirected>

where I: RawIndex,

pub const fn undirected() -> Self

initializes a new instance of Attrs with the kind set to Undirected.

Trait Implementations

impl<I, K> Clone for Attrs<I, K>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I, K> Debug for Attrs<I, K>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<I, K> Default for Attrs<I, K>

where I: RawIndex, K: GraphType,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, I, K> Deserialize<'de> for Attrs<I, K>

where Attrs<I, K>: Default,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<I, K> Display for Attrs<I, K>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<I, K> GraphProps for Attrs<I, K>

where I: RawIndex, K: GraphType,

type Ix = I

type Kind = K

fn new() -> Self

returns a new instance of the graph attributes.

fn phantom() -> PhantomData<(Self::Kind, Self::Ix)>

returns a PhantomData instance of the graph attributes.

fn into_phantom(self) -> PhantomData<(Self::Kind, Self::Ix)>

convert the current attributes into a PhantomData instance.

fn is_directed(&self) -> bool

returns true if the attributes are directed.

fn is_undirected(&self) -> bool

returns true if the attributes are undirected.

fn mode(&self) -> Mode

returns the Mode of the graph

impl<I: Hash, K: Hash> Hash for Attrs<I, K>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I: Ord, K: Ord> Ord for Attrs<I, K>

fn cmp(&self, other: &Attrs<I, K>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<I: PartialEq, K: PartialEq> PartialEq for Attrs<I, K>

fn eq(&self, other: &Attrs<I, K>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I: PartialOrd, K: PartialOrd> PartialOrd for Attrs<I, K>

fn partial_cmp(&self, other: &Attrs<I, K>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I, K> Serialize for Attrs<I, K>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<I, K> Copy for Attrs<I, K>

impl<I: Eq, K: Eq> Eq for Attrs<I, K>

impl<I, K> Send for Attrs<I, K>

impl<I, K> StructuralPartialEq for Attrs<I, K>

impl<I, K> Sync for Attrs<I, K>