pub struct ProgramRegionBreak {
pub node: NodeRef,
pub moment: usize,
pub region: ProgramRegionId,
pub qubit: IVec2,
pub kind: RegionBreakKind,
}Expand description
A gauge anticommutation located back to the node timeline it falls in.
A break means the supplied region is not preserved by the tracked circuit. Consumers visualizing a non-Clifford program through a Clifford gate proxy must recompute the program’s observables for that same proxy first.
Fields§
§node: NodeRefThe node whose moment the break lands in (the broken segment’s node).
moment: usizeNode-local moment index within node.
region: ProgramRegionIdThe detector or logical observable whose region broke.
qubit: IVec2Qubit where anticommutation occurred.
kind: RegionBreakKindKind of region break.
Trait Implementations§
Source§impl Clone for ProgramRegionBreak
impl Clone for ProgramRegionBreak
Source§fn clone(&self) -> ProgramRegionBreak
fn clone(&self) -> ProgramRegionBreak
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 ProgramRegionBreak
impl Debug for ProgramRegionBreak
Source§impl PartialEq for ProgramRegionBreak
impl PartialEq for ProgramRegionBreak
impl StructuralPartialEq for ProgramRegionBreak
Auto Trait Implementations§
impl Freeze for ProgramRegionBreak
impl RefUnwindSafe for ProgramRegionBreak
impl Send for ProgramRegionBreak
impl Sync for ProgramRegionBreak
impl Unpin for ProgramRegionBreak
impl UnsafeUnpin for ProgramRegionBreak
impl UnwindSafe for ProgramRegionBreak
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