Struct flux_middle::rty::expr::Lambda
source · pub struct Lambda {
body: Binder<Expr>,
output: Sort,
}
Expand description
A lambda abstraction with an elaborated output sort. We need the output sort of lambdas for encoding into fixpoint
Fields§
§body: Binder<Expr>
§output: Sort
Implementations§
source§impl Lambda
impl Lambda
pub fn bind_with_vars( body: Expr, inputs: BoundVariableKinds, output: Sort, ) -> Self
pub fn bind_with_fsort(body: Expr, fsort: FuncSort) -> Self
pub fn apply(&self, args: &[Expr]) -> Expr
pub fn vars(&self) -> &BoundVariableKinds
pub fn output(&self) -> Sort
pub fn fsort(&self) -> FuncSort
Trait Implementations§
source§impl TypeFoldable for Lambda
impl TypeFoldable for Lambda
fn try_fold_with<__F: FallibleTypeFolder>( &self, __folder: &mut __F, ) -> Result<Self, __F::Error>
fn fold_with<F: TypeFolder>(&self, folder: &mut F) -> Self
fn normalize_projections<'tcx>( &self, genv: GlobalEnv<'_, 'tcx>, infcx: &InferCtxt<'tcx>, callsite_def_id: DefId, ) -> QueryResult<Self>
source§fn normalize(&self, defns: &SpecFuncDefns) -> Self
fn normalize(&self, defns: &SpecFuncDefns) -> Self
Normalize expressions by applying beta reductions for tuples and lambda abstractions.
source§fn replace_holes(
&self,
f: impl FnMut(&[BoundVariableKinds], HoleKind) -> Expr,
) -> Self
fn replace_holes( &self, f: impl FnMut(&[BoundVariableKinds], HoleKind) -> Expr, ) -> Self
Replaces all holes with the result of calling a closure. The closure takes a list with
all the layers of bound variables at the point the hole was found. Each layer corresponds
to the list of bound variables at that level. The list is ordered from outermost to innermost
binder, i.e., the last element is the binder closest to the hole.
source§fn with_holes(&self) -> Self
fn with_holes(&self) -> Self
Remove all refinements and turn each underlying
BaseTy
into a TyKind::Exists
with a
TyKind::Constr
and a hole
. For example, Vec<{v. i32[v] | v > 0}>[n]
becomes
{n. Vec<{v. i32[v] | *}>[n] | *}
.fn replace_evars(&self, evars: &EVarSol) -> Self
fn shift_in_escaping(&self, amount: u32) -> Self
fn shift_out_escaping(&self, amount: u32) -> Self
fn erase_regions(&self) -> Self
source§impl TypeVisitable for Lambda
impl TypeVisitable for Lambda
fn visit_with<__V: TypeVisitor>( &self, __visitor: &mut __V, ) -> ControlFlow<__V::BreakTy>
fn has_escaping_bvars(&self) -> bool
source§fn has_escaping_bvars_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_escaping_bvars_at_or_above(&self, binder: DebruijnIndex) -> bool
Returns
true
if self
has any late-bound vars that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound vars that appear free.impl Eq for Lambda
impl StructuralPartialEq for Lambda
Auto Trait Implementations§
impl Freeze for Lambda
impl RefUnwindSafe for Lambda
impl Send for Lambda
impl Sync for Lambda
impl Unpin for Lambda
impl UnwindSafe for Lambda
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.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