Struct And 

pub struct And<A, B>(pub A, pub B);

Both policies: a term is kept if both keep it, and both layer passes run, first then second.

Tuple Fields

0: A

First policy.

1: B

Second policy.

Trait Implementations

impl<A: Clone, B: Clone> Clone for And<A, B>

fn clone(&self) -> And<A, B>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<A: Debug, B: Debug> Debug for And<A, B>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<A: Into<BuiltinTruncation>, B: Into<BuiltinTruncation>> From<And<A, B>> for BuiltinTruncation

fn from(p: And<A, B>) -> Self

Converts to this type from the input type.

impl<A: PartialEq, B: PartialEq> PartialEq for And<A, B>

fn eq(&self, other: &And<A, B>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const W: usize, A, B> TruncationPolicy<W> for And<A, B>

where A: TruncationPolicy<W>, B: TruncationPolicy<W>,

fn keep_term(&self, x: &[u64; W], z: &[u64; W], c: Complex64) -> bool

Per-term filter, run inside the merge on every output, so it must be cheap.

fn finalize_layer(&self, sum: &mut PauliSum<W>)

Pass over the whole sum after each layer; PauliSum::retain is the easy way to write a filter here.

fn finalizes_layer(&self) -> bool

Whether finalize_layer does anything, a hint that lets the engine skip it.

fn finalize_layer_partitioned( &self, local: &mut PauliSum<W>, collectives: &dyn Collectives, )

The layer pass over one partition’s slice of the layer, run on every layer on every partition in lock-step.

fn supports_partitioned(&self) -> bool

Whether finalize_layer_partitioned runs above one partition; every partitioned driver checks it before the first layer.

impl<A: Copy, B: Copy> Copy for And<A, B>

impl<A, B> StructuralPartialEq for And<A, B>