Enum GenericArg

pub enum GenericArg {
    Ty(Ty),
    Base(SubsetTyCtor),
    Lifetime(Region),
    Const(Const),
}

Variants

Ty(Ty)

Base(SubsetTyCtor)

Lifetime(Region)

Const(Const)

Implementations

impl GenericArg

pub fn expect_type(&self) -> &Ty

pub fn expect_base(&self) -> &SubsetTyCtor

pub fn from_param_def(param: &GenericParamDef) -> Self

pub fn for_item<F>( genv: GlobalEnv<'_, '_>, def_id: DefId, mk_kind: F, ) -> QueryResult<GenericArgs>

where F: FnMut(&GenericParamDef, &[GenericArg]) -> GenericArg,

Creates a GenericArgs from the definition of generic parameters, by calling a closure to obtain arg. The closures get to observe the GenericArgs as they’re being built, which can be used to correctly replace defaults of generic parameters.

pub fn identity_for_item( genv: GlobalEnv<'_, '_>, def_id: impl Into<DefId>, ) -> QueryResult<GenericArgs>

fn fill_item<F>( genv: GlobalEnv<'_, '_>, args: &mut Vec<GenericArg>, generics: &Generics, mk_kind: &mut F, ) -> QueryResult<()>

where F: FnMut(&GenericParamDef, &[GenericArg]) -> GenericArg,

Trait Implementations

impl Clone for GenericArg

fn clone(&self) -> GenericArg

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GenericArg

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

Formats the value using the given formatter.

impl<__D: TyDecoder> Decodable<__D> for GenericArg

fn decode(__decoder: &mut __D) -> Self

impl<__E: TyEncoder> Encodable<__E> for GenericArg

fn encode(&self, __encoder: &mut __E)

impl From<TyOrBase> for GenericArg

fn from(v: TyOrBase) -> Self

Converts to this type from the input type.

impl Hash for GenericArg

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GenericArg

fn eq(&self, other: &GenericArg) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Pretty for GenericArg

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

fn default_cx(tcx: TyCtxt<'_>) -> PrettyCx<'_>

impl SliceInternable for GenericArg

fn storage() -> &'static InternStorage<[Self]>

impl<'tcx> ToRustc<'tcx> for GenericArg

type T = GenericArg<'tcx>

fn to_rustc(&self, tcx: TyCtxt<'tcx>) -> Self::T

impl TypeFoldable for GenericArg

fn try_fold_with<F: FallibleTypeFolder>( &self, folder: &mut F, ) -> Result<Self, F::Error>

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

fn normalize_projections<'tcx>( &self, genv: GlobalEnv<'_, 'tcx>, infcx: &InferCtxt<'tcx>, callsite_def_id: DefId, ) -> QueryResult<Self>

fn normalize(&self, defns: &SpecFuncDefns) -> Self

Normalize expressions by applying beta reductions for tuples and lambda abstractions.

fn replace_holes( &self, f: impl FnMut(&[BoundVariableKinds], HoleKind) -> Expr, ) -> Self

Replaces all holes with the result of calling a closure. The closure takes a list with all the layers of bound variables at the point the hole was found. Each layer corresponds to the list of bound variables at that level. The list is ordered from outermost to innermost binder, i.e., the last element is the binder closest to the hole.

fn with_holes(&self) -> Self

Remove all refinements and turn each underlying BaseTy into a TyKind::Exists with a TyKind::Constr and a hole. For example, Vec<{v. i32[v] | v > 0}>[n] becomes {n. Vec<{v. i32[v] | *}>[n] | *}.

fn replace_evars(&self, evars: &EVarSol) -> Self

fn shift_in_escaping(&self, amount: u32) -> Self

fn shift_out_escaping(&self, amount: u32) -> Self

fn erase_regions(&self) -> Self

impl TypeVisitable for GenericArg

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

fn has_escaping_bvars(&self) -> bool

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

Returns true if self has any late-bound vars 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 vars that appear free.

fn fvars(&self) -> FxHashSet<Name>

Returns the set of all free variables. For example, Vec<i32[n]>{v : v > m} returns {n, m}.

impl Eq for GenericArg

impl StructuralPartialEq for GenericArg