Modular arithmetic. # Examples ``` # use ibig::{modular::ModuloRing, ubig}; let ring = ModuloRing::new(&ubig!(10000)); let x = ring.from(12345); let

urbit @da timestamp

A ring of integers modulo a positive integer. # Examples ``` # use ibig::{modular::ModuloRing, ubig}; let ring = ModuloRing::new(&ubig!(100)); asser

Absolute value. # Examples ``` # use ibig::{ibig, ops::Abs}; assert_eq!(ibig!(-5).abs(), ibig!(5)); ```

Associated data for AES-SIV functions.

Traits for number operations. Bitwise AND NOT operation. `x.and_not(y)` is equivalent to `x & !y`. For [UBig](crate::UBig) the latter is not a valid

Note: since these are methods for converting to other types, their implementations are found in hand/convert

TODO: This exists largely because nockapp doesn't own the [`Atom`] type from [`nockvm`]. TODO: The next step for this should be to lower the methods o

This trait decouples the serf's capture of the current kernel state from the snapshotting process.

Render a path which is a linked-list of cells of of atoms (direct and indirect strings)

DigitWriter allows writing raw digits and turns them into ASCII.

Compute Euclidean quotient. # Example ``` # use ibig::{ibig, ops::DivEuclid}; assert_eq!(ibig!(-23).div_euclid(ibig!(10)), ibig!(-3)); ```

Compute quotient and remainder at the same time. # Example ``` # use ibig::{ops::DivRem, ubig}; assert_eq!(ubig!(23).div_rem(ubig!(10)), (ubig!(2), u

Compute Euclidean quotient and remainder at the same time. # Example ``` # use ibig::{ibig, ops::DivRemEuclid}; assert_eq!(ibig!(-23).div_rem_euclid(

=/ add-op ?:(=(field %base) badd fadd) =/ mul-op ?:(=(field %base) bmul fmul) =/ aop-door ?:(=(field %base) bop fop) =/ init-zero=@ux (lift