Struct style::applicable_declarations::CascadePriority

pub struct CascadePriority {
    cascade_level: CascadeLevel,
    layer_order: LayerOrder,
}

The cascade-level+layer order of this declaration.

Fields

cascade_level: CascadeLevel

layer_order: LayerOrder

Implementations

impl CascadePriority

pub fn new(cascade_level: CascadeLevel, layer_order: LayerOrder) -> Self

Construct a new CascadePriority for a given (level, order) pair.

pub fn layer_order(&self) -> LayerOrder

Returns the layer order.

pub fn cascade_level(&self) -> CascadeLevel

Returns the cascade level.

pub fn allows_when_reverted(&self, other: &Self, origin_revert: bool) -> bool

Whether this declaration should be allowed if revert or revert-layer have been specified on a given origin.

self is the priority at which the revert or revert-layer keyword have been specified.

pub fn unimportant(&self) -> Self

Convert this priority from “important” to “non-important”, if needed.

pub fn important(&self) -> Self

Convert this priority from “non-important” to “important”, if needed.

pub fn same_tree_author_normal_at_root_layer() -> Self

The same tree, in author origin, at the root layer.

Trait Implementations

impl Clone for CascadePriority

fn clone(&self) -> CascadePriority

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CascadePriority

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

Formats the value using the given formatter.

impl Hash for CascadePriority

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 MallocSizeOf for CascadePriority

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.

impl Ord for CascadePriority

fn cmp(&self, other: &Self) -> 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 PartialEq for CascadePriority

fn eq(&self, other: &CascadePriority) -> 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 PartialOrd for CascadePriority

fn partial_cmp(&self, other: &Self) -> 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 Copy for CascadePriority

impl Eq for CascadePriority

impl StructuralPartialEq for CascadePriority