Struct chalk_ir::Ty [−][src]
pub struct Ty<I: Interner> { /* fields omitted */ }
Expand description
A Rust type. The actual type data is stored in TyKind
.
Implementations
impl<I: Interner> Ty<I>
[src]
impl<I: Interner> Ty<I>
[src]pub fn interned(&self) -> &I::InternedType
[src]
pub fn interned(&self) -> &I::InternedType
[src]Gets the interned type.
pub fn well_formed(&self) -> WellFormed<I>
[src]
pub fn well_formed(&self) -> WellFormed<I>
[src]Creates a WF-constraint for this type.
pub fn into_from_env_goal(self, interner: &I) -> DomainGoal<I>
[src]
pub fn into_from_env_goal(self, interner: &I) -> DomainGoal<I>
[src]Creates a domain goal FromEnv(T)
where T
is this type.
pub fn bound_var(&self, interner: &I) -> Option<BoundVar>
[src]
pub fn bound_var(&self, interner: &I) -> Option<BoundVar>
[src]If this is a TyKind::BoundVar(d)
, returns Some(d)
else None
.
pub fn inference_var(&self, interner: &I) -> Option<InferenceVar>
[src]
pub fn inference_var(&self, interner: &I) -> Option<InferenceVar>
[src]If this is a TyKind::InferenceVar(d)
, returns Some(d)
else None
.
pub fn is_general_var(
&self,
interner: &I,
binders: &CanonicalVarKinds<I>
) -> bool
[src]
pub fn is_general_var(
&self,
interner: &I,
binders: &CanonicalVarKinds<I>
) -> bool
[src]Returns true if this is a BoundVar
or an InferenceVar
of TyVariableKind::General
.
pub fn is_integer(&self, interner: &I) -> bool
[src]
pub fn is_integer(&self, interner: &I) -> bool
[src]Returns true if this is an IntTy
or UintTy
.
pub fn adt_id(&self, interner: &I) -> Option<AdtId<I>>
[src]
pub fn adt_id(&self, interner: &I) -> Option<AdtId<I>>
[src]Returns Some(adt_id)
if this is an ADT, None
otherwise
pub fn needs_shift(&self, interner: &I) -> bool
[src]
pub fn needs_shift(&self, interner: &I) -> bool
[src]True if this type contains “bound” types/lifetimes, and hence needs to be shifted across binders. This is a very inefficient check, intended only for debug assertions, because I am lazy.
Trait Implementations
impl<I: Interner> CastTo<GenericArg<I>> for Ty<I>
[src]
impl<I: Interner> CastTo<GenericArg<I>> for Ty<I>
[src]fn cast_to(self, interner: &I) -> GenericArg<I>
[src]
fn cast_to(self, interner: &I) -> GenericArg<I>
[src]Cast a value to type T
.
impl<I: Interner> Fold<I> for Ty<I>
[src]
impl<I: Interner> Fold<I> for Ty<I>
[src]“Folding” a type invokes the fold_ty
method on the folder; this
usually (in turn) invokes super_fold_ty
to fold the individual
parts.
type Result = Ty<I>
type Result = Ty<I>
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<I: Interner> HasInterner for Ty<I>
[src]
impl<I: Interner> HasInterner for Ty<I>
[src]type Interner = I
type Interner = I
The interner associated with the type.
impl<I: Ord + Interner> Ord for Ty<I> where
I::InternedType: Ord,
[src]
impl<I: Ord + Interner> Ord for Ty<I> where
I::InternedType: Ord,
[src]impl<I: PartialOrd + Interner> PartialOrd<Ty<I>> for Ty<I> where
I::InternedType: PartialOrd,
[src]
impl<I: PartialOrd + Interner> PartialOrd<Ty<I>> for Ty<I> where
I::InternedType: PartialOrd,
[src]fn partial_cmp(&self, other: &Ty<I>) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &Ty<I>) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl<I> SuperFold<I> for Ty<I> where
I: Interner,
[src]
impl<I> SuperFold<I> for Ty<I> where
I: Interner,
[src]“Super fold” for a type invokes te more detailed callbacks on the type
fn super_fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Ty<I>> where
I: 'i,
[src]
fn super_fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Ty<I>> where
I: 'i,
[src]Recursively folds the value.
impl<I> SuperVisit<I> for Ty<I> where
I: Interner,
[src]
impl<I> SuperVisit<I> for Ty<I> where
I: Interner,
[src]“Super visit” for a type invokes the more detailed callbacks on the type
fn super_visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]
fn super_visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]Recursively visits the type contents.
impl<I: Interner> Visit<I> for Ty<I>
[src]
impl<I: Interner> Visit<I> for Ty<I>
[src]“visiting” a type invokes the visit_ty
method on the visitor; this
usually (in turn) invokes super_visit_ty
to visit the individual
parts.
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: Copy + Interner> Copy for Ty<I> where
I::InternedType: Copy,
[src]
I::InternedType: Copy,
impl<I: Eq + Interner> Eq for Ty<I> where
I::InternedType: Eq,
[src]
I::InternedType: Eq,
impl<I: Interner> StructuralEq for Ty<I>
[src]
impl<I: Interner> StructuralPartialEq for Ty<I>
[src]
Auto Trait Implementations
impl<I> RefUnwindSafe for Ty<I> where
<I as Interner>::InternedType: RefUnwindSafe,
<I as Interner>::InternedType: RefUnwindSafe,
impl<I> Send for Ty<I> where
<I as Interner>::InternedType: Send,
<I as Interner>::InternedType: Send,
impl<I> Sync for Ty<I> where
<I as Interner>::InternedType: Sync,
<I as Interner>::InternedType: Sync,
impl<I> Unpin for Ty<I> where
<I as Interner>::InternedType: Unpin,
<I as Interner>::InternedType: Unpin,
impl<I> UnwindSafe for Ty<I> where
<I as Interner>::InternedType: UnwindSafe,
<I as Interner>::InternedType: UnwindSafe,
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> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
[src]
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
[src]pub fn could_match(&Self, &I, &dyn UnificationDatabase<I>, &T) -> bool
[src]
pub fn could_match(&Self, &I, &dyn UnificationDatabase<I>, &T) -> bool
[src]Checks whether self
and other
could possibly match.
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