pub struct DecodeRequest {
pub output: ObservableOutput,
pub observable: TaskId,
pub index: u32,
pub raw: BitId,
pub round_duration: f64,
pub timing: DecodeTiming,
}Expand description
One decoder query against an already-lowered Observable.
Corrected and flip outputs share one sampled decision for a request. The shared payload keeps their query fields aligned. The runtime caches decisions by observable task and attempt epoch, and rejects inconsistent inputs for that causal key.
Fields§
§output: ObservableOutputBoolean result of this causal solve.
observable: TaskIdTask id of the Observable this estimates.
index: u32The observable’s program-level index.
raw: BitIdRegister holding the raw measured parity.
round_duration: f64Duration of one physical memory round, the unit of decoder latency.
timing: DecodeTimingEpoch decoder latency is measured from.
Trait Implementations§
Source§impl Clone for DecodeRequest
impl Clone for DecodeRequest
Source§fn clone(&self) -> DecodeRequest
fn clone(&self) -> DecodeRequest
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 Copy for DecodeRequest
Source§impl Debug for DecodeRequest
impl Debug for DecodeRequest
Source§impl PartialEq for DecodeRequest
impl PartialEq for DecodeRequest
Source§impl Serialize for DecodeRequest
impl Serialize for DecodeRequest
impl StructuralPartialEq for DecodeRequest
Auto Trait Implementations§
impl Freeze for DecodeRequest
impl RefUnwindSafe for DecodeRequest
impl Send for DecodeRequest
impl Sync for DecodeRequest
impl Unpin for DecodeRequest
impl UnsafeUnpin for DecodeRequest
impl UnwindSafe for DecodeRequest
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