Enum Requirement 

pub enum Requirement<S> {
    Unconstrained,
    Min(S),
    Forbidden,
}

Spec D3: the per-language requirement domain Req_L, a finite chain under the strictness order ⊑ (spec L1). The derived Ord follows declaration order, which is exactly that chain: unconstrained ⊑ [⊥_L] ⊑ ... ⊑ [max Level_L] ⊑ forbidden (the tests verify the derived order against D3’s case-by-case definition by exhaustive enumeration). Populating the reserved interface max later is a domain swap to the interval domain of D4’s remark, not a signature change.

Variants

Unconstrained

Spec D3: imposes nothing on consumers.

Min(S)

Spec D3: [m] - requires a consumer level of at least the carried minimum.

Forbidden

Spec D3: unsatisfiable.

Implementations

impl<S: Copy + Ord> Requirement<S>

pub fn join(self, other: Self) -> Self

Spec D4: the join r1 ⊔ r2 is the ⊑-maximum of the two requirements (well-defined because the chain is total, spec L1; a bounded join-semilattice by spec L2).

pub fn join_all(requirements: impl IntoIterator<Item = Self>) -> Self

Spec D4: the set join ⨆ S over a finite (multi)set, with ⨆ ∅ = unconstrained.

pub fn satisfied_by(self, level: S) -> bool

Spec D11: satisfies(c, L, r) for a consumer whose effective compile level in L is level.

pub fn sat(self, levels: &[S]) -> Vec<S>

Spec D12: the satisfaction set Sat_L(r), as the sub-slice of levels a consumer may compile at. levels must be the full chain Level_L of spec D2 (CStandard::ALL / CxxStandard::ALL).

Trait Implementations

impl<S: Clone> Clone for Requirement<S>

fn clone(&self) -> Requirement<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Copy> Copy for Requirement<S>

impl<S: Debug> Debug for Requirement<S>

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

Formats the value using the given formatter.

impl<S: Eq> Eq for Requirement<S>

impl<S: Hash> Hash for Requirement<S>

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<S: Ord> Ord for Requirement<S>

fn cmp(&self, other: &Requirement<S>) -> 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,

Restrict a value to a certain interval.

impl<S: PartialEq> PartialEq for Requirement<S>

fn eq(&self, other: &Requirement<S>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<S: PartialOrd> PartialOrd for Requirement<S>

fn partial_cmp(&self, other: &Requirement<S>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<S: PartialEq> StructuralPartialEq for Requirement<S>