Enum chalk_ir::ClausePriority
source · [−]pub enum ClausePriority {
High,
Low,
}
Expand description
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
sourceimpl BitAnd<ClausePriority> for ClausePriority
impl BitAnd<ClausePriority> for ClausePriority
type Output = ClausePriority
type Output = ClausePriority
The resulting type after applying the &
operator.
sourcefn bitand(self, rhs: ClausePriority) -> Self::Output
fn bitand(self, rhs: ClausePriority) -> Self::Output
Performs the &
operation. Read more
sourceimpl Clone for ClausePriority
impl Clone for ClausePriority
sourcefn clone(&self) -> ClausePriority
fn clone(&self) -> ClausePriority
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl Debug for ClausePriority
impl Debug for ClausePriority
sourceimpl<I: Interner> Fold<I> for ClausePriority
impl<I: Interner> Fold<I> for ClausePriority
type Result = Self
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
). Read more
sourcefn fold_with<E>(
self,
_folder: &mut dyn Folder<I, Error = E>,
_outer_binder: DebruijnIndex
) -> Result<Self::Result, E>
fn fold_with<E>(
self,
_folder: &mut dyn Folder<I, Error = E>,
_outer_binder: DebruijnIndex
) -> Result<Self::Result, 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. Read more
sourceimpl Hash for ClausePriority
impl Hash for ClausePriority
sourceimpl PartialEq<ClausePriority> for ClausePriority
impl PartialEq<ClausePriority> for ClausePriority
sourceimpl<I: Interner> Visit<I> for ClausePriority
impl<I: Interner> Visit<I> for ClausePriority
sourcefn visit_with<B>(
&self,
_visitor: &mut dyn Visitor<I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B>
fn visit_with<B>(
&self,
_visitor: &mut dyn Visitor<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. Read more
sourceimpl<I: Interner> Zip<I> for ClausePriority
impl<I: Interner> Zip<I> for ClausePriority
impl Copy for ClausePriority
impl Eq for ClausePriority
impl StructuralEq for ClausePriority
impl StructuralPartialEq for ClausePriority
Auto Trait Implementations
impl RefUnwindSafe for ClausePriority
impl Send for ClausePriority
impl Sync for ClausePriority
impl Unpin for ClausePriority
impl UnwindSafe for ClausePriority
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Cast for T
impl<T> Cast for T
sourcefn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
fn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
Cast a value to type U
using CastTo
.
sourceimpl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
sourcefn shifted_in(self, interner: I) -> <T as Fold<I>>::Result
fn shifted_in(self, interner: I) -> <T as Fold<I>>::Result
Shifts this term in one level of binders.
sourcefn shifted_in_from(
self,
interner: I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result
fn shifted_in_from(
self,
interner: I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result
Shifts a term valid at outer_binder
so that it is
valid at the innermost binder. See DebruijnIndex::shifted_in_from
for a detailed explanation. Read more
sourcefn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
Shifts a term valid at the innermost binder so that it is
valid at outer_binder
. See DebruijnIndex::shifted_out_to
for a detailed explanation. Read more
sourcefn shifted_out(self, interner: I) -> Result<<T as Fold<I>>::Result, NoSolution>
fn shifted_out(self, interner: I) -> Result<<T as Fold<I>>::Result, NoSolution>
Shifts this term out one level of binders.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more