Provides utility functions on 16-bit signed integers.
:::note
Most operations are available as built-in operators (e.g. 1 + 1).
:::
:::info Function form for higher-order use
Several arithmetic and comparison functions (e.g. add, sub, bitor, bitand, pow) are defined in this module to enable their use as first-class function values, which is not possible with operators like +, -, ==, etc., in Motoko. This allows you to pass these operations to higher-order functions such as map, foldLeft, or sort.
:::
Import from the base library to use this module.
motoko name=import
import Int16 "mo:base/Int16";16-bit signed integers.
public let minimumValue : Int16Minimum 16-bit integer value, -2 ** 15.
Example:
motoko include=import
Int16.minimumValue // => -32_768 : Int16public let maximumValue : Int16Maximum 16-bit integer value, +2 ** 15 - 1.
Example:
motoko include=import
Int16.maximumValue // => +32_767 : Int16public func toInt(_ : Int16) : IntConverts a 16-bit signed integer to a signed integer with infinite precision.
Example:
motoko include=import
Int16.toInt(12_345) // => 12_345 : Intpublic func fromInt(_ : Int) : Int16Converts a signed integer with infinite precision to a 16-bit signed integer.
Traps on overflow/underflow.
Example:
motoko include=import
Int16.fromInt(12_345) // => +12_345 : Int16public func fromIntWrap(_ : Int) : Int16Converts a signed integer with infinite precision to a 16-bit signed integer.
Wraps on overflow/underflow.
Example:
motoko include=import
Int16.fromIntWrap(-12_345) // => -12_345 : Intpublic func fromInt8(_ : Int8) : Int16Converts a 8-bit signed integer to a 16-bit signed integer.
Example:
motoko include=import
Int16.fromInt8(-123) // => -123 : Int16public func toInt8(_ : Int16) : Int8Converts a 16-bit signed integer to a 8-bit signed integer.
Traps on overflow/underflow.
Example:
motoko include=import
Int16.toInt8(-123) // => -123 : Int8public func fromInt32(_ : Int32) : Int16Converts a 32-bit signed integer to a 16-bit signed integer.
Traps on overflow/underflow.
Example:
motoko include=import
Int16.fromInt32(-12_345) // => -12_345 : Int16public func toInt32(_ : Int16) : Int32Converts a 16-bit signed integer to a 32-bit signed integer.
Example:
motoko include=import
Int16.toInt32(-12_345) // => -12_345 : Int32public func fromNat16(_ : Nat16) : Int16Converts an unsigned 16-bit integer to a signed 16-bit integer.
Wraps on overflow/underflow.
Example:
motoko include=import
Int16.fromNat16(12_345) // => +12_345 : Int16public func toNat16(_ : Int16) : Nat16Converts a signed 16-bit integer to an unsigned 16-bit integer.
Wraps on overflow/underflow.
Example:
motoko include=import
Int16.toNat16(-1) // => 65_535 : Nat16 // underflowpublic func toText(x : Int16) : TextReturns the Text representation of x. Textual representation do not
contain underscores to represent commas.
Example:
motoko include=import
Int16.toText(-12345) // => "-12345"public func abs(x : Int16) : Int16Returns the absolute value of x.
Traps when x == -2 ** 15 (the minimum Int16 value).
Example:
motoko include=import
Int16.abs(-12345) // => +12_345public func min(x : Int16, y : Int16) : Int16Returns the minimum of x and y.
Example:
motoko include=import
Int16.min(+2, -3) // => -3public func max(x : Int16, y : Int16) : Int16Returns the maximum of x and y.
Example:
motoko include=import
Int16.max(+2, -3) // => +2public func equal(x : Int16, y : Int16) : BoolEquality function for Int16 types.
This is equivalent to x == y.
Example:
motoko include=import
Int16.equal(-1, -1); // => true
Example:
motoko include=import
import Buffer "mo:base/Buffer";
let buffer1 = Buffer.Buffer<Int16>(1);
buffer1.add(-3);
let buffer2 = Buffer.Buffer<Int16>(1);
buffer2.add(-3);
Buffer.equal(buffer1, buffer2, Int16.equal) // => truepublic func notEqual(x : Int16, y : Int16) : BoolInequality function for Int16 types.
This is equivalent to x != y.
Example:
motoko include=import
Int16.notEqual(-1, -2); // => truepublic func less(x : Int16, y : Int16) : Bool"Less than" function for Int16 types.
This is equivalent to x < y.
Example:
motoko include=import
Int16.less(-2, 1); // => truepublic func lessOrEqual(x : Int16, y : Int16) : Bool"Less than or equal" function for Int16 types.
This is equivalent to x <= y.
Example:
motoko include=import
Int16.lessOrEqual(-2, -2); // => truepublic func greater(x : Int16, y : Int16) : Bool"Greater than" function for Int16 types.
This is equivalent to x > y.
Example:
motoko include=import
Int16.greater(-2, 1); // => falsepublic func greaterOrEqual(x : Int16, y : Int16) : Bool"Greater than or equal" function for Int16 types.
This is equivalent to x >= y.
Example:
motoko include=import
Int16.greaterOrEqual(-2, -2); // => truepublic func compare(x : Int16, y : Int16) : {#less; #equal; #greater}General-purpose comparison function for Int16. Returns the Order (
either #less, #equal, or #greater) of comparing x with y.
Example:
motoko include=import
Int16.compare(-3, 2) // => #less
This function can be used as value for a high order function, such as a sort function.
Example:
motoko include=import
import Array "mo:base/Array";
Array.sort([1, -2, -3] : [Int16], Int16.compare) // => [-3, -2, 1]public func neg(x : Int16) : Int16Returns the negation of x, -x.
Traps on overflow, i.e. for neg(-2 ** 15).
Example:
motoko include=import
Int16.neg(123) // => -123public func add(x : Int16, y : Int16) : Int16Returns the sum of x and y, x + y.
Traps on overflow/underflow.
Example:
motoko include=import
Int16.add(100, 23) // => +123
Example:
motoko include=import
import Array "mo:base/Array";
Array.foldLeft<Int16, Int16>([1, -2, -3], 0, Int16.add) // => -4public func sub(x : Int16, y : Int16) : Int16Returns the difference of x and y, x - y.
Traps on overflow/underflow.
Example:
motoko include=import
Int16.sub(123, 100) // => +23
Example:
motoko include=import
import Array "mo:base/Array";
Array.foldLeft<Int16, Int16>([1, -2, -3], 0, Int16.sub) // => 4public func mul(x : Int16, y : Int16) : Int16Returns the product of x and y, x * y.
Traps on overflow/underflow.
Example:
motoko include=import
Int16.mul(12, 10) // => +120
Example:
motoko include=import
import Array "mo:base/Array";
Array.foldLeft<Int16, Int16>([1, -2, -3], 1, Int16.mul) // => 6public func div(x : Int16, y : Int16) : Int16Returns the signed integer division of x by y, x / y.
Rounds the quotient towards zero, which is the same as truncating the decimal places of the quotient.
Traps when y is zero.
Example:
motoko include=import
Int16.div(123, 10) // => +12public func rem(x : Int16, y : Int16) : Int16Returns the remainder of the signed integer division of x by y, x % y,
which is defined as x - x / y * y.
Traps when y is zero.
Example:
motoko include=import
Int16.rem(123, 10) // => +3public func pow(x : Int16, y : Int16) : Int16Returns x to the power of y, x ** y.
Traps on overflow/underflow and when y < 0 or y >= 16.
Example:
motoko include=import
Int16.pow(2, 10) // => +1_024public func bitnot(x : Int16) : Int16Returns the bitwise negation of x, ^x.
Example:
motoko include=import
Int16.bitnot(-256 /* 0xff00 */) // => +255 // 0xffpublic func bitand(x : Int16, y : Int16) : Int16Returns the bitwise "and" of x and y, x & y.
Example:
motoko include=import
Int16.bitand(0x0fff, 0x00f0) // => +240 // 0xf0public func bitor(x : Int16, y : Int16) : Int16Returns the bitwise "or" of x and y, x | y.
Example:
motoko include=import
Int16.bitor(0x0f0f, 0x00f0) // => +4_095 // 0x0fffpublic func bitxor(x : Int16, y : Int16) : Int16Returns the bitwise "exclusive or" of x and y, x ^ y.
Example:
motoko include=import
Int16.bitxor(0x0fff, 0x00f0) // => +3_855 // 0x0f0fpublic func bitshiftLeft(x : Int16, y : Int16) : Int16Returns the bitwise left shift of x by y, x << y.
The right bits of the shift filled with zeros.
Left-overflowing bits, including the sign bit, are discarded.
For y >= 16, the semantics is the same as for bitshiftLeft(x, y % 16).
For y < 0, the semantics is the same as for bitshiftLeft(x, y + y % 16).
Example:
motoko include=import
Int16.bitshiftLeft(1, 8) // => +256 // 0x100 equivalent to `2 ** 8`.public func bitshiftRight(x : Int16, y : Int16) : Int16Returns the signed bitwise right shift of x by y, x >> y.
The sign bit is retained and the left side is filled with the sign bit.
Right-underflowing bits are discarded, i.e. not rotated to the left side.
For y >= 16, the semantics is the same as for bitshiftRight(x, y % 16).
For y < 0, the semantics is the same as for bitshiftRight (x, y + y % 16).
Example:
motoko include=import
Int16.bitshiftRight(1024, 8) // => +4 // equivalent to `1024 / (2 ** 8)`public func bitrotLeft(x : Int16, y : Int16) : Int16Returns the bitwise left rotatation of x by y, x <<> y.
Each left-overflowing bit is inserted again on the right side.
The sign bit is rotated like other bits, i.e. the rotation interprets the number as unsigned.
Changes the direction of rotation for negative y.
For y >= 16, the semantics is the same as for bitrotLeft(x, y % 16).
Example:
motoko include=import
Int16.bitrotLeft(0x2001, 4) // => +18 // 0x12.public func bitrotRight(x : Int16, y : Int16) : Int16Returns the bitwise right rotation of x by y, x <>> y.
Each right-underflowing bit is inserted again on the right side.
The sign bit is rotated like other bits, i.e. the rotation interprets the number as unsigned.
Changes the direction of rotation for negative y.
For y >= 16, the semantics is the same as for bitrotRight(x, y % 16).
Example:
motoko include=import
Int16.bitrotRight(0x2010, 8) // => +4_128 // 0x01020.public func bittest(x : Int16, p : Nat) : BoolReturns the value of bit p in x, x & 2**p == 2**p.
If p >= 16, the semantics is the same as for bittest(x, p % 16).
This is equivalent to checking if the p-th bit is set in x, using 0 indexing.
Example:
motoko include=import
Int16.bittest(128, 7) // => truepublic func bitset(x : Int16, p : Nat) : Int16Returns the value of setting bit p in x to 1.
If p >= 16, the semantics is the same as for bitset(x, p % 16).
Example:
motoko include=import
Int16.bitset(0, 7) // => +128public func bitclear(x : Int16, p : Nat) : Int16Returns the value of clearing bit p in x to 0.
If p >= 16, the semantics is the same as for bitclear(x, p % 16).
Example:
motoko include=import
Int16.bitclear(-1, 7) // => -129public func bitflip(x : Int16, p : Nat) : Int16Returns the value of flipping bit p in x.
If p >= 16, the semantics is the same as for bitclear(x, p % 16).
Example:
motoko include=import
Int16.bitflip(255, 7) // => +127public func bitcountNonZero(x : Int16) : Int16Returns the count of non-zero bits in x.
Example:
motoko include=import
Int16.bitcountNonZero(0xff) // => +8public func bitcountLeadingZero(x : Int16) : Int16Returns the count of leading zero bits in x.
Example:
motoko include=import
Int16.bitcountLeadingZero(0x80) // => +8public func bitcountTrailingZero(x : Int16) : Int16Returns the count of trailing zero bits in x.
Example:
motoko include=import
Int16.bitcountTrailingZero(0x0100) // => +8public func explode(x : Int16) : (msb : Nat8, lsb : Nat8)Returns the upper (i.e. most significant) and lower (least significant) byte of x.
Example:
motoko include=import
Int16.explode 0x77ee // => (119, 238)public func addWrap(x : Int16, y : Int16) : Int16Returns the sum of x and y, x +% y.
Wraps on overflow/underflow.
Example:
motoko include=import
Int16.addWrap(2 ** 14, 2 ** 14) // => -32_768 // overflow
:::info
The reason why this function is defined in this library (in addition
to the existing +% operator) is so that you can use it as a function
value to pass to a higher order function. It is not possible to use +%
as a function value at the moment.
:::
public func subWrap(x : Int16, y : Int16) : Int16Returns the difference of x and y, x -% y.
Wraps on overflow/underflow.
Example:
motoko include=import
Int16.subWrap(-2 ** 15, 1) // => +32_767 // underflow