pub struct ResidualFlow<M> {
pub start: PauliMap,
pub end: PauliMap,
pub measurements: SmallVec<[M; 2]>,
pub sign: bool,
pub center: Option<IVec2>,
pub marker: FlowMarker,
}Expand description
A boundary flow left open after residual composition.
FlowEngine::into_residual_flows returns one fused chain spliced from
start (its origin boundary, empty for an internally-created chain) to end
(the boundary it leaves open, empty if it closed against a boundary input),
carrying every measurement composed along the way.
Fields§
§start: PauliMapThe chain’s origin boundary; empty for an internally-created chain.
end: PauliMapThe boundary the chain leaves open; empty if it closed against an input.
measurements: SmallVec<[M; 2]>Every measurement composed along the chain.
sign: boolXOR of the signs on every fused flow.
center: Option<IVec2>The detector’s coordinates, if any.
marker: FlowMarkerCarries the fused FlowMarker onto the template’s boundary_flows so
the instance-seam pass can suppress detectors (Discard) or route the
cross-instance chain to a restart parity (Restart).
Trait Implementations§
Source§impl<M> Clone for ResidualFlow<M>where
M: Clone,
impl<M> Clone for ResidualFlow<M>where
M: Clone,
Source§fn clone(&self) -> ResidualFlow<M>
fn clone(&self) -> ResidualFlow<M>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<M> Debug for ResidualFlow<M>where
M: Debug,
impl<M> Debug for ResidualFlow<M>where
M: Debug,
impl<M> Eq for ResidualFlow<M>where
M: Eq,
Source§impl<M> PartialEq for ResidualFlow<M>where
M: PartialEq,
impl<M> PartialEq for ResidualFlow<M>where
M: PartialEq,
impl<M> StructuralPartialEq for ResidualFlow<M>where
M: PartialEq,
Auto Trait Implementations§
impl<M> Freeze for ResidualFlow<M>where
M: Freeze,
impl<M> RefUnwindSafe for ResidualFlow<M>where
M: RefUnwindSafe,
impl<M> Send for ResidualFlow<M>where
M: Send,
impl<M> Sync for ResidualFlow<M>where
M: Sync,
impl<M> Unpin for ResidualFlow<M>where
M: Unpin,
impl<M> UnsafeUnpin for ResidualFlow<M>where
M: UnsafeUnpin,
impl<M> UnwindSafe for ResidualFlow<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
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
§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
key and return true if they are equal.