Struct TyCtxt

pub struct TyCtxt<'tcx> {
    gcx: &'tcx GlobalCtxt<'tcx>,
}

The central data structure of the compiler. It stores references to the various arenas and also houses the results of the various compiler queries that have been performed. See the rustc dev guide for more details.

An implementation detail: TyCtxt is a wrapper type for GlobalCtxt, which is the struct that actually holds all the data. TyCtxt derefs to GlobalCtxt, and in practice TyCtxt is passed around everywhere, and all operations are done via TyCtxt. A TyCtxt is obtained for a GlobalCtxt by calling enter with a closure f. That function creates both the TyCtxt, and an ImplicitCtxt around it that is put into TLS. Within f:

• The ImplicitCtxt is available implicitly via TLS.
• The TyCtxt is available explicitly via the tcx parameter, and also implicitly within the ImplicitCtxt. Explicit access is preferred when possible.

Fields

gcx: &'tcx GlobalCtxt<'tcx>

Implementations

impl<'tcx> TyCtxt<'tcx>

fn expect_hir_owner_nodes(self, def_id: LocalDefId) -> &'tcx OwnerNodes<'tcx>

pub fn hir_owner_nodes(self, owner_id: OwnerId) -> &'tcx OwnerNodes<'tcx>

fn opt_hir_owner_node(self, def_id: LocalDefId) -> Option<OwnerNode<'tcx>>

pub fn expect_hir_owner_node(self, def_id: LocalDefId) -> OwnerNode<'tcx>

pub fn hir_owner_node(self, owner_id: OwnerId) -> OwnerNode<'tcx>

pub fn hir_node(self, id: HirId) -> Node<'tcx>

Retrieves the hir::Node corresponding to id.

pub fn hir_node_by_def_id(self, id: LocalDefId) -> Node<'tcx>

Retrieves the hir::Node corresponding to id.

pub fn parent_hir_id(self, hir_id: HirId) -> HirId

Returns HirId of the parent HIR node of node with this hir_id. Returns the same hir_id if and only if hir_id == CRATE_HIR_ID.

If calling repeatedly and iterating over parents, prefer Map::parent_iter.

pub fn parent_hir_node(self, hir_id: HirId) -> Node<'tcx>

Returns parent HIR node of node with this hir_id. Returns HIR node of the same hir_id if and only if hir_id == CRATE_HIR_ID.

impl<'tcx> TyCtxt<'tcx>

pub fn hir(self) -> Map<'tcx>

pub fn parent_module(self, id: HirId) -> LocalModDefId

pub fn parent_module_from_def_id(self, id: LocalDefId) -> LocalModDefId

pub fn impl_subject(self, def_id: DefId) -> EarlyBinder<'tcx, ImplSubject<'tcx>>

pub fn is_foreign_item(self, def_id: impl Into<DefId>) -> bool

Returns true if this is a foreign item (i.e., linked via extern { ... }).

pub fn hash_owner_nodes( self, node: OwnerNode<'_>, bodies: &SortedMap<ItemLocalId, &Body<'_>>, attrs: &SortedMap<ItemLocalId, &[Attribute]>, ) -> (Option<Fingerprint>, Option<Fingerprint>)

impl<'tcx> TyCtxt<'tcx>

pub fn try_destructure_mir_constant_for_user_output( self, val: ConstValue<'tcx>, ty: Ty<'tcx>, ) -> Option<DestructuredConstant<'tcx>>

Tries to destructure an mir::Const ADT or array into its variant index and its field values. This should only be used for pretty printing.

pub fn const_caller_location( self, file: Symbol, line: u32, col: u32, ) -> ConstValue<'tcx>

Getting a &core::panic::Location referring to a span.

pub fn is_eligible_for_coverage(self, key: LocalDefId) -> bool

Returns true if this def is a function-like thing that is eligible for coverage instrumentation under -Cinstrument-coverage.

(Eligible functions might nevertheless be skipped for other reasons.)

pub fn build_mir(self, key: LocalDefId) -> Body<'tcx>

Create the MIR for a given DefId - this includes unreachable code. You do not want to call this yourself, instead use the cached version via mir_built

pub fn import_source_files(self, key: CrateNum)

Imports all SourceFiles from the given crate into the current session. This normally happens automatically when we decode a Span from that crate’s metadata - however, the incr comp cache needs to trigger this manually when decoding a foreign Span

pub fn expn_hash_to_expn_id( self, cnum: CrateNum, index_guess: u32, hash: ExpnHash, ) -> ExpnId

pub fn def_path_hash_to_def_id_extern( self, hash: DefPathHash, stable_crate_id: StableCrateId, ) -> DefId

Converts a DefPathHash to its corresponding DefId in the current compilation session, if it still exists. This is used during incremental compilation to turn a deserialized DefPathHash into its current DefId. Will fetch a DefId from a DefPathHash for a foreign crate.

pub fn thir_tree(self, key: LocalDefId) -> String

Create a THIR tree for debugging.

pub fn thir_flat(self, key: LocalDefId) -> String

Create a list-like THIR representation for debugging.

pub fn should_codegen_locally(self, instance: Instance<'tcx>) -> bool

Returns true if we should codegen an instance in the local crate, or returns false if we can just link to the upstream crate and therefore don’t need a mono item.

pub fn alloc_self_profile_query_strings(self)

pub fn save_dep_graph(self)

Saves and writes the DepGraph to the file system.

This function saves both the dep-graph and the query result cache, and drops the result cache.

This function should only run after all queries have completed. Trying to execute a query afterwards would attempt to read the result cache we just dropped.

pub fn query_key_hash_verify_all(self)

impl TyCtxt<'_>

pub fn lint_level_at_node( self, lint: &'static Lint, id: HirId, ) -> (Level, LintLevelSource)

Fetch and return the user-visible lint level for the given lint at the given HirId.

impl<'tcx> TyCtxt<'tcx>

pub fn require_lang_item(self, lang_item: LangItem, span: Option<Span>) -> DefId

Returns the DefId for a given LangItem. If not found, fatally aborts compilation.

pub fn is_lang_item(self, def_id: DefId, lang_item: LangItem) -> bool

pub fn as_lang_item(self, def_id: DefId) -> Option<LangItem>

pub fn fn_trait_kind_from_def_id(self, id: DefId) -> Option<ClosureKind>

Given a DefId of one of the Fn, FnMut or FnOnce traits, returns a corresponding ty::ClosureKind. For any other DefId return None.

pub fn async_fn_trait_kind_from_def_id(self, id: DefId) -> Option<ClosureKind>

Given a DefId of one of the AsyncFn, AsyncFnMut or AsyncFnOnce traits, returns a corresponding ty::ClosureKind. For any other DefId return None.

pub fn fn_trait_kind_to_def_id(self, kind: ClosureKind) -> Option<DefId>

Given a ty::ClosureKind, get the DefId of its corresponding Fn-family trait, if it is defined.

pub fn async_fn_trait_kind_to_def_id(self, kind: ClosureKind) -> Option<DefId>

Given a ty::ClosureKind, get the DefId of its corresponding Fn-family trait, if it is defined.

pub fn is_fn_trait(self, id: DefId) -> bool

Returns true if id is a DefId of Fn, FnMut or FnOnce traits.

impl<'tcx> TyCtxt<'tcx>

pub fn eval_stability( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<Span>, ) -> EvalResult

Evaluates the stability of an item.

Returns EvalResult::Allow if the item is stable, or unstable but the corresponding #![feature] has been provided. Returns EvalResult::Deny which describes the offending unstable feature otherwise.

If id is Some(_), this function will also check if the item at def_id has been deprecated. If the item is indeed deprecated, we will emit a deprecation lint attached to id.

pub fn eval_stability_allow_unstable( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<Span>, allow_unstable: AllowUnstable, ) -> EvalResult

Evaluates the stability of an item.

Returns EvalResult::Allow if the item is stable, or unstable but the corresponding #![feature] has been provided. Returns EvalResult::Deny which describes the offending unstable feature otherwise.

If id is Some(_), this function will also check if the item at def_id has been deprecated. If the item is indeed deprecated, we will emit a deprecation lint attached to id.

Pass AllowUnstable::Yes to allow_unstable to force an unstable item to be allowed. Deprecation warnings will be emitted normally.

pub fn eval_default_body_stability( self, def_id: DefId, span: Span, ) -> EvalResult

Evaluates the default-impl stability of an item.

Returns EvalResult::Allow if the item’s default implementation is stable, or unstable but the corresponding #![feature] has been provided. Returns EvalResult::Deny which describes the offending unstable feature otherwise.

pub fn check_stability( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<Span>, ) -> bool

Checks if an item is stable or error out.

If the item defined by def_id is unstable and the corresponding #![feature] does not exist, emits an error.

This function will also check if the item is deprecated. If so, and id is not None, a deprecated lint attached to id will be emitted.

Returns true if item is allowed aka, stable or unstable under an enabled feature.

pub fn check_stability_allow_unstable( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<Span>, allow_unstable: AllowUnstable, ) -> bool

Checks if an item is stable or error out.

If the item defined by def_id is unstable and the corresponding #![feature] does not exist, emits an error.

This function will also check if the item is deprecated. If so, and id is not None, a deprecated lint attached to id will be emitted.

Pass AllowUnstable::Yes to allow_unstable to force an unstable item to be allowed. Deprecation warnings will be emitted normally.

Returns true if item is allowed aka, stable or unstable under an enabled feature.

pub fn check_optional_stability( self, def_id: DefId, id: Option<HirId>, span: Span, method_span: Option<Span>, allow_unstable: AllowUnstable, unmarked: impl FnOnce(Span, DefId), ) -> bool

Like check_stability, except that we permit items to have custom behaviour for missing stability attributes (not necessarily just emit a bug!). This is necessary for default generic parameters, which only have stability attributes if they were added after the type on which they’re defined.

Returns true if item is allowed aka, stable or unstable under an enabled feature.

pub fn lookup_deprecation(self, id: DefId) -> Option<Deprecation>

impl<'tcx> TyCtxt<'tcx>

Const-related utilities

pub fn span_as_caller_location(self, span: Span) -> ConstValue<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn const_eval_poly(self, def_id: DefId) -> EvalToConstValueResult<'tcx>

Evaluates a constant without providing any generic parameters. This is useful to evaluate consts that can’t take any generic arguments like const items or enum discriminants. If a generic parameter is used within the constant ErrorHandled::ToGeneric will be returned.

pub fn const_eval_poly_to_alloc( self, def_id: DefId, ) -> EvalToAllocationRawResult<'tcx>

Evaluates a constant without providing any generic parameters. This is useful to evaluate consts that can’t take any generic arguments like const items or enum discriminants. If a generic parameter is used within the constant ErrorHandled::ToGeneric will be returned.

pub fn const_eval_resolve( self, typing_env: TypingEnv<'tcx>, ct: UnevaluatedConst<'tcx>, span: Span, ) -> EvalToConstValueResult<'tcx>

Resolves and evaluates a constant.

The constant can be located on a trait like <A as B>::C, in which case the given generic parameters and environment are used to resolve the constant. Alternatively if the constant has generic parameters in scope the generic parameters are used to evaluate the value of the constant. For example in fn foo<T>() { let _ = [0; bar::<T>()]; } the repeat count constant bar::<T>() requires a instantiation for T, if the instantiation for T is still too generic for the constant to be evaluated then Err(ErrorHandled::TooGeneric) is returned.

pub fn const_eval_resolve_for_typeck( self, typing_env: TypingEnv<'tcx>, ct: UnevaluatedConst<'tcx>, span: Span, ) -> EvalToValTreeResult<'tcx>

pub fn const_eval_instance( self, typing_env: TypingEnv<'tcx>, instance: Instance<'tcx>, span: Span, ) -> EvalToConstValueResult<'tcx>

pub fn const_eval_global_id( self, typing_env: TypingEnv<'tcx>, cid: GlobalId<'tcx>, span: Span, ) -> EvalToConstValueResult<'tcx>

Evaluate a constant to a ConstValue.

pub fn const_eval_global_id_for_typeck( self, typing_env: TypingEnv<'tcx>, cid: GlobalId<'tcx>, span: Span, ) -> EvalToValTreeResult<'tcx>

Evaluate a constant to a type-level constant.

impl<'tcx> TyCtxt<'tcx>

pub fn reserve_alloc_id(self) -> AllocId

Obtains a new allocation ID that can be referenced but does not yet have an allocation backing it.

Make sure to call set_alloc_id_memory or set_alloc_id_same_memory before returning such an AllocId from a query.

fn reserve_and_set_dedup(self, alloc: GlobalAlloc<'tcx>, salt: usize) -> AllocId

Reserves a new ID if this allocation has not been dedup-reserved before. Should not be used for mutable memory.

pub fn reserve_and_set_memory_dedup( self, mem: ConstAllocation<'tcx>, salt: usize, ) -> AllocId

Generates an AllocId for a memory allocation. If the exact same memory has been allocated before, this will return the same AllocId.

pub fn reserve_and_set_static_alloc(self, static_id: DefId) -> AllocId

Generates an AllocId for a static or return a cached one in case this function has been called on the same static before.

pub fn reserve_and_set_fn_alloc( self, instance: Instance<'tcx>, salt: usize, ) -> AllocId

Generates an AllocId for a function. Will get deduplicated.

pub fn reserve_and_set_vtable_alloc( self, ty: Ty<'tcx>, dyn_ty: &'tcx List<PolyExistentialPredicate<'tcx>>, salt: usize, ) -> AllocId

Generates an AllocId for a (symbolic, not-reified) vtable. Will get deduplicated.

pub fn reserve_and_set_memory_alloc(self, mem: ConstAllocation<'tcx>) -> AllocId

Interns the Allocation and return a new AllocId, even if there’s already an identical Allocation with a different AllocId. Statics with identical content will still point to the same Allocation, i.e., their data will be deduplicated through Allocation interning – but they are different places in memory and as such need different IDs.

pub fn try_get_global_alloc(self, id: AllocId) -> Option<GlobalAlloc<'tcx>>

Returns None in case the AllocId is dangling. An InterpretCx can still have a local Allocation for that AllocId, but having such an AllocId in a constant is illegal and will likely ICE. This function exists to allow const eval to detect the difference between evaluation- local dangling pointers and allocations in constants/statics.

pub fn global_alloc(self, id: AllocId) -> GlobalAlloc<'tcx>

Panics in case the AllocId is dangling. Since that is impossible for AllocIds in constants (as all constants must pass interning and validation that check for dangling ids), this function is frequently used throughout rustc, but should not be used within the interpreter.

pub fn set_alloc_id_memory(self, id: AllocId, mem: ConstAllocation<'tcx>)

Freezes an AllocId created with reserve by pointing it at an Allocation. Trying to call this function twice, even with the same Allocation will ICE the compiler.

pub fn set_nested_alloc_id_static(self, id: AllocId, def_id: LocalDefId)

Freezes an AllocId created with reserve by pointing it at a static item. Trying to call this function twice, even with the same DefId will ICE the compiler.

impl<'tcx> TyCtxt<'tcx>

pub fn expand_abstract_consts<T: TypeFoldable<TyCtxt<'tcx>>>(self, ac: T) -> T

impl<'tcx> TyCtxt<'tcx>

pub fn ty_string_with_limit(self, ty: Ty<'tcx>, length_limit: usize) -> String

pub fn short_ty_string(self, ty: Ty<'tcx>, path: &mut Option<PathBuf>) -> String

impl<'tcx> TyCtxt<'tcx>

pub fn instantiate_bound_regions<T, F>( self, value: Binder<'tcx, T>, fld_r: F, ) -> (T, FxIndexMap<BoundRegion, Region<'tcx>>)

where F: FnMut(BoundRegion) -> Region<'tcx>, T: TypeFoldable<TyCtxt<'tcx>>,

Replaces all regions bound by the given Binder with the results returned by the closure; the closure is expected to return a free region (relative to this binder), and hence the binder is removed in the return type. The closure is invoked once for each unique BoundRegionKind; multiple references to the same BoundRegionKind will reuse the previous result. A map is returned at the end with each bound region and the free region that replaced it.

Panics

This method only replaces late bound regions. Any types or constants bound by value will cause an ICE.

pub fn instantiate_bound_regions_uncached<T, F>( self, value: Binder<'tcx, T>, replace_regions: F, ) -> T

where F: FnMut(BoundRegion) -> Region<'tcx>, T: TypeFoldable<TyCtxt<'tcx>>,

pub fn replace_escaping_bound_vars_uncached<T: TypeFoldable<TyCtxt<'tcx>>>( self, value: T, delegate: impl BoundVarReplacerDelegate<'tcx>, ) -> T

Replaces all escaping bound vars. The fld_r closure replaces escaping bound regions; the fld_t closure replaces escaping bound types and the fld_c closure replaces escaping bound consts.

pub fn replace_bound_vars_uncached<T: TypeFoldable<TyCtxt<'tcx>>>( self, value: Binder<'tcx, T>, delegate: impl BoundVarReplacerDelegate<'tcx>, ) -> T

Replaces all types or regions bound by the given Binder. The fld_r closure replaces bound regions, the fld_t closure replaces bound types, and fld_c replaces bound constants.

pub fn liberate_late_bound_regions<T>( self, all_outlive_scope: DefId, value: Binder<'tcx, T>, ) -> T

where T: TypeFoldable<TyCtxt<'tcx>>,

Replaces any late-bound regions bound in value with free variants attached to all_outlive_scope.

pub fn shift_bound_var_indices<T>(self, bound_vars: usize, value: T) -> T

where T: TypeFoldable<TyCtxt<'tcx>>,

pub fn instantiate_bound_regions_with_erased<T>( self, value: Binder<'tcx, T>, ) -> T

where T: TypeFoldable<TyCtxt<'tcx>>,

Replaces any late-bound regions bound in value with 'erased. Useful in codegen but also method lookup and a few other places where precise region relationships are not required.

pub fn anonymize_bound_vars<T>(self, value: Binder<'tcx, T>) -> Binder<'tcx, T>

where T: TypeFoldable<TyCtxt<'tcx>>,

Anonymize all bound variables in value, this is mostly used to improve caching.

impl<'tcx> TyCtxt<'tcx>

pub fn offset_of_subfield<I>( self, typing_env: TypingEnv<'tcx>, layout: TyAndLayout<'tcx>, indices: I, ) -> Size

where I: Iterator<Item = (VariantIdx, FieldIdx)>,

impl<'tcx> TyCtxt<'tcx>

pub fn normalize_erasing_regions<T>( self, typing_env: TypingEnv<'tcx>, value: T, ) -> T

where T: TypeFoldable<TyCtxt<'tcx>>,

Erase the regions in value and then fully normalize all the types found within. The result will also have regions erased.

This should only be used outside of type inference. For example, it assumes that normalization will succeed.

pub fn try_normalize_erasing_regions<T>( self, typing_env: TypingEnv<'tcx>, value: T, ) -> Result<T, NormalizationError<'tcx>>

where T: TypeFoldable<TyCtxt<'tcx>>,

Tries to erase the regions in value and then fully normalize all the types found within. The result will also have regions erased.

Contrary to normalize_erasing_regions this function does not assume that normalization succeeds.

pub fn normalize_erasing_late_bound_regions<T>( self, typing_env: TypingEnv<'tcx>, value: Binder<'tcx, T>, ) -> T

where T: TypeFoldable<TyCtxt<'tcx>>,

If you have a Binder<'tcx, T>, you can do this to strip out the late-bound regions and then normalize the result, yielding up a T (with regions erased). This is appropriate when the binder is being instantiated at the call site.

N.B., currently, higher-ranked type bounds inhibit normalization. Therefore, each time we erase them in codegen, we need to normalize the contents.

pub fn instantiate_and_normalize_erasing_regions<T>( self, param_args: GenericArgsRef<'tcx>, typing_env: TypingEnv<'tcx>, value: EarlyBinder<'tcx, T>, ) -> T

where T: TypeFoldable<TyCtxt<'tcx>>,

Monomorphizes a type from the AST by first applying the in-scope instantiations and then normalizing any associated types. Panics if normalization fails. In case normalization might fail use try_instantiate_and_normalize_erasing_regions instead.

pub fn try_instantiate_and_normalize_erasing_regions<T>( self, param_args: GenericArgsRef<'tcx>, typing_env: TypingEnv<'tcx>, value: EarlyBinder<'tcx, T>, ) -> Result<T, NormalizationError<'tcx>>

where T: TypeFoldable<TyCtxt<'tcx>>,

Monomorphizes a type from the AST by first applying the in-scope instantiations and then trying to normalize any associated types. Contrary to instantiate_and_normalize_erasing_regions this does not assume that normalization succeeds.

impl<'t> TyCtxt<'t>

pub fn def_path_str(self, def_id: impl IntoQueryParam<DefId>) -> String

Returns a string identifying this DefId. This string is suitable for user output.

pub fn def_path_str_with_args( self, def_id: impl IntoQueryParam<DefId>, args: &'t [GenericArg<'t>], ) -> String

pub fn value_path_str_with_args( self, def_id: impl IntoQueryParam<DefId>, args: &'t [GenericArg<'t>], ) -> String

impl<'tcx> TyCtxt<'tcx>

pub fn for_each_impl<F: FnMut(DefId)>(self, trait_def_id: DefId, f: F)

trait_def_id MUST BE the DefId of a trait.

pub fn for_each_relevant_impl( self, trait_def_id: DefId, self_ty: Ty<'tcx>, f: impl FnMut(DefId), )

Iterate over every impl that could possibly match the self type self_ty.

trait_def_id MUST BE the DefId of a trait.

pub fn non_blanket_impls_for_ty( self, trait_def_id: DefId, self_ty: Ty<'tcx>, ) -> impl Iterator<Item = DefId> + 'tcx

trait_def_id MUST BE the DefId of a trait.

pub fn all_impls( self, trait_def_id: DefId, ) -> impl Iterator<Item = DefId> + 'tcx

Returns an iterator containing all impls for trait_def_id.

trait_def_id MUST BE the DefId of a trait.

impl<'tcx> TyCtxt<'tcx>

pub fn type_id_hash(self, ty: Ty<'tcx>) -> Hash128

Creates a hash of the type Ty which will be the same no matter what crate context it’s calculated within. This is used by the type_id intrinsic.

pub fn res_generics_def_id(self, res: Res) -> Option<DefId>

pub fn type_is_copy_modulo_regions( self, typing_env: TypingEnv<'tcx>, ty: Ty<'tcx>, ) -> bool

Checks whether ty: Copy holds while ignoring region constraints.

This impacts whether values of ty are moved or copied when referenced. This means that we may generate MIR which does copies even when the type actually doesn’t satisfy the full requirements for the Copy trait (cc #29149) – this winds up being reported as an error during NLL borrow check.

This function should not be used if there is an InferCtxt available. Use InferCtxt::type_is_copy_modulo_regions instead.

pub fn struct_tail_for_codegen( self, ty: Ty<'tcx>, typing_env: TypingEnv<'tcx>, ) -> Ty<'tcx>

Returns the deeply last field of nested structures, or the same type if not a structure at all. Corresponds to the only possible unsized field, and its type can be used to determine unsizing strategy.

Should only be called if ty has no inference variables and does not need its lifetimes preserved (e.g. as part of codegen); otherwise normalization attempt may cause compiler bugs.

pub fn struct_tail_raw( self, ty: Ty<'tcx>, normalize: impl FnMut(Ty<'tcx>) -> Ty<'tcx>, f: impl FnMut(), ) -> Ty<'tcx>

Returns the deeply last field of nested structures, or the same type if not a structure at all. Corresponds to the only possible unsized field, and its type can be used to determine unsizing strategy.

This is parameterized over the normalization strategy (i.e. how to handle <T as Trait>::Assoc and impl Trait). You almost certainly do NOT want to pass the identity function here, unless you know what you’re doing, or you’re within normalization code itself and will handle an unnormalized tail recursively.

See also struct_tail_for_codegen, which is suitable for use during codegen.

pub fn struct_lockstep_tails_for_codegen( self, source: Ty<'tcx>, target: Ty<'tcx>, typing_env: TypingEnv<'tcx>, ) -> (Ty<'tcx>, Ty<'tcx>)

Same as applying struct_tail on source and target, but only keeps going as long as the two types are instances of the same structure definitions. For (Foo<Foo<T>>, Foo<dyn Trait>), the result will be (Foo<T>, dyn Trait), whereas struct_tail produces T, and Trait, respectively.

Should only be called if the types have no inference variables and do not need their lifetimes preserved (e.g., as part of codegen); otherwise, normalization attempt may cause compiler bugs.

pub fn struct_lockstep_tails_raw( self, source: Ty<'tcx>, target: Ty<'tcx>, normalize: impl Fn(Ty<'tcx>) -> Ty<'tcx>, ) -> (Ty<'tcx>, Ty<'tcx>)

Same as applying struct_tail on source and target, but only keeps going as long as the two types are instances of the same structure definitions. For (Foo<Foo<T>>, Foo<dyn Trait>), the result will be (Foo<T>, Trait), whereas struct_tail produces T, and Trait, respectively.

See also struct_lockstep_tails_for_codegen, which is suitable for use during codegen.

pub fn calculate_dtor( self, adt_did: DefId, validate: impl Fn(Self, DefId) -> Result<(), ErrorGuaranteed>, ) -> Option<Destructor>

Calculate the destructor of a given type.

pub fn calculate_async_dtor( self, adt_did: DefId, validate: impl Fn(Self, DefId) -> Result<(), ErrorGuaranteed>, ) -> Option<AsyncDestructor>

Calculate the async destructor of a given type.

pub fn async_drop_glue_morphology(self, did: DefId) -> AsyncDropGlueMorphology

Returns async drop glue morphology for a definition. To get async drop glue morphology for a type see Ty::async_drop_glue_morphology.

pub fn destructor_constraints(self, def: AdtDef<'tcx>) -> Vec<GenericArg<'tcx>>

Returns the set of types that are required to be alive in order to run the destructor of def (see RFCs 769 and 1238).

Note that this returns only the constraints for the destructor of def itself. For the destructors of the contents, you need adt_dtorck_constraint.

pub fn uses_unique_generic_params( self, args: &[GenericArg<'tcx>], ignore_regions: CheckRegions, ) -> Result<(), NotUniqueParam<'tcx>>

Checks whether each generic argument is simply a unique generic parameter.

pub fn is_closure_like(self, def_id: DefId) -> bool

Returns true if def_id refers to a closure, coroutine, or coroutine-closure (i.e. an async closure). These are all represented by hir::Closure, and all have the same DefKind.

Note that closures have a DefId, but the closure expression also has a

pub fn is_typeck_child(self, def_id: DefId) -> bool

Returns true if def_id refers to a definition that does not have its own type-checking context, i.e. closure, coroutine or inline const.

pub fn is_trait(self, def_id: DefId) -> bool

Returns true if def_id refers to a trait (i.e., trait Foo { ... }).

pub fn is_trait_alias(self, def_id: DefId) -> bool

Returns true if def_id refers to a trait alias (i.e., trait Foo = ...;), and false otherwise.

pub fn is_constructor(self, def_id: DefId) -> bool

Returns true if this DefId refers to the implicit constructor for a tuple struct like struct Foo(u32), and false otherwise.

pub fn typeck_root_def_id(self, def_id: DefId) -> DefId

Given the DefId, returns the DefId of the innermost item that has its own type-checking context or “inference environment”.

For example, a closure has its own DefId, but it is type-checked with the containing item. Similarly, an inline const block has its own DefId but it is type-checked together with the containing item.

Therefore, when we fetch the typeck the closure, for example, we really wind up fetching the typeck the enclosing fn item.

pub fn closure_env_ty( self, closure_ty: Ty<'tcx>, closure_kind: ClosureKind, env_region: Region<'tcx>, ) -> Ty<'tcx>

Given the DefId and args a closure, creates the type of self argument that the closure expects. For example, for a Fn closure, this would return a reference type &T where T = closure_ty.

Returns None if this closure’s kind has not yet been inferred. This should only be possible during type checking.

Note that the return value is a late-bound region and hence wrapped in a binder.

pub fn is_static(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a static item.

pub fn static_mutability(self, def_id: DefId) -> Option<Mutability>

pub fn is_thread_local_static(self, def_id: DefId) -> bool

Returns true if this is a static item with the #[thread_local] attribute.

pub fn is_mutable_static(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a mutable static item.

pub fn needs_thread_local_shim(self, def_id: DefId) -> bool

Returns true if the item pointed to by def_id is a thread local which needs a thread local shim generated.

pub fn thread_local_ptr_ty(self, def_id: DefId) -> Ty<'tcx>

Returns the type a reference to the thread local takes in MIR.

pub fn static_ptr_ty( self, def_id: DefId, typing_env: TypingEnv<'tcx>, ) -> Ty<'tcx>

Get the type of the pointer to the static that we use in MIR.

pub fn coroutine_hidden_types( self, def_id: DefId, ) -> impl Iterator<Item = EarlyBinder<'tcx, Ty<'tcx>>>

Return the set of types that should be taken into account when checking trait bounds on a coroutine’s internal state.

pub fn bound_coroutine_hidden_types( self, def_id: DefId, ) -> impl Iterator<Item = EarlyBinder<'tcx, Binder<'tcx, Ty<'tcx>>>>

Return the set of types that should be taken into account when checking trait bounds on a coroutine’s internal state. This properly replaces ReErased with new existential bound lifetimes.

pub fn try_expand_impl_trait_type( self, def_id: DefId, args: GenericArgsRef<'tcx>, inspect_coroutine_fields: InspectCoroutineFields, ) -> Result<Ty<'tcx>, Ty<'tcx>>

Expands the given impl trait type, stopping if the type is recursive.

pub fn def_descr(self, def_id: DefId) -> &'static str

Query and get an English description for the item’s kind.

pub fn def_kind_descr(self, def_kind: DefKind, def_id: DefId) -> &'static str

Get an English description for the item’s kind.

pub fn def_descr_article(self, def_id: DefId) -> &'static str

Gets an English article for the TyCtxt::def_descr.

pub fn def_kind_descr_article( self, def_kind: DefKind, def_id: DefId, ) -> &'static str

Gets an English article for the TyCtxt::def_kind_descr.

pub fn is_user_visible_dep(self, key: CrateNum) -> bool

Return true if the supplied CrateNum is “user-visible,” meaning either a public dependency, or a direct private dependency. This is used to decide whether the crate can be shown in impl suggestions.

pub fn expand_weak_alias_tys<T: TypeFoldable<TyCtxt<'tcx>>>(self, value: T) -> T

Expand any weak alias types contained within the given value.

This should be used over other normalization routines in situations where it’s important not to normalize other alias types and where the predicates on the corresponding type alias shouldn’t be taken into consideration.

Whenever possible prefer not to use this function! Instead, use standard normalization routines or if feasible don’t normalize at all.

This function comes in handy if you want to mimic the behavior of eager type alias expansion in a localized manner.

This delays a bug on overflow! Therefore you need to be certain that the contained types get fully normalized at a later stage. Note that even on overflow all well-behaved weak alias types get expanded correctly, so the result is still useful.

pub fn peel_off_weak_alias_tys(self, ty: Ty<'tcx>) -> Ty<'tcx>

Peel off all [weak alias types] in this type until there are none left.

This only expands weak alias types in “head” / outermost positions. It can be used over expand_weak_alias_tys as an optimization in situations where one only really cares about the kind of the final aliased type but not the types the other constituent types alias.

This delays a bug on overflow! Therefore you need to be certain that the type gets fully normalized at a later stage.

impl<'tcx> TyCtxt<'tcx>

pub fn for_each_free_region( self, value: &impl TypeVisitable<TyCtxt<'tcx>>, callback: impl FnMut(Region<'tcx>), )

Invoke callback on every region appearing free in value.

pub fn all_free_regions_meet( self, value: &impl TypeVisitable<TyCtxt<'tcx>>, callback: impl FnMut(Region<'tcx>) -> bool, ) -> bool

Returns true if callback returns true for every region appearing free in value.

pub fn any_free_region_meets( self, value: &impl TypeVisitable<TyCtxt<'tcx>>, callback: impl FnMut(Region<'tcx>) -> bool, ) -> bool

Returns true if callback returns true for some region appearing free in value.

pub fn collect_constrained_late_bound_regions<T>( self, value: Binder<'tcx, T>, ) -> FxIndexSet<BoundRegionKind>

where T: TypeFoldable<TyCtxt<'tcx>>,

Returns a set of all late-bound regions that are constrained by value, meaning that if we instantiate those LBR with variables and equate value with something else, those variables will also be equated.

pub fn collect_referenced_late_bound_regions<T>( self, value: Binder<'tcx, T>, ) -> FxIndexSet<BoundRegionKind>

where T: TypeFoldable<TyCtxt<'tcx>>,

Returns a set of all late-bound regions that appear in value anywhere.

fn collect_late_bound_regions<T>( self, value: Binder<'tcx, T>, just_constrained: bool, ) -> FxIndexSet<BoundRegionKind>

where T: TypeFoldable<TyCtxt<'tcx>>,

impl<'tcx> TyCtxt<'tcx>

pub const COMMON_VTABLE_ENTRIES: &'tcx [VtblEntry<'tcx>]

impl<'tcx> TyCtxt<'tcx>

pub fn closure_kind_origin( self, def_id: LocalDefId, ) -> Option<&'tcx (Span, HirPlace<'tcx>)>

pub fn closure_user_provided_sig( self, def_id: LocalDefId, ) -> CanonicalPolyFnSig<'tcx>

pub fn closure_captures( self, def_id: LocalDefId, ) -> &'tcx [&'tcx CapturedPlace<'tcx>]

impl<'tcx> TyCtxt<'tcx>

Some workarounds to use cases that cannot use create_def. Do not add new ways to create TyCtxtFeed without consulting with T-compiler and making an analysis about why your addition does not cause incremental compilation issues.

pub fn feed_unit_query(self) -> TyCtxtFeed<'tcx, ()>

Can only be fed before queries are run, and is thus exempt from any incremental issues. Do not use except for the initial query feeding.

pub fn create_local_crate_def_id( self, span: Span, ) -> TyCtxtFeed<'tcx, LocalDefId>

Only used in the resolver to register the CRATE_DEF_ID DefId and feed some queries for it. It will panic if used twice.

pub fn feed_anon_const_type( self, key: LocalDefId, value: EarlyBinder<'tcx, Ty<'tcx>>, )

In order to break cycles involving AnonConst, we need to set the expected type by side effect. However, we do not want this as a general capability, so this interface restricts to the only allowed case.

impl<'tcx> TyCtxt<'tcx>

pub fn has_typeck_results(self, def_id: LocalDefId) -> bool

pub fn body_codegen_attrs(self, def_id: DefId) -> &'tcx CodegenFnAttrs

Expects a body and returns its codegen attributes.

Unlike codegen_fn_attrs, this returns CodegenFnAttrs::EMPTY for constants.

pub fn alloc_steal_thir(self, thir: Thir<'tcx>) -> &'tcx Steal<Thir<'tcx>>

pub fn alloc_steal_mir(self, mir: Body<'tcx>) -> &'tcx Steal<Body<'tcx>>

pub fn alloc_steal_promoted( self, promoted: IndexVec<Promoted, Body<'tcx>>, ) -> &'tcx Steal<IndexVec<Promoted, Body<'tcx>>>

pub fn mk_adt_def( self, did: DefId, kind: AdtKind, variants: IndexVec<VariantIdx, VariantDef>, repr: ReprOptions, ) -> AdtDef<'tcx>

pub fn allocate_bytes_dedup(self, bytes: &[u8], salt: usize) -> AllocId

Allocates a read-only byte or string literal for mir::interpret with alignment 1. Returns the same AllocId if called again with the same bytes.

pub fn layout_scalar_valid_range( self, def_id: DefId, ) -> (Bound<u128>, Bound<u128>)

Returns a range of the start/end indices specified with the rustc_layout_scalar_valid_range attribute.

pub fn lift<T: Lift<TyCtxt<'tcx>>>(self, value: T) -> Option<T::Lifted>

pub fn create_global_ctxt<T>( gcx_cell: &'tcx OnceLock<GlobalCtxt<'tcx>>, s: &'tcx Session, crate_types: Vec<CrateType>, stable_crate_id: StableCrateId, arena: &'tcx WorkerLocal<Arena<'tcx>>, hir_arena: &'tcx WorkerLocal<Arena<'tcx>>, untracked: Untracked, dep_graph: DepGraph, query_kinds: &'tcx [DepKindStruct<'tcx>], query_system: QuerySystem<'tcx>, hooks: Providers, current_gcx: CurrentGcx, f: impl FnOnce(TyCtxt<'tcx>) -> T, ) -> T

Creates a type context. To use the context call fn enter which provides a TyCtxt.

By only providing the TyCtxt inside of the closure we enforce that the type context and any interned value (types, args, etc.) can only be used while ty::tls has a valid reference to the context, to allow formatting values that need it.

pub fn lang_items(self) -> &'tcx LanguageItems

Obtain all lang items of this crate and all dependencies (recursively)

pub fn ty_ordering_enum(self, span: Option<Span>) -> Ty<'tcx>

Gets a Ty representing the LangItem::OrderingEnum

pub fn get_diagnostic_item(self, name: Symbol) -> Option<DefId>

Obtain the given diagnostic item’s DefId. Use is_diagnostic_item if you just want to compare against another DefId, since is_diagnostic_item is cheaper.

pub fn get_diagnostic_name(self, id: DefId) -> Option<Symbol>

Obtain the diagnostic item’s name

pub fn is_diagnostic_item(self, name: Symbol, did: DefId) -> bool

Check whether the diagnostic item with the given name has the given DefId.

pub fn is_coroutine(self, def_id: DefId) -> bool

pub fn coroutine_movability(self, def_id: DefId) -> Movability

Returns the movability of the coroutine of def_id, or panics if given a def_id that is not a coroutine.

pub fn coroutine_is_async(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a coroutine for an async construct.

pub fn is_synthetic_mir(self, def_id: impl Into<DefId>) -> bool

pub fn is_general_coroutine(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a general coroutine that implements Coroutine. This means it is neither an async or gen construct.

pub fn coroutine_is_gen(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a coroutine for a gen construct.

pub fn coroutine_is_async_gen(self, def_id: DefId) -> bool

Returns true if the node pointed to by def_id is a coroutine for a async gen construct.

pub fn stability(self) -> &'tcx Index

pub fn features(self) -> &'tcx Features

pub fn def_key(self, id: impl IntoQueryParam<DefId>) -> DefKey

pub fn def_path(self, id: DefId) -> DefPath

Converts a DefId into its fully expanded DefPath (every DefId is really just an interned DefPath).

Note that if id is not local to this crate, the result will be a non-local DefPath.

pub fn def_path_hash(self, def_id: DefId) -> DefPathHash

pub fn crate_types(self) -> &'tcx [CrateType]

pub fn metadata_kind(self) -> MetadataKind

pub fn needs_metadata(self) -> bool

pub fn needs_crate_hash(self) -> bool

pub fn stable_crate_id(self, crate_num: CrateNum) -> StableCrateId

pub fn stable_crate_id_to_crate_num( self, stable_crate_id: StableCrateId, ) -> CrateNum

Maps a StableCrateId to the corresponding CrateNum. This method assumes that the crate in question has already been loaded by the CrateStore.

pub fn def_path_hash_to_def_id(self, hash: DefPathHash) -> Option<DefId>

Converts a DefPathHash to its corresponding DefId in the current compilation session, if it still exists. This is used during incremental compilation to turn a deserialized DefPathHash into its current DefId.

pub fn def_path_debug_str(self, def_id: DefId) -> String

pub fn dcx(self) -> DiagCtxtHandle<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn create_def( self, parent: LocalDefId, name: Symbol, def_kind: DefKind, ) -> TyCtxtFeed<'tcx, LocalDefId>

tcx-dependent operations performed for every created definition.

pub fn create_crate_num( self, stable_crate_id: StableCrateId, ) -> Result<TyCtxtFeed<'tcx, CrateNum>, CrateNum>

pub fn iter_local_def_id(self) -> impl Iterator<Item = LocalDefId> + 'tcx

pub fn def_path_table(self) -> &'tcx DefPathTable

pub fn def_path_hash_to_def_index_map(self) -> &'tcx DefPathHashMap

pub fn cstore_untracked(self) -> FreezeReadGuard<'tcx, CrateStoreDyn>

Note that this is untracked and should only be used within the query system if the result is otherwise tracked through queries

pub fn untracked(self) -> &'tcx Untracked

Give out access to the untracked data without any sanity checks.

pub fn definitions_untracked(self) -> FreezeReadGuard<'tcx, Definitions>

Note that this is untracked and should only be used within the query system if the result is otherwise tracked through queries

pub fn source_span_untracked(self, def_id: LocalDefId) -> Span

Note that this is untracked and should only be used within the query system if the result is otherwise tracked through queries

pub fn with_stable_hashing_context<R>( self, f: impl FnOnce(StableHashingContext<'_>) -> R, ) -> R

pub fn serialize_query_result_cache( self, encoder: FileEncoder, ) -> FileEncodeResult

pub fn local_crate_exports_generics(self) -> bool

pub fn is_suitable_region( self, generic_param_scope: LocalDefId, region: Region<'tcx>, ) -> Option<FreeRegionInfo>

Returns the DefId and the BoundRegionKind corresponding to the given region.

pub fn return_type_impl_or_dyn_traits( self, scope_def_id: LocalDefId, ) -> Vec<&'tcx Ty<'tcx>>

Given a DefId for an fn, return all the dyn and impl traits in its return type.

pub fn return_type_impl_or_dyn_traits_with_type_alias( self, scope_def_id: LocalDefId, ) -> Option<(Vec<&'tcx Ty<'tcx>>, Span, Option<Span>)>

Given a DefId for an fn, return all the dyn and impl traits in its return type, and the associated alias span when type alias is used, along with a span for lifetime suggestion (if there are existing generics).

pub fn is_bound_region_in_impl_item( self, suitable_region_binding_scope: LocalDefId, ) -> bool

Checks if the bound region is in Impl Item.

pub fn has_strict_asm_symbol_naming(self) -> bool

Determines whether identifiers in the assembly have strict naming rules. Currently, only NVPTX* targets need it.

pub fn caller_location_ty(self) -> Ty<'tcx>

Returns &'static core::panic::Location<'static>.

pub fn article_and_description( self, def_id: DefId, ) -> (&'static str, &'static str)

Returns a displayable description and article for the given def_id (e.g. ("a", "struct")).

pub fn type_length_limit(self) -> Limit

pub fn recursion_limit(self) -> Limit

pub fn move_size_limit(self) -> Limit

pub fn all_traits(self) -> impl Iterator<Item = DefId> + 'tcx

pub fn local_visibility(self, def_id: LocalDefId) -> Visibility

pub fn local_opaque_ty_origin( self, def_id: LocalDefId, ) -> OpaqueTyOrigin<LocalDefId>

Returns the origin of the opaque type def_id.

pub fn finish(self)

impl<'tcx> TyCtxt<'tcx>

pub fn debug_stats(self) -> impl Debug + 'tcx

impl<'tcx> TyCtxt<'tcx>

pub(crate) fn intern_region(self, v: RegionKind<'tcx>) -> Region<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn mk_pat(self, v: PatternKind<'tcx>) -> Pattern<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn mk_const_alloc(self, v: Allocation) -> ConstAllocation<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn mk_layout(self, v: LayoutData<FieldIdx, VariantIdx>) -> Layout<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn mk_adt_def_from_data(self, v: AdtDefData) -> AdtDef<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn mk_external_constraints( self, v: ExternalConstraintsData<TyCtxt<'tcx>>, ) -> ExternalConstraints<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn mk_predefined_opaques_in_body( self, v: PredefinedOpaquesData<TyCtxt<'tcx>>, ) -> PredefinedOpaques<'tcx>

impl<'tcx> TyCtxt<'tcx>

pub fn mk_const_list(self, v: &[Const<'tcx>]) -> &'tcx List<Const<'tcx>>

pub fn mk_args(self, v: &[GenericArg<'tcx>]) -> &'tcx List<GenericArg<'tcx>>

pub fn mk_type_list(self, v: &[Ty<'tcx>]) -> &'tcx List<Ty<'tcx>>

pub fn mk_canonical_var_infos( self, v: &[CanonicalVarInfo<'tcx>], ) -> &'tcx List<CanonicalVarInfo<'tcx>>

fn intern_poly_existential_predicates( self, v: &[PolyExistentialPredicate<'tcx>], ) -> &'tcx List<PolyExistentialPredicate<'tcx>>

pub fn mk_projs(self, v: &[ProjectionKind]) -> &'tcx List<ProjectionKind>

pub fn mk_place_elems( self, v: &[PlaceElem<'tcx>], ) -> &'tcx List<PlaceElem<'tcx>>

pub fn mk_bound_variable_kinds( self, v: &[BoundVariableKind], ) -> &'tcx List<BoundVariableKind>

pub fn mk_fields(self, v: &[FieldIdx]) -> &'tcx List<FieldIdx>

fn intern_local_def_ids(self, v: &[LocalDefId]) -> &'tcx List<LocalDefId>

fn intern_captures( self, v: &[&'tcx CapturedPlace<'tcx>], ) -> &'tcx List<&'tcx CapturedPlace<'tcx>>

pub fn mk_offset_of( self, v: &[(VariantIdx, FieldIdx)], ) -> &'tcx List<(VariantIdx, FieldIdx)>

impl<'tcx> TyCtxt<'tcx>

pub fn safe_to_unsafe_fn_ty(self, sig: PolyFnSig<'tcx>) -> Ty<'tcx>

Given a fn type, returns an equivalent unsafe fn type; that is, a fn type that is equivalent in every way for being unsafe.

pub fn trait_may_define_assoc_item( self, trait_def_id: DefId, assoc_name: Ident, ) -> bool

Given the def_id of a Trait trait_def_id and the name of an associated item assoc_name returns true if the trait_def_id defines an associated item of name assoc_name.

pub fn ty_is_opaque_future(self, ty: Ty<'_>) -> bool

Given a ty, return whether it’s an impl Future<...>.

pub fn supertrait_def_ids( self, trait_def_id: DefId, ) -> impl Iterator<Item = DefId> + 'tcx

Computes the def-ids of the transitive supertraits of trait_def_id. This (intentionally) does not compute the full elaborated super-predicates but just the set of def-ids. It is used to identify which traits may define a given associated type to help avoid cycle errors, and to make size estimates for vtable layout computation.

pub fn signature_unclosure( self, sig: PolyFnSig<'tcx>, safety: Safety, ) -> PolyFnSig<'tcx>

Given a closure signature, returns an equivalent fn signature. Detuples and so forth – so e.g., if we have a sig with Fn<(u32, i32)> then you would get a fn(u32, i32). unsafety determines the unsafety of the fn signature. If you pass hir::Safety::Unsafe in the previous example, then you would get an unsafe fn (u32, i32). It cannot convert a closure that requires unsafe.

pub fn mk_predicate( self, binder: Binder<'tcx, PredicateKind<'tcx>>, ) -> Predicate<'tcx>

pub fn reuse_or_mk_predicate( self, pred: Predicate<'tcx>, binder: Binder<'tcx, PredicateKind<'tcx>>, ) -> Predicate<'tcx>

pub fn check_args_compatible( self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], ) -> bool

fn check_args_compatible_inner( self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], nested: bool, ) -> bool

pub fn debug_assert_args_compatible( self, def_id: DefId, args: &'tcx [GenericArg<'tcx>], )

With cfg(debug_assertions), assert that args are compatible with their generics, and print out the args if not.

pub(crate) fn check_and_mk_args( self, def_id: DefId, args: impl IntoIterator<Item: Into<GenericArg<'tcx>>>, ) -> GenericArgsRef<'tcx>

pub fn mk_ct_from_kind(self, kind: ConstKind<'tcx>) -> Const<'tcx>

pub fn mk_ty_from_kind(self, st: TyKind<'tcx>) -> Ty<'tcx>

pub fn mk_param_from_def(self, param: &GenericParamDef) -> GenericArg<'tcx>

pub fn mk_place_field( self, place: Place<'tcx>, f: FieldIdx, ty: Ty<'tcx>, ) -> Place<'tcx>

pub fn mk_place_deref(self, place: Place<'tcx>) -> Place<'tcx>

pub fn mk_place_downcast( self, place: Place<'tcx>, adt_def: AdtDef<'tcx>, variant_index: VariantIdx, ) -> Place<'tcx>

pub fn mk_place_downcast_unnamed( self, place: Place<'tcx>, variant_index: VariantIdx, ) -> Place<'tcx>

pub fn mk_place_index(self, place: Place<'tcx>, index: Local) -> Place<'tcx>

pub fn mk_place_elem( self, place: Place<'tcx>, elem: PlaceElem<'tcx>, ) -> Place<'tcx>

This method copies Place’s projection, add an element and reintern it. Should not be used to build a full Place it’s just a convenient way to grab a projection and modify it in flight.

pub fn mk_poly_existential_predicates( self, eps: &[PolyExistentialPredicate<'tcx>], ) -> &'tcx List<PolyExistentialPredicate<'tcx>>

pub fn mk_clauses(self, clauses: &[Clause<'tcx>]) -> Clauses<'tcx>

pub fn mk_local_def_ids(self, clauses: &[LocalDefId]) -> &'tcx List<LocalDefId>

pub fn mk_local_def_ids_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<LocalDefId, &'tcx List<LocalDefId>>,

pub fn mk_captures_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<&'tcx CapturedPlace<'tcx>, &'tcx List<&'tcx CapturedPlace<'tcx>>>,

pub fn mk_const_list_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<Const<'tcx>, &'tcx List<Const<'tcx>>>,

pub fn mk_fn_sig<I, T>( self, inputs: I, output: I::Item, c_variadic: bool, safety: Safety, abi: ExternAbi, ) -> T::Output

where I: IntoIterator<Item = T>, T: CollectAndApply<Ty<'tcx>, FnSig<'tcx>>,

pub fn mk_poly_existential_predicates_from_iter<I, T>( self, iter: I, ) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<PolyExistentialPredicate<'tcx>, &'tcx List<PolyExistentialPredicate<'tcx>>>,

pub fn mk_clauses_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<Clause<'tcx>, Clauses<'tcx>>,

pub fn mk_type_list_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<Ty<'tcx>, &'tcx List<Ty<'tcx>>>,

pub fn mk_args_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<GenericArg<'tcx>, GenericArgsRef<'tcx>>,

pub fn mk_canonical_var_infos_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<CanonicalVarInfo<'tcx>, &'tcx List<CanonicalVarInfo<'tcx>>>,

pub fn mk_place_elems_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<PlaceElem<'tcx>, &'tcx List<PlaceElem<'tcx>>>,

pub fn mk_fields_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<FieldIdx, &'tcx List<FieldIdx>>,

pub fn mk_offset_of_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<(VariantIdx, FieldIdx), &'tcx List<(VariantIdx, FieldIdx)>>,

pub fn mk_args_trait( self, self_ty: Ty<'tcx>, rest: impl IntoIterator<Item = GenericArg<'tcx>>, ) -> GenericArgsRef<'tcx>

pub fn mk_bound_variable_kinds_from_iter<I, T>(self, iter: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<BoundVariableKind, &'tcx List<BoundVariableKind>>,

pub fn emit_node_span_lint( self, lint: &'static Lint, hir_id: HirId, span: impl Into<MultiSpan>, decorator: impl for<'a> LintDiagnostic<'a, ()>, )

Emit a lint at span from a lint struct (some type that implements LintDiagnostic, typically generated by #[derive(LintDiagnostic)]).

pub fn node_span_lint( self, lint: &'static Lint, hir_id: HirId, span: impl Into<MultiSpan>, decorate: impl for<'a, 'b> FnOnce(&'b mut Diag<'a, ()>), )

Emit a lint at the appropriate level for a hir node, with an associated span.

pub fn crate_level_attribute_injection_span(self, hir_id: HirId) -> Option<Span>

Find the crate root and the appropriate span where use and outer attributes can be inserted at.

pub fn disabled_nightly_features<E: EmissionGuarantee>( self, diag: &mut Diag<'_, E>, hir_id: Option<HirId>, features: impl IntoIterator<Item = (String, Symbol)>, )

pub fn emit_node_lint( self, lint: &'static Lint, id: HirId, decorator: impl for<'a> LintDiagnostic<'a, ()>, )

Emit a lint from a lint struct (some type that implements LintDiagnostic, typically generated by #[derive(LintDiagnostic)]).

pub fn node_lint( self, lint: &'static Lint, id: HirId, decorate: impl for<'a, 'b> FnOnce(&'b mut Diag<'a, ()>), )

Emit a lint at the appropriate level for a hir node.

pub fn in_scope_traits(self, id: HirId) -> Option<&'tcx [TraitCandidate]>

pub fn named_bound_var(self, id: HirId) -> Option<ResolvedArg>

pub fn is_late_bound(self, id: HirId) -> bool

pub fn late_bound_vars(self, id: HirId) -> &'tcx List<BoundVariableKind>

pub fn map_opaque_lifetime_to_parent_lifetime( self, opaque_lifetime_param_def_id: LocalDefId, ) -> Region<'tcx>

Given the def-id of an early-bound lifetime on an opaque corresponding to a duplicated captured lifetime, map it back to the early- or late-bound lifetime of the function from which it originally as captured. If it is a late-bound lifetime, this will represent the liberated (ReLateParam) lifetime of the signature.

pub fn is_stable_const_fn(self, def_id: DefId) -> bool

Whether def_id is a stable const fn (i.e., doesn’t need any feature gates to be called).

When this is false, the function may still be callable as a const fn due to features being enabled!

pub fn is_const_trait_impl(self, def_id: DefId) -> bool

Whether the trait impl is marked const. This does not consider stability or feature gates.

pub fn intrinsic( self, def_id: impl IntoQueryParam<DefId> + Copy, ) -> Option<IntrinsicDef>

pub fn next_trait_solver_globally(self) -> bool

pub fn next_trait_solver_in_coherence(self) -> bool

pub fn is_impl_trait_in_trait(self, def_id: DefId) -> bool

pub fn module_children_local(self, def_id: LocalDefId) -> &'tcx [ModChild]

Named module children from all kinds of items, including imports. In addition to regular items this list also includes struct and variant constructors, and items inside extern {} blocks because all of them introduce names into parent module.

Module here is understood in name resolution sense - it can be a mod item, or a crate root, or an enum, or a trait.

This is not a query, making it a query causes perf regressions (probably due to hashing spans in ModChildren).

pub fn resolver_for_lowering( self, ) -> &'tcx Steal<(ResolverAstLowering, Lrc<Crate>)>

pub fn impl_trait_ref( self, def_id: impl IntoQueryParam<DefId>, ) -> Option<EarlyBinder<'tcx, TraitRef<'tcx>>>

Given an impl_id, return the trait it implements. Return None if this is an inherent impl.

pub fn impl_polarity(self, def_id: impl IntoQueryParam<DefId>) -> ImplPolarity

pub fn needs_coroutine_by_move_body_def_id(self, def_id: DefId) -> bool

pub fn do_not_recommend_impl(self, def_id: DefId) -> bool

Whether this is a trait implementation that has #[diagnostic::do_not_recommend]

impl<'tcx> TyCtxt<'tcx>

pub fn erase_regions<T>(self, value: T) -> T

where T: TypeFoldable<TyCtxt<'tcx>>,

Returns an equivalent value with all free regions removed (note that late-bound regions remain, because they are important for subtyping, but they are anonymized and normalized as well)..

impl TyCtxt<'_>

pub fn is_intrinsic(self, def_id: DefId, name: Symbol) -> bool

impl<'tcx> TyCtxt<'tcx>

pub fn return_position_impl_trait_in_trait_shim_data( self, def_id: DefId, ) -> Option<(DefId, EarlyBinder<'tcx, GenericArgsRef<'tcx>>)>

Given a def_id of a trait or impl method, compute whether that method needs to have an RPITIT shim applied to it for it to be object safe. If so, return the def_id of the RPITIT, and also the args of trait method that returns the RPITIT.

NOTE that these args are not, in general, the same as than the RPITIT’s args. They are a subset of those args, since they do not include the late-bound lifetimes of the RPITIT. Depending on the context, these will need to be dealt with in different ways – in codegen, it’s okay to fill them with ReErased.

pub fn item_bounds_to_existential_predicates( self, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> &'tcx List<PolyExistentialPredicate<'tcx>>

Given a DefId of an RPITIT and its args, return the existential predicates that corresponds to the RPITIT’s bounds with the self type erased.

impl TyCtxt<'_>

pub fn opt_parent(self, id: DefId) -> Option<DefId>

pub fn parent(self, id: DefId) -> DefId

pub fn opt_local_parent(self, id: LocalDefId) -> Option<LocalDefId>

pub fn local_parent(self, id: impl Into<LocalDefId>) -> LocalDefId

pub fn is_descendant_of(self, descendant: DefId, ancestor: DefId) -> bool

impl<'tcx> TyCtxt<'tcx>

pub fn typeck_body(self, body: BodyId) -> &'tcx TypeckResults<'tcx>

pub fn provided_trait_methods( self, id: DefId, ) -> impl 'tcx + Iterator<Item = &'tcx AssocItem>

pub fn repr_options_of_def(self, did: LocalDefId) -> ReprOptions

pub fn opt_item_name(self, def_id: DefId) -> Option<Symbol>

Look up the name of a definition across crates. This does not look at HIR.

pub fn item_name(self, id: DefId) -> Symbol

Look up the name of a definition across crates. This does not look at HIR.

This method will ICE if the corresponding item does not have a name. In these cases, use opt_item_name instead.

pub fn opt_item_ident(self, def_id: DefId) -> Option<Ident>

Look up the name and span of a definition.

See item_name for more information.

pub fn opt_associated_item(self, def_id: DefId) -> Option<AssocItem>

pub fn opt_rpitit_info(self, def_id: DefId) -> Option<ImplTraitInTraitData>

If the def_id is an associated type that was desugared from a return-position impl Trait from a trait, then provide the source info about where that RPITIT came from.

pub fn find_field_index( self, ident: Ident, variant: &VariantDef, ) -> Option<FieldIdx>

pub fn impls_are_allowed_to_overlap( self, def_id1: DefId, def_id2: DefId, ) -> Option<ImplOverlapKind>

Returns true if the impls are the same polarity and the trait either has no items or is annotated #[marker] and prevents item overrides.

pub fn expect_variant_res(self, res: Res) -> &'tcx VariantDef

Returns ty::VariantDef if res refers to a struct, or variant or their constructors, panics otherwise.

pub fn instance_mir(self, instance: InstanceKind<'tcx>) -> &'tcx Body<'tcx>

Returns the possibly-auto-generated MIR of a ty::InstanceKind.

pub fn get_attrs_unchecked(self, did: DefId) -> &'tcx [Attribute]

pub fn get_attrs( self, did: impl Into<DefId>, attr: Symbol, ) -> impl Iterator<Item = &'tcx Attribute>

Gets all attributes with the given name.

pub fn get_diagnostic_attr( self, did: impl Into<DefId>, attr: Symbol, ) -> Option<&'tcx Attribute>

Get an attribute from the diagnostic attribute namespace

This function requests an attribute with the following structure:

#[diagnostic::$attr]

This function performs feature checking, so if an attribute is returned it can be used by the consumer

pub fn get_attrs_by_path<'attr>( self, did: DefId, attr: &'attr [Symbol], ) -> impl Iterator<Item = &'tcx Attribute> + 'attr

where 'tcx: 'attr,

pub fn get_attr( self, did: impl Into<DefId>, attr: Symbol, ) -> Option<&'tcx Attribute>

pub fn has_attr(self, did: impl Into<DefId>, attr: Symbol) -> bool

Determines whether an item is annotated with an attribute.

pub fn has_attrs_with_path( self, did: impl Into<DefId>, attrs: &[Symbol], ) -> bool

Determines whether an item is annotated with a multi-segment attribute

pub fn trait_is_auto(self, trait_def_id: DefId) -> bool

Returns true if this is an auto trait.

pub fn trait_is_coinductive(self, trait_def_id: DefId) -> bool

Returns true if this is coinductive, either because it is an auto trait or because it has the #[rustc_coinductive] attribute.

pub fn trait_is_alias(self, trait_def_id: DefId) -> bool

Returns true if this is a trait alias.

pub fn coroutine_layout( self, def_id: DefId, coroutine_kind_ty: Ty<'tcx>, ) -> Option<&'tcx CoroutineLayout<'tcx>>

Returns layout of a coroutine. Layout might be unavailable if the coroutine is tainted by errors.

Takes coroutine_kind which can be acquired from the CoroutineArgs::kind_ty, e.g. args.as_coroutine().kind_ty().

pub fn trait_id_of_impl(self, def_id: DefId) -> Option<DefId>

Given the DefId of an impl, returns the DefId of the trait it implements. If it implements no trait, returns None.

pub fn trait_of_item(self, def_id: DefId) -> Option<DefId>

If the given DefId describes an item belonging to a trait, returns the DefId of the trait that the trait item belongs to; otherwise, returns None.

pub fn impl_of_method(self, def_id: DefId) -> Option<DefId>

If the given DefId describes a method belonging to an impl, returns the DefId of the impl that the method belongs to; otherwise, returns None.

pub fn is_builtin_derived(self, def_id: DefId) -> bool

Check if the given DefId is #\[automatically_derived\], and whether it was produced by expanding a builtin derive macro.

pub fn is_automatically_derived(self, def_id: DefId) -> bool

Check if the given DefId is #\[automatically_derived\].

pub fn span_of_impl(self, impl_def_id: DefId) -> Result<Span, Symbol>

Looks up the span of impl_did if the impl is local; otherwise returns Err with the name of the crate containing the impl.

pub fn hygienic_eq( self, use_name: Ident, def_name: Ident, def_parent_def_id: DefId, ) -> bool

Hygienically compares a use-site name (use_name) for a field or an associated item with its supposed definition name (def_name). The method also needs DefId of the supposed definition’s parent/scope to perform comparison.

pub fn adjust_ident(self, ident: Ident, scope: DefId) -> Ident

pub fn adjust_ident_and_get_scope( self, ident: Ident, scope: DefId, block: HirId, ) -> (Ident, DefId)

pub fn is_const_fn(self, def_id: DefId) -> bool

Checks whether this is a const fn. Returns false for non-functions.

Even if this returns true, constness may still be unstable!

pub fn is_conditionally_const(self, def_id: impl Into<DefId>) -> bool

Whether this item is conditionally constant for the purposes of the effects implementation.

This roughly corresponds to all const functions and other callable items, along with const impls and traits, and associated types within those impls and traits.

pub fn is_const_trait(self, def_id: DefId) -> bool

pub fn is_const_default_method(self, def_id: DefId) -> bool

pub fn impl_method_has_trait_impl_trait_tys(self, def_id: DefId) -> bool

impl<'tcx> TyCtxt<'tcx>

pub fn ensure(self) -> TyCtxtEnsure<'tcx>

Returns a transparent wrapper for TyCtxt, which ensures queries are executed instead of just returning their results.

pub fn ensure_with_value(self) -> TyCtxtEnsureWithValue<'tcx>

Returns a transparent wrapper for TyCtxt, which ensures queries are executed instead of just returning their results.

This version verifies that the computed result exists in the cache before returning.

pub fn at(self, span: Span) -> TyCtxtAt<'tcx>

Returns a transparent wrapper for TyCtxt which uses span as the location of queries performed through it.

pub fn try_mark_green(self, dep_node: &DepNode) -> bool

impl<'tcx> TyCtxt<'tcx>

pub fn trigger_delayed_bug(self, key: impl IntoQueryParam<DefId>)

This exists purely for testing the interactions between delayed bugs and incremental.

pub fn registered_tools(self, key: ()) -> &'tcx RegisteredTools

Collects the list of all tools registered using #![register_tool].

pub fn early_lint_checks(self, key: ())

[query description - consider adding a doc-comment!] perform lints prior to macro expansion

pub fn resolutions(self, key: ()) -> &'tcx ResolverGlobalCtxt

[query description - consider adding a doc-comment!] getting the resolver outputs

pub fn resolver_for_lowering_raw( self, key: (), ) -> (&'tcx Steal<(ResolverAstLowering, Lrc<Crate>)>, &'tcx ResolverGlobalCtxt)

[query description - consider adding a doc-comment!] getting the resolver for lowering

pub fn source_span(self, key: impl IntoQueryParam<LocalDefId>) -> Span

Return the span for a definition. Contrary to def_span below, this query returns the full absolute span of the definition. This span is meant for dep-tracking rather than diagnostics. It should not be used outside of rustc_middle::hir::source_map.

pub fn hir_crate(self, key: ()) -> &'tcx Crate<'tcx>

Represents crate as a whole (as distinct from the top-level crate module). If you call hir_crate (e.g., indirectly by calling tcx.hir().krate()), we will have to assume that any change means that you need to be recompiled. This is because the hir_crate query gives you access to all other items. To avoid this fate, do not call tcx.hir().krate(); instead, prefer wrappers like tcx.visit_all_items_in_krate().

pub fn hir_crate_items(self, key: ()) -> &'tcx ModuleItems

All items in the crate.

pub fn hir_module_items(self, key: LocalModDefId) -> &'tcx ModuleItems

The items in a module.

This can be conveniently accessed by tcx.hir().visit_item_likes_in_module. Avoid calling this query directly.

pub fn local_def_id_to_hir_id( self, key: impl IntoQueryParam<LocalDefId>, ) -> HirId

Returns HIR ID for the given LocalDefId.

pub fn hir_owner_parent(self, key: OwnerId) -> HirId

Gives access to the HIR node’s parent for the HIR owner key.

This can be conveniently accessed by methods on tcx.hir(). Avoid calling this query directly.

pub fn opt_hir_owner_nodes( self, key: impl IntoQueryParam<LocalDefId>, ) -> Option<&'tcx OwnerNodes<'tcx>>

Gives access to the HIR nodes and bodies inside key if it’s a HIR owner.

This can be conveniently accessed by methods on tcx.hir(). Avoid calling this query directly.

pub fn hir_attrs(self, key: OwnerId) -> &'tcx AttributeMap<'tcx>

Gives access to the HIR attributes inside the HIR owner key.

This can be conveniently accessed by methods on tcx.hir(). Avoid calling this query directly.

pub fn const_param_default( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Const<'tcx>>

Given the def_id of a const-generic parameter, computes the associated default const parameter. e.g. fn example<const N: usize=3> called on N would return 3.

pub fn type_of( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Ty<'tcx>>

Returns the Ty of the given DefId. If the DefId points to an alias, it will “skip” this alias to return the aliased type.

pub fn type_of_opaque( self, key: impl IntoQueryParam<DefId>, ) -> Result<EarlyBinder<'tcx, Ty<'tcx>>, CyclePlaceholder>

Specialized instance of type_of that detects cycles that are due to revealing opaque because of an auto trait bound. Unless CyclePlaceholder needs to be handled separately, call type_of instead.

pub fn type_alias_is_lazy(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] computing whether {path} is a lazy type alias

pub fn collect_return_position_impl_trait_in_trait_tys( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx DefIdMap<EarlyBinder<'tcx, Ty<'tcx>>>, ErrorGuaranteed>

[query description - consider adding a doc-comment!] comparing an impl and trait method signature, inferring any hidden impl Trait types in the process

pub fn opaque_ty_origin( self, key: impl IntoQueryParam<DefId>, ) -> OpaqueTyOrigin<DefId>

[query description - consider adding a doc-comment!] determine where the opaque originates from

pub fn unsizing_params_for_adt( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx BitSet<u32>

[query description - consider adding a doc-comment!] determining what parameters of tcx.def_path_str(key) can participate in unsizing

pub fn analysis(self, key: ())

The root query triggering all analysis passes like typeck or borrowck.

pub fn check_expectations(self, key: Option<Symbol>)

This query checks the fulfillment of collected lint expectations. All lint emitting queries have to be done before this is executed to ensure that all expectations can be fulfilled.

This is an extra query to enable other drivers (like rustdoc) to only execute a small subset of the analysis query, while allowing lints to be expected. In rustc, this query will be executed as part of the analysis query and doesn’t have to be called a second time.

Tools can additionally pass in a tool filter. That will restrict the expectations to only trigger for lints starting with the listed tool name. This is useful for cases were not all linting code from rustc was called. With the default None all registered lints will also be checked for expectation fulfillment.

pub fn generics_of(self, key: impl IntoQueryParam<DefId>) -> &'tcx Generics

Maps from the DefId of an item (trait/struct/enum/fn) to its associated generics.

pub fn predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> GenericPredicates<'tcx>

Maps from the DefId of an item (trait/struct/enum/fn) to the predicates (where-clauses) that must be proven true in order to reference it. This is almost always the “predicates query” that you want.

pub fn opaque_types_defined_by( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx List<LocalDefId>

[query description - consider adding a doc-comment!] computing the opaque types defined by tcx.def_path_str(key.to_def_id())

pub fn explicit_item_bounds( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

Returns the list of bounds that are required to be satisfied by a implementation or definition. For associated types, these must be satisfied for an implementation to be well-formed, and for opaque types, these are required to be satisfied by the hidden-type of the opaque.

Syntactially, these are the bounds written on the trait’s type definition, or those after the impl keyword for an opaque:

type X: Bound + 'lt
//      ^^^^^^^^^^^
impl Debug + Display
//   ^^^^^^^^^^^^^^^

key is the DefId of the associated type or opaque type.

Bounds from the parent (e.g. with nested impl trait) are not included.

pub fn explicit_item_super_predicates( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

The set of item bounds (see TyCtxt::explicit_item_bounds) that share the Self type of the item. These are a subset of the bounds that may explicitly be used for things like closure signature deduction.

pub fn item_bounds( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

Elaborated version of the predicates from explicit_item_bounds.

For example:

trait MyTrait {
    type MyAType: Eq + ?Sized;
}

explicit_item_bounds returns [<Self as MyTrait>::MyAType: Eq], and item_bounds returns

[
    <Self as Trait>::MyAType: Eq,
    <Self as Trait>::MyAType: PartialEq<<Self as Trait>::MyAType>
]

Bounds from the parent (e.g. with nested impl trait) are not included.

pub fn item_super_predicates( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

[query description - consider adding a doc-comment!] elaborating item assumptions for tcx.def_path_str(key)

pub fn item_non_self_assumptions( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

[query description - consider adding a doc-comment!] elaborating item assumptions for tcx.def_path_str(key)

pub fn impl_super_outlives( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, Clauses<'tcx>>

[query description - consider adding a doc-comment!] elaborating supertrait outlives for trait of tcx.def_path_str(key)

pub fn native_libraries(self, key: CrateNum) -> &'tcx Vec<NativeLib>

Look up all native libraries this crate depends on. These are assembled from the following places:

• extern blocks (depending on their link attributes)
• the libs (-l) option

pub fn shallow_lint_levels_on(self, key: OwnerId) -> &'tcx ShallowLintLevelMap

[query description - consider adding a doc-comment!] looking up lint levels for tcx.def_path_str(key)

pub fn lint_expectations( self, key: (), ) -> &'tcx Vec<(LintExpectationId, LintExpectation)>

[query description - consider adding a doc-comment!] computing #[expect]ed lints in this crate

pub fn lints_that_dont_need_to_run(self, key: ()) -> &'tcx FxIndexSet<LintId>

[query description - consider adding a doc-comment!] Computing all lints that are explicitly enabled or with a default level greater than Allow

pub fn expn_that_defined(self, key: impl IntoQueryParam<DefId>) -> ExpnId

[query description - consider adding a doc-comment!] getting the expansion that defined tcx.def_path_str(key)

pub fn is_panic_runtime(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate is_panic_runtime

pub fn representability( self, key: impl IntoQueryParam<LocalDefId>, ) -> Representability

Checks whether a type is representable or infinitely sized

pub fn representability_adt_ty(self, key: Ty<'tcx>) -> Representability

An implementation detail for the representability query

pub fn params_in_repr( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx BitSet<u32>

Set of param indexes for type params that are in the type’s representation

pub fn thir_body( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(&'tcx Steal<Thir<'tcx>>, ExprId), ErrorGuaranteed>

Fetch the THIR for a given body.

pub fn mir_keys(self, key: ()) -> &'tcx FxIndexSet<LocalDefId>

Set of all the DefIds in this crate that have MIR associated with them. This includes all the body owners, but also things like struct constructors.

pub fn mir_const_qualif(self, key: impl IntoQueryParam<DefId>) -> ConstQualifs

Maps DefId’s that have an associated mir::Body to the result of the MIR const-checking pass. This is the set of qualifs in the final value of a const.

pub fn mir_built( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx Steal<Body<'tcx>>

Build the MIR for a given DefId and prepare it for const qualification.

See the rustc dev guide for more info.

pub fn thir_abstract_const( self, key: impl IntoQueryParam<DefId>, ) -> Result<Option<EarlyBinder<'tcx, Const<'tcx>>>, ErrorGuaranteed>

Try to build an abstract representation of the given constant.

pub fn mir_drops_elaborated_and_const_checked( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx Steal<Body<'tcx>>

[query description - consider adding a doc-comment!] elaborating drops for tcx.def_path_str(key)

pub fn mir_for_ctfe(self, key: impl IntoQueryParam<DefId>) -> &'tcx Body<'tcx>

[query description - consider adding a doc-comment!] caching mir of tcx.def_path_str(key) for CTFE

pub fn mir_promoted( self, key: impl IntoQueryParam<LocalDefId>, ) -> (&'tcx Steal<Body<'tcx>>, &'tcx Steal<IndexVec<Promoted, Body<'tcx>>>)

[query description - consider adding a doc-comment!] promoting constants in MIR for tcx.def_path_str(key)

pub fn closure_typeinfo( self, key: impl IntoQueryParam<LocalDefId>, ) -> ClosureTypeInfo<'tcx>

[query description - consider adding a doc-comment!] finding symbols for captures of closure tcx.def_path_str(key)

pub fn closure_saved_names_of_captured_variables( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx IndexVec<FieldIdx, Symbol>

Returns names of captured upvars for closures and coroutines.

Here are some examples:

• name__field1__field2 when the upvar is captured by value.
• _ref__name__field when the upvar is captured by reference.

For coroutines this only contains upvars that are shared by all states.

pub fn mir_coroutine_witnesses( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx Option<CoroutineLayout<'tcx>>

[query description - consider adding a doc-comment!] coroutine witness types for tcx.def_path_str(key)

pub fn check_coroutine_obligations( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] verify auto trait bounds for coroutine interior type tcx.def_path_str(key)

pub fn optimized_mir(self, key: impl IntoQueryParam<DefId>) -> &'tcx Body<'tcx>

MIR after our optimization passes have run. This is MIR that is ready for codegen. This is also the only query that can fetch non-local MIR, at present.

pub fn coverage_attr_on(self, key: impl IntoQueryParam<LocalDefId>) -> bool

Checks for the nearest #[coverage(off)] or #[coverage(on)] on this def and any enclosing defs, up to the crate root.

Returns false if #[coverage(off)] was found, or true if either #[coverage(on)] or no coverage attribute was found.

pub fn coverage_ids_info(self, key: InstanceKind<'tcx>) -> &'tcx CoverageIdsInfo

Summarizes coverage IDs inserted by the InstrumentCoverage MIR pass (for compiler option -Cinstrument-coverage), after MIR optimizations have had a chance to potentially remove some of them.

pub fn promoted_mir( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx IndexVec<Promoted, Body<'tcx>>

The DefId is the DefId of the containing MIR body. Promoteds do not have their own DefId. This function returns all promoteds in the specified body. The body references promoteds by the DefId and the mir::Promoted index. This is necessary, because after inlining a body may refer to promoteds from other bodies. In that case you still need to use the DefId of the original body.

pub fn erase_regions_ty(self, key: Ty<'tcx>) -> Ty<'tcx>

Erases regions from ty to yield a new type. Normally you would just use tcx.erase_regions(value), however, which uses this query as a kind of cache.

pub fn wasm_import_module_map(self, key: CrateNum) -> &'tcx DefIdMap<String>

[query description - consider adding a doc-comment!] getting wasm import module map

pub fn trait_explicit_predicates_and_bounds( self, key: impl IntoQueryParam<LocalDefId>, ) -> GenericPredicates<'tcx>

Returns everything that looks like a predicate written explicitly by the user on a trait item.

Traits are unusual, because predicates on associated types are converted into bounds on that type for backwards compatibility:

trait X where Self::U: Copy { type U; }

becomes

trait X { type U: Copy; }

explicit_predicates_of and explicit_item_bounds will then take the appropriate subsets of the predicates here.

pub fn explicit_predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> GenericPredicates<'tcx>

Returns the predicates written explicitly by the user.

You should probably use predicates_of unless you’re looking for predicates with explicit spans for diagnostics purposes.

pub fn inferred_outlives_of( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [(Clause<'tcx>, Span)]

Returns the inferred outlives predicates (e.g., for struct Foo<'a, T> { x: &'a T }, this would return T: 'a).

pub fn explicit_super_predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

Maps from the DefId of a trait to the list of super-predicates of the trait, before elaboration (so it doesn’t contain transitive super-predicates). This is a subset of the full list of predicates. We store these in a separate map because we must evaluate them even during type conversion, often before the full predicates are available (note that super-predicates must not be cyclic).

pub fn explicit_implied_predicates_of( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

The predicates of the trait that are implied during elaboration. This is a superset of the super-predicates of the trait, but a subset of the predicates of the trait. For regular traits, this includes all super-predicates and their associated type bounds. For trait aliases, currently, this includes all of the predicates of the trait alias.

pub fn explicit_supertraits_containing_assoc_item( self, key: (DefId, Ident), ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

The Ident is the name of an associated type.The query returns only the subset of supertraits that define the given associated type. This is used to avoid cycles in resolving type-dependent associated item paths like T::Item.

pub fn const_conditions( self, key: impl IntoQueryParam<DefId>, ) -> ConstConditions<'tcx>

[query description - consider adding a doc-comment!] computing the conditions for tcx.def_path_str(key) to be considered const

pub fn explicit_implied_const_bounds( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, &'tcx [(PolyTraitRef<'tcx>, Span)]>

[query description - consider adding a doc-comment!] computing the implied ~const bounds for tcx.def_path_str(key)

pub fn type_param_predicates( self, key: (LocalDefId, LocalDefId, Ident), ) -> EarlyBinder<'tcx, &'tcx [(Clause<'tcx>, Span)]>

To avoid cycles within the predicates of a single item we compute per-type-parameter predicates for resolving T::AssocTy.

pub fn trait_def(self, key: impl IntoQueryParam<DefId>) -> &'tcx TraitDef

[query description - consider adding a doc-comment!] computing trait definition for tcx.def_path_str(key)

pub fn adt_def(self, key: impl IntoQueryParam<DefId>) -> AdtDef<'tcx>

[query description - consider adding a doc-comment!] computing ADT definition for tcx.def_path_str(key)

pub fn adt_destructor( self, key: impl IntoQueryParam<DefId>, ) -> Option<Destructor>

[query description - consider adding a doc-comment!] computing Drop impl for tcx.def_path_str(key)

pub fn adt_async_destructor( self, key: impl IntoQueryParam<DefId>, ) -> Option<AsyncDestructor>

[query description - consider adding a doc-comment!] computing AsyncDrop impl for tcx.def_path_str(key)

pub fn adt_sized_constraint( self, key: impl IntoQueryParam<DefId>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

[query description - consider adding a doc-comment!] computing the Sized constraint for tcx.def_path_str(key)

pub fn adt_dtorck_constraint( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx DropckConstraint<'tcx>, NoSolution>

[query description - consider adding a doc-comment!] computing drop-check constraints for tcx.def_path_str(key)

pub fn constness(self, key: impl IntoQueryParam<DefId>) -> Constness

Returns the constness of function-like things (tuple struct/variant constructors, functions, methods)

Will ICE if used on things that are always const or never const.

Do not call this function manually. It is only meant to cache the base data for the higher-level functions. Consider using is_const_fn or is_const_trait_impl instead. Also note that neither of them takes into account feature gates and stability.

pub fn asyncness(self, key: impl IntoQueryParam<DefId>) -> Asyncness

[query description - consider adding a doc-comment!] checking if the function is async: tcx.def_path_str(key)

pub fn is_promotable_const_fn(self, key: impl IntoQueryParam<DefId>) -> bool

Returns true if calls to the function may be promoted.

This is either because the function is e.g., a tuple-struct or tuple-variant constructor, or because it has the #[rustc_promotable] attribute. The attribute should be removed in the future in favour of some form of check which figures out whether the function does not inspect the bits of any of its arguments (so is essentially just a constructor function).

pub fn coroutine_by_move_body_def_id( self, key: impl IntoQueryParam<DefId>, ) -> DefId

The body of the coroutine, modified to take its upvars by move rather than by ref.

This is used by coroutine-closures, which must return a different flavor of coroutine when called using AsyncFnOnce::call_once. It is produced by the ByMoveBody pass which is run right after building the initial MIR, and will only be populated for coroutines which come out of the async closure desugaring.

pub fn coroutine_kind( self, key: impl IntoQueryParam<DefId>, ) -> Option<CoroutineKind>

Returns Some(coroutine_kind) if the node pointed to by def_id is a coroutine.

pub fn coroutine_for_closure(self, key: impl IntoQueryParam<DefId>) -> DefId

[query description - consider adding a doc-comment!] Given a coroutine-closure def id, return the def id of the coroutine returned by it

pub fn crate_variances(self, key: ()) -> &'tcx CrateVariancesMap<'tcx>

Gets a map with the variance of every item; use variances_of instead.

pub fn variances_of(self, key: impl IntoQueryParam<DefId>) -> &'tcx [Variance]

Maps from the DefId of a type or region parameter to its (inferred) variance.

pub fn inferred_outlives_crate(self, key: ()) -> &'tcx CratePredicatesMap<'tcx>

Maps from thee DefId of a type to its (inferred) outlives.

pub fn associated_item_def_ids( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DefId]

Maps from an impl/trait or struct/variant DefId to a list of the DefIds of its associated items or fields.

pub fn associated_item(self, key: impl IntoQueryParam<DefId>) -> AssocItem

Maps from a trait/impl item to the trait/impl item “descriptor”.

pub fn associated_items( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx AssocItems

Collects the associated items defined on a trait or impl.

pub fn impl_item_implementor_ids( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx DefIdMap<DefId>

Maps from associated items on a trait to the corresponding associated item on the impl specified by impl_id.

For example, with the following code

struct Type {}
                        // DefId
trait Trait {           // trait_id
    fn f();             // trait_f
    fn g() {}           // trait_g
}

impl Trait for Type {   // impl_id
    fn f() {}           // impl_f
    fn g() {}           // impl_g
}

The map returned for tcx.impl_item_implementor_ids(impl_id) would be { trait_f: impl_f, trait_g: impl_g }

pub fn associated_types_for_impl_traits_in_associated_fn( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DefId]

Given fn_def_id of a trait or of an impl that implements a given trait: if fn_def_id is the def id of a function defined inside a trait, then it creates and returns the associated items that correspond to each impl trait in return position for that trait. if fn_def_id is the def id of a function defined inside an impl that implements a trait, then it creates and returns the associated items that correspond to each impl trait in return position of the implemented trait.

pub fn associated_type_for_impl_trait_in_trait( self, key: impl IntoQueryParam<LocalDefId>, ) -> LocalDefId

Given an impl trait in trait opaque_ty_def_id, create and return the corresponding associated item.

pub fn impl_trait_header( self, key: impl IntoQueryParam<DefId>, ) -> Option<ImplTraitHeader<'tcx>>

Given an impl_id, return the trait it implements along with some header information. Return None if this is an inherent impl.

pub fn self_ty_of_trait_impl_enabling_order_dep_trait_object_hack( self, key: impl IntoQueryParam<DefId>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

[query description - consider adding a doc-comment!] computing self type wrt issue #33140 tcx.def_path_str(key)

pub fn inherent_impls(self, key: impl IntoQueryParam<DefId>) -> &'tcx [DefId]

Maps a DefId of a type to a list of its inherent impls. Contains implementations of methods that are inherent to a type. Methods in these implementations don’t need to be exported.

pub fn incoherent_impls(self, key: SimplifiedType) -> &'tcx [DefId]

[query description - consider adding a doc-comment!] collecting all inherent impls for {:?}

pub fn check_unsafety(self, key: impl IntoQueryParam<LocalDefId>)

Unsafety-check this LocalDefId.

pub fn check_tail_calls( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

Checks well-formedness of tail calls (become f()).

pub fn assumed_wf_types( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx [(Ty<'tcx>, Span)]

Returns the types assumed to be well formed while “inside” of the given item.

Note that we’ve liberated the late bound regions of function signatures, so this can not be used to check whether these types are well formed.

pub fn assumed_wf_types_for_rpitit( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [(Ty<'tcx>, Span)]

We need to store the assumed_wf_types for an RPITIT so that impls of foreign traits with return-position impl trait in traits can inherit the right wf types.

pub fn fn_sig( self, key: impl IntoQueryParam<DefId>, ) -> EarlyBinder<'tcx, PolyFnSig<'tcx>>

Computes the signature of the function.

pub fn lint_mod(self, key: LocalModDefId)

Performs lint checking for the module.

pub fn check_unused_traits(self, key: ())

[query description - consider adding a doc-comment!] checking unused trait imports in crate

pub fn check_mod_attrs(self, key: LocalModDefId)

Checks the attributes in the module.

pub fn check_mod_unstable_api_usage(self, key: LocalModDefId)

Checks for uses of unstable APIs in the module.

pub fn check_mod_loops(self, key: LocalModDefId)

Checks the loops in the module.

pub fn check_mod_naked_functions(self, key: LocalModDefId)

[query description - consider adding a doc-comment!] checking naked functions in describe_as_module(key, tcx)

pub fn check_mod_privacy(self, key: LocalModDefId)

[query description - consider adding a doc-comment!] checking privacy in describe_as_module(key.to_local_def_id(), tcx)

pub fn check_liveness(self, key: impl IntoQueryParam<LocalDefId>)

[query description - consider adding a doc-comment!] checking liveness of variables in tcx.def_path_str(key)

pub fn live_symbols_and_ignored_derived_traits( self, key: (), ) -> &'tcx (LocalDefIdSet, LocalDefIdMap<Vec<(DefId, DefId)>>)

Return the live symbols in the crate for dead code check.

The second return value maps from ADTs to ignored derived traits (e.g. Debug and Clone) and their respective impl (i.e., part of the derive macro)

pub fn check_mod_deathness(self, key: LocalModDefId)

[query description - consider adding a doc-comment!] checking deathness of variables in describe_as_module(key, tcx)

pub fn check_mod_type_wf( self, key: LocalModDefId, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] checking that types are well-formed in describe_as_module(key, tcx)

pub fn coerce_unsized_info( self, key: impl IntoQueryParam<DefId>, ) -> Result<CoerceUnsizedInfo, ErrorGuaranteed>

Caches CoerceUnsized kinds for impls on custom types.

pub fn typeck( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx TypeckResults<'tcx>

[query description - consider adding a doc-comment!] type-checking tcx.def_path_str(key)

pub fn diagnostic_only_typeck( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx TypeckResults<'tcx>

[query description - consider adding a doc-comment!] type-checking tcx.def_path_str(key)

pub fn used_trait_imports( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx UnordSet<LocalDefId>

[query description - consider adding a doc-comment!] finding used_trait_imports tcx.def_path_str(key)

pub fn coherent_trait( self, key: impl IntoQueryParam<DefId>, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] coherence checking all impls of trait tcx.def_path_str(def_id)

pub fn mir_borrowck( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx BorrowCheckResult<'tcx>

Borrow-checks the function body. If this is a closure, returns additional requirements that the closure’s creator must verify.

pub fn crate_inherent_impls( self, key: (), ) -> (&'tcx CrateInherentImpls, Result<(), ErrorGuaranteed>)

Gets a complete map from all types to their inherent impls. Not meant to be used directly outside of coherence.

pub fn crate_inherent_impls_validity_check( self, key: (), ) -> Result<(), ErrorGuaranteed>

Checks all types in the crate for overlap in their inherent impls. Reports errors. Not meant to be used directly outside of coherence.

pub fn crate_inherent_impls_overlap_check( self, key: (), ) -> Result<(), ErrorGuaranteed>

Checks all types in the crate for overlap in their inherent impls. Reports errors. Not meant to be used directly outside of coherence.

pub fn orphan_check_impl( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

Checks whether all impls in the crate pass the overlap check, returning which impls fail it. If all impls are correct, the returned slice is empty.

pub fn mir_callgraph_reachable(self, key: (Instance<'tcx>, LocalDefId)) -> bool

Check whether the function has any recursion that could cause the inliner to trigger a cycle. Returns the call stack causing the cycle. The call stack does not contain the current function, just all intermediate functions.

pub fn mir_inliner_callees( self, key: InstanceKind<'tcx>, ) -> &'tcx [(DefId, GenericArgsRef<'tcx>)]

Obtain all the calls into other local functions

pub fn tag_for_variant(self, key: (Ty<'tcx>, VariantIdx)) -> Option<ScalarInt>

Computes the tag (if any) for a given type and variant. None means that the variant doesn’t need a tag (because it is niched). Will panic for uninhabited variants.

pub fn eval_to_allocation_raw( self, key: PseudoCanonicalInput<'tcx, GlobalId<'tcx>>, ) -> EvalToAllocationRawResult<'tcx>

Evaluates a constant and returns the computed allocation.

Do not use this directly, use the eval_to_const_value or eval_to_valtree instead.

pub fn eval_static_initializer( self, key: impl IntoQueryParam<DefId>, ) -> EvalStaticInitializerRawResult<'tcx>

Evaluate a static’s initializer, returning the allocation of the initializer’s memory.

pub fn eval_to_const_value_raw( self, key: PseudoCanonicalInput<'tcx, GlobalId<'tcx>>, ) -> EvalToConstValueResult<'tcx>

Evaluates const items or anonymous constants (such as enum variant explicit discriminants or array lengths) into a representation suitable for the type system and const generics.

Do not use this directly, use one of the following wrappers: tcx.const_eval_poly, tcx.const_eval_resolve, tcx.const_eval_instance, or tcx.const_eval_global_id.

pub fn eval_to_valtree( self, key: PseudoCanonicalInput<'tcx, GlobalId<'tcx>>, ) -> EvalToValTreeResult<'tcx>

Evaluate a constant and convert it to a type level constant or return None if that is not possible.

pub fn valtree_to_const_val( self, key: (Ty<'tcx>, ValTree<'tcx>), ) -> ConstValue<'tcx>

Converts a type level constant value into ConstValue

pub fn destructure_const(self, key: Const<'tcx>) -> DestructuredConst<'tcx>

Destructures array, ADT or tuple constants into the constants of their fields.

pub fn lit_to_const( self, key: LitToConstInput<'tcx>, ) -> Result<Const<'tcx>, LitToConstError>

[query description - consider adding a doc-comment!] converting literal to const

pub fn check_match( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] match-checking tcx.def_path_str(key)

pub fn effective_visibilities(self, key: ()) -> &'tcx EffectiveVisibilities

Performs part of the privacy check and computes effective visibilities.

pub fn check_private_in_public(self, key: ())

[query description - consider adding a doc-comment!] checking for private elements in public interfaces

pub fn reachable_set(self, key: ()) -> &'tcx LocalDefIdSet

[query description - consider adding a doc-comment!] reachability

pub fn region_scope_tree( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx ScopeTree

Per-body region::ScopeTree. The DefId should be the owner DefId for the body; in the case of closures, this will be redirected to the enclosing function.

pub fn mir_shims(self, key: InstanceKind<'tcx>) -> &'tcx Body<'tcx>

Generates a MIR body for the shim.

pub fn symbol_name(self, key: Instance<'tcx>) -> SymbolName<'tcx>

The symbol_name query provides the symbol name for calling a given instance from the local crate. In particular, it will also look up the correct symbol name of instances from upstream crates.

pub fn def_kind(self, key: impl IntoQueryParam<DefId>) -> DefKind

[query description - consider adding a doc-comment!] looking up definition kind of tcx.def_path_str(def_id)

pub fn def_span(self, key: impl IntoQueryParam<DefId>) -> Span

Gets the span for the definition.

pub fn def_ident_span(self, key: impl IntoQueryParam<DefId>) -> Option<Span>

Gets the span for the identifier of the definition.

pub fn lookup_stability( self, key: impl IntoQueryParam<DefId>, ) -> Option<Stability>

[query description - consider adding a doc-comment!] looking up stability of tcx.def_path_str(def_id)

pub fn lookup_const_stability( self, key: impl IntoQueryParam<DefId>, ) -> Option<ConstStability>

[query description - consider adding a doc-comment!] looking up const stability of tcx.def_path_str(def_id)

pub fn lookup_default_body_stability( self, key: impl IntoQueryParam<DefId>, ) -> Option<DefaultBodyStability>

[query description - consider adding a doc-comment!] looking up default body stability of tcx.def_path_str(def_id)

pub fn should_inherit_track_caller( self, key: impl IntoQueryParam<DefId>, ) -> bool

[query description - consider adding a doc-comment!] computing should_inherit_track_caller of tcx.def_path_str(def_id)

pub fn lookup_deprecation_entry( self, key: impl IntoQueryParam<DefId>, ) -> Option<DeprecationEntry>

[query description - consider adding a doc-comment!] checking whether tcx.def_path_str(def_id) is deprecated

pub fn is_doc_hidden(self, key: impl IntoQueryParam<DefId>) -> bool

Determines whether an item is annotated with doc(hidden).

pub fn is_doc_notable_trait(self, key: impl IntoQueryParam<DefId>) -> bool

Determines whether an item is annotated with doc(notable_trait).

pub fn attrs_for_def(self, key: impl IntoQueryParam<DefId>) -> &'tcx [Attribute]

Returns the attributes on the item at def_id.

Do not use this directly, use tcx.get_attrs instead.

pub fn codegen_fn_attrs( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx CodegenFnAttrs

[query description - consider adding a doc-comment!] computing codegen attributes of tcx.def_path_str(def_id)

pub fn asm_target_features( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx FxIndexSet<Symbol>

[query description - consider adding a doc-comment!] computing target features for inline asm of tcx.def_path_str(def_id)

pub fn fn_arg_names(self, key: impl IntoQueryParam<DefId>) -> &'tcx [Ident]

[query description - consider adding a doc-comment!] looking up function parameter names for tcx.def_path_str(def_id)

pub fn rendered_const(self, key: impl IntoQueryParam<DefId>) -> &'tcx String

Gets the rendered value of the specified constant or associated constant. Used by rustdoc.

pub fn rendered_precise_capturing_args( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx [Symbol]>

Gets the rendered precise capturing args for an opaque for use in rustdoc.

pub fn impl_parent(self, key: impl IntoQueryParam<DefId>) -> Option<DefId>

[query description - consider adding a doc-comment!] computing specialization parent impl of tcx.def_path_str(def_id)

pub fn is_ctfe_mir_available(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] checking if item has CTFE MIR available: tcx.def_path_str(key)

pub fn is_mir_available(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] checking if item has MIR available: tcx.def_path_str(key)

pub fn own_existential_vtable_entries( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DefId]

[query description - consider adding a doc-comment!] finding all existential vtable entries for trait tcx.def_path_str(key)

pub fn vtable_entries(self, key: PolyTraitRef<'tcx>) -> &'tcx [VtblEntry<'tcx>]

[query description - consider adding a doc-comment!] finding all vtable entries for trait tcx.def_path_str(key.def_id())

pub fn first_method_vtable_slot(self, key: TraitRef<'tcx>) -> usize

[query description - consider adding a doc-comment!] finding the slot within the vtable of key.self_ty() for the implementation of key.print_only_trait_name()

pub fn supertrait_vtable_slot(self, key: (Ty<'tcx>, Ty<'tcx>)) -> Option<usize>

[query description - consider adding a doc-comment!] finding the slot within vtable for trait object key.1 vtable ptr during trait upcasting coercion from key.0 vtable

pub fn vtable_allocation( self, key: (Ty<'tcx>, Option<PolyExistentialTraitRef<'tcx>>), ) -> AllocId

[query description - consider adding a doc-comment!] vtable const allocation for < key.0 as key.1.map(| trait_ref | format! ("{trait_ref}")).unwrap_or("_".to_owned()) >

pub fn codegen_select_candidate( self, key: PseudoCanonicalInput<'tcx, TraitRef<'tcx>>, ) -> Result<&'tcx ImplSource<'tcx, ()>, CodegenObligationError>

[query description - consider adding a doc-comment!] computing candidate for key.value

pub fn all_local_trait_impls( self, key: (), ) -> &'tcx FxIndexMap<DefId, Vec<LocalDefId>>

Return all impl blocks in the current crate.

pub fn trait_impls_of(self, key: impl IntoQueryParam<DefId>) -> &'tcx TraitImpls

Given a trait trait_id, return all known impl blocks.

pub fn specialization_graph_of( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx Graph, ErrorGuaranteed>

[query description - consider adding a doc-comment!] building specialization graph of trait tcx.def_path_str(trait_id)

pub fn dyn_compatibility_violations( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DynCompatibilityViolation]

[query description - consider adding a doc-comment!] determining dyn-compatibility of trait tcx.def_path_str(trait_id)

pub fn is_dyn_compatible(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] checking if trait tcx.def_path_str(trait_id) is dyn-compatible

pub fn param_env(self, key: impl IntoQueryParam<DefId>) -> ParamEnv<'tcx>

Gets the ParameterEnvironment for a given item; this environment will be in “user-facing” mode, meaning that it is suitable for type-checking etc, and it does not normalize specializable associated types.

You should almost certainly not use this. If you already have an InferCtxt, then you should also probably have a ParamEnv from when it was built. If you don’t, then you should take a TypingEnv to ensure that you handle opaque types correctly.

pub fn param_env_normalized_for_post_analysis( self, key: impl IntoQueryParam<DefId>, ) -> ParamEnv<'tcx>

Like param_env, but returns the ParamEnv after all opaque types have been replaced with their hidden type. This is used in the old trait solver when in PostAnalysis mode and should not be called directly.

pub fn is_copy_raw(self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>) -> bool

Trait selection queries. These are best used by invoking ty.is_copy_modulo_regions(), ty.is_copy(), etc, since that will prune the environment where possible.

pub fn is_sized_raw(self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::is_sized.

pub fn is_freeze_raw(self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::is_freeze.

pub fn is_unpin_raw(self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::is_unpin.

pub fn needs_drop_raw(self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>) -> bool

Query backing Ty::needs_drop.

pub fn needs_async_drop_raw( self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>, ) -> bool

Query backing Ty::needs_async_drop.

pub fn has_significant_drop_raw( self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>, ) -> bool

Query backing Ty::has_significant_drop_raw.

pub fn has_structural_eq_impl(self, key: Ty<'tcx>) -> bool

Query backing Ty::is_structural_eq_shallow.

This is only correct for ADTs. Call is_structural_eq_shallow to handle all types correctly.

pub fn adt_drop_tys( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx List<Ty<'tcx>>, AlwaysRequiresDrop>

A list of types where the ADT requires drop if and only if any of those types require drop. If the ADT is known to always need drop then Err(AlwaysRequiresDrop) is returned.

pub fn adt_significant_drop_tys( self, key: impl IntoQueryParam<DefId>, ) -> Result<&'tcx List<Ty<'tcx>>, AlwaysRequiresDrop>

A list of types where the ADT requires drop if and only if any of those types has significant drop. A type marked with the attribute rustc_insignificant_dtor is considered to not be significant. A drop is significant if it is implemented by the user or does anything that will have any observable behavior (other than freeing up memory). If the ADT is known to have a significant destructor then Err(AlwaysRequiresDrop) is returned.

pub fn list_significant_drop_tys( self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>, ) -> &'tcx List<Ty<'tcx>>

Returns a list of types which (a) have a potentially significant destructor and (b) may be dropped as a result of dropping a value of some type ty (in the given environment).

The idea of “significant” drop is somewhat informal and is used only for diagnostics and edition migrations. The idea is that a significant drop may have some visible side-effect on execution; freeing memory is NOT considered a side-effect. The rules are as follows:

• Type with no explicit drop impl do not have significant drop.
• Types with a drop impl are assumed to have significant drop unless they have a #[rustc_insignificant_dtor] annotation.

Note that insignificant drop is a “shallow” property. A type like Vec<LockGuard> does not have significant drop but the type LockGuard does, and so if ty = Vec<LockGuard> then the return value would be &[LockGuard]. IMPORTANT: DO NOT run this query before promoted MIR body is constructed, because this query partially depends on that query. Otherwise, there is a risk of query cycles.

pub fn layout_of( self, key: PseudoCanonicalInput<'tcx, Ty<'tcx>>, ) -> Result<TyAndLayout<'tcx>, &'tcx LayoutError<'tcx>>

Computes the layout of a type. Note that this implicitly executes in TypingMode::PostAnalysis, and will normalize the input type.

pub fn fn_abi_of_fn_ptr( self, key: PseudoCanonicalInput<'tcx, (PolyFnSig<'tcx>, &'tcx List<Ty<'tcx>>)>, ) -> Result<&'tcx FnAbi<'tcx, Ty<'tcx>>, &'tcx FnAbiError<'tcx>>

Compute a FnAbi suitable for indirect calls, i.e. to fn pointers.

NB: this doesn’t handle virtual calls - those should use fn_abi_of_instance instead, where the instance is an InstanceKind::Virtual.

pub fn fn_abi_of_instance( self, key: PseudoCanonicalInput<'tcx, (Instance<'tcx>, &'tcx List<Ty<'tcx>>)>, ) -> Result<&'tcx FnAbi<'tcx, Ty<'tcx>>, &'tcx FnAbiError<'tcx>>

Compute a FnAbi suitable for declaring/defining an fn instance, and for direct calls to an fn.

NB: that includes virtual calls, which are represented by “direct calls” to an InstanceKind::Virtual instance (of <dyn Trait as Trait>::fn).

pub fn dylib_dependency_formats( self, key: CrateNum, ) -> &'tcx [(CrateNum, LinkagePreference)]

[query description - consider adding a doc-comment!] getting dylib dependency formats of crate

pub fn dependency_formats(self, key: ()) -> &'tcx Lrc<Dependencies>

[query description - consider adding a doc-comment!] getting the linkage format of all dependencies

pub fn is_compiler_builtins(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate is_compiler_builtins

pub fn has_global_allocator(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate has_global_allocator

pub fn has_alloc_error_handler(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate has_alloc_error_handler

pub fn has_panic_handler(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if the crate has_panic_handler

pub fn is_profiler_runtime(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking if a crate is #![profiler_runtime]

pub fn has_ffi_unwind_calls(self, key: impl IntoQueryParam<LocalDefId>) -> bool

[query description - consider adding a doc-comment!] checking if tcx.def_path_str(key) contains FFI-unwind calls

pub fn required_panic_strategy(self, key: CrateNum) -> Option<PanicStrategy>

[query description - consider adding a doc-comment!] getting a crate’s required panic strategy

pub fn panic_in_drop_strategy(self, key: CrateNum) -> PanicStrategy

[query description - consider adding a doc-comment!] getting a crate’s configured panic-in-drop strategy

pub fn is_no_builtins(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] getting whether a crate has #![no_builtins]

pub fn symbol_mangling_version(self, key: CrateNum) -> SymbolManglingVersion

[query description - consider adding a doc-comment!] getting a crate’s symbol mangling version

pub fn extern_crate(self, key: CrateNum) -> Option<&'tcx ExternCrate>

[query description - consider adding a doc-comment!] getting crate’s ExternCrateData

pub fn specialization_enabled_in(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] checking whether the crate enabled specialization/min_specialization

pub fn specializes(self, key: (DefId, DefId)) -> bool

[query description - consider adding a doc-comment!] computing whether impls specialize one another

pub fn in_scope_traits_map( self, key: OwnerId, ) -> Option<&'tcx ItemLocalMap<Box<[TraitCandidate]>>>

[query description - consider adding a doc-comment!] getting traits in scope at a block

pub fn defaultness(self, key: impl IntoQueryParam<DefId>) -> Defaultness

Returns whether the impl or associated function has the default keyword.

pub fn check_well_formed( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

[query description - consider adding a doc-comment!] checking that tcx.def_path_str(key) is well-formed

pub fn reachable_non_generics( self, key: CrateNum, ) -> &'tcx DefIdMap<SymbolExportInfo>

[query description - consider adding a doc-comment!] looking up the exported symbols of a crate

pub fn is_reachable_non_generic(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] checking whether tcx.def_path_str(def_id) is an exported symbol

pub fn is_unreachable_local_definition( self, key: impl IntoQueryParam<LocalDefId>, ) -> bool

[query description - consider adding a doc-comment!] checking whether tcx.def_path_str(def_id) is reachable from outside the crate

pub fn upstream_monomorphizations( self, key: (), ) -> &'tcx DefIdMap<UnordMap<GenericArgsRef<'tcx>, CrateNum>>

The entire set of monomorphizations the local crate can safely link to because they are exported from upstream crates. Do not depend on this directly, as its value changes anytime a monomorphization gets added or removed in any upstream crate. Instead use the narrower upstream_monomorphizations_for, upstream_drop_glue_for, upstream_async_drop_glue_for, or, even better, Instance::upstream_monomorphization().

pub fn upstream_monomorphizations_for( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx UnordMap<GenericArgsRef<'tcx>, CrateNum>>

Returns the set of upstream monomorphizations available for the generic function identified by the given def_id. The query makes sure to make a stable selection if the same monomorphization is available in multiple upstream crates.

You likely want to call Instance::upstream_monomorphization() instead of invoking this query directly.

pub fn upstream_drop_glue_for( self, key: GenericArgsRef<'tcx>, ) -> Option<CrateNum>

Returns the upstream crate that exports drop-glue for the given type (args is expected to be a single-item list containing the type one wants drop-glue for).

This is a subset of upstream_monomorphizations_for in order to increase dep-tracking granularity. Otherwise adding or removing any type with drop-glue in any upstream crate would invalidate all functions calling drop-glue of an upstream type.

You likely want to call Instance::upstream_monomorphization() instead of invoking this query directly.

NOTE: This query could easily be extended to also support other common functions that have are large set of monomorphizations (like Clone::clone for example).

pub fn upstream_async_drop_glue_for( self, key: GenericArgsRef<'tcx>, ) -> Option<CrateNum>

Returns the upstream crate that exports async-drop-glue for the given type (args is expected to be a single-item list containing the type one wants async-drop-glue for).

This is a subset of upstream_monomorphizations_for in order to increase dep-tracking granularity. Otherwise adding or removing any type with async-drop-glue in any upstream crate would invalidate all functions calling async-drop-glue of an upstream type.

You likely want to call Instance::upstream_monomorphization() instead of invoking this query directly.

NOTE: This query could easily be extended to also support other common functions that have are large set of monomorphizations (like Clone::clone for example).

pub fn foreign_modules( self, key: CrateNum, ) -> &'tcx FxIndexMap<DefId, ForeignModule>

Returns a list of all extern blocks of a crate.

pub fn clashing_extern_declarations(self, key: ())

Lint against extern fn declarations having incompatible types.

pub fn entry_fn(self, key: ()) -> Option<(DefId, EntryFnType)>

Identifies the entry-point (e.g., the main function) for a given crate, returning None if there is no entry point (such as for library crates).

pub fn proc_macro_decls_static(self, key: ()) -> Option<LocalDefId>

Finds the rustc_proc_macro_decls item of a crate.

pub fn crate_hash(self, key: CrateNum) -> Svh

[query description - consider adding a doc-comment!] looking up the hash a crate

pub fn crate_host_hash(self, key: CrateNum) -> Option<Svh>

Gets the hash for the host proc macro. Used to support -Z dual-proc-macro.

pub fn extra_filename(self, key: CrateNum) -> &'tcx String

Gets the extra data to put in each output filename for a crate. For example, compiling the foo crate with extra-filename=-a creates a libfoo-b.rlib file.

pub fn crate_extern_paths(self, key: CrateNum) -> &'tcx Vec<PathBuf>

Gets the paths where the crate came from in the file system.

pub fn implementations_of_trait( self, key: (CrateNum, DefId), ) -> &'tcx [(DefId, Option<SimplifiedType>)]

Given a crate and a trait, look up all impls of that trait in the crate. Return (impl_id, self_ty).

pub fn crate_incoherent_impls( self, key: (CrateNum, SimplifiedType), ) -> &'tcx [DefId]

Collects all incoherent impls for the given crate and type.

Do not call this directly, but instead use the incoherent_impls query. This query is only used to get the data necessary for that query.

pub fn native_library( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx NativeLib>

Get the corresponding native library from the native_libraries query

pub fn inherit_sig_for_delegation_item( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx [Ty<'tcx>]

[query description - consider adding a doc-comment!] inheriting delegation signature

pub fn resolve_bound_vars(self, key: OwnerId) -> &'tcx ResolveBoundVars

Does lifetime resolution on items. Importantly, we can’t resolve lifetimes directly on things like trait methods, because of trait params. See rustc_resolve::late::lifetimes for details.

pub fn named_variable_map( self, key: OwnerId, ) -> &'tcx SortedMap<ItemLocalId, ResolvedArg>

[query description - consider adding a doc-comment!] looking up a named region inside tcx.def_path_str(owner_id)

pub fn is_late_bound_map( self, key: OwnerId, ) -> Option<&'tcx FxIndexSet<ItemLocalId>>

[query description - consider adding a doc-comment!] testing if a region is late bound inside tcx.def_path_str(owner_id)

pub fn object_lifetime_default( self, key: impl IntoQueryParam<DefId>, ) -> ObjectLifetimeDefault

For a given item’s generic parameter, gets the default lifetimes to be used for each parameter if a trait object were to be passed for that parameter. For example, for T in struct Foo<'a, T>, this would be 'static. For T in struct Foo<'a, T: 'a>, this would instead be 'a. This query will panic if passed something that is not a type parameter.

pub fn late_bound_vars_map( self, key: OwnerId, ) -> &'tcx SortedMap<ItemLocalId, Vec<BoundVariableKind>>

[query description - consider adding a doc-comment!] looking up late bound vars inside tcx.def_path_str(owner_id)

pub fn opaque_captured_lifetimes( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx [(ResolvedArg, LocalDefId)]

For an opaque type, return the list of (captured lifetime, inner generic param).

fn foo<'a: 'a, 'b, T>(&'b u8) -> impl Into<Self> + 'b { ... }

We would return [('a, '_a), ('b, '_b)], with 'a early-bound and 'b late-bound.

After hir_ty_lowering, we get:

opaque foo::<'a>::opaque<'_a, '_b>: Into<Foo<'_a>> + '_b;
                         ^^^^^^^^ inner generic params
fn foo<'a>: for<'b> fn(&'b u8) -> foo::<'a>::opaque::<'a, 'b>
                                                      ^^^^^^ captured lifetimes

pub fn visibility(self, key: impl IntoQueryParam<DefId>) -> Visibility<DefId>

Computes the visibility of the provided def_id.

If the item from the def_id doesn’t have a visibility, it will panic. For example a generic type parameter will panic if you call this method on it:

use std::fmt::Debug;

pub trait Foo<T: Debug> {}

In here, if you call visibility on T, it’ll panic.

pub fn inhabited_predicate_adt( self, key: impl IntoQueryParam<DefId>, ) -> InhabitedPredicate<'tcx>

[query description - consider adding a doc-comment!] computing the uninhabited predicate of {:?}

pub fn inhabited_predicate_type(self, key: Ty<'tcx>) -> InhabitedPredicate<'tcx>

Do not call this query directly: invoke Ty::inhabited_predicate instead.

pub fn dep_kind(self, key: CrateNum) -> CrateDepKind

[query description - consider adding a doc-comment!] fetching what a dependency looks like

pub fn crate_name(self, key: CrateNum) -> Symbol

Gets the name of the crate.

pub fn module_children( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [ModChild]

[query description - consider adding a doc-comment!] collecting child items of module tcx.def_path_str(def_id)

pub fn extern_mod_stmt_cnum( self, key: impl IntoQueryParam<LocalDefId>, ) -> Option<CrateNum>

[query description - consider adding a doc-comment!] computing crate imported by tcx.def_path_str(def_id)

pub fn num_extern_def_ids(self, key: CrateNum) -> usize

Gets the number of definitions in a foreign crate.

This allows external tools to iterate over all definitions in a foreign crate.

This should never be used for the local crate, instead use iter_local_def_id.

pub fn lib_features(self, key: CrateNum) -> &'tcx LibFeatures

[query description - consider adding a doc-comment!] calculating the lib features defined in a crate

pub fn stability_implications( self, key: CrateNum, ) -> &'tcx UnordMap<Symbol, Symbol>

[query description - consider adding a doc-comment!] calculating the implications between #[unstable] features defined in a crate

pub fn intrinsic_raw( self, key: impl IntoQueryParam<DefId>, ) -> Option<IntrinsicDef>

Whether the function is an intrinsic

pub fn get_lang_items(self, key: ()) -> &'tcx LanguageItems

Returns the lang items defined in another crate by loading it from metadata.

pub fn all_diagnostic_items(self, key: ()) -> &'tcx DiagnosticItems

Returns all diagnostic items defined in all crates.

pub fn defined_lang_items(self, key: CrateNum) -> &'tcx [(DefId, LangItem)]

Returns the lang items defined in another crate by loading it from metadata.

pub fn diagnostic_items(self, key: CrateNum) -> &'tcx DiagnosticItems

Returns the diagnostic items defined in a crate.

pub fn missing_lang_items(self, key: CrateNum) -> &'tcx [LangItem]

[query description - consider adding a doc-comment!] calculating the missing lang items in a crate

pub fn visible_parent_map(self, key: ()) -> &'tcx DefIdMap<DefId>

The visible parent map is a map from every item to a visible parent. It prefers the shortest visible path to an item. Used for diagnostics, for example path trimming. The parents are modules, enums or traits.

pub fn trimmed_def_paths(self, key: ()) -> &'tcx DefIdMap<Symbol>

Collects the “trimmed”, shortest accessible paths to all items for diagnostics. See the provider docs for more info.

pub fn missing_extern_crate_item(self, key: CrateNum) -> bool

[query description - consider adding a doc-comment!] seeing if we’re missing an extern crate item for this crate

pub fn used_crate_source(self, key: CrateNum) -> &'tcx Lrc<CrateSource>

[query description - consider adding a doc-comment!] looking at the source for a crate

pub fn debugger_visualizers( self, key: CrateNum, ) -> &'tcx Vec<DebuggerVisualizerFile>

Returns the debugger visualizers defined for this crate. NOTE: This query has to be marked eval_always because it reads data directly from disk that is not tracked anywhere else. I.e. it represents a genuine input to the query system.

pub fn postorder_cnums(self, key: ()) -> &'tcx [CrateNum]

[query description - consider adding a doc-comment!] generating a postorder list of CrateNums

pub fn is_private_dep(self, key: CrateNum) -> bool

Returns whether or not the crate with CrateNum ‘cnum’ is marked as a private dependency

pub fn allocator_kind(self, key: ()) -> Option<AllocatorKind>

[query description - consider adding a doc-comment!] getting the allocator kind for the current crate

pub fn alloc_error_handler_kind(self, key: ()) -> Option<AllocatorKind>

[query description - consider adding a doc-comment!] alloc error handler kind for the current crate

pub fn upvars_mentioned( self, key: impl IntoQueryParam<DefId>, ) -> Option<&'tcx FxIndexMap<HirId, Upvar>>

[query description - consider adding a doc-comment!] collecting upvars mentioned in tcx.def_path_str(def_id)

pub fn maybe_unused_trait_imports(self, key: ()) -> &'tcx FxIndexSet<LocalDefId>

[query description - consider adding a doc-comment!] fetching potentially unused trait imports

pub fn names_imported_by_glob_use( self, key: impl IntoQueryParam<LocalDefId>, ) -> &'tcx UnordSet<Symbol>

[query description - consider adding a doc-comment!] finding names imported by glob use for tcx.def_path_str(def_id)

pub fn stability_index(self, key: ()) -> &'tcx Index

[query description - consider adding a doc-comment!] calculating the stability index for the local crate

pub fn crates(self, key: ()) -> &'tcx [CrateNum]

[query description - consider adding a doc-comment!] fetching all foreign CrateNum instances

pub fn used_crates(self, key: ()) -> &'tcx [CrateNum]

[query description - consider adding a doc-comment!] fetching CrateNums for all crates loaded non-speculatively

pub fn traits(self, key: CrateNum) -> &'tcx [DefId]

A list of all traits in a crate, used by rustdoc and error reporting.

pub fn trait_impls_in_crate(self, key: CrateNum) -> &'tcx [DefId]

[query description - consider adding a doc-comment!] fetching all trait impls in a crate

pub fn exported_symbols( self, key: CrateNum, ) -> &'tcx [(ExportedSymbol<'tcx>, SymbolExportInfo)]

The list of symbols exported from the given crate.

• All names contained in exported_symbols(cnum) are guaranteed to correspond to a publicly visible symbol in cnum machine code.
• The exported_symbols sets of different crates do not intersect.

pub fn collect_and_partition_mono_items( self, key: (), ) -> (&'tcx DefIdSet, &'tcx [CodegenUnit<'tcx>])

[query description - consider adding a doc-comment!] collect_and_partition_mono_items

pub fn is_codegened_item(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] determining whether tcx.def_path_str(def_id) needs codegen

pub fn codegen_unit(self, key: Symbol) -> &'tcx CodegenUnit<'tcx>

[query description - consider adding a doc-comment!] getting codegen unit {sym}

pub fn backend_optimization_level(self, key: ()) -> OptLevel

[query description - consider adding a doc-comment!] optimization level used by backend

pub fn output_filenames(self, key: ()) -> &'tcx Arc<OutputFilenames>

Return the filenames where output artefacts shall be stored.

This query returns an &Arc because codegen backends need the value even after the TyCtxt has been destroyed.

pub fn normalize_canonicalized_projection_ty( self, key: CanonicalAliasGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>, NoSolution>

Do not call this query directly: Invoke normalize instead.

pub fn normalize_canonicalized_weak_ty( self, key: CanonicalAliasGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>, NoSolution>

Do not call this query directly: Invoke normalize instead.

pub fn normalize_canonicalized_inherent_projection_ty( self, key: CanonicalAliasGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, NormalizationResult<'tcx>>>, NoSolution>

Do not call this query directly: Invoke normalize instead.

pub fn try_normalize_generic_arg_after_erasing_regions( self, key: PseudoCanonicalInput<'tcx, GenericArg<'tcx>>, ) -> Result<GenericArg<'tcx>, NoSolution>

Do not call this query directly: invoke try_normalize_erasing_regions instead.

pub fn implied_outlives_bounds_compat( self, key: CanonicalImpliedOutlivesBoundsGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>, NoSolution>

[query description - consider adding a doc-comment!] computing implied outlives bounds for goal.canonical.value.value.ty

pub fn implied_outlives_bounds( self, key: CanonicalImpliedOutlivesBoundsGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>, NoSolution>

[query description - consider adding a doc-comment!] computing implied outlives bounds v2 for goal.canonical.value.value.ty

pub fn dropck_outlives( self, key: CanonicalDropckOutlivesGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>, NoSolution>

Do not call this query directly: invoke DropckOutlives::new(dropped_ty)).fully_perform(typeck.infcx) instead.

pub fn evaluate_obligation( self, key: CanonicalPredicateGoal<'tcx>, ) -> Result<EvaluationResult, OverflowError>

Do not call this query directly: invoke infcx.predicate_may_hold() or infcx.predicate_must_hold() instead.

pub fn type_op_ascribe_user_type( self, key: CanonicalTypeOpAscribeUserTypeGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, ()>>, NoSolution>

Do not call this query directly: part of the Eq type-op

pub fn type_op_prove_predicate( self, key: CanonicalTypeOpProvePredicateGoal<'tcx>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, ()>>, NoSolution>

Do not call this query directly: part of the ProvePredicate type-op

pub fn type_op_normalize_ty( self, key: CanonicalTypeOpNormalizeGoal<'tcx, Ty<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Ty<'tcx>>>, NoSolution>

Do not call this query directly: part of the Normalize type-op

pub fn type_op_normalize_clause( self, key: CanonicalTypeOpNormalizeGoal<'tcx, Clause<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, Clause<'tcx>>>, NoSolution>

Do not call this query directly: part of the Normalize type-op

pub fn type_op_normalize_poly_fn_sig( self, key: CanonicalTypeOpNormalizeGoal<'tcx, PolyFnSig<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, PolyFnSig<'tcx>>>, NoSolution>

Do not call this query directly: part of the Normalize type-op

pub fn type_op_normalize_fn_sig( self, key: CanonicalTypeOpNormalizeGoal<'tcx, FnSig<'tcx>>, ) -> Result<&'tcx Canonical<'tcx, QueryResponse<'tcx, FnSig<'tcx>>>, NoSolution>

Do not call this query directly: part of the Normalize type-op

pub fn instantiate_and_check_impossible_predicates( self, key: (DefId, GenericArgsRef<'tcx>), ) -> bool

[query description - consider adding a doc-comment!] checking impossible instantiated predicates: tcx.def_path_str(key.0)

pub fn is_impossible_associated_item(self, key: (DefId, DefId)) -> bool

[query description - consider adding a doc-comment!] checking if tcx.def_path_str(key.1) is impossible to reference within tcx.def_path_str(key.0)

pub fn method_autoderef_steps( self, key: CanonicalTyGoal<'tcx>, ) -> MethodAutoderefStepsResult<'tcx>

[query description - consider adding a doc-comment!] computing autoderef types for goal.canonical.value.value

pub fn rust_target_features( self, key: CrateNum, ) -> &'tcx UnordMap<String, StabilityComputed>

Returns the Rust target features for the current target. These are not always the same as LLVM target features!

pub fn implied_target_features(self, key: Symbol) -> &'tcx Vec<Symbol>

[query description - consider adding a doc-comment!] looking up implied target features

pub fn features_query(self, key: ()) -> &'tcx Features

[query description - consider adding a doc-comment!] looking up enabled feature gates

pub fn crate_for_resolver(self, key: ()) -> &'tcx Steal<(Crate, AttrVec)>

[query description - consider adding a doc-comment!] the ast before macro expansion and name resolution

pub fn resolve_instance_raw( self, key: PseudoCanonicalInput<'tcx, (DefId, GenericArgsRef<'tcx>)>, ) -> Result<Option<Instance<'tcx>>, ErrorGuaranteed>

Attempt to resolve the given DefId to an Instance, for the given generics args (GenericArgsRef), returning one of:

• Ok(Some(instance)) on success
• Ok(None) when the GenericArgsRef are still too generic, and therefore don’t allow finding the final Instance
• Err(ErrorGuaranteed) when the Instance resolution process couldn’t complete due to errors elsewhere - this is distinct from Ok(None) to avoid misleading diagnostics when an error has already been/will be emitted, for the original cause.

pub fn reveal_opaque_types_in_bounds(self, key: Clauses<'tcx>) -> Clauses<'tcx>

[query description - consider adding a doc-comment!] revealing opaque types in {:?}

pub fn limits(self, key: ()) -> Limits

[query description - consider adding a doc-comment!] looking up limits

pub fn diagnostic_hir_wf_check( self, key: (Predicate<'tcx>, WellFormedLoc), ) -> &'tcx Option<ObligationCause<'tcx>>

Performs an HIR-based well-formed check on the item with the given HirId. If we get an Unimplemented error that matches the provided Predicate, return the cause of the newly created obligation.

This is only used by error-reporting code to get a better cause (in particular, a better span) for an existing error. Therefore, it is best-effort, and may never handle all of the cases that the normal ty::Ty-based wfcheck does. This is fine, because the ty::Ty-based wfcheck is always run.

pub fn global_backend_features(self, key: ()) -> &'tcx Vec<String>

The list of backend features computed from CLI flags (-Ctarget-cpu, -Ctarget-feature, --target and similar).

pub fn check_validity_requirement( self, key: (ValidityRequirement, PseudoCanonicalInput<'tcx, Ty<'tcx>>), ) -> Result<bool, &'tcx LayoutError<'tcx>>

[query description - consider adding a doc-comment!] checking validity requirement for key.1.value : key.0

pub fn compare_impl_item( self, key: impl IntoQueryParam<LocalDefId>, ) -> Result<(), ErrorGuaranteed>

This takes the def-id of an associated item from a impl of a trait, and checks its validity against the trait item it corresponds to.

Any other def id will ICE.

pub fn deduced_param_attrs( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DeducedParamAttrs]

[query description - consider adding a doc-comment!] deducing parameter attributes for tcx.def_path_str(def_id)

pub fn doc_link_resolutions( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx DocLinkResMap

[query description - consider adding a doc-comment!] resolutions for documentation links for a module

pub fn doc_link_traits_in_scope( self, key: impl IntoQueryParam<DefId>, ) -> &'tcx [DefId]

[query description - consider adding a doc-comment!] traits in scope for documentation links for a module

pub fn stripped_cfg_items(self, key: CrateNum) -> &'tcx [StrippedCfgItem]

Get all item paths that were stripped by a #[cfg] in a particular crate. Should not be called for the local crate before the resolver outputs are created, as it is only fed there.

pub fn generics_require_sized_self( self, key: impl IntoQueryParam<DefId>, ) -> bool

[query description - consider adding a doc-comment!] check whether the item has a where Self: Sized bound

pub fn cross_crate_inlinable(self, key: impl IntoQueryParam<DefId>) -> bool

[query description - consider adding a doc-comment!] whether the item should be made inlinable across crates

pub fn check_mono_item(self, key: Instance<'tcx>)

Perform monomorphization-time checking on this item. This is used for lints/errors that can only be checked once the instance is fully monomorphized.

pub fn skip_move_check_fns(self, key: ()) -> &'tcx FxIndexSet<DefId>

Builds the set of functions that should be skipped for the move-size check.

pub fn items_of_instance( self, key: (Instance<'tcx>, CollectionMode), ) -> (&'tcx [Spanned<MonoItem<'tcx>>], &'tcx [Spanned<MonoItem<'tcx>>])

[query description - consider adding a doc-comment!] collecting items used by key.0

pub fn size_estimate(self, key: Instance<'tcx>) -> usize

[query description - consider adding a doc-comment!] estimating codegen size of key

Trait Implementations

impl<'tcx> Abi<TyCtxt<'tcx>> for ExternAbi

fn rust() -> Self

fn is_rust(self) -> bool

Whether this ABI is extern "Rust".

impl<'tcx> AdtDef<TyCtxt<'tcx>> for AdtDef<'tcx>

fn def_id(self) -> DefId

fn is_struct(self) -> bool

fn struct_tail_ty( self, interner: TyCtxt<'tcx>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

Returns the type of the struct tail.

fn is_phantom_data(self) -> bool

fn all_field_tys( self, tcx: TyCtxt<'tcx>, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Ty<'tcx>>>

fn sized_constraint( self, tcx: TyCtxt<'tcx>, ) -> Option<EarlyBinder<'tcx, Ty<'tcx>>>

fn is_fundamental(self) -> bool

fn destructor(self, tcx: TyCtxt<'tcx>) -> Option<AdtDestructorKind>

impl<'tcx> BoundExistentialPredicates<TyCtxt<'tcx>> for &'tcx List<PolyExistentialPredicate<'tcx>>

fn principal_def_id(self) -> Option<DefId>

fn principal(self) -> Option<PolyExistentialTraitRef<'tcx>>

fn auto_traits(self) -> impl IntoIterator<Item = DefId>

fn projection_bounds( self, ) -> impl IntoIterator<Item = Binder<'tcx, ExistentialProjection<'tcx>>>

impl<'tcx> BoundVarLike<TyCtxt<'tcx>> for BoundRegion

fn var(self) -> BoundVar

fn assert_eq(self, var: BoundVariableKind)

impl<'tcx> BoundVarLike<TyCtxt<'tcx>> for BoundTy

fn var(self) -> BoundVar

fn assert_eq(self, var: BoundVariableKind)

impl<'tcx> Clause<TyCtxt<'tcx>> for Clause<'tcx>

fn as_predicate(self) -> Predicate<'tcx>

fn instantiate_supertrait( self, tcx: TyCtxt<'tcx>, trait_ref: PolyTraitRef<'tcx>, ) -> Self

Performs a instantiation suitable for going from a poly-trait-ref to supertraits that must hold if that poly-trait-ref holds. This is slightly different from a normal instantiation in terms of what happens with bound regions.

fn as_trait_clause(self) -> Option<Binder<I, TraitPredicate<I>>>

fn as_host_effect_clause(self) -> Option<Binder<I, HostEffectPredicate<I>>>

fn as_projection_clause(self) -> Option<Binder<I, ProjectionPredicate<I>>>

impl<'tcx> Clone for TyCtxt<'tcx>

fn clone(&self) -> TyCtxt<'tcx>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'tcx> Const<TyCtxt<'tcx>> for Const<'tcx>

fn new_infer(tcx: TyCtxt<'tcx>, infer: InferConst) -> Self

fn new_var(tcx: TyCtxt<'tcx>, vid: ConstVid) -> Self

fn new_bound( interner: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundVar, ) -> Self

fn new_anon_bound( tcx: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundVar, ) -> Self

fn new_unevaluated(interner: TyCtxt<'tcx>, uv: UnevaluatedConst<'tcx>) -> Self

fn new_expr(interner: TyCtxt<'tcx>, expr: Expr<'tcx>) -> Self

fn new_error(interner: TyCtxt<'tcx>, guar: ErrorGuaranteed) -> Self

fn new_error_with_message(interner: I, msg: impl ToString) -> Self

fn is_ct_var(self) -> bool

impl<'tcx> DefId<TyCtxt<'tcx>> for DefId

fn is_local(self) -> bool

fn as_local(self) -> Option<LocalDefId>

impl<'tcx> DepContext for TyCtxt<'tcx>

type Deps = DepsType

fn with_stable_hashing_context<R>( self, f: impl FnOnce(StableHashingContext<'_>) -> R, ) -> R

Create a hashing context for hashing new results.

fn dep_graph(&self) -> &DepGraph

Access the DepGraph.

fn profiler(&self) -> &SelfProfilerRef

Access the profiler.

fn sess(&self) -> &Session

Access the compiler session.

fn dep_kind_info(&self, dk: DepKind) -> &DepKindStruct<'tcx>

fn fingerprint_style(self, kind: DepKind) -> FingerprintStyle

fn is_eval_always(self, kind: DepKind) -> bool

Return whether this kind always require evaluation.

fn try_force_from_dep_node( self, dep_node: DepNode, frame: Option<&MarkFrame<'_>>, ) -> bool

Try to force a dep node to execute and see if it’s green.

fn try_load_from_on_disk_cache(self, dep_node: DepNode)

Load data from the on-disk cache.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for ()

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, _: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn recover(_: TyCtxt<'tcx>, _: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

fn to_debug_str(&self, _: Tcx) -> String

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for (DefId, DefId)

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: Tcx, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for CrateNum

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for DefId

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for HirId

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for LocalDefId

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for LocalModDefId

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for ModDefId

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> DepNodeParams<TyCtxt<'tcx>> for OwnerId

fn fingerprint_style() -> FingerprintStyle

fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous).

fn to_debug_str(&self, tcx: TyCtxt<'tcx>) -> String

fn recover(tcx: TyCtxt<'tcx>, dep_node: &DepNode) -> Option<Self>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it.

impl<'tcx> Deref for TyCtxt<'tcx>

type Target = &'tcx GlobalCtxt<'tcx>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for (Clause<'tcx>, Span)

fn predicate(&self) -> Predicate<'tcx>

fn child(&self, clause: Clause<'tcx>) -> Self

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for (Predicate<'tcx>, Span)

fn predicate(&self) -> Predicate<'tcx>

fn child(&self, clause: Clause<'tcx>) -> Self

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for Clause<'tcx>

fn predicate(&self) -> Predicate<'tcx>

fn child(&self, clause: Clause<'tcx>) -> Self

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

impl<'tcx> Elaboratable<TyCtxt<'tcx>> for Predicate<'tcx>

fn predicate(&self) -> Predicate<'tcx>

fn child(&self, clause: Clause<'tcx>) -> Self

fn child_with_derived_cause( &self, clause: Clause<'tcx>, _span: Span, _parent_trait_pred: PolyTraitPredicate<'tcx>, _index: usize, ) -> Self

impl<'tcx> ExprConst<TyCtxt<'tcx>> for Expr<'tcx>

fn args(self) -> GenericArgsRef<'tcx>

impl<'tcx> FallibleTypeFolder<TyCtxt<'tcx>> for MakeSuggestableFolder<'tcx>

type Error = ()

fn cx(&self) -> TyCtxt<'tcx>

fn try_fold_ty(&mut self, t: Ty<'tcx>) -> Result<Ty<'tcx>, Self::Error>

fn try_fold_const(&mut self, c: Const<'tcx>) -> Result<Const<'tcx>, ()>

fn try_fold_binder<T>( &mut self, t: Binder<I, T>, ) -> Result<Binder<I, T>, Self::Error>

where T: TypeFoldable<I>,

fn try_fold_region( &mut self, r: <I as Interner>::Region, ) -> Result<<I as Interner>::Region, Self::Error>

fn try_fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> Result<<I as Interner>::Predicate, Self::Error>

impl<'tcx> FallibleTypeFolder<TyCtxt<'tcx>> for TryNormalizeAfterErasingRegionsFolder<'tcx>

type Error = NormalizationError<'tcx>

fn cx(&self) -> TyCtxt<'tcx>

fn try_fold_ty(&mut self, ty: Ty<'tcx>) -> Result<Ty<'tcx>, Self::Error>

fn try_fold_const(&mut self, c: Const<'tcx>) -> Result<Const<'tcx>, Self::Error>

fn try_fold_binder<T>( &mut self, t: Binder<I, T>, ) -> Result<Binder<I, T>, Self::Error>

where T: TypeFoldable<I>,

fn try_fold_region( &mut self, r: <I as Interner>::Region, ) -> Result<<I as Interner>::Region, Self::Error>

fn try_fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> Result<<I as Interner>::Predicate, Self::Error>

impl<'tcx> Features<TyCtxt<'tcx>> for &'tcx Features

fn generic_const_exprs(self) -> bool

fn coroutine_clone(self) -> bool

fn associated_const_equality(self) -> bool

impl<'tcx> GenericArg<TyCtxt<'tcx>> for GenericArg<'tcx>

fn as_type(&self) -> Option<<I as Interner>::Ty>

fn expect_ty(&self) -> <I as Interner>::Ty

fn as_const(&self) -> Option<<I as Interner>::Const>

fn expect_const(&self) -> <I as Interner>::Const

fn as_region(&self) -> Option<<I as Interner>::Region>

fn expect_region(&self) -> <I as Interner>::Region

fn is_non_region_infer(self) -> bool

impl<'tcx> GenericArgs<TyCtxt<'tcx>> for GenericArgsRef<'tcx>

fn rebase_onto( self, tcx: TyCtxt<'tcx>, source_ancestor: DefId, target_args: GenericArgsRef<'tcx>, ) -> GenericArgsRef<'tcx>

fn type_at(self, i: usize) -> Ty<'tcx>

fn region_at(self, i: usize) -> Region<'tcx>

fn const_at(self, i: usize) -> Const<'tcx>

fn identity_for_item(tcx: TyCtxt<'tcx>, def_id: DefId) -> GenericArgsRef<'tcx>

fn extend_with_error( tcx: TyCtxt<'tcx>, def_id: DefId, original_args: &[GenericArg<'tcx>], ) -> GenericArgsRef<'tcx>

fn split_closure_args(self) -> ClosureArgsParts<TyCtxt<'tcx>>

fn split_coroutine_closure_args(self) -> CoroutineClosureArgsParts<TyCtxt<'tcx>>

fn split_coroutine_args(self) -> CoroutineArgsParts<TyCtxt<'tcx>>

fn as_closure(self) -> ClosureArgs<I>

fn as_coroutine_closure(self) -> CoroutineClosureArgs<I>

fn as_coroutine(self) -> CoroutineArgs<I>

impl<'tcx> GenericsOf<TyCtxt<'tcx>> for &'tcx Generics

fn count(&self) -> usize

impl<'tcx> HasDataLayout for TyCtxt<'tcx>

fn data_layout(&self) -> &TargetDataLayout

impl<'tcx> HasTargetSpec for TyCtxt<'tcx>

fn target_spec(&self) -> &Target

impl<'tcx> HasTyCtxt<'tcx> for TyCtxt<'tcx>

fn tcx(&self) -> TyCtxt<'tcx>

impl<'tcx> HasWasmCAbiOpt for TyCtxt<'tcx>

fn wasm_c_abi_opt(&self) -> WasmCAbi

impl<'tcx> HasX86AbiOpt for TyCtxt<'tcx>

fn x86_abi_opt(&self) -> X86Abi

impl<'tcx> Interner for TyCtxt<'tcx>

fn debug_assert_existential_args_compatible( self, def_id: Self::DefId, args: Self::GenericArgs, )

Assert that the args from an ExistentialTraitRef or ExistentialProjection are compatible with the DefId. Since we’re missing a Self type, stick on a dummy self type and forward to debug_assert_args_compatible.

type DefId = DefId

type LocalDefId = LocalDefId

type Span = Span

type GenericArgs = &'tcx RawList<(), GenericArg<'tcx>>

type GenericArgsSlice = &'tcx [GenericArg<'tcx>]

type GenericArg = GenericArg<'tcx>

type Term = Term<'tcx>

type BoundVarKinds = &'tcx RawList<(), BoundVariableKind>

type BoundVarKind = BoundVariableKind

type PredefinedOpaques = PredefinedOpaques<'tcx>

type DefiningOpaqueTypes = &'tcx RawList<(), LocalDefId>

type CanonicalVars = &'tcx RawList<(), CanonicalVarInfo<TyCtxt<'tcx>>>

type ExternalConstraints = ExternalConstraints<'tcx>

type DepNodeIndex = DepNodeIndex

type Ty = Ty<'tcx>

type Tys = &'tcx RawList<(), Ty<'tcx>>

type FnInputTys = &'tcx [Ty<'tcx>]

type ParamTy = ParamTy

type BoundTy = BoundTy

type PlaceholderTy = Placeholder<BoundTy>

type ErrorGuaranteed = ErrorGuaranteed

type BoundExistentialPredicates = &'tcx RawList<(), Binder<TyCtxt<'tcx>, ExistentialPredicate<TyCtxt<'tcx>>>>

type AllocId = AllocId

type Pat = Pattern<'tcx>

type Safety = Safety

type Abi = ExternAbi

type Const = Const<'tcx>

type PlaceholderConst = Placeholder<BoundVar>

type ParamConst = ParamConst

type BoundConst = BoundVar

type ValueConst = ValTree<'tcx>

type ExprConst = Expr<'tcx>

type Region = Region<'tcx>

type EarlyParamRegion = EarlyParamRegion

type LateParamRegion = LateParamRegion

type BoundRegion = BoundRegion

type PlaceholderRegion = Placeholder<BoundRegion>

type ParamEnv = ParamEnv<'tcx>

type Predicate = Predicate<'tcx>

type Clause = Clause<'tcx>

type Clauses = &'tcx RawList<TypeInfo, Clause<'tcx>>

type Tracked<T: Debug + Clone> = WithDepNode<T>

type GenericsOf = &'tcx Generics

type VariancesOf = &'tcx [Variance]

type AdtDef = AdtDef<'tcx>

type Features = &'tcx Features

type UnsizingParams = &'tcx BitSet<u32>

fn mk_predefined_opaques_in_body( self, data: PredefinedOpaquesData<Self>, ) -> Self::PredefinedOpaques

fn mk_canonical_var_infos( self, infos: &[CanonicalVarInfo<Self>], ) -> Self::CanonicalVars

fn mk_external_constraints( self, data: ExternalConstraintsData<Self>, ) -> ExternalConstraints<'tcx>

fn with_cached_task<T>(self, task: impl FnOnce() -> T) -> (T, DepNodeIndex)

fn mk_tracked<T: Debug + Clone>( self, data: T, dep_node: DepNodeIndex, ) -> Self::Tracked<T>

fn get_tracked<T: Debug + Clone>(self, tracked: &Self::Tracked<T>) -> T

fn with_global_cache<R>(self, f: impl FnOnce(&mut GlobalCache<Self>) -> R) -> R

fn evaluation_is_concurrent(&self) -> bool

fn expand_abstract_consts<T: TypeFoldable<TyCtxt<'tcx>>>(self, t: T) -> T

fn generics_of(self, def_id: DefId) -> &'tcx Generics

fn variances_of(self, def_id: DefId) -> Self::VariancesOf

fn type_of(self, def_id: DefId) -> EarlyBinder<'tcx, Ty<'tcx>>

fn adt_def(self, adt_def_id: DefId) -> Self::AdtDef

fn alias_ty_kind(self, alias: AliasTy<'tcx>) -> AliasTyKind

fn alias_term_kind(self, alias: AliasTerm<'tcx>) -> AliasTermKind

fn trait_ref_and_own_args_for_alias( self, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> (TraitRef<'tcx>, &'tcx [GenericArg<'tcx>])

fn mk_args(self, args: &[Self::GenericArg]) -> GenericArgsRef<'tcx>

fn mk_args_from_iter<I, T>(self, args: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<Self::GenericArg, GenericArgsRef<'tcx>>,

fn check_args_compatible( self, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> bool

fn debug_assert_args_compatible(self, def_id: DefId, args: GenericArgsRef<'tcx>)

fn mk_type_list_from_iter<I, T>(self, args: I) -> T::Output

where I: Iterator<Item = T>, T: CollectAndApply<Ty<'tcx>, &'tcx List<Ty<'tcx>>>,

fn parent(self, def_id: DefId) -> DefId

fn recursion_limit(self) -> usize

fn features(self) -> Self::Features

fn bound_coroutine_hidden_types( self, def_id: DefId, ) -> impl IntoIterator<Item = EarlyBinder<'tcx, Binder<'tcx, Ty<'tcx>>>>

fn fn_sig(self, def_id: DefId) -> EarlyBinder<'tcx, PolyFnSig<'tcx>>

fn coroutine_movability(self, def_id: DefId) -> Movability

fn coroutine_for_closure(self, def_id: DefId) -> DefId

fn generics_require_sized_self(self, def_id: DefId) -> bool

fn item_bounds( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Clause<'tcx>>>

fn predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Clause<'tcx>>>

fn own_predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Clause<'tcx>>>

fn explicit_super_predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = (Clause<'tcx>, Span)>>

fn explicit_implied_predicates_of( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = (Clause<'tcx>, Span)>>

fn impl_is_const(self, def_id: DefId) -> bool

fn fn_is_const(self, def_id: DefId) -> bool

fn alias_has_const_conditions(self, def_id: DefId) -> bool

fn const_conditions( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Binder<'tcx, TraitRef<'tcx>>>>

fn explicit_implied_const_bounds( self, def_id: DefId, ) -> EarlyBinder<'tcx, impl IntoIterator<Item = Binder<'tcx, TraitRef<'tcx>>>>

fn has_target_features(self, def_id: DefId) -> bool

fn require_lang_item(self, lang_item: TraitSolverLangItem) -> DefId

fn is_lang_item(self, def_id: DefId, lang_item: TraitSolverLangItem) -> bool

fn as_lang_item(self, def_id: DefId) -> Option<TraitSolverLangItem>

fn associated_type_def_ids( self, def_id: DefId, ) -> impl IntoIterator<Item = DefId>

fn for_each_relevant_impl( self, trait_def_id: DefId, self_ty: Ty<'tcx>, f: impl FnMut(DefId), )

fn has_item_definition(self, def_id: DefId) -> bool

fn impl_is_default(self, impl_def_id: DefId) -> bool

fn impl_trait_ref(self, impl_def_id: DefId) -> EarlyBinder<'tcx, TraitRef<'tcx>>

fn impl_polarity(self, impl_def_id: DefId) -> ImplPolarity

fn trait_is_auto(self, trait_def_id: DefId) -> bool

fn trait_is_alias(self, trait_def_id: DefId) -> bool

fn trait_is_dyn_compatible(self, trait_def_id: DefId) -> bool

fn trait_is_fundamental(self, def_id: DefId) -> bool

fn trait_may_be_implemented_via_object(self, trait_def_id: DefId) -> bool

fn trait_is_unsafe(self, trait_def_id: Self::DefId) -> bool

Returns true if this is an unsafe trait.

fn is_impl_trait_in_trait(self, def_id: DefId) -> bool

fn delay_bug(self, msg: impl ToString) -> ErrorGuaranteed

fn is_general_coroutine(self, coroutine_def_id: DefId) -> bool

fn coroutine_is_async(self, coroutine_def_id: DefId) -> bool

fn coroutine_is_gen(self, coroutine_def_id: DefId) -> bool

fn coroutine_is_async_gen(self, coroutine_def_id: DefId) -> bool

fn unsizing_params_for_adt(self, adt_def_id: DefId) -> Self::UnsizingParams

fn find_const_ty_from_env( self, param_env: ParamEnv<'tcx>, placeholder: Self::PlaceholderConst, ) -> Ty<'tcx>

fn anonymize_bound_vars<T: TypeFoldable<TyCtxt<'tcx>>>( self, binder: Binder<'tcx, T>, ) -> Binder<'tcx, T>

fn opaque_types_defined_by( self, defining_anchor: LocalDefId, ) -> Self::DefiningOpaqueTypes

impl<T> IrPrint<T> for TyCtxt<'_>

where T: Copy + for<'a, 'tcx> Lift<TyCtxt<'tcx>, Lifted: Print<'tcx, FmtPrinter<'a, 'tcx>>>,

fn print(t: &T, fmt: &mut Formatter<'_>) -> Result

fn print_debug(t: &T, fmt: &mut Formatter<'_>) -> Result

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for Const<'tcx>

type Lifted = Const<'__lifted>

fn lift_to_interner(self, __tcx: TyCtxt<'__lifted>) -> Option<Const<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for ConstValue<'tcx>

type Lifted = ConstValue<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<ConstValue<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for Instance<'tcx>

type Lifted = Instance<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<Instance<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for InstanceKind<'tcx>

type Lifted = InstanceKind<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<InstanceKind<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for PrintClosureAsImpl<'tcx>

type Lifted = PrintClosureAsImpl<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<PrintClosureAsImpl<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitPredPrintModifiersAndPath<'tcx>

type Lifted = TraitPredPrintModifiersAndPath<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitPredPrintModifiersAndPath<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitPredPrintWithBoundConstness<'tcx>

type Lifted = TraitPredPrintWithBoundConstness<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitPredPrintWithBoundConstness<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitRefPrintOnlyTraitName<'tcx>

type Lifted = TraitRefPrintOnlyTraitName<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitRefPrintOnlyTraitName<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitRefPrintOnlyTraitPath<'tcx>

type Lifted = TraitRefPrintOnlyTraitPath<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitRefPrintOnlyTraitPath<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for TraitRefPrintSugared<'tcx>

type Lifted = TraitRefPrintSugared<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<TraitRefPrintSugared<'__lifted>>

impl<'tcx, '__lifted> Lift<TyCtxt<'__lifted>> for UnevaluatedConst<'tcx>

type Lifted = UnevaluatedConst<'__lifted>

fn lift_to_interner( self, __tcx: TyCtxt<'__lifted>, ) -> Option<UnevaluatedConst<'__lifted>>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a [ValTree<'a>]

type Lifted = &'tcx [ValTree<'tcx>]

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<PolyExistentialPredicate<'a>>

type Lifted = &'tcx RawList<(), Binder<TyCtxt<'tcx>, ExistentialPredicate<TyCtxt<'tcx>>>>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<BoundVariableKind>

type Lifted = &'tcx RawList<(), BoundVariableKind>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<GenericArg<'a>>

type Lifted = &'tcx RawList<(), GenericArg<'tcx>>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for &'a List<Ty<'a>>

type Lifted = &'tcx RawList<(), Ty<'tcx>>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for ()

type Lifted = ()

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for AllocId

type Lifted = AllocId

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for BoundConstness

type Lifted = BoundConstness

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Clause<'a>

type Lifted = Clause<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for ClosureKind

type Lifted = ClosureKind

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Const<'a>

type Lifted = Const<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for ConstAllocation<'a>

type Lifted = ConstAllocation<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for CtfeProvenance

type Lifted = CtfeProvenance

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for DefId

type Lifted = DefId

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for ExternAbi

type Lifted = ExternAbi

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for GenericArg<'a>

type Lifted = GenericArg<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for ImplPolarity

type Lifted = ImplPolarity

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for IsConstable

type Lifted = IsConstable

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Layout<'a>

type Lifted = Layout<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx, T: Lift<TyCtxt<'tcx>>> Lift<TyCtxt<'tcx>> for Option<T>

type Lifted = Option<<T as Lift<TyCtxt<'tcx>>>::Lifted>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for ParamConst

type Lifted = ParamConst

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for ParamTy

type Lifted = ParamTy

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Pattern<'a>

type Lifted = Pattern<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Predicate<'a>

type Lifted = Predicate<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for PredicatePolarity

type Lifted = PredicatePolarity

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for Promoted

type Lifted = Promoted

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Region<'a>

type Lifted = Region<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for ReifyReason

type Lifted = ReifyReason

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for Safety

type Lifted = Safety

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for Scalar

type Lifted = Scalar

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for Size

type Lifted = Size

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Term<'a>

type Lifted = Term<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<TyCtxt<'tcx>> for Ty<'a>

type Lifted = Ty<'tcx>

fn lift_to_interner(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'tcx> Lift<TyCtxt<'tcx>> for bool

type Lifted = bool

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for u64

type Lifted = u64

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> Lift<TyCtxt<'tcx>> for usize

type Lifted = usize

fn lift_to_interner(self, _: TyCtxt<'tcx>) -> Option<Self>

impl<'tcx> ParamEnv<TyCtxt<'tcx>> for ParamEnv<'tcx>

fn caller_bounds(self) -> impl SliceLike<Item = Clause<'tcx>>

impl<'tcx> PpAnn for TyCtxt<'tcx>

fn nested(&self, state: &mut State<'_>, nested: Nested)

fn pre(&self, _state: &mut State<'_>, _node: AnnNode<'_>)

fn post(&self, _state: &mut State<'_>, _node: AnnNode<'_>)

impl<'tcx> Predicate<TyCtxt<'tcx>> for Predicate<'tcx>

fn as_clause(self) -> Option<Clause<'tcx>>

fn is_coinductive(self, interner: TyCtxt<'tcx>) -> bool

fn allow_normalization(self) -> bool

impl<'tcx> Region<TyCtxt<'tcx>> for Region<'tcx>

fn new_bound( interner: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundRegion, ) -> Self

fn new_anon_bound( tcx: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundVar, ) -> Self

fn new_static(tcx: TyCtxt<'tcx>) -> Self

fn is_bound(self) -> bool

impl<'tcx> Relate<TyCtxt<'tcx>> for &'tcx List<PolyExistentialPredicate<'tcx>>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Self, b: Self, ) -> RelateResult<'tcx, Self>

impl<'tcx> Relate<TyCtxt<'tcx>> for GenericArgsRef<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: GenericArgsRef<'tcx>, b: GenericArgsRef<'tcx>, ) -> RelateResult<'tcx, GenericArgsRef<'tcx>>

impl<'tcx> Relate<TyCtxt<'tcx>> for Const<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Const<'tcx>, b: Const<'tcx>, ) -> RelateResult<'tcx, Const<'tcx>>

impl<'tcx> Relate<TyCtxt<'tcx>> for Expr<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, ae: Expr<'tcx>, be: Expr<'tcx>, ) -> RelateResult<'tcx, Expr<'tcx>>

impl<'tcx> Relate<TyCtxt<'tcx>> for GenericArg<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: GenericArg<'tcx>, b: GenericArg<'tcx>, ) -> RelateResult<'tcx, GenericArg<'tcx>>

impl<'tcx> Relate<TyCtxt<'tcx>> for ImplSubject<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: ImplSubject<'tcx>, b: ImplSubject<'tcx>, ) -> RelateResult<'tcx, ImplSubject<'tcx>>

impl<'tcx> Relate<TyCtxt<'tcx>> for Pattern<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Self, b: Self, ) -> RelateResult<'tcx, Self>

impl<'tcx> Relate<TyCtxt<'tcx>> for Region<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Region<'tcx>, b: Region<'tcx>, ) -> RelateResult<'tcx, Region<'tcx>>

impl<'tcx> Relate<TyCtxt<'tcx>> for Term<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Self, b: Self, ) -> RelateResult<'tcx, Self>

impl<'tcx> Relate<TyCtxt<'tcx>> for Ty<'tcx>

fn relate<R: TypeRelation<TyCtxt<'tcx>>>( relation: &mut R, a: Ty<'tcx>, b: Ty<'tcx>, ) -> RelateResult<'tcx, Ty<'tcx>>

impl<'tcx> Safety<TyCtxt<'tcx>> for Safety

fn safe() -> Self

fn is_safe(self) -> bool

fn prefix_str(self) -> &'static str

impl<'tcx> Span<TyCtxt<'tcx>> for Span

fn dummy() -> Self

impl<'tcx> Term<TyCtxt<'tcx>> for Term<'tcx>

fn as_type(&self) -> Option<<I as Interner>::Ty>

fn expect_ty(&self) -> <I as Interner>::Ty

fn as_const(&self) -> Option<<I as Interner>::Const>

fn expect_const(&self) -> <I as Interner>::Const

fn is_infer(self) -> bool

fn to_alias_term(self) -> Option<AliasTerm<I>>

impl<'tcx> Ty<TyCtxt<'tcx>> for Ty<'tcx>

fn new_bool(tcx: TyCtxt<'tcx>) -> Self

fn new_u8(tcx: TyCtxt<'tcx>) -> Self

fn new_infer(tcx: TyCtxt<'tcx>, infer: InferTy) -> Self

fn new_var(tcx: TyCtxt<'tcx>, vid: TyVid) -> Self

fn new_param(tcx: TyCtxt<'tcx>, param: ParamTy) -> Self

fn new_placeholder(tcx: TyCtxt<'tcx>, placeholder: PlaceholderType) -> Self

fn new_bound( interner: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundTy, ) -> Self

fn new_anon_bound( tcx: TyCtxt<'tcx>, debruijn: DebruijnIndex, var: BoundVar, ) -> Self

fn new_alias( interner: TyCtxt<'tcx>, kind: AliasTyKind, alias_ty: AliasTy<'tcx>, ) -> Self

fn new_error(interner: TyCtxt<'tcx>, guar: ErrorGuaranteed) -> Self

fn new_adt( interner: TyCtxt<'tcx>, adt_def: AdtDef<'tcx>, args: GenericArgsRef<'tcx>, ) -> Self

fn new_foreign(interner: TyCtxt<'tcx>, def_id: DefId) -> Self

fn new_dynamic( interner: TyCtxt<'tcx>, preds: &'tcx List<PolyExistentialPredicate<'tcx>>, region: Region<'tcx>, kind: DynKind, ) -> Self

fn new_coroutine( interner: TyCtxt<'tcx>, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> Self

fn new_coroutine_closure( interner: TyCtxt<'tcx>, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> Self

fn new_closure( interner: TyCtxt<'tcx>, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> Self

fn new_coroutine_witness( interner: TyCtxt<'tcx>, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> Self

fn new_ptr(interner: TyCtxt<'tcx>, ty: Self, mutbl: Mutability) -> Self

fn new_ref( interner: TyCtxt<'tcx>, region: Region<'tcx>, ty: Self, mutbl: Mutability, ) -> Self

fn new_array_with_const_len( interner: TyCtxt<'tcx>, ty: Self, len: Const<'tcx>, ) -> Self

fn new_slice(interner: TyCtxt<'tcx>, ty: Self) -> Self

fn new_tup(interner: TyCtxt<'tcx>, tys: &[Ty<'tcx>]) -> Self

fn new_tup_from_iter<It, T>(interner: TyCtxt<'tcx>, iter: It) -> T::Output

where It: Iterator<Item = T>, T: CollectAndApply<Self, Self>,

fn tuple_fields(self) -> &'tcx List<Ty<'tcx>>

fn to_opt_closure_kind(self) -> Option<ClosureKind>

fn from_closure_kind(interner: TyCtxt<'tcx>, kind: ClosureKind) -> Self

fn from_coroutine_closure_kind( interner: TyCtxt<'tcx>, kind: ClosureKind, ) -> Self

fn new_fn_def( interner: TyCtxt<'tcx>, def_id: DefId, args: GenericArgsRef<'tcx>, ) -> Self

fn new_fn_ptr(interner: TyCtxt<'tcx>, sig: Binder<'tcx, FnSig<'tcx>>) -> Self

fn new_pat(interner: TyCtxt<'tcx>, ty: Self, pat: Pattern<'tcx>) -> Self

fn new_unit(interner: TyCtxt<'tcx>) -> Self

fn new_usize(interner: TyCtxt<'tcx>) -> Self

fn discriminant_ty(self, interner: TyCtxt<'tcx>) -> Ty<'tcx>

fn async_destructor_ty(self, interner: TyCtxt<'tcx>) -> Ty<'tcx>

fn has_unsafe_fields(self) -> bool

Checks whether this type is an ADT that has unsafe fields.

fn new_projection_from_args( interner: I, def_id: <I as Interner>::DefId, args: <I as Interner>::GenericArgs, ) -> Self

fn new_projection( interner: I, def_id: <I as Interner>::DefId, args: impl IntoIterator>, ) -> Self

where <impl IntoIterator as IntoIterator>::Item: Into<<I as Interner>::GenericArg>,

fn is_ty_var(self) -> bool

fn is_floating_point(self) -> bool

fn is_integral(self) -> bool

fn is_fn_ptr(self) -> bool

fn fn_sig(self, interner: I) -> Binder<I, FnSig<I>>

fn is_known_rigid(self) -> bool

Returns true when the outermost type cannot be further normalized, resolved, or instantiated. This includes all primitive types, but also things like ADTs and trait objects, since even if their arguments or nested types may be further simplified, the outermost ty::TyKind or type constructor remains the same.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for &'tcx [InlineAsmTemplatePiece]

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for &'tcx [Span]

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for &'tcx List<PolyExistentialPredicate<'tcx>>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CanonicalVarInfos<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for &'tcx List<Const<'tcx>>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for GenericArgsRef<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for &'tcx List<LocalDefId>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for &'tcx List<PlaceElem<'tcx>>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for &'tcx List<Ty<'tcx>>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Clauses<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Adjust

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Adjustment<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AdtKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AggregateKind<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AllocId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AscribeUserType<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, O> TypeFoldable<TyCtxt<'tcx>> for AssertKind<O>

where O: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AssocItem

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AssocKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Asyncness

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AutoBorrow

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for AutoBorrowMutability

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BackwardIncompatibleDropReason

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BasicBlock

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BasicBlockData<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BasicBlocks<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BinOp

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BindingForm<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BlockMarkerId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BlockTailInfo

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Body<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BorrowKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BorrowKind

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BoundRegion

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BoundRegionKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BoundVar

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for BranchSpan

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ByRef

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Cache

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CallSource

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CanonicalUserTypeAnnotation<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CaptureInfo

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CapturedPlace<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CastKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CastKind

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Certainty

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Clause<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, T> TypeFoldable<TyCtxt<'tcx>> for ClearCrossCrate<T>

where T: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ClosureKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ClosureSizeProfileData<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ConditionId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ConditionInfo

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Const<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Const<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ConstOperand<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ConstValue<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ConstraintCategory<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CopyNonOverlapping<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CoroutineInfo<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CoroutineKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CoroutineLayout<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CoroutineSavedLocal

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CoroutineSavedTy<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CounterId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CovTerm

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CoverageInfoHi

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CoverageKind

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for CtfeProvenance

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for DecisionInfo

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for DefId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for DerivedCause<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for DropckOutlives<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for DropckOutlivesResult<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Eq<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ErrorGuaranteed

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ErrorHandled

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Expr<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ExprKind

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Expression

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ExpressionId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ExternalConstraints<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, folder: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for FakeReadCause

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for FieldIdx

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for FunctionCoverageInfo

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for GenericArg<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for GlobalId<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for HirId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Ident

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for IfExpressionCause<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ImplDerivedCause<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ImplHeader<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, N> TypeFoldable<TyCtxt<'tcx>> for ImplSource<'tcx, N>

where N: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, N> TypeFoldable<TyCtxt<'tcx>> for ImplSourceUserDefinedData<'tcx, N>

where N: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ImplSubject<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ImpliedOutlivesBounds<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InferConst

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InlineAsmMacro

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InlineAsmOperand<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InlineAsmOptions

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InlineAsmRegOrRegClass

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InlineAsmTemplatePiece

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Instance<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InstanceKind<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InstantiatedPredicates<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for InternedObligationCauseCode<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for IsConstable

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for LateParamRegion

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Local

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for LocalDecl<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for LocalDefId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for LocalInfo<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MCDCBranchSpan

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MCDCDecisionSpan

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Mapping

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MappingKind

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MatchExpressionArmCause<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MatchSource

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MentionedItem<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MirPhase

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for MirSource<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for NodeId

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for NonDivergingIntrinsic<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for NormalizationResult<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, T> TypeFoldable<TyCtxt<'tcx>> for Normalize<T>

where T: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for NotConstEvaluatable

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for NullOp<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ObligationCause<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ObligationCauseCode<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Op

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for OpaqueHiddenType<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Operand<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for OutlivesBound<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for OverflowError

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for OverloadedDeref

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ParamConst

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ParamEnv<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, T> TypeFoldable<TyCtxt<'tcx>> for ParamEnvAnd<'tcx, T>

where T: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ParamTy

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Pattern<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PatternKind<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PatternOriginExpr

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Place<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Place<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PlaceBase

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PlaceTy<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Placeholder<BoundRegion>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Placeholder<BoundTy>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Placeholder<BoundVar>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PointerCoercion

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for PredefinedOpaques<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, folder: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Predicate<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Projection<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, V, T> TypeFoldable<TyCtxt<'tcx>> for ProjectionElem<V, T>

where T: TypeFoldable<TyCtxt<'tcx>>, V: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ProjectionKind

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Promoted

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ProvePredicate<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, T> TypeFoldable<TyCtxt<'tcx>> for PseudoCanonicalInput<'tcx, T>

where T: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for QueryRegionConstraints<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, R> TypeFoldable<TyCtxt<'tcx>> for QueryResponse<'tcx, R>

where R: TypeFoldable<TyCtxt<'tcx>>,

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Region<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ReifyReason

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Res

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for RetagKind

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ReturnConstraint

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Rvalue<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Scalar

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Scope

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Size

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for SourceInfo

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for SourceScope

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for SourceScopeData<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for SourceScopeLocalData

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Span

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, T: TypeFoldable<TyCtxt<'tcx>> + Debug + Clone> TypeFoldable<TyCtxt<'tcx>> for Spanned<T>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Statement<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for StatementKind<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Subtype<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for SwitchTargets

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Symbol

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Term<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Terminator<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TerminatorKind<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitPredPrintModifiersAndPath<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitPredPrintWithBoundConstness<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitRefPrintOnlyTraitName<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitRefPrintOnlyTraitPath<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TraitRefPrintSugared<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for Ty<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for TypingEnv<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UnOp

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UnevaluatedConst<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UnifyReceiverContext<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UnwindAction

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UnwindTerminateReason

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UpvarArgs<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UpvarCapture

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UpvarId

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UpvarPath

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UserArgs<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UserSelfTy<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UserType<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UserTypeAnnotationIndex

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UserTypeKind<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UserTypeProjection

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for UserTypeProjections

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for ValTree<'tcx>

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for VarDebugInfo<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for VarDebugInfoContents<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for VarDebugInfoFragment<'tcx>

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for VariantIdx

fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F: TypeFolder<TyCtxt<'tcx>>>(self, _: &mut F) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for WellFormedLoc

fn try_fold_with<__F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, __folder: &mut __F, ) -> Result<Self, __F::Error>

The entry point for folding. To fold a value t with a folder f call: t.try_fold_with(f).

fn fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.

impl<'tcx, F, G, H> TypeFolder<TyCtxt<'tcx>> for BottomUpFolder<'tcx, F, G, H>

where F: FnMut(Ty<'tcx>) -> Ty<'tcx>, G: FnMut(Region<'tcx>) -> Region<'tcx>, H: FnMut(Const<'tcx>) -> Const<'tcx>,

fn cx(&self) -> TyCtxt<'tcx>

fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx>

fn fold_region(&mut self, r: Region<'tcx>) -> Region<'tcx>

fn fold_const(&mut self, ct: Const<'tcx>) -> Const<'tcx>

fn fold_binder<T>(&mut self, t: Binder<I, T>) -> Binder<I, T>

where T: TypeFoldable<I>,

fn fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> <I as Interner>::Predicate

impl<'tcx, D> TypeFolder<TyCtxt<'tcx>> for BoundVarReplacer<'tcx, D>

where D: BoundVarReplacerDelegate<'tcx>,

fn cx(&self) -> TyCtxt<'tcx>

fn fold_binder<T: TypeFoldable<TyCtxt<'tcx>>>( &mut self, t: Binder<'tcx, T>, ) -> Binder<'tcx, T>

fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx>

fn fold_region(&mut self, r: Region<'tcx>) -> Region<'tcx>

fn fold_const(&mut self, ct: Const<'tcx>) -> Const<'tcx>

fn fold_predicate(&mut self, p: Predicate<'tcx>) -> Predicate<'tcx>

impl<'tcx> TypeFolder<TyCtxt<'tcx>> for NormalizeAfterErasingRegionsFolder<'tcx>

fn cx(&self) -> TyCtxt<'tcx>

fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx>

fn fold_const(&mut self, c: Const<'tcx>) -> Const<'tcx>

fn fold_binder<T>(&mut self, t: Binder<I, T>) -> Binder<I, T>

where T: TypeFoldable<I>,

fn fold_region(&mut self, r: <I as Interner>::Region) -> <I as Interner>::Region

fn fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> <I as Interner>::Predicate

impl<'tcx> TypeFolder<TyCtxt<'tcx>> for OpaqueTypeExpander<'tcx>

fn cx(&self) -> TyCtxt<'tcx>

fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx>

fn fold_predicate(&mut self, p: Predicate<'tcx>) -> Predicate<'tcx>

fn fold_binder<T>(&mut self, t: Binder<I, T>) -> Binder<I, T>

where T: TypeFoldable<I>,

fn fold_region(&mut self, r: <I as Interner>::Region) -> <I as Interner>::Region

fn fold_const(&mut self, c: <I as Interner>::Const) -> <I as Interner>::Const

impl<'tcx> TypeFolder<TyCtxt<'tcx>> for RegionEraserVisitor<'tcx>

fn cx(&self) -> TyCtxt<'tcx>

fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx>

fn fold_binder<T>(&mut self, t: Binder<'tcx, T>) -> Binder<'tcx, T>

where T: TypeFoldable<TyCtxt<'tcx>>,

fn fold_region(&mut self, r: Region<'tcx>) -> Region<'tcx>

fn fold_const(&mut self, c: <I as Interner>::Const) -> <I as Interner>::Const

fn fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> <I as Interner>::Predicate

impl<'a, 'tcx> TypeFolder<TyCtxt<'tcx>> for RegionFolder<'a, 'tcx>

fn cx(&self) -> TyCtxt<'tcx>

fn fold_binder<T: TypeFoldable<TyCtxt<'tcx>>>( &mut self, t: Binder<'tcx, T>, ) -> Binder<'tcx, T>

fn fold_ty(&mut self, t: Ty<'tcx>) -> Ty<'tcx>

fn fold_region(&mut self, r: Region<'tcx>) -> Region<'tcx>

fn fold_const(&mut self, c: <I as Interner>::Const) -> <I as Interner>::Const

fn fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> <I as Interner>::Predicate

impl<'tcx> TypeFolder<TyCtxt<'tcx>> for ReverseMapper<'tcx>

fn cx(&self) -> TyCtxt<'tcx>

fn fold_region(&mut self, r: Region<'tcx>) -> Region<'tcx>

fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx>

fn fold_const(&mut self, ct: Const<'tcx>) -> Const<'tcx>

fn fold_binder<T>(&mut self, t: Binder<I, T>) -> Binder<I, T>

where T: TypeFoldable<I>,

fn fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> <I as Interner>::Predicate

impl<'tcx> TypeFolder<TyCtxt<'tcx>> for WeakAliasTypeExpander<'tcx>

fn cx(&self) -> TyCtxt<'tcx>

fn fold_ty(&mut self, ty: Ty<'tcx>) -> Ty<'tcx>

fn fold_const(&mut self, ct: Const<'tcx>) -> Const<'tcx>

fn fold_binder<T>(&mut self, t: Binder<I, T>) -> Binder<I, T>

where T: TypeFoldable<I>,

fn fold_region(&mut self, r: <I as Interner>::Region) -> <I as Interner>::Region

fn fold_predicate( &mut self, p: <I as Interner>::Predicate, ) -> <I as Interner>::Predicate

impl<'tcx> TypeSuperFoldable<TyCtxt<'tcx>> for Const<'tcx>

fn try_super_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

Provides a default fold for a recursive type of interest. This should only be called within TypeFolder methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyFolder::try_fold_ty(ty), it is valid to call ty.try_super_fold_with(self), but any other folding should be done with xyz.try_fold_with(self).

fn super_fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_super_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_super_fold_with.

impl<'tcx> TypeSuperFoldable<TyCtxt<'tcx>> for Predicate<'tcx>

fn try_super_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

Provides a default fold for a recursive type of interest. This should only be called within TypeFolder methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyFolder::try_fold_ty(ty), it is valid to call ty.try_super_fold_with(self), but any other folding should be done with xyz.try_fold_with(self).

fn super_fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_super_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_super_fold_with.

impl<'tcx> TypeSuperFoldable<TyCtxt<'tcx>> for Ty<'tcx>

fn try_super_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, folder: &mut F, ) -> Result<Self, F::Error>

Provides a default fold for a recursive type of interest. This should only be called within TypeFolder methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyFolder::try_fold_ty(ty), it is valid to call ty.try_super_fold_with(self), but any other folding should be done with xyz.try_fold_with(self).

fn super_fold_with<F>(self, folder: &mut F) -> Self

where F: TypeFolder<I>,

A convenient alternative to try_super_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_super_fold_with.

impl<'tcx> TypeSuperVisitable<TyCtxt<'tcx>> for Clauses<'tcx>

fn super_visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, visitor: &mut V, ) -> V::Result

Provides a default visit for a recursive type of interest. This should only be called within TypeVisitor methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyVisitor::visit_ty(ty), it is valid to call ty.super_visit_with(self), but any other visiting should be done with xyz.visit_with(self).

impl<'tcx> TypeSuperVisitable<TyCtxt<'tcx>> for Const<'tcx>

fn super_visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, visitor: &mut V, ) -> V::Result

Provides a default visit for a recursive type of interest. This should only be called within TypeVisitor methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyVisitor::visit_ty(ty), it is valid to call ty.super_visit_with(self), but any other visiting should be done with xyz.visit_with(self).

impl<'tcx> TypeSuperVisitable<TyCtxt<'tcx>> for Predicate<'tcx>

fn super_visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, visitor: &mut V, ) -> V::Result

Provides a default visit for a recursive type of interest. This should only be called within TypeVisitor methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyVisitor::visit_ty(ty), it is valid to call ty.super_visit_with(self), but any other visiting should be done with xyz.visit_with(self).

impl<'tcx> TypeSuperVisitable<TyCtxt<'tcx>> for Ty<'tcx>

fn super_visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, visitor: &mut V, ) -> V::Result

Provides a default visit for a recursive type of interest. This should only be called within TypeVisitor methods, when a non-custom traversal is desired for the value of the type of interest passed to that method. For example, in MyVisitor::visit_ty(ty), it is valid to call ty.super_visit_with(self), but any other visiting should be done with xyz.visit_with(self).

impl<'tcx, T: TypeVisitable<TyCtxt<'tcx>>> TypeVisitable<TyCtxt<'tcx>> for &'tcx List<T>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Clauses<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Adjust

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Adjustment<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AdtDef<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, _visitor: &mut V, ) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AdtKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AggregateKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AllocId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AscribeUserType<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Ascription<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, O> TypeVisitable<TyCtxt<'tcx>> for AssertKind<O>

where O: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AssocItem

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AssocKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Asyncness

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AutoBorrow

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for AutoBorrowMutability

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BackwardIncompatibleDropReason

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BasicBlock

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BasicBlockData<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BasicBlocks<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BinOp

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BindingForm<'tcx>

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BlockMarkerId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BlockTailInfo

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Body<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BorrowKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BorrowKind

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BoundRegion

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BoundRegionKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BoundVar

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for BranchSpan

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ByRef

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Cache

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CallSource

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CanonicalUserTypeAnnotation<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CaptureInfo

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CapturedPlace<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CastKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CastKind

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Certainty

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Clause<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, T> TypeVisitable<TyCtxt<'tcx>> for ClearCrossCrate<T>

where T: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ClosureKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ClosureSizeProfileData<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ConditionId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ConditionInfo

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Const<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Const<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ConstOperand<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ConstValue<'tcx>

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ConstraintCategory<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CopyNonOverlapping<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CoroutineInfo<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CoroutineKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CoroutineLayout<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CoroutineSavedLocal

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CoroutineSavedTy<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CounterId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CovTerm

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CoverageInfoHi

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CoverageKind

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for CtfeProvenance

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for DecisionInfo

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for DefId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for DerivedCause<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for DropckOutlives<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for DropckOutlivesResult<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Eq<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ErrorGuaranteed

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ErrorHandled

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Expr<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ExprKind

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Expression

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ExpressionId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ExternalConstraints<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for FakeReadCause

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for FieldIdx

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for FieldPat<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for FunctionCoverageInfo

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for GenericArg<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for GlobalId<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for HirId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Ident

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for IfExpressionCause<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ImplDerivedCause<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ImplHeader<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, N> TypeVisitable<TyCtxt<'tcx>> for ImplSource<'tcx, N>

where N: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, N> TypeVisitable<TyCtxt<'tcx>> for ImplSourceUserDefinedData<'tcx, N>

where N: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ImplSubject<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ImpliedOutlivesBounds<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InferConst

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>( &self, _visitor: &mut V, ) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InlineAsmMacro

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InlineAsmOperand<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InlineAsmOptions

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InlineAsmRegOrRegClass

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InlineAsmTemplatePiece

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Instance<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InstanceKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InstantiatedPredicates<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for InternedObligationCauseCode<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for IsConstable

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for LateParamRegion

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Local

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for LocalDecl<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for LocalDefId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for LocalInfo<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MCDCBranchSpan

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MCDCDecisionSpan

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Mapping

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MappingKind

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MatchExpressionArmCause<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MatchSource

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MentionedItem<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MirPhase

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for MirSource<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for NodeId

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for NonDivergingIntrinsic<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for NormalizationResult<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, T> TypeVisitable<TyCtxt<'tcx>> for Normalize<T>

where T: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for NotConstEvaluatable

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for NullOp<'tcx>

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ObligationCause<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ObligationCauseCode<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Op

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for OpaqueHiddenType<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Operand<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for OutlivesBound<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for OverflowError

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for OverloadedDeref

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ParamConst

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ParamEnv<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, T> TypeVisitable<TyCtxt<'tcx>> for ParamEnvAnd<'tcx, T>

where T: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ParamTy

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Pat<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PatKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PatRange<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PatRangeBoundary<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Pattern<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PatternKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PatternOriginExpr

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Place<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Place<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PlaceBase

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PlaceTy<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Placeholder<BoundRegion>

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Placeholder<BoundTy>

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Placeholder<BoundVar>

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PointerCoercion

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PredefinedOpaques<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Predicate<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Projection<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, V, T> TypeVisitable<TyCtxt<'tcx>> for ProjectionElem<V, T>

where T: TypeVisitable<TyCtxt<'tcx>>, V: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ProjectionKind

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Promoted

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ProvePredicate<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, T> TypeVisitable<TyCtxt<'tcx>> for PseudoCanonicalInput<'tcx, T>

where T: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for QueryRegionConstraints<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, R> TypeVisitable<TyCtxt<'tcx>> for QueryResponse<'tcx, R>

where R: TypeVisitable<TyCtxt<'tcx>>,

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Region<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ReifyReason

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Res

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for RetagKind

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ReturnConstraint

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Rvalue<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Scalar

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Scope

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SelectionCandidate<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SelectionError<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SignatureMismatchData<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Size

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SourceInfo

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SourceScope

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SourceScopeData<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SourceScopeLocalData

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Span

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx, T: TypeVisitable<TyCtxt<'tcx>> + Debug + Clone> TypeVisitable<TyCtxt<'tcx>> for Spanned<T>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Statement<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for StatementKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Subtype<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for SwitchTargets

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Symbol

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Term<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Terminator<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TerminatorKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TraitPredPrintModifiersAndPath<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TraitPredPrintWithBoundConstness<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TraitRefPrintOnlyTraitName<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TraitRefPrintOnlyTraitPath<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TraitRefPrintSugared<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for Ty<'tcx>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TyAndLayout<'tcx, Ty<'tcx>>

fn visit_with<V: TypeVisitor<TyCtxt<'tcx>>>(&self, visitor: &mut V) -> V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for TypingEnv<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UnOp

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UnevaluatedConst<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UnifyReceiverContext<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UnwindAction

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UnwindTerminateReason

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UpvarArgs<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UpvarCapture

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UpvarId

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UpvarPath

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UserArgs<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UserSelfTy<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UserType<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UserTypeAnnotationIndex

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UserTypeKind<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UserTypeProjection

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for UserTypeProjections

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for ValTree<'tcx>

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for VarDebugInfo<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for VarDebugInfoContents<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for VarDebugInfoFragment<'tcx>

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for VariantIdx

fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for WellFormedLoc

fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result

The entry point for visiting. To visit a value t with a visitor v call: t.visit_with(v).

impl<'tcx> TypeVisitor<TyCtxt<'tcx>> for IsSuggestableVisitor<'tcx>

type Result = ControlFlow<()>

fn visit_ty(&mut self, t: Ty<'tcx>) -> Self::Result

fn visit_const(&mut self, c: Const<'tcx>) -> Self::Result

fn visit_binder<T>(&mut self, t: &Binder<I, T>) -> Self::Result

where T: TypeVisitable<I>,

fn visit_region(&mut self, r: <I as Interner>::Region) -> Self::Result

fn visit_predicate(&mut self, p: <I as Interner>::Predicate) -> Self::Result

fn visit_clauses(&mut self, p: <I as Interner>::Clauses) -> Self::Result

fn visit_error( &mut self, _guar: <I as Interner>::ErrorGuaranteed, ) -> Self::Result

impl<'tcx> TypeVisitor<TyCtxt<'tcx>> for LateBoundRegionsCollector

fn visit_binder<T: TypeVisitable<TyCtxt<'tcx>>>(&mut self, t: &Binder<'tcx, T>)

fn visit_ty(&mut self, t: Ty<'tcx>)

fn visit_const(&mut self, c: Const<'tcx>)

fn visit_region(&mut self, r: Region<'tcx>)

type Result = ()

fn visit_predicate(&mut self, p: <I as Interner>::Predicate) -> Self::Result

fn visit_clauses(&mut self, p: <I as Interner>::Clauses) -> Self::Result

fn visit_error( &mut self, _guar: <I as Interner>::ErrorGuaranteed, ) -> Self::Result

impl<'tcx> TypeVisitor<TyCtxt<'tcx>> for MaxUniverse

fn visit_ty(&mut self, t: Ty<'tcx>)

fn visit_const(&mut self, c: Const<'tcx>)

fn visit_region(&mut self, r: Region<'tcx>)

type Result = ()

fn visit_binder<T>(&mut self, t: &Binder<I, T>) -> Self::Result

where T: TypeVisitable<I>,

fn visit_predicate(&mut self, p: <I as Interner>::Predicate) -> Self::Result

fn visit_clauses(&mut self, p: <I as Interner>::Clauses) -> Self::Result

fn visit_error( &mut self, _guar: <I as Interner>::ErrorGuaranteed, ) -> Self::Result

impl<'tcx> Tys<TyCtxt<'tcx>> for &'tcx List<Ty<'tcx>>

fn inputs(self) -> &'tcx [Ty<'tcx>]

fn output(self) -> Ty<'tcx>

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, ClauseKind<TyCtxt<'tcx>>>> for Clause<'tcx>

fn upcast_from(from: Binder<'tcx, ClauseKind<'tcx>>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, ClauseKind<TyCtxt<'tcx>>>> for Predicate<'tcx>

fn upcast_from(from: Binder<'tcx, ClauseKind<'tcx>>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Region<'tcx>>>> for Predicate<'tcx>

fn upcast_from( from: PolyRegionOutlivesPredicate<'tcx>, tcx: TyCtxt<'tcx>, ) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, PredicateKind<TyCtxt<'tcx>>>> for Predicate<'tcx>

fn upcast_from( from: Binder<'tcx, PredicateKind<'tcx>>, tcx: TyCtxt<'tcx>, ) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, ProjectionPredicate<TyCtxt<'tcx>>>> for Clause<'tcx>

fn upcast_from(from: PolyProjectionPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, ProjectionPredicate<TyCtxt<'tcx>>>> for Predicate<'tcx>

fn upcast_from(from: PolyProjectionPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, TraitPredicate<TyCtxt<'tcx>>>> for Clause<'tcx>

fn upcast_from(from: PolyTraitPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, TraitPredicate<TyCtxt<'tcx>>>> for Predicate<'tcx>

fn upcast_from(from: PolyTraitPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, TraitRef<TyCtxt<'tcx>>>> for PolyTraitPredicate<'tcx>

fn upcast_from(from: Binder<'tcx, TraitRef<'tcx>>, _tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, TraitRef<TyCtxt<'tcx>>>> for Clause<'tcx>

fn upcast_from(from: Binder<'tcx, TraitRef<'tcx>>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Binder<TyCtxt<'tcx>, TraitRef<TyCtxt<'tcx>>>> for Predicate<'tcx>

fn upcast_from(from: Binder<'tcx, TraitRef<'tcx>>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, Clause<'tcx>> for Predicate<'tcx>

fn upcast_from(from: Clause<'tcx>, _tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, ClauseKind<TyCtxt<'tcx>>> for Clause<'tcx>

fn upcast_from(from: ClauseKind<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, ClauseKind<TyCtxt<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: ClauseKind<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, NormalizesTo<TyCtxt<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: NormalizesTo<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Region<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: RegionOutlivesPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, OutlivesPredicate<TyCtxt<'tcx>, Ty<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: TypeOutlivesPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, PredicateKind<TyCtxt<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: PredicateKind<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, ProjectionPredicate<TyCtxt<'tcx>>> for Clause<'tcx>

fn upcast_from(from: ProjectionPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, ProjectionPredicate<TyCtxt<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: ProjectionPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, TraitPredicate<TyCtxt<'tcx>>> for Clause<'tcx>

fn upcast_from(from: TraitPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, TraitPredicate<TyCtxt<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: TraitPredicate<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, TraitRef<TyCtxt<'tcx>>> for Clause<'tcx>

fn upcast_from(from: TraitRef<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> UpcastFrom<TyCtxt<'tcx>, TraitRef<TyCtxt<'tcx>>> for Predicate<'tcx>

fn upcast_from(from: TraitRef<'tcx>, tcx: TyCtxt<'tcx>) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for &[Variance]

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for Binder<'_, FnSig<'_>>

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for EarlyBinder<'_, Binder<'_, FnSig<'_>>>

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for EarlyBinder<'_, Ty<'_>>

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for Representability

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for Result<EarlyBinder<'_, Ty<'_>>, CyclePlaceholder>

fn from_cycle_error( _tcx: TyCtxt<'tcx>, _: &CycleError, guar: ErrorGuaranteed, ) -> Self

impl<'tcx, T> Value<TyCtxt<'tcx>> for Result<T, &LayoutError<'_>>

fn from_cycle_error( tcx: TyCtxt<'tcx>, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for SymbolName<'_>

fn from_cycle_error( tcx: TyCtxt<'tcx>, _: &CycleError, _guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Value<TyCtxt<'tcx>> for Ty<'_>

fn from_cycle_error( tcx: TyCtxt<'tcx>, _: &CycleError, guar: ErrorGuaranteed, ) -> Self

impl<'tcx> Copy for TyCtxt<'tcx>

impl DynSend for TyCtxt<'_>

impl DynSync for TyCtxt<'_>

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 8 bytes