Struct rustc_middle::ty::list::List

#[repr(C)]
pub struct List<T> {
    len: usize,
    data: [T; 0],
    opaque: OpaqueListContents,
}

A wrapper for slices with the additional invariant that the slice is interned and no other slice with the same contents can exist in the same context. This means we can use pointer for both equality comparisons and hashing.

Unlike slices, the types contained in List are expected to be Copy and iterating over a List returns T instead of a reference.

Note: Slice was already taken by the Ty.

Fields

len: usize

data: [T; 0]

opaque: OpaqueListContents

Implementations

impl<'a, 'tcx> List<GenericArg<'tcx>>

pub fn as_closure(&'a self) -> ClosureSubsts<'a>

Interpret these substitutions as the substitutions of a closure type. Closure substitutions have a particular structure controlled by the compiler that encodes information like the signature and closure kind; see ty::ClosureSubsts struct for more comments.

pub fn as_generator(&'tcx self) -> GeneratorSubsts<'tcx>

Interpret these substitutions as the substitutions of a generator type. Generator substitutions have a particular structure controlled by the compiler that encodes information like the signature and generator kind; see ty::GeneratorSubsts struct for more comments.

pub fn identity_for_item(tcx: TyCtxt<'tcx>, def_id: DefId) -> SubstsRef<'tcx>

Creates an InternalSubsts that maps each generic parameter to itself.

pub fn for_item<F>(
    tcx: TyCtxt<'tcx>,
    def_id: DefId,
    mk_kind: F
) -> SubstsRef<'tcx> where
    F: FnMut(&GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, 

Creates an InternalSubsts for generic parameter definitions, by calling closures to obtain each kind. The closures get to observe the InternalSubsts as they’re being built, which can be used to correctly substitute defaults of generic parameters.

pub fn extend_to<F>(
    &self,
    tcx: TyCtxt<'tcx>,
    def_id: DefId,
    mk_kind: F
) -> SubstsRef<'tcx> where
    F: FnMut(&GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, 

pub fn fill_item<F>(
    substs: &mut SmallVec<[GenericArg<'tcx>; 8]>,
    tcx: TyCtxt<'tcx>,
    defs: &Generics,
    mk_kind: &mut F
) where
    F: FnMut(&GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, 

pub fn fill_single<F>(
    substs: &mut SmallVec<[GenericArg<'tcx>; 8]>,
    defs: &Generics,
    mk_kind: &mut F
) where
    F: FnMut(&GenericParamDef, &[GenericArg<'tcx>]) -> GenericArg<'tcx>, 

pub fn is_noop(&self) -> bool

pub fn types(&'a self) -> impl DoubleEndedIterator<Item = Ty<'tcx>> + 'a

pub fn regions(&'a self) -> impl DoubleEndedIterator<Item = Region<'tcx>> + 'a

pub fn consts(
    &'a self
) -> impl DoubleEndedIterator<Item = &'tcx Const<'tcx>> + 'a

pub fn non_erasable_generics(
    &'a self
) -> impl DoubleEndedIterator<Item = GenericArgKind<'tcx>> + 'a

pub fn type_at(&self, i: usize) -> Ty<'tcx>

pub fn region_at(&self, i: usize) -> Region<'tcx>

pub fn const_at(&self, i: usize) -> &'tcx Const<'tcx>

pub fn type_for_def(&self, def: &GenericParamDef) -> GenericArg<'tcx>

pub fn rebase_onto(
    &self,
    tcx: TyCtxt<'tcx>,
    source_ancestor: DefId,
    target_substs: SubstsRef<'tcx>
) -> SubstsRef<'tcx>

Transform from substitutions for a child of source_ancestor (e.g., a trait or impl) to substitutions for the same child in a different item, with target_substs as the base for the target impl/trait, with the source child-specific parameters (e.g., method parameters) on top of that base.

For example given:

trait X<S> { fn f<T>(); }
impl<U> X<U> for U { fn f<V>() {} }

• If self is [Self, S, T]: the identity substs of f in the trait.
• If source_ancestor is the def_id of the trait.
• If target_substs is [U], the substs for the impl.
• Then we will return [U, T], the subst for f in the impl that are needed for it to match the trait.

pub fn truncate_to(
    &self,
    tcx: TyCtxt<'tcx>,
    generics: &Generics
) -> SubstsRef<'tcx>

impl<T: Copy> List<T>

pub(super) fn from_arena<'tcx>(
    arena: &'tcx Arena<'tcx>,
    slice: &[T]
) -> &'tcx List<T>

pub fn iter(&self) -> Copied<Iter<'_, T>>

impl<T> List<T>

pub fn empty<'a>() -> &'a List<T>

impl<'tcx> List<Binder<'tcx, ExistentialPredicate<'tcx>>>

pub fn principal(&self) -> Option<Binder<'tcx, ExistentialTraitRef<'tcx>>>

Returns the “principal DefId” of this set of existential predicates.

A Rust trait object type consists (in addition to a lifetime bound) of a set of trait bounds, which are separated into any number of auto-trait bounds, and at most one non-auto-trait bound. The non-auto-trait bound is called the “principal” of the trait object.

Only the principal can have methods or type parameters (because auto traits can have neither of them). This is important, because it means the auto traits can be treated as an unordered set (methods would force an order for the vtable, while relating traits with type parameters without knowing the order to relate them in is a rather non-trivial task).

For example, in the trait object dyn fmt::Debug + Sync, the principal bound is Some(fmt::Debug), while the auto-trait bounds are the set {Sync}.

It is also possible to have a “trivial” trait object that consists only of auto traits, with no principal - for example, dyn Send + Sync. In that case, the set of auto-trait bounds is {Send, Sync}, while there is no principal. These trait objects have a “trivial” vtable consisting of just the size, alignment, and destructor.

pub fn principal_def_id(&self) -> Option<DefId>

pub fn projection_bounds<'a>(
    &'a self
) -> impl Iterator<Item = Binder<'tcx, ExistentialProjection<'tcx>>> + 'a

pub fn auto_traits<'a>(&'a self) -> impl Iterator<Item = DefId> + 'a

Trait Implementations

impl<T> AsRef<[T]> for List<T>

fn as_ref(&self) -> &[T]

Performs the conversion.

impl<T: Debug> Debug for List<T>

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

Formats the value using the given formatter.

impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for &'tcx List<Ty<'tcx>>

fn decode(decoder: &mut D) -> Result<Self, D::Error>

impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for &'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>

fn decode(decoder: &mut D) -> Result<Self, D::Error>

impl<'tcx, D: TyDecoder<'tcx>> Decodable<D> for &'tcx List<BoundVariableKind>

fn decode(decoder: &mut D) -> Result<Self, D::Error>

impl<T> Deref for List<T>

type Target = [T]

The resulting type after dereferencing.

fn deref(&self) -> &[T]

Dereferences the value.

impl<'tcx> Display for &'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>

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

Formats the value using the given formatter.

impl<'tcx> Display for &'tcx List<Ty<'tcx>>

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

Formats the value using the given formatter.

impl<S: Encoder, T: Encodable<S>> Encodable<S> for List<T>

fn encode(&self, s: &mut S) -> Result<(), S::Error>

impl<S: Encoder, T: Encodable<S>> Encodable<S> for &List<T>

fn encode(&self, s: &mut S) -> Result<(), S::Error>

impl<T> Hash for List<T>

fn hash<H: Hasher>(&self, s: &mut H)

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'a, 'tcx, T> HashStable<StableHashingContext<'a>> for &'tcx List<T> where
    T: HashStable<StableHashingContext<'a>>, 

fn hash_stable(
    &self,
    hcx: &mut StableHashingContext<'a>,
    hasher: &mut StableHasher
)

impl<'a, T: Copy> IntoIterator for &'a List<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = Copied<Iter<'a, T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, 'tcx> Lift<'tcx> for &'a List<Ty<'a>>

type Lifted = &'tcx List<Ty<'tcx>>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<'tcx> for &'a List<Binder<'a, ExistentialPredicate<'a>>>

type Lifted = &'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<'tcx> for &'a List<Predicate<'a>>

type Lifted = &'tcx List<Predicate<'tcx>>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<'tcx> for &'a List<CanonicalVarInfo<'a>>

type Lifted = &'tcx List<CanonicalVarInfo<'tcx>>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<'tcx> for &'a List<ProjectionKind>

type Lifted = &'tcx List<ProjectionKind>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<'tcx> for &'a List<BoundVariableKind>

type Lifted = &'tcx List<BoundVariableKind>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<'a, 'tcx> Lift<'tcx> for &'a List<GenericArg<'a>>

type Lifted = &'tcx List<GenericArg<'tcx>>

fn lift_to_tcx(self, tcx: TyCtxt<'tcx>) -> Option<Self::Lifted>

impl<T> Ord for List<T> where
    T: Ord, 

fn cmp(&self, other: &List<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq<List<T>> for List<T>

fn eq(&self, other: &List<T>) -> bool

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T> PartialOrd<List<T>> for List<T> where
    T: PartialOrd, 

fn partial_cmp(&self, other: &List<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a, T: 'a> Pointer for &'a List<T>

const BITS: usize

Most likely the value you want to use here is the following, unless your Pointee type is unsized (e.g., ty::List<T> in rustc) in which case you’ll need to manually figure out what the right type to pass to align_of is.

fn into_usize(self) -> usize

unsafe fn from_usize(ptr: usize) -> Self

Safety

unsafe fn with_ref<R, F: FnOnce(&Self) -> R>(ptr: usize, f: F) -> R

This provides a reference to the Pointer itself, rather than the Deref::Target. It is used for cases where we want to call methods that may be implement differently for the Pointer than the Pointee (e.g., Rc::clone vs cloning the inner value).

impl<'tcx, P: PrettyPrinter<'tcx>> Print<'tcx, P> for &'tcx List<Ty<'tcx>>

type Output = P

type Error = Error

fn print(&self, cx: P) -> Result<Self::Output, Self::Error>

impl<'tcx, P: Printer<'tcx>> Print<'tcx, P> for &'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>

type Output = P::DynExistential

type Error = P::Error

fn print(&self, cx: P) -> Result<Self::Output, Self::Error>

impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for List<Ty<'tcx>>

fn decode(decoder: &mut D) -> Result<&'tcx Self, D::Error>

impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for List<Binder<'tcx, ExistentialPredicate<'tcx>>>

fn decode(decoder: &mut D) -> Result<&'tcx Self, D::Error>

impl<'tcx, D: TyDecoder<'tcx>> RefDecodable<'tcx, D> for List<BoundVariableKind>

fn decode(decoder: &mut D) -> Result<&'tcx Self, D::Error>

impl<'tcx> Relate<'tcx> for &'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>

fn relate<R: TypeRelation<'tcx>>(
    relation: &mut R,
    a: Self,
    b: Self
) -> RelateResult<'tcx, Self>

impl<'a, 'tcx, T> ToStableHashKey<StableHashingContext<'a>> for &'tcx List<T> where
    T: HashStable<StableHashingContext<'a>>, 

type KeyType = Fingerprint

fn to_stable_hash_key(&self, hcx: &StableHashingContext<'a>) -> Fingerprint

impl<'tcx> TypeFoldable<'tcx> for &'tcx List<PlaceElem<'tcx>>

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

fn super_visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::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 definitely_has_type_flags(&self, tcx: TyCtxt<'tcx>, flags: TypeFlags) -> 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 potentially_has_param_types_or_consts(&self) -> bool

fn definitely_has_param_types_or_consts(&self, tcx: TyCtxt<'tcx>) -> 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 potentially_needs_subst(&self) -> bool

fn definitely_needs_subst(&self, tcx: TyCtxt<'tcx>) -> bool

fn has_free_regions(&self, tcx: TyCtxt<'tcx>) -> 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, tcx: TyCtxt<'tcx>) -> bool

True if there are any un-erased free regions.

fn is_known_global(&self) -> bool

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

fn is_global(&self, tcx: TyCtxt<'tcx>) -> 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.

impl<'tcx> TypeFoldable<'tcx> for &'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>>

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

fn super_visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::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 definitely_has_type_flags(&self, tcx: TyCtxt<'tcx>, flags: TypeFlags) -> 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 potentially_has_param_types_or_consts(&self) -> bool

fn definitely_has_param_types_or_consts(&self, tcx: TyCtxt<'tcx>) -> 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 potentially_needs_subst(&self) -> bool

fn definitely_needs_subst(&self, tcx: TyCtxt<'tcx>) -> bool

fn has_free_regions(&self, tcx: TyCtxt<'tcx>) -> 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, tcx: TyCtxt<'tcx>) -> bool

True if there are any un-erased free regions.

fn is_known_global(&self) -> bool

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

fn is_global(&self, tcx: TyCtxt<'tcx>) -> 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.

impl<'tcx> TypeFoldable<'tcx> for &'tcx List<Ty<'tcx>>

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

fn super_visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::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 definitely_has_type_flags(&self, tcx: TyCtxt<'tcx>, flags: TypeFlags) -> 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 potentially_has_param_types_or_consts(&self) -> bool

fn definitely_has_param_types_or_consts(&self, tcx: TyCtxt<'tcx>) -> 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 potentially_needs_subst(&self) -> bool

fn definitely_needs_subst(&self, tcx: TyCtxt<'tcx>) -> bool

fn has_free_regions(&self, tcx: TyCtxt<'tcx>) -> 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, tcx: TyCtxt<'tcx>) -> bool

True if there are any un-erased free regions.

fn is_known_global(&self) -> bool

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

fn is_global(&self, tcx: TyCtxt<'tcx>) -> 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.

impl<'tcx> TypeFoldable<'tcx> for &'tcx List<ProjectionKind>

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

fn super_visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::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 definitely_has_type_flags(&self, tcx: TyCtxt<'tcx>, flags: TypeFlags) -> 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 potentially_has_param_types_or_consts(&self) -> bool

fn definitely_has_param_types_or_consts(&self, tcx: TyCtxt<'tcx>) -> 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 potentially_needs_subst(&self) -> bool

fn definitely_needs_subst(&self, tcx: TyCtxt<'tcx>) -> bool

fn has_free_regions(&self, tcx: TyCtxt<'tcx>) -> 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, tcx: TyCtxt<'tcx>) -> bool

True if there are any un-erased free regions.

fn is_known_global(&self) -> bool

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

fn is_global(&self, tcx: TyCtxt<'tcx>) -> 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.

impl<'tcx> TypeFoldable<'tcx> for &'tcx List<Predicate<'tcx>>

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

fn super_visit_with<V: TypeVisitor<'tcx>>(
    &self,
    visitor: &mut V
) -> ControlFlow<V::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 definitely_has_type_flags(&self, tcx: TyCtxt<'tcx>, flags: TypeFlags) -> 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 potentially_has_param_types_or_consts(&self) -> bool

fn definitely_has_param_types_or_consts(&self, tcx: TyCtxt<'tcx>) -> 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 potentially_needs_subst(&self) -> bool

fn definitely_needs_subst(&self, tcx: TyCtxt<'tcx>) -> bool

fn has_free_regions(&self, tcx: TyCtxt<'tcx>) -> 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, tcx: TyCtxt<'tcx>) -> bool

True if there are any un-erased free regions.

fn is_known_global(&self) -> bool

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

fn is_global(&self, tcx: TyCtxt<'tcx>) -> 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.

impl<T: Eq> Eq for List<T>

impl<T: Sync> Sync for List<T>

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.