Struct cargo::util::graph::Graph

source · [−]

pub struct Graph<N: Clone, E: Clone> { /* private fields */ }

Implementations

source

impl Graph<PackageId, HashSet<Dependency>>

source

pub fn parents_of(
&self,
p: PackageId
) -> impl Iterator<Item = (PackageId, bool )> + '_

source

pub fn contains<Q: ?Sized>(&self, k: &Q) -> bool where
N: Borrow<Q>,
Q: Ord + Eq,

source

pub fn edge(&self, from: &N, to: &N) -> Option<&E>

source

pub fn edges(&self, from: &N) -> impl Iterator<Item = (&N, &E)>

source

pub fn sort(&self) -> Vec<N>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

A topological sort of the Graph

source

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

source

pub fn is_path_from_to<'a>(&'a self, from: &'a N, to: &'a N) -> bool

Checks if there is a path from from to to.

source

pub fn path_to_bottom<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

Resolves one of the paths from the given dependent package down to a leaf.

source

pub fn path_to_top<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

Resolves one of the paths from the given dependent package up to the root.

Trait Implementations

source

impl<N: Eq + Ord + Clone, E: Clone> Clone for Graph<N, E>

source

fn clone(&self) -> Graph<N, E>

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<N: Display + Eq + Ord + Clone, E: Clone> Debug for Graph<N, E>

source

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

Formats the value using the given formatter. Read more

source

impl<N: Eq + Ord + Clone, E: Default + Clone> Default for Graph<N, E>

source

fn default() -> Graph<N, E>

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

source

impl<N: Eq + Ord + Clone, E: Eq + Clone> PartialEq<Graph<N, E>> for Graph<N, E>

source

fn eq(&self, other: &Graph<N, E>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

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

This method tests for !=.

source

impl<N: Eq + Ord + Clone, E: Eq + Clone> Eq for Graph<N, E>

Auto Trait Implementations

impl<N, E> RefUnwindSafe for Graph<N, E> where
E: RefUnwindSafe,
N: RefUnwindSafe,

impl<N, E> !Send for Graph<N, E>

impl<N, E> !Sync for Graph<N, E>

impl<N, E> Unpin for Graph<N, E> where
E: Unpin,
N: Unpin,

impl<N, E> UnwindSafe for Graph<N, E> where
E: UnwindSafe + RefUnwindSafe,
N: UnwindSafe + RefUnwindSafe,

Blanket Implementations

source

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

source

pub 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

pub 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

pub 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

pub fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

pub 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> Same<T> for T

type Output = T

Should always be Self

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

pub fn to_owned(&self) -> T

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

source

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

🔬 This is a nightly-only experimental API. (toowned_clone_into)

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

pub 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

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

Performs the conversion.

source

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

source

Struct cargo::util::graph::Graph

Implementations

impl Graph<PackageId, HashSet<Dependency>>

pub fn parents_of( &self, p: PackageId) -> impl Iterator<Item = (PackageId, bool)> + '_

impl<N: Eq + Ord + Clone, E: Default + Clone> Graph<N, E>

pub fn new() -> Graph<N, E>

pub fn add(&mut self, node: N)

pub fn link(&mut self, node: N, child: N) -> &mut E

pub fn contains<Q: ?Sized>(&self, k: &Q) -> bool where N: Borrow<Q>, Q: Ord + Eq,

pub fn edge(&self, from: &N, to: &N) -> Option<&E>

pub fn edges(&self, from: &N) -> impl Iterator<Item = (&N, &E)>

pub fn sort(&self) -> Vec<N>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where A: Allocator,

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

pub fn is_path_from_to<'a>(&'a self, from: &'a N, to: &'a N) -> bool

pub fn path_to_bottom<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where A: Allocator,

pub fn path_to_top<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where A: Allocator,

Trait Implementations

impl<N: Eq + Ord + Clone, E: Clone> Clone for Graph<N, E>

fn clone(&self) -> Graph<N, E>

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

impl<N: Display + Eq + Ord + Clone, E: Clone> Debug for Graph<N, E>

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

impl<N: Eq + Ord + Clone, E: Default + Clone> Default for Graph<N, E>

fn default() -> Graph<N, E>

impl<N: Eq + Ord + Clone, E: Eq + Clone> PartialEq<Graph<N, E>> for Graph<N, E>

fn eq(&self, other: &Graph<N, E>) -> bool

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

impl<N: Eq + Ord + Clone, E: Eq + Clone> Eq for Graph<N, E>

Auto Trait Implementations

impl<N, E> RefUnwindSafe for Graph<N, E> where E: RefUnwindSafe, N: RefUnwindSafe,

impl<N, E> !Send for Graph<N, E>

impl<N, E> !Sync for Graph<N, E>

impl<N, E> Unpin for Graph<N, E> where E: Unpin, N: Unpin,

impl<N, E> UnwindSafe for Graph<N, E> where E: UnwindSafe + RefUnwindSafe, N: UnwindSafe + RefUnwindSafe,

Blanket Implementations

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

pub fn type_id(&self) -> TypeId

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

pub fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

pub fn from(t: T) -> T

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

pub fn into(self) -> U

impl<T> Same<T> for T

type Output = T

impl<T> ToOwned for T where T: Clone,

type Owned = T

pub fn to_owned(&self) -> T

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

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

type Error = Infallible

pub 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

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

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

pub fn vzip(self) -> V

pub fn parents_of(
&self,
p: PackageId
) -> impl Iterator<Item = (PackageId, bool )> + '_

pub fn contains<Q: ?Sized>(&self, k: &Q) -> bool where
N: Borrow<Q>,
Q: Ord + Eq,

pub fn sort(&self) -> Vec<N>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

pub fn path_to_bottom<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

pub fn path_to_top<'a>(&'a self, pkg: &'a N) -> Vec<&'a N>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

impl<N, E> RefUnwindSafe for Graph<N, E> where
E: RefUnwindSafe,
N: RefUnwindSafe,

impl<N, E> Unpin for Graph<N, E> where
E: Unpin,
N: Unpin,

impl<N, E> UnwindSafe for Graph<N, E> where
E: UnwindSafe + RefUnwindSafe,
N: UnwindSafe + RefUnwindSafe,

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

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