pub struct KVid {
    private_use_as_methods_instead: u32,
}Fields§
§private_use_as_methods_instead: u32Implementations§
Source§impl KVid
 
impl KVid
Sourcepub const MAX_AS_U32: u32 = 4_294_967_040u32
 
pub const MAX_AS_U32: u32 = 4_294_967_040u32
Maximum value the index can take, as a u32.
Sourcepub const fn from_usize(value: usize) -> Self
 
pub const fn from_usize(value: usize) -> Self
Sourcepub const unsafe fn from_u32_unchecked(value: u32) -> Self
 
pub const unsafe fn from_u32_unchecked(value: u32) -> Self
Creates a new index from a given u32.
§Safety
The provided value must be less than or equal to the maximum value for the newtype. Providing a value outside this range is undefined due to layout restrictions.
Prefer using from_u32.
Trait Implementations§
Source§impl AddAssign<usize> for KVid
 
impl AddAssign<usize> for KVid
Source§fn add_assign(&mut self, other: usize)
 
fn add_assign(&mut self, other: usize)
Performs the 
+= operation. Read moreSource§impl TypeFoldable for KVid
 
impl TypeFoldable for KVid
fn try_fold_with<F: FallibleTypeFolder>( &self, _: &mut F, ) -> Result<Self, F::Error>
fn fold_with<F: TypeFolder>(&self, _: &mut F) -> Self
Source§fn normalize(&self, genv: GlobalEnv<'_, '_>) -> Self
 
fn normalize(&self, genv: GlobalEnv<'_, '_>) -> 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, f: &mut impl FnMut(EVid) -> Option<Expr>, ) -> Result<Self, EVid>
Source§fn shift_horizontally(&self, amount: usize) -> Self
 
fn shift_horizontally(&self, amount: usize) -> 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 KVid
 
impl TypeVisitable for KVid
fn visit_with<V: TypeVisitor>(&self, _: &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.Source§fn fvars(&self) -> FxHashSet<Name>
 
fn fvars(&self) -> FxHashSet<Name>
Returns the set of all free variables.
For example, 
Vec<i32[n]>{v : v > m} returns {n, m}.fn early_params(&self) -> FxHashSet<EarlyReftParam>
Source§fn redundant_bvars(&self) -> FxHashSet<BoundVar>
 
fn redundant_bvars(&self) -> FxHashSet<BoundVar>
Gives the indices of the provided bvars which: Read more
impl Copy for KVid
impl Eq for KVid
impl StructuralPartialEq for KVid
Auto Trait Implementations§
impl Freeze for KVid
impl RefUnwindSafe for KVid
impl Send for KVid
impl Sync for KVid
impl Unpin for KVid
impl UnwindSafe for KVid
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,
§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
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.§impl<T> Instrument for T
 
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
 
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
 
fn in_current_span(self) -> Instrumented<Self>
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