Struct pocket_prover_set::Set

pub struct Set {
    pub any: u64,
    pub uniq: u64,
    pub fin_many: u64,
    pub inf_many: u64,
}

Conditions that holds for a set in general.

Fields

any: u64

All types, including those who are not defined.

uniq: u64

A unique value.

fin_many: u64

Many but finite number of values.

inf_many: u64

Many but infinite number of values.

Implementations

impl Set

pub fn rules(&self) -> u64

Rules for sets.

pub fn none(&self) -> u64

Returns whether the set is empty.

pub fn some(&self) -> u64

Returns whether the set is non-empty.

pub fn undefined(&self) -> u64

Returns whether the set is undefined. This can be a set of higher cardinality.

pub fn multiple(&self) -> u64

Returns whether the set contains more than one. The set must be well defined.

pub fn count<F: Fn(Set) -> u64>(f: F) -> u32

Counts the number of true cases.

Trait Implementations

impl Clone for Set

fn clone(&self) -> Set

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Construct for Set

fn construct(vs: &[u64]) -> Self

Creates a logical system out of proof arguments.

fn n() -> usize

Gets the number of bits in logical system.

impl Copy for Set

impl CoreRules for Set

fn core_rules(&self) -> u64

The core rules of the logical system.

impl ExtendRules for Set

type Inner = ()

The inner logical system.

fn inner(&self) -> &()

Gets the inner logical system.

fn extend_rules(&self, _: &Self::Inner) -> u64

Rules used to integrate with inner logical system.

fn full_rules(&self) -> u64

The full rules of the entire logical system.