Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More →
@navpreetdevpuri/base-2-n
Advanced tools
@navpreetdevpuri/base-2-n - npm Package Compare versions
Comparing version 0.0.3 to 0.0.4
219
index.js
@@ -1,118 +0,105 @@ | ||
| class Base2N { | ||
| constructor(digits, n = 16, maxNoOfDigits = 50) { | ||
| if (digits.length > maxNoOfDigits) { | ||
| throw new Error( | ||
| `Digits length can't be longer than maxNoOfDigits: ${maxNoOfDigits}` | ||
| ); | ||
| "use strict"; | ||
| Object.defineProperty(exports, "__esModule", { value: true }); | ||
| var Base2N = /** @class */ (function () { | ||
| function Base2N(digits, n, maxNoOfDigits) { | ||
| if (n === void 0) { n = 16; } | ||
| if (maxNoOfDigits === void 0) { maxNoOfDigits = 50; } | ||
| if (digits.length > maxNoOfDigits) { | ||
| throw new Error("Digits length can't be longer than maxNoOfDigits: ".concat(maxNoOfDigits)); | ||
| } | ||
| if (n == 0) { | ||
| throw new Error("n can't be zero."); | ||
| } | ||
| if (maxNoOfDigits == 0) { | ||
| throw new Error("maxNoOfDigits can't be zero."); | ||
| } | ||
| if (n > 16) { | ||
| throw new Error("n can't be more than 16 because 2^16 = 65536. That's the limit of possible characters we can have in UNICODE to represent digits."); | ||
| } | ||
| this.n = n; | ||
| this.base = Math.pow(2, n); | ||
| var noOf1sInBaseBinary = this.base.toString(2).split('1').length - 1; | ||
| if (noOf1sInBaseBinary > 1) { | ||
| throw new Error("base should be some power of 2, For example 2^2=4, 2^3=8, 16, 32, 64, 128, ... 65536"); | ||
| } | ||
| this.charset = []; | ||
| for (var i = 0; i < this.base; i++) { | ||
| this.charset[i] = String.fromCharCode(i); | ||
| } | ||
| this.maxNoOfDigits = maxNoOfDigits; | ||
| this.digits = | ||
| digits instanceof Uint16Array | ||
| ? digits | ||
| : new Uint16Array(this.maxNoOfDigits); | ||
| if (typeof digits == 'string') { | ||
| for (var i = digits.length, j = maxNoOfDigits; i > -1; i--, j--) { | ||
| this.digits[j] = digits.charCodeAt(i); | ||
| if (this.digits[j] > this.base) { | ||
| throw new Error("Any digit's ASCII code in given digits can't be more than or equal to given base: ".concat(this.base, ". ASCII code ").concat(this.digits[j], " > base ").concat(this.base)); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| if (n == 0) { | ||
| throw new Error(`n can't be zero.`); | ||
| } | ||
| if (maxNoOfDigits == 0) { | ||
| throw new Error(`maxNoOfDigits can't be zero.`); | ||
| } | ||
| if (n > 16) { | ||
| throw new Error( | ||
| `n can't be more than 16 because 2^16 = 65536. That's the limit of possible characters we can have in UNICODE to represent digits.` | ||
| ); | ||
| } | ||
| this.n = n; | ||
| this.base = Math.pow(2, n); | ||
| const noOf1sInBaseBinary = this.base.toString(2).split('1').length - 1; | ||
| if (noOf1sInBaseBinary > 1) { | ||
| throw new Error( | ||
| `base should be some power of 2, For example 2^2=4, 2^3=8, 16, 32, 64, 128, ... 65536` | ||
| ); | ||
| } | ||
| this.charset = []; | ||
| for (let i = 0; i < this.base; i++) { | ||
| this.charset[i] = String.fromCharCode(i); | ||
| } | ||
| this.maxNoOfDigits = maxNoOfDigits; | ||
| this.digits = digits; | ||
| if (typeof digits == 'string') { | ||
| this.digits = new Uint16Array(this.maxNoOfDigits); | ||
| for (let i = digits.length, j = maxNoOfDigits; i > -1; i--, j--) { | ||
| this.digits[j] = digits.charCodeAt(i); | ||
| if (this.digits[j] > this.base) { | ||
| throw new Error(`Any digit's ASCII code in given digits can't be more than or equal to given base: ${this.base}. ASCII code ${this.digits[j]} > base ${this.base}`); | ||
| Base2N.prototype.toString = function () { | ||
| var result = ''; | ||
| for (var i = 0; i < this.maxNoOfDigits; i++) { | ||
| result += this.charset[this.digits[i]]; | ||
| } | ||
| } | ||
| } | ||
| } | ||
| toString() { | ||
| let result = ''; | ||
| for (let i = 0; i < this.maxNoOfDigits; i++) { | ||
| result += this.charset[this.digits[i]]; | ||
| } | ||
| return result; | ||
| } | ||
| subtract(other) { | ||
| if (this.toString() < other.toString()) { | ||
| throw new Error('Subtraction result is negative'); | ||
| } | ||
| const result = new Uint16Array(this.maxNoOfDigits); | ||
| let carry = 0; | ||
| for (let i = this.maxNoOfDigits - 1; i > -1; i--) { | ||
| if (this.digits[i] < other.digits[i]) { | ||
| result[i] = this.digits[i] - carry + this.base - other.digits[i]; | ||
| carry = 1; | ||
| continue; | ||
| } | ||
| result[i] = this.digits[i] - carry - other.digits[i]; | ||
| carry = 0; | ||
| } | ||
| return new Base2N(result, this.n, this.maxNoOfDigits); | ||
| } | ||
| add(other) { | ||
| const result = new Uint16Array(this.maxNoOfDigits); | ||
| let carry = 0; | ||
| for (let i = this.maxNoOfDigits - 1; i > -1; i--) { | ||
| const curr = this.digits[i] + other.digits[i] + carry; | ||
| carry = curr > this.base ? 1 : 0; | ||
| result[i] = curr; | ||
| } | ||
| return new Base2N(result, this.n, this.maxNoOfDigits); | ||
| } | ||
| half() { | ||
| const result = new Uint16Array(this.maxNoOfDigits); | ||
| let carry = 0; | ||
| for (let i = 0; i < this.maxNoOfDigits; i++) { | ||
| const curr = (this.digits[i] >> 1) | (carry << 15); | ||
| carry = curr & 1 ? 1 : 0; | ||
| result[i] = curr; | ||
| } | ||
| return new Base2N(result, this.n, this.maxNoOfDigits); | ||
| } | ||
| average(other) { | ||
| if (this.maxNoOfDigits != other.length) { | ||
| throw new Error('Operands are not of the same length'); | ||
| } | ||
| let bothOddFlag = 0; | ||
| if ( | ||
| this.digits[this.digits.length - 1] % 2 == 1 && | ||
| other.digits[b.digits.length - 1] % 2 == 1 | ||
| ) { | ||
| bothOddFlag = 1; | ||
| } | ||
| const thisHalf = this.half(); | ||
| const bHalf = other.half(); | ||
| const result = thisHalf | ||
| .add(bHalf) | ||
| .add(new Base2N(bothOddFlag.toString(), this.n, this.maxNoOfDigits)); | ||
| return result; | ||
| } | ||
| } | ||
| module.exports = Base2N; | ||
| return result; | ||
| }; | ||
| Base2N.prototype.subtract = function (other) { | ||
| if (this.toString() < other.toString()) { | ||
| throw new Error('Subtraction result is negative'); | ||
| } | ||
| var result = new Uint16Array(this.maxNoOfDigits); | ||
| var carry = 0; | ||
| for (var i = this.maxNoOfDigits - 1; i > -1; i--) { | ||
| if (this.digits[i] < other.digits[i]) { | ||
| result[i] = this.digits[i] - carry + this.base - other.digits[i]; | ||
| carry = 1; | ||
| continue; | ||
| } | ||
| result[i] = this.digits[i] - carry - other.digits[i]; | ||
| carry = 0; | ||
| } | ||
| return new Base2N(result, this.n, this.maxNoOfDigits); | ||
| }; | ||
| Base2N.prototype.add = function (other) { | ||
| var result = new Uint16Array(this.maxNoOfDigits); | ||
| var carry = 0; | ||
| for (var i = this.maxNoOfDigits - 1; i > -1; i--) { | ||
| var curr = this.digits[i] + other.digits[i] + carry; | ||
| carry = curr > this.base ? 1 : 0; | ||
| result[i] = curr; | ||
| } | ||
| return new Base2N(result, this.n, this.maxNoOfDigits); | ||
| }; | ||
| Base2N.prototype.half = function () { | ||
| var result = new Uint16Array(this.maxNoOfDigits); | ||
| var carry = 0; | ||
| for (var i = 0; i < this.maxNoOfDigits; i++) { | ||
| var curr = (this.digits[i] >> 1) | (carry << 15); | ||
| carry = curr & 1 ? 1 : 0; | ||
| result[i] = curr; | ||
| } | ||
| return new Base2N(result, this.n, this.maxNoOfDigits); | ||
| }; | ||
| Base2N.prototype.average = function (other) { | ||
| if (this.maxNoOfDigits != other.maxNoOfDigits) { | ||
| throw new Error('Operands are not of the same length'); | ||
| } | ||
| var bothOddFlag = 0; | ||
| if (this.digits[this.digits.length - 1] % 2 == 1 && | ||
| other.digits[other.digits.length - 1] % 2 == 1) { | ||
| bothOddFlag = 1; | ||
| } | ||
| var thisHalf = this.half(); | ||
| var bHalf = other.half(); | ||
| var result = thisHalf | ||
| .add(bHalf) | ||
| .add(new Base2N(bothOddFlag.toString(), this.n, this.maxNoOfDigits)); | ||
| return result; | ||
| }; | ||
| return Base2N; | ||
| }()); | ||
| exports.default = Base2N; |
| { | ||
| "name": "@navpreetdevpuri/base-2-n", | ||
| "version": "0.0.3", | ||
| "version": "0.0.4", | ||
| "description": "To work with base 2^n numbers", | ||
| "main": "index.js", | ||
| "scripts": { | ||
| "test": "echo \"Error: no test specified\" && exit 1" | ||
| "build": "npx tsc" | ||
| }, | ||
@@ -9,0 +9,0 @@ "repository": { |
New alerts
Major refactor
Supply chain riskPackage has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.
Found 1 instance in 1 package
Fixed alerts
No tests
QualityPackage does not have any tests. This is a strong signal of a poorly maintained or low quality package.
Found 1 instance in 1 package
Improved metrics
- Total package byte prevSize
- increased by147.87%
13427
- Number of package files
- increased by125%
9
- Lines of code
- increased by131.43%
243
- Number of low quality alerts
- decreased by-50%
1
Worsened metrics
- Number of medium supply chain risk alerts
- increased byInfinity%
1
No dependency changes