pub struct ConditionId {
    private_use_as_methods_instead: u32,
}Expand description
ID of a mcdc condition. Used by llvm to check mcdc coverage.
Note for future: the max limit of 0xFFFF is probably too loose. Actually llvm does not
support decisions with too many conditions (7 and more at LLVM 18 while may be hundreds at 19)
and represents it with int16_t. This max value may be changed once we could
figure out an accurate limit.
Fields§
§private_use_as_methods_instead: u32Implementations§
Source§impl ConditionId
 
impl ConditionId
Sourcepub const MAX_AS_U32: u32 = 65_535u32
 
pub const MAX_AS_U32: u32 = 65_535u32
Maximum value the index can take, as a u32.
Sourcepub const fn from_usize(value: usize) -> Self
 
pub const fn from_usize(value: usize) -> Self
Sourcepub const unsafe fn from_u32_unchecked(value: u32) -> Self
 
pub const unsafe fn from_u32_unchecked(value: u32) -> Self
Creates a new index from a given u32.
§Safety
The provided value must be less than or equal to the maximum value for the newtype. Providing a value outside this range is undefined due to layout restrictions.
Prefer using from_u32.
Source§impl ConditionId
 
impl ConditionId
Trait Implementations§
Source§impl Add<usize> for ConditionId
 
impl Add<usize> for ConditionId
Source§impl AddAssign<usize> for ConditionId
 
impl AddAssign<usize> for ConditionId
Source§fn add_assign(&mut self, other: usize)
 
fn add_assign(&mut self, other: usize)
+= operation. Read moreSource§impl Clone for ConditionId
 
impl Clone for ConditionId
Source§fn clone(&self) -> ConditionId
 
fn clone(&self) -> ConditionId
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
 
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for ConditionId
 
impl Debug for ConditionId
Source§impl From<ConditionId> for u32
 
impl From<ConditionId> for u32
Source§fn from(v: ConditionId) -> u32
 
fn from(v: ConditionId) -> u32
Source§impl From<ConditionId> for usize
 
impl From<ConditionId> for usize
Source§fn from(v: ConditionId) -> usize
 
fn from(v: ConditionId) -> usize
Source§impl From<u32> for ConditionId
 
impl From<u32> for ConditionId
Source§impl From<usize> for ConditionId
 
impl From<usize> for ConditionId
Source§impl Hash for ConditionId
 
impl Hash for ConditionId
Source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for ConditionId
 
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for ConditionId
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Source§impl Idx for ConditionId
 
impl Idx for ConditionId
Source§impl Ord for ConditionId
 
impl Ord for ConditionId
Source§fn cmp(&self, other: &ConditionId) -> Ordering
 
fn cmp(&self, other: &ConditionId) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
    Self: Sized,
 
fn max(self, other: Self) -> Selfwhere
    Self: Sized,
Source§impl PartialEq for ConditionId
 
impl PartialEq for ConditionId
Source§impl PartialOrd for ConditionId
 
impl PartialOrd for ConditionId
Source§impl Step for ConditionId
 
impl Step for ConditionId
Source§fn steps_between(start: &Self, end: &Self) -> (usize, Option<usize>)
 
fn steps_between(start: &Self, end: &Self) -> (usize, Option<usize>)
step_trait)start to end
like Iterator::size_hint(). Read moreSource§fn forward_checked(start: Self, u: usize) -> Option<Self>
 
fn forward_checked(start: Self, u: usize) -> Option<Self>
step_trait)Source§fn backward_checked(start: Self, u: usize) -> Option<Self>
 
fn backward_checked(start: Self, u: usize) -> Option<Self>
step_trait)Source§fn forward(start: Self, count: usize) -> Self
 
fn forward(start: Self, count: usize) -> Self
step_trait)Source§unsafe fn forward_unchecked(start: Self, count: usize) -> Self
 
unsafe fn forward_unchecked(start: Self, count: usize) -> Self
step_trait)Source§fn backward(start: Self, count: usize) -> Self
 
fn backward(start: Self, count: usize) -> Self
step_trait)Source§unsafe fn backward_unchecked(start: Self, count: usize) -> Self
 
unsafe fn backward_unchecked(start: Self, count: usize) -> Self
step_trait)impl Copy for ConditionId
impl Eq for ConditionId
impl StructuralPartialEq for ConditionId
Auto Trait Implementations§
impl DynSend for ConditionId
impl DynSync for ConditionId
impl Freeze for ConditionId
impl RefUnwindSafe for ConditionId
impl Send for ConditionId
impl Sync for ConditionId
impl Unpin for ConditionId
impl UnwindSafe for ConditionId
Blanket Implementations§
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
    T: Copy,
 
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
    T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
    T: Copy,
 
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
    T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
 
impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
 
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
    T: Clone,
 
impl<T> CloneToUninit for Twhere
    T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
 
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Q, K> Comparable<K> for Q
 
impl<Q, K> Comparable<K> for Q
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
 
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
Source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
 
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, tcx: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
 
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode,
something which is needed when forcing DepNodes during red-green
evaluation. The query system will only call this method if
fingerprint_style() is not FingerprintStyle::Opaque.
It is always valid to return None here, in which case incremental
compilation will treat the query as having changed instead of forcing it.Source§impl<Q, K> Equivalent<K> for Q
 
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
 
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
 
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<T> Filterable for T
 
impl<T> Filterable for T
Source§fn filterable(
    self,
    filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
 
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
Source§impl<T> Instrument for T
 
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
 
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
 
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
 
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
 
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
 
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<P> IntoQueryParam<P> for P
 
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<I, T> IntoSliceIdx<I, [T]> for Iwhere
    I: Idx,
 
impl<I, T> IntoSliceIdx<I, [T]> for Iwhere
    I: Idx,
type Output = usize
fn into_slice_idx(self) -> <I as IntoSliceIdx<I, [T]>>::Output
Source§impl<T> MaybeResult<T> for T
 
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
 
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
    U: UpcastFrom<I, T>,
 
impl<I, T, U> Upcast<I, U> for Twhere
    U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
 
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
Source§impl<Tcx, T> Value<Tcx> for Twhere
    Tcx: DepContext,
 
impl<Tcx, T> Value<Tcx> for Twhere
    Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
 
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
 
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
 
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> ErasedDestructor for Twhere
    T: 'static,
impl<T> MaybeSendSync for T
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 4 bytes