Struct Or 

pub struct Or<A, B>(/* private fields */);

Either of two per-term filters: a term is kept if either keeps it.

Or combines per-term filters only: an operand with a layer pass (TopN, ApproxTopN, CollapseSample, or an And containing one) is rejected, since “either keeps” has no meaning for a pass over the whole sum. Use And to add a filter to a layer pass.

Implementations

impl<A, B> Or<A, B>

pub fn new(first: A, second: B) -> Self

Either of first and second.

The operands are checked in finalizes_layer, which every driver calls before the first layer, since a layer pass is a property of the policy at a width W and new has no W.

Trait Implementations

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

fn clone(&self) -> Or<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 Or<A, B>

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

Formats the value using the given formatter.

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

Panics

If either operand has a layer pass, as BuiltinTruncation::or.

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

Converts to this type from the input type.

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

fn eq(&self, other: &Or<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 Or<A, B>

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

fn finalizes_layer(&self) -> bool

false; panics if either operand has a layer pass.

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 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 Or<A, B>

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