pub struct MomentSegmenter { /* private fields */ }Expand description
Incremental viewer-moment segmentation for structural circuit walkers.
Measurement-controlled corrections from an all-invisible chunk are carried
into the next chunk, so callers may split at repeat boundaries without
changing the moment order. Call Self::finish after the final chunk when
the returned segments will be sent to the reverse tracker.
Implementations§
Source§impl MomentSegmenter
impl MomentSegmenter
Sourcepub fn extend(&mut self, ops: &[Op]) -> Vec<MomentSegment>
pub fn extend(&mut self, ops: &[Op]) -> Vec<MomentSegment>
Segment one straight-line chunk while retaining trailing invisible feedforward for the next chunk.
Sourcepub fn finish(self, out: &mut [MomentSegment])
pub fn finish(self, out: &mut [MomentSegment])
Attach trailing invisible feedforward to the last visible segment. With no visible segment there is nothing to display or track.
Trait Implementations§
Source§impl Debug for MomentSegmenter
impl Debug for MomentSegmenter
Source§impl Default for MomentSegmenter
impl Default for MomentSegmenter
Source§fn default() -> MomentSegmenter
fn default() -> MomentSegmenter
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for MomentSegmenter
impl RefUnwindSafe for MomentSegmenter
impl Send for MomentSegmenter
impl Sync for MomentSegmenter
impl Unpin for MomentSegmenter
impl UnsafeUnpin for MomentSegmenter
impl UnwindSafe for MomentSegmenter
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