Struct rustc_middle::infer::canonical::CanonicalVarValues

pub struct CanonicalVarValues<'tcx> {
    pub var_values: IndexVec<BoundVar, GenericArg<'tcx>>,
}

A set of values corresponding to the canonical variables from some Canonical. You can give these values to canonical_value.substitute to substitute them into the canonical value at the right places.

When you canonicalize a value V, you get back one of these vectors with the original values that were replaced by canonical variables. You will need to supply it later to instantiate the canonicalized query response.

Fields

var_values: IndexVec<BoundVar, GenericArg<'tcx>>

Implementations

impl<'tcx> CanonicalVarValues<'tcx>

pub fn len(&self) -> usize

pub fn make_identity(&self, tcx: TyCtxt<'tcx>) -> Self

Makes an identity substitution from this one: each bound var is matched to the same bound var, preserving the original kinds. For example, if we have: self.var_values == [Type(u32), Lifetime('a), Type(u64)] we’ll return a substitution subst with: subst.var_values == [Type(^0), Lifetime(^1), Type(^2)].

Trait Implementations

impl<'tcx> Clone for CanonicalVarValues<'tcx>

fn clone(&self) -> CanonicalVarValues<'tcx>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'tcx> Debug for CanonicalVarValues<'tcx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'tcx, __D: TyDecoder<'tcx>> Decodable<__D> for CanonicalVarValues<'tcx>

fn decode(__decoder: &mut __D) -> Result<Self, <__D as Decoder>::Error>

impl<'tcx, __E: TyEncoder<'tcx>> Encodable<__E> for CanonicalVarValues<'tcx>

fn encode(&self, __encoder: &mut __E) -> Result<(), <__E as Encoder>::Error>

impl<'tcx> Eq for CanonicalVarValues<'tcx>

impl<'tcx> Hash for CanonicalVarValues<'tcx>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for CanonicalVarValues<'tcx>

fn hash_stable(
    &self,
    __hcx: &mut StableHashingContext<'__ctx>,
    __hasher: &mut StableHasher
)

impl<'tcx> Index<BoundVar> for CanonicalVarValues<'tcx>

type Output = GenericArg<'tcx>

The returned type after indexing.

fn index(&self, value: BoundVar) -> &GenericArg<'tcx>

Performs the indexing (container[index]) operation.

impl<'a, 'tcx> IntoIterator for &'a CanonicalVarValues<'tcx>

type Item = GenericArg<'tcx>

The type of the elements being iterated over.

type IntoIter = Cloned<Iter<'a, GenericArg<'tcx>>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'tcx, '__lifted> Lift<'__lifted> for CanonicalVarValues<'tcx>

type Lifted = CanonicalVarValues<'__lifted>

fn lift_to_tcx(
    self,
    __tcx: TyCtxt<'__lifted>
) -> Option<CanonicalVarValues<'__lifted>>

impl<'tcx> PartialEq<CanonicalVarValues<'tcx>> for CanonicalVarValues<'tcx>

fn eq(&self, other: &CanonicalVarValues<'tcx>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &CanonicalVarValues<'tcx>) -> bool

This method tests for !=.

impl<'tcx> StructuralEq for CanonicalVarValues<'tcx>

impl<'tcx> StructuralPartialEq for CanonicalVarValues<'tcx>

impl<'tcx> TypeFoldable<'tcx> for CanonicalVarValues<'tcx>

fn super_fold_with<__F: TypeFolder<'tcx>>(self, __folder: &mut __F) -> Self

fn super_visit_with<__F: TypeVisitor<'tcx>>(
    &self,
    __folder: &mut __F
) -> ControlFlow<__F::BreakTy>

fn fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self

fn visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::BreakTy>

fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool

Returns true if self has any late-bound regions that are either bound by binder or bound by some binder outside of binder. If binder is ty::INNERMOST, this indicates whether there are any late-bound regions that appear free.

fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool

Returns true if this self has any regions that escape binder (and hence are not bound by it).

fn has_escaping_bound_vars(&self) -> bool

fn has_type_flags(&self, flags: TypeFlags) -> bool

fn has_projections(&self) -> bool

fn has_opaque_types(&self) -> bool

fn references_error(&self) -> bool

fn has_param_types_or_consts(&self) -> bool

fn has_infer_regions(&self) -> bool

fn has_infer_types(&self) -> bool

fn has_infer_types_or_consts(&self) -> bool

fn needs_infer(&self) -> bool

fn has_placeholders(&self) -> bool

fn needs_subst(&self) -> bool

fn has_free_regions(&self) -> bool

“Free” regions in this context means that it has any region that is not (a) erased or (b) late-bound.

fn has_erased_regions(&self) -> bool

fn has_erasable_regions(&self) -> bool

True if there are any un-erased free regions.

fn is_global(&self) -> bool

Indicates whether this value references only ‘global’ generic parameters that are the same regardless of what fn we are in. This is used for caching.

fn has_late_bound_regions(&self) -> bool

True if there are any late-bound regions

fn still_further_specializable(&self) -> bool

Indicates whether this value still has parameters/placeholders/inference variables which could be replaced later, in a way that would change the results of impl specialization.