def root_le_fin

bend-collections-laws-crypto@1.0.0.0 · src/math/generic.bend:368

import Base
import bend-collections-laws-crypto@1.0.0.0/src/math/num.bend as N

368# r^k <= n, with an overflowing power counted as > n
369def root_le_fin(~T: Data, ~op: N.Op<T> -> T, ~test: N.Test<T> -> Bool, +n: T, p: Maybe<&2, T>) -> Bool:
370  match p:
371    case None{}:
372      False{}
373    case Some{+x}:
374      le(~T, ~test, x, n)