Struct topological_sort::DependencyLink

source · [−]

pub struct DependencyLink<T> {
    pub prec: T,
    pub succ: T,
}

Expand description

A link between two items in a sort.

Fields

prec: T

The element which is depened upon by succ.

succ: T

The element which depends on prec.

Trait Implementations

source

impl<T: Clone> Clone for DependencyLink<T>

source

fn clone(&self) -> DependencyLink<T>

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<T: Debug> Debug for DependencyLink<T>

source

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

Formats the value using the given formatter. Read more

source

impl<T> From<(T, T)> for DependencyLink<T>

source

fn from(tuple: (T, T)) -> Self

Converts to this type from the input type.

source

impl<T: Eq + Hash + Clone> FromIterator<DependencyLink<T>> for TopologicalSort<T>

source

fn from_iter<I: IntoIterator<Item = DependencyLink<T>>>(
iter: I
) -> TopologicalSort<T>ⓘNotable traits for TopologicalSort<T>`impl<T: Hash + Eq + Clone> Iterator for TopologicalSort<T> type Item = T;`

Creates a value from an iterator. Read more

source

impl<T: Copy> Copy for DependencyLink<T>

Auto Trait Implementations

impl<T> RefUnwindSafe for DependencyLink<T> where
T: RefUnwindSafe,

impl<T> Send for DependencyLink<T> where
T: Send,

impl<T> Sync for DependencyLink<T> where
T: Sync,

impl<T> Unpin for DependencyLink<T> where
T: Unpin,

impl<T> UnwindSafe for DependencyLink<T> where
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> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

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 topological_sort::DependencyLink

Fields

Trait Implementations

impl<T: Clone> Clone for DependencyLink<T>

fn clone(&self) -> DependencyLink<T>

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

impl<T: Debug> Debug for DependencyLink<T>

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

impl<T> From<(T, T)> for DependencyLink<T>

fn from(tuple: (T, T)) -> Self

impl<T: Eq + Hash + Clone> FromIterator<DependencyLink<T>> for TopologicalSort<T>

fn from_iter<I: IntoIterator<Item = DependencyLink<T>>>(
iter: I
) -> TopologicalSort<T>ⓘNotable traits for TopologicalSort<T>`impl<T: Hash + Eq + Clone> Iterator for TopologicalSort<T> type Item = T;`

impl<T: Copy> Copy for DependencyLink<T>

Auto Trait Implementations

impl<T> RefUnwindSafe for DependencyLink<T> where
T: RefUnwindSafe,

impl<T> Send for DependencyLink<T> where
T: Send,

impl<T> Sync for DependencyLink<T> where
T: Sync,

impl<T> Unpin for DependencyLink<T> where
T: Unpin,

impl<T> UnwindSafe for DependencyLink<T> where
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> ToOwned for T where
T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

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>

Struct topological_sort::DependencyLink

Fields

Trait Implementations

impl<T: Clone> Clone for DependencyLink<T>

fn clone(&self) -> DependencyLink<T>

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

impl<T: Debug> Debug for DependencyLink<T>

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

impl<T> From<(T, T)> for DependencyLink<T>

fn from(tuple: (T, T)) -> Self

impl<T: Eq + Hash + Clone> FromIterator<DependencyLink<T>> for TopologicalSort<T>

fn from_iter<I: IntoIterator<Item = DependencyLink<T>>>( iter: I) -> TopologicalSort<T>ⓘNotable traits for TopologicalSort<T>impl<T: Hash + Eq + Clone> Iterator for TopologicalSort<T> type Item = T;

impl<T: Copy> Copy for DependencyLink<T>

Auto Trait Implementations

impl<T> RefUnwindSafe for DependencyLink<T> where T: RefUnwindSafe,

impl<T> Send for DependencyLink<T> where T: Send,

impl<T> Sync for DependencyLink<T> where T: Sync,

impl<T> Unpin for DependencyLink<T> where T: Unpin,

impl<T> UnwindSafe for DependencyLink<T> where 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> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

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>

fn from_iter<I: IntoIterator<Item = DependencyLink<T>>>(
iter: I
) -> TopologicalSort<T>ⓘNotable traits for TopologicalSort<T>`impl<T: Hash + Eq + Clone> Iterator for TopologicalSort<T> type Item = T;`

impl<T> RefUnwindSafe for DependencyLink<T> where
T: RefUnwindSafe,

impl<T> Send for DependencyLink<T> where
T: Send,

impl<T> Sync for DependencyLink<T> where
T: Sync,

impl<T> Unpin for DependencyLink<T> where
T: Unpin,

impl<T> UnwindSafe for DependencyLink<T> where
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> ToOwned for T where
T: Clone,

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

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