pub struct DetectorSlices {
pub slices: Vec<Vec<DetectorRegion>>,
pub breaks: Vec<RegionBreak>,
}Expand description
The full slice table for a segmented straight-line circuit.
Fields§
§slices: Vec<Vec<DetectorRegion>>slices[k] is the regions alive at the end of segment k, sorted by
detector id; each region’s terms sorted by (qubit.x, qubit.y).
Detectors with empty regions are omitted.
breaks: Vec<RegionBreak>Every anticommutation, sorted by (segment, detector, qubit).
Trait Implementations§
Source§impl Clone for DetectorSlices
impl Clone for DetectorSlices
Source§fn clone(&self) -> DetectorSlices
fn clone(&self) -> DetectorSlices
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 DetectorSlices
impl Debug for DetectorSlices
Source§impl Default for DetectorSlices
impl Default for DetectorSlices
Source§fn default() -> DetectorSlices
fn default() -> DetectorSlices
Returns the “default value” for a type. Read more
impl Eq for DetectorSlices
Source§impl PartialEq for DetectorSlices
impl PartialEq for DetectorSlices
impl StructuralPartialEq for DetectorSlices
Auto Trait Implementations§
impl Freeze for DetectorSlices
impl RefUnwindSafe for DetectorSlices
impl Send for DetectorSlices
impl Sync for DetectorSlices
impl Unpin for DetectorSlices
impl UnsafeUnpin for DetectorSlices
impl UnwindSafe for DetectorSlices
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.