ic-mops 0.8.5 → 0.8.7

package/.mops/base@0.7.4/src/Int16.mo

@@ -1,159 +0,0 @@
-/// 16-bit signed integers with checked arithmetic
-///
-/// Most operations are available as built-in operators (e.g. `1 + 1`).
-import Int "Int";
-import Prim "mo:⛔";
-
-module {
-
-  /// 16-bit signed integers
-  public type Int16 = Prim.Types.Int16;
-
-  /// Conversion.
-  public let toInt : Int16 -> Int = Prim.int16ToInt;
-
-  /// Conversion. Traps on overflow/underflow.
-  public let fromInt : Int -> Int16  = Prim.intToInt16;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromIntWrap : Int -> Int16  = Prim.intToInt16Wrap;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromNat16 : Nat16 -> Int16 = Prim.nat16ToInt16;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let toNat16 : Int16 -> Nat16  = Prim.int16ToNat16;
-
-  /// Returns the Text representation of `x`.
-  public func toText(x : Int16) : Text {
-    Int.toText(toInt(x))
-  };
-
-  /// Returns the absolute value of `x`. Traps when `x = -2^15`.
-  public func abs(x : Int16) : Int16 {
-    fromInt(Int.abs(toInt(x)))
-  };
-
-  /// Returns the minimum of `x` and `y`.
-  public func min(x : Int16, y : Int16) : Int16 {
-    if (x < y) { x } else { y }
-  };
-
-  /// Returns the maximum of `x` and `y`.
-  public func max( x : Int16, y : Int16) : Int16 {
-    if (x < y) { y } else { x }
-  };
-
-  /// Returns `x == y`.
-  public func equal(x : Int16, y : Int16) : Bool { x == y };
-
-  /// Returns `x != y`.
-  public func notEqual(x : Int16, y : Int16) : Bool { x != y };
-
-  /// Returns `x < y`.
-  public func less(x : Int16, y : Int16) : Bool { x < y };
-
-  /// Returns `x <= y`.
-  public func lessOrEqual(x : Int16, y : Int16) : Bool { x <= y };
-
-  /// Returns `x > y`.
-  public func greater(x : Int16, y : Int16) : Bool { x > y };
-
-  /// Returns `x >= y`.
-  public func greaterOrEqual(x : Int16, y : Int16) : Bool { x >= y };
-
-  /// Returns the order of `x` and `y`.
-  public func compare(x : Int16, y : Int16) : { #less; #equal; #greater } {
-    if (x < y) { #less }
-    else if (x == y) { #equal }
-    else { #greater }
-  };
-
-  /// Returns the negation of `x`, `-x`. Traps on overflow.
-  public func neg(x : Int16) : Int16 { -x; };
-
-  /// Returns the sum of `x` and `y`, `x + y`. Traps on overflow.
-  public func add(x : Int16, y : Int16) : Int16 { x + y };
-
-  /// Returns the difference of `x` and `y`, `x - y`. Traps on underflow.
-  public func sub(x : Int16, y : Int16) : Int16 { x - y };
-
-  /// Returns the product of `x` and `y`, `x * y`. Traps on overflow.
-  public func mul(x : Int16, y : Int16) : Int16 { x * y };
-
-  /// Returns the division of `x by y`, `x / y`.
-  /// Traps when `y` is zero.
-  public func div(x : Int16, y : Int16) : Int16 { x / y };
-
-  /// Returns the remainder of `x` divided by `y`, `x % y`.
-  /// Traps when `y` is zero.
-  public func rem(x : Int16, y : Int16) : Int16 { x % y };
-
-  /// Returns `x` to the power of `y`, `x ** y`. Traps on overflow.
-  public func pow(x : Int16, y : Int16) : Int16 { x ** y };
-
-  /// Returns the bitwise negation of `x`, `^x`.
-  public func bitnot(x : Int16, y : Int16) : Int16 { ^x };
-
-  /// Returns the bitwise and of `x` and `y`, `x & y`.
-  public func bitand(x : Int16, y : Int16) : Int16 { x & y };
-
-  /// Returns the bitwise or of `x` and `y`, `x \| y`.
-  public func bitor(x : Int16, y : Int16) : Int16 { x | y };
-
-  /// Returns the bitwise exclusive or of `x` and `y`, `x ^ y`.
-  public func bitxor(x : Int16, y : Int16) : Int16 { x ^ y };
-
-  /// Returns the bitwise shift left of `x` by `y`, `x << y`.
-  public func bitshiftLeft(x : Int16, y : Int16) : Int16 { x << y };
-
-  /// Returns the bitwise shift right of `x` by `y`, `x >> y`.
-  public func bitshiftRight(x : Int16, y : Int16) : Int16 { x >> y };
-
-  /// Returns the bitwise rotate left of `x` by `y`, `x <<> y`.
-  public func bitrotLeft(x : Int16, y : Int16) : Int16 { x <<> y };
-
-  /// Returns the bitwise rotate right of `x` by `y`, `x <>> y`.
-  public func bitrotRight(x : Int16, y : Int16) : Int16 { x <>> y };
-
-  /// Returns the value of bit `p mod 16` in `x`, `(x & 2^(p mod 16)) == 2^(p mod 16)`.
-  public func bittest(x : Int16, p : Nat) : Bool {
-    Prim.btstInt16(x, Prim.intToInt16(p));
-  };
-
-  /// Returns the value of setting bit `p mod 16` in `x` to `1`.
-  public func bitset(x : Int16, p : Nat) : Int16 {
-    x | (1 << Prim.intToInt16(p));
-  };
-
-  /// Returns the value of clearing bit `p mod 16` in `x` to `0`.
-  public func bitclear(x : Int16, p : Nat) : Int16 {
-    x & ^(1 << Prim.intToInt16(p));
-  };
-
-  /// Returns the value of flipping bit `p mod 16` in `x`.
-  public func bitflip(x : Int16, p : Nat) : Int16 {
-    x ^ (1 << Prim.intToInt16(p));
-  };
-
-  /// Returns the count of non-zero bits in `x`.
-  public let bitcountNonZero : (x : Int16) -> Int16 = Prim.popcntInt16;
-
-  /// Returns the count of leading zero bits in `x`.
-  public let bitcountLeadingZero : (x : Int16) -> Int16 = Prim.clzInt16;
-
-  /// Returns the count of trailing zero bits in `x`.
-  public let bitcountTrailingZero : (x : Int16) -> Int16 = Prim.ctzInt16;
-
-  /// Returns the sum of `x` and `y`, `x +% y`. Wraps on overflow.
-  public func addWrap(x : Int16, y : Int16) : Int16 { x +% y };
-
-  /// Returns the difference of `x` and `y`, `x -% y`. Wraps on underflow.
-  public func subWrap(x : Int16, y : Int16) : Int16 { x -% y };
-
-  /// Returns the product of `x` and `y`, `x *% y`. Wraps on overflow.
-  public func mulWrap(x : Int16, y : Int16) : Int16 { x *% y };
-
-  /// Returns `x` to the power of `y`, `x **% y`. Wraps on overflow. Traps if `y < 0`.
-  public func powWrap(x : Int16, y : Int16) : Int16 { x **% y };
-}

package/.mops/base@0.7.4/src/Int32.mo

@@ -1,160 +0,0 @@
-/// 32-bit signed integers with checked arithmetic
-///
-/// Most operations are available as built-in operators (e.g. `1 + 1`).
-import Int "Int";
-import Prim "mo:⛔";
-
-module {
-
-  /// 32-bit signed integers.
-  public type Int32 = Prim.Types.Int32;
-
-  /// Conversion.
-  public let toInt : Int32 -> Int = Prim.int32ToInt;
-
-  /// Conversion. Traps on overflow/underflow.
-  public let fromInt : Int -> Int32  = Prim.intToInt32;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromIntWrap : Int -> Int32  = Prim.intToInt32Wrap;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromNat32 : Nat32 -> Int32 = Prim.nat32ToInt32;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let toNat32 : Int32 -> Nat32  = Prim.int32ToNat32;
-
-  /// Returns the Text representation of `x`.
-  public func toText(x : Int32) : Text {
-    Int.toText(toInt(x))
-  };
-
-  /// Returns the absolute value of `x`. Traps when `x = -2^31`.
-  public func abs(x : Int32) : Int32 {
-    fromInt(Int.abs(toInt(x)))
-  };
-
-  /// Returns the minimum of `x` and `y`.
-  public func min(x : Int32, y : Int32) : Int32 {
-    if (x < y) { x } else { y }
-  };
-
-  /// Returns the maximum of `x` and `y`.
-  public func max( x : Int32, y : Int32) : Int32 {
-    if (x < y) { y } else { x }
-  };
-
-  /// Returns `x == y`.
-  public func equal(x : Int32, y : Int32) : Bool { x == y };
-
-  /// Returns `x != y`.
-  public func notEqual(x : Int32, y : Int32) : Bool { x != y };
-
-  /// Returns `x < y`.
-  public func less(x : Int32, y : Int32) : Bool { x < y };
-
-  /// Returns `x <= y`.
-  public func lessOrEqual(x : Int32, y : Int32) : Bool { x <= y };
-
-  /// Returns `x > y`.
-  public func greater(x : Int32, y : Int32) : Bool { x > y };
-
-  /// Returns `x >= y`.
-  public func greaterOrEqual(x : Int32, y : Int32) : Bool { x >= y };
-
-  /// Returns the order of `x` and `y`.
-  public func compare(x : Int32, y : Int32) : { #less; #equal; #greater } {
-    if (x < y) { #less }
-    else if (x == y) { #equal }
-    else { #greater }
-  };
-
-  /// Returns the negation of `x`, `-x`. Traps on overflow.
-  public func neg(x : Int32) : Int32 { -x; };
-
-  /// Returns the sum of `x` and `y`, `x + y`. Traps on overflow.
-  public func add(x : Int32, y : Int32) : Int32 { x + y };
-
-  /// Returns the difference of `x` and `y`, `x - y`. Traps on underflow.
-  public func sub(x : Int32, y : Int32) : Int32 { x - y };
-
-  /// Returns the product of `x` and `y`, `x * y`. Traps on overflow.
-  public func mul(x : Int32, y : Int32) : Int32 { x * y };
-
-  /// Returns the division of `x by y`, `x / y`.
-  /// Traps when `y` is zero.
-  public func div(x : Int32, y : Int32) : Int32 { x / y };
-
-  /// Returns the remainder of `x` divided by `y`, `x % y`.
-  /// Traps when `y` is zero.
-  public func rem(x : Int32, y : Int32) : Int32 { x % y };
-
-  /// Returns `x` to the power of `y`, `x ** y`. Traps on overflow.
-  public func pow(x : Int32, y : Int32) : Int32 { x ** y };
-
-  /// Returns the bitwise negation of `x`, `^x`.
-  public func bitnot(x : Int32, y : Int32) : Int32 { ^x };
-
-  /// Returns the bitwise and of `x` and `y`, `x & y`.
-  public func bitand(x : Int32, y : Int32) : Int32 { x & y };
-
-  /// Returns the bitwise or of `x` and `y`, `x \| y`.
-  public func bitor(x : Int32, y : Int32) : Int32 { x | y };
-
-  /// Returns the bitwise exclusive or of `x` and `y`, `x ^ y`.
-  public func bitxor(x : Int32, y : Int32) : Int32 { x ^ y };
-
-  /// Returns the bitwise shift left of `x` by `y`, `x << y`.
-  public func bitshiftLeft(x : Int32, y : Int32) : Int32 { x << y };
-
-  /// Returns the bitwise shift right of `x` by `y`, `x >> y`.
-  public func bitshiftRight(x : Int32, y : Int32) : Int32 { x >> y };
-
-  /// Returns the bitwise rotate left of `x` by `y`, `x <<> y`.
-  public func bitrotLeft(x : Int32, y : Int32) : Int32 { x <<> y };
-
-  /// Returns the bitwise rotate right of `x` by `y`, `x <>> y`.
-  public func bitrotRight(x : Int32, y : Int32) : Int32 { x <>> y };
-
-  /// Returns the value of bit `p mod 16` in `x`, `(x & 2^(p mod 16)) == 2^(p mod 16)`.
-  public func bittest(x : Int32, p : Nat) : Bool {
-    Prim.btstInt32(x, Prim.intToInt32(p));
-  };
-
-  /// Returns the value of setting bit `p mod 16` in `x` to `1`.
-  public func bitset(x : Int32, p : Nat) : Int32 {
-    x | (1 << Prim.intToInt32(p));
-  };
-
-  /// Returns the value of clearing bit `p mod 16` in `x` to `0`.
-  public func bitclear(x : Int32, p : Nat) : Int32 {
-    x & ^(1 << Prim.intToInt32(p));
-  };
-
-  /// Returns the value of flipping bit `p mod 16` in `x`.
-  public func bitflip(x : Int32, p : Nat) : Int32 {
-    x ^ (1 << Prim.intToInt32(p));
-  };
-
-  /// Returns the count of non-zero bits in `x`.
-  public let bitcountNonZero : (x : Int32) -> Int32 = Prim.popcntInt32;
-
-  /// Returns the count of leading zero bits in `x`.
-  public let bitcountLeadingZero : (x : Int32) -> Int32 = Prim.clzInt32;
-
-  /// Returns the count of trailing zero bits in `x`.
-  public let bitcountTrailingZero : (x : Int32) -> Int32 = Prim.ctzInt32;
-
-  /// Returns the sum of `x` and `y`, `x +% y`. Wraps on overflow.
-  public func addWrap(x : Int32, y : Int32) : Int32 { x +% y };
-
-  /// Returns the difference of `x` and `y`, `x -% y`. Wraps on underflow.
-  public func subWrap(x : Int32, y : Int32) : Int32 { x -% y };
-
-  /// Returns the product of `x` and `y`, `x *% y`. Wraps on overflow.
-  public func mulWrap(x : Int32, y : Int32) : Int32 { x *% y };
-
-  /// Returns `x` to the power of `y`, `x **% y`. Wraps on overflow. Traps if `y < 0`.
-  public func powWrap(x : Int32, y : Int32) : Int32 { x **% y };
-
-}

package/.mops/base@0.7.4/src/Int64.mo

@@ -1,161 +0,0 @@
-/// 64-bit signed integers with checked arithmetic
-///
-/// Most operations are available as built-in operators (e.g. `1 + 1`).
-import Int "Int";
-import Prim "mo:⛔";
-
-module {
-
-  /// 64-bit signed integers.
-  public type Int64 = Prim.Types.Int64;
-
-  /// Conversion.
-  public let toInt : Int64 -> Int = Prim.int64ToInt;
-
-  /// Conversion. Traps on overflow/underflow.
-  public let fromInt : Int -> Int64  = Prim.intToInt64;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromIntWrap : Int -> Int64  = Prim.intToInt64Wrap;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromNat64 : Nat64 -> Int64 = Prim.nat64ToInt64;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let toNat64 : Int64 -> Nat64  = Prim.int64ToNat64;
-
-  /// Returns the Text representation of `x`.
-  public func toText(x : Int64) : Text {
-    Int.toText(toInt(x))
-  };
-
-  /// Returns the absolute value of `x`. Traps when `x = -2^63`.
-  public func abs(x : Int64) : Int64 {
-    fromInt(Int.abs(toInt(x)))
-  };
-
-  /// Returns the minimum of `x` and `y`.
-  public func min(x : Int64, y : Int64) : Int64 {
-    if (x < y) { x } else { y }
-  };
-
-  /// Returns the maximum of `x` and `y`.
-  public func max( x : Int64, y : Int64) : Int64 {
-    if (x < y) { y } else { x }
-  };
-
-  /// Returns `x == y`.
-  public func equal(x : Int64, y : Int64) : Bool { x == y };
-
-  /// Returns `x != y`.
-  public func notEqual(x : Int64, y : Int64) : Bool { x != y };
-
-  /// Returns `x < y`.
-  public func less(x : Int64, y : Int64) : Bool { x < y };
-
-  /// Returns `x <= y`.
-  public func lessOrEqual(x : Int64, y : Int64) : Bool { x <= y };
-
-  /// Returns `x > y`.
-  public func greater(x : Int64, y : Int64) : Bool { x > y };
-
-  /// Returns `x >= y`.
-  public func greaterOrEqual(x : Int64, y : Int64) : Bool { x >= y };
-
-  /// Returns the order of `x` and `y`.
-  public func compare(x : Int64, y : Int64) : { #less; #equal; #greater } {
-    if (x < y) { #less }
-    else if (x == y) { #equal }
-    else { #greater }
-  };
-
-  /// Returns the negation of `x`, `-x`. Traps on overflow.
-  public func neg(x : Int64) : Int64 { -x; };
-
-  /// Returns the sum of `x` and `y`, `x + y`. Traps on overflow.
-  public func add(x : Int64, y : Int64) : Int64 { x + y };
-
-  /// Returns the difference of `x` and `y`, `x - y`. Traps on underflow.
-  public func sub(x : Int64, y : Int64) : Int64 { x - y };
-
-  /// Returns the product of `x` and `y`, `x * y`. Traps on overflow.
-  public func mul(x : Int64, y : Int64) : Int64 { x * y };
-
-  /// Returns the division of `x by y`, `x / y`.
-  /// Traps when `y` is zero.
-  public func div(x : Int64, y : Int64) : Int64 { x / y };
-
-  /// Returns the remainder of `x` divided by `y`, `x % y`.
-  /// Traps when `y` is zero.
-  public func rem(x : Int64, y : Int64) : Int64 { x % y };
-
-  /// Returns `x` to the power of `y`, `x ** y`. Traps on overflow.
-  public func pow(x : Int64, y : Int64) : Int64 { x ** y };
-
-  /// Returns the bitwise negation of `x`, `^x`.
-  public func bitnot(x : Int64, y : Int64) : Int64 { ^x };
-
-  /// Returns the bitwise and of `x` and `y`, `x & y`.
-  public func bitand(x : Int64, y : Int64) : Int64 { x & y };
-
-  /// Returns the bitwise or of `x` and `y`, `x \| y`.
-  public func bitor(x : Int64, y : Int64) : Int64 { x | y };
-
-  /// Returns the bitwise exclusive or of `x` and `y`, `x ^ y`.
-  public func bitxor(x : Int64, y : Int64) : Int64 { x ^ y };
-
-  /// Returns the bitwise shift left of `x` by `y`, `x << y`.
-  public func bitshiftLeft(x : Int64, y : Int64) : Int64 { x << y };
-
-  /// Returns the bitwise shift right of `x` by `y`, `x >> y`.
-  public func bitshiftRight(x : Int64, y : Int64) : Int64 { x >> y };
-
-  /// Returns the bitwise rotate left of `x` by `y`, `x <<> y`.
-  public func bitrotLeft(x : Int64, y : Int64) : Int64 { x <<> y };
-
-  /// Returns the bitwise rotate right of `x` by `y`, `x <>> y`.
-  public func bitrotRight(x : Int64, y : Int64) : Int64 { x <>> y };
-
-  /// Returns the value of bit `p mod 64` in `x`, `(x & 2^(p mod 64)) == 2^(p mod 64)`.
-  public func bittest(x : Int64, p : Nat) : Bool {
-    Prim.btstInt64(x, Prim.intToInt64(p));
-  };
-
-  /// Returns the value of setting bit `p mod 64` in `x` to `1`.
-  public func bitset(x : Int64, p : Nat) : Int64 {
-    x | (1 << Prim.intToInt64(p));
-  };
-
-  /// Returns the value of clearing bit `p mod 64` in `x` to `0`.
-  public func bitclear(x : Int64, p : Nat) : Int64 {
-    x & ^(1 << Prim.intToInt64(p));
-  };
-
-  /// Returns the value of flipping bit `p mod 64` in `x`.
-  public func bitflip(x : Int64, p : Nat) : Int64 {
-    x ^ (1 << Prim.intToInt64(p));
-  };
-
-  /// Returns the count of non-zero bits in `x`.
-  public let bitcountNonZero : (x : Int64) -> Int64 = Prim.popcntInt64;
-
-  /// Returns the count of leading zero bits in `x`.
-  public let bitcountLeadingZero : (x : Int64) -> Int64 = Prim.clzInt64;
-
-  /// Returns the count of trailing zero bits in `x`.
-  public let bitcountTrailingZero : (x : Int64) -> Int64 = Prim.ctzInt64;
-
-
-  /// Returns the sum of `x` and `y`, `x +% y`. Wraps on overflow.
-  public func addWrap(x : Int64, y : Int64) : Int64 { x +% y };
-
-  /// Returns the difference of `x` and `y`, `x -% y`. Wraps on underflow.
-  public func subWrap(x : Int64, y : Int64) : Int64 { x -% y };
-
-  /// Returns the product of `x` and `y`, `x *% y`. Wraps on overflow.
-  public func mulWrap(x : Int64, y : Int64) : Int64 { x *% y };
-
-  /// Returns `x` to the power of `y`, `x **% y`. Wraps on overflow. Traps if `y < 0`.
-  public func powWrap(x : Int64, y : Int64) : Int64 { x **% y };
-
-}

package/.mops/base@0.7.4/src/Int8.mo

@@ -1,160 +0,0 @@
-/// 8-bit signed integers with checked arithmetic
-///
-/// Most operations are available as built-in operators (e.g. `1 + 1`).
-import Int "Int";
-import Prim "mo:⛔";
-
-module {
-
-  /// 8-bit signed integers.
-  public type Int8 = Prim.Types.Int8;
-
-  /// Conversion.
-  public let toInt : Int8 -> Int = Prim.int8ToInt;
-
-  /// Conversion. Traps on overflow/underflow.
-  public let fromInt : Int -> Int8  = Prim.intToInt8;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromIntWrap : Int -> Int8  = Prim.intToInt8Wrap;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let fromNat8 : Nat8 -> Int8 = Prim.nat8ToInt8;
-
-  /// Conversion. Wraps on overflow/underflow.
-  public let toNat8 : Int8 -> Nat8  = Prim.int8ToNat8;
-
-  /// Returns the Text representation of `x`.
-  public func toText(x : Int8) : Text {
-    Int.toText(toInt(x))
-  };
-
-  /// Returns the absolute value of `x`. Traps when `x = -2^7`.
-  public func abs(x : Int8) : Int8 {
-    fromInt(Int.abs(toInt(x)))
-  };
-
-  /// Returns the minimum of `x` and `y`.
-  public func min(x : Int8, y : Int8) : Int8 {
-    if (x < y) { x } else { y }
-  };
-
-  /// Returns the maximum of `x` and `y`.
-  public func max( x : Int8, y : Int8) : Int8 {
-    if (x < y) { y } else { x }
-  };
-
-  /// Returns `x == y`.
-  public func equal(x : Int8, y : Int8) : Bool { x == y };
-
-  /// Returns `x != y`.
-  public func notEqual(x : Int8, y : Int8) : Bool { x != y };
-
-  /// Returns `x < y`.
-  public func less(x : Int8, y : Int8) : Bool { x < y };
-
-  /// Returns `x <= y`.
-  public func lessOrEqual(x : Int8, y : Int8) : Bool { x <= y };
-
-  /// Returns `x > y`.
-  public func greater(x : Int8, y : Int8) : Bool { x > y };
-
-  /// Returns `x >= y`.
-  public func greaterOrEqual(x : Int8, y : Int8) : Bool { x >= y };
-
-  /// Returns the order of `x` and `y`.
-  public func compare(x : Int8, y : Int8) : { #less; #equal; #greater } {
-    if (x < y) { #less }
-    else if (x == y) { #equal }
-    else { #greater }
-  };
-
-  /// Returns the negation of `x`, `-x`. Traps on overflow.
-  public func neg(x : Int8) : Int8 { -x; };
-
-  /// Returns the sum of `x` and `y`, `x + y`. Traps on overflow.
-  public func add(x : Int8, y : Int8) : Int8 { x + y };
-
-  /// Returns the difference of `x` and `y`, `x - y`. Traps on underflow.
-  public func sub(x : Int8, y : Int8) : Int8 { x - y };
-
-  /// Returns the product of `x` and `y`, `x * y`. Traps on overflow.
-  public func mul(x : Int8, y : Int8) : Int8 { x * y };
-
-  /// Returns the division of `x by y`, `x / y`.
-  /// Traps when `y` is zero.
-  public func div(x : Int8, y : Int8) : Int8 { x / y };
-
-  /// Returns the remainder of `x` divided by `y`, `x % y`.
-  /// Traps when `y` is zero.
-  public func rem(x : Int8, y : Int8) : Int8 { x % y };
-
-  /// Returns `x` to the power of `y`, `x ** y`. Traps on overflow.
-  public func pow(x : Int8, y : Int8) : Int8 { x ** y };
-
-  /// Returns the bitwise negation of `x`, `^x`.
-  public func bitnot(x : Int8, y : Int8) : Int8 { ^x };
-
-  /// Returns the bitwise and of `x` and `y`, `x & y`.
-  public func bitand(x : Int8, y : Int8) : Int8 { x & y };
-
-  /// Returns the bitwise or of `x` and `y`, `x \| y`.
-  public func bitor(x : Int8, y : Int8) : Int8 { x | y };
-
-  /// Returns the bitwise exclusive or of `x` and `y`, `x ^ y`.
-  public func bitxor(x : Int8, y : Int8) : Int8 { x ^ y };
-
-  /// Returns the bitwise shift left of `x` by `y`, `x << y`.
-  public func bitshiftLeft(x : Int8, y : Int8) : Int8 { x << y };
-
-  /// Returns the bitwise shift right of `x` by `y`, `x >> y`.
-  public func bitshiftRight(x : Int8, y : Int8) : Int8 { x >> y };
-
-  /// Returns the bitwise rotate left of `x` by `y`, `x <<> y`.
-  public func bitrotLeft(x : Int8, y : Int8) : Int8 { x <<> y };
-
-  /// Returns the bitwise rotate right of `x` by `y`, `x <>> y`.
-  public func bitrotRight(x : Int8, y : Int8) : Int8 { x <>> y };
-
-  /// Returns the value of bit `p mod 8` in `x`, `(x & 2^(p mod 8)) == 2^(p mod 8)`.
-  public func bittest(x : Int8, p : Nat) : Bool {
-    Prim.btstInt8(x, Prim.intToInt8(p));
-  };
-
-  /// Returns the value of setting bit `p mod 8` in `x` to `1`.
-  public func bitset(x : Int8, p : Nat) : Int8 {
-    x | (1 << Prim.intToInt8(p));
-  };
-
-  /// Returns the value of clearing bit `p mod 8` in `x` to `0`.
-  public func bitclear(x : Int8, p : Nat) : Int8 {
-    x & ^(1 << Prim.intToInt8(p));
-  };
-
-  /// Returns the value of flipping bit `p mod 8` in `x`.
-  public func bitflip(x : Int8, p : Nat) : Int8 {
-    x ^ (1 << Prim.intToInt8(p));
-  };
-
-  /// Returns the count of non-zero bits in `x`.
-  public let bitcountNonZero : (x : Int8) -> Int8 = Prim.popcntInt8;
-
-  /// Returns the count of leading zero bits in `x`.
-  public let bitcountLeadingZero : (x : Int8) -> Int8 = Prim.clzInt8;
-
-  /// Returns the count of trailing zero bits in `x`.
-  public let bitcountTrailingZero : (x : Int8) -> Int8 = Prim.ctzInt8;
-
-  /// Returns the sum of `x` and `y`, `x +% y`. Wraps on overflow.
-  public func addWrap(x : Int8, y : Int8) : Int8 { x +% y };
-
-  /// Returns the difference of `x` and `y`, `x -% y`. Wraps on underflow.
-  public func subWrap(x : Int8, y : Int8) : Int8 { x -% y };
-
-  /// Returns the product of `x` and `y`, `x *% y`. Wraps on overflow.
-  public func mulWrap(x : Int8, y : Int8) : Int8 { x *% y };
-
-  /// Returns `x` to the power of `y`, `x **% y`. Wraps on overflow. Traps if `y < 0`.
-  public func powWrap(x : Int8, y : Int8) : Int8 { x **% y };
-
-}