@ragestudio/scylla-odm 0.22.2 → 0.22.4

package/driver/types/integer.js

@@ -0,0 +1,818 @@
+// Copyright 2009 The Closure Library Authors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//      http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS-IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+
+/** @module types */
+
+import utils from "../utils.js"
+
+/**
+ * Constructs a two's-complement integer an array containing bits of the
+ * integer in 32-bit (signed) pieces, given in little-endian order (i.e.,
+ * lowest-order bits in the first piece), and the sign of -1 or 0.
+ *
+ * See the from* functions below for other convenient ways of constructing
+ * Integers.
+ *
+ * The internal representation of an integer is an array of 32-bit signed
+ * pieces, along with a sign (0 or -1) that indicates the contents of all the
+ * other 32-bit pieces out to infinity.  We use 32-bit pieces because these are
+ * the size of integers on which Javascript performs bit-operations.  For
+ * operations like addition and multiplication, we split each number into 16-bit
+ * pieces, which can easily be multiplied within Javascript's floating-point
+ * representation without overflow or change in sign.
+ *
+ * @constructor
+ * @param {Array.<number>} bits Array containing the bits of the number.
+ * @param {number} sign The sign of the number: -1 for negative and 0 positive.
+ * @final
+ */
+function Integer(bits, sign) {
+	/**
+	 * @type {!Array.<number>}
+	 * @private
+	 */
+	this.bits_ = []
+
+	/**
+	 * @type {number}
+	 * @private
+	 */
+	this.sign_ = sign
+
+	// Copy the 32-bit signed integer values passed in.  We prune out those at the
+	// top that equal the sign since they are redundant.
+	var top = true
+	for (var i = bits.length - 1; i >= 0; i--) {
+		var val = bits[i] | 0
+		if (!top || val != sign) {
+			this.bits_[i] = val
+			top = false
+		}
+	}
+}
+
+// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
+// from* methods on which they depend.
+
+/**
+ * A cache of the Integer representations of small integer values.
+ * @type {!Object}
+ * @private
+ */
+Integer.IntCache_ = {}
+
+/**
+ * Returns an Integer representing the given (32-bit) integer value.
+ * @param {number} value A 32-bit integer value.
+ * @return {!Integer} The corresponding Integer value.
+ */
+Integer.fromInt = function (value) {
+	if (-128 <= value && value < 128) {
+		var cachedObj = Integer.IntCache_[value]
+		if (cachedObj) {
+			return cachedObj
+		}
+	}
+
+	var obj = new Integer([value | 0], value < 0 ? -1 : 0)
+	if (-128 <= value && value < 128) {
+		Integer.IntCache_[value] = obj
+	}
+	return obj
+}
+
+/**
+ * Returns an Integer representing the given value, provided that it is a finite
+ * number.  Otherwise, zero is returned.
+ * @param {number} value The value in question.
+ * @return {!Integer} The corresponding Integer value.
+ */
+Integer.fromNumber = function (value) {
+	if (isNaN(value) || !isFinite(value)) {
+		return Integer.ZERO
+	} else if (value < 0) {
+		return Integer.fromNumber(-value).negate()
+	} else {
+		var bits = []
+		var pow = 1
+		for (var i = 0; value >= pow; i++) {
+			bits[i] = (value / pow) | 0
+			pow *= Integer.TWO_PWR_32_DBL_
+		}
+		return new Integer(bits, 0)
+	}
+}
+
+/**
+ * Returns a Integer representing the value that comes by concatenating the
+ * given entries, each is assumed to be 32 signed bits, given in little-endian
+ * order (lowest order bits in the lowest index), and sign-extending the highest
+ * order 32-bit value.
+ * @param {Array.<number>} bits The bits of the number, in 32-bit signed pieces,
+ *     in little-endian order.
+ * @return {!Integer} The corresponding Integer value.
+ */
+Integer.fromBits = function (bits) {
+	var high = bits[bits.length - 1]
+	//noinspection JSBitwiseOperatorUsage
+	return new Integer(bits, high & (1 << 31) ? -1 : 0)
+}
+
+/**
+ * Returns an Integer representation of the given string, written using the
+ * given radix.
+ * @param {string} str The textual representation of the Integer.
+ * @param {number=} opt_radix The radix in which the text is written.
+ * @return {!Integer} The corresponding Integer value.
+ */
+Integer.fromString = function (str, opt_radix) {
+	if (str.length == 0) {
+		throw TypeError("number format error: empty string")
+	}
+
+	var radix = opt_radix || 10
+	if (radix < 2 || 36 < radix) {
+		throw Error("radix out of range: " + radix)
+	}
+
+	if (str.charAt(0) == "-") {
+		return Integer.fromString(str.substring(1), radix).negate()
+	} else if (str.indexOf("-") >= 0) {
+		throw TypeError('number format error: interior "-" character')
+	}
+
+	// Do several (8) digits each time through the loop, so as to
+	// minimize the calls to the very expensive emulated div.
+	var radixToPower = Integer.fromNumber(Math.pow(radix, 8))
+
+	var result = Integer.ZERO
+	for (var i = 0; i < str.length; i += 8) {
+		var size = Math.min(8, str.length - i)
+		var value = parseInt(str.substring(i, i + size), radix)
+		if (size < 8) {
+			var power = Integer.fromNumber(Math.pow(radix, size))
+			result = result.multiply(power).add(Integer.fromNumber(value))
+		} else {
+			result = result.multiply(radixToPower)
+			result = result.add(Integer.fromNumber(value))
+		}
+	}
+	return result
+}
+
+/**
+ * Returns an Integer representation of a given big endian Buffer.
+ * The internal representation of bits contains bytes in groups of 4
+ * @param {Buffer} buf
+ * @returns {Integer}
+ */
+Integer.fromBuffer = function (buf) {
+	var bits = new Array(Math.ceil(buf.length / 4))
+	//noinspection JSBitwiseOperatorUsage
+	var sign = buf[0] & (1 << 7) ? -1 : 0
+	for (var i = 0; i < bits.length; i++) {
+		var offset = buf.length - (i + 1) * 4
+		var value
+		if (offset < 0) {
+			//The buffer length is not multiple of 4
+			offset = offset + 4
+			value = 0
+			for (var j = 0; j < offset; j++) {
+				var byte = buf[j]
+				if (sign === -1) {
+					//invert the bits
+					byte = ~byte & 0xff
+				}
+				value = value | (byte << ((offset - j - 1) * 8))
+			}
+			if (sign === -1) {
+				//invert all the bits
+				value = ~value
+			}
+		} else {
+			value = buf.readInt32BE(offset)
+		}
+		bits[i] = value
+	}
+	return new Integer(bits, sign)
+}
+
+/**
+ * Returns a big endian buffer representation of an Integer.
+ * Internally the bits are represented using 4 bytes groups (numbers),
+ * in the Buffer representation there might be the case where we need less than the 4 bytes.
+ * For example: 0x00000001 -> '01', 0xFFFFFFFF -> 'FF', 0xFFFFFF01 -> 'FF01'
+ * @param {Integer} value
+ * @returns {Buffer}
+ */
+Integer.toBuffer = function (value) {
+	var sign = value.sign_
+	var bits = value.bits_
+	if (bits.length === 0) {
+		//[0] or [0xffffffff]
+		return utils.allocBufferFromArray([value.sign_])
+	}
+	//the high bits might need to be represented in less than 4 bytes
+	var highBits = bits[bits.length - 1]
+	if (sign === -1) {
+		highBits = ~highBits
+	}
+	var high = []
+	if (highBits >>> 24 > 0) {
+		high.push((highBits >> 24) & 0xff)
+	}
+	if (highBits >>> 16 > 0) {
+		high.push((highBits >> 16) & 0xff)
+	}
+	if (highBits >>> 8 > 0) {
+		high.push((highBits >> 8) & 0xff)
+	}
+	high.push(highBits & 0xff)
+	if (sign === -1) {
+		//The byte containing the sign bit got removed
+		if (high[0] >> 7 !== 0) {
+			//it is going to be negated
+			high.unshift(0)
+		}
+	} else if (high[0] >> 7 !== 0) {
+		//its positive but it lost the byte containing the sign bit
+		high.unshift(0)
+	}
+	var buf = utils.allocBufferUnsafe(high.length + (bits.length - 1) * 4)
+	for (var j = 0; j < high.length; j++) {
+		var b = high[j]
+		if (sign === -1) {
+			buf[j] = ~b
+		} else {
+			buf[j] = b
+		}
+	}
+	for (var i = 0; i < bits.length - 1; i++) {
+		var group = bits[bits.length - 2 - i]
+		var offset = high.length + i * 4
+		buf.writeInt32BE(group, offset)
+	}
+	return buf
+}
+
+/**
+ * A number used repeatedly in calculations.  This must appear before the first
+ * call to the from* functions below.
+ * @type {number}
+ * @private
+ */
+Integer.TWO_PWR_32_DBL_ = (1 << 16) * (1 << 16)
+
+/** @type {!Integer} */
+Integer.ZERO = Integer.fromInt(0)
+
+/** @type {!Integer} */
+Integer.ONE = Integer.fromInt(1)
+
+/**
+ * @type {!Integer}
+ * @private
+ */
+Integer.TWO_PWR_24_ = Integer.fromInt(1 << 24)
+
+/**
+ * Returns the value, assuming it is a 32-bit integer.
+ * @return {number} The corresponding int value.
+ */
+Integer.prototype.toInt = function () {
+	return this.bits_.length > 0 ? this.bits_[0] : this.sign_
+}
+
+/** @return {number} The closest floating-point representation to this value. */
+Integer.prototype.toNumber = function () {
+	if (this.isNegative()) {
+		return -this.negate().toNumber()
+	} else {
+		var val = 0
+		var pow = 1
+		for (var i = 0; i < this.bits_.length; i++) {
+			val += this.getBitsUnsigned(i) * pow
+			pow *= Integer.TWO_PWR_32_DBL_
+		}
+		return val
+	}
+}
+
+/**
+ * @param {number=} opt_radix The radix in which the text should be written.
+ * @return {string} The textual representation of this value.
+ * @override
+ */
+Integer.prototype.toString = function (opt_radix) {
+	var radix = opt_radix || 10
+	if (radix < 2 || 36 < radix) {
+		throw Error("radix out of range: " + radix)
+	}
+
+	if (this.isZero()) {
+		return "0"
+	} else if (this.isNegative()) {
+		return "-" + this.negate().toString(radix)
+	}
+
+	// Do several (6) digits each time through the loop, so as to
+	// minimize the calls to the very expensive emulated div.
+	var radixToPower = Integer.fromNumber(Math.pow(radix, 6))
+
+	var rem = this
+	var result = ""
+	while (true) {
+		var remDiv = rem.divide(radixToPower)
+		var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt()
+		var digits = intval.toString(radix)
+
+		rem = remDiv
+		if (rem.isZero()) {
+			return digits + result
+		} else {
+			while (digits.length < 6) {
+				digits = "0" + digits
+			}
+			result = "" + digits + result
+		}
+	}
+}
+
+/**
+ * Returns the index-th 32-bit (signed) piece of the Integer according to
+ * little-endian order (i.e., index 0 contains the smallest bits).
+ * @param {number} index The index in question.
+ * @return {number} The requested 32-bits as a signed number.
+ */
+Integer.prototype.getBits = function (index) {
+	if (index < 0) {
+		return 0 // Allowing this simplifies bit shifting operations below...
+	} else if (index < this.bits_.length) {
+		return this.bits_[index]
+	} else {
+		return this.sign_
+	}
+}
+
+/**
+ * Returns the index-th 32-bit piece as an unsigned number.
+ * @param {number} index The index in question.
+ * @return {number} The requested 32-bits as an unsigned number.
+ */
+Integer.prototype.getBitsUnsigned = function (index) {
+	var val = this.getBits(index)
+	return val >= 0 ? val : Integer.TWO_PWR_32_DBL_ + val
+}
+
+/** @return {number} The sign bit of this number, -1 or 0. */
+Integer.prototype.getSign = function () {
+	return this.sign_
+}
+
+/** @return {boolean} Whether this value is zero. */
+Integer.prototype.isZero = function () {
+	if (this.sign_ != 0) {
+		return false
+	}
+	for (var i = 0; i < this.bits_.length; i++) {
+		if (this.bits_[i] != 0) {
+			return false
+		}
+	}
+	return true
+}
+
+/** @return {boolean} Whether this value is negative. */
+Integer.prototype.isNegative = function () {
+	return this.sign_ == -1
+}
+
+/** @return {boolean} Whether this value is odd. */
+Integer.prototype.isOdd = function () {
+	return (
+		(this.bits_.length == 0 && this.sign_ == -1) ||
+		(this.bits_.length > 0 && (this.bits_[0] & 1) != 0)
+	)
+}
+
+/**
+ * @param {Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer equals the other.
+ */
+Integer.prototype.equals = function (other) {
+	if (this.sign_ != other.sign_) {
+		return false
+	}
+	var len = Math.max(this.bits_.length, other.bits_.length)
+	for (var i = 0; i < len; i++) {
+		if (this.getBits(i) != other.getBits(i)) {
+			return false
+		}
+	}
+	return true
+}
+
+/**
+ * @param {Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer does not equal the other.
+ */
+Integer.prototype.notEquals = function (other) {
+	return !this.equals(other)
+}
+
+/**
+ * @param {Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is greater than the other.
+ */
+Integer.prototype.greaterThan = function (other) {
+	return this.compare(other) > 0
+}
+
+/**
+ * @param {Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is greater than or equal to the other.
+ */
+Integer.prototype.greaterThanOrEqual = function (other) {
+	return this.compare(other) >= 0
+}
+
+/**
+ * @param {Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is less than the other.
+ */
+Integer.prototype.lessThan = function (other) {
+	return this.compare(other) < 0
+}
+
+/**
+ * @param {Integer} other Integer to compare against.
+ * @return {boolean} Whether this Integer is less than or equal to the other.
+ */
+Integer.prototype.lessThanOrEqual = function (other) {
+	return this.compare(other) <= 0
+}
+
+/**
+ * Compares this Integer with the given one.
+ * @param {Integer} other Integer to compare against.
+ * @return {number} 0 if they are the same, 1 if the this is greater, and -1
+ *     if the given one is greater.
+ */
+Integer.prototype.compare = function (other) {
+	var diff = this.subtract(other)
+	if (diff.isNegative()) {
+		return -1
+	} else if (diff.isZero()) {
+		return 0
+	} else {
+		return +1
+	}
+}
+
+/**
+ * Returns an integer with only the first numBits bits of this value, sign
+ * extended from the final bit.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!Integer} The shorted integer value.
+ */
+Integer.prototype.shorten = function (numBits) {
+	var arr_index = (numBits - 1) >> 5
+	var bit_index = (numBits - 1) % 32
+	var bits = []
+	for (var i = 0; i < arr_index; i++) {
+		bits[i] = this.getBits(i)
+	}
+	var sigBits = bit_index == 31 ? 0xffffffff : (1 << (bit_index + 1)) - 1
+	var val = this.getBits(arr_index) & sigBits
+	//noinspection JSBitwiseOperatorUsage
+	if (val & (1 << bit_index)) {
+		val |= 0xffffffff - sigBits
+		bits[arr_index] = val
+		return new Integer(bits, -1)
+	} else {
+		bits[arr_index] = val
+		return new Integer(bits, 0)
+	}
+}
+
+/** @return {!Integer} The negation of this value. */
+Integer.prototype.negate = function () {
+	return this.not().add(Integer.ONE)
+}
+
+/**
+ * Returns the sum of this and the given Integer.
+ * @param {Integer} other The Integer to add to this.
+ * @return {!Integer} The Integer result.
+ */
+Integer.prototype.add = function (other) {
+	var len = Math.max(this.bits_.length, other.bits_.length)
+	var arr = []
+	var carry = 0
+
+	for (var i = 0; i <= len; i++) {
+		var a1 = this.getBits(i) >>> 16
+		var a0 = this.getBits(i) & 0xffff
+
+		var b1 = other.getBits(i) >>> 16
+		var b0 = other.getBits(i) & 0xffff
+
+		var c0 = carry + a0 + b0
+		var c1 = (c0 >>> 16) + a1 + b1
+		carry = c1 >>> 16
+		c0 &= 0xffff
+		c1 &= 0xffff
+		arr[i] = (c1 << 16) | c0
+	}
+	return Integer.fromBits(arr)
+}
+
+/**
+ * Returns the difference of this and the given Integer.
+ * @param {Integer} other The Integer to subtract from this.
+ * @return {!Integer} The Integer result.
+ */
+Integer.prototype.subtract = function (other) {
+	return this.add(other.negate())
+}
+
+/**
+ * Returns the product of this and the given Integer.
+ * @param {Integer} other The Integer to multiply against this.
+ * @return {!Integer} The product of this and the other.
+ */
+Integer.prototype.multiply = function (other) {
+	if (this.isZero()) {
+		return Integer.ZERO
+	} else if (other.isZero()) {
+		return Integer.ZERO
+	}
+
+	if (this.isNegative()) {
+		if (other.isNegative()) {
+			return this.negate().multiply(other.negate())
+		} else {
+			return this.negate().multiply(other).negate()
+		}
+	} else if (other.isNegative()) {
+		return this.multiply(other.negate()).negate()
+	}
+
+	// If both numbers are small, use float multiplication
+	if (
+		this.lessThan(Integer.TWO_PWR_24_) &&
+		other.lessThan(Integer.TWO_PWR_24_)
+	) {
+		return Integer.fromNumber(this.toNumber() * other.toNumber())
+	}
+
+	// Fill in an array of 16-bit products.
+	var len = this.bits_.length + other.bits_.length
+	var arr = []
+	for (var i = 0; i < 2 * len; i++) {
+		arr[i] = 0
+	}
+	for (var i = 0; i < this.bits_.length; i++) {
+		for (var j = 0; j < other.bits_.length; j++) {
+			var a1 = this.getBits(i) >>> 16
+			var a0 = this.getBits(i) & 0xffff
+
+			var b1 = other.getBits(j) >>> 16
+			var b0 = other.getBits(j) & 0xffff
+
+			arr[2 * i + 2 * j] += a0 * b0
+			Integer.carry16_(arr, 2 * i + 2 * j)
+			arr[2 * i + 2 * j + 1] += a1 * b0
+			Integer.carry16_(arr, 2 * i + 2 * j + 1)
+			arr[2 * i + 2 * j + 1] += a0 * b1
+			Integer.carry16_(arr, 2 * i + 2 * j + 1)
+			arr[2 * i + 2 * j + 2] += a1 * b1
+			Integer.carry16_(arr, 2 * i + 2 * j + 2)
+		}
+	}
+
+	// Combine the 16-bit values into 32-bit values.
+	for (var i = 0; i < len; i++) {
+		arr[i] = (arr[2 * i + 1] << 16) | arr[2 * i]
+	}
+	for (var i = len; i < 2 * len; i++) {
+		arr[i] = 0
+	}
+	return new Integer(arr, 0)
+}
+
+/**
+ * Carries any overflow from the given index into later entries.
+ * @param {Array.<number>} bits Array of 16-bit values in little-endian order.
+ * @param {number} index The index in question.
+ * @private
+ */
+Integer.carry16_ = function (bits, index) {
+	while ((bits[index] & 0xffff) != bits[index]) {
+		bits[index + 1] += bits[index] >>> 16
+		bits[index] &= 0xffff
+	}
+}
+
+/**
+ * Returns this Integer divided by the given one.
+ * @param {Integer} other Th Integer to divide this by.
+ * @return {!Integer} This value divided by the given one.
+ */
+Integer.prototype.divide = function (other) {
+	if (other.isZero()) {
+		throw Error("division by zero")
+	} else if (this.isZero()) {
+		return Integer.ZERO
+	}
+
+	if (this.isNegative()) {
+		if (other.isNegative()) {
+			return this.negate().divide(other.negate())
+		} else {
+			return this.negate().divide(other).negate()
+		}
+	} else if (other.isNegative()) {
+		return this.divide(other.negate()).negate()
+	}
+
+	// Repeat the following until the remainder is less than other:  find a
+	// floating-point that approximates remainder / other *from below*, add this
+	// into the result, and subtract it from the remainder.  It is critical that
+	// the approximate value is less than or equal to the real value so that the
+	// remainder never becomes negative.
+	var res = Integer.ZERO
+	var rem = this
+	while (rem.greaterThanOrEqual(other)) {
+		// Approximate the result of division. This may be a little greater or
+		// smaller than the actual value.
+		var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()))
+
+		// We will tweak the approximate result by changing it in the 48-th digit or
+		// the smallest non-fractional digit, whichever is larger.
+		var log2 = Math.ceil(Math.log(approx) / Math.LN2)
+		var delta = log2 <= 48 ? 1 : Math.pow(2, log2 - 48)
+
+		// Decrease the approximation until it is smaller than the remainder.  Note
+		// that if it is too large, the product overflows and is negative.
+		var approxRes = Integer.fromNumber(approx)
+		var approxRem = approxRes.multiply(other)
+		while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
+			approx -= delta
+			approxRes = Integer.fromNumber(approx)
+			approxRem = approxRes.multiply(other)
+		}
+
+		// We know the answer can't be zero... and actually, zero would cause
+		// infinite recursion since we would make no progress.
+		if (approxRes.isZero()) {
+			approxRes = Integer.ONE
+		}
+
+		res = res.add(approxRes)
+		rem = rem.subtract(approxRem)
+	}
+	return res
+}
+
+/**
+ * Returns this Integer modulo the given one.
+ * @param {Integer} other The Integer by which to mod.
+ * @return {!Integer} This value modulo the given one.
+ */
+Integer.prototype.modulo = function (other) {
+	return this.subtract(this.divide(other).multiply(other))
+}
+
+/** @return {!Integer} The bitwise-NOT of this value. */
+Integer.prototype.not = function () {
+	var len = this.bits_.length
+	var arr = []
+	for (var i = 0; i < len; i++) {
+		arr[i] = ~this.bits_[i]
+	}
+	return new Integer(arr, ~this.sign_)
+}
+
+/**
+ * Returns the bitwise-AND of this Integer and the given one.
+ * @param {Integer} other The Integer to AND with this.
+ * @return {!Integer} The bitwise-AND of this and the other.
+ */
+Integer.prototype.and = function (other) {
+	var len = Math.max(this.bits_.length, other.bits_.length)
+	var arr = []
+	for (var i = 0; i < len; i++) {
+		arr[i] = this.getBits(i) & other.getBits(i)
+	}
+	return new Integer(arr, this.sign_ & other.sign_)
+}
+
+/**
+ * Returns the bitwise-OR of this Integer and the given one.
+ * @param {Integer} other The Integer to OR with this.
+ * @return {!Integer} The bitwise-OR of this and the other.
+ */
+Integer.prototype.or = function (other) {
+	var len = Math.max(this.bits_.length, other.bits_.length)
+	var arr = []
+	for (var i = 0; i < len; i++) {
+		arr[i] = this.getBits(i) | other.getBits(i)
+	}
+	return new Integer(arr, this.sign_ | other.sign_)
+}
+
+/**
+ * Returns the bitwise-XOR of this Integer and the given one.
+ * @param {Integer} other The Integer to XOR with this.
+ * @return {!Integer} The bitwise-XOR of this and the other.
+ */
+Integer.prototype.xor = function (other) {
+	var len = Math.max(this.bits_.length, other.bits_.length)
+	var arr = []
+	for (var i = 0; i < len; i++) {
+		arr[i] = this.getBits(i) ^ other.getBits(i)
+	}
+	return new Integer(arr, this.sign_ ^ other.sign_)
+}
+
+/**
+ * Returns this value with bits shifted to the left by the given amount.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!Integer} This shifted to the left by the given amount.
+ */
+Integer.prototype.shiftLeft = function (numBits) {
+	var arr_delta = numBits >> 5
+	var bit_delta = numBits % 32
+	var len = this.bits_.length + arr_delta + (bit_delta > 0 ? 1 : 0)
+	var arr = []
+	for (var i = 0; i < len; i++) {
+		if (bit_delta > 0) {
+			arr[i] =
+				(this.getBits(i - arr_delta) << bit_delta) |
+				(this.getBits(i - arr_delta - 1) >>> (32 - bit_delta))
+		} else {
+			arr[i] = this.getBits(i - arr_delta)
+		}
+	}
+	return new Integer(arr, this.sign_)
+}
+
+/**
+ * Returns this value with bits shifted to the right by the given amount.
+ * @param {number} numBits The number of bits by which to shift.
+ * @return {!Integer} This shifted to the right by the given amount.
+ */
+Integer.prototype.shiftRight = function (numBits) {
+	var arr_delta = numBits >> 5
+	var bit_delta = numBits % 32
+	var len = this.bits_.length - arr_delta
+	var arr = []
+	for (var i = 0; i < len; i++) {
+		if (bit_delta > 0) {
+			arr[i] =
+				(this.getBits(i + arr_delta) >>> bit_delta) |
+				(this.getBits(i + arr_delta + 1) << (32 - bit_delta))
+		} else {
+			arr[i] = this.getBits(i + arr_delta)
+		}
+	}
+	return new Integer(arr, this.sign_)
+}
+
+/**
+ * Provide the name of the constructor and the string representation
+ * @returns {string}
+ */
+Integer.prototype.inspect = function () {
+	return this.constructor.name + ": " + this.toString()
+}
+
+/**
+ * Returns a Integer whose value is the absolute value of this
+ * @returns {Integer}
+ */
+Integer.prototype.abs = function () {
+	return this.sign_ === 0 ? this : this.negate()
+}
+
+/**
+ * Returns the string representation.
+ * Method used by the native JSON.stringify() to serialize this instance.
+ */
+Integer.prototype.toJSON = function () {
+	return this.toString()
+}
+
+export default Integer