Spaces:
Sleeping
Sleeping
File size: 13,439 Bytes
78c921d |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 |
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you 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.
/** @ignore */
const carryBit16 = 1 << 16;
/** @ignore */
function intAsHex(value) {
if (value < 0) {
value = 0xFFFFFFFF + value + 1;
}
return `0x${value.toString(16)}`;
}
/** @ignore */
const kInt32DecimalDigits = 8;
/** @ignore */
const kPowersOfTen = [
1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000
];
/** @ignore */
export class BaseInt64 {
constructor(buffer) {
this.buffer = buffer;
}
high() { return this.buffer[1]; }
low() { return this.buffer[0]; }
_times(other) {
// Break the left and right numbers into 16 bit chunks
// so that we can multiply them without overflow.
const L = new Uint32Array([
this.buffer[1] >>> 16,
this.buffer[1] & 0xFFFF,
this.buffer[0] >>> 16,
this.buffer[0] & 0xFFFF
]);
const R = new Uint32Array([
other.buffer[1] >>> 16,
other.buffer[1] & 0xFFFF,
other.buffer[0] >>> 16,
other.buffer[0] & 0xFFFF
]);
let product = L[3] * R[3];
this.buffer[0] = product & 0xFFFF;
let sum = product >>> 16;
product = L[2] * R[3];
sum += product;
product = (L[3] * R[2]) >>> 0;
sum += product;
this.buffer[0] += sum << 16;
this.buffer[1] = (sum >>> 0 < product ? carryBit16 : 0);
this.buffer[1] += sum >>> 16;
this.buffer[1] += L[1] * R[3] + L[2] * R[2] + L[3] * R[1];
this.buffer[1] += (L[0] * R[3] + L[1] * R[2] + L[2] * R[1] + L[3] * R[0]) << 16;
return this;
}
_plus(other) {
const sum = (this.buffer[0] + other.buffer[0]) >>> 0;
this.buffer[1] += other.buffer[1];
if (sum < (this.buffer[0] >>> 0)) {
++this.buffer[1];
}
this.buffer[0] = sum;
}
lessThan(other) {
return this.buffer[1] < other.buffer[1] ||
(this.buffer[1] === other.buffer[1] && this.buffer[0] < other.buffer[0]);
}
equals(other) {
return this.buffer[1] === other.buffer[1] && this.buffer[0] == other.buffer[0];
}
greaterThan(other) {
return other.lessThan(this);
}
hex() {
return `${intAsHex(this.buffer[1])} ${intAsHex(this.buffer[0])}`;
}
}
/** @ignore */
export class Uint64 extends BaseInt64 {
times(other) {
this._times(other);
return this;
}
plus(other) {
this._plus(other);
return this;
}
/** @nocollapse */
static from(val, out_buffer = new Uint32Array(2)) {
return Uint64.fromString(typeof (val) === 'string' ? val : val.toString(), out_buffer);
}
/** @nocollapse */
static fromNumber(num, out_buffer = new Uint32Array(2)) {
// Always parse numbers as strings - pulling out high and low bits
// directly seems to lose precision sometimes
// For example:
// > -4613034156400212000 >>> 0
// 721782784
// The correct lower 32-bits are 721782752
return Uint64.fromString(num.toString(), out_buffer);
}
/** @nocollapse */
static fromString(str, out_buffer = new Uint32Array(2)) {
const length = str.length;
const out = new Uint64(out_buffer);
for (let posn = 0; posn < length;) {
const group = kInt32DecimalDigits < length - posn ?
kInt32DecimalDigits : length - posn;
const chunk = new Uint64(new Uint32Array([Number.parseInt(str.slice(posn, posn + group), 10), 0]));
const multiple = new Uint64(new Uint32Array([kPowersOfTen[group], 0]));
out.times(multiple);
out.plus(chunk);
posn += group;
}
return out;
}
/** @nocollapse */
static convertArray(values) {
const data = new Uint32Array(values.length * 2);
for (let i = -1, n = values.length; ++i < n;) {
Uint64.from(values[i], new Uint32Array(data.buffer, data.byteOffset + 2 * i * 4, 2));
}
return data;
}
/** @nocollapse */
static multiply(left, right) {
const rtrn = new Uint64(new Uint32Array(left.buffer));
return rtrn.times(right);
}
/** @nocollapse */
static add(left, right) {
const rtrn = new Uint64(new Uint32Array(left.buffer));
return rtrn.plus(right);
}
}
/** @ignore */
export class Int64 extends BaseInt64 {
negate() {
this.buffer[0] = ~this.buffer[0] + 1;
this.buffer[1] = ~this.buffer[1];
if (this.buffer[0] == 0) {
++this.buffer[1];
}
return this;
}
times(other) {
this._times(other);
return this;
}
plus(other) {
this._plus(other);
return this;
}
lessThan(other) {
// force high bytes to be signed
// eslint-disable-next-line unicorn/prefer-math-trunc
const this_high = this.buffer[1] << 0;
// eslint-disable-next-line unicorn/prefer-math-trunc
const other_high = other.buffer[1] << 0;
return this_high < other_high ||
(this_high === other_high && this.buffer[0] < other.buffer[0]);
}
/** @nocollapse */
static from(val, out_buffer = new Uint32Array(2)) {
return Int64.fromString(typeof (val) === 'string' ? val : val.toString(), out_buffer);
}
/** @nocollapse */
static fromNumber(num, out_buffer = new Uint32Array(2)) {
// Always parse numbers as strings - pulling out high and low bits
// directly seems to lose precision sometimes
// For example:
// > -4613034156400212000 >>> 0
// 721782784
// The correct lower 32-bits are 721782752
return Int64.fromString(num.toString(), out_buffer);
}
/** @nocollapse */
static fromString(str, out_buffer = new Uint32Array(2)) {
// TODO: Assert that out_buffer is 0 and length = 2
const negate = str.startsWith('-');
const length = str.length;
const out = new Int64(out_buffer);
for (let posn = negate ? 1 : 0; posn < length;) {
const group = kInt32DecimalDigits < length - posn ?
kInt32DecimalDigits : length - posn;
const chunk = new Int64(new Uint32Array([Number.parseInt(str.slice(posn, posn + group), 10), 0]));
const multiple = new Int64(new Uint32Array([kPowersOfTen[group], 0]));
out.times(multiple);
out.plus(chunk);
posn += group;
}
return negate ? out.negate() : out;
}
/** @nocollapse */
static convertArray(values) {
const data = new Uint32Array(values.length * 2);
for (let i = -1, n = values.length; ++i < n;) {
Int64.from(values[i], new Uint32Array(data.buffer, data.byteOffset + 2 * i * 4, 2));
}
return data;
}
/** @nocollapse */
static multiply(left, right) {
const rtrn = new Int64(new Uint32Array(left.buffer));
return rtrn.times(right);
}
/** @nocollapse */
static add(left, right) {
const rtrn = new Int64(new Uint32Array(left.buffer));
return rtrn.plus(right);
}
}
/** @ignore */
export class Int128 {
constructor(buffer) {
this.buffer = buffer;
// buffer[3] MSB (high)
// buffer[2]
// buffer[1]
// buffer[0] LSB (low)
}
high() {
return new Int64(new Uint32Array(this.buffer.buffer, this.buffer.byteOffset + 8, 2));
}
low() {
return new Int64(new Uint32Array(this.buffer.buffer, this.buffer.byteOffset, 2));
}
negate() {
this.buffer[0] = ~this.buffer[0] + 1;
this.buffer[1] = ~this.buffer[1];
this.buffer[2] = ~this.buffer[2];
this.buffer[3] = ~this.buffer[3];
if (this.buffer[0] == 0) {
++this.buffer[1];
}
if (this.buffer[1] == 0) {
++this.buffer[2];
}
if (this.buffer[2] == 0) {
++this.buffer[3];
}
return this;
}
times(other) {
// Break the left and right numbers into 32 bit chunks
// so that we can multiply them without overflow.
const L0 = new Uint64(new Uint32Array([this.buffer[3], 0]));
const L1 = new Uint64(new Uint32Array([this.buffer[2], 0]));
const L2 = new Uint64(new Uint32Array([this.buffer[1], 0]));
const L3 = new Uint64(new Uint32Array([this.buffer[0], 0]));
const R0 = new Uint64(new Uint32Array([other.buffer[3], 0]));
const R1 = new Uint64(new Uint32Array([other.buffer[2], 0]));
const R2 = new Uint64(new Uint32Array([other.buffer[1], 0]));
const R3 = new Uint64(new Uint32Array([other.buffer[0], 0]));
let product = Uint64.multiply(L3, R3);
this.buffer[0] = product.low();
const sum = new Uint64(new Uint32Array([product.high(), 0]));
product = Uint64.multiply(L2, R3);
sum.plus(product);
product = Uint64.multiply(L3, R2);
sum.plus(product);
this.buffer[1] = sum.low();
this.buffer[3] = (sum.lessThan(product) ? 1 : 0);
this.buffer[2] = sum.high();
const high = new Uint64(new Uint32Array(this.buffer.buffer, this.buffer.byteOffset + 8, 2));
high.plus(Uint64.multiply(L1, R3))
.plus(Uint64.multiply(L2, R2))
.plus(Uint64.multiply(L3, R1));
this.buffer[3] += Uint64.multiply(L0, R3)
.plus(Uint64.multiply(L1, R2))
.plus(Uint64.multiply(L2, R1))
.plus(Uint64.multiply(L3, R0)).low();
return this;
}
plus(other) {
const sums = new Uint32Array(4);
sums[3] = (this.buffer[3] + other.buffer[3]) >>> 0;
sums[2] = (this.buffer[2] + other.buffer[2]) >>> 0;
sums[1] = (this.buffer[1] + other.buffer[1]) >>> 0;
sums[0] = (this.buffer[0] + other.buffer[0]) >>> 0;
if (sums[0] < (this.buffer[0] >>> 0)) {
++sums[1];
}
if (sums[1] < (this.buffer[1] >>> 0)) {
++sums[2];
}
if (sums[2] < (this.buffer[2] >>> 0)) {
++sums[3];
}
this.buffer[3] = sums[3];
this.buffer[2] = sums[2];
this.buffer[1] = sums[1];
this.buffer[0] = sums[0];
return this;
}
hex() {
return `${intAsHex(this.buffer[3])} ${intAsHex(this.buffer[2])} ${intAsHex(this.buffer[1])} ${intAsHex(this.buffer[0])}`;
}
/** @nocollapse */
static multiply(left, right) {
const rtrn = new Int128(new Uint32Array(left.buffer));
return rtrn.times(right);
}
/** @nocollapse */
static add(left, right) {
const rtrn = new Int128(new Uint32Array(left.buffer));
return rtrn.plus(right);
}
/** @nocollapse */
static from(val, out_buffer = new Uint32Array(4)) {
return Int128.fromString(typeof (val) === 'string' ? val : val.toString(), out_buffer);
}
/** @nocollapse */
static fromNumber(num, out_buffer = new Uint32Array(4)) {
// Always parse numbers as strings - pulling out high and low bits
// directly seems to lose precision sometimes
// For example:
// > -4613034156400212000 >>> 0
// 721782784
// The correct lower 32-bits are 721782752
return Int128.fromString(num.toString(), out_buffer);
}
/** @nocollapse */
static fromString(str, out_buffer = new Uint32Array(4)) {
// TODO: Assert that out_buffer is 0 and length = 4
const negate = str.startsWith('-');
const length = str.length;
const out = new Int128(out_buffer);
for (let posn = negate ? 1 : 0; posn < length;) {
const group = kInt32DecimalDigits < length - posn ?
kInt32DecimalDigits : length - posn;
const chunk = new Int128(new Uint32Array([Number.parseInt(str.slice(posn, posn + group), 10), 0, 0, 0]));
const multiple = new Int128(new Uint32Array([kPowersOfTen[group], 0, 0, 0]));
out.times(multiple);
out.plus(chunk);
posn += group;
}
return negate ? out.negate() : out;
}
/** @nocollapse */
static convertArray(values) {
// TODO: Distinguish between string and number at compile-time
const data = new Uint32Array(values.length * 4);
for (let i = -1, n = values.length; ++i < n;) {
Int128.from(values[i], new Uint32Array(data.buffer, data.byteOffset + 4 * 4 * i, 4));
}
return data;
}
}
//# sourceMappingURL=int.mjs.map
|