Enum pkgcraft::dep::Dependency

pub enum Dependency<T: Ordered> {
    Enabled(T),
    Disabled(T),
    AllOf(SortedSet<Box<Dependency<T>>>),
    AnyOf(OrderedSet<Box<Dependency<T>>>),
    ExactlyOneOf(OrderedSet<Box<Dependency<T>>>),
    AtMostOneOf(OrderedSet<Box<Dependency<T>>>),
    Conditional(UseDep, SortedSet<Box<Dependency<T>>>),
}

Dependency specification variants.

Variants

Enabled(T)

Enabled dependency.

Disabled(T)

Disabled dependency (REQUIRED_USE only).

AllOf(SortedSet<Box<Dependency<T>>>)

All of a given dependency set.

AnyOf(OrderedSet<Box<Dependency<T>>>)

Any of a given dependency set.

ExactlyOneOf(OrderedSet<Box<Dependency<T>>>)

Exactly one of a given dependency set (REQUIRED_USE only).

AtMostOneOf(OrderedSet<Box<Dependency<T>>>)

At most one of a given dependency set (REQUIRED_USE only).

Conditional(UseDep, SortedSet<Box<Dependency<T>>>)

Conditional dependency.

Implementations

impl<T: Ordered> Dependency<T>

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

Return the number of Dependency objects a Dependency contains.

pub fn iter(&self) -> Iter<'_, T>

pub fn iter_flatten(&self) -> IterFlatten<'_, T>

pub fn iter_recursive(&self) -> IterRecursive<'_, T>

pub fn iter_conditionals(&self) -> IterConditionals<'_, T>

pub fn sort(&mut self)

Recursively sort a Dependency.

impl Dependency<Dep>

pub fn package(s: &str, eapi: &'static Eapi) -> Result<Self>

impl Dependency<String>

pub fn license(s: &str) -> Result<Self>

pub fn properties(s: &str) -> Result<Self>

pub fn required_use(s: &str) -> Result<Self>

pub fn restrict(s: &str) -> Result<Self>

impl Dependency<Uri>

pub fn src_uri(s: &str) -> Result<Self>

Trait Implementations

impl<T: Clone + Ordered> Clone for Dependency<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, T: Ordered> Conditionals for &'a Dependency<T>

type Item = &'a UseDep

type IntoIterConditionals = IterConditionals<'a, T>

fn into_iter_conditionals(self) -> Self::IntoIterConditionals

impl<T: Ordered> Conditionals for Dependency<T>

type Item = UseDep

type IntoIterConditionals = IntoIterConditionals<T>

fn into_iter_conditionals(self) -> Self::IntoIterConditionals

impl<T: Ordered> Contains<&Dependency<T>> for Dependency<T>

fn contains(&self, dep: &Self) -> bool

impl<T: Ordered> Contains<&Dependency<T>> for DependencySet<T>

fn contains(&self, dep: &Dependency<T>) -> bool

impl<T: Ordered> Contains<&T> for Dependency<T>

fn contains(&self, obj: &T) -> bool

impl Contains<&UseDep> for Dependency<Dep>

fn contains(&self, obj: &UseDep) -> bool

impl Contains<&UseDep> for Dependency<String>

fn contains(&self, obj: &UseDep) -> bool

impl Contains<&UseDep> for Dependency<Uri>

fn contains(&self, obj: &UseDep) -> bool

impl Contains<&str> for Dependency<Dep>

fn contains(&self, obj: &str) -> bool

impl<T: Ordered + AsRef<str>> Contains<&str> for Dependency<T>

fn contains(&self, obj: &str) -> bool

impl<T: Debug + Ordered> Debug for Dependency<T>

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

Formats the value using the given formatter.

impl<T: Display + Ordered> Display for Dependency<T>

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

Formats the value using the given formatter.

impl<'a, S: Stringable + 'a, T: Ordered> Evaluate<'a, S> for &'a Dependency<T>

type Evaluated = SortedSet<Dependency<&'a T>>

fn evaluate(self, options: &'a IndexSet<S>) -> Self::Evaluated

type Item = Dependency<&'a T>

type IntoIterEvaluate = IterEvaluate<'a, S, T>

fn into_iter_evaluate(self, options: &'a IndexSet<S>) -> Self::IntoIterEvaluate

impl<'a, S: Stringable + 'a, T: Ordered> Evaluate<'a, S> for Dependency<&'a T>

type Evaluated = SortedSet<Dependency<&'a T>>

fn evaluate(self, options: &'a IndexSet<S>) -> Self::Evaluated

type Item = Dependency<&'a T>

type IntoIterEvaluate = IntoIterEvaluate<'a, S, T>

fn into_iter_evaluate(self, options: &'a IndexSet<S>) -> Self::IntoIterEvaluate

impl<'a, T: Ordered> EvaluateForce for &'a Dependency<T>

type Evaluated = SortedSet<Dependency<&'a T>>

fn evaluate_force(self, force: bool) -> Self::Evaluated

type Item = Dependency<&'a T>

type IntoIterEvaluateForce = IterEvaluateForce<'a, T>

fn into_iter_evaluate_force(self, force: bool) -> Self::IntoIterEvaluateForce

impl<'a, T: Ordered> EvaluateForce for Dependency<&'a T>

type Evaluated = SortedSet<Dependency<&'a T>>

fn evaluate_force(self, force: bool) -> Self::Evaluated

type Item = Dependency<&'a T>

type IntoIterEvaluateForce = IntoIterEvaluateForce<'a, T>

fn into_iter_evaluate_force(self, force: bool) -> Self::IntoIterEvaluateForce

impl<'a, T: Ordered> Flatten for &'a Dependency<T>

type Item = &'a T

type IntoIterFlatten = IterFlatten<'a, T>

fn into_iter_flatten(self) -> Self::IntoIterFlatten

impl<T: Ordered> Flatten for Dependency<T>

type Item = T

type IntoIterFlatten = IntoIterFlatten<T>

fn into_iter_flatten(self) -> Self::IntoIterFlatten

impl<'a, T: Ordered + 'a> FromIterator<&'a Dependency<T>> for DependencySet<&'a T>

fn from_iter<I: IntoIterator<Item = &'a Dependency<T>>>(iterable: I) -> Self

Creates a value from an iterator.

impl<'a, T: Ordered> FromIterator<&'a Dependency<T>> for Iter<'a, T>

fn from_iter<I: IntoIterator<Item = &'a Dependency<T>>>(iterable: I) -> Self

Creates a value from an iterator.

impl<T: Ordered> FromIterator<Dependency<T>> for DependencySet<T>

fn from_iter<I: IntoIterator<Item = Dependency<T>>>(iterable: I) -> Self

Creates a value from an iterator.

impl<T: Ordered> FromIterator<Dependency<T>> for IntoIter<T>

fn from_iter<I: IntoIterator<Item = Dependency<T>>>(iterable: I) -> Self

Creates a value from an iterator.

impl<T: Hash + Ordered> Hash for Dependency<T>

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<'a, T: Ordered> IntoIterator for &'a Dependency<T>

type Item = &'a Dependency<T>

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ordered> IntoIterator for Dependency<T>

type Item = Dependency<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ordered> IntoOwned for Dependency<&T>

type Owned = Dependency<T>

fn into_owned(self) -> Self::Owned

impl<T: Ord + Ordered> Ord for Dependency<T>

fn cmp(&self, other: &Dependency<T>) -> 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 + PartialOrd,

Restrict a value to a certain interval.

impl<T: PartialEq + Ordered> PartialEq for Dependency<T>

fn eq(&self, other: &Dependency<T>) -> bool

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

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

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

impl<T: PartialOrd + Ordered> PartialOrd for Dependency<T>

fn partial_cmp(&self, other: &Dependency<T>) -> Option<Ordering>

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<'a, T: Ordered> Recursive for &'a Dependency<T>

type Item = &'a Dependency<T>

type IntoIterRecursive = IterRecursive<'a, T>

fn into_iter_recursive(self) -> Self::IntoIterRecursive

impl<T: Ordered> Recursive for Dependency<T>

type Item = Dependency<T>

type IntoIterRecursive = IntoIterRecursive<T>

fn into_iter_recursive(self) -> Self::IntoIterRecursive

impl Restriction<&Dependency<Dep>> for Restrict

fn matches(&self, val: &Dependency<Dep>) -> bool

impl<'a, T: Ordered + 'a> ToRef<'a> for Dependency<T>

type Ref = Dependency<&'a T>

fn to_ref(&'a self) -> Self::Ref

impl<T: Eq + Ordered> Eq for Dependency<T>

impl<T: Ordered> StructuralPartialEq for Dependency<T>