pub enum WaitReason {
Synchronization,
CausalCut,
DecoderLatency,
}Expand description
Runtime cause for a dynamically inserted hold interval.
When blockers overlap, classification uses this conservative precedence:
a direct physical sibling or resource is Self::Synchronization, then an
unfinished causal query is Self::CausalCut, and only an issued decoder
solve is Self::DecoderLatency. The reason is sampled when the whole
interval is issued and does not change partway through a QEC round. Factory
GAP rounds remain identified by MemoryKind::FactoryGap.
Variants§
Synchronization
A directly joined physical sibling or factory resource is unfinished.
CausalCut
Measurements or other causal inputs needed to issue a query are unfinished.
DecoderLatency
Query inputs are complete and an issued decoder solve is still running.
Trait Implementations§
Source§impl Clone for WaitReason
impl Clone for WaitReason
Source§fn clone(&self) -> WaitReason
fn clone(&self) -> WaitReason
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for WaitReason
Source§impl Debug for WaitReason
impl Debug for WaitReason
Source§impl<'de> Deserialize<'de> for WaitReason
impl<'de> Deserialize<'de> for WaitReason
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for WaitReason
Source§impl PartialEq for WaitReason
impl PartialEq for WaitReason
Source§impl Serialize for WaitReason
impl Serialize for WaitReason
impl StructuralPartialEq for WaitReason
Auto Trait Implementations§
impl Freeze for WaitReason
impl RefUnwindSafe for WaitReason
impl Send for WaitReason
impl Sync for WaitReason
impl Unpin for WaitReason
impl UnsafeUnpin for WaitReason
impl UnwindSafe for WaitReason
Blanket Implementations§
§impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
impl<T, BorrowedSelf> BitwiseMutViaBorrow<BorrowedSelf> for T
fn assign_index(&mut self, index: usize, to: bool)
fn negate_index(&mut self, index: usize)
fn clear_bits(&mut self)
fn assign_random(
&mut self,
bit_count: usize,
random_number_generator: &mut impl RngExt,
)where
BorrowedSelf: BitLength,
§impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
impl<Bits, Other, BorrowedSelf, BorrowedOther> BitwisePairMutViaBorrow<Other, BorrowedSelf, BorrowedOther> for Bits
fn assign(&mut self, other: &Other)
fn bitxor_assign(&mut self, other: &Other)
fn bitand_assign(&mut self, other: &Other)
fn bitor_assign(&mut self, other: &Other)
§impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
impl<T, Other, BorrowedSelf, BorrowedOther> BitwisePairViaBorrow<Other, BorrowedSelf, BorrowedOther> for T
§impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
impl<T, BorrowedSelf> BitwiseViaBorrow<BorrowedSelf> for T
fn index(&self, index: usize) -> bool
fn weight(&self) -> usize
fn parity(&self) -> bool
fn is_zero(&self) -> bool
fn is_unit(&self, index: usize) -> bool
fn support<'a>(&'a self) -> impl SortedIteratorwhere
BorrowedSelf: 'a,
fn max_support(&self) -> Option<usize>
fn min_support(&self) -> Option<usize>
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.