Struct DedekindCutQ 

pub struct DedekindCutQ {
    pub numerator: i64,
    pub denominator: u64,
}

A Dedekind cut representation over the rationals (using integer pairs p/q).

A Dedekind cut (L, R) partitions the rationals into a lower set L and upper set R. We represent it by the cut value as a rational number p/q.

Fields

numerator: i64

Numerator of the cut value.

denominator: u64

Denominator of the cut value (always positive).

Implementations

impl DedekindCutQ

pub fn new(p: i64, q: u64) -> Self

Create a Dedekind cut at p/q (q > 0).

pub fn in_lower(&self, r: i64, s: u64) -> bool

Check if a rational number r/s is in the lower set.

pub fn in_upper(&self, r: i64, s: u64) -> bool

Check if a rational number r/s is in the upper set.

pub fn as_f64(&self) -> f64

Approximate value as f64.

pub fn cut_cmp(&self, other: &DedekindCutQ) -> Ordering

Compare two cuts.

pub fn mediant(&self, other: &DedekindCutQ) -> DedekindCutQ

Return a cut strictly between self and other.