mirror of
https://github.com/Azgaar/Fantasy-Map-Generator.git
synced 2025-12-24 13:01:24 +01:00
merge completed... now to fix all the bugs...
This commit is contained in:
commit
87c4d80fbc
3472 changed files with 466748 additions and 6517 deletions
66
node_modules/es-abstract/2021/BigIntBitwiseOp.js
generated
vendored
Normal file
66
node_modules/es-abstract/2021/BigIntBitwiseOp.js
generated
vendored
Normal file
|
|
@ -0,0 +1,66 @@
|
|||
'use strict';
|
||||
|
||||
var GetIntrinsic = require('get-intrinsic');
|
||||
|
||||
var $TypeError = GetIntrinsic('%TypeError%');
|
||||
// var $BigInt = GetIntrinsic('%BigInt%', true);
|
||||
// var $pow = GetIntrinsic('%Math.pow%');
|
||||
|
||||
// var BinaryAnd = require('./BinaryAnd');
|
||||
// var BinaryOr = require('./BinaryOr');
|
||||
// var BinaryXor = require('./BinaryXor');
|
||||
var Type = require('./Type');
|
||||
// var modulo = require('./modulo');
|
||||
|
||||
// var zero = $BigInt && $BigInt(0);
|
||||
// var negOne = $BigInt && $BigInt(-1);
|
||||
// var two = $BigInt && $BigInt(2);
|
||||
|
||||
// https://262.ecma-international.org/11.0/#sec-bigintbitwiseop
|
||||
|
||||
module.exports = function BigIntBitwiseOp(op, x, y) {
|
||||
if (op !== '&' && op !== '|' && op !== '^') {
|
||||
throw new $TypeError('Assertion failed: `op` must be `&`, `|`, or `^`');
|
||||
}
|
||||
if (Type(x) !== 'BigInt' || Type(y) !== 'BigInt') {
|
||||
throw new $TypeError('`x` and `y` must be BigInts');
|
||||
}
|
||||
|
||||
if (op === '&') {
|
||||
return x & y;
|
||||
}
|
||||
if (op === '|') {
|
||||
return x | y;
|
||||
}
|
||||
return x ^ y;
|
||||
/*
|
||||
var result = zero;
|
||||
var shift = 0;
|
||||
while (x !== zero && x !== negOne && y !== zero && y !== negOne) {
|
||||
var xDigit = modulo(x, two);
|
||||
var yDigit = modulo(y, two);
|
||||
if (op === '&') {
|
||||
result += $pow(2, shift) * BinaryAnd(xDigit, yDigit);
|
||||
} else if (op === '|') {
|
||||
result += $pow(2, shift) * BinaryOr(xDigit, yDigit);
|
||||
} else if (op === '^') {
|
||||
result += $pow(2, shift) * BinaryXor(xDigit, yDigit);
|
||||
}
|
||||
shift += 1;
|
||||
x = (x - xDigit) / two;
|
||||
y = (y - yDigit) / two;
|
||||
}
|
||||
var tmp;
|
||||
if (op === '&') {
|
||||
tmp = BinaryAnd(modulo(x, two), modulo(y, two));
|
||||
} else if (op === '|') {
|
||||
tmp = BinaryAnd(modulo(x, two), modulo(y, two));
|
||||
} else {
|
||||
tmp = BinaryXor(modulo(x, two), modulo(y, two));
|
||||
}
|
||||
if (tmp !== 0) {
|
||||
result -= $pow(2, shift);
|
||||
}
|
||||
return result;
|
||||
*/
|
||||
};
|
||||
Loading…
Add table
Add a link
Reference in a new issue