pub struct SortChecker<'a>(/* private fields */);Trait Implementations§
Source§impl<'a> Debug for SortChecker<'a>
impl<'a> Debug for SortChecker<'a>
Source§impl<L: Logic> Folder<L> for SortChecker<'_>
impl<L: Logic> Folder<L> for SortChecker<'_>
Source§type Output = ISort
type Output = ISort
Type produced by the transformation.
If
Output = Term<T>, implement IntraLogicFolder instead.
If Output = Term<U> for some U: Logic, implement InterLogicFolder instead.Source§type Error = UnknownSort<Term<L>>
type Error = UnknownSort<Term<L>>
Type of errors that the folder may run into.
Source§fn fold_const(&mut self, constant: IConst) -> Result<Self::Output, Self::Error>
fn fold_const(&mut self, constant: IConst) -> Result<Self::Output, Self::Error>
Transforms a constant.
Source§fn fold_var(&mut self, var: IVar<L::Var>) -> Result<Self::Output, Self::Error>
fn fold_var(&mut self, var: IVar<L::Var>) -> Result<Self::Output, Self::Error>
Transforms a variable.
Source§fn fold_core_op(&mut self, op: ICoreOp<L>) -> Result<Self::Output, Self::Error>
fn fold_core_op(&mut self, op: ICoreOp<L>) -> Result<Self::Output, Self::Error>
Transforms an SMT-LIB Core operation, recursively folding its arguments.
Source§fn fold_theory_op(&mut self, op: IOp<L>) -> Result<Self::Output, Self::Error>
fn fold_theory_op(&mut self, op: IOp<L>) -> Result<Self::Output, Self::Error>
Transforms a non-core operation, recursively folding its arguments.
Source§fn fold_uninterpreted_func(
&mut self,
uf: IUF<L>,
) -> Result<Self::Output, Self::Error>
fn fold_uninterpreted_func( &mut self, uf: IUF<L>, ) -> Result<Self::Output, Self::Error>
Transforms an uninterpreted function, recursively folding its arguments.
Source§fn fold_let(&mut self, l: ILet<L>) -> Result<Self::Output, Self::Error>
fn fold_let(&mut self, l: ILet<L>) -> Result<Self::Output, Self::Error>
Transforms a let binder, recursively folding its arguments.
Source§fn fold_match(&mut self, m: IMatch<L>) -> Result<Self::Output, Self::Error>
fn fold_match(&mut self, m: IMatch<L>) -> Result<Self::Output, Self::Error>
Transforms a match binder, recursively folding its arguments.
Source§fn fold_quantifier(
&mut self,
quantifier: IQuantifier<L>,
) -> Result<Self::Output, Self::Error>
fn fold_quantifier( &mut self, quantifier: IQuantifier<L>, ) -> Result<Self::Output, Self::Error>
Transforms a quantifier, recursively folding its arguments.
Source§fn context(&self) -> Option<&Ctx>
fn context(&self) -> Option<&Ctx>
Gets the context tracked by the folder, if applicable.
Tracking context enables things like determining the sorts of expressions and which
variables are free/bound, but a folder that doesn’t need that information can leave
this method defaulted, which will return
None.Source§fn context_mut(&mut self) -> Option<&mut Ctx>
fn context_mut(&mut self) -> Option<&mut Ctx>
Gets a mutable reference to the context tracked by the folder, if applicable.
Tracking context enables things like determining the sorts of expressions and which
variables are free/bound, but a folder that doesn’t need that information can leave
this method defaulted, which will return
None.Source§fn fold_term(&mut self, term: Term<T>) -> Result<Self::Output, Self::Error>
fn fold_term(&mut self, term: Term<T>) -> Result<Self::Output, Self::Error>
Transforms a term, recursively transforming its contents.
By default, calls
SuperFold::super_fold_with.Source§fn fold_set_logic(
&mut self,
logic: ISymbol,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_set_logic( &mut self, logic: ISymbol, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a set-logic command.
By default, returns as-is.
Source§fn fold_assert(
&mut self,
asserted: Term<T>,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_assert( &mut self, asserted: Term<T>, ) -> Result<Command<Self::Output>, Self::Error>
Transforms an asserted term.
By default, calls
Self::fold_term.Source§fn fold_declare_const(
&mut self,
symbol: ISymbol,
sort: ISort,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_declare_const( &mut self, symbol: ISymbol, sort: ISort, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a constant declaration.
By default, returns as-is.
Source§fn fold_declare_fun(
&mut self,
symbol: ISymbol,
parameters: Vec<ISort>,
sort: ISort,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_declare_fun( &mut self, symbol: ISymbol, parameters: Vec<ISort>, sort: ISort, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a function declaration.
By default, returns as-is.
Source§fn fold_declare_sort(
&mut self,
symbol: ISymbol,
arity: Numeral,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_declare_sort( &mut self, symbol: ISymbol, arity: Numeral, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a sort declaration.
By default, returns as-is.
Source§fn fold_define_fun(
&mut self,
sig: FunctionDec,
body: Term<T>,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_define_fun( &mut self, sig: FunctionDec, body: Term<T>, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a function definition.
By default, recursively transforms the function body with
Self::fold_term.Source§fn fold_define_fun_rec(
&mut self,
sig: FunctionDec,
body: Term<T>,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_define_fun_rec( &mut self, sig: FunctionDec, body: Term<T>, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a recursive function definition.
By default, recursively transforms the function body with
Self::fold_term.Source§fn fold_define_funs_rec(
&mut self,
funs: Vec<(FunctionDec, Term<T>)>,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_define_funs_rec( &mut self, funs: Vec<(FunctionDec, Term<T>)>, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a set of recursive function definition.
By default, recursively transforms each function body with
Self::fold_term.Source§fn fold_define_sort(
&mut self,
symbol: ISymbol,
parameters: Vec<ISymbol>,
sort: ISort,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_define_sort( &mut self, symbol: ISymbol, parameters: Vec<ISymbol>, sort: ISort, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a sort definition.
By default, returns as-is.
Source§fn fold_get_value(
&mut self,
terms: Vec<Term<T>>,
) -> Result<Command<Self::Output>, Self::Error>
fn fold_get_value( &mut self, terms: Vec<Term<T>>, ) -> Result<Command<Self::Output>, Self::Error>
Transforms a
get-value call.
By default, recursively transforms each term with Self::fold_term.Auto Trait Implementations§
impl<'a> Freeze for SortChecker<'a>
impl<'a> RefUnwindSafe for SortChecker<'a>
impl<'a> Send for SortChecker<'a>
impl<'a> Sync for SortChecker<'a>
impl<'a> Unpin for SortChecker<'a>
impl<'a> !UnwindSafe for SortChecker<'a>
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
Source§impl<T> Compose for T
impl<T> Compose for T
fn compose<After, M1, M2>( self, after: After, ) -> TryComposed<Self, After, fn(Infallible) -> Infallible, fn(Infallible) -> Infallible, Infallible, M1, M2>
fn try_compose<After, MapErr1, MapErr2, Err, M1, M2>( self, after: After, f: MapErr1, g: MapErr2, ) -> TryComposed<Self, After, MapErr1, MapErr2, Err, M1, M2>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more