Enum chalk_ir::ClausePriority [−][src]
pub enum ClausePriority { High, Low, }
Expand description
Specifies how important an implication is.
Variants
High priority, the solver should prioritize this.
Low priority, this implication has lower chance to be relevant to the goal.
Trait Implementations
impl BitAnd<ClausePriority> for ClausePriority
[src]
impl BitAnd<ClausePriority> for ClausePriority
[src]type Output = ClausePriority
type Output = ClausePriority
The resulting type after applying the &
operator.
fn bitand(self, rhs: ClausePriority) -> Self::Output
[src]
fn bitand(self, rhs: ClausePriority) -> Self::Output
[src]Performs the &
operation. Read more
impl Clone for ClausePriority
[src]
impl Clone for ClausePriority
[src]fn clone(&self) -> ClausePriority
[src]
fn clone(&self) -> ClausePriority
[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]Performs copy-assignment from source
. Read more
impl Debug for ClausePriority
[src]
impl Debug for ClausePriority
[src]impl<I: Interner> Fold<I> for ClausePriority
[src]
impl<I: Interner> Fold<I> for ClausePriority
[src]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
fn fold_with<'i>(
self,
_folder: &mut dyn Folder<'i, I>,
_outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]
fn fold_with<'i>(
self,
_folder: &mut dyn Folder<'i, I>,
_outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]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
impl Hash for ClausePriority
[src]
impl Hash for ClausePriority
[src]impl PartialEq<ClausePriority> for ClausePriority
[src]
impl PartialEq<ClausePriority> for ClausePriority
[src]impl<I: Interner> Visit<I> for ClausePriority
[src]
impl<I: Interner> Visit<I> for ClausePriority
[src]fn visit_with<'i, B>(
&self,
_visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]
fn visit_with<'i, B>(
&self,
_visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
_outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]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
impl<I: Interner> Zip<I> for ClausePriority
[src]
impl<I: Interner> Zip<I> for ClausePriority
[src]impl Copy for ClausePriority
[src]
impl Eq for ClausePriority
[src]
impl StructuralEq for ClausePriority
[src]
impl StructuralPartialEq for ClausePriority
[src]
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
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Cast for T
[src]
impl<T> Cast for T
[src]fn cast<U>(self, interner: &U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]
fn cast<U>(self, interner: &U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]Cast a value to type U
using CastTo
.
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
[src]
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
[src]pub fn shifted_in(Self, &I) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in(Self, &I) -> <T as Fold<I>>::Result
[src]Shifts this term in one level of binders.
pub fn shifted_in_from(Self, &I, DebruijnIndex) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in_from(Self, &I, DebruijnIndex) -> <T as Fold<I>>::Result
[src]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
pub fn shifted_out_to(
Self,
&I,
DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out_to(
Self,
&I,
DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]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
pub fn shifted_out(Self, &I) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out(Self, &I) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]Shifts this term out one level of binders.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more