Struct rustc_middle::mir::coverage::MappedExpressionIndex

pub struct MappedExpressionIndex {
    private: u32,
}

MappedExpressionIndex values ascend from zero, and are recalculated indexes based on their array position in the LLVM coverage map "Expressions" array, which is assembled during the "mapgen" process. They cannot be computed algorithmically, from the other newtype_indexs.

Fields

private: u32

Implementations

impl MappedExpressionIndex

pub const MAX_AS_U32: u32

pub const MAX: Self

pub const fn from_usize(value: usize) -> Self

pub const fn from_u32(value: u32) -> Self

pub const unsafe fn from_u32_unchecked(value: u32) -> Self

pub const fn index(self) -> usize

Extracts the value of this index as an integer.

pub const fn as_u32(self) -> u32

Extracts the value of this index as a u32.

pub const fn as_usize(self) -> usize

Extracts the value of this index as a usize.

Trait Implementations

impl Add<usize> for MappedExpressionIndex

type Output = Self

The resulting type after applying the + operator.

fn add(self, other: usize) -> Self

Performs the + operation.

impl Clone for MappedExpressionIndex

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for MappedExpressionIndex

impl Debug for MappedExpressionIndex

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

Formats the value using the given formatter.

impl<D: Decoder> Decodable<D> for MappedExpressionIndex

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

impl<E: Encoder> Encodable<E> for MappedExpressionIndex

fn encode(&self, e: &mut E) -> Result<(), E::Error>

impl Eq for MappedExpressionIndex

impl From<MappedExpressionIndex> for u32

fn from(v: MappedExpressionIndex) -> u32

Performs the conversion.

impl From<MappedExpressionIndex> for usize

fn from(v: MappedExpressionIndex) -> usize

Performs the conversion.

impl From<u32> for MappedExpressionIndex

fn from(value: u32) -> Self

Performs the conversion.

impl From<usize> for MappedExpressionIndex

fn from(value: usize) -> Self

Performs the conversion.

impl Hash for MappedExpressionIndex

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, 

Feeds a slice of this type into the given Hasher.

impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for MappedExpressionIndex

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

impl Idx for MappedExpressionIndex

fn new(value: usize) -> Self

fn index(self) -> usize

fn increment_by(&mut self, amount: usize)

fn plus(self, amount: usize) -> Self

impl<'tcx> Lift<'tcx> for MappedExpressionIndex

type Lifted = Self

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

impl Ord for MappedExpressionIndex

fn cmp(&self, other: &MappedExpressionIndex) -> Ordering

This method returns an Ordering between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl PartialEq<MappedExpressionIndex> for MappedExpressionIndex

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

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

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

This method tests for !=.

impl PartialOrd<MappedExpressionIndex> for MappedExpressionIndex

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

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

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

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

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

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

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

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

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

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

impl Step for MappedExpressionIndex

fn steps_between(start: &Self, end: &Self) -> Option<usize>

🔬 This is a nightly-only experimental API. (step_trait)

recently redesigned

Returns the number of successor steps required to get from start to end.

fn forward_checked(start: Self, u: usize) -> Option<Self>

🔬 This is a nightly-only experimental API. (step_trait_ext)

recently added

Returns the value that would be obtained by taking the successor of self count times.

fn backward_checked(start: Self, u: usize) -> Option<Self>

🔬 This is a nightly-only experimental API. (step_trait_ext)

recently added

Returns the value that would be obtained by taking the successor of self count times.

fn forward(start: Self, count: usize) -> Self

🔬 This is a nightly-only experimental API. (step_trait_ext)

recently added

Returns the value that would be obtained by taking the successor of self count times.

unsafe fn forward_unchecked(start: Self, count: usize) -> Self

🔬 This is a nightly-only experimental API. (unchecked_math)

niche optimization path

Returns the value that would be obtained by taking the successor of self count times.

fn backward(start: Self, count: usize) -> Self

🔬 This is a nightly-only experimental API. (step_trait_ext)

recently added

Returns the value that would be obtained by taking the predecessor of self count times.

unsafe fn backward_unchecked(start: Self, count: usize) -> Self

🔬 This is a nightly-only experimental API. (unchecked_math)

niche optimization path

Returns the value that would be obtained by taking the predecessor of self count times.

impl StructuralEq for MappedExpressionIndex

impl StructuralPartialEq for MappedExpressionIndex

impl<'tcx> TypeFoldable<'tcx> for MappedExpressionIndex

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

fn super_visit_with<F: TypeVisitor<'tcx>>(&self, _: &mut F) -> ControlFlow<()>

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

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

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.

fn visit_tys_shallow(
    &self,
    visit: impl FnMut(Ty<'tcx>) -> ControlFlow<()>
) -> ControlFlow<()>

A visitor that does not recurse into types, works like fn walk_shallow in Ty.