Crate rustc_type_ir
source ·Re-exports
Modules
- debug 🔒
- flags 🔒
- A folding traversal mechanism for complex data structures that contain type information.
- interner 🔒
- macros 🔒
- A visiting traversal mechanism for complex data structures that contain type information.
Structs
- A “canonicalized” type
Vis one where all free inference variables have been rewritten to “canonical vars”. These are numbered starting from 0 in order of first appearance. - A De Bruijn index is a standard means of representing regions (and perhaps later types) in a higher-ranked setting. In particular, imagine a type like this:
- Flags that we track on types. These flags are propagated upwards through the type during type construction, so that we can quickly check whether the type has various kinds of types in it without recursing over the type itself.
- “Universes” are used during type- and trait-checking in the presence of
for<..>binders to control what sets of names are visible. Universes are arranged into a tree: the root universe contains names that are always visible. Each child then adds a new set of names that are visible, in addition to those of its parent. We say that the child universe “extends” the parent universe with new names.
Enums
- A clause is something that can appear in where bounds or be inferred by implied bounds.
- Represents a constant in Rust.
- Representation of regions. Note that the NLL checker uses a distinct representation of regions. For this reason, it internally replaces all the regions with inference variables – the index of the variable is then used to index into internal NLL data structures. See
rustc_const_eval::borrow_checkmodule for more information.
Constants
Traits
- Imagine you have a function
F: FnOnce(&[T]) -> R, plus an iteratoriterthat producesTitems. You could combine them withf(&iter.collect::<Vec<_>>()), but this requires allocating memory for theVec. - Needed so we can use #[derive(HashStable_Generic)]