Enum Count 

pub enum Count {
    Integer(BigUint),
    Rational(BigRational),
    Log(SignedLog),
}

A count, in the domain its task produces.

It prints as the binary’s answer line prints it: an integer in decimal, a rational as <numerator>/<denominator>, and a log-domain value as <mantissa>e<exponent> (0 for zero).

Variants

Integer(BigUint)

An exact integer: the model count (Mode::Mc, Mode::Compile) and the projected model count (Mode::Pmc).

Rational(BigRational)

An exact rational: the projected weighted count (Mode::Pwmc).

Log(SignedLog)

A value in the bounded-precision log domain, its sign and the natural log of its magnitude: the weighted count (Mode::Wmc), which stays in that domain because exact rationals grow without bound on large instances.

Implementations

impl Count

pub fn to_f64(&self) -> f64

The count as the nearest f64, for printing or plotting.

Lossy: a large integer or rational is rounded to an f64’s precision, and a magnitude beyond f64’s range, as a log-domain value’s can be, is infinite.

let count = tididi_cnf::Count::Rational(num_rational::BigRational::new(91.into(), 125.into()));
assert_eq!(count.to_f64(), 0.728);

Trait Implementations

impl Clone for Count

fn clone(&self) -> Count

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Count

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

Formats the value using the given formatter.

impl Display for Count

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

Formats the value using the given formatter.

impl PartialEq for Count

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