Enum chalk_ir::ClausePriority

pub enum ClausePriority {
    High,
    Low,
}

Specifies how important an implication is.

Variants

High

High priority, the solver should prioritize this.

Low

Low priority, this implication has lower chance to be relevant to the goal.

Trait Implementations

impl BitAnd for ClausePriority

type Output = ClausePriority

The resulting type after applying the & operator.

fn bitand(self, rhs: ClausePriority) -> Self::Output

Performs the & operation.

impl Clone for ClausePriority

fn clone(&self) -> ClausePriority

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ClausePriority

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

Formats the value using the given formatter.

impl Hash for ClausePriority

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 PartialEq for ClausePriority

fn eq(&self, other: &ClausePriority) -> 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<I: Interner> TypeFoldable<I> for ClausePriority

fn try_fold_with<E>( self, _folder: &mut dyn FallibleTypeFolder<I, Error = E>, _outer_binder: DebruijnIndex, ) -> Result<Self, E>

Apply the given folder folder to self; binders is the number of binders that are in scope when beginning the folder. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.

fn fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex, ) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<I: Interner> TypeVisitable<I> for ClausePriority

fn visit_with<B>( &self, _visitor: &mut dyn TypeVisitor<I, BreakTy = B>, _outer_binder: DebruijnIndex, ) -> ControlFlow<B>

Apply the given visitor visitor to self; binders is the number of binders that are in scope when beginning the visitor. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.

impl<I: Interner> Zip<I> for ClausePriority

fn zip_with<Z: Zipper<I>>( _zipper: &mut Z, _variance: Variance, a: &Self, b: &Self, ) -> Fallible<()>

Uses the zipper to walk through two values, ensuring that they match.

impl Copy for ClausePriority

impl Eq for ClausePriority

impl StructuralPartialEq for ClausePriority