899 lines
36 KiB
JavaScript
899 lines
36 KiB
JavaScript
|
"use strict";
|
||
|
|
Object.defineProperty(exports, "__esModule", { value: true });
|
||
|
|
exports.Long = void 0;
|
||
|
|
var utils_1 = require("./parser/utils");
|
||
|
|
/**
|
||
|
|
* wasm optimizations, to do native i64 multiplication and divide
|
||
|
|
*/
|
||
|
|
var wasm = undefined;
|
||
|
|
try {
|
||
|
|
wasm = new WebAssembly.Instance(new WebAssembly.Module(
|
||
|
|
// prettier-ignore
|
||
|
|
new Uint8Array([0, 97, 115, 109, 1, 0, 0, 0, 1, 13, 2, 96, 0, 1, 127, 96, 4, 127, 127, 127, 127, 1, 127, 3, 7, 6, 0, 1, 1, 1, 1, 1, 6, 6, 1, 127, 1, 65, 0, 11, 7, 50, 6, 3, 109, 117, 108, 0, 1, 5, 100, 105, 118, 95, 115, 0, 2, 5, 100, 105, 118, 95, 117, 0, 3, 5, 114, 101, 109, 95, 115, 0, 4, 5, 114, 101, 109, 95, 117, 0, 5, 8, 103, 101, 116, 95, 104, 105, 103, 104, 0, 0, 10, 191, 1, 6, 4, 0, 35, 0, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 126, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 127, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 128, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 129, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11, 36, 1, 1, 126, 32, 0, 173, 32, 1, 173, 66, 32, 134, 132, 32, 2, 173, 32, 3, 173, 66, 32, 134, 132, 130, 34, 4, 66, 32, 135, 167, 36, 0, 32, 4, 167, 11])), {}).exports;
|
||
|
|
}
|
||
|
|
catch (_a) {
|
||
|
|
// no wasm support
|
||
|
|
}
|
||
|
|
var TWO_PWR_16_DBL = 1 << 16;
|
||
|
|
var TWO_PWR_24_DBL = 1 << 24;
|
||
|
|
var TWO_PWR_32_DBL = TWO_PWR_16_DBL * TWO_PWR_16_DBL;
|
||
|
|
var TWO_PWR_64_DBL = TWO_PWR_32_DBL * TWO_PWR_32_DBL;
|
||
|
|
var TWO_PWR_63_DBL = TWO_PWR_64_DBL / 2;
|
||
|
|
/** A cache of the Long representations of small integer values. */
|
||
|
|
var INT_CACHE = {};
|
||
|
|
/** A cache of the Long representations of small unsigned integer values. */
|
||
|
|
var UINT_CACHE = {};
|
||
|
|
/**
|
||
|
|
* A class representing a 64-bit integer
|
||
|
|
* @public
|
||
|
|
* @remarks
|
||
|
|
* The internal representation of a long is the two given signed, 32-bit values.
|
||
|
|
* 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.
|
||
|
|
* In the algorithms below, we frequently reduce the negative case to the
|
||
|
|
* positive case by negating the input(s) and then post-processing the result.
|
||
|
|
* Note that we must ALWAYS check specially whether those values are MIN_VALUE
|
||
|
|
* (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
|
||
|
|
* a positive number, it overflows back into a negative). Not handling this
|
||
|
|
* case would often result in infinite recursion.
|
||
|
|
* Common constant values ZERO, ONE, NEG_ONE, etc. are found as static properties on this class.
|
||
|
|
*/
|
||
|
|
var Long = /** @class */ (function () {
|
||
|
|
/**
|
||
|
|
* Constructs a 64 bit two's-complement integer, given its low and high 32 bit values as *signed* integers.
|
||
|
|
* See the from* functions below for more convenient ways of constructing Longs.
|
||
|
|
*
|
||
|
|
* Acceptable signatures are:
|
||
|
|
* - Long(low, high, unsigned?)
|
||
|
|
* - Long(bigint, unsigned?)
|
||
|
|
* - Long(string, unsigned?)
|
||
|
|
*
|
||
|
|
* @param low - The low (signed) 32 bits of the long
|
||
|
|
* @param high - The high (signed) 32 bits of the long
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
*/
|
||
|
|
function Long(low, high, unsigned) {
|
||
|
|
if (low === void 0) { low = 0; }
|
||
|
|
if (!(this instanceof Long))
|
||
|
|
return new Long(low, high, unsigned);
|
||
|
|
if (typeof low === 'bigint') {
|
||
|
|
Object.assign(this, Long.fromBigInt(low, !!high));
|
||
|
|
}
|
||
|
|
else if (typeof low === 'string') {
|
||
|
|
Object.assign(this, Long.fromString(low, !!high));
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
this.low = low | 0;
|
||
|
|
this.high = high | 0;
|
||
|
|
this.unsigned = !!unsigned;
|
||
|
|
}
|
||
|
|
Object.defineProperty(this, '__isLong__', {
|
||
|
|
value: true,
|
||
|
|
configurable: false,
|
||
|
|
writable: false,
|
||
|
|
enumerable: false
|
||
|
|
});
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* Returns a Long representing the 64 bit integer that comes by concatenating the given low and high bits.
|
||
|
|
* Each is assumed to use 32 bits.
|
||
|
|
* @param lowBits - The low 32 bits
|
||
|
|
* @param highBits - The high 32 bits
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromBits = function (lowBits, highBits, unsigned) {
|
||
|
|
return new Long(lowBits, highBits, unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns a Long representing the given 32 bit integer value.
|
||
|
|
* @param value - The 32 bit integer in question
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromInt = function (value, unsigned) {
|
||
|
|
var obj, cachedObj, cache;
|
||
|
|
if (unsigned) {
|
||
|
|
value >>>= 0;
|
||
|
|
if ((cache = 0 <= value && value < 256)) {
|
||
|
|
cachedObj = UINT_CACHE[value];
|
||
|
|
if (cachedObj)
|
||
|
|
return cachedObj;
|
||
|
|
}
|
||
|
|
obj = Long.fromBits(value, (value | 0) < 0 ? -1 : 0, true);
|
||
|
|
if (cache)
|
||
|
|
UINT_CACHE[value] = obj;
|
||
|
|
return obj;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
value |= 0;
|
||
|
|
if ((cache = -128 <= value && value < 128)) {
|
||
|
|
cachedObj = INT_CACHE[value];
|
||
|
|
if (cachedObj)
|
||
|
|
return cachedObj;
|
||
|
|
}
|
||
|
|
obj = Long.fromBits(value, value < 0 ? -1 : 0, false);
|
||
|
|
if (cache)
|
||
|
|
INT_CACHE[value] = obj;
|
||
|
|
return obj;
|
||
|
|
}
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
|
||
|
|
* @param value - The number in question
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromNumber = function (value, unsigned) {
|
||
|
|
if (isNaN(value))
|
||
|
|
return unsigned ? Long.UZERO : Long.ZERO;
|
||
|
|
if (unsigned) {
|
||
|
|
if (value < 0)
|
||
|
|
return Long.UZERO;
|
||
|
|
if (value >= TWO_PWR_64_DBL)
|
||
|
|
return Long.MAX_UNSIGNED_VALUE;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
if (value <= -TWO_PWR_63_DBL)
|
||
|
|
return Long.MIN_VALUE;
|
||
|
|
if (value + 1 >= TWO_PWR_63_DBL)
|
||
|
|
return Long.MAX_VALUE;
|
||
|
|
}
|
||
|
|
if (value < 0)
|
||
|
|
return Long.fromNumber(-value, unsigned).neg();
|
||
|
|
return Long.fromBits(value % TWO_PWR_32_DBL | 0, (value / TWO_PWR_32_DBL) | 0, unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
|
||
|
|
* @param value - The number in question
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromBigInt = function (value, unsigned) {
|
||
|
|
return Long.fromString(value.toString(), unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns a Long representation of the given string, written using the specified radix.
|
||
|
|
* @param str - The textual representation of the Long
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @param radix - The radix in which the text is written (2-36), defaults to 10
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromString = function (str, unsigned, radix) {
|
||
|
|
if (str.length === 0)
|
||
|
|
throw Error('empty string');
|
||
|
|
if (str === 'NaN' || str === 'Infinity' || str === '+Infinity' || str === '-Infinity')
|
||
|
|
return Long.ZERO;
|
||
|
|
if (typeof unsigned === 'number') {
|
||
|
|
// For goog.math.long compatibility
|
||
|
|
(radix = unsigned), (unsigned = false);
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
unsigned = !!unsigned;
|
||
|
|
}
|
||
|
|
radix = radix || 10;
|
||
|
|
if (radix < 2 || 36 < radix)
|
||
|
|
throw RangeError('radix');
|
||
|
|
var p;
|
||
|
|
if ((p = str.indexOf('-')) > 0)
|
||
|
|
throw Error('interior hyphen');
|
||
|
|
else if (p === 0) {
|
||
|
|
return Long.fromString(str.substring(1), unsigned, radix).neg();
|
||
|
|
}
|
||
|
|
// Do several (8) digits each time through the loop, so as to
|
||
|
|
// minimize the calls to the very expensive emulated div.
|
||
|
|
var radixToPower = Long.fromNumber(Math.pow(radix, 8));
|
||
|
|
var result = Long.ZERO;
|
||
|
|
for (var i = 0; i < str.length; i += 8) {
|
||
|
|
var size = Math.min(8, str.length - i), value = parseInt(str.substring(i, i + size), radix);
|
||
|
|
if (size < 8) {
|
||
|
|
var power = Long.fromNumber(Math.pow(radix, size));
|
||
|
|
result = result.mul(power).add(Long.fromNumber(value));
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
result = result.mul(radixToPower);
|
||
|
|
result = result.add(Long.fromNumber(value));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
result.unsigned = unsigned;
|
||
|
|
return result;
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Creates a Long from its byte representation.
|
||
|
|
* @param bytes - Byte representation
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @param le - Whether little or big endian, defaults to big endian
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromBytes = function (bytes, unsigned, le) {
|
||
|
|
return le ? Long.fromBytesLE(bytes, unsigned) : Long.fromBytesBE(bytes, unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Creates a Long from its little endian byte representation.
|
||
|
|
* @param bytes - Little endian byte representation
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromBytesLE = function (bytes, unsigned) {
|
||
|
|
return new Long(bytes[0] | (bytes[1] << 8) | (bytes[2] << 16) | (bytes[3] << 24), bytes[4] | (bytes[5] << 8) | (bytes[6] << 16) | (bytes[7] << 24), unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Creates a Long from its big endian byte representation.
|
||
|
|
* @param bytes - Big endian byte representation
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
* @returns The corresponding Long value
|
||
|
|
*/
|
||
|
|
Long.fromBytesBE = function (bytes, unsigned) {
|
||
|
|
return new Long((bytes[4] << 24) | (bytes[5] << 16) | (bytes[6] << 8) | bytes[7], (bytes[0] << 24) | (bytes[1] << 16) | (bytes[2] << 8) | bytes[3], unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Tests if the specified object is a Long.
|
||
|
|
*/
|
||
|
|
// eslint-disable-next-line @typescript-eslint/no-explicit-any, @typescript-eslint/explicit-module-boundary-types
|
||
|
|
Long.isLong = function (value) {
|
||
|
|
return utils_1.isObjectLike(value) && value['__isLong__'] === true;
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Converts the specified value to a Long.
|
||
|
|
* @param unsigned - Whether unsigned or not, defaults to signed
|
||
|
|
*/
|
||
|
|
Long.fromValue = function (val, unsigned) {
|
||
|
|
if (typeof val === 'number')
|
||
|
|
return Long.fromNumber(val, unsigned);
|
||
|
|
if (typeof val === 'string')
|
||
|
|
return Long.fromString(val, unsigned);
|
||
|
|
// Throws for non-objects, converts non-instanceof Long:
|
||
|
|
return Long.fromBits(val.low, val.high, typeof unsigned === 'boolean' ? unsigned : val.unsigned);
|
||
|
|
};
|
||
|
|
/** Returns the sum of this and the specified Long. */
|
||
|
|
Long.prototype.add = function (addend) {
|
||
|
|
if (!Long.isLong(addend))
|
||
|
|
addend = Long.fromValue(addend);
|
||
|
|
// Divide each number into 4 chunks of 16 bits, and then sum the chunks.
|
||
|
|
var a48 = this.high >>> 16;
|
||
|
|
var a32 = this.high & 0xffff;
|
||
|
|
var a16 = this.low >>> 16;
|
||
|
|
var a00 = this.low & 0xffff;
|
||
|
|
var b48 = addend.high >>> 16;
|
||
|
|
var b32 = addend.high & 0xffff;
|
||
|
|
var b16 = addend.low >>> 16;
|
||
|
|
var b00 = addend.low & 0xffff;
|
||
|
|
var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
|
||
|
|
c00 += a00 + b00;
|
||
|
|
c16 += c00 >>> 16;
|
||
|
|
c00 &= 0xffff;
|
||
|
|
c16 += a16 + b16;
|
||
|
|
c32 += c16 >>> 16;
|
||
|
|
c16 &= 0xffff;
|
||
|
|
c32 += a32 + b32;
|
||
|
|
c48 += c32 >>> 16;
|
||
|
|
c32 &= 0xffff;
|
||
|
|
c48 += a48 + b48;
|
||
|
|
c48 &= 0xffff;
|
||
|
|
return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns the sum of this and the specified Long.
|
||
|
|
* @returns Sum
|
||
|
|
*/
|
||
|
|
Long.prototype.and = function (other) {
|
||
|
|
if (!Long.isLong(other))
|
||
|
|
other = Long.fromValue(other);
|
||
|
|
return Long.fromBits(this.low & other.low, this.high & other.high, this.unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Compares this Long's value with the specified's.
|
||
|
|
* @returns 0 if they are the same, 1 if the this is greater and -1 if the given one is greater
|
||
|
|
*/
|
||
|
|
Long.prototype.compare = function (other) {
|
||
|
|
if (!Long.isLong(other))
|
||
|
|
other = Long.fromValue(other);
|
||
|
|
if (this.eq(other))
|
||
|
|
return 0;
|
||
|
|
var thisNeg = this.isNegative(), otherNeg = other.isNegative();
|
||
|
|
if (thisNeg && !otherNeg)
|
||
|
|
return -1;
|
||
|
|
if (!thisNeg && otherNeg)
|
||
|
|
return 1;
|
||
|
|
// At this point the sign bits are the same
|
||
|
|
if (!this.unsigned)
|
||
|
|
return this.sub(other).isNegative() ? -1 : 1;
|
||
|
|
// Both are positive if at least one is unsigned
|
||
|
|
return other.high >>> 0 > this.high >>> 0 ||
|
||
|
|
(other.high === this.high && other.low >>> 0 > this.low >>> 0)
|
||
|
|
? -1
|
||
|
|
: 1;
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.compare} */
|
||
|
|
Long.prototype.comp = function (other) {
|
||
|
|
return this.compare(other);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns this Long divided by the specified. The result is signed if this Long is signed or unsigned if this Long is unsigned.
|
||
|
|
* @returns Quotient
|
||
|
|
*/
|
||
|
|
Long.prototype.divide = function (divisor) {
|
||
|
|
if (!Long.isLong(divisor))
|
||
|
|
divisor = Long.fromValue(divisor);
|
||
|
|
if (divisor.isZero())
|
||
|
|
throw Error('division by zero');
|
||
|
|
// use wasm support if present
|
||
|
|
if (wasm) {
|
||
|
|
// guard against signed division overflow: the largest
|
||
|
|
// negative number / -1 would be 1 larger than the largest
|
||
|
|
// positive number, due to two's complement.
|
||
|
|
if (!this.unsigned &&
|
||
|
|
this.high === -0x80000000 &&
|
||
|
|
divisor.low === -1 &&
|
||
|
|
divisor.high === -1) {
|
||
|
|
// be consistent with non-wasm code path
|
||
|
|
return this;
|
||
|
|
}
|
||
|
|
var low = (this.unsigned ? wasm.div_u : wasm.div_s)(this.low, this.high, divisor.low, divisor.high);
|
||
|
|
return Long.fromBits(low, wasm.get_high(), this.unsigned);
|
||
|
|
}
|
||
|
|
if (this.isZero())
|
||
|
|
return this.unsigned ? Long.UZERO : Long.ZERO;
|
||
|
|
var approx, rem, res;
|
||
|
|
if (!this.unsigned) {
|
||
|
|
// This section is only relevant for signed longs and is derived from the
|
||
|
|
// closure library as a whole.
|
||
|
|
if (this.eq(Long.MIN_VALUE)) {
|
||
|
|
if (divisor.eq(Long.ONE) || divisor.eq(Long.NEG_ONE))
|
||
|
|
return Long.MIN_VALUE;
|
||
|
|
// recall that -MIN_VALUE == MIN_VALUE
|
||
|
|
else if (divisor.eq(Long.MIN_VALUE))
|
||
|
|
return Long.ONE;
|
||
|
|
else {
|
||
|
|
// At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
|
||
|
|
var halfThis = this.shr(1);
|
||
|
|
approx = halfThis.div(divisor).shl(1);
|
||
|
|
if (approx.eq(Long.ZERO)) {
|
||
|
|
return divisor.isNegative() ? Long.ONE : Long.NEG_ONE;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
rem = this.sub(divisor.mul(approx));
|
||
|
|
res = approx.add(rem.div(divisor));
|
||
|
|
return res;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else if (divisor.eq(Long.MIN_VALUE))
|
||
|
|
return this.unsigned ? Long.UZERO : Long.ZERO;
|
||
|
|
if (this.isNegative()) {
|
||
|
|
if (divisor.isNegative())
|
||
|
|
return this.neg().div(divisor.neg());
|
||
|
|
return this.neg().div(divisor).neg();
|
||
|
|
}
|
||
|
|
else if (divisor.isNegative())
|
||
|
|
return this.div(divisor.neg()).neg();
|
||
|
|
res = Long.ZERO;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
// The algorithm below has not been made for unsigned longs. It's therefore
|
||
|
|
// required to take special care of the MSB prior to running it.
|
||
|
|
if (!divisor.unsigned)
|
||
|
|
divisor = divisor.toUnsigned();
|
||
|
|
if (divisor.gt(this))
|
||
|
|
return Long.UZERO;
|
||
|
|
if (divisor.gt(this.shru(1)))
|
||
|
|
// 15 >>> 1 = 7 ; with divisor = 8 ; true
|
||
|
|
return Long.UONE;
|
||
|
|
res = Long.UZERO;
|
||
|
|
}
|
||
|
|
// 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.
|
||
|
|
rem = this;
|
||
|
|
while (rem.gte(divisor)) {
|
||
|
|
// Approximate the result of division. This may be a little greater or
|
||
|
|
// smaller than the actual value.
|
||
|
|
approx = Math.max(1, Math.floor(rem.toNumber() / divisor.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 = Long.fromNumber(approx);
|
||
|
|
var approxRem = approxRes.mul(divisor);
|
||
|
|
while (approxRem.isNegative() || approxRem.gt(rem)) {
|
||
|
|
approx -= delta;
|
||
|
|
approxRes = Long.fromNumber(approx, this.unsigned);
|
||
|
|
approxRem = approxRes.mul(divisor);
|
||
|
|
}
|
||
|
|
// 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 = Long.ONE;
|
||
|
|
res = res.add(approxRes);
|
||
|
|
rem = rem.sub(approxRem);
|
||
|
|
}
|
||
|
|
return res;
|
||
|
|
};
|
||
|
|
/**This is an alias of {@link Long.divide} */
|
||
|
|
Long.prototype.div = function (divisor) {
|
||
|
|
return this.divide(divisor);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Tests if this Long's value equals the specified's.
|
||
|
|
* @param other - Other value
|
||
|
|
*/
|
||
|
|
Long.prototype.equals = function (other) {
|
||
|
|
if (!Long.isLong(other))
|
||
|
|
other = Long.fromValue(other);
|
||
|
|
if (this.unsigned !== other.unsigned && this.high >>> 31 === 1 && other.high >>> 31 === 1)
|
||
|
|
return false;
|
||
|
|
return this.high === other.high && this.low === other.low;
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.equals} */
|
||
|
|
Long.prototype.eq = function (other) {
|
||
|
|
return this.equals(other);
|
||
|
|
};
|
||
|
|
/** Gets the high 32 bits as a signed integer. */
|
||
|
|
Long.prototype.getHighBits = function () {
|
||
|
|
return this.high;
|
||
|
|
};
|
||
|
|
/** Gets the high 32 bits as an unsigned integer. */
|
||
|
|
Long.prototype.getHighBitsUnsigned = function () {
|
||
|
|
return this.high >>> 0;
|
||
|
|
};
|
||
|
|
/** Gets the low 32 bits as a signed integer. */
|
||
|
|
Long.prototype.getLowBits = function () {
|
||
|
|
return this.low;
|
||
|
|
};
|
||
|
|
/** Gets the low 32 bits as an unsigned integer. */
|
||
|
|
Long.prototype.getLowBitsUnsigned = function () {
|
||
|
|
return this.low >>> 0;
|
||
|
|
};
|
||
|
|
/** Gets the number of bits needed to represent the absolute value of this Long. */
|
||
|
|
Long.prototype.getNumBitsAbs = function () {
|
||
|
|
if (this.isNegative()) {
|
||
|
|
// Unsigned Longs are never negative
|
||
|
|
return this.eq(Long.MIN_VALUE) ? 64 : this.neg().getNumBitsAbs();
|
||
|
|
}
|
||
|
|
var val = this.high !== 0 ? this.high : this.low;
|
||
|
|
var bit;
|
||
|
|
for (bit = 31; bit > 0; bit--)
|
||
|
|
if ((val & (1 << bit)) !== 0)
|
||
|
|
break;
|
||
|
|
return this.high !== 0 ? bit + 33 : bit + 1;
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is greater than the specified's. */
|
||
|
|
Long.prototype.greaterThan = function (other) {
|
||
|
|
return this.comp(other) > 0;
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.greaterThan} */
|
||
|
|
Long.prototype.gt = function (other) {
|
||
|
|
return this.greaterThan(other);
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is greater than or equal the specified's. */
|
||
|
|
Long.prototype.greaterThanOrEqual = function (other) {
|
||
|
|
return this.comp(other) >= 0;
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.greaterThanOrEqual} */
|
||
|
|
Long.prototype.gte = function (other) {
|
||
|
|
return this.greaterThanOrEqual(other);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.greaterThanOrEqual} */
|
||
|
|
Long.prototype.ge = function (other) {
|
||
|
|
return this.greaterThanOrEqual(other);
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is even. */
|
||
|
|
Long.prototype.isEven = function () {
|
||
|
|
return (this.low & 1) === 0;
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is negative. */
|
||
|
|
Long.prototype.isNegative = function () {
|
||
|
|
return !this.unsigned && this.high < 0;
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is odd. */
|
||
|
|
Long.prototype.isOdd = function () {
|
||
|
|
return (this.low & 1) === 1;
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is positive. */
|
||
|
|
Long.prototype.isPositive = function () {
|
||
|
|
return this.unsigned || this.high >= 0;
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value equals zero. */
|
||
|
|
Long.prototype.isZero = function () {
|
||
|
|
return this.high === 0 && this.low === 0;
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is less than the specified's. */
|
||
|
|
Long.prototype.lessThan = function (other) {
|
||
|
|
return this.comp(other) < 0;
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long#lessThan}. */
|
||
|
|
Long.prototype.lt = function (other) {
|
||
|
|
return this.lessThan(other);
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value is less than or equal the specified's. */
|
||
|
|
Long.prototype.lessThanOrEqual = function (other) {
|
||
|
|
return this.comp(other) <= 0;
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.lessThanOrEqual} */
|
||
|
|
Long.prototype.lte = function (other) {
|
||
|
|
return this.lessThanOrEqual(other);
|
||
|
|
};
|
||
|
|
/** Returns this Long modulo the specified. */
|
||
|
|
Long.prototype.modulo = function (divisor) {
|
||
|
|
if (!Long.isLong(divisor))
|
||
|
|
divisor = Long.fromValue(divisor);
|
||
|
|
// use wasm support if present
|
||
|
|
if (wasm) {
|
||
|
|
var low = (this.unsigned ? wasm.rem_u : wasm.rem_s)(this.low, this.high, divisor.low, divisor.high);
|
||
|
|
return Long.fromBits(low, wasm.get_high(), this.unsigned);
|
||
|
|
}
|
||
|
|
return this.sub(this.div(divisor).mul(divisor));
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.modulo} */
|
||
|
|
Long.prototype.mod = function (divisor) {
|
||
|
|
return this.modulo(divisor);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.modulo} */
|
||
|
|
Long.prototype.rem = function (divisor) {
|
||
|
|
return this.modulo(divisor);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns the product of this and the specified Long.
|
||
|
|
* @param multiplier - Multiplier
|
||
|
|
* @returns Product
|
||
|
|
*/
|
||
|
|
Long.prototype.multiply = function (multiplier) {
|
||
|
|
if (this.isZero())
|
||
|
|
return Long.ZERO;
|
||
|
|
if (!Long.isLong(multiplier))
|
||
|
|
multiplier = Long.fromValue(multiplier);
|
||
|
|
// use wasm support if present
|
||
|
|
if (wasm) {
|
||
|
|
var low = wasm.mul(this.low, this.high, multiplier.low, multiplier.high);
|
||
|
|
return Long.fromBits(low, wasm.get_high(), this.unsigned);
|
||
|
|
}
|
||
|
|
if (multiplier.isZero())
|
||
|
|
return Long.ZERO;
|
||
|
|
if (this.eq(Long.MIN_VALUE))
|
||
|
|
return multiplier.isOdd() ? Long.MIN_VALUE : Long.ZERO;
|
||
|
|
if (multiplier.eq(Long.MIN_VALUE))
|
||
|
|
return this.isOdd() ? Long.MIN_VALUE : Long.ZERO;
|
||
|
|
if (this.isNegative()) {
|
||
|
|
if (multiplier.isNegative())
|
||
|
|
return this.neg().mul(multiplier.neg());
|
||
|
|
else
|
||
|
|
return this.neg().mul(multiplier).neg();
|
||
|
|
}
|
||
|
|
else if (multiplier.isNegative())
|
||
|
|
return this.mul(multiplier.neg()).neg();
|
||
|
|
// If both longs are small, use float multiplication
|
||
|
|
if (this.lt(Long.TWO_PWR_24) && multiplier.lt(Long.TWO_PWR_24))
|
||
|
|
return Long.fromNumber(this.toNumber() * multiplier.toNumber(), this.unsigned);
|
||
|
|
// Divide each long into 4 chunks of 16 bits, and then add up 4x4 products.
|
||
|
|
// We can skip products that would overflow.
|
||
|
|
var a48 = this.high >>> 16;
|
||
|
|
var a32 = this.high & 0xffff;
|
||
|
|
var a16 = this.low >>> 16;
|
||
|
|
var a00 = this.low & 0xffff;
|
||
|
|
var b48 = multiplier.high >>> 16;
|
||
|
|
var b32 = multiplier.high & 0xffff;
|
||
|
|
var b16 = multiplier.low >>> 16;
|
||
|
|
var b00 = multiplier.low & 0xffff;
|
||
|
|
var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
|
||
|
|
c00 += a00 * b00;
|
||
|
|
c16 += c00 >>> 16;
|
||
|
|
c00 &= 0xffff;
|
||
|
|
c16 += a16 * b00;
|
||
|
|
c32 += c16 >>> 16;
|
||
|
|
c16 &= 0xffff;
|
||
|
|
c16 += a00 * b16;
|
||
|
|
c32 += c16 >>> 16;
|
||
|
|
c16 &= 0xffff;
|
||
|
|
c32 += a32 * b00;
|
||
|
|
c48 += c32 >>> 16;
|
||
|
|
c32 &= 0xffff;
|
||
|
|
c32 += a16 * b16;
|
||
|
|
c48 += c32 >>> 16;
|
||
|
|
c32 &= 0xffff;
|
||
|
|
c32 += a00 * b32;
|
||
|
|
c48 += c32 >>> 16;
|
||
|
|
c32 &= 0xffff;
|
||
|
|
c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
|
||
|
|
c48 &= 0xffff;
|
||
|
|
return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32, this.unsigned);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.multiply} */
|
||
|
|
Long.prototype.mul = function (multiplier) {
|
||
|
|
return this.multiply(multiplier);
|
||
|
|
};
|
||
|
|
/** Returns the Negation of this Long's value. */
|
||
|
|
Long.prototype.negate = function () {
|
||
|
|
if (!this.unsigned && this.eq(Long.MIN_VALUE))
|
||
|
|
return Long.MIN_VALUE;
|
||
|
|
return this.not().add(Long.ONE);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.negate} */
|
||
|
|
Long.prototype.neg = function () {
|
||
|
|
return this.negate();
|
||
|
|
};
|
||
|
|
/** Returns the bitwise NOT of this Long. */
|
||
|
|
Long.prototype.not = function () {
|
||
|
|
return Long.fromBits(~this.low, ~this.high, this.unsigned);
|
||
|
|
};
|
||
|
|
/** Tests if this Long's value differs from the specified's. */
|
||
|
|
Long.prototype.notEquals = function (other) {
|
||
|
|
return !this.equals(other);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.notEquals} */
|
||
|
|
Long.prototype.neq = function (other) {
|
||
|
|
return this.notEquals(other);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.notEquals} */
|
||
|
|
Long.prototype.ne = function (other) {
|
||
|
|
return this.notEquals(other);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns the bitwise OR of this Long and the specified.
|
||
|
|
*/
|
||
|
|
Long.prototype.or = function (other) {
|
||
|
|
if (!Long.isLong(other))
|
||
|
|
other = Long.fromValue(other);
|
||
|
|
return Long.fromBits(this.low | other.low, this.high | other.high, this.unsigned);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns this Long with bits shifted to the left by the given amount.
|
||
|
|
* @param numBits - Number of bits
|
||
|
|
* @returns Shifted Long
|
||
|
|
*/
|
||
|
|
Long.prototype.shiftLeft = function (numBits) {
|
||
|
|
if (Long.isLong(numBits))
|
||
|
|
numBits = numBits.toInt();
|
||
|
|
if ((numBits &= 63) === 0)
|
||
|
|
return this;
|
||
|
|
else if (numBits < 32)
|
||
|
|
return Long.fromBits(this.low << numBits, (this.high << numBits) | (this.low >>> (32 - numBits)), this.unsigned);
|
||
|
|
else
|
||
|
|
return Long.fromBits(0, this.low << (numBits - 32), this.unsigned);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.shiftLeft} */
|
||
|
|
Long.prototype.shl = function (numBits) {
|
||
|
|
return this.shiftLeft(numBits);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns this Long with bits arithmetically shifted to the right by the given amount.
|
||
|
|
* @param numBits - Number of bits
|
||
|
|
* @returns Shifted Long
|
||
|
|
*/
|
||
|
|
Long.prototype.shiftRight = function (numBits) {
|
||
|
|
if (Long.isLong(numBits))
|
||
|
|
numBits = numBits.toInt();
|
||
|
|
if ((numBits &= 63) === 0)
|
||
|
|
return this;
|
||
|
|
else if (numBits < 32)
|
||
|
|
return Long.fromBits((this.low >>> numBits) | (this.high << (32 - numBits)), this.high >> numBits, this.unsigned);
|
||
|
|
else
|
||
|
|
return Long.fromBits(this.high >> (numBits - 32), this.high >= 0 ? 0 : -1, this.unsigned);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.shiftRight} */
|
||
|
|
Long.prototype.shr = function (numBits) {
|
||
|
|
return this.shiftRight(numBits);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns this Long with bits logically shifted to the right by the given amount.
|
||
|
|
* @param numBits - Number of bits
|
||
|
|
* @returns Shifted Long
|
||
|
|
*/
|
||
|
|
Long.prototype.shiftRightUnsigned = function (numBits) {
|
||
|
|
if (Long.isLong(numBits))
|
||
|
|
numBits = numBits.toInt();
|
||
|
|
numBits &= 63;
|
||
|
|
if (numBits === 0)
|
||
|
|
return this;
|
||
|
|
else {
|
||
|
|
var high = this.high;
|
||
|
|
if (numBits < 32) {
|
||
|
|
var low = this.low;
|
||
|
|
return Long.fromBits((low >>> numBits) | (high << (32 - numBits)), high >>> numBits, this.unsigned);
|
||
|
|
}
|
||
|
|
else if (numBits === 32)
|
||
|
|
return Long.fromBits(high, 0, this.unsigned);
|
||
|
|
else
|
||
|
|
return Long.fromBits(high >>> (numBits - 32), 0, this.unsigned);
|
||
|
|
}
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.shiftRightUnsigned} */
|
||
|
|
Long.prototype.shr_u = function (numBits) {
|
||
|
|
return this.shiftRightUnsigned(numBits);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.shiftRightUnsigned} */
|
||
|
|
Long.prototype.shru = function (numBits) {
|
||
|
|
return this.shiftRightUnsigned(numBits);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Returns the difference of this and the specified Long.
|
||
|
|
* @param subtrahend - Subtrahend
|
||
|
|
* @returns Difference
|
||
|
|
*/
|
||
|
|
Long.prototype.subtract = function (subtrahend) {
|
||
|
|
if (!Long.isLong(subtrahend))
|
||
|
|
subtrahend = Long.fromValue(subtrahend);
|
||
|
|
return this.add(subtrahend.neg());
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.subtract} */
|
||
|
|
Long.prototype.sub = function (subtrahend) {
|
||
|
|
return this.subtract(subtrahend);
|
||
|
|
};
|
||
|
|
/** Converts the Long to a 32 bit integer, assuming it is a 32 bit integer. */
|
||
|
|
Long.prototype.toInt = function () {
|
||
|
|
return this.unsigned ? this.low >>> 0 : this.low;
|
||
|
|
};
|
||
|
|
/** Converts the Long to a the nearest floating-point representation of this value (double, 53 bit mantissa). */
|
||
|
|
Long.prototype.toNumber = function () {
|
||
|
|
if (this.unsigned)
|
||
|
|
return (this.high >>> 0) * TWO_PWR_32_DBL + (this.low >>> 0);
|
||
|
|
return this.high * TWO_PWR_32_DBL + (this.low >>> 0);
|
||
|
|
};
|
||
|
|
/** Converts the Long to a BigInt (arbitrary precision). */
|
||
|
|
Long.prototype.toBigInt = function () {
|
||
|
|
return BigInt(this.toString());
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Converts this Long to its byte representation.
|
||
|
|
* @param le - Whether little or big endian, defaults to big endian
|
||
|
|
* @returns Byte representation
|
||
|
|
*/
|
||
|
|
Long.prototype.toBytes = function (le) {
|
||
|
|
return le ? this.toBytesLE() : this.toBytesBE();
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Converts this Long to its little endian byte representation.
|
||
|
|
* @returns Little endian byte representation
|
||
|
|
*/
|
||
|
|
Long.prototype.toBytesLE = function () {
|
||
|
|
var hi = this.high, lo = this.low;
|
||
|
|
return [
|
||
|
|
lo & 0xff,
|
||
|
|
(lo >>> 8) & 0xff,
|
||
|
|
(lo >>> 16) & 0xff,
|
||
|
|
lo >>> 24,
|
||
|
|
hi & 0xff,
|
||
|
|
(hi >>> 8) & 0xff,
|
||
|
|
(hi >>> 16) & 0xff,
|
||
|
|
hi >>> 24
|
||
|
|
];
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Converts this Long to its big endian byte representation.
|
||
|
|
* @returns Big endian byte representation
|
||
|
|
*/
|
||
|
|
Long.prototype.toBytesBE = function () {
|
||
|
|
var hi = this.high, lo = this.low;
|
||
|
|
return [
|
||
|
|
hi >>> 24,
|
||
|
|
(hi >>> 16) & 0xff,
|
||
|
|
(hi >>> 8) & 0xff,
|
||
|
|
hi & 0xff,
|
||
|
|
lo >>> 24,
|
||
|
|
(lo >>> 16) & 0xff,
|
||
|
|
(lo >>> 8) & 0xff,
|
||
|
|
lo & 0xff
|
||
|
|
];
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Converts this Long to signed.
|
||
|
|
*/
|
||
|
|
Long.prototype.toSigned = function () {
|
||
|
|
if (!this.unsigned)
|
||
|
|
return this;
|
||
|
|
return Long.fromBits(this.low, this.high, false);
|
||
|
|
};
|
||
|
|
/**
|
||
|
|
* Converts the Long to a string written in the specified radix.
|
||
|
|
* @param radix - Radix (2-36), defaults to 10
|
||
|
|
* @throws RangeError If `radix` is out of range
|
||
|
|
*/
|
||
|
|
Long.prototype.toString = function (radix) {
|
||
|
|
radix = radix || 10;
|
||
|
|
if (radix < 2 || 36 < radix)
|
||
|
|
throw RangeError('radix');
|
||
|
|
if (this.isZero())
|
||
|
|
return '0';
|
||
|
|
if (this.isNegative()) {
|
||
|
|
// Unsigned Longs are never negative
|
||
|
|
if (this.eq(Long.MIN_VALUE)) {
|
||
|
|
// We need to change the Long value before it can be negated, so we remove
|
||
|
|
// the bottom-most digit in this base and then recurse to do the rest.
|
||
|
|
var radixLong = Long.fromNumber(radix), div = this.div(radixLong), rem1 = div.mul(radixLong).sub(this);
|
||
|
|
return div.toString(radix) + rem1.toInt().toString(radix);
|
||
|
|
}
|
||
|
|
else
|
||
|
|
return '-' + this.neg().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 = Long.fromNumber(Math.pow(radix, 6), this.unsigned);
|
||
|
|
// eslint-disable-next-line @typescript-eslint/no-this-alias
|
||
|
|
var rem = this;
|
||
|
|
var result = '';
|
||
|
|
// eslint-disable-next-line no-constant-condition
|
||
|
|
while (true) {
|
||
|
|
var remDiv = rem.div(radixToPower);
|
||
|
|
var intval = rem.sub(remDiv.mul(radixToPower)).toInt() >>> 0;
|
||
|
|
var digits = intval.toString(radix);
|
||
|
|
rem = remDiv;
|
||
|
|
if (rem.isZero()) {
|
||
|
|
return digits + result;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
while (digits.length < 6)
|
||
|
|
digits = '0' + digits;
|
||
|
|
result = '' + digits + result;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
};
|
||
|
|
/** Converts this Long to unsigned. */
|
||
|
|
Long.prototype.toUnsigned = function () {
|
||
|
|
if (this.unsigned)
|
||
|
|
return this;
|
||
|
|
return Long.fromBits(this.low, this.high, true);
|
||
|
|
};
|
||
|
|
/** Returns the bitwise XOR of this Long and the given one. */
|
||
|
|
Long.prototype.xor = function (other) {
|
||
|
|
if (!Long.isLong(other))
|
||
|
|
other = Long.fromValue(other);
|
||
|
|
return Long.fromBits(this.low ^ other.low, this.high ^ other.high, this.unsigned);
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.isZero} */
|
||
|
|
Long.prototype.eqz = function () {
|
||
|
|
return this.isZero();
|
||
|
|
};
|
||
|
|
/** This is an alias of {@link Long.lessThanOrEqual} */
|
||
|
|
Long.prototype.le = function (other) {
|
||
|
|
return this.lessThanOrEqual(other);
|
||
|
|
};
|
||
|
|
/*
|
||
|
|
****************************************************************
|
||
|
|
* BSON SPECIFIC ADDITIONS *
|
||
|
|
****************************************************************
|
||
|
|
*/
|
||
|
|
Long.prototype.toExtendedJSON = function (options) {
|
||
|
|
if (options && options.relaxed)
|
||
|
|
return this.toNumber();
|
||
|
|
return { $numberLong: this.toString() };
|
||
|
|
};
|
||
|
|
Long.fromExtendedJSON = function (doc, options) {
|
||
|
|
var result = Long.fromString(doc.$numberLong);
|
||
|
|
return options && options.relaxed ? result.toNumber() : result;
|
||
|
|
};
|
||
|
|
/** @internal */
|
||
|
|
Long.prototype[Symbol.for('nodejs.util.inspect.custom')] = function () {
|
||
|
|
return this.inspect();
|
||
|
|
};
|
||
|
|
Long.prototype.inspect = function () {
|
||
|
|
return "new Long(\"" + this.toString() + "\"" + (this.unsigned ? ', true' : '') + ")";
|
||
|
|
};
|
||
|
|
Long.TWO_PWR_24 = Long.fromInt(TWO_PWR_24_DBL);
|
||
|
|
/** Maximum unsigned value. */
|
||
|
|
Long.MAX_UNSIGNED_VALUE = Long.fromBits(0xffffffff | 0, 0xffffffff | 0, true);
|
||
|
|
/** Signed zero */
|
||
|
|
Long.ZERO = Long.fromInt(0);
|
||
|
|
/** Unsigned zero. */
|
||
|
|
Long.UZERO = Long.fromInt(0, true);
|
||
|
|
/** Signed one. */
|
||
|
|
Long.ONE = Long.fromInt(1);
|
||
|
|
/** Unsigned one. */
|
||
|
|
Long.UONE = Long.fromInt(1, true);
|
||
|
|
/** Signed negative one. */
|
||
|
|
Long.NEG_ONE = Long.fromInt(-1);
|
||
|
|
/** Maximum signed value. */
|
||
|
|
Long.MAX_VALUE = Long.fromBits(0xffffffff | 0, 0x7fffffff | 0, false);
|
||
|
|
/** Minimum signed value. */
|
||
|
|
Long.MIN_VALUE = Long.fromBits(0, 0x80000000 | 0, false);
|
||
|
|
return Long;
|
||
|
|
}());
|
||
|
|
exports.Long = Long;
|
||
|
|
Object.defineProperty(Long.prototype, '__isLong__', { value: true });
|
||
|
|
Object.defineProperty(Long.prototype, '_bsontype', { value: 'Long' });
|
||
|
|
//# sourceMappingURL=long.js.map
|