Enum chalk_ir::DomainGoal
source · [−]pub enum DomainGoal<I: Interner> {
Holds(WhereClause<I>),
WellFormed(WellFormed<I>),
FromEnv(FromEnv<I>),
Normalize(Normalize<I>),
IsLocal(Ty<I>),
IsUpstream(Ty<I>),
IsFullyVisible(Ty<I>),
LocalImplAllowed(TraitRef<I>),
Compatible,
DownstreamType(Ty<I>),
Reveal,
ObjectSafe(TraitId<I>),
}
Expand description
A “domain goal” is a goal that is directly about Rust, rather than a pure logical statement. As much as possible, the Chalk solver should avoid decomposing this enum, and instead treat its values opaquely.
Variants
Holds(WhereClause<I>)
Simple goal that is true if the where clause is true.
WellFormed(WellFormed<I>)
True if the type or trait ref is well-formed.
FromEnv(FromEnv<I>)
True if the trait ref can be derived from in-scope where clauses.
Normalize(Normalize<I>)
True if the alias type can be normalized to some other type
IsLocal(Ty<I>)
True if a type is considered to have been “defined” by the current crate. This is true for
a struct Foo { }
but false for a #[upstream] struct Foo { }
. However, for fundamental types
like Box<T>
, it is true if T
is local.
IsUpstream(Ty<I>)
True if a type is not considered to have been “defined” by the current crate. This is
false for a struct Foo { }
but true for a #[upstream] struct Foo { }
. However, for
fundamental types like Box<T>
, it is true if T
is upstream.
IsFullyVisible(Ty<I>)
True if a type and its input types are fully visible, known types. That is, there are no unknown type parameters anywhere in this type.
More formally, for each struct S<P0..Pn>: forall<P0..Pn> { IsFullyVisible(S<P0…Pn>) :- IsFullyVisible(P0), … IsFullyVisible(Pn) }
Note that any of these types can have lifetimes in their parameters too, but we only consider type parameters.
LocalImplAllowed(TraitRef<I>)
Used to dictate when trait impls are allowed in the current (local) crate based on the orphan rules.
LocalImplAllowed(T: Trait)
is true if the type T is allowed to impl trait Trait in
the current crate. Under the current rules, this is unconditionally true for all types if
the Trait is considered to be “defined” in the current crate. If that is not the case, then
LocalImplAllowed(T: Trait)
can still be true if IsLocal(T)
is true.
Compatible
Used to activate the “compatible modality” rules. Rules that introduce predicates that have to do with “all compatible universes” should depend on this clause so that they only apply if this is present.
DownstreamType(Ty<I>)
Used to indicate that a given type is in a downstream crate. Downstream crates contain the current crate at some level of their dependencies.
Since chalk does not actually see downstream types, this is usually introduced with implication on a fresh, universally quantified type.
forall
This makes a new type T
available and makes DownstreamType(T)
provable for that type.
Reveal
Used to activate the “reveal mode”, in which opaque (impl Trait
) types can be equated
to their actual type.
ObjectSafe(TraitId<I>)
Used to indicate that a trait is object safe.
Implementations
sourceimpl<I: Interner> DomainGoal<I>
impl<I: Interner> DomainGoal<I>
sourcepub fn into_from_env_goal(self, interner: I) -> DomainGoal<I>
pub fn into_from_env_goal(self, interner: I) -> DomainGoal<I>
Convert Implemented(...)
into FromEnv(...)
, but leave other
goals unchanged.
sourcepub fn inputs(&self, interner: I) -> Vec<GenericArg<I>>
pub fn inputs(&self, interner: I) -> Vec<GenericArg<I>>
Lists generic arguments that are inputs to this domain goal.
Trait Implementations
sourceimpl<I: Interner> CastTo<DomainGoal<I>> for DomainGoal<I>
impl<I: Interner> CastTo<DomainGoal<I>> for DomainGoal<I>
sourcefn cast_to(
self,
_interner: <DomainGoal<I> as HasInterner>::Interner
) -> DomainGoal<I>
fn cast_to(
self,
_interner: <DomainGoal<I> as HasInterner>::Interner
) -> DomainGoal<I>
T
.sourceimpl<I: Interner> CastTo<DomainGoal<I>> for FromEnv<I>
impl<I: Interner> CastTo<DomainGoal<I>> for FromEnv<I>
sourcefn cast_to(self, _interner: I) -> DomainGoal<I>
fn cast_to(self, _interner: I) -> DomainGoal<I>
T
.sourceimpl<I: Interner> CastTo<DomainGoal<I>> for Normalize<I>
impl<I: Interner> CastTo<DomainGoal<I>> for Normalize<I>
sourcefn cast_to(self, _interner: I) -> DomainGoal<I>
fn cast_to(self, _interner: I) -> DomainGoal<I>
T
.sourceimpl<I: Interner> CastTo<DomainGoal<I>> for WellFormed<I>
impl<I: Interner> CastTo<DomainGoal<I>> for WellFormed<I>
sourcefn cast_to(self, _interner: I) -> DomainGoal<I>
fn cast_to(self, _interner: I) -> DomainGoal<I>
T
.sourceimpl<I: Clone + Interner> Clone for DomainGoal<I>
impl<I: Clone + Interner> Clone for DomainGoal<I>
sourcefn clone(&self) -> DomainGoal<I>
fn clone(&self) -> DomainGoal<I>
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresourceimpl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClause<I>
impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClause<I>
sourcefn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
self
and other
could possibly match.sourceimpl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClauseData<I>
impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClauseData<I>
sourcefn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<I>
) -> bool
self
and other
could possibly match.sourceimpl<I: Interner> Debug for DomainGoal<I>
impl<I: Interner> Debug for DomainGoal<I>
sourceimpl<I: Interner> HasInterner for DomainGoal<I>
impl<I: Interner> HasInterner for DomainGoal<I>
type Interner = I
type Interner = I
sourceimpl<I: Hash + Interner> Hash for DomainGoal<I>
impl<I: Hash + Interner> Hash for DomainGoal<I>
sourceimpl<I: PartialEq + Interner> PartialEq<DomainGoal<I>> for DomainGoal<I>
impl<I: PartialEq + Interner> PartialEq<DomainGoal<I>> for DomainGoal<I>
sourcefn eq(&self, other: &DomainGoal<I>) -> bool
fn eq(&self, other: &DomainGoal<I>) -> bool
sourceimpl<I: Interner> TypeFoldable<I> for DomainGoal<I>
impl<I: Interner> TypeFoldable<I> for DomainGoal<I>
sourcefn try_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self, E>
fn try_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self, E>
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 moresourcefn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
fn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
. Read moresourceimpl<I: Interner> TypeSuperVisitable<I> for DomainGoal<I>
impl<I: Interner> TypeSuperVisitable<I> for DomainGoal<I>
sourcefn super_visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
fn super_visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
sourceimpl<I: Interner> TypeVisitable<I> for DomainGoal<I>
impl<I: Interner> TypeVisitable<I> for DomainGoal<I>
sourcefn visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
fn visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
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 moresourceimpl<I: Interner> Zip<I> for DomainGoal<I>
impl<I: Interner> Zip<I> for DomainGoal<I>
impl<I: Interner> Copy for DomainGoal<I>where
I::InternedSubstitution: Copy,
I::InternedLifetime: Copy,
I::InternedType: Copy,
impl<I: Eq + Interner> Eq for DomainGoal<I>
impl<I: Interner> StructuralEq for DomainGoal<I>
impl<I: Interner> StructuralPartialEq for DomainGoal<I>
Auto Trait Implementations
impl<I> RefUnwindSafe for DomainGoal<I>where
<I as Interner>::DefId: RefUnwindSafe,
<I as Interner>::InternedLifetime: RefUnwindSafe,
<I as Interner>::InternedSubstitution: RefUnwindSafe,
<I as Interner>::InternedType: RefUnwindSafe,
impl<I> Send for DomainGoal<I>where
<I as Interner>::DefId: Send,
<I as Interner>::InternedLifetime: Send,
<I as Interner>::InternedSubstitution: Send,
<I as Interner>::InternedType: Send,
impl<I> Sync for DomainGoal<I>where
<I as Interner>::DefId: Sync,
<I as Interner>::InternedLifetime: Sync,
<I as Interner>::InternedSubstitution: Sync,
<I as Interner>::InternedType: Sync,
impl<I> Unpin for DomainGoal<I>where
<I as Interner>::DefId: Unpin,
<I as Interner>::InternedLifetime: Unpin,
<I as Interner>::InternedSubstitution: Unpin,
<I as Interner>::InternedType: Unpin,
impl<I> UnwindSafe for DomainGoal<I>where
<I as Interner>::DefId: UnwindSafe,
<I as Interner>::InternedLifetime: UnwindSafe,
<I as Interner>::InternedSubstitution: UnwindSafe,
<I as Interner>::InternedType: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<T> Cast for T
impl<T> Cast for T
sourcefn cast<U>(self, interner: U::Interner) -> Uwhere
Self: CastTo<U>,
U: HasInterner,
fn cast<U>(self, interner: U::Interner) -> Uwhere
Self: CastTo<U>,
U: HasInterner,
U
using CastTo
.sourceimpl<T, I> CastTo<DomainGoal<I>> for Twhere
T: CastTo<WhereClause<I>>,
I: Interner,
impl<T, I> CastTo<DomainGoal<I>> for Twhere
T: CastTo<WhereClause<I>>,
I: Interner,
sourcefn cast_to(self, interner: I) -> DomainGoal<I>
fn cast_to(self, interner: I) -> DomainGoal<I>
T
.sourceimpl<T, I> CastTo<ProgramClause<I>> for Twhere
T: CastTo<DomainGoal<I>>,
I: Interner,
impl<T, I> CastTo<ProgramClause<I>> for Twhere
T: CastTo<DomainGoal<I>>,
I: Interner,
sourcefn cast_to(self, interner: I) -> ProgramClause<I>
fn cast_to(self, interner: I) -> ProgramClause<I>
T
.sourceimpl<T, I> CouldMatch<T> for Twhere
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for Twhere
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
sourcefn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T
) -> bool
fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T
) -> bool
self
and other
could possibly match.sourceimpl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
sourcefn shifted_in(self, interner: I) -> T
fn shifted_in(self, interner: I) -> T
sourcefn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
outer_binder
so that it is
valid at the innermost binder. See DebruijnIndex::shifted_in_from
for a detailed explanation. Read moresourcefn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<T, NoSolution>
fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<T, NoSolution>
outer_binder
. See DebruijnIndex::shifted_out_to
for a detailed explanation. Read more