simple-squiggle/node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js

137 lines
4.3 KiB
JavaScript

import { createAlgorithm02 } from '../../type/matrix/utils/algorithm02.js';
import { createAlgorithm11 } from '../../type/matrix/utils/algorithm11.js';
import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
import { createAlgorithm08 } from '../../type/matrix/utils/algorithm08.js';
import { factory } from '../../utils/factory.js';
import { rightLogShiftNumber } from '../../plain/number/index.js';
var name = 'rightLogShift';
var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
export var createRightLogShift = /* #__PURE__ */factory(name, dependencies, _ref => {
var {
typed,
matrix,
equalScalar,
zeros,
DenseMatrix
} = _ref;
var algorithm01 = createAlgorithm01({
typed
});
var algorithm02 = createAlgorithm02({
typed,
equalScalar
});
var algorithm08 = createAlgorithm08({
typed,
equalScalar
});
var algorithm10 = createAlgorithm10({
typed,
DenseMatrix
});
var algorithm11 = createAlgorithm11({
typed,
equalScalar
});
var algorithm13 = createAlgorithm13({
typed
});
var algorithm14 = createAlgorithm14({
typed
});
/**
* Bitwise right logical shift of value x by y number of bits, `x >>> y`.
* For matrices, the function is evaluated element wise.
* For units, the function is evaluated on the best prefix base.
*
* Syntax:
*
* math.rightLogShift(x, y)
*
* Examples:
*
* math.rightLogShift(4, 2) // returns number 1
*
* math.rightLogShift([16, -32, 64], 4) // returns Array [1, 2, 3]
*
* See also:
*
* bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift
*
* @param {number | Array | Matrix} x Value to be shifted
* @param {number} y Amount of shifts
* @return {number | Array | Matrix} `x` zero-filled shifted right `y` times
*/
return typed(name, {
'number, number': rightLogShiftNumber,
// 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift
'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
return algorithm08(x, y, this, false);
},
'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
return algorithm02(y, x, this, true);
},
'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
return algorithm01(x, y, this, false);
},
'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
return algorithm13(x, y, this);
},
'Array, Array': function ArrayArray(x, y) {
// use matrix implementation
return this(matrix(x), matrix(y)).valueOf();
},
'Array, Matrix': function ArrayMatrix(x, y) {
// use matrix implementation
return this(matrix(x), y);
},
'Matrix, Array': function MatrixArray(x, y) {
// use matrix implementation
return this(x, matrix(y));
},
'SparseMatrix, number | BigNumber': function SparseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm11(x, y, this, false);
},
'DenseMatrix, number | BigNumber': function DenseMatrixNumberBigNumber(x, y) {
// check scalar
if (equalScalar(y, 0)) {
return x.clone();
}
return algorithm14(x, y, this, false);
},
'number | BigNumber, SparseMatrix': function numberBigNumberSparseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm10(y, x, this, true);
},
'number | BigNumber, DenseMatrix': function numberBigNumberDenseMatrix(x, y) {
// check scalar
if (equalScalar(x, 0)) {
return zeros(y.size(), y.storage());
}
return algorithm14(y, x, this, true);
},
'Array, number | BigNumber': function ArrayNumberBigNumber(x, y) {
// use matrix implementation
return this(matrix(x), y).valueOf();
},
'number | BigNumber, Array': function numberBigNumberArray(x, y) {
// use matrix implementation
return this(x, matrix(y)).valueOf();
}
});
});