Crate hir_ty

source ·
Expand description

The type system. We currently use this to infer types for completion, hover information and various assists.

Re-exports§

Modules§

  • autoderef
    In certain situations, rust automatically inserts derefs as necessary: for example, field accesses foo.bar still work when foo is actually a reference to a type with the field bar. This is an approximation of the logic in rustc (which lives in rustc_hir_analysis/check/autoderef.rs).
  • consteval
    Constant evaluation details
  • db
    The home of HirDatabase, which is the Salsa database containing all the type inference-related queries.
  • diagnostics
    Type inference-based diagnostics.
  • display
    The HirDisplay trait, which serves two purposes: Turning various bits from HIR back into source code, and just displaying them for debugging/testing purposes.
  • dyn_compatibility
    Compute the dyn-compatibility of a trait
  • lang_items
    Functions to detect special lang items
  • layout
    Compute the binary representation of a type
  • method_resolution
    This module is concerned with finding methods that a given type provides. For details about how this works in rustc, see the method lookup page in the rustc guide and the corresponding code mostly in rustc_hir_analysis/check/method/probe.rs.
  • mir
    MIR definitions and implementation
  • primitive
    A few helper functions for dealing with primitives.
  • traits
    Trait solving using Chalk.

Macros§

Structs§

  • Adjustment
    Represents coercing a value to a different type of value.
  • AdtId
    The id for an Abstract Data Type (i.e. structs, unions and enums).
  • BoundVar
    Identifies a particular bound variable within a binder. Variables are identified by the combination of a DebruijnIndex, which identifies the binder, and an index within that binder.
  • CallableSig
    A function signature as seen by type inference: Several parameter types and one return type.
  • CapturedItem
  • ComplexMemoryMap
  • DebruijnIndex
    References the binder at the given depth. The index is a de Bruijn index, so it counts back through the in-scope binders, with 0 being the innermost binder. This is used in impls and the like. For example, if we had a rule like for<T> { (T: Clone) :- (T: Copy) }, then T would be represented as a BoundVar(0) (as the for is the innermost binder).
  • FnSubst
    A wrapper for the substs on a Fn.
  • ImplTrait
  • ImplTraits
  • InferenceResult
    The result of type inference: A mapping from expressions and patterns to types.
  • Interner
  • OverloadedDeref
    An overloaded autoderef step, representing a Deref(Mut)::deref(_mut) call, with the signature &'a T -> &'a U or &'a mut T -> &'a mut U. The target type is U in both cases, with the region and mutability being those shared by both the receiver and the returned reference.
  • TyBuilder
    This is a builder for Ty or anything that needs a Substitution.
  • TyLoweringContext

Enums§

Traits§

  • Cast
    The Cast trait is used to make annoying upcasts between logically equivalent types that imply wrappers. For example, one could convert a DomainGoal into a Goal by doing:
  • DynTyExt
  • ProjectionTyExt
  • TraitRefExt
  • TyExt
  • TypeSuperVisitable
    For types where “visit” invokes a callback on the visitor, the TypeSuperVisitable trait captures the recursive behavior that visits all the contents of the type.
  • TypeVisitable
    Applies the given visitor to a value, producing a visited result of type TypeVisitor::Result.
  • TypeVisitor
    A “visitor” recursively folds some term – that is, some bit of IR, such as a Goal, and computes a value as a result.

Functions§

Type Aliases§