pub struct LoopCarriedDetectorState<M = u32> {
pub state: LoopStateId,
pub initial: DetectorParity<M>,
pub next: DetectorParity<M>,
}Expand description
A detector state carried between iterations of a repeated body.
initial is the parity substituted for the state on the first iteration;
next is the parity the state takes for the following iteration.
Fields§
§state: LoopStateIdThe state this record defines.
initial: DetectorParity<M>Parity used for the state on the first iteration.
next: DetectorParity<M>Parity the state carries into the next iteration.
Trait Implementations§
Source§impl<M: Clone> Clone for LoopCarriedDetectorState<M>
impl<M: Clone> Clone for LoopCarriedDetectorState<M>
Source§fn clone(&self) -> LoopCarriedDetectorState<M>
fn clone(&self) -> LoopCarriedDetectorState<M>
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 moreSource§impl<M: Debug> Debug for LoopCarriedDetectorState<M>
impl<M: Debug> Debug for LoopCarriedDetectorState<M>
impl<M: Eq> Eq for LoopCarriedDetectorState<M>
Source§impl<M: PartialEq> PartialEq for LoopCarriedDetectorState<M>
impl<M: PartialEq> PartialEq for LoopCarriedDetectorState<M>
impl<M: PartialEq> StructuralPartialEq for LoopCarriedDetectorState<M>
Auto Trait Implementations§
impl<M> Freeze for LoopCarriedDetectorState<M>where
M: Freeze,
impl<M> RefUnwindSafe for LoopCarriedDetectorState<M>where
M: RefUnwindSafe,
impl<M> Send for LoopCarriedDetectorState<M>where
M: Send,
impl<M> Sync for LoopCarriedDetectorState<M>where
M: Sync,
impl<M> Unpin for LoopCarriedDetectorState<M>where
M: Unpin,
impl<M> UnsafeUnpin for LoopCarriedDetectorState<M>where
M: UnsafeUnpin,
impl<M> UnwindSafe for LoopCarriedDetectorState<M>where
M: UnwindSafe + RefUnwindSafe,
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<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.