Struct Counting 

pub struct Counting(pub BigUint);

Natural-number counting semiring: add is +, mul is *.

A^k[i][j] over this semiring counts the walks of length k from i to j. The closure converges only when the matrix is nilpotent (acyclic); otherwise the closure engine raises a limit error.

Tuple Fields

0: BigUint

Implementations

impl Counting

pub fn from_u64(value: u64) -> Self

Construct from a small machine integer for convenience.

Trait Implementations

impl Clone for Counting

fn clone(&self) -> Counting

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Counting

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

Formats the value using the given formatter.

impl Eq for Counting

impl PartialEq for Counting

fn eq(&self, other: &Counting) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Semiring for Counting

fn star(&self) -> Option<Self>

1 + a + a^2 + ... is finite only when a == 0, giving 1.

fn zero() -> Self

The additive identity, also meaning “no value” / “no path”.

fn one() -> Self

The multiplicative identity.

fn add(&self, other: &Self) -> Self

Combine two alternatives.

fn mul(&self, other: &Self) -> Self

Chain two values in sequence.

fn is_zero(&self) -> bool

Whether this value is the additive identity.

impl StructuralPartialEq for Counting