pub struct SimpSet { /* private fields */ }Expand description
An indexed set of simp rules.
Implementations§
Source§impl SimpSet
impl SimpSet
pub fn new() -> Self
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
Sourcepub fn register_lemma(&mut self, name: &str, lemma: &ProofExpr) -> bool
pub fn register_lemma(&mut self, name: &str, lemma: &ProofExpr) -> bool
Compile and index lemma as a rewrite rule. Returns false (and
registers nothing) if the lemma is not an oriented rule: no equational
or iff core, a bare-variable lhs, rhs/condition variables the lhs does
not bind, or shadowed binder names.
The rule’s derivation base is a PremiseMatch leaf, so the lemma must
be in scope (a premise or hypothesis) wherever the rule fires.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for SimpSet
impl RefUnwindSafe for SimpSet
impl Send for SimpSet
impl Sync for SimpSet
impl Unpin for SimpSet
impl UnsafeUnpin for SimpSet
impl UnwindSafe for SimpSet
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more