Enum BoundedIntDivRemAlgorithm

pub enum BoundedIntDivRemAlgorithm {
    KnownSmallRhs,
    KnownSmallQuotient {
        q_upper_bound: BigInt,
    },
    KnownSmallLhs {
        lhs_upper_sqrt: BigInt,
    },
}

The algorithm to use for division and remainder of bounded integers.

Variants

KnownSmallRhs

The rhs is small enough to be multiplied by 2**128 without wraparound.

KnownSmallQuotient

The quotient is small enough to be multiplied by 2**128 without wraparound.

Fields

q_upper_bound: BigInt

KnownSmallLhs

The lhs is small enough so that its square root plus 1 can be multiplied by 2**128 without wraparound. lhs_upper_sqrt is the square root of the upper bound of the lhs, rounded up.

Fields

lhs_upper_sqrt: BigInt

Implementations

impl BoundedIntDivRemAlgorithm

pub fn try_new(lhs: &Range, rhs: &Range) -> Option<Self>

Returns the algorithm to use for division and remainder of bounded integers. Fails if the div_rem of the ranges is not supported yet.

Assumption: lhs is non-negative and rhs is positive.