core.int128
struct Cent
Functions 35
fn
Cent shr1(Cent c) pureUnsigned shift right one bit Params: c = Cent to shift Returns: shifted valuefn
Cent sar1(Cent c) pureArithmetic shift right one bit Params: c = Cent to shift Returns: shifted valuefn
Cent shl(Cent c, uint n) pureShift left n bits Params: c = Cent to shift n = number of bits to shift Returns: shifted valuefn
Cent shr(Cent c, uint n) pureUnsigned shift right n bits Params: c = Cent to shift n = number of bits to shift Returns: shifted valuefn
Cent sar(Cent c, uint n) pureArithmetic shift right n bits Params: c = Cent to shift n = number of bits to shift Returns: shifted valuefn
Cent rol(Cent c, uint n) pureRotate left n bits Params: c = Cent to rotate n = number of bits to rotate Returns: rotated valuefn
Cent ror(Cent c, uint n) pureRotate right n bits Params: c = Cent to rotate n = number of bits to rotate Returns: rotated valuefn
Cent and(Cent c1, Cent c2) pureAnd c1 & c2. Params: c1 = operand 1 c2 = operand 2 Returns: c1 & c2fn
Cent xor(Cent c1, Cent c2) pureXor c1 ^ c2. Params: c1 = operand 1 c2 = operand 2 Returns: c1 ^ c2fn
Cent add(Cent c1, Cent c2) pureAdd c1 to c2. Params: c1 = operand 1 c2 = operand 2 Returns: c1 + c2fn
Cent sub(Cent c1, Cent c2) pureSubtract c2 from c1. Params: c1 = operand 1 c2 = operand 2 Returns: c1 - c2fn
Cent mul(Cent c1, Cent c2) pureMultiply c1 c2. Params: c1 = operand 1 c2 = operand 2 Returns: c1 c2fn
Cent mul(ulong u1, ulong u2) pureMultiply 64-bit operands u1 u2 in 128-bit precision. Params: u1 = operand 1 u2 = operand 2 Returns: u1 u2 in 128-bit precisionfn
Cent udiv(Cent c1, Cent c2) pureUnsigned divide c1 / c2. Params: c1 = dividend c2 = divisor Returns: quotient c1 / c2fn
Cent udivmod(Cent c1, Cent c2, out Cent modulus) pureUnsigned divide c1 / c2. The remainder after division is stored to modulus. Params: c1 = dividend c2 = divisor modulus = set to c1 % c2 Returns: quotient c1 / c2fn
U udivmod(Cent c1, U c2, out U modulus) pureUnsigned divide 128-bit c1 / 64-bit c2. The result must fit in 64 bits. The remainder after division is stored to modulus. Params: c1 = dividend c2 = divisor modulus = set to c1 % c2 Returns: quoti...fn
Cent div(Cent c1, Cent c2) pureSigned divide c1 / c2. Params: c1 = dividend c2 = divisor Returns: quotient c1 / c2fn
Cent divmod(Cent c1, Cent c2, out Cent modulus) pureSigned divide c1 / c2. The remainder after division is stored to modulus. Params: c1 = dividend c2 = divisor modulus = set to c1 % c2 Returns: quotient c1 / c2fn
bool ugt(Cent c1, Cent c2) pureIf c1 > c2 unsigned Params: c1 = operand 1 c2 = operand 2 Returns: true if c1 > c2fn
bool uge(Cent c1, Cent c2) pureIf c1 >= c2 unsigned Params: c1 = operand 1 c2 = operand 2 Returns: true if c1 >= c2fn
bool ult(Cent c1, Cent c2) pureIf c1 < c2 unsigned Params: c1 = operand 1 c2 = operand 2 Returns: true if c1 < c2fn
bool ule(Cent c1, Cent c2) pureIf c1 <= c2 unsigned Params: c1 = operand 1 c2 = operand 2 Returns: true if c1 <= c2fn
bool gt(Cent c1, Cent c2) pureIf c1 > c2 signed Params: c1 = operand 1 c2 = operand 2 Returns: true if c1 > c2fn
bool ge(Cent c1, Cent c2) pureIf c1 >= c2 signed Params: c1 = operand 1 c2 = operand 2 Returns: true if c1 >= c2