Enum chalk_ir::ClausePriority

pub enum ClausePriority {
    High,
    Low,
}

Variants

High

Low

Trait Implementations

impl BitAnd<ClausePriority> 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 Copy for ClausePriority

impl Debug for ClausePriority

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

Formats the value using the given formatter.

impl Eq for ClausePriority

impl<I: Interner, TI: TargetInterner<I>> Fold<I, TI> for ClausePriority

type Result = Self

The type of value that will be produced once folding is done. Typically this is Self, unless Self contains borrowed values, in which case owned values are produced (for example, one can fold over a &T value where T: Fold, in which case you get back a T, not a &T).

fn fold_with<'i>(
    &self,
    _folder: &mut dyn Folder<'i, I, TI>,
    _outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
    I: 'i,
    TI: 'i, 

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.

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, 

Feeds a slice of this type into the given [Hasher].

impl PartialEq<ClausePriority> for ClausePriority

fn eq(&self, other: &ClausePriority) -> bool

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

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl StructuralEq for ClausePriority

impl StructuralPartialEq for ClausePriority

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

fn visit_with<'i, R: VisitResult>(
    &self,
    _visitor: &mut dyn Visitor<'i, I, Result = R>,
    _outer_binder: DebruijnIndex
) -> R where
    I: 'i, 

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<'i, Z: Zipper<'i, I>>(
    _zipper: &mut Z,
    a: &Self,
    b: &Self
) -> Fallible<()> where
    I: 'i,