Struct CountingCert 

pub struct CountingCert {
    pub n: u64,
    pub q: u64,
    pub remainder: u64,
}

A modular-counting refutation: an n-element set cannot split into blocks of size q because q ∤ n (the remainder is non-zero). Re-checkable in O(1): n % q == remainder != 0.

Fields

n: u64

q: u64

remainder: u64

Implementations

impl CountingCert

pub fn check(&self) -> bool

Re-check from scratch: the certificate witnesses UNSAT iff n mod q is the stated non-zero remainder.

pub fn byte_len(&self) -> usize

Trait Implementations

impl Clone for CountingCert

fn clone(&self) -> CountingCert

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CountingCert

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

Formats the value using the given formatter.

impl PartialEq for CountingCert

fn eq(&self, other: &CountingCert) -> 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 Copy for CountingCert

impl Eq for CountingCert

impl StructuralPartialEq for CountingCert