Struct pi_graph::NGraph

source · [−]

pub struct NGraph<K: Hash + Eq + Sized + Debug, T> { /* private fields */ }

Expand description

图

Implementations

source

impl<K: Hash + Eq + Sized + Debug, T> NGraph<K, T>

source

pub fn reset(&self)

重置图

source

pub fn gen_graph_from_keys(&self, keys: &[K]) -> Self

遍历局部图

Trait Implementations

source

impl<K: Debug + Hash + Eq + Sized + Debug, T: Debug> Debug for NGraph<K, T>

source

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

Formats the value using the given formatter. Read more

source

impl<K: Default + Hash + Eq + Sized + Debug, T: Default> Default for NGraph<K, T>

source

fn default() -> NGraph<K, T>

Returns the “default value” for a type. Read more

source

impl<K: Hash + Eq + Sized + Debug, T> DirectedGraph<K, T> for NGraph<K, T>

type Node = NGraphNode<K, T>

节点

source

fn get(&self, key: &K) -> Option<&Self::Node>

根据 key 取节点

source

fn get_mut(&mut self, key: &K) -> Option<&mut Self::Node>

根据 key 取节点

source

fn node_count(&self) -> usize

取节点的数量

source

fn from_len(&self) -> usize

取有输入节点的数量

source

fn to_len(&self) -> usize

取有输出节点的数量

source

fn from(&self) -> &[K]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

取输入节点切片

source

fn to(&self) -> &[K]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

取输出节点切片

source

fn topological_sort(&self) -> &[K]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

拓扑排序

Auto Trait Implementations

impl<K, T> RefUnwindSafe for NGraph<K, T> where
K: RefUnwindSafe,
T: RefUnwindSafe,

impl<K, T> Send for NGraph<K, T> where
K: Send,
T: Send,

impl<K, T> Sync for NGraph<K, T> where
K: Sync,
T: Sync,

impl<K, T> Unpin for NGraph<K, T> where
K: Unpin,
T: Unpin,

impl<K, T> UnwindSafe for NGraph<K, T> where
K: UnwindSafe,
T: 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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
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 T where
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 T where
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 T where
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 pi_graph::NGraph

Implementations

impl<K: Hash + Eq + Sized + Debug, T> NGraph<K, T>

pub fn reset(&self)

impl<K: Hash + Eq + Sized + Debug, T> NGraph<K, T>

pub fn iter(&self) -> impl Iterator<Item = &T>

impl<K: Clone + Hash + Eq + Sized + Debug, T: Clone> NGraph<K, T>

pub fn gen_graph_from_keys(&self, keys: &[K]) -> Self

Trait Implementations

impl<K: Debug + Hash + Eq + Sized + Debug, T: Debug> Debug for NGraph<K, T>

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

impl<K: Default + Hash + Eq + Sized + Debug, T: Default> Default for NGraph<K, T>

fn default() -> NGraph<K, T>

impl<K: Hash + Eq + Sized + Debug, T> DirectedGraph<K, T> for NGraph<K, T>

type Node = NGraphNode<K, T>

fn get(&self, key: &K) -> Option<&Self::Node>

fn get_mut(&mut self, key: &K) -> Option<&mut Self::Node>

fn node_count(&self) -> usize

fn from_len(&self) -> usize

fn to_len(&self) -> usize

fn from(&self) -> &[K]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]

fn to(&self) -> &[K]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]

fn topological_sort(&self) -> &[K]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]

Auto Trait Implementations

impl<K, T> RefUnwindSafe for NGraph<K, T> where K: RefUnwindSafe, T: RefUnwindSafe,

impl<K, T> Send for NGraph<K, T> where K: Send, T: Send,

impl<K, T> Sync for NGraph<K, T> where K: Sync, T: Sync,

impl<K, T> Unpin for NGraph<K, T> where K: Unpin, T: Unpin,

impl<K, T> UnwindSafe for NGraph<K, T> where K: UnwindSafe, T: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where 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 T where U: From<T>,

fn into(self) -> U

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

type Error = Infallible

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

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

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

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

impl<V, T> VZip<V> for T where V: MultiLane<T>,

fn vzip(self) -> V

fn from(&self) -> &[K]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

fn to(&self) -> &[K]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

fn topological_sort(&self) -> &[K]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

impl<K, T> RefUnwindSafe for NGraph<K, T> where
K: RefUnwindSafe,
T: RefUnwindSafe,

impl<K, T> Send for NGraph<K, T> where
K: Send,
T: Send,

impl<K, T> Sync for NGraph<K, T> where
K: Sync,
T: Sync,

impl<K, T> Unpin for NGraph<K, T> where
K: Unpin,
T: Unpin,

impl<K, T> UnwindSafe for NGraph<K, T> where
K: UnwindSafe,
T: 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<T, U> TryFrom<U> for T where
U: Into<T>,

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

impl<V, T> VZip<V> for T where
V: MultiLane<T>,