pub enum DepSpec<T: Ordered> {
Enabled(T),
Disabled(T),
AllOf(SortedSet<Box<DepSpec<T>>>),
AnyOf(OrderedSet<Box<DepSpec<T>>>),
ExactlyOneOf(OrderedSet<Box<DepSpec<T>>>),
AtMostOneOf(OrderedSet<Box<DepSpec<T>>>),
UseEnabled(String, SortedSet<Box<DepSpec<T>>>),
UseDisabled(String, SortedSet<Box<DepSpec<T>>>),
}Expand description
Dependency specification variants.
Variants§
Enabled(T)
Disabled(T)
AllOf(SortedSet<Box<DepSpec<T>>>)
AnyOf(OrderedSet<Box<DepSpec<T>>>)
ExactlyOneOf(OrderedSet<Box<DepSpec<T>>>)
AtMostOneOf(OrderedSet<Box<DepSpec<T>>>)
UseEnabled(String, SortedSet<Box<DepSpec<T>>>)
UseDisabled(String, SortedSet<Box<DepSpec<T>>>)
Implementations§
source§impl<T: Ordered> DepSpec<T>
impl<T: Ordered> DepSpec<T>
pub fn iter_flatten(&self) -> IterFlatten<'_, T> ⓘ
Trait Implementations§
source§impl<'a, T: Ordered> Flatten for &'a DepSpec<T>
impl<'a, T: Ordered> Flatten for &'a DepSpec<T>
type Item = &'a T
type IntoIterFlatten = IterFlatten<'a, T>
fn into_iter_flatten(self) -> Self::IntoIterFlatten
source§impl<T: Ordered> Flatten for DepSpec<T>
impl<T: Ordered> Flatten for DepSpec<T>
type Item = T
type IntoIterFlatten = IntoIterFlatten<T>
fn into_iter_flatten(self) -> Self::IntoIterFlatten
source§impl<T: Ord + Ordered> Ord for DepSpec<T>
impl<T: Ord + Ordered> Ord for DepSpec<T>
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<T: PartialEq + Ordered> PartialEq<DepSpec<T>> for DepSpec<T>
impl<T: PartialEq + Ordered> PartialEq<DepSpec<T>> for DepSpec<T>
source§impl<T: PartialOrd + Ordered> PartialOrd<DepSpec<T>> for DepSpec<T>
impl<T: PartialOrd + Ordered> PartialOrd<DepSpec<T>> for DepSpec<T>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self and other) and is used by the <=
operator. Read moresource§impl<'a, T: Ordered> Recursive for &'a DepSpec<T>
impl<'a, T: Ordered> Recursive for &'a DepSpec<T>
type Item = &'a DepSpec<T>
type IntoIterRecursive = IterRecursive<'a, T>
fn into_iter_recursive(self) -> Self::IntoIterRecursive
source§impl<T: Ordered> Recursive for DepSpec<T>
impl<T: Ordered> Recursive for DepSpec<T>
type Item = DepSpec<T>
type IntoIterRecursive = IntoIterRecursive<T>
fn into_iter_recursive(self) -> Self::IntoIterRecursive
source§impl Restriction<&DepSpec<Dep>> for BaseRestrict
impl Restriction<&DepSpec<Dep>> for BaseRestrict
impl<T: Eq + Ordered> Eq for DepSpec<T>
impl<T: Ordered> StructuralEq for DepSpec<T>
impl<T: Ordered> StructuralPartialEq for DepSpec<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for DepSpec<T>where T: RefUnwindSafe,
impl<T> Send for DepSpec<T>where T: Send,
impl<T> Sync for DepSpec<T>where T: Sync,
impl<T> Unpin for DepSpec<T>where T: Unpin,
impl<T> UnwindSafe for DepSpec<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more