pub struct MemoryCycle {
pub stream: QuantumStream,
pub round_duration: f64,
pub detectors: Box<[RecordParity]>,
pub boundary_flows: Box<[BoundaryFlow]>,
pub initializers: Box<[FrontierInitializer]>,
}Expand description
One dynamically repeatable memory cycle on a seam. Boundary flows carry the last-round evidence needed to compose detectors across extra cycles.
Fields§
§stream: QuantumStream§round_duration: f64§detectors: Box<[RecordParity]>§boundary_flows: Box<[BoundaryFlow]>§initializers: Box<[FrontierInitializer]>Zero-cycle values for the padding frontier, derived from the exact source-to-padding detector rows materialized by IR seam composition.
Trait Implementations§
Source§impl Clone for MemoryCycle
impl Clone for MemoryCycle
Source§fn clone(&self) -> MemoryCycle
fn clone(&self) -> MemoryCycle
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 Debug for MemoryCycle
impl Debug for MemoryCycle
Source§impl Default for MemoryCycle
impl Default for MemoryCycle
Source§fn default() -> MemoryCycle
fn default() -> MemoryCycle
Returns the “default value” for a type. Read more
Source§impl PartialEq for MemoryCycle
impl PartialEq for MemoryCycle
Source§impl Serialize for MemoryCycle
impl Serialize for MemoryCycle
impl StructuralPartialEq for MemoryCycle
Auto Trait Implementations§
impl Freeze for MemoryCycle
impl RefUnwindSafe for MemoryCycle
impl Send for MemoryCycle
impl Sync for MemoryCycle
impl Unpin for MemoryCycle
impl UnsafeUnpin for MemoryCycle
impl UnwindSafe for MemoryCycle
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