pub enum ClassicalAssignment<'a> {
Uniform(bool),
Pinned {
forced_observables: &'a BTreeMap<u32, bool>,
},
}Expand description
The fixed path a Bloq::resolve_classical fold evaluates under.
Predicate inputs are fixed uniformly or through known observable values.
Variants§
Uniform(bool)
Every predicate input and observable leaf folds to the same bit.
Pinned
Observable values fixing activation and expressions through their inputs. A condition that reaches an unknown value is an error, not a default.
Fields
§
forced_observables: &'a BTreeMap<u32, bool>Values for ClassicalNode::Observable indices this path fixes,
keyed by observable index. These are corrected values; they do not
fix a decoder flip.
Trait Implementations§
Source§impl<'a> Clone for ClassicalAssignment<'a>
impl<'a> Clone for ClassicalAssignment<'a>
Source§fn clone(&self) -> ClassicalAssignment<'a>
fn clone(&self) -> ClassicalAssignment<'a>
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 moreimpl<'a> Copy for ClassicalAssignment<'a>
Auto Trait Implementations§
impl<'a> Freeze for ClassicalAssignment<'a>
impl<'a> RefUnwindSafe for ClassicalAssignment<'a>
impl<'a> Send for ClassicalAssignment<'a>
impl<'a> Sync for ClassicalAssignment<'a>
impl<'a> Unpin for ClassicalAssignment<'a>
impl<'a> UnsafeUnpin for ClassicalAssignment<'a>
impl<'a> UnwindSafe for ClassicalAssignment<'a>
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