Showing preview only (5,633K chars total). Download the full file or copy to clipboard to get everything.
Repository: MikeMcl/bignumber.js
Branch: main
Commit: a56f9e08de9a
Files: 72
Total size: 5.4 MB
Directory structure:
gitextract_ypy8eb9d/
├── .gitattributes
├── .github/
│ └── workflows/
│ └── ci.yml
├── .gitignore
├── CHANGELOG.md
├── LICENCE.md
├── README.md
├── bignumber.d.ts
├── bignumber.js
├── build.js
├── dist/
│ ├── bignumber.cjs
│ ├── bignumber.d.cts
│ ├── bignumber.d.mts
│ ├── bignumber.d.ts
│ ├── bignumber.js
│ └── bignumber.mjs
├── doc/
│ └── API.html
├── package.json
├── perf/
│ ├── README.md
│ ├── bignumber-vs-bigdecimal.html
│ ├── bigtime-OOM.js
│ ├── bigtime.js
│ └── lib/
│ ├── bigdecimal_GWT/
│ │ ├── BigDecTest.java
│ │ ├── LICENCE.txt
│ │ ├── bigdecimal.js
│ │ └── bugs.js
│ └── bigdecimal_ICU4J/
│ ├── BigDecimal-all-last.js
│ └── LICENCE.txt
└── test/
├── console-errors.html
├── methods/
│ ├── BigNumber.js
│ ├── absoluteValue.js
│ ├── clone.js
│ ├── comparedTo.js
│ ├── config.js
│ ├── decimalPlaces.js
│ ├── dividedBy.js
│ ├── dividedToIntegerBy.js
│ ├── exponentiatedBy.js
│ ├── integerValue.js
│ ├── isBigNumber.js
│ ├── isMethods.js
│ ├── minmax.js
│ ├── minus.js
│ ├── modulo.js
│ ├── multipliedBy.js
│ ├── negated.js
│ ├── plus.js
│ ├── precision.js
│ ├── random.js
│ ├── shiftedBy.js
│ ├── squareRoot.js
│ ├── sum.js
│ ├── toExponential.js
│ ├── toFixed.js
│ ├── toFormat.js
│ ├── toFraction.js
│ ├── toNumber.js
│ ├── toObject.js
│ ├── toPrecision.js
│ └── toString.js
├── methods.html
├── test.html
├── test.js
├── tester.js
└── typescript/
├── README.md
├── test_default_import.ts
├── test_global.ts
├── test_named_import.ts
├── test_require.ts
├── tsconfig.base.json
├── tsconfig.cjs.json
├── tsconfig.esm.json
└── tsconfig.global.json
================================================
FILE CONTENTS
================================================
================================================
FILE: .gitattributes
================================================
# Enforce LF normalization for all text files
* text=auto
================================================
FILE: .github/workflows/ci.yml
================================================
name: CI
on:
push:
branches: [main]
pull_request:
branches: [main]
jobs:
test:
name: Test on Node.js ${{ matrix.node-version }}
runs-on: ubuntu-latest
strategy:
# Build script requires Node.js >= 14.14.0.
matrix:
node-version: ['14', '20', 'lts/*', 'node']
fail-fast: false
steps:
- uses: actions/checkout@v4
- name: Use Node.js ${{ matrix.node-version }}
uses: actions/setup-node@v4
with:
node-version: ${{ matrix.node-version }}
- name: Build
run: npm run build
- name: Run JS tests
run: npm test
typecheck:
name: Type-check
needs: test
runs-on: ubuntu-latest
steps:
- uses: actions/checkout@v4
- name: Use Node.js node
uses: actions/setup-node@v4
with:
node-version: 'node'
- name: Install dependencies
run: npm install
- name: Build
run: npm run build
- name: Type-check
run: npm run typecheck
================================================
FILE: .gitignore
================================================
node_modules/
coverage/
npm-debug.log*
yarn-debug.log*
yarn-error.log*
package-lock.json
npm-shrinkwrap.json
.env
.vscode/
.idea/
.DS_Store
*.log
================================================
FILE: CHANGELOG.md
================================================
#### 10.0.2
* 24/02/26
* Reinstate *README.md* links.
#### 10.0.1
* 24/02/26
* Commit *dist* folder.
#### 10.0.0
* 23/02/26
* Implement targeted builds for ES modules, CommonJS, and browser (global assignment).
* Add CI workflow.
* Add type declaration import tests.
* Remove `BigNumber.DEBUG`, so the behaviour is now always as if it was `true`:
- throw on invalid input instead of returning `NaN`.
- always validate the `c`, `e`, and `s` properties of objects passed to `isBigNumber`
* Don't call `toString` on any arbitrary object passed to the constructor.
* Require a BigNumber value to be a string if a base is also passed.
* Add `toObject` prototype method which returns a plain object with `c`, `e`, and `s` properties.
* Remove *.npmignore*, as `files` in *package.json* is used. Add *.gitignore*.
* Normalise line endings and add *.gitattributes*.
* Add typescript to `devDependencies`.
#### 9.3.1
* 11/07/25
* [BUGFIX] #388 `toPrecision` fix.
#### 9.3.0
* 19/04/25
* Refactor type declarations:
* Rename *bignumber.d.ts* to *types.d.ts*.
* Rename *bignumber.d.cts* to *bignumber.d.ts*.
* Add `export as namespace` to *bignumber.d.ts*.
* Remove subpath exports from *package.json*.
* Refactor named export from *bignumber.d.mts*.
* #383 Remove `?` from static `BigNumber` and `default` properties.
* Add blank lines after titles in *CHANGELOG.md*.
#### 9.2.1
* 08/04/25
* #371 #382 Add `BigNumber` as named export.
#### 9.2.0
* 03/04/25
* #355 Support `BigInt` argument.
* #371 Provide separate type definitions for CommonJS and ES modules.
* #374 Correct `comparedTo` return type.
#### 9.1.2
* 28/08/23
* #354 Amend `round` to avoid bug in v8 Maglev compiler.
* [BUGFIX] #344 `minimum(0, -0)` should be `-0`.
#### 9.1.1
* 04/12/22
* #338 [BUGFIX] `exponentiatedBy`: ensure `0**-n === Infinity` for very large `n`.
#### 9.1.0
* 08/08/22
* #329 Remove `import` example.
* #277 Resolve lint warnings and add number `toString` note.
* Correct `decimalPlaces()` return type in *bignumber.d.ts*.
* Add ES module global `crypto` example.
* #322 Add `exports` field to *package.json*.
* #251 (#308) Amend *bignumber.d.ts* to allow instantiating a BigNumber without `new`.
#### 9.0.2
* 12/12/21
* #250 [BUGFIX] Allow use of user-defined alphabet for base 10.
* #295 Remove *bignumber.min.js* and amend *README.md*.
* Update *.travis.yml* and *LICENCE.md*.
#### 9.0.1
* 28/09/20
* [BUGFIX] #276 Correct `sqrt` initial estimate.
* Update *.travis.yml*, *LICENCE.md* and *README.md*.
#### 9.0.0
* 27/05/2019
* For compatibility with legacy browsers, remove `Symbol` references.
#### 8.1.1
* 24/02/2019
* [BUGFIX] #222 Restore missing `var` to `export BigNumber`.
* Allow any key in BigNumber.Instance in *bignumber.d.ts*.
#### 8.1.0
* 23/02/2019
* [NEW FEATURE] #220 Create a BigNumber using `{s, e, c}`.
* [NEW FEATURE] `isBigNumber`: if `BigNumber.DEBUG` is `true`, also check that the BigNumber instance is well-formed.
* Remove `instanceof` checks; just use `_isBigNumber` to identify a BigNumber instance.
* Add `_isBigNumber` to prototype in *bignumber.mjs*.
* Add tests for BigNumber creation from object.
* Update *API.html*.
#### 8.0.2
* 13/01/2019
* #209 `toPrecision` without argument should follow `toString`.
* Improve *Use* section of *README*.
* Optimise `toString(10)`.
* Add verson number to API doc.
#### 8.0.1
* 01/11/2018
* Rest parameter must be array type in *bignumber.d.ts*.
#### 8.0.0
* 01/11/2018
* [NEW FEATURE] Add `BigNumber.sum` method.
* [NEW FEATURE]`toFormat`: add `prefix` and `suffix` options.
* [NEW FEATURE] #178 Pass custom formatting to `toFormat`.
* [BREAKING CHANGE] #184 `toFraction`: return array of BigNumbers not strings.
* [NEW FEATURE] #185 Enable overwrite of `valueOf` to prevent accidental addition to string.
* #183 Add Node.js `crypto` requirement to documentation.
* [BREAKING CHANGE] #198 Disallow signs and whitespace in custom alphabet.
* [NEW FEATURE] #188 Implement `util.inspect.custom` for Node.js REPL.
* #170 Make `isBigNumber` a type guard in *bignumber.d.ts*.
* [BREAKING CHANGE] `BigNumber.min` and `BigNumber.max`: don't accept an array.
* Update *.travis.yml*.
* Remove *bower.json*.
#### 7.2.1
* 24/05/2018
* Add `browser` field to *package.json*.
#### 7.2.0
* 22/05/2018
* #166 Correct *.mjs* file. Remove extension from `main` field in *package.json*.
#### 7.1.0
* 18/05/2018
* Add `module` field to *package.json* for *bignumber.mjs*.
#### 7.0.2
* 17/05/2018
* #165 Bugfix: upper-case letters for bases 11-36 in a custom alphabet.
* Add note to *README* regarding creating BigNumbers from Number values.
#### 7.0.1
* 26/04/2018
* #158 Fix global object variable name typo.
#### 7.0.0
* 26/04/2018
* #143 Remove global BigNumber from typings.
* #144 Enable compatibility with `Object.freeze(Object.prototype)`.
* #148 #123 #11 Only throw on a number primitive with more than 15 significant digits if `BigNumber.DEBUG` is `true`.
* Only throw on an invalid BigNumber value if `BigNumber.DEBUG` is `true`. Return BigNumber `NaN` instead.
* #154 `exponentiatedBy`: allow BigNumber exponent.
* #156 Prevent Content Security Policy *unsafe-eval* issue.
* `toFraction`: allow `Infinity` maximum denominator.
* Comment-out some excess tests to reduce test time.
* Amend indentation and other spacing.
#### 6.0.0
* 26/01/2018
* #137 Implement `APLHABET` configuration option.
* Remove `ERRORS` configuration option.
* Remove `toDigits` method; extend `precision` method accordingly.
* Remove s`round` method; extend `decimalPlaces` method accordingly.
* Remove methods: `ceil`, `floor`, and `truncated`.
* Remove method aliases: `add`, `cmp`, `isInt`, `isNeg`, `trunc`, `mul`, `neg` and `sub`.
* Rename methods: `shift` to `shiftedBy`, `another` to `clone`, `toPower` to `exponentiatedBy`, and `equals` to `isEqualTo`.
* Rename methods: add `is` prefix to `greaterThan`, `greaterThanOrEqualTo`, `lessThan` and `lessThanOrEqualTo`.
* Add methods: `multipliedBy`, `isBigNumber`, `isPositive`, `integerValue`, `maximum` and `minimum`.
* Refactor test suite.
* Add *CHANGELOG.md*.
* Rewrite *bignumber.d.ts*.
* Redo API image.
#### 5.0.0
* 27/11/2017
* #81 Don't throw on constructor call without `new`.
#### 4.1.0
* 26/09/2017
* Remove node 0.6 from *.travis.yml*.
* Add *bignumber.mjs*.
#### 4.0.4
* 03/09/2017
* Add missing aliases to *bignumber.d.ts*.
#### 4.0.3
* 30/08/2017
* Add types: *bignumber.d.ts*.
#### 4.0.2
* 03/05/2017
* #120 Workaround Safari/Webkit bug.
#### 4.0.1
* 05/04/2017
* #121 BigNumber.default to BigNumber['default'].
#### 4.0.0
* 09/01/2017
* Replace BigNumber.isBigNumber method with isBigNumber prototype property.
#### 3.1.2
* 08/01/2017
* Minor documentation edit.
#### 3.1.1
* 08/01/2017
* Uncomment `isBigNumber` tests.
* Ignore dot files.
#### 3.1.0
* 08/01/2017
* Add `isBigNumber` method.
#### 3.0.2
* 08/01/2017
* Bugfix: Possible incorrect value of `ERRORS` after a `BigNumber.another` call (due to `parseNumeric` declaration in outer scope).
#### 3.0.1
* 23/11/2016
* Apply fix for old ipads with `%` issue, see #57 and #102.
* Correct error message.
#### 3.0.0
* 09/11/2016
* Remove `require('crypto')` - leave it to the user.
* Add `BigNumber.set` as `BigNumber.config` alias.
* Default `POW_PRECISION` to `0`.
#### 2.4.0
* 14/07/2016
* #97 Add exports to support ES6 imports.
#### 2.3.0
* 07/03/2016
* #86 Add modulus parameter to `toPower`.
#### 2.2.0
* 03/03/2016
* #91 Permit larger JS integers.
#### 2.1.4
* 15/12/2015
* Correct UMD.
#### 2.1.3
* 13/12/2015
* Refactor re global object and crypto availability when bundling.
#### 2.1.2
* 10/12/2015
* Bugfix: `window.crypto` not assigned to `crypto`.
#### 2.1.1
* 09/12/2015
* Prevent code bundler from adding `crypto` shim.
#### 2.1.0
* 26/10/2015
* For `valueOf` and `toJSON`, include the minus sign with negative zero.
#### 2.0.8
* 2/10/2015
* Internal round function bugfix.
#### 2.0.6
* 31/03/2015
* Add bower.json. Tweak division after in-depth review.
#### 2.0.5
* 25/03/2015
* Amend README. Remove bitcoin address.
#### 2.0.4
* 25/03/2015
* Critical bugfix #58: division.
#### 2.0.3
* 18/02/2015
* Amend README. Add source map.
#### 2.0.2
* 18/02/2015
* Correct links.
#### 2.0.1
* 18/02/2015
* Add `max`, `min`, `precision`, `random`, `shiftedBy`, `toDigits` and `truncated` methods.
* Add the short-forms: `add`, `mul`, `sd`, `sub` and `trunc`.
* Add an `another` method to enable multiple independent constructors to be created.
* Add support for the base 2, 8 and 16 prefixes `0b`, `0o` and `0x`.
* Enable a rounding mode to be specified as a second parameter to `toExponential`, `toFixed`, `toFormat` and `toPrecision`.
* Add a `CRYPTO` configuration property so cryptographically-secure pseudo-random number generation can be specified.
* Add a `MODULO_MODE` configuration property to enable the rounding mode used by the `modulo` operation to be specified.
* Add a `POW_PRECISION` configuration property to enable the number of significant digits calculated by the power operation to be limited.
* Improve code quality.
* Improve documentation.
#### 2.0.0
* 29/12/2014
* Add `dividedToIntegerBy`, `isInteger` and `toFormat` methods.
* Remove the following short-forms: `isF`, `isZ`, `toE`, `toF`, `toFr`, `toN`, `toP`, `toS`.
* Store a BigNumber's coefficient in base 1e14, rather than base 10.
* Add fast path for integers to BigNumber constructor.
* Incorporate the library into the online documentation.
#### 1.5.0
* 13/11/2014
* Add `toJSON` and `decimalPlaces` methods.
#### 1.4.1
* 08/06/2014
* Amend README.
#### 1.4.0
* 08/05/2014
* Add `toNumber`.
#### 1.3.0
* 08/11/2013
* Ensure correct rounding of `sqrt` in all, rather than almost all, cases.
* Maximum radix to 64.
#### 1.2.1
* 17/10/2013
* Sign of zero when x < 0 and x + (-x) = 0.
#### 1.2.0
* 19/9/2013
* Throw Error objects for stack.
#### 1.1.1
* 22/8/2013
* Show original value in constructor error message.
#### 1.1.0
* 1/8/2013
* Allow numbers with trailing radix point.
#### 1.0.1
* Bugfix: error messages with incorrect method name
#### 1.0.0
* 8/11/2012
* Initial release
================================================
FILE: LICENCE.md
================================================
The MIT License (MIT)
=====================
Copyright © `<2026>` `Michael Mclaughlin`
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the “Software”), to deal in the Software without
restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following
conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
================================================
FILE: README.md
================================================
A JavaScript library for arbitrary-precision decimal and non-decimal arithmetic.
[](https://www.npmjs.com/package/bignumber.js)
[](https://www.npmjs.com/package/bignumber.js)
[](https://github.com/MikeMcl/bignumber.js/actions/workflows/ci.yml)
<br />
- [Features](#features)
- [Build](#build)
- [Load](#load)
- [Use](#use)
- [Test](#test)
- [Minify](#minify)
- [Licence](#licence)
## Features
- Integers and decimals
- Simple API but full-featured
- Faster, smaller, and perhaps easier to use than JavaScript versions of Java's BigDecimal
- 8 KB minified and gzipped
- Replicates the `toExponential`, `toFixed`, `toPrecision` and `toString` methods of JavaScript's Number type
- Includes a `toFraction` and a correctly-rounded `squareRoot` method
- Supports cryptographically-secure pseudo-random number generation
- No dependencies
- Wide platform compatibility: uses JavaScript 1.5 (ECMAScript 3) features only
- Comprehensive [documentation](http://mikemcl.github.io/bignumber.js/) and test set
If a smaller and simpler library is required see [big.js](https://github.com/MikeMcl/big.js/).
It's less than half the size but only works with decimal numbers and only has half the methods.
It also has fewer configuration options than this library, and does not allow `NaN` or `Infinity`.
See also [decimal.js](https://github.com/MikeMcl/decimal.js/), which among other things adds support for non-integer powers, and performs all operations to a specified number of significant digits.
## Build
*bignumber.js* is the single source file, and *bignumber.d.ts* contains the type declarations for it. The build script, *build.js*, creates targeted builds in a *dist* directory for ES module, CommonJS, and browser usage.
To run the build script (requires Node.js ≥ 14.14.0):
```bash
npm install
npm run build
# or: node build.js
```
A *dist* directory will be created containing the following:
| Module format | Distributable | Type declaration |
| --- | --- | --- |
| ES module (ESM) | bignumber.mjs | bignumber.d.mts |
| CommonJS (CJS) | bignumber.cjs | bignumber.d.cts |
| Browser (global) | bignumber.js | bignumber.d.ts |
## Load
### Browser
```html
<script src='dist/bignumber.js'></script>
```
or, minified from a CDN (Content Delivery Network):
```html
<script src='https://cdn.jsdelivr.net/npm/bignumber.js@latest/dist/bignumber.min.js'></script>
```
> ES module
```html
<script type="module">
import BigNumber from './dist/bignumber.mjs';
// ...
</script>
```
or, minified from a CDN:
```html
<script type="module">
import BigNumber from 'https://cdn.jsdelivr.net/npm/bignumber.js@latest/+esm'
// ...
</script>
```
### [Node.js](http://nodejs.org)
```bash
npm install bignumber.js
```
> CommonJS
```javascript
const BigNumber = require('bignumber.js');
// or, testing from a local repo:
const BigNumber = require('./dist/bignumber.cjs');
```
> ES module
```javascript
import BigNumber from 'bignumber.js';
// or
import { BigNumber } from 'bignumber.js';
// or, testing from a local repo:
import { BigNumber } from './dist/bignumber.mjs';
```
### [Deno](https://deno.land/)
```javascript
// @deno-types="https://raw.githubusercontent.com/MikeMcl/bignumber.js/main/dist/bignumber.d.mts"
import BigNumber from 'https://raw.githubusercontent.com/MikeMcl/bignumber.js/main/dist/bignumber.mjs';
// or
// @deno-types="https://unpkg.com/bignumber.js@latest/dist/bignumber.d.mts"
import { BigNumber } from 'https://unpkg.com/bignumber.js@latest/dist/bignumber.mjs';
```
## Use
The library exports a single constructor function, [`BigNumber`](http://mikemcl.github.io/bignumber.js/#bignumber), which accepts a value of type Number, String, BigInt or BigNumber,
```javascript
let x = new BigNumber(123.4567);
let y = BigNumber('123456.7e-3');
let z = new BigNumber(x);
x.isEqualTo(y) && y.isEqualTo(z) && x.isEqualTo(z); // true
```
An error will be thrown if an invalid value is passed to the constructor.
To get the string value of a BigNumber use [`toString()`](http://mikemcl.github.io/bignumber.js/#toS) or [`toFixed()`](http://mikemcl.github.io/bignumber.js/#toFix). Using `toFixed()` prevents exponential notation being returned, no matter how large or small the value.
```javascript
let x = new BigNumber('1111222233334444555566');
x.toString(); // "1.111222233334444555566e+21"
x.toFixed(); // "1111222233334444555566"
```
If the limited precision of Number values is not well understood, it is recommended to create BigNumbers from String values rather than Number values to avoid a potential loss of precision.
*In all further examples below, `let`, semicolons and `toString` calls are not shown. If a commented-out value is in quotes it means `toString` has been called on the preceding expression.*
```javascript
// Precision loss from using numeric literals with more than 15 significant digits.
new BigNumber(1.0000000000000001) // '1'
new BigNumber(88259496234518.57) // '88259496234518.56'
new BigNumber(99999999999999999999) // '100000000000000000000'
// Precision loss from using numeric literals outside the range of Number values.
new BigNumber(2e+308) // 'Infinity'
new BigNumber(1e-324) // '0'
// Precision loss from the unexpected result of arithmetic with Number values.
new BigNumber(0.7 + 0.1) // '0.7999999999999999'
```
When creating a BigNumber from a Number, note that a BigNumber is created from a Number's decimal `toString()` value not from its underlying binary value. If the latter is required, then pass the Number's `toString(2)` value and specify base 2.
```javascript
new BigNumber(Number.MAX_VALUE.toString(2), 2)
```
BigNumbers can be created from string values in bases from 2 to 36. See [`ALPHABET`](http://mikemcl.github.io/bignumber.js/#alphabet) to extend this range.
```javascript
a = new BigNumber('1011', 2) // "11"
b = new BigNumber('zz.9', 36) // "1295.25"
c = a.plus(b) // "1306.25"
```
*Explicitly passing base 10 is not recommended as it will cause the slower base conversion path to be used, which is only necessary if an unconventional `ALPHABET` has been specified.*
A BigNumber is immutable in the sense that it is not changed by its methods.
```javascript
0.3 - 0.1 // 0.19999999999999998
x = new BigNumber(0.3)
x.minus(0.1) // "0.2"
x // "0.3"
```
The methods that return a BigNumber can be chained.
```javascript
x.dividedBy(y).plus(z).times(9)
x.times('1.23456780123456789e+9').plus(9876.5432321).dividedBy('4444562598.111772').integerValue()
```
Some of the longer method names have a shorter alias.
```javascript
x.squareRoot().dividedBy(y).exponentiatedBy(3).isEqualTo(x.sqrt().div(y).pow(3)) // true
x.modulo(y).multipliedBy(z).eq(x.mod(y).times(z)) // true
```
As with JavaScript's Number type, there are [`toExponential`](http://mikemcl.github.io/bignumber.js/#toE), [`toFixed`](http://mikemcl.github.io/bignumber.js/#toFix) and [`toPrecision`](http://mikemcl.github.io/bignumber.js/#toP) methods.
```javascript
x = new BigNumber(255.5)
x.toExponential(5) // "2.55500e+2"
x.toFixed(5) // "255.50000"
x.toPrecision(5) // "255.50"
x.toNumber() // 255.5
```
A base can be specified for [`toString`](http://mikemcl.github.io/bignumber.js/#toS).
```javascript
x.toString(16) // "ff.8"
```
*Again, explicitly passing base 10 is not recommended as it will cause the slower base conversion path to be used, which is only necessary if an unconventional `ALPHABET` has been specified.*
There is a [`toFormat`](http://mikemcl.github.io/bignumber.js/#toFor) method which may be useful for internationalisation.
```javascript
y = new BigNumber('1234567.898765')
y.toFormat(2) // "1,234,567.90"
```
The maximum number of decimal places of the result of an operation involving division (i.e. a division, square root, base conversion or negative power operation) is set using the `set` or `config` method of the `BigNumber` constructor.
The other arithmetic operations always give the exact result.
```javascript
BigNumber.set({ DECIMAL_PLACES: 10, ROUNDING_MODE: 4 })
x = new BigNumber(2)
y = new BigNumber(3)
z = x.dividedBy(y) // "0.6666666667"
z.squareRoot() // "0.8164965809"
z.exponentiatedBy(-3) // "3.3749999995"
z.toString(2) // "0.1010101011"
z.multipliedBy(z) // "0.44444444448888888889"
z.multipliedBy(z).decimalPlaces(10) // "0.4444444445"
```
There is a [`toFraction`](http://mikemcl.github.io/bignumber.js/#toFr) method with an optional *maximum denominator* argument
```javascript
y = new BigNumber(355)
pi = y.dividedBy(113) // "3.1415929204"
pi.toFraction() // [ "7853982301", "2500000000" ]
pi.toFraction(1000) // [ "355", "113" ]
```
and [`isNaN`](http://mikemcl.github.io/bignumber.js/#isNaN) and [`isFinite`](http://mikemcl.github.io/bignumber.js/#isF) methods, as `NaN` and `Infinity` are valid `BigNumber` values.
```javascript
x = new BigNumber(NaN) // "NaN"
y = new BigNumber(Infinity) // "Infinity"
x.isNaN() && !y.isNaN() && !x.isFinite() && !y.isFinite() // true
```
The value of a BigNumber is stored in a decimal floating point format in terms of a coefficient, exponent and sign.
```javascript
x = new BigNumber(-123.456);
x.c // [ 123, 45600000000000 ] coefficient (i.e. significand)
x.e // 2 exponent
x.s // -1 sign
```
For advanced usage, multiple BigNumber constructors can be created, each with its own independent configuration.
```javascript
// Set DECIMAL_PLACES for the original BigNumber constructor
BigNumber.set({ DECIMAL_PLACES: 10 })
// Create another BigNumber constructor, optionally passing in a configuration object
BN = BigNumber.clone({ DECIMAL_PLACES: 5 })
x = new BigNumber(1)
y = new BN(1)
x.div(3) // '0.3333333333'
y.div(3) // '0.33333'
```
To avoid having to call `toString` or `valueOf` on a BigNumber to get its value in the Node.js REPL or when using `console.log` use
```javascript
BigNumber.prototype[require('util').inspect.custom] = BigNumber.prototype.valueOf;
```
For further information see the [API](http://mikemcl.github.io/bignumber.js/) reference in the *doc* directory.
## Test
The *test/methods* directory contains the test scripts for each method.
The tests can be run with Node.js or a browser. The tests require the CommonJS distributable, so **build before testing**:
```bash
npm run build
npm test
# or: node test/test
```
To test a single method, use, for example
```bash
node test/methods/toFraction
```
For the browser, open *test/test.html*.
There are also some old programs in *perf* that still work and can be useful for testing and cross-checking results over large sets of random inputs.
### TypeScript
The *test/typescript* directory contains TypeScript compilation tests that verify the type declarations and imports work correctly for each module format. Run them with:
```bash
npm run typecheck
```
## Minify
To minify using, for example, [terser](https://github.com/terser/terser):
```bash
npm install -g terser
```
Minify the browser/global bundle:
```bash
terser dist/bignumber.js -c -m -o dist/bignumber.min.js
```
## Licence
The MIT Licence.
See [LICENCE](https://github.com/MikeMcl/bignumber.js/blob/main/LICENCE.md).
================================================
FILE: bignumber.d.ts
================================================
// Type definitions for bignumber.js >=8.1.0
// Project: https://github.com/MikeMcl/bignumber.js
// Definitions by: Michael Mclaughlin <https://github.com/MikeMcl>
// Definitions: https://github.com/MikeMcl/bignumber.js
// Documentation: http://mikemcl.github.io/bignumber.js/
//
// class BigNumber
// type BigNumber.Constructor
// type BigNumber.ModuloMode
// type BigNumber.RoundingMode
// type BigNumber.Value
// interface BigNumber.Config
// interface BigNumber.Format
// interface BigNumber.Instance
//
// Example:
//
// import {BigNumber} from "bignumber.js"
// //import BigNumber from "bignumber.js"
// //import BigNumber = require("bignumber.js");
//
// let rm: BigNumber.RoundingMode = BigNumber.ROUND_UP;
// let f: BigNumber.Format = { decimalSeparator: ',' };
// let c: BigNumber.Config = { DECIMAL_PLACES: 4, ROUNDING_MODE: rm, FORMAT: f };
// BigNumber.config(c);
//
// let v: BigNumber.Value = '12345.6789';
// let b: BigNumber = new BigNumber(v);
//
// The use of compiler option `--strictNullChecks` is recommended.
declare namespace BigNumber {
/** See `BigNumber.config` (alias `BigNumber.set`) and `BigNumber.clone`. */
interface Config {
/**
* An integer, 0 to 1e+9. Default value: 20.
*
* The maximum number of decimal places of the result of operations involving division, i.e.
* division, square root and base conversion operations, and exponentiation when the exponent is
* negative.
*
* ```ts
* BigNumber.config({ DECIMAL_PLACES: 5 })
* BigNumber.set({ DECIMAL_PLACES: 5 })
* ```
*/
DECIMAL_PLACES?: number;
/**
* An integer, 0 to 8. Default value: `BigNumber.ROUND_HALF_UP` (4).
*
* The rounding mode used in operations that involve division (see `DECIMAL_PLACES`) and the
* default rounding mode of the `decimalPlaces`, `precision`, `toExponential`, `toFixed`,
* `toFormat` and `toPrecision` methods.
*
* The modes are available as enumerated properties of the BigNumber constructor.
*
* ```ts
* BigNumber.config({ ROUNDING_MODE: 0 })
* BigNumber.set({ ROUNDING_MODE: BigNumber.ROUND_UP })
* ```
*/
ROUNDING_MODE?: BigNumber.RoundingMode;
/**
* An integer, 0 to 1e+9, or an array, [-1e+9 to 0, 0 to 1e+9].
* Default value: `[-7, 20]`.
*
* The exponent value(s) at which `toString` returns exponential notation.
*
* If a single number is assigned, the value is the exponent magnitude.
*
* If an array of two numbers is assigned then the first number is the negative exponent value at
* and beneath which exponential notation is used, and the second number is the positive exponent
* value at and above which exponential notation is used.
*
* For example, to emulate JavaScript numbers in terms of the exponent values at which they begin
* to use exponential notation, use `[-7, 20]`.
*
* ```ts
* BigNumber.config({ EXPONENTIAL_AT: 2 })
* new BigNumber(12.3) // '12.3' e is only 1
* new BigNumber(123) // '1.23e+2'
* new BigNumber(0.123) // '0.123' e is only -1
* new BigNumber(0.0123) // '1.23e-2'
*
* BigNumber.config({ EXPONENTIAL_AT: [-7, 20] })
* new BigNumber(123456789) // '123456789' e is only 8
* new BigNumber(0.000000123) // '1.23e-7'
*
* // Almost never return exponential notation:
* BigNumber.config({ EXPONENTIAL_AT: 1e+9 })
*
* // Always return exponential notation:
* BigNumber.config({ EXPONENTIAL_AT: 0 })
* ```
*
* Regardless of the value of `EXPONENTIAL_AT`, the `toFixed` method will always return a value in
* normal notation and the `toExponential` method will always return a value in exponential form.
* Calling `toString` with a base argument, e.g. `toString(10)`, will also always return normal
* notation.
*/
EXPONENTIAL_AT?: number | [number, number];
/**
* An integer, magnitude 1 to 1e+9, or an array, [-1e+9 to -1, 1 to 1e+9].
* Default value: `[-1e+9, 1e+9]`.
*
* The exponent value(s) beyond which overflow to Infinity and underflow to zero occurs.
*
* If a single number is assigned, it is the maximum exponent magnitude: values wth a positive
* exponent of greater magnitude become Infinity and those with a negative exponent of greater
* magnitude become zero.
*
* If an array of two numbers is assigned then the first number is the negative exponent limit and
* the second number is the positive exponent limit.
*
* For example, to emulate JavaScript numbers in terms of the exponent values at which they
* become zero and Infinity, use [-324, 308].
*
* ```ts
* BigNumber.config({ RANGE: 500 })
* BigNumber.config().RANGE // [ -500, 500 ]
* new BigNumber('9.999e499') // '9.999e+499'
* new BigNumber('1e500') // 'Infinity'
* new BigNumber('1e-499') // '1e-499'
* new BigNumber('1e-500') // '0'
*
* BigNumber.config({ RANGE: [-3, 4] })
* new BigNumber(99999) // '99999' e is only 4
* new BigNumber(100000) // 'Infinity' e is 5
* new BigNumber(0.001) // '0.01' e is only -3
* new BigNumber(0.0001) // '0' e is -4
* ```
* The largest possible magnitude of a finite BigNumber is 9.999...e+1000000000.
* The smallest possible magnitude of a non-zero BigNumber is 1e-1000000000.
*/
RANGE?: number | [number, number];
/**
* A boolean: `true` or `false`. Default value: `false`.
*
* The value that determines whether cryptographically-secure pseudo-random number generation is
* used. If `CRYPTO` is set to true then the random method will generate random digits using
* `crypto.getRandomValues` in browsers that support it, or `crypto.randomBytes` if using a
* version of Node.js that supports it.
*
* If neither function is supported by the host environment then attempting to set `CRYPTO` to
* `true` will fail and an exception will be thrown.
*
* If `CRYPTO` is `false` then the source of randomness used will be `Math.random` (which is
* assumed to generate at least 30 bits of randomness).
*
* See `BigNumber.random`.
*
* ```ts
* // Node.js
* global.crypto = require('crypto')
*
* BigNumber.config({ CRYPTO: true })
* BigNumber.config().CRYPTO // true
* BigNumber.random() // 0.54340758610486147524
* ```
*/
CRYPTO?: boolean;
/**
* An integer, 0, 1, 3, 6 or 9. Default value: `BigNumber.ROUND_DOWN` (1).
*
* The modulo mode used when calculating the modulus: `a mod n`.
* The quotient, `q = a / n`, is calculated according to the `ROUNDING_MODE` that corresponds to
* the chosen `MODULO_MODE`.
* The remainder, `r`, is calculated as: `r = a - n * q`.
*
* The modes that are most commonly used for the modulus/remainder operation are shown in the
* following table. Although the other rounding modes can be used, they may not give useful
* results.
*
* Property | Value | Description
* :------------------|:------|:------------------------------------------------------------------
* `ROUND_UP` | 0 | The remainder is positive if the dividend is negative.
* `ROUND_DOWN` | 1 | The remainder has the same sign as the dividend.
* | | Uses 'truncating division' and matches JavaScript's `%` operator .
* `ROUND_FLOOR` | 3 | The remainder has the same sign as the divisor.
* | | This matches Python's `%` operator.
* `ROUND_HALF_EVEN` | 6 | The IEEE 754 remainder function.
* `EUCLID` | 9 | The remainder is always positive.
* | | Euclidian division: `q = sign(n) * floor(a / abs(n))`
*
* The rounding/modulo modes are available as enumerated properties of the BigNumber constructor.
*
* See `modulo`.
*
* ```ts
* BigNumber.config({ MODULO_MODE: BigNumber.EUCLID })
* BigNumber.set({ MODULO_MODE: 9 }) // equivalent
* ```
*/
MODULO_MODE?: BigNumber.ModuloMode;
/**
* An integer, 0 to 1e+9. Default value: 0.
*
* The maximum precision, i.e. number of significant digits, of the result of the power operation
* - unless a modulus is specified.
*
* If set to 0, the number of significant digits will not be limited.
*
* See `exponentiatedBy`.
*
* ```ts
* BigNumber.config({ POW_PRECISION: 100 })
* ```
*/
POW_PRECISION?: number;
/**
* An object including any number of the properties shown below.
*
* The object configures the format of the string returned by the `toFormat` method.
* The example below shows the properties of the object that are recognised, and
* their default values.
*
* Unlike the other configuration properties, the values of the properties of the `FORMAT` object
* will not be checked for validity - the existing object will simply be replaced by the object
* that is passed in.
*
* See `toFormat`.
*
* ```ts
* BigNumber.config({
* FORMAT: {
* // string to prepend
* prefix: '',
* // the decimal separator
* decimalSeparator: '.',
* // the grouping separator of the integer part
* groupSeparator: ',',
* // the primary grouping size of the integer part
* groupSize: 3,
* // the secondary grouping size of the integer part
* secondaryGroupSize: 0,
* // the grouping separator of the fraction part
* fractionGroupSeparator: ' ',
* // the grouping size of the fraction part
* fractionGroupSize: 0,
* // string to append
* suffix: ''
* }
* })
* ```
*/
FORMAT?: BigNumber.Format;
/**
* The alphabet used for base conversion. The length of the alphabet corresponds to the maximum
* value of the base argument that can be passed to the BigNumber constructor or `toString`.
*
* Default value: `'0123456789abcdefghijklmnopqrstuvwxyz'`.
*
* There is no maximum length for the alphabet, but it must be at least two characters long,
* and it must not contain whitespace or a repeated character, or the sign indicators '+' and
* '-', or the decimal separator '.'.
*
* ```ts
* // duodecimal (base 12)
* BigNumber.config({ ALPHABET: '0123456789TE' })
* x = new BigNumber('T', 12)
* x.toString() // '10'
* x.toString(12) // 'T'
* ```
*/
ALPHABET?: string;
}
/** See `FORMAT` and `toFormat`. */
interface Format {
/** The string to prepend. */
prefix?: string;
/** The decimal separator. */
decimalSeparator?: string;
/** The grouping separator of the integer part. */
groupSeparator?: string;
/** The primary grouping size of the integer part. */
groupSize?: number;
/** The secondary grouping size of the integer part. */
secondaryGroupSize?: number;
/** The grouping separator of the fraction part. */
fractionGroupSeparator?: string;
/** The grouping size of the fraction part. */
fractionGroupSize?: number;
/** The string to append. */
suffix?: string;
}
interface Instance {
/** The coefficient of the value of this BigNumber, an array of base 1e14 integer numbers, or null. */
readonly c: number[] | null;
/** The exponent of the value of this BigNumber, an integer number, -1000000000 to 1000000000, or null. */
readonly e: number | null;
/** The sign of the value of this BigNumber, -1, 1, or null. */
readonly s: number | null;
[key: string]: any;
}
type Constructor = typeof BigNumber;
type ModuloMode = 0 | 1 | 3 | 6 | 9;
type RoundingMode = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8;
type Value = string | number | bigint | Instance;
}
declare class BigNumber implements BigNumber.Instance {
/** Used internally to identify a BigNumber instance. */
private readonly _isBigNumber: true;
/** The coefficient of the value of this BigNumber, an array of base 1e14 integer numbers, or null. */
readonly c: number[] | null;
/** The exponent of the value of this BigNumber, an integer number, -1000000000 to 1000000000, or null. */
readonly e: number | null;
/** The sign of the value of this BigNumber, -1, 1, or null. */
readonly s: number | null;
/**
* Returns a new instance of a BigNumber object with value `n`, where `n` is a numeric value in
* the specified `base`, or base 10 if `base` is omitted.
*
* ```ts
* x = new BigNumber(0.1) // '0.1'
* // 'new' is optional
* y = BigNumber(x) // '0.1'
* ```
*
* Note that the BigNumber constructor accepts an `n` of type `number` purely as a convenience
* so that string quotes don't have to be typed when entering literal values, and that it is
* the `toString` value of `n` that is used rather than its underlying binary floating point
* value converted to decimal.
*
* If `n` is a decimal value and a `base` is not specified, it can be in normal or exponential
* notation. If a `base` is specified, `n` must be a string in normal notation. Values in any
* base can have fraction digits, i.e. digits after the decimal point.
*
* ```ts
* new BigNumber(43210) // '43210'
* new BigNumber('4.321e+4') // '43210'
* new BigNumber('-735.0918e-430') // '-7.350918e-428'
* new BigNumber('123412421.234324', 5) // '607236.557696'
* ```
*
* Signed `0`, signed `Infinity` and `NaN` are supported.
*
* ```ts
* new BigNumber('-Infinity') // '-Infinity'
* new BigNumber(NaN) // 'NaN'
* new BigNumber(-0) // '0'
* new BigNumber('.5') // '0.5'
* new BigNumber('+2') // '2'
* ```
*
* String values in hexadecimal literal form, e.g. `'0xff'`, are valid, as are string values with
* the octal and binary prefixs `'0o'` and `'0b'`. String values in octal literal form without the
* prefix will be interpreted as decimals, e.g. `'011'` is interpreted as 11, not 9.
*
* ```ts
* new BigNumber('-10110100.1', 2) // '-180.5'
* new BigNumber('-0b10110100.1') // '-180.5'
* new BigNumber('ff.8', 16) // '255.5'
* new BigNumber('0xff.8') // '255.5'
* ```
*
* If a base is specified, `n` is converted to a decimal BigNumber value rounded according to
* the current `DECIMAL_PLACES` and `ROUNDING_MODE` settings.
*
* ```ts
* BigNumber.config({ DECIMAL_PLACES: 5 })
* new BigNumber('xy.z', 36) // '1222.97222'
* ```
*
* An error is thrown if `base` is invalid.
*
* There is no limit to the number of digits of a value of type string (other than that of
* JavaScript's maximum array size). See `RANGE` to set the maximum and minimum possible exponent
* value of a BigNumber.
*
* ```ts
* new BigNumber('5032485723458348569331745.33434346346912144534543')
* new BigNumber('4.321e10000000')
* ```
*
* An error is thrown if `n` is invalid.
*
* ```ts
* new BigNumber('.1*') // '[BigNumber Error] Not a number: .1*'
* new BigNumber('blurgh') // '[BigNumber Error] Not a number: blurgh'
* new BigNumber('9', 2) // '[BigNumber Error] Not a base 2 number: 9'
* ```
*
* In advanced usage, a BigNumber can also be created from a plain object with `c`, `e` and `s`
* properties, representing its coefficient, exponent and sign respectively, if an `_isBigNumber`
* property with the value `true` is also present.
*
* ```ts
* new BigNumber({ s: 1, e: 2, c: [ 777, 12300000000000 ], _isBigNumber: true }) // '777.123'
* ```
*
* See `toObject` for converting a BigNumber to a plain object.
*
* @param n A numeric value.
* @param base The base of `n`, integer, 2 to 36 (or `ALPHABET.length`, see `ALPHABET`).
*/
constructor(n: BigNumber.Value);
constructor(n: string, base: number);
/**
* Returns a BigNumber whose value is the absolute value, i.e. the magnitude, of the value of this
* BigNumber.
*
* The return value is always exact and unrounded.
*
* ```ts
* x = new BigNumber(-0.8)
* x.absoluteValue() // '0.8'
* ```
*/
absoluteValue(): BigNumber;
/**
* Returns a BigNumber whose value is the absolute value, i.e. the magnitude, of the value of this
* BigNumber.
*
* The return value is always exact and unrounded.
*
* ```ts
* x = new BigNumber(-0.8)
* x.abs() // '0.8'
* ```
*/
abs(): BigNumber;
/**
* Returns | |
* :-------:|:--------------------------------------------------------------|
* 1 | If the value of this BigNumber is greater than the value of `n`
* -1 | If the value of this BigNumber is less than the value of `n`
* 0 | If this BigNumber and `n` have the same value
* `null` | If the value of either this BigNumber or `n` is `NaN`
*
* ```ts
*
* x = new BigNumber(Infinity)
* y = new BigNumber(5)
* x.comparedTo(y) // 1
* x.comparedTo(x.minus(1)) // 0
* y.comparedTo(NaN) // null
* y.comparedTo('110', 2) // -1
* ```
* @param n A numeric value.
* @param [base] The base of n.
*/
comparedTo(n: BigNumber.Value): 1 | -1 | 0 | null;
comparedTo(n: string, base: number): 1 | -1 | 0 | null;
/**
* Returns a BigNumber whose value is the value of this BigNumber rounded by rounding mode
* `roundingMode` to a maximum of `decimalPlaces` decimal places.
*
* If `decimalPlaces` is omitted, the return value is the number of decimal places of the value of
* this BigNumber, or `null` if the value of this BigNumber is ±`Infinity` or `NaN`.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` is used.
*
* Throws if `decimalPlaces` or `roundingMode` is invalid.
*
* ```ts
* x = new BigNumber(1234.56)
* x.decimalPlaces() // 2
* x.decimalPlaces(1) // '1234.6'
* x.decimalPlaces(2) // '1234.56'
* x.decimalPlaces(10) // '1234.56'
* x.decimalPlaces(0, 1) // '1234'
* x.decimalPlaces(0, 6) // '1235'
* x.decimalPlaces(1, 1) // '1234.5'
* x.decimalPlaces(1, BigNumber.ROUND_HALF_EVEN) // '1234.6'
* x // '1234.56'
* y = new BigNumber('9.9e-101')
* y.decimalPlaces() // 102
* ```
*
* @param [decimalPlaces] Decimal places, integer, 0 to 1e+9.
* @param [roundingMode] Rounding mode, integer, 0 to 8.
*/
decimalPlaces(): number | null;
decimalPlaces(decimalPlaces: number, roundingMode?: BigNumber.RoundingMode): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber rounded by rounding mode
* `roundingMode` to a maximum of `decimalPlaces` decimal places.
*
* If `decimalPlaces` is omitted, the return value is the number of decimal places of the value of
* this BigNumber, or `null` if the value of this BigNumber is ±`Infinity` or `NaN`.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` is used.
*
* Throws if `decimalPlaces` or `roundingMode` is invalid.
*
* ```ts
* x = new BigNumber(1234.56)
* x.dp() // 2
* x.dp(1) // '1234.6'
* x.dp(2) // '1234.56'
* x.dp(10) // '1234.56'
* x.dp(0, 1) // '1234'
* x.dp(0, 6) // '1235'
* x.dp(1, 1) // '1234.5'
* x.dp(1, BigNumber.ROUND_HALF_EVEN) // '1234.6'
* x // '1234.56'
* y = new BigNumber('9.9e-101')
* y.dp() // 102
* ```
*
* @param [decimalPlaces] Decimal places, integer, 0 to 1e+9.
* @param [roundingMode] Rounding mode, integer, 0 to 8.
*/
dp(): number | null;
dp(decimalPlaces: number, roundingMode?: BigNumber.RoundingMode): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber divided by `n`, rounded
* according to the current `DECIMAL_PLACES` and `ROUNDING_MODE` settings.
*
* ```ts
* x = new BigNumber(355)
* y = new BigNumber(113)
* x.dividedBy(y) // '3.14159292035398230088'
* x.dividedBy(5) // '71'
* x.dividedBy('47', 16) // '5'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
dividedBy(n: BigNumber.Value): BigNumber;
dividedBy(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber divided by `n`, rounded
* according to the current `DECIMAL_PLACES` and `ROUNDING_MODE` settings.
*
* ```ts
* x = new BigNumber(355)
* y = new BigNumber(113)
* x.div(y) // '3.14159292035398230088'
* x.div(5) // '71'
* x.div('47', 16) // '5'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
div(n: BigNumber.Value): BigNumber;
div(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the integer part of dividing the value of this BigNumber by
* `n`.
*
* ```ts
* x = new BigNumber(5)
* y = new BigNumber(3)
* x.dividedToIntegerBy(y) // '1'
* x.dividedToIntegerBy(0.7) // '7'
* x.dividedToIntegerBy('0.f', 16) // '5'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
dividedToIntegerBy(n: BigNumber.Value): BigNumber;
dividedToIntegerBy(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the integer part of dividing the value of this BigNumber by
* `n`.
*
* ```ts
* x = new BigNumber(5)
* y = new BigNumber(3)
* x.idiv(y) // '1'
* x.idiv(0.7) // '7'
* x.idiv('0.f', 16) // '5'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
idiv(n: BigNumber.Value): BigNumber;
idiv(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber exponentiated by `n`, i.e.
* raised to the power `n`, and optionally modulo a modulus `m`.
*
* If `n` is negative the result is rounded according to the current `DECIMAL_PLACES` and
* `ROUNDING_MODE` settings.
*
* As the number of digits of the result of the power operation can grow so large so quickly,
* e.g. 123.456**10000 has over 50000 digits, the number of significant digits calculated is
* limited to the value of the `POW_PRECISION` setting (unless a modulus `m` is specified).
*
* By default `POW_PRECISION` is set to 0. This means that an unlimited number of significant
* digits will be calculated, and that the method's performance will decrease dramatically for
* larger exponents.
*
* If `m` is specified and the value of `m`, `n` and this BigNumber are integers and `n` is
* positive, then a fast modular exponentiation algorithm is used, otherwise the operation will
* be performed as `x.exponentiatedBy(n).modulo(m)` with a `POW_PRECISION` of 0.
*
* Throws if `n` is not an integer.
*
* ```ts
* Math.pow(0.7, 2) // 0.48999999999999994
* x = new BigNumber(0.7)
* x.exponentiatedBy(2) // '0.49'
* BigNumber(3).exponentiatedBy(-2) // '0.11111111111111111111'
* ```
*
* @param n The exponent, an integer.
* @param [m] The modulus.
*/
exponentiatedBy(n: BigNumber.Value, m?: BigNumber.Value): BigNumber;
exponentiatedBy(n: number, m?: BigNumber.Value): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber exponentiated by `n`, i.e.
* raised to the power `n`, and optionally modulo a modulus `m`.
*
* If `n` is negative the result is rounded according to the current `DECIMAL_PLACES` and
* `ROUNDING_MODE` settings.
*
* As the number of digits of the result of the power operation can grow so large so quickly,
* e.g. 123.456**10000 has over 50000 digits, the number of significant digits calculated is
* limited to the value of the `POW_PRECISION` setting (unless a modulus `m` is specified).
*
* By default `POW_PRECISION` is set to 0. This means that an unlimited number of significant
* digits will be calculated, and that the method's performance will decrease dramatically for
* larger exponents.
*
* If `m` is specified and the value of `m`, `n` and this BigNumber are integers and `n` is
* positive, then a fast modular exponentiation algorithm is used, otherwise the operation will
* be performed as `x.pow(n).modulo(m)` with a `POW_PRECISION` of 0.
*
* Throws if `n` is not an integer.
*
* ```ts
* Math.pow(0.7, 2) // 0.48999999999999994
* x = new BigNumber(0.7)
* x.pow(2) // '0.49'
* BigNumber(3).pow(-2) // '0.11111111111111111111'
* ```
*
* @param n The exponent, an integer.
* @param [m] The modulus.
*/
pow(n: BigNumber.Value, m?: BigNumber.Value): BigNumber;
pow(n: number, m?: BigNumber.Value): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber rounded to an integer using
* rounding mode `rm`.
*
* If `rm` is omitted, `ROUNDING_MODE` is used.
*
* Throws if `rm` is invalid.
*
* ```ts
* x = new BigNumber(123.456)
* x.integerValue() // '123'
* x.integerValue(BigNumber.ROUND_CEIL) // '124'
* y = new BigNumber(-12.7)
* y.integerValue() // '-13'
* x.integerValue(BigNumber.ROUND_DOWN) // '-12'
* ```
*
* @param {BigNumber.RoundingMode} [rm] The roundng mode, an integer, 0 to 8.
*/
integerValue(rm?: BigNumber.RoundingMode): BigNumber;
/**
* Returns `true` if the value of this BigNumber is equal to the value of `n`, otherwise returns
* `false`.
*
* As with JavaScript, `NaN` does not equal `NaN`.
*
* ```ts
* 0 === 1e-324 // true
* x = new BigNumber(0)
* x.isEqualTo('1e-324') // false
* BigNumber(-0).isEqualTo(x) // true ( -0 === 0 )
* BigNumber(255).isEqualTo('ff', 16) // true
*
* y = new BigNumber(NaN)
* y.isEqualTo(NaN) // false
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
isEqualTo(n: BigNumber.Value): boolean;
isEqualTo(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is equal to the value of `n`, otherwise returns
* `false`.
*
* As with JavaScript, `NaN` does not equal `NaN`.
*
* ```ts
* 0 === 1e-324 // true
* x = new BigNumber(0)
* x.eq('1e-324') // false
* BigNumber(-0).eq(x) // true ( -0 === 0 )
* BigNumber(255).eq('ff', 16) // true
*
* y = new BigNumber(NaN)
* y.eq(NaN) // false
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
eq(n: BigNumber.Value): boolean;
eq(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is a finite number, otherwise returns `false`.
*
* The only possible non-finite values of a BigNumber are `NaN`, `Infinity` and `-Infinity`.
*
* ```ts
* x = new BigNumber(1)
* x.isFinite() // true
* y = new BigNumber(Infinity)
* y.isFinite() // false
* ```
*/
isFinite(): boolean;
/**
* Returns `true` if the value of this BigNumber is greater than the value of `n`, otherwise
* returns `false`.
*
* ```ts
* 0.1 > (0.3 - 0.2) // true
* x = new BigNumber(0.1)
* x.isGreaterThan(BigNumber(0.3).minus(0.2)) // false
* BigNumber(0).isGreaterThan(x) // false
* BigNumber('11', 3).isGreaterThan('11.1', 2) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
isGreaterThan(n: BigNumber.Value): boolean;
isGreaterThan(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is greater than the value of `n`, otherwise
* returns `false`.
*
* ```ts
* 0.1 > (0.3 - 0.2) // true
* x = new BigNumber(0.1)
* x.gt(BigNumber(0.3).minus(0.2)) // false
* BigNumber(0).gt(x) // false
* BigNumber('11', 3).gt('11.1', 2) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
gt(n: BigNumber.Value): boolean;
gt(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is greater than or equal to the value of `n`,
* otherwise returns `false`.
*
* ```ts
* (0.3 - 0.2) >= 0.1 // false
* x = new BigNumber(0.3).minus(0.2)
* x.isGreaterThanOrEqualTo(0.1) // true
* BigNumber(1).isGreaterThanOrEqualTo(x) // true
* BigNumber('10', 18).isGreaterThanOrEqualTo('i', 36) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
isGreaterThanOrEqualTo(n: BigNumber.Value): boolean;
isGreaterThanOrEqualTo(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is greater than or equal to the value of `n`,
* otherwise returns `false`.
*
* ```ts
* (0.3 - 0.2) >= 0.1 // false
* x = new BigNumber(0.3).minus(0.2)
* x.gte(0.1) // true
* BigNumber(1).gte(x) // true
* BigNumber('10', 18).gte('i', 36) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
gte(n: BigNumber.Value): boolean;
gte(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is an integer, otherwise returns `false`.
*
* ```ts
* x = new BigNumber(1)
* x.isInteger() // true
* y = new BigNumber(123.456)
* y.isInteger() // false
* ```
*/
isInteger(): boolean;
/**
* Returns `true` if the value of this BigNumber is less than the value of `n`, otherwise returns
* `false`.
*
* ```ts
* (0.3 - 0.2) < 0.1 // true
* x = new BigNumber(0.3).minus(0.2)
* x.isLessThan(0.1) // false
* BigNumber(0).isLessThan(x) // true
* BigNumber('11.1', 2).isLessThan('11', 3) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
isLessThan(n: BigNumber.Value): boolean;
isLessThan(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is less than the value of `n`, otherwise returns
* `false`.
*
* ```ts
* (0.3 - 0.2) < 0.1 // true
* x = new BigNumber(0.3).minus(0.2)
* x.lt(0.1) // false
* BigNumber(0).lt(x) // true
* BigNumber('11.1', 2).lt('11', 3) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
lt(n: BigNumber.Value): boolean;
lt(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is less than or equal to the value of `n`,
* otherwise returns `false`.
*
* ```ts
* 0.1 <= (0.3 - 0.2) // false
* x = new BigNumber(0.1)
* x.isLessThanOrEqualTo(BigNumber(0.3).minus(0.2)) // true
* BigNumber(-1).isLessThanOrEqualTo(x) // true
* BigNumber('10', 18).isLessThanOrEqualTo('i', 36) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
isLessThanOrEqualTo(n: BigNumber.Value): boolean;
isLessThanOrEqualTo(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is less than or equal to the value of `n`,
* otherwise returns `false`.
*
* ```ts
* 0.1 <= (0.3 - 0.2) // false
* x = new BigNumber(0.1)
* x.lte(BigNumber(0.3).minus(0.2)) // true
* BigNumber(-1).lte(x) // true
* BigNumber('10', 18).lte('i', 36) // true
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
lte(n: BigNumber.Value): boolean;
lte(n: string, base: number): boolean;
/**
* Returns `true` if the value of this BigNumber is `NaN`, otherwise returns `false`.
*
* ```ts
* x = new BigNumber(NaN)
* x.isNaN() // true
* y = new BigNumber('Infinity')
* y.isNaN() // false
* ```
*/
isNaN(): boolean;
/**
* Returns `true` if the value of this BigNumber is negative, otherwise returns `false`.
*
* ```ts
* x = new BigNumber(-0)
* x.isNegative() // true
* y = new BigNumber(2)
* y.isNegative() // false
* ```
*/
isNegative(): boolean;
/**
* Returns `true` if the value of this BigNumber is positive, otherwise returns `false`.
*
* ```ts
* x = new BigNumber(-0)
* x.isPositive() // false
* y = new BigNumber(2)
* y.isPositive() // true
* ```
*/
isPositive(): boolean;
/**
* Returns `true` if the value of this BigNumber is zero or minus zero, otherwise returns `false`.
*
* ```ts
* x = new BigNumber(-0)
* x.isZero() // true
* ```
*/
isZero(): boolean;
/**
* Returns a BigNumber whose value is the value of this BigNumber minus `n`.
*
* The return value is always exact and unrounded.
*
* ```ts
* 0.3 - 0.1 // 0.19999999999999998
* x = new BigNumber(0.3)
* x.minus(0.1) // '0.2'
* x.minus('0.6', 20) // '0'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
minus(n: BigNumber.Value): BigNumber;
minus(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber modulo `n`, i.e. the integer
* remainder of dividing this BigNumber by `n`.
*
* The value returned, and in particular its sign, is dependent on the value of the `MODULO_MODE`
* setting of this BigNumber constructor. If it is 1 (default value), the result will have the
* same sign as this BigNumber, and it will match that of Javascript's `%` operator (within the
* limits of double precision) and BigDecimal's `remainder` method.
*
* The return value is always exact and unrounded.
*
* See `MODULO_MODE` for a description of the other modulo modes.
*
* ```ts
* 1 % 0.9 // 0.09999999999999998
* x = new BigNumber(1)
* x.modulo(0.9) // '0.1'
* y = new BigNumber(33)
* y.modulo('a', 33) // '3'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
modulo(n: BigNumber.Value): BigNumber;
modulo(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber modulo `n`, i.e. the integer
* remainder of dividing this BigNumber by `n`.
*
* The value returned, and in particular its sign, is dependent on the value of the `MODULO_MODE`
* setting of this BigNumber constructor. If it is 1 (default value), the result will have the
* same sign as this BigNumber, and it will match that of Javascript's `%` operator (within the
* limits of double precision) and BigDecimal's `remainder` method.
*
* The return value is always exact and unrounded.
*
* See `MODULO_MODE` for a description of the other modulo modes.
*
* ```ts
* 1 % 0.9 // 0.09999999999999998
* x = new BigNumber(1)
* x.mod(0.9) // '0.1'
* y = new BigNumber(33)
* y.mod('a', 33) // '3'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
mod(n: BigNumber.Value): BigNumber;
mod(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber multiplied by `n`.
*
* The return value is always exact and unrounded.
*
* ```ts
* 0.6 * 3 // 1.7999999999999998
* x = new BigNumber(0.6)
* y = x.multipliedBy(3) // '1.8'
* BigNumber('7e+500').multipliedBy(y) // '1.26e+501'
* x.multipliedBy('-a', 16) // '-6'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
multipliedBy(n: BigNumber.Value): BigNumber;
multipliedBy(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber multiplied by `n`.
*
* The return value is always exact and unrounded.
*
* ```ts
* 0.6 * 3 // 1.7999999999999998
* x = new BigNumber(0.6)
* y = x.times(3) // '1.8'
* BigNumber('7e+500').times(y) // '1.26e+501'
* x.times('-a', 16) // '-6'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
times(n: BigNumber.Value): BigNumber;
times(n: string, base: number): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber negated, i.e. multiplied by -1.
*
* ```ts
* x = new BigNumber(1.8)
* x.negated() // '-1.8'
* y = new BigNumber(-1.3)
* y.negated() // '1.3'
* ```
*/
negated(): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber plus `n`.
*
* The return value is always exact and unrounded.
*
* ```ts
* 0.1 + 0.2 // 0.30000000000000004
* x = new BigNumber(0.1)
* y = x.plus(0.2) // '0.3'
* BigNumber(0.7).plus(x).plus(y) // '1.1'
* x.plus('0.1', 8) // '0.225'
* ```
*
* @param n A numeric value.
* @param [base] The base of n.
*/
plus(n: BigNumber.Value): BigNumber;
plus(n: string, base: number): BigNumber;
/**
* Returns the number of significant digits of the value of this BigNumber, or `null` if the value
* of this BigNumber is ±`Infinity` or `NaN`.
*
* If `includeZeros` is true then any trailing zeros of the integer part of the value of this
* BigNumber are counted as significant digits, otherwise they are not.
*
* Throws if `includeZeros` is invalid.
*
* ```ts
* x = new BigNumber(9876.54321)
* x.precision() // 9
* y = new BigNumber(987000)
* y.precision(false) // 3
* y.precision(true) // 6
* ```
*
* @param [includeZeros] Whether to include integer trailing zeros in the significant digit count.
*/
precision(includeZeros?: boolean): number;
/**
* Returns a BigNumber whose value is the value of this BigNumber rounded to a precision of
* `significantDigits` significant digits using rounding mode `roundingMode`.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` will be used.
*
* Throws if `significantDigits` or `roundingMode` is invalid.
*
* ```ts
* x = new BigNumber(9876.54321)
* x.precision(6) // '9876.54'
* x.precision(6, BigNumber.ROUND_UP) // '9876.55'
* x.precision(2) // '9900'
* x.precision(2, 1) // '9800'
* x // '9876.54321'
* ```
*
* @param significantDigits Significant digits, integer, 1 to 1e+9.
* @param [roundingMode] Rounding mode, integer, 0 to 8.
*/
precision(significantDigits: number, roundingMode?: BigNumber.RoundingMode): BigNumber;
/**
* Returns the number of significant digits of the value of this BigNumber,
* or `null` if the value of this BigNumber is ±`Infinity` or `NaN`.
*
* If `includeZeros` is true then any trailing zeros of the integer part of
* the value of this BigNumber are counted as significant digits, otherwise
* they are not.
*
* Throws if `includeZeros` is invalid.
*
* ```ts
* x = new BigNumber(9876.54321)
* x.sd() // 9
* y = new BigNumber(987000)
* y.sd(false) // 3
* y.sd(true) // 6
* ```
*
* @param [includeZeros] Whether to include integer trailing zeros in the significant digit count.
*/
sd(includeZeros?: boolean): number;
/**
* Returns a BigNumber whose value is the value of this BigNumber rounded to a precision of
* `significantDigits` significant digits using rounding mode `roundingMode`.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` will be used.
*
* Throws if `significantDigits` or `roundingMode` is invalid.
*
* ```ts
* x = new BigNumber(9876.54321)
* x.sd(6) // '9876.54'
* x.sd(6, BigNumber.ROUND_UP) // '9876.55'
* x.sd(2) // '9900'
* x.sd(2, 1) // '9800'
* x // '9876.54321'
* ```
*
* @param significantDigits Significant digits, integer, 1 to 1e+9.
* @param [roundingMode] Rounding mode, integer, 0 to 8.
*/
sd(significantDigits: number, roundingMode?: BigNumber.RoundingMode): BigNumber;
/**
* Returns a BigNumber whose value is the value of this BigNumber shifted by `n` places.
*
* The shift is of the decimal point, i.e. of powers of ten, and is to the left if `n` is negative
* or to the right if `n` is positive.
*
* The return value is always exact and unrounded.
*
* Throws if `n` is invalid.
*
* ```ts
* x = new BigNumber(1.23)
* x.shiftedBy(3) // '1230'
* x.shiftedBy(-3) // '0.00123'
* ```
*
* @param n The shift value, integer, -9007199254740991 to 9007199254740991.
*/
shiftedBy(n: number): BigNumber;
/**
* Returns a BigNumber whose value is the square root of the value of this BigNumber, rounded
* according to the current `DECIMAL_PLACES` and `ROUNDING_MODE` settings.
*
* The return value will be correctly rounded, i.e. rounded as if the result was first calculated
* to an infinite number of correct digits before rounding.
*
* ```ts
* x = new BigNumber(16)
* x.squareRoot() // '4'
* y = new BigNumber(3)
* y.squareRoot() // '1.73205080756887729353'
* ```
*/
squareRoot(): BigNumber;
/**
* Returns a BigNumber whose value is the square root of the value of this BigNumber, rounded
* according to the current `DECIMAL_PLACES` and `ROUNDING_MODE` settings.
*
* The return value will be correctly rounded, i.e. rounded as if the result was first calculated
* to an infinite number of correct digits before rounding.
*
* ```ts
* x = new BigNumber(16)
* x.sqrt() // '4'
* y = new BigNumber(3)
* y.sqrt() // '1.73205080756887729353'
* ```
*/
sqrt(): BigNumber;
/**
* Returns a string representing the value of this BigNumber in exponential notation rounded using
* rounding mode `roundingMode` to `decimalPlaces` decimal places, i.e with one digit before the
* decimal point and `decimalPlaces` digits after it.
*
* If the value of this BigNumber in exponential notation has fewer than `decimalPlaces` fraction
* digits, the return value will be appended with zeros accordingly.
*
* If `decimalPlaces` is omitted, the number of digits after the decimal point defaults to the
* minimum number of digits necessary to represent the value exactly.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` is used.
*
* Throws if `decimalPlaces` or `roundingMode` is invalid.
*
* ```ts
* x = 45.6
* y = new BigNumber(x)
* x.toExponential() // '4.56e+1'
* y.toExponential() // '4.56e+1'
* x.toExponential(0) // '5e+1'
* y.toExponential(0) // '5e+1'
* x.toExponential(1) // '4.6e+1'
* y.toExponential(1) // '4.6e+1'
* y.toExponential(1, 1) // '4.5e+1' (ROUND_DOWN)
* x.toExponential(3) // '4.560e+1'
* y.toExponential(3) // '4.560e+1'
* ```
*
* @param [decimalPlaces] Decimal places, integer, 0 to 1e+9.
* @param [roundingMode] Rounding mode, integer, 0 to 8.
*/
toExponential(decimalPlaces: number, roundingMode?: BigNumber.RoundingMode): string;
toExponential(): string;
/**
* Returns a string representing the value of this BigNumber in normal (fixed-point) notation
* rounded to `decimalPlaces` decimal places using rounding mode `roundingMode`.
*
* If the value of this BigNumber in normal notation has fewer than `decimalPlaces` fraction
* digits, the return value will be appended with zeros accordingly.
*
* Unlike `Number.prototype.toFixed`, which returns exponential notation if a number is greater or
* equal to 10**21, this method will always return normal notation.
*
* If `decimalPlaces` is omitted, the return value will be unrounded and in normal notation.
* This is also unlike `Number.prototype.toFixed`, which returns the value to zero decimal places.
* It is useful when normal notation is required and the current `EXPONENTIAL_AT` setting causes
* `toString` to return exponential notation.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` is used.
*
* Throws if `decimalPlaces` or `roundingMode` is invalid.
*
* ```ts
* x = 3.456
* y = new BigNumber(x)
* x.toFixed() // '3'
* y.toFixed() // '3.456'
* y.toFixed(0) // '3'
* x.toFixed(2) // '3.46'
* y.toFixed(2) // '3.46'
* y.toFixed(2, 1) // '3.45' (ROUND_DOWN)
* x.toFixed(5) // '3.45600'
* y.toFixed(5) // '3.45600'
* ```
*
* @param [decimalPlaces] Decimal places, integer, 0 to 1e+9.
* @param [roundingMode] Rounding mode, integer, 0 to 8.
*/
toFixed(decimalPlaces: number, roundingMode?: BigNumber.RoundingMode): string;
toFixed(): string;
/**
* Returns a string representing the value of this BigNumber in normal (fixed-point) notation
* rounded to `decimalPlaces` decimal places using rounding mode `roundingMode`, and formatted
* according to the properties of the `format` or `FORMAT` object.
*
* The formatting object may contain some or all of the properties shown in the examples below.
*
* If `decimalPlaces` is omitted, then the return value is not rounded to a fixed number of
* decimal places.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` is used.
*
* If `format` is omitted, `FORMAT` is used.
*
* Throws if `decimalPlaces`, `roundingMode`, or `format` is invalid.
*
* ```ts
* fmt = {
* decimalSeparator: '.',
* groupSeparator: ',',
* groupSize: 3,
* secondaryGroupSize: 0,
* fractionGroupSeparator: ' ',
* fractionGroupSize: 0
* }
*
* x = new BigNumber('123456789.123456789')
*
* // Set the global formatting options
* BigNumber.config({ FORMAT: fmt })
*
* x.toFormat() // '123,456,789.123456789'
* x.toFormat(3) // '123,456,789.123'
*
* // If a reference to the object assigned to FORMAT has been retained,
* // the format properties can be changed directly
* fmt.groupSeparator = ' '
* fmt.fractionGroupSize = 5
* x.toFormat() // '123 456 789.12345 6789'
*
* // Alternatively, pass the formatting options as an argument
* fmt = {
* decimalSeparator: ',',
* groupSeparator: '.',
* groupSize: 3,
* secondaryGroupSize: 2
* }
*
* x.toFormat() // '123 456 789.12345 6789'
* x.toFormat(fmt) // '12.34.56.789,123456789'
* x.toFormat(2, fmt) // '12.34.56.789,12'
* x.toFormat(3, BigNumber.ROUND_UP, fmt) // '12.34.56.789,124'
* ```
*
* @param [decimalPlaces] Decimal places, integer, 0 to 1e+9.
* @param [roundingMode] Rounding mode, integer, 0 to 8.
* @param [format] Formatting options object. See `BigNumber.Format`.
*/
toFormat(decimalPlaces: number, roundingMode: BigNumber.RoundingMode, format?: BigNumber.Format): string;
toFormat(decimalPlaces: number, roundingMode?: BigNumber.RoundingMode): string;
toFormat(decimalPlaces?: number): string;
toFormat(decimalPlaces: number, format: BigNumber.Format): string;
toFormat(format: BigNumber.Format): string;
/**
* Returns an array of two BigNumbers representing the value of this BigNumber as a simple
* fraction with an integer numerator and an integer denominator.
* The denominator will be a positive non-zero value less than or equal to `max_denominator`.
* If a maximum denominator, `max_denominator`, is not specified, the denominator will be the
* lowest value necessary to represent the number exactly.
*
* Throws if `max_denominator` is invalid.
*
* ```ts
* x = new BigNumber(1.75)
* x.toFraction() // '7, 4'
*
* pi = new BigNumber('3.14159265358')
* pi.toFraction() // '157079632679,50000000000'
* pi.toFraction(100000) // '312689, 99532'
* pi.toFraction(10000) // '355, 113'
* pi.toFraction(100) // '311, 99'
* pi.toFraction(10) // '22, 7'
* pi.toFraction(1) // '3, 1'
* ```
*
* @param [max_denominator] The maximum denominator, integer > 0, or Infinity.
*/
toFraction(max_denominator?: BigNumber.Value): BigNumber | [BigNumber, BigNumber];
/** As `valueOf`. */
toJSON(): string;
/**
* Returns the value of this BigNumber as a JavaScript primitive number.
*
* Using the unary plus operator gives the same result.
*
* ```ts
* x = new BigNumber(456.789)
* x.toNumber() // 456.789
* +x // 456.789
*
* y = new BigNumber('45987349857634085409857349856430985')
* y.toNumber() // 4.598734985763409e+34
*
* z = new BigNumber(-0)
* 1 / z.toNumber() // -Infinity
* 1 / +z // -Infinity
* ```
*/
toNumber(): number;
/**
* Returns a plain object with `c`, `e` and `s` properties representing the coefficient,
* exponent and sign of this BigNumber.
*
* The returned object can be passed to the `BigNumber` constructor (with a `_isBigNumber`
* property) to recreate the BigNumber without the overhead of parsing the string value.
*
* ```ts
* x = new BigNumber('777.123')
* obj = x.toObject() // { c: [ 777, 12300000000000 ], e: 2, s: 1 }
*
* obj._isBigNumber = true
* y = new BigNumber(obj)
* x.isEqualTo(y) // true
* ```
*/
toObject(): { c: number[] | null; e: number | null; s: number | null };
/**
* Returns a string representing the value of this BigNumber rounded to `significantDigits`
* significant digits using rounding mode `roundingMode`.
*
* If `significantDigits` is less than the number of digits necessary to represent the integer
* part of the value in normal (fixed-point) notation, then exponential notation is used.
*
* If `significantDigits` is omitted, then the return value is the same as `n.toString()`.
*
* If `roundingMode` is omitted, `ROUNDING_MODE` is used.
*
* Throws if `significantDigits` or `roundingMode` is invalid.
*
* ```ts
* x = 45.6
* y = new BigNumber(x)
* x.toPrecision() // '45.6'
* y.toPrecision() // '45.6'
* x.toPrecision(1) // '5e+1'
* y.toPrecision(1) // '5e+1'
* y.toPrecision(2, 0) // '4.6e+1' (ROUND_UP)
* y.toPrecision(2, 1) // '4.5e+1' (ROUND_DOWN)
* x.toPrecision(5) // '45.600'
* y.toPrecision(5) // '45.600'
* ```
*
* @param [significantDigits] Significant digits, integer, 1 to 1e+9.
* @param [roundingMode] Rounding mode, integer 0 to 8.
*/
toPrecision(significantDigits: number, roundingMode?: BigNumber.RoundingMode): string;
toPrecision(): string;
/**
* Returns a string representing the value of this BigNumber in base `base`, or base 10 if `base`
* is omitted.
*
* If a base is specified the value is rounded according to the current `DECIMAL_PLACES`
* and `ROUNDING_MODE` settings.
*
* If a base is not specified, and this BigNumber has a positive exponent that is equal to or
* greater than the positive component of the current `EXPONENTIAL_AT` setting, or a negative
* exponent equal to or less than the negative component of the setting, then exponential notation
* is returned.
*
* Throws if `base` is invalid.
*
* ```ts
* x = new BigNumber(750000)
* x.toString() // '750000'
* BigNumber.config({ EXPONENTIAL_AT: 5 })
* x.toString() // '7.5e+5'
*
* y = new BigNumber(362.875)
* y.toString(2) // '101101010.111'
* y.toString(9) // '442.77777777777777777778'
* y.toString(32) // 'ba.s'
*
* BigNumber.config({ DECIMAL_PLACES: 4 });
* z = new BigNumber('1.23456789')
* z.toString() // '1.23456789'
* z.toString(10) // '1.2346'
* ```
*
* @param [base] The base, integer, 2 to 36 (or `ALPHABET.length`, see `ALPHABET`).
*/
toString(base?: number): string;
/**
* As `toString`, but does not accept a base argument and includes the minus sign for negative
* zero.
*
* ``ts
* x = new BigNumber('-0')
* x.toString() // '0'
* x.valueOf() // '-0'
* y = new BigNumber('1.777e+457')
* y.valueOf() // '1.777e+457'
* ```
*/
valueOf(): string;
/** Helps ES6 import. */
private static readonly default: BigNumber.Constructor;
/** Helps ES6 import. */
private static readonly BigNumber: BigNumber.Constructor;
/** Rounds away from zero. */
static readonly ROUND_UP: 0;
/** Rounds towards zero. */
static readonly ROUND_DOWN: 1;
/** Rounds towards Infinity. */
static readonly ROUND_CEIL: 2;
/** Rounds towards -Infinity. */
static readonly ROUND_FLOOR: 3;
/** Rounds towards nearest neighbour. If equidistant, rounds away from zero . */
static readonly ROUND_HALF_UP: 4;
/** Rounds towards nearest neighbour. If equidistant, rounds towards zero. */
static readonly ROUND_HALF_DOWN: 5;
/** Rounds towards nearest neighbour. If equidistant, rounds towards even neighbour. */
static readonly ROUND_HALF_EVEN: 6;
/** Rounds towards nearest neighbour. If equidistant, rounds towards Infinity. */
static readonly ROUND_HALF_CEIL: 7;
/** Rounds towards nearest neighbour. If equidistant, rounds towards -Infinity. */
static readonly ROUND_HALF_FLOOR: 8;
/** See `MODULO_MODE`. */
static readonly EUCLID: 9;
/**
* Returns a new independent BigNumber constructor with configuration as described by `object`, or
* with the default configuration if object is omitted.
*
* Throws if `object` is not an object.
*
* ```ts
* BigNumber.config({ DECIMAL_PLACES: 5 })
* BN = BigNumber.clone({ DECIMAL_PLACES: 9 })
*
* x = new BigNumber(1)
* y = new BN(1)
*
* x.div(3) // 0.33333
* y.div(3) // 0.333333333
*
* // BN = BigNumber.clone({ DECIMAL_PLACES: 9 }) is equivalent to:
* BN = BigNumber.clone()
* BN.config({ DECIMAL_PLACES: 9 })
* ```
*
* @param [object] The configuration object.
*/
static clone(object?: BigNumber.Config): BigNumber.Constructor;
/**
* Configures the settings that apply to this BigNumber constructor.
*
* The configuration object, `object`, contains any number of the properties shown in the example
* below.
*
* Returns an object with the above properties and their current values.
*
* Throws if `object` is not an object, or if an invalid value is assigned to one or more of the
* properties.
*
* ```ts
* BigNumber.config({
* DECIMAL_PLACES: 40,
* ROUNDING_MODE: BigNumber.ROUND_HALF_CEIL,
* EXPONENTIAL_AT: [-10, 20],
* RANGE: [-500, 500],
* CRYPTO: true,
* MODULO_MODE: BigNumber.ROUND_FLOOR,
* POW_PRECISION: 80,
* FORMAT: {
* groupSize: 3,
* groupSeparator: ' ',
* decimalSeparator: ','
* },
* ALPHABET: '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'
* });
*
* BigNumber.config().DECIMAL_PLACES // 40
* ```
*
* @param object The configuration object.
*/
static config(object?: BigNumber.Config): BigNumber.Config;
/**
* Returns `true` if `value` is a BigNumber instance or an object
* with valid coefficient (`c`, exponent (`e`) and sign (`s`)
* properties that the BigNumber constructor will accept, otherwise
* returns `false`. See `toObject`.
*
* ```ts
* x = 42
* y = new BigNumber(x)
*
* BigNumber.isBigNumber(x) // false
* y instanceof BigNumber // true
* BigNumber.isBigNumber(y) // true
*
* BN = BigNumber.clone();
* z = new BN(x)
* z instanceof BigNumber // false
* BigNumber.isBigNumber(z) // true
* ```
*
* @param value The value to test.
*/
static isBigNumber(value: any): value is BigNumber;
/**
* Returns a BigNumber whose value is the maximum of the arguments.
*
* The return value is always exact and unrounded.
*
* ```ts
* x = new BigNumber('3257869345.0378653')
* BigNumber.maximum(4e9, x, '123456789.9') // '4000000000'
*
* arr = [12, '13', new BigNumber(14)]
* BigNumber.maximum.apply(null, arr) // '14'
* ```
*
* @param n A numeric value.
*/
static maximum(...n: BigNumber.Value[]): BigNumber;
/**
* Returns a BigNumber whose value is the maximum of the arguments.
*
* The return value is always exact and unrounded.
*
* ```ts
* x = new BigNumber('3257869345.0378653')
* BigNumber.max(4e9, x, '123456789.9') // '4000000000'
*
* arr = [12, '13', new BigNumber(14)]
* BigNumber.max.apply(null, arr) // '14'
* ```
*
* @param n A numeric value.
*/
static max(...n: BigNumber.Value[]): BigNumber;
/**
* Returns a BigNumber whose value is the minimum of the arguments.
*
* The return value is always exact and unrounded.
*
* ```ts
* x = new BigNumber('3257869345.0378653')
* BigNumber.minimum(4e9, x, '123456789.9') // '123456789.9'
*
* arr = [2, new BigNumber(-14), '-15.9999', -12]
* BigNumber.minimum.apply(null, arr) // '-15.9999'
* ```
*
* @param n A numeric value.
*/
static minimum(...n: BigNumber.Value[]): BigNumber;
/**
* Returns a BigNumber whose value is the minimum of the arguments.
*
* The return value is always exact and unrounded.
*
* ```ts
* x = new BigNumber('3257869345.0378653')
* BigNumber.min(4e9, x, '123456789.9') // '123456789.9'
*
* arr = [2, new BigNumber(-14), '-15.9999', -12]
* BigNumber.min.apply(null, arr) // '-15.9999'
* ```
*
* @param n A numeric value.
*/
static min(...n: BigNumber.Value[]): BigNumber;
/**
* Returns a new BigNumber with a pseudo-random value equal to or greater than 0 and less than 1.
*
* The return value will have `decimalPlaces` decimal places, or less if trailing zeros are
* produced. If `decimalPlaces` is omitted, the current `DECIMAL_PLACES` setting will be used.
*
* Depending on the value of this BigNumber constructor's `CRYPTO` setting and the support for the
* `crypto` object in the host environment, the random digits of the return value are generated by
* either `Math.random` (fastest), `crypto.getRandomValues` (Web Cryptography API in recent
* browsers) or `crypto.randomBytes` (Node.js).
*
* To be able to set `CRYPTO` to true when using Node.js, the `crypto` object must be available
* globally:
*
* ```ts
* global.crypto = require('crypto')
* ```
*
* If `CRYPTO` is true, i.e. one of the `crypto` methods is to be used, the value of a returned
* BigNumber should be cryptographically secure and statistically indistinguishable from a random
* value.
*
* Throws if `decimalPlaces` is invalid.
*
* ```ts
* BigNumber.config({ DECIMAL_PLACES: 10 })
* BigNumber.random() // '0.4117936847'
* BigNumber.random(20) // '0.78193327636914089009'
* ```
*
* @param [decimalPlaces] Decimal places, integer, 0 to 1e+9.
*/
static random(decimalPlaces?: number): BigNumber;
/**
* Returns a BigNumber whose value is the sum of the arguments.
*
* The return value is always exact and unrounded.
*
* ```ts
* x = new BigNumber('3257869345.0378653')
* BigNumber.sum(4e9, x, '123456789.9') // '7381326134.9378653'
*
* arr = [2, new BigNumber(14), '15.9999', 12]
* BigNumber.sum.apply(null, arr) // '43.9999'
* ```
*
* @param n A numeric value.
*/
static sum(...n: BigNumber.Value[]): BigNumber;
/**
* Configures the settings that apply to this BigNumber constructor.
*
* The configuration object, `object`, contains any number of the properties shown in the example
* below.
*
* Returns an object with the above properties and their current values.
*
* Throws if `object` is not an object, or if an invalid value is assigned to one or more of the
* properties.
*
* ```ts
* BigNumber.set({
* DECIMAL_PLACES: 40,
* ROUNDING_MODE: BigNumber.ROUND_HALF_CEIL,
* EXPONENTIAL_AT: [-10, 20],
* RANGE: [-500, 500],
* CRYPTO: true,
* MODULO_MODE: BigNumber.ROUND_FLOOR,
* POW_PRECISION: 80,
* FORMAT: {
* groupSize: 3,
* groupSeparator: ' ',
* decimalSeparator: ','
* },
* ALPHABET: '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'
* });
*
* BigNumber.set().DECIMAL_PLACES // 40
* ```
*
* @param object The configuration object.
*/
static set(object?: BigNumber.Config): BigNumber.Config;
}
declare function BigNumber(n: BigNumber.Value): BigNumber;
declare function BigNumber(n: string, base: number): BigNumber;
================================================
FILE: bignumber.js
================================================
/*
* bignumber.js v10.0.2
* A JavaScript library for arbitrary-precision arithmetic.
* https://github.com/MikeMcl/bignumber.js
* Copyright (c) 2026 Michael Mclaughlin <M8ch88l@gmail.com>
* MIT Licensed.
*
* BigNumber.prototype methods | BigNumber methods
* |
* absoluteValue abs | clone
* comparedTo | config set
* decimalPlaces dp | DECIMAL_PLACES
* dividedBy div | ROUNDING_MODE
* dividedToIntegerBy idiv | EXPONENTIAL_AT
* exponentiatedBy pow | RANGE
* integerValue | CRYPTO
* isEqualTo eq | MODULO_MODE
* isFinite | POW_PRECISION
* isGreaterThan gt | FORMAT
* isGreaterThanOrEqualTo gte | ALPHABET
* isInteger | isBigNumber
* isLessThan lt | maximum max
* isLessThanOrEqualTo lte | minimum min
* isNaN | random
* isNegative | sum
* isPositive |
* isZero |
* minus |
* modulo mod |
* multipliedBy times |
* negated |
* plus |
* precision sd |
* shiftedBy |
* squareRoot sqrt |
* toExponential |
* toFixed |
* toFormat |
* toFraction |
* toJSON |
* toNumber |
* toObject |
* toPrecision |
* toString |
* valueOf |
*
*/
var
BigNumber = clone(),
isNumeric = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,
mathceil = Math.ceil,
mathfloor = Math.floor,
bignumberError = '[BigNumber Error] ',
BASE = 1e14,
LOG_BASE = 14,
MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1
// MAX_INT32 = 0x7fffffff, // 2^31 - 1
POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],
SQRT_BASE = 1e7,
// EDITABLE
// The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and
// the arguments to toExponential, toFixed, toFormat, and toPrecision.
MAX = 1E9; // 0 to MAX_INT32
/*
* Create and return a BigNumber constructor.
*/
function clone(configObject) {
var div, convertBase, parseUnusualNumeric,
P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },
ONE = new BigNumber(1),
//----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------
// The default values below must be integers within the inclusive ranges stated.
// The values can also be changed at run-time using BigNumber.set.
// The maximum number of decimal places for operations involving division.
DECIMAL_PLACES = 20, // 0 to MAX
// The rounding mode used when rounding to the above decimal places, and when using
// toExponential, toFixed, toFormat and toPrecision, and round (default value).
// UP 0 Away from zero.
// DOWN 1 Towards zero.
// CEIL 2 Towards +Infinity.
// FLOOR 3 Towards -Infinity.
// HALF_UP 4 Towards nearest neighbour. If equidistant, up.
// HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.
// HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.
// HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.
// HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
ROUNDING_MODE = 4, // 0 to 8
// EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]
// The exponent value at and beneath which toString returns exponential notation.
// Number type: -7
TO_EXP_NEG = -7, // 0 to -MAX
// The exponent value at and above which toString returns exponential notation.
// Number type: 21
TO_EXP_POS = 21, // 0 to MAX
// RANGE : [MIN_EXP, MAX_EXP]
// The minimum exponent value, beneath which underflow to zero occurs.
// Number type: -324 (5e-324)
MIN_EXP = -1e7, // -1 to -MAX
// The maximum exponent value, above which overflow to Infinity occurs.
// Number type: 308 (1.7976931348623157e+308)
// For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.
MAX_EXP = 1e7, // 1 to MAX
// Whether to use cryptographically-secure random number generation, if available.
CRYPTO = false, // true or false
// The modulo mode used when calculating the modulus: a mod n.
// The quotient (q = a / n) is calculated according to the corresponding rounding mode.
// The remainder (r) is calculated as: r = a - n * q.
//
// UP 0 The remainder is positive if the dividend is negative, else is negative.
// DOWN 1 The remainder has the same sign as the dividend.
// This modulo mode is commonly known as 'truncated division' and is
// equivalent to (a % n) in JavaScript.
// FLOOR 3 The remainder has the same sign as the divisor (Python %).
// HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.
// EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).
// The remainder is always positive.
//
// The truncated division, floored division, Euclidian division and IEEE 754 remainder
// modes are commonly used for the modulus operation.
// Although the other rounding modes can also be used, they may not give useful results.
MODULO_MODE = 1, // 0 to 9
// The maximum number of significant digits of the result of the exponentiatedBy operation.
// If POW_PRECISION is 0, there will be unlimited significant digits.
POW_PRECISION = 0, // 0 to MAX
// The format specification used by the BigNumber.prototype.toFormat method.
FORMAT = {
prefix: '',
groupSize: 3,
secondaryGroupSize: 0,
groupSeparator: ',',
decimalSeparator: '.',
fractionGroupSize: 0,
fractionGroupSeparator: '\xA0', // non-breaking space
suffix: ''
},
// The alphabet used for base conversion.
// It must be at least two characters long and have no '+', '-', '.', whitespace, or repeated
// character.
// '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'
ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';
//------------------------------------------------------------------------------------------
// CONSTRUCTOR
/*
* The BigNumber constructor and exported function.
* Create and return a new instance of a BigNumber object.
*
* v {number|string|BigNumber} A numeric value.
* [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.
*/
function BigNumber(v, b) {
var alphabet, c, caseChanged, e, i, len, str, t,
x = this;
// Enable constructor call without `new`.
if (!(x instanceof BigNumber)) return new BigNumber(v, b);
t = typeof v;
if (b == null) {
if (isBigNumber(v)) {
x.s = v.s;
if (!v.c || v.e > MAX_EXP) {
x.c = x.e = null;
} else if (v.e < MIN_EXP) {
x.c = [x.e = 0];
} else {
x.e = v.e;
x.c = v.c.slice();
}
return;
}
if (t == 'number') {
// Handle ±Infinity and NaN.
if (v * 0 != 0) {
x.s = isNaN(v) ? null : v < 0 ? -1 : 1;
x.c = x.e = null;
return;
}
// Use `1 / v` to handle minus zero also.
x.s = 1 / v < 0 ? (v = -v, -1) : 1;
// Fast path for integers, where v < 2147483648 (2**31).
if (v === ~~v) {
for (e = 0, i = v; i >= 10; i /= 10, e++);
if (e > MAX_EXP) {
x.c = x.e = null;
} else {
x.e = e;
x.c = [v];
}
return;
}
str = String(v);
} else {
if (t == 'string') {
str = v;
if (!isNumeric.test(str)) {
return parseUnusualNumeric(x, str);
}
} else if (t == 'bigint') {
str = String(v);
} else {
throw Error
(bignumberError + 'Invalid argument: ' + v);
}
x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
}
// Decimal point?
if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
// Exponential form?
if ((i = str.search(/e/i)) > 0) {
// Determine exponent.
if (e < 0) e = i;
e += +str.slice(i + 1);
str = str.substring(0, i);
} else if (e < 0) {
// Integer.
e = str.length;
}
// Base specified.
} else {
// '[BigNumber Error] String expected: {v}'
if (t != 'string') {
throw Error
(bignumberError + 'String expected: ' + v);
}
// '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'
intCheck(b, 2, ALPHABET.length, 'Base');
str = v;
x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
alphabet = ALPHABET.slice(0, b);
e = i = 0;
// Check that str is a valid base b number.
// Don't use RegExp, so alphabet can contain special characters.
for (len = str.length; i < len; i++) {
if (alphabet.indexOf(c = str.charAt(i)) < 0) {
if (c == '.') {
// If '.' is not the first character and it has not be found before.
if (i > e) {
e = len;
continue;
}
} else if (!caseChanged) {
// Allow e.g. hexadecimal 'FF' as well as 'ff'.
if (str == str.toUpperCase() && (str = str.toLowerCase()) ||
str == str.toLowerCase() && (str = str.toUpperCase())) {
caseChanged = true;
i = -1;
e = 0;
continue;
}
}
return parseUnusualNumeric(x, v, b);
}
}
str = convertBase(str, b, 10, x.s);
// Decimal point?
if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
else e = str.length;
}
// Determine leading zeros.
for (i = 0; str.charCodeAt(i) === 48; i++);
// Determine trailing zeros.
for (len = str.length; str.charCodeAt(--len) === 48;);
if (str = str.slice(i, ++len)) {
len -= i;
e = e - i - 1;
// Overflow?
if (e > MAX_EXP) {
// Infinity.
x.c = x.e = null;
// Underflow?
} else if (e < MIN_EXP) {
// Zero.
x.c = [x.e = 0];
} else {
x.e = e;
x.c = [];
// Transform base
// e is the base 10 exponent.
// i is where to slice str to get the first element of the coefficient array.
i = (e + 1) % LOG_BASE;
if (e < 0) i += LOG_BASE; // i < 1
if (i < len) {
if (i) x.c.push(+str.slice(0, i));
for (len -= LOG_BASE; i < len;) {
x.c.push(+str.slice(i, i += LOG_BASE));
}
i = LOG_BASE - (str = str.slice(i)).length;
} else {
i -= len;
}
for (; i--; str += '0');
x.c.push(+str);
}
} else {
// Zero.
x.c = [x.e = 0];
}
}
// CONSTRUCTOR PROPERTIES
BigNumber.clone = clone;
BigNumber.ROUND_UP = 0;
BigNumber.ROUND_DOWN = 1;
BigNumber.ROUND_CEIL = 2;
BigNumber.ROUND_FLOOR = 3;
BigNumber.ROUND_HALF_UP = 4;
BigNumber.ROUND_HALF_DOWN = 5;
BigNumber.ROUND_HALF_EVEN = 6;
BigNumber.ROUND_HALF_CEIL = 7;
BigNumber.ROUND_HALF_FLOOR = 8;
BigNumber.EUCLID = 9;
/*
* Configure infrequently-changing library-wide settings.
*
* Accept an object with the following optional properties (if the value of a property is
* a number, it must be an integer within the inclusive range stated):
*
* DECIMAL_PLACES {number} 0 to MAX
* ROUNDING_MODE {number} 0 to 8
* EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]
* RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]
* CRYPTO {boolean} true or false
* MODULO_MODE {number} 0 to 9
* POW_PRECISION {number} 0 to MAX
* ALPHABET {string} A string of unique characters which does not contain
* '+', '-', '.', or whitespace, and starts with '0123456789'.
* FORMAT {object} An object with some of the following properties:
* prefix {string}
* groupSize {number}
* secondaryGroupSize {number}
* groupSeparator {string}
* decimalSeparator {string}
* fractionGroupSize {number}
* fractionGroupSeparator {string}
* suffix {string}
*
* (The values assigned to the above FORMAT object properties are not checked for validity.)
*
* E.g.
* BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })
*
* Ignore properties/parameters set to null or undefined, except for ALPHABET.
*
* Return an object with the properties current values.
*/
BigNumber.config = BigNumber.set = function (obj) {
var p, v;
if (obj != null) {
if (typeof obj == 'object') {
// DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.
// '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {
v = obj[p];
intCheck(v, 0, MAX, p);
DECIMAL_PLACES = v;
}
// ROUNDING_MODE {number} Integer, 0 to 8 inclusive.
// '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {
v = obj[p];
intCheck(v, 0, 8, p);
ROUNDING_MODE = v;
}
// EXPONENTIAL_AT {number|number[]}
// Integer, -MAX to MAX inclusive or
// [integer -MAX to 0 inclusive, 0 to MAX inclusive].
// '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {
v = obj[p];
if (v && v.pop) {
intCheck(v[0], -MAX, 0, p);
intCheck(v[1], 0, MAX, p);
TO_EXP_NEG = v[0];
TO_EXP_POS = v[1];
} else {
intCheck(v, -MAX, MAX, p);
TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);
}
}
// RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or
// [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].
// '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'
if (obj.hasOwnProperty(p = 'RANGE')) {
v = obj[p];
if (v && v.pop) {
intCheck(v[0], -MAX, -1, p);
intCheck(v[1], 1, MAX, p);
MIN_EXP = v[0];
MAX_EXP = v[1];
} else {
intCheck(v, -MAX, MAX, p);
if (v) {
MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);
} else {
throw Error
(bignumberError + p + ' cannot be zero: ' + v);
}
}
}
// CRYPTO {boolean} true or false.
// '[BigNumber Error] CRYPTO not true or false: {v}'
// '[BigNumber Error] crypto unavailable'
if (obj.hasOwnProperty(p = 'CRYPTO')) {
v = obj[p];
if (v === !!v) {
if (v) {
if (typeof crypto != 'undefined' && crypto &&
(crypto.getRandomValues || crypto.randomBytes)) {
CRYPTO = v;
} else {
CRYPTO = !v;
throw Error
(bignumberError + 'crypto unavailable');
}
} else {
CRYPTO = v;
}
} else {
throw Error
(bignumberError + p + ' not true or false: ' + v);
}
}
// MODULO_MODE {number} Integer, 0 to 9 inclusive.
// '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'MODULO_MODE')) {
v = obj[p];
intCheck(v, 0, 9, p);
MODULO_MODE = v;
}
// POW_PRECISION {number} Integer, 0 to MAX inclusive.
// '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'POW_PRECISION')) {
v = obj[p];
intCheck(v, 0, MAX, p);
POW_PRECISION = v;
}
// FORMAT {object}
// '[BigNumber Error] FORMAT not an object: {v}'
if (obj.hasOwnProperty(p = 'FORMAT')) {
v = obj[p];
if (typeof v == 'object') FORMAT = v;
else throw Error
(bignumberError + p + ' not an object: ' + v);
}
// ALPHABET {string}
// '[BigNumber Error] ALPHABET invalid: {v}'
if (obj.hasOwnProperty(p = 'ALPHABET')) {
v = obj[p];
// Disallow if the alphabet is not at least two characters long,
// or contains '+', '-', '.', whitespace, or a repeated character.
if (typeof v == 'string' && !/^.?$|[+\-.\s]|(.).*\1/.test(v)) {
ALPHABET = v;
} else {
throw Error
(bignumberError + p + ' invalid: ' + v);
}
}
} else {
// '[BigNumber Error] Object expected: {v}'
throw Error
(bignumberError + 'Object expected: ' + obj);
}
}
return {
DECIMAL_PLACES: DECIMAL_PLACES,
ROUNDING_MODE: ROUNDING_MODE,
EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],
RANGE: [MIN_EXP, MAX_EXP],
CRYPTO: CRYPTO,
MODULO_MODE: MODULO_MODE,
POW_PRECISION: POW_PRECISION,
FORMAT: FORMAT,
ALPHABET: ALPHABET
};
};
/*
* Return true if v appears to be a BigNumber instance that has a valid coefficient (c),
* exponent (e), and sign (s), otherwise return false.
*
* v {any}
*/
BigNumber.isBigNumber = function (v) {
if (!isBigNumber(v)) return false;
var i, n,
c = v.c,
e = v.e,
s = v.s;
if ({}.toString.call(c) != '[object Array]') {
// ±Infinity and NaN
return c === null && e === null && (s === null || s === 1 || s === -1)
}
// Check sign and check that exponent is an integer within the allowed range.
if ((s !== 1 && s !== -1) || e < -MAX || e > MAX || e !== mathfloor(e)) {
return false;
}
// If the first element is zero, the BigNumber value must be zero.
if (c[0] === 0) {
return e === 0 && c.length === 1;
}
// Calculate number of digits that c[0] should have, based on the exponent.
i = (e + 1) % LOG_BASE;
if (i < 1) i += LOG_BASE;
// Calculate number of digits of c[0].
//if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) !== i) {
if (String(c[0]).length !== i) {
return false;
}
for (i = 0; i < c.length; i++) {
n = c[i];
if (n < 0 || n >= BASE || n !== mathfloor(n)) return false;
}
// Last element cannot be zero, unless it is the only element.
return n !== 0;
};
/*
* Return a new BigNumber whose value is the maximum of the arguments.
*
* arguments {number|string|BigNumber}
*/
BigNumber.maximum = BigNumber.max = function () {
return maxOrMin(arguments, -1);
};
/*
* Return a new BigNumber whose value is the minimum of the arguments.
*
* arguments {number|string|BigNumber}
*/
BigNumber.minimum = BigNumber.min = function () {
return maxOrMin(arguments, 1);
};
/*
* Return a new BigNumber with a random value equal to or greater than 0 and less than 1,
* and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing
* zeros are produced).
*
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'
* '[BigNumber Error] crypto unavailable'
*/
BigNumber.random = (function () {
var pow2_53 = 0x20000000000000;
// Return a 53 bit integer n, where 0 <= n < 9007199254740992.
// Check if Math.random() produces more than 32 bits of randomness.
// If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.
// 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.
var random53bitInt = (Math.random() * pow2_53) & 0x1fffff
? function () { return mathfloor(Math.random() * pow2_53); }
: function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +
(Math.random() * 0x800000 | 0); };
return function (dp) {
var a, b, e, k, v,
i = 0,
c = [],
rand = new BigNumber(ONE);
if (dp == null) dp = DECIMAL_PLACES;
else intCheck(dp, 0, MAX);
k = mathceil(dp / LOG_BASE);
if (CRYPTO) {
// Browsers supporting crypto.getRandomValues.
if (crypto.getRandomValues) {
a = crypto.getRandomValues(new Uint32Array(k *= 2));
for (; i < k;) {
// 53 bits:
// ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)
// 11111 11111111 11111111 11111111 11100000 00000000 00000000
// ((Math.pow(2, 32) - 1) >>> 11).toString(2)
// 11111 11111111 11111111
// 0x20000 is 2^21.
v = a[i] * 0x20000 + (a[i + 1] >>> 11);
// Rejection sampling:
// 0 <= v < 9007199254740992
// Probability that v >= 9e15, is
// 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251
if (v >= 9e15) {
b = crypto.getRandomValues(new Uint32Array(2));
a[i] = b[0];
a[i + 1] = b[1];
} else {
// 0 <= v <= 8999999999999999
// 0 <= (v % 1e14) <= 99999999999999
c.push(v % 1e14);
i += 2;
}
}
i = k / 2;
// Node.js supporting crypto.randomBytes.
} else if (crypto.randomBytes) {
// buffer
a = crypto.randomBytes(k *= 7);
for (; i < k;) {
// 0x1000000000000 is 2^48, 0x10000000000 is 2^40
// 0x100000000 is 2^32, 0x1000000 is 2^24
// 11111 11111111 11111111 11111111 11111111 11111111 11111111
// 0 <= v < 9007199254740992
v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +
(a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +
(a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];
if (v >= 9e15) {
crypto.randomBytes(7).copy(a, i);
} else {
// 0 <= (v % 1e14) <= 99999999999999
c.push(v % 1e14);
i += 7;
}
}
i = k / 7;
} else {
CRYPTO = false;
throw Error
(bignumberError + 'crypto unavailable');
}
}
// Use Math.random.
if (!CRYPTO) {
for (; i < k;) {
v = random53bitInt();
if (v < 9e15) c[i++] = v % 1e14;
}
}
k = c[--i];
dp %= LOG_BASE;
// Convert trailing digits to zeros according to dp.
if (k && dp) {
v = POWS_TEN[LOG_BASE - dp];
c[i] = mathfloor(k / v) * v;
}
// Remove trailing elements which are zero.
for (; c[i] === 0; c.pop(), i--);
// Zero?
if (i < 0) {
c = [e = 0];
} else {
// Remove leading elements which are zero and adjust exponent accordingly.
for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);
// Count the digits of the first element of c to determine leading zeros, and...
for (i = 1, v = c[0]; v >= 10; v /= 10, i++);
// adjust the exponent accordingly.
if (i < LOG_BASE) e -= LOG_BASE - i;
}
rand.e = e;
rand.c = c;
return rand;
};
})();
/*
* Return a BigNumber whose value is the sum of the arguments.
*
* arguments {number|string|BigNumber}
*/
BigNumber.sum = function () {
var i = 1,
args = arguments,
sum = new BigNumber(args[0]);
for (; i < args.length;) sum = sum.plus(args[i++]);
return sum;
};
// PRIVATE FUNCTIONS
// Called by BigNumber and BigNumber.prototype.toString.
convertBase = (function () {
var decimal = '0123456789';
/*
* Convert string of baseIn to an array of numbers of baseOut.
* Eg. toBaseOut('255', 10, 16) returns [15, 15].
* Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].
*/
function toBaseOut(str, baseIn, baseOut, alphabet) {
var j,
arr = [0],
arrL,
i = 0,
len = str.length;
for (; i < len;) {
for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);
arr[0] += alphabet.indexOf(str.charAt(i++));
for (j = 0; j < arr.length; j++) {
if (arr[j] > baseOut - 1) {
if (arr[j + 1] == null) arr[j + 1] = 0;
arr[j + 1] += arr[j] / baseOut | 0;
arr[j] %= baseOut;
}
}
}
return arr.reverse();
}
// Convert a numeric string of baseIn to a numeric string of baseOut.
// If the caller is toString, we are converting from base 10 to baseOut.
// If the caller is BigNumber, we are converting from baseIn to base 10.
return function (str, baseIn, baseOut, sign, callerIsToString) {
var alphabet, d, e, k, r, x, xc, y,
i = str.indexOf('.'),
dp = DECIMAL_PLACES,
rm = ROUNDING_MODE;
// Non-integer.
if (i >= 0) {
k = POW_PRECISION;
// Unlimited precision.
POW_PRECISION = 0;
str = str.replace('.', '');
y = new BigNumber(baseIn);
x = y.pow(str.length - i);
POW_PRECISION = k;
// Convert str as if an integer, then restore the fraction part by dividing the
// result by its base raised to a power.
y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),
10, baseOut, decimal);
y.e = y.c.length;
}
// Convert the number as integer.
xc = toBaseOut(str, baseIn, baseOut, callerIsToString
? (alphabet = ALPHABET, decimal)
: (alphabet = decimal, ALPHABET));
// xc now represents str as an integer and converted to baseOut. e is the exponent.
e = k = xc.length;
// Remove trailing zeros.
for (; xc[--k] == 0; xc.pop());
// Zero?
if (!xc[0]) return alphabet.charAt(0);
// Does str represent an integer? If so, no need for the division.
if (i < 0) {
--e;
} else {
x.c = xc;
x.e = e;
// The sign is needed for correct rounding.
x.s = sign;
x = div(x, y, dp, rm, baseOut);
xc = x.c;
r = x.r;
e = x.e;
}
// xc now represents str converted to baseOut.
// The index of the rounding digit.
d = e + dp + 1;
// The rounding digit: the digit to the right of the digit that may be rounded up.
i = xc[d];
// Look at the rounding digits and mode to determine whether to round up.
k = baseOut / 2;
r = r || d < 0 || xc[d + 1] != null;
r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))
: i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||
rm == (x.s < 0 ? 8 : 7));
// If the index of the rounding digit is not greater than zero, or xc represents
// zero, then the result of the base conversion is zero or, if rounding up, a value
// such as 0.00001.
if (d < 1 || !xc[0]) {
// 1^-dp or 0
str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);
} else {
// Truncate xc to the required number of decimal places.
xc.length = d;
// Round up?
if (r) {
// Rounding up may mean the previous digit has to be rounded up and so on.
for (--baseOut; ++xc[--d] > baseOut;) {
xc[d] = 0;
if (!d) {
++e;
xc = [1].concat(xc);
}
}
}
// Determine trailing zeros.
for (k = xc.length; !xc[--k];);
// E.g. [4, 11, 15] becomes 4bf.
for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));
// Add leading zeros, decimal point and trailing zeros as required.
str = toFixedPoint(str, e, alphabet.charAt(0));
}
// The caller will add the sign.
return str;
};
})();
// Perform division in the specified base. Called by div and convertBase.
div = (function () {
// Assume non-zero x and k.
function multiply(x, k, base) {
var m, temp, xlo, xhi,
carry = 0,
i = x.length,
klo = k % SQRT_BASE,
khi = k / SQRT_BASE | 0;
for (x = x.slice(); i--;) {
xlo = x[i] % SQRT_BASE;
xhi = x[i] / SQRT_BASE | 0;
m = khi * xlo + xhi * klo;
temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;
carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;
x[i] = temp % base;
}
if (carry) x = [carry].concat(x);
return x;
}
function compare(a, b, aL, bL) {
var i, cmp;
if (aL != bL) {
cmp = aL > bL ? 1 : -1;
} else {
for (i = cmp = 0; i < aL; i++) {
if (a[i] != b[i]) {
cmp = a[i] > b[i] ? 1 : -1;
break;
}
}
}
return cmp;
}
function subtract(a, b, aL, base) {
var i = 0;
// Subtract b from a.
for (; aL--;) {
a[aL] -= i;
i = a[aL] < b[aL] ? 1 : 0;
a[aL] = i * base + a[aL] - b[aL];
}
// Remove leading zeros.
for (; !a[0] && a.length > 1; a.splice(0, 1));
}
// x: dividend, y: divisor.
return function (x, y, dp, rm, base) {
var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,
yL, yz,
s = x.s == y.s ? 1 : -1,
xc = x.c,
yc = y.c;
// Either NaN, Infinity or 0?
if (!xc || !xc[0] || !yc || !yc[0]) {
return new BigNumber(
// Return NaN if either NaN, or both Infinity or 0.
!x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :
// Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
xc && xc[0] == 0 || !yc ? s * 0 : s / 0
);
}
q = new BigNumber(s);
qc = q.c = [];
e = x.e - y.e;
s = dp + e + 1;
if (!base) {
base = BASE;
e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);
s = s / LOG_BASE | 0;
}
// Result exponent may be one less then the current value of e.
// The coefficients of the BigNumbers from convertBase may have trailing zeros.
for (i = 0; yc[i] == (xc[i] || 0); i++);
if (yc[i] > (xc[i] || 0)) e--;
if (s < 0) {
qc.push(1);
more = true;
} else {
xL = xc.length;
yL = yc.length;
i = 0;
s += 2;
// Normalise xc and yc so highest order digit of yc is >= base / 2.
n = mathfloor(base / (yc[0] + 1));
// Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.
// if (n > 1 || n++ == 1 && yc[0] < base / 2) {
if (n > 1) {
yc = multiply(yc, n, base);
xc = multiply(xc, n, base);
yL = yc.length;
xL = xc.length;
}
xi = yL;
rem = xc.slice(0, yL);
remL = rem.length;
// Add zeros to make remainder as long as divisor.
for (; remL < yL; rem[remL++] = 0);
yz = yc.slice();
yz = [0].concat(yz);
yc0 = yc[0];
if (yc[1] >= base / 2) yc0++;
// Not necessary, but to prevent trial digit n > base, when using base 3.
// else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;
do {
n = 0;
// Compare divisor and remainder.
cmp = compare(yc, rem, yL, remL);
// If divisor < remainder.
if (cmp < 0) {
// Calculate trial digit, n.
rem0 = rem[0];
if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
// n is how many times the divisor goes into the current remainder.
n = mathfloor(rem0 / yc0);
// Algorithm:
// product = divisor multiplied by trial digit (n).
// Compare product and remainder.
// If product is greater than remainder:
// Subtract divisor from product, decrement trial digit.
// Subtract product from remainder.
// If product was less than remainder at the last compare:
// Compare new remainder and divisor.
// If remainder is greater than divisor:
// Subtract divisor from remainder, increment trial digit.
if (n > 1) {
// n may be > base only when base is 3.
if (n >= base) n = base - 1;
// product = divisor * trial digit.
prod = multiply(yc, n, base);
prodL = prod.length;
remL = rem.length;
// Compare product and remainder.
// If product > remainder then trial digit n too high.
// n is 1 too high about 5% of the time, and is not known to have
// ever been more than 1 too high.
while (compare(prod, rem, prodL, remL) == 1) {
n--;
// Subtract divisor from product.
subtract(prod, yL < prodL ? yz : yc, prodL, base);
prodL = prod.length;
cmp = 1;
}
} else {
// n is 0 or 1, cmp is -1.
// If n is 0, there is no need to compare yc and rem again below,
// so change cmp to 1 to avoid it.
// If n is 1, leave cmp as -1, so yc and rem are compared again.
if (n == 0) {
// divisor < remainder, so n must be at least 1.
cmp = n = 1;
}
// product = divisor
prod = yc.slice();
prodL = prod.length;
}
if (prodL < remL) prod = [0].concat(prod);
// Subtract product from remainder.
subtract(rem, prod, remL, base);
remL = rem.length;
// If product was < remainder.
if (cmp == -1) {
// Compare divisor and new remainder.
// If divisor < new remainder, subtract divisor from remainder.
// Trial digit n too low.
// n is 1 too low about 5% of the time, and very rarely 2 too low.
while (compare(yc, rem, yL, remL) < 1) {
n++;
// Subtract divisor from remainder.
subtract(rem, yL < remL ? yz : yc, remL, base);
remL = rem.length;
}
}
} else if (cmp === 0) {
n++;
rem = [0];
} // else cmp === 1 and n will be 0
// Add the next digit, n, to the result array.
qc[i++] = n;
// Update the remainder.
if (rem[0]) {
rem[remL++] = xc[xi] || 0;
} else {
rem = [xc[xi]];
remL = 1;
}
} while ((xi++ < xL || rem[0] != null) && s--);
more = rem[0] != null;
// Leading zero?
if (!qc[0]) qc.splice(0, 1);
}
if (base == BASE) {
// To calculate q.e, first get the number of digits of qc[0].
for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);
round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);
// Caller is convertBase.
} else {
q.e = e;
q.r = +more;
}
return q;
};
})();
/*
* Return a string representing the value of BigNumber n in fixed-point or exponential
* notation rounded to the specified decimal places or significant digits.
*
* n: a BigNumber.
* i: the index of the last digit required (i.e. the digit that may be rounded up).
* rm: the rounding mode.
* id: 1 (toExponential) or 2 (toPrecision).
*/
function format(n, i, rm, id) {
var c0, e, ne, len, str;
if (rm == null) rm = ROUNDING_MODE;
else intCheck(rm, 0, 8);
if (!n.c) return n.toString();
c0 = n.c[0];
ne = n.e;
if (i == null) {
str = coeffToString(n.c);
str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)
? toExponential(str, ne)
: toFixedPoint(str, ne, '0');
} else {
n = round(new BigNumber(n), i, rm);
// n.e may have changed if the value was rounded up.
e = n.e;
str = coeffToString(n.c);
len = str.length;
// toPrecision returns exponential notation if the number of significant digits
// specified is less than the number of digits necessary to represent the integer
// part of the value in fixed-point notation.
// Exponential notation.
if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {
// Append zeros?
for (; len < i; str += '0', len++);
str = toExponential(str, e);
// Fixed-point notation.
} else {
i -= ne + (id === 2 && e > ne);
str = toFixedPoint(str, e, '0');
// Append zeros?
if (e + 1 > len) {
if (--i > 0) for (str += '.'; i--; str += '0');
} else {
i += e - len;
if (i > 0) {
if (e + 1 == len) str += '.';
for (; i--; str += '0');
}
}
}
}
return n.s < 0 && c0 ? '-' + str : str;
}
function isBigNumber(v) {
return v instanceof BigNumber || !!v && v._isBigNumber === true;
}
// Handle BigNumber.max and BigNumber.min.
// If any number is NaN, return NaN.
function maxOrMin(args, n) {
var k, y,
i = 1,
x = new BigNumber(args[0]);
for (; i < args.length; i++) {
y = new BigNumber(args[i]);
if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {
x = y;
}
}
return x;
}
/*
* Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.
* Called by minus, plus and times.
*/
function normalise(n, c, e) {
var i = 1,
j = c.length;
// Remove trailing zeros.
for (; !c[--j]; c.pop());
// Calculate the base 10 exponent. First get the number of digits of c[0].
for (j = c[0]; j >= 10; j /= 10, i++);
// Overflow?
if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {
// Infinity.
n.c = n.e = null;
// Underflow?
} else if (e < MIN_EXP) {
// Zero.
n.c = [n.e = 0];
} else {
n.e = e;
n.c = c;
}
return n;
}
// Handle values that fail the validity test in BigNumber.
parseUnusualNumeric = (function () {
var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i,
dotAfter = /^([^.]+)\.$/,
dotBefore = /^\.([^.]+)$/,
isInfinityOrNaN = /^-?(Infinity|NaN)$/,
whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
return function (x, str, b) {
var base,
s = str.replace(whitespaceOrPlus, '');
// No exception on ±Infinity or NaN.
if (isInfinityOrNaN.test(s)) {
x.s = isNaN(s) ? null : s < 0 ? -1 : 1;
x.c = x.e = null;
return;
}
// basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i
s = s.replace(basePrefix, function (m, p1, p2) {
base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;
return !b || b == base ? p1 : m;
});
if (b) {
base = b;
// E.g. '1.' to '1', '.1' to '0.1'
s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');
}
if (str != s) return new BigNumber(s, base);
// '[BigNumber Error] Not a number: {n}'
// '[BigNumber Error] Not a base {b} number: {n}'
throw Error
(bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);
}
})();
/*
* Round x to sd significant digits using rounding mode rm. Check for over/under-flow.
* If r is truthy, it is known that there are more digits after the rounding digit.
*/
function round(x, sd, rm, r) {
var d, i, j, k, n, ni, rd,
xc = x.c,
pows10 = POWS_TEN;
// if x is not Infinity or NaN...
if (xc) {
// rd is the rounding digit, i.e. the digit after the digit that may be rounded up.
// n is a base 1e14 number, the value of the element of array x.c containing rd.
// ni is the index of n within x.c.
// d is the number of digits of n.
// i is the index of rd within n including leading zeros.
// j is the actual index of rd within n (if < 0, rd is a leading zero).
out: {
// Get the number of digits of the first element of xc.
for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);
i = sd - d;
// If the rounding digit is in the first element of xc...
if (i < 0) {
i += LOG_BASE;
j = sd;
n = xc[ni = 0];
// Get the rounding digit at index j of n.
rd = mathfloor(n / pows10[d - j - 1] % 10);
} else {
ni = mathceil((i + 1) / LOG_BASE);
if (ni >= xc.length) {
if (r) {
// Needed by sqrt.
for (; xc.length <= ni; xc.push(0));
n = rd = 0;
d = 1;
i %= LOG_BASE;
j = i - LOG_BASE + 1;
} else {
break out;
}
} else {
n = k = xc[ni];
// Get the number of digits of n.
for (d = 1; k >= 10; k /= 10, d++);
// Get the index of rd within n.
i %= LOG_BASE;
// Get the index of rd within n, adjusted for leading zeros.
// The number of leading zeros of n is given by LOG_BASE - d.
j = i - LOG_BASE + d;
// Get the rounding digit at index j of n.
rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);
}
}
r = r || sd < 0 ||
// Are there any non-zero digits after the rounding digit?
// The expression n % pows10[d - j - 1] returns all digits of n to the right
// of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);
r = rm < 4
? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))
: rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&
// Check whether the digit to the left of the rounding digit is odd.
((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||
rm == (x.s < 0 ? 8 : 7));
if (sd < 1 || !xc[0]) {
xc.length = 0;
if (r) {
// Convert sd to decimal places.
sd -= x.e + 1;
// 1, 0.1, 0.01, 0.001, 0.0001 etc.
xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];
x.e = -sd || 0;
} else {
// Zero.
xc[0] = x.e = 0;
}
return x;
}
// Remove excess digits.
if (i == 0) {
xc.length = ni;
k = 1;
ni--;
} else {
xc.length = ni + 1;
k = pows10[LOG_BASE - i];
// E.g. 56700 becomes 56000 if 7 is the rounding digit.
// j > 0 means i > number of leading zeros of n.
xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;
}
// Round up?
if (r) {
for (; ;) {
// If the digit to be rounded up is in the first element of xc...
if (ni == 0) {
// i will be the length of xc[0] before k is added.
for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);
j = xc[0] += k;
for (k = 1; j >= 10; j /= 10, k++);
// if i != k the length has increased.
if (i != k) {
x.e++;
if (xc[0] == BASE) xc[0] = 1;
}
break;
} else {
xc[ni] += k;
if (xc[ni] != BASE) break;
xc[ni--] = 0;
k = 1;
}
}
}
// Remove trailing zeros.
for (i = xc.length; xc[--i] === 0; xc.pop());
}
// Overflow? Infinity.
if (x.e > MAX_EXP) {
x.c = x.e = null;
// Underflow? Zero.
} else if (x.e < MIN_EXP) {
x.c = [x.e = 0];
}
}
return x;
}
function valueOf(n) {
var str,
e = n.e;
if (e === null) return n.toString();
str = coeffToString(n.c);
str = e <= TO_EXP_NEG || e >= TO_EXP_POS
? toExponential(str, e)
: toFixedPoint(str, e, '0');
return n.s < 0 ? '-' + str : str;
}
// PROTOTYPE/INSTANCE METHODS
/*
* Return a new BigNumber whose value is the absolute value of this BigNumber.
*/
P.absoluteValue = P.abs = function () {
var x = new BigNumber(this);
if (x.s < 0) x.s = 1;
return x;
};
/*
* Return
* 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),
* -1 if the value of this BigNumber is less than the value of BigNumber(y, b),
* 0 if they have the same value,
* or null if the value of either is NaN.
*/
P.comparedTo = function (y, b) {
return compare(this, new BigNumber(y, b));
};
/*
* If dp is undefined or null or true or false, return the number of decimal places of the
* value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.
*
* Otherwise, if dp is a number, return a new BigNumber whose value is the value of this
* BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or
* ROUNDING_MODE if rm is omitted.
*
* [dp] {number} Decimal places: integer, 0 to MAX inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'
*/
P.decimalPlaces = P.dp = function (dp, rm) {
var c, n, v,
x = this;
if (dp != null) {
intCheck(dp, 0, MAX);
if (rm == null) rm = ROUNDING_MODE;
else intCheck(rm, 0, 8);
return round(new BigNumber(x), dp + x.e + 1, rm);
}
if (!(c = x.c)) return null;
n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;
// Subtract the number of trailing zeros of the last number.
if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);
if (n < 0) n = 0;
return n;
};
/*
* n / 0 = I
* n / N = N
* n / I = 0
* 0 / n = 0
* 0 / 0 = N
* 0 / N = N
* 0 / I = 0
* N / n = N
* N / 0 = N
* N / N = N
* N / I = N
* I / n = I
* I / 0 = I
* I / N = N
* I / I = N
*
* Return a new BigNumber whose value is the value of this BigNumber divided by the value of
* BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.
*/
P.dividedBy = P.div = function (y, b) {
return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);
};
/*
* Return a new BigNumber whose value is the integer part of dividing the value of this
* BigNumber by the value of BigNumber(y, b).
*/
P.dividedToIntegerBy = P.idiv = function (y, b) {
return div(this, new BigNumber(y, b), 0, 1);
};
/*
* Return a BigNumber whose value is the value of this BigNumber exponentiated by n.
*
* If m is present, return the result modulo m.
* If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.
* If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.
*
* The modular power operation works efficiently when x, n, and m are integers, otherwise it
* is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.
*
* n {number|string|BigNumber} The exponent. An integer.
* [m] {number|string|BigNumber} The modulus.
*
* '[BigNumber Error] Exponent not an integer: {n}'
*/
P.exponentiatedBy = P.pow = function (n, m) {
var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,
x = this;
n = new BigNumber(n);
// Allow NaN and ±Infinity, but not other non-integers.
if (n.c && !n.isInteger()) {
throw Error
(bignumberError + 'Exponent not an integer: ' + valueOf(n));
}
if (m != null) m = new BigNumber(m);
// Exponent of MAX_SAFE_INTEGER is 15.
nIsBig = n.e > 14;
// If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.
if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {
// The sign of the result of pow when x is negative depends on the evenness of n.
// If +n overflows to ±Infinity, the evenness of n would be not be known.
y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));
return m ? y.mod(m) : y;
}
nIsNeg = n.s < 0;
if (m) {
// x % m returns NaN if abs(m) is zero, or m is NaN.
if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);
isModExp = !nIsNeg && x.isInteger() && m.isInteger();
if (isModExp) x = x.mod(m);
// Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.
// Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.
} else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0
// [1, 240000000]
? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7
// [80000000000000] [99999750000000]
: x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {
// If x is negative and n is odd, k = -0, else k = 0.
k = x.s < 0 && isOdd(n) ? -0 : 0;
// If x >= 1, k = ±Infinity.
if (x.e > -1) k = 1 / k;
// If n is negative return ±0, else return ±Infinity.
return new BigNumber(nIsNeg ? 1 / k : k);
} else if (POW_PRECISION) {
// Truncating each coefficient array to a length of k after each multiplication
// equates to truncating significant digits to POW_PRECISION + [28, 41],
// i.e. there will be a minimum of 28 guard digits retained.
k = mathceil(POW_PRECISION / LOG_BASE + 2);
}
if (nIsBig) {
half = new BigNumber(0.5);
if (nIsNeg) n.s = 1;
nIsOdd = isOdd(n);
} else {
i = Math.abs(+valueOf(n));
nIsOdd = i % 2;
}
y = new BigNumber(ONE);
// Performs 54 loop iterations for n of 9007199254740991.
for (; ;) {
if (nIsOdd) {
y = y.times(x);
if (!y.c) break;
if (k) {
if (y.c.length > k) y.c.length = k;
} else if (isModExp) {
y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));
}
}
if (i) {
i = mathfloor(i / 2);
if (i === 0) break;
nIsOdd = i % 2;
} else {
n = n.times(half);
round(n, n.e + 1, 1);
if (n.e > 14) {
nIsOdd = isOdd(n);
} else {
i = +valueOf(n);
if (i === 0) break;
nIsOdd = i % 2;
}
}
x = x.times(x);
if (k) {
if (x.c && x.c.length > k) x.c.length = k;
} else if (isModExp) {
x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));
}
}
if (isModExp) return y;
if (nIsNeg) y = ONE.div(y);
return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;
};
/*
* Return a new BigNumber whose value is the value of this BigNumber rounded to an integer
* using rounding mode rm, or ROUNDING_MODE if rm is omitted.
*
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'
*/
P.integerValue = function (rm) {
var n = new BigNumber(this);
if (rm == null) rm = ROUNDING_MODE;
else intCheck(rm, 0, 8);
return round(n, n.e + 1, rm);
};
/*
* Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),
* otherwise return false.
*/
P.isEqualTo = P.eq = function (y, b) {
return compare(this, new BigNumber(y, b)) === 0;
};
/*
* Return true if the value of this BigNumber is a finite number, otherwise return false.
*/
P.isFinite = function () {
return !!this.c;
};
/*
* Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),
* otherwise return false.
*/
P.isGreaterThan = P.gt = function (y, b) {
return compare(this, new BigNumber(y, b)) > 0;
};
/*
* Return true if the value of this BigNumber is greater than or equal to the value of
* BigNumber(y, b), otherwise return false.
*/
P.isGreaterThanOrEqualTo = P.gte = function (y, b) {
return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;
};
/*
* Return true if the value of this BigNumber is an integer, otherwise return false.
*/
P.isInteger = function () {
return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;
};
/*
* Return true if the value of this BigNumber is less than the value of BigNumber(y, b),
* otherwise return false.
*/
P.isLessThan = P.lt = function (y, b) {
return compare(this, new BigNumber(y, b)) < 0;
};
/*
* Return true if the value of this BigNumber is less than or equal to the value of
* BigNumber(y, b), otherwise return false.
*/
P.isLessThanOrEqualTo = P.lte = function (y, b) {
return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;
};
/*
* Return true if the value of this BigNumber is NaN, otherwise return false.
*/
P.isNaN = function () {
return !this.s;
};
/*
* Return true if the value of this BigNumber is negative, otherwise return false.
*/
P.isNegative = function () {
return this.s < 0;
};
/*
* Return true if the value of this BigNumber is positive, otherwise return false.
*/
P.isPositive = function () {
return this.s > 0;
};
/*
* Return true if the value of this BigNumber is 0 or -0, otherwise return false.
*/
P.isZero = function () {
return !!this.c && this.c[0] == 0;
};
/*
* n - 0 = n
* n - N = N
* n - I = -I
* 0 - n = -n
* 0 - 0 = 0
* 0 - N = N
* 0 - I = -I
* N - n = N
* N - 0 = N
* N - N = N
* N - I = N
* I - n = I
* I - 0 = I
* I - N = N
* I - I = N
*
* Return a new BigNumber whose value is the value of this BigNumber minus the value of
* BigNumber(y, b).
*/
P.minus = function (y, b) {
var i, j, t, xLTy,
x = this,
a = x.s;
y = new BigNumber(y, b);
b = y.s;
// Either NaN?
if (!a || !b) return new BigNumber(NaN);
// Signs differ?
if (a != b) {
y.s = -b;
return x.plus(y);
}
var xe = x.e / LOG_BASE,
ye = y.e / LOG_BASE,
xc = x.c,
yc = y.c;
if (!xe || !ye) {
// Either Infinity?
if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);
// Either zero?
if (!xc[0] || !yc[0]) {
// Return y if y is non-zero, x if x is non-zero, or zero if both are zero.
return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :
// IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
ROUNDING_MODE == 3 ? -0 : 0);
}
}
xe = bitFloor(xe);
ye = bitFloor(ye);
xc = xc.slice();
// Determine which is the bigger number.
if (a = xe - ye) {
if (xLTy = a < 0) {
a = -a;
t = xc;
} else {
ye = xe;
t = yc;
}
t.reverse();
// Prepend zeros to equalise exponents.
for (b = a; b--; t.push(0));
t.reverse();
} else {
// Exponents equal. Check digit by digit.
j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;
for (a = b = 0; b < j; b++) {
if (xc[b] != yc[b]) {
xLTy = xc[b] < yc[b];
break;
}
}
}
// x < y? Point xc to the array of the bigger number.
if (xLTy) {
t = xc;
xc = yc;
yc = t;
y.s = -y.s;
}
b = (j = yc.length) - (i = xc.length);
// Append zeros to xc if shorter.
// No need to add zeros to yc if shorter as subtract only needs to start at yc.length.
if (b > 0) for (; b--; xc[i++] = 0);
b = BASE - 1;
// Subtract yc from xc.
for (; j > a;) {
if (xc[--j] < yc[j]) {
for (i = j; i && !xc[--i]; xc[i] = b);
--xc[i];
xc[j] += BASE;
}
xc[j] -= yc[j];
}
// Remove leading zeros and adjust exponent accordingly.
for (; xc[0] == 0; xc.splice(0, 1), --ye);
// Zero?
if (!xc[0]) {
// Following IEEE 754 (2008) 6.3,
// n - n = +0 but n - n = -0 when rounding towards -Infinity.
y.s = ROUNDING_MODE == 3 ? -1 : 1;
y.c = [y.e = 0];
return y;
}
// No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity
// for finite x and y.
return normalise(y, xc, ye);
};
/*
* n % 0 = N
* n % N = N
* n % I = n
* 0 % n = 0
* -0 % n = -0
* 0 % 0 = N
* 0 % N = N
* 0 % I = 0
* N % n = N
* N % 0 = N
* N % N = N
* N % I = N
* I % n = N
* I % 0 = N
* I % N = N
* I % I = N
*
* Return a new BigNumber whose value is the value of this BigNumber modulo the value of
* BigNumber(y, b). The result depends on the value of MODULO_MODE.
*/
P.modulo = P.mod = function (y, b) {
var q, s,
x = this;
y = new BigNumber(y, b);
// Return NaN if x is Infinity or NaN, or y is NaN or zero.
if (!x.c || !y.s || y.c && !y.c[0]) {
return new BigNumber(NaN);
// Return x if y is Infinity or x is zero.
} else if (!y.c || x.c && !x.c[0]) {
return new BigNumber(x);
}
if (MODULO_MODE == 9) {
// Euclidian division: q = sign(y) * floor(x / abs(y))
// r = x - qy where 0 <= r < abs(y)
s = y.s;
y.s = 1;
q = div(x, y, 0, 3);
y.s = s;
q.s *= s;
} else {
q = div(x, y, 0, MODULO_MODE);
}
y = x.minus(q.times(y));
// To match JavaScript %, ensure sign of zero is sign of dividend.
if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;
return y;
};
/*
* n * 0 = 0
* n * N = N
* n * I = I
* 0 * n = 0
* 0 * 0 = 0
* 0 * N = N
* 0 * I = N
* N * n = N
* N * 0 = N
* N * N = N
* N * I = N
* I * n = I
* I * 0 = N
* I * N = N
* I * I = I
*
* Return a new BigNumber whose value is the value of this BigNumber multiplied by the value
* of BigNumber(y, b).
*/
P.multipliedBy = P.times = function (y, b) {
var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,
base, sqrtBase,
x = this,
xc = x.c,
yc = (y = new BigNumber(y, b)).c;
// Either NaN, ±Infinity or ±0?
if (!xc || !yc || !xc[0] || !yc[0]) {
// Return NaN if either is NaN, or one is 0 and the other is Infinity.
if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {
y.c = y.e = y.s = null;
} else {
y.s *= x.s;
// Return ±Infinity if either is ±Infinity.
if (!xc || !yc) {
y.c = y.e = null;
// Return ±0 if either is ±0.
} else {
y.c = [0];
y.e = 0;
}
}
return y;
}
e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);
y.s *= x.s;
xcL = xc.length;
ycL = yc.length;
// Ensure xc points to longer array and xcL to its length.
if (xcL < ycL) {
zc = xc;
xc = yc;
yc = zc;
i = xcL;
xcL = ycL;
ycL = i;
}
// Initialise the result array with zeros.
for (i = xcL + ycL, zc = []; i--; zc.push(0));
base = BASE;
sqrtBase = SQRT_BASE;
for (i = ycL; --i >= 0;) {
c = 0;
ylo = yc[i] % sqrtBase;
yhi = yc[i] / sqrtBase | 0;
for (k = xcL, j = i + k; j > i;) {
xlo = xc[--k] % sqrtBase;
xhi = xc[k] / sqrtBase | 0;
m = yhi * xlo + xhi * ylo;
xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;
c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;
zc[j--] = xlo % base;
}
zc[j] = c;
}
if (c) {
++e;
} else {
zc.splice(0, 1);
}
return normalise(y, zc, e);
};
/*
* Return a new BigNumber whose value is the value of this BigNumber negated,
* i.e. multiplied by -1.
*/
P.negated = function () {
var x = new BigNumber(this);
x.s = -x.s || null;
return x;
};
/*
* n + 0 = n
* n + N = N
* n + I = I
* 0 + n = n
* 0 + 0 = 0
* 0 + N = N
* 0 + I = I
* N + n = N
* N + 0 = N
* N + N = N
* N + I = N
* I + n = I
* I + 0 = I
* I + N = N
* I + I = I
*
* Return a new BigNumber whose value is the value of this BigNumber plus the value of
* BigNumber(y, b).
*/
P.plus = function (y, b) {
var t,
x = this,
a = x.s;
y = new BigNumber(y, b);
b = y.s;
// Either NaN?
if (!a || !b) return new BigNumber(NaN);
// Signs differ?
if (a != b) {
y.s = -b;
return x.minus(y);
}
var xe = x.e / LOG_BASE,
ye = y.e / LOG_BASE,
xc = x.c,
yc = y.c;
if (!xe || !ye) {
// Return ±Infinity if either ±Infinity.
if (!xc || !yc) return new BigNumber(a / 0);
// Either zero?
// Return y if y is non-zero, x if x is non-zero, or zero if both are zero.
if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);
}
xe = bitFloor(xe);
ye = bitFloor(ye);
xc = xc.slice();
// Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.
if (a = xe - ye) {
if (a > 0) {
ye = xe;
t = yc;
} else {
a = -a;
t = xc;
}
t.reverse();
for (; a--; t.push(0));
t.reverse();
}
a = xc.length;
b = yc.length;
// Point xc to the longer array, and b to the shorter length.
if (a - b < 0) {
t = yc;
yc = xc;
xc = t;
b = a;
}
// Only start adding at yc.length - 1 as the further digits of xc can be ignored.
for (a = 0; b;) {
a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;
xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;
}
if (a) {
xc = [a].concat(xc);
++ye;
}
// No need to check for zero, as +x + +y != 0 && -x + -y != 0
// ye = MAX_EXP + 1 possible
return normalise(y, xc, ye);
};
/*
* If sd is undefined or null or true or false, return the number of significant digits of
* the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.
* If sd is true include integer-part trailing zeros in the count.
*
* Otherwise, if sd is a number, return a new BigNumber whose value is the value of this
* BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or
* ROUNDING_MODE if rm is omitted.
*
* sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.
* boolean: whether to count integer-part trailing zeros: true or false.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'
*/
P.precision = P.sd = function (sd, rm) {
var c, n, v,
x = this;
if (sd != null && sd !== !!sd) {
intCheck(sd, 1, MAX);
if (rm == null) rm = ROUNDING_MODE;
else intCheck(rm, 0, 8);
return round(new BigNumber(x), sd, rm);
}
if (!(c = x.c)) return null;
v = c.length - 1;
n = v * LOG_BASE + 1;
if (v = c[v]) {
// Subtract the number of trailing zeros of the last element.
for (; v % 10 == 0; v /= 10, n--);
// Add the number of digits of the first element.
for (v = c[0]; v >= 10; v /= 10, n++);
}
if (sd && x.e + 1 > n) n = x.e + 1;
return n;
};
/*
* Return a new BigNumber whose value is the value of this BigNumber shifted by k places
* (powers of 10). Shift to the right if n > 0, and to the left if n < 0.
*
* k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'
*/
P.shiftedBy = function (k) {
intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);
return this.times('1e' + k);
};
/*
* sqrt(-n) = N
* sqrt(N) = N
* sqrt(-I) = N
* sqrt(I) = I
* sqrt(0) = 0
* sqrt(-0) = -0
*
* Return a new BigNumber whose value is the square root of the value of this BigNumber,
* rounded according to DECIMAL_PLACES and ROUNDING_MODE.
*/
P.squareRoot = P.sqrt = function () {
var m, n, r, rep, t,
x = this,
c = x.c,
s = x.s,
e = x.e,
dp = DECIMAL_PLACES + 4,
half = new BigNumber('0.5');
// Negative/NaN/Infinity/zero?
if (s !== 1 || !c || !c[0]) {
return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);
}
// Initial estimate.
s = Math.sqrt(+valueOf(x));
// Math.sqrt underflow/overflow?
// Pass x to Math.sqrt as integer, then adjust the exponent of the result.
if (s == 0 || s == 1 / 0) {
n = coeffToString(c);
if ((n.length + e) % 2 == 0) n += '0';
s = Math.sqrt(+n);
e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);
if (s == 1 / 0) {
n = '5e' + e;
} else {
n = s.toExponential();
n = n.slice(0, n.indexOf('e') + 1) + e;
}
r = new BigNumber(n);
} else {
r = new BigNumber(s + '');
}
// Check for zero.
// r could be zero if MIN_EXP is changed after the this value was created.
// This would cause a division by zero (x/t) and hence Infinity below, which would cause
// coeffToString to throw.
if (r.c[0]) {
e = r.e;
s = e + dp;
if (s < 3) s = 0;
// Newton-Raphson iteration.
for (; ;) {
t = r;
r = half.times(t.plus(div(x, t, dp, 1)));
if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {
// The exponent of r may here be one less than the final result exponent,
// e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits
// are indexed correctly.
if (r.e < e) --s;
n = n.slice(s - 3, s + 1);
// The 4th rounding digit may be in error by -1 so if the 4 rounding digits
// are 9999 or 4999 (i.e. approaching a rounding boundary) continue the
// iteration.
if (n == '9999' || !rep && n == '4999') {
// On the first iteration only, check to see if rounding up gives the
// exact result as the nines may infinitely repeat.
if (!rep) {
round(t, t.e + DECIMAL_PLACES + 2, 0);
if (t.times(t).eq(x)) {
r = t;
break;
}
}
dp += 4;
s += 4;
rep = 1;
} else {
// If rounding digits are null, 0{0,4} or 50{0,3}, check for exact
// result. If not, then there are further digits and m will be truthy.
if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
// Truncate to the first rounding digit.
round(r, r.e + DECIMAL_PLACES + 2, 1);
m = !r.times(r).eq(x);
}
break;
}
}
}
}
return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);
};
/*
* Return a string representing the value of this BigNumber in exponential notation and
* rounded using ROUNDING_MODE to dp fixed decimal places.
*
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'
*/
P.toExponential = function (dp, rm) {
if (dp != null) {
intCheck(dp, 0, MAX);
dp++;
}
return format(this, dp, rm, 1);
};
/*
* Return a string representing the value of this BigNumber in fixed-point notation rounding
* to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.
*
* Note: as with JavaScript's number type, (-0).toFixed(0) is '0',
* but e.g. (-0.00001).toFixed(0) is '-0'.
*
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'
*/
P.toFixed = function (dp, rm) {
if (dp != null) {
intCheck(dp, 0, MAX);
dp = dp + this.e + 1;
}
return format(this, dp, rm);
};
/*
* Return a string representing the value of this BigNumber in fixed-point notation rounded
* using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties
* of the format or FORMAT object (see BigNumber.set).
*
* The formatting object may contain some or all of the properties shown below.
*
* FORMAT = {
* prefix: '',
* groupSize: 3,
* secondaryGroupSize: 0,
* groupSeparator: ',',
* decimalSeparator: '.',
* fractionGroupSize: 0,
* fractionGroupSeparator: '\xA0', // non-breaking space
* suffix: ''
* };
*
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
* [format] {object} Formatting options. See FORMAT pbject above.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'
* '[BigNumber Error] Argument not an object: {format}'
*/
P.toFormat = function (dp, rm, format) {
var str,
x = this;
if (format == null) {
if (dp != null && rm && typeof rm == 'object') {
format = rm;
rm = null;
} else if (dp && typeof dp == 'object') {
format = dp;
dp = rm = null;
} else {
format = FORMAT;
}
} else if (typeof format != 'object') {
throw Error
(bignumberError + 'Argument not an object: ' + format);
}
str = x.toFixed(dp, rm);
if (x.c) {
var i,
arr = str.split('.'),
g1 = +format.groupSize,
g2 = +format.secondaryGroupSize,
groupSeparator = format.groupSeparator || '',
intPart = arr[0],
fractionPart = arr[1],
isNeg = x.s < 0,
intDigits = isNeg ? intPart.slice(1) : intPart,
len = intDigits.length;
if (g2) {
i = g1;
g1 = g2;
g2 = i;
len -= i;
}
if (g1 > 0 && len > 0) {
i = len % g1 || g1;
intPart = intDigits.substr(0, i);
for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);
if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);
if (isNeg) intPart = '-' + intPart;
}
str = fractionPart
? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)
? fractionPart.replace(new RegExp('\\d{' + g2 + '}\\B', 'g'),
'$&' + (format.fractionGroupSeparator || ''))
: fractionPart)
: intPart;
}
return (format.prefix || '') + str + (format.suffix || '');
};
/*
* Return an array of two BigNumbers representing the value of this BigNumber as a simple
* fraction with an integer numerator and an integer denominator.
* The denominator will be a positive non-zero value less than or equal to the specified
* maximum denominator. If a maximum denominator is not specified, the denominator will be
* the lowest value necessary to represent the number exactly.
*
* [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.
*
* '[BigNumber Error] Argument {not an integer|out of range} : {md}'
*/
P.toFraction = function (md) {
var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,
x = this,
xc = x.c;
if (md != null) {
n = new BigNumber(md);
// Throw if md is less than one or is not an integer, unless it is Infinity.
if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {
throw Error
(bignumberError + 'Argument ' +
(n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));
}
}
if (!xc) return new BigNumber(x);
d = new BigNumber(ONE);
n1 = d0 = new BigNumber(ONE);
d1 = n0 = new BigNumber(ONE);
s = coeffToString(xc);
// Determine initial denominator.
// d is a power of 10 and the minimum max denominator that specifies the value exactly.
e = d.e = s.length - x.e - 1;
d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];
md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;
exp = MAX_EXP;
MAX_EXP = 1 / 0;
n = new BigNumber(s);
// n0 = d1 = 0
n0.c[0] = 0;
for (; ;) {
q = div(n, d, 0, 1);
d2 = d0.plus(q.times(d1));
if (d2.comparedTo(md) == 1) break;
d0 = d1;
d1 = d2;
n1 = n0.plus(q.times(d2 = n1));
n0 = d2;
d = n.minus(q.times(d2 = d));
n = d2;
}
d2 = div(md.minus(d0), d1, 0, 1);
n0 = n0.plus(d2.times(n1));
d0 = d0.plus(d2.times(d1));
n0.s = n1.s = x.s;
e = e * 2;
// Determine which fraction is closer to x, n0/d0 or n1/d1
r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(
div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];
MAX_EXP = exp;
return r;
};
/*
* Return the value of this BigNumber converted to a number primitive.
*/
P.toNumber = function () {
return +valueOf(this);
};
/*
* Return the value of this BigNumber converted to a plain object.
*/
P.toObject = function() {
var x = this;
return {
c: x.c ? x.c.slice() : null,
e: x.e,
s: x.s
};
};
/*
* Return a string representing the value of this BigNumber rounded to sd significant digits
* using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits
* necessary to represent the integer part of the value in fixed-point notation, then use
* exponential notation.
*
* [sd] {number} Significant digits. Integer, 1 to MAX inclusive.
* [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'
*/
P.toPrecision = function (sd, rm) {
if (sd != null) intCheck(sd, 1, MAX);
return format(this, sd, rm, 2);
};
/*
* Return a string representing the value of this BigNumber in base b, or base 10 if b is
* omitted. If a base is specified, round according to DECIMAL_PLACES and ROUNDING_MODE.
* If a base is not specified, and this BigNumber has a positive exponent
* that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than
* TO_EXP_NEG, return exponential notation.
*
* [b] {number} Integer, 2 to ALPHABET.length inclusive.
*
* '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'
*/
P.toString = function (b) {
var str,
n = this,
s = n.s,
e = n.e;
// Infinity or NaN?
if (e === null) {
if (s) {
str = 'Infinity';
if (s < 0) str = '-' + str;
} else {
str = 'NaN';
}
} else {
if (b == null) {
str = e <= TO_EXP_NEG || e >= TO_EXP_POS
? toExponential(coeffToString(n.c), e)
: toFixedPoint(coeffToString(n.c), e, '0');
} else {
intCheck(b, 2, ALPHABET.length, 'Base');
str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);
}
if (s < 0 && n.c[0]) str = '-' + str;
}
return str;
};
/*
* Return as toString, but do not accept a base argument, and include the minus sign for
* negative zero.
*/
P.valueOf = P.toJSON = function () {
return valueOf(this);
};
P._isBigNumber = true;
if (configObject != null) BigNumber.set(configObject);
return BigNumber;
}
// PRIVATE HELPER FUNCTIONS
// These functions don't need access to variables,
// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.
function bitFloor(n) {
var i = n | 0;
return n > 0 || n === i ? i : i - 1;
}
// Return a coefficient array as a string of base 10 digits.
function coeffToString(a) {
var s, z,
i = 1,
j = a.length,
r = a[0] + '';
for (; i < j;) {
s = a[i++] + '';
z = LOG_BASE - s.length;
for (; z--; s = '0' + s);
r += s;
}
// Determine trailing zeros.
for (j = r.length; r.charCodeAt(--j) === 48;);
return r.slice(0, j + 1 || 1);
}
// Compare the value of BigNumbers x and y.
function compare(x, y) {
var a, b,
xc = x.c,
yc = y.c,
i = x.s,
j = y.s,
k = x.e,
l = y.e;
// Either NaN?
if (!i || !j) return null;
a = xc && !xc[0];
b = yc && !yc[0];
// Either zero?
if (a || b) return a ? b ? 0 : -j : i;
// Signs differ?
if (i != j) return i;
a = i < 0;
b = k == l;
// Either Infinity?
if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;
// Compare exponents.
if (!b) return k > l ^ a ? 1 : -1;
j = (k = xc.length) < (l = yc.length) ? k : l;
// Compare digit by digit.
for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;
// Compare lengths.
return k == l ? 0 : k > l ^ a ? 1 : -1;
}
/*
* Check that n is a primitive number, an integer, and in range, otherwise throw.
*/
function intCheck(n, min, max, name) {
if (n < min || n > max || n !== mathfloor(n)) {
throw Error
(bignumberError + (name || 'Argument') + (typeof n == 'number'
? n < min || n > max ? ' out of range: ' : ' not an integer: '
: ' not a primitive number: ') + String(n));
}
}
// Assumes finite n.
function isOdd(n) {
var k = n.c.length - 1;
return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;
}
function toExponential(str, e) {
return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +
(e < 0 ? 'e' : 'e+') + e;
}
function toFixedPoint(str, e, z) {
var len, zs;
// Negative exponent?
if (e < 0) {
// Prepend zeros.
for (zs = z + '.'; ++e; zs += z);
str = zs + str;
// Positive exponent
} else {
len = str.length;
// Append zeros.
if (++e > len) {
for (zs = z, e -= len; --e; zs += z);
str += zs;
} else if (e < len) {
str = str.slice(0, e) + '.' + str.slice(e);
}
}
return str;
}
================================================
FILE: build.js
================================================
// Requires Node ≥ 14.14.0 for `fs.rmSync({ recursive: true })`.
const {
existsSync: exists,
rmSync: rm,
mkdirSync: mkdir,
readFileSync: readFile,
writeFileSync: writeFile
} = require('fs');
const { join } = require('path');
// Define paths
const srcJs = 'bignumber.js';
const srcDts = 'bignumber.d.ts';
const distDir = 'dist';
// Clear dist folder
if (exists(distDir)) {
rm(distDir, { recursive: true, force: true });
}
mkdir(distDir, { recursive: true });
// Read source files
const jsContent = readFile(srcJs, 'utf8');
const dtsContent = readFile(srcDts, 'utf8');
// ESM version
const esmJs = `${jsContent}\nexport { BigNumber };\n\nexport default BigNumber;\n`;
writeFile(join(distDir, 'bignumber.mjs'), esmJs, 'utf8');
const esmDts = `${dtsContent}\nexport { BigNumber };\n\nexport default BigNumber;\n`;
writeFile(join(distDir, 'bignumber.d.mts'), esmDts, 'utf8');
// CommonJS version
const namedExportHelper = "\nBigNumber['default'] = BigNumber.BigNumber = BigNumber;\n";
const cjsJs = `${jsContent}${namedExportHelper}\nmodule.exports = BigNumber;\n`;
writeFile(join(distDir, 'bignumber.cjs'), cjsJs, 'utf8');
const cjsDts = `${dtsContent}\nexport = BigNumber;\n`;
writeFile(join(distDir, 'bignumber.d.cts'), cjsDts, 'utf8');
// Global version
const globalJs = `(function() {\n${jsContent}
(typeof globalThis !== 'undefined' ? globalThis :
typeof window !== 'undefined' ? window : self).BigNumber = BigNumber;
})();\n`;
writeFile(join(distDir, 'bignumber.js'), globalJs, 'utf8');
//const globalDts = dtsContent.replace(
// /(declare\s+class\s+BigNumber\b.*)/,
// `$1\ndeclare global {\n var BigNumber: typeof BigNumber;\n}`
//);
const globalDts = dtsContent;
writeFile(join(distDir, 'bignumber.d.ts'), globalDts, 'utf8');
console.log('Build completed successfully.');
``
================================================
FILE: dist/bignumber.cjs
================================================
/*
* bignumber.js v10.0.1
* A JavaScript library for arbitrary-precision arithmetic.
* https://github.com/MikeMcl/bignumber.js
* Copyright (c) 2026 Michael Mclaughlin <M8ch88l@gmail.com>
* MIT Licensed.
*
* BigNumber.prototype methods | BigNumber methods
* |
* absoluteValue abs | clone
* comparedTo | config set
* decimalPlaces dp | DECIMAL_PLACES
* dividedBy div | ROUNDING_MODE
* dividedToIntegerBy idiv | EXPONENTIAL_AT
* exponentiatedBy pow | RANGE
* integerValue | CRYPTO
* isEqualTo eq | MODULO_MODE
* isFinite | POW_PRECISION
* isGreaterThan gt | FORMAT
* isGreaterThanOrEqualTo gte | ALPHABET
* isInteger | isBigNumber
* isLessThan lt | maximum max
* isLessThanOrEqualTo lte | minimum min
* isNaN | random
* isNegative | sum
* isPositive |
* isZero |
* minus |
* modulo mod |
* multipliedBy times |
* negated |
* plus |
* precision sd |
* shiftedBy |
* squareRoot sqrt |
* toExponential |
* toFixed |
* toFormat |
* toFraction |
* toJSON |
* toNumber |
* toObject |
* toPrecision |
* toString |
* valueOf |
*
*/
var
BigNumber = clone(),
isNumeric = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i,
mathceil = Math.ceil,
mathfloor = Math.floor,
bignumberError = '[BigNumber Error] ',
BASE = 1e14,
LOG_BASE = 14,
MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1
// MAX_INT32 = 0x7fffffff, // 2^31 - 1
POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],
SQRT_BASE = 1e7,
// EDITABLE
// The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and
// the arguments to toExponential, toFixed, toFormat, and toPrecision.
MAX = 1E9; // 0 to MAX_INT32
/*
* Create and return a BigNumber constructor.
*/
function clone(configObject) {
var div, convertBase, parseUnusualNumeric,
P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },
ONE = new BigNumber(1),
//----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------
// The default values below must be integers within the inclusive ranges stated.
// The values can also be changed at run-time using BigNumber.set.
// The maximum number of decimal places for operations involving division.
DECIMAL_PLACES = 20, // 0 to MAX
// The rounding mode used when rounding to the above decimal places, and when using
// toExponential, toFixed, toFormat and toPrecision, and round (default value).
// UP 0 Away from zero.
// DOWN 1 Towards zero.
// CEIL 2 Towards +Infinity.
// FLOOR 3 Towards -Infinity.
// HALF_UP 4 Towards nearest neighbour. If equidistant, up.
// HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.
// HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.
// HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.
// HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
ROUNDING_MODE = 4, // 0 to 8
// EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]
// The exponent value at and beneath which toString returns exponential notation.
// Number type: -7
TO_EXP_NEG = -7, // 0 to -MAX
// The exponent value at and above which toString returns exponential notation.
// Number type: 21
TO_EXP_POS = 21, // 0 to MAX
// RANGE : [MIN_EXP, MAX_EXP]
// The minimum exponent value, beneath which underflow to zero occurs.
// Number type: -324 (5e-324)
MIN_EXP = -1e7, // -1 to -MAX
// The maximum exponent value, above which overflow to Infinity occurs.
// Number type: 308 (1.7976931348623157e+308)
// For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.
MAX_EXP = 1e7, // 1 to MAX
// Whether to use cryptographically-secure random number generation, if available.
CRYPTO = false, // true or false
// The modulo mode used when calculating the modulus: a mod n.
// The quotient (q = a / n) is calculated according to the corresponding rounding mode.
// The remainder (r) is calculated as: r = a - n * q.
//
// UP 0 The remainder is positive if the dividend is negative, else is negative.
// DOWN 1 The remainder has the same sign as the dividend.
// This modulo mode is commonly known as 'truncated division' and is
// equivalent to (a % n) in JavaScript.
// FLOOR 3 The remainder has the same sign as the divisor (Python %).
// HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.
// EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).
// The remainder is always positive.
//
// The truncated division, floored division, Euclidian division and IEEE 754 remainder
// modes are commonly used for the modulus operation.
// Although the other rounding modes can also be used, they may not give useful results.
MODULO_MODE = 1, // 0 to 9
// The maximum number of significant digits of the result of the exponentiatedBy operation.
// If POW_PRECISION is 0, there will be unlimited significant digits.
POW_PRECISION = 0, // 0 to MAX
// The format specification used by the BigNumber.prototype.toFormat method.
FORMAT = {
prefix: '',
groupSize: 3,
secondaryGroupSize: 0,
groupSeparator: ',',
decimalSeparator: '.',
fractionGroupSize: 0,
fractionGroupSeparator: '\xA0', // non-breaking space
suffix: ''
},
// The alphabet used for base conversion.
// It must be at least two characters long and have no '+', '-', '.', whitespace, or repeated
// character.
// '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'
ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz';
//------------------------------------------------------------------------------------------
// CONSTRUCTOR
/*
* The BigNumber constructor and exported function.
* Create and return a new instance of a BigNumber object.
*
* v {number|string|BigNumber} A numeric value.
* [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.
*/
function BigNumber(v, b) {
var alphabet, c, caseChanged, e, i, len, str, t,
x = this;
// Enable constructor call without `new`.
if (!(x instanceof BigNumber)) return new BigNumber(v, b);
t = typeof v;
if (b == null) {
if (isBigNumber(v)) {
x.s = v.s;
if (!v.c || v.e > MAX_EXP) {
x.c = x.e = null;
} else if (v.e < MIN_EXP) {
x.c = [x.e = 0];
} else {
x.e = v.e;
x.c = v.c.slice();
}
return;
}
if (t == 'number') {
// Handle ±Infinity and NaN.
if (v * 0 != 0) {
x.s = isNaN(v) ? null : v < 0 ? -1 : 1;
x.c = x.e = null;
return;
}
// Use `1 / v` to handle minus zero also.
x.s = 1 / v < 0 ? (v = -v, -1) : 1;
// Fast path for integers, where v < 2147483648 (2**31).
if (v === ~~v) {
for (e = 0, i = v; i >= 10; i /= 10, e++);
if (e > MAX_EXP) {
x.c = x.e = null;
} else {
x.e = e;
x.c = [v];
}
return;
}
str = String(v);
} else {
if (t == 'string') {
str = v;
if (!isNumeric.test(str)) {
return parseUnusualNumeric(x, str);
}
} else if (t == 'bigint') {
str = String(v);
} else {
throw Error
(bignumberError + 'Invalid argument: ' + v);
}
x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
}
// Decimal point?
if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
// Exponential form?
if ((i = str.search(/e/i)) > 0) {
// Determine exponent.
if (e < 0) e = i;
e += +str.slice(i + 1);
str = str.substring(0, i);
} else if (e < 0) {
// Integer.
e = str.length;
}
// Base specified.
} else {
// '[BigNumber Error] String expected: {v}'
if (t != 'string') {
throw Error
(bignumberError + 'String expected: ' + v);
}
// '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'
intCheck(b, 2, ALPHABET.length, 'Base');
str = v;
x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
alphabet = ALPHABET.slice(0, b);
e = i = 0;
// Check that str is a valid base b number.
// Don't use RegExp, so alphabet can contain special characters.
for (len = str.length; i < len; i++) {
if (alphabet.indexOf(c = str.charAt(i)) < 0) {
if (c == '.') {
// If '.' is not the first character and it has not be found before.
if (i > e) {
e = len;
continue;
}
} else if (!caseChanged) {
// Allow e.g. hexadecimal 'FF' as well as 'ff'.
if (str == str.toUpperCase() && (str = str.toLowerCase()) ||
str == str.toLowerCase() && (str = str.toUpperCase())) {
caseChanged = true;
i = -1;
e = 0;
continue;
}
}
return parseUnusualNumeric(x, v, b);
}
}
str = convertBase(str, b, 10, x.s);
// Decimal point?
if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
else e = str.length;
}
// Determine leading zeros.
for (i = 0; str.charCodeAt(i) === 48; i++);
// Determine trailing zeros.
for (len = str.length; str.charCodeAt(--len) === 48;);
if (str = str.slice(i, ++len)) {
len -= i;
e = e - i - 1;
// Overflow?
if (e > MAX_EXP) {
// Infinity.
x.c = x.e = null;
// Underflow?
} else if (e < MIN_EXP) {
// Zero.
x.c = [x.e = 0];
} else {
x.e = e;
x.c = [];
// Transform base
// e is the base 10 exponent.
// i is where to slice str to get the first element of the coefficient array.
i = (e + 1) % LOG_BASE;
if (e < 0) i += LOG_BASE; // i < 1
if (i < len) {
if (i) x.c.push(+str.slice(0, i));
for (len -= LOG_BASE; i < len;) {
x.c.push(+str.slice(i, i += LOG_BASE));
}
i = LOG_BASE - (str = str.slice(i)).length;
} else {
i -= len;
}
for (; i--; str += '0');
x.c.push(+str);
}
} else {
// Zero.
x.c = [x.e = 0];
}
}
// CONSTRUCTOR PROPERTIES
BigNumber.clone = clone;
BigNumber.ROUND_UP = 0;
BigNumber.ROUND_DOWN = 1;
BigNumber.ROUND_CEIL = 2;
BigNumber.ROUND_FLOOR = 3;
BigNumber.ROUND_HALF_UP = 4;
BigNumber.ROUND_HALF_DOWN = 5;
BigNumber.ROUND_HALF_EVEN = 6;
BigNumber.ROUND_HALF_CEIL = 7;
BigNumber.ROUND_HALF_FLOOR = 8;
BigNumber.EUCLID = 9;
/*
* Configure infrequently-changing library-wide settings.
*
* Accept an object with the following optional properties (if the value of a property is
* a number, it must be an integer within the inclusive range stated):
*
* DECIMAL_PLACES {number} 0 to MAX
* ROUNDING_MODE {number} 0 to 8
* EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]
* RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]
* CRYPTO {boolean} true or false
* MODULO_MODE {number} 0 to 9
* POW_PRECISION {number} 0 to MAX
* ALPHABET {string} A string of unique characters which does not contain
* '+', '-', '.', or whitespace, and starts with '0123456789'.
* FORMAT {object} An object with some of the following properties:
* prefix {string}
* groupSize {number}
* secondaryGroupSize {number}
* groupSeparator {string}
* decimalSeparator {string}
* fractionGroupSize {number}
* fractionGroupSeparator {string}
* suffix {string}
*
* (The values assigned to the above FORMAT object properties are not checked for validity.)
*
* E.g.
* BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })
*
* Ignore properties/parameters set to null or undefined, except for ALPHABET.
*
* Return an object with the properties current values.
*/
BigNumber.config = BigNumber.set = function (obj) {
var p, v;
if (obj != null) {
if (typeof obj == 'object') {
// DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.
// '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {
v = obj[p];
intCheck(v, 0, MAX, p);
DECIMAL_PLACES = v;
}
// ROUNDING_MODE {number} Integer, 0 to 8 inclusive.
// '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {
v = obj[p];
intCheck(v, 0, 8, p);
ROUNDING_MODE = v;
}
// EXPONENTIAL_AT {number|number[]}
// Integer, -MAX to MAX inclusive or
// [integer -MAX to 0 inclusive, 0 to MAX inclusive].
// '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {
v = obj[p];
if (v && v.pop) {
intCheck(v[0], -MAX, 0, p);
intCheck(v[1], 0, MAX, p);
TO_EXP_NEG = v[0];
TO_EXP_POS = v[1];
} else {
intCheck(v, -MAX, MAX, p);
TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);
}
}
// RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or
// [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].
// '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'
if (obj.hasOwnProperty(p = 'RANGE')) {
v = obj[p];
if (v && v.pop) {
intCheck(v[0], -MAX, -1, p);
intCheck(v[1], 1, MAX, p);
MIN_EXP = v[0];
MAX_EXP = v[1];
} else {
intCheck(v, -MAX, MAX, p);
if (v) {
MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);
} else {
throw Error
(bignumberError + p + ' cannot be zero: ' + v);
}
}
}
// CRYPTO {boolean} true or false.
// '[BigNumber Error] CRYPTO not true or false: {v}'
// '[BigNumber Error] crypto unavailable'
if (obj.hasOwnProperty(p = 'CRYPTO')) {
v = obj[p];
if (v === !!v) {
if (v) {
if (typeof crypto != 'undefined' && crypto &&
(crypto.getRandomValues || crypto.randomBytes)) {
CRYPTO = v;
} else {
CRYPTO = !v;
throw Error
(bignumberError + 'crypto unavailable');
}
} else {
CRYPTO = v;
}
} else {
throw Error
(bignumberError + p + ' not true or false: ' + v);
}
}
// MODULO_MODE {number} Integer, 0 to 9 inclusive.
// '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'MODULO_MODE')) {
v = obj[p];
intCheck(v, 0, 9, p);
MODULO_MODE = v;
}
// POW_PRECISION {number} Integer, 0 to MAX inclusive.
// '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'
if (obj.hasOwnProperty(p = 'POW_PRECISION')) {
v = obj[p];
intCheck(v, 0, MAX, p);
POW_PRECISION = v;
}
// FORMAT {object}
// '[BigNumber Error] FORMAT not an object: {v}'
if (obj.hasOwnProperty(p = 'FORMAT')) {
v = obj[p];
if (typeof v == 'object') FORMAT = v;
else throw Error
(bignumberError + p + ' not an object: ' + v);
}
// ALPHABET {string}
// '[BigNumber Error] ALPHABET invalid: {v}'
if (obj.hasOwnProperty(p = 'ALPHABET')) {
v = obj[p];
// Disallow if the alphabet is not at least two characters long,
// or contains '+', '-', '.', whitespace, or a repeated character.
if (typeof v == 'string' && !/^.?$|[+\-.\s]|(.).*\1/.test(v)) {
ALPHABET = v;
} else {
throw Error
(bignumberError + p + ' invalid: ' + v);
}
}
} else {
// '[BigNumber Error] Object expected: {v}'
throw Error
(bignumberError + 'Object expected: ' + obj);
}
}
return {
DECIMAL_PLACES: DECIMAL_PLACES,
ROUNDING_MODE: ROUNDING_MODE,
EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],
RANGE: [MIN_EXP, MAX_EXP],
CRYPTO: CRYPTO,
MODULO_MODE: MODULO_MODE,
POW_PRECISION: POW_PRECISION,
FORMAT: FORMAT,
ALPHABET: ALPHABET
};
};
/*
* Return true if v appears to be a BigNumber instance that has a valid coefficient (c),
* exponent (e), and sign (s), otherwise return false.
*
* v {any}
*/
BigNumber.isBigNumber = function (v) {
if (!isBigNumber(v)) return false;
var i, n,
c = v.c,
e = v.e,
s = v.s;
if ({}.toString.call(c) != '[object Array]') {
// ±Infinity and NaN
return c === null && e === null && (s === null || s === 1 || s === -1)
}
// Check sign and check that exponent is an integer within the allowed range.
if ((s !== 1 && s !== -1) || e < -MAX || e > MAX || e !== mathfloor(e)) {
return false;
}
// If the first element is zero, the BigNumber value must be zero.
if (c[0] === 0) {
return e === 0 && c.length === 1;
}
// Calculate number of digits that c[0] should have, based on the exponent.
i = (e + 1) % LOG_BASE;
if (i < 1) i += LOG_BASE;
// Calculate number of digits of c[0].
//if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) !== i) {
if (String(c[0]).length !== i) {
return false;
}
for (i = 0; i < c.length; i++) {
n = c[i];
if (n < 0 || n >= BASE || n !== mathfloor(n)) return false;
}
// Last element cannot be zero, unless it is the only element.
return n !== 0;
};
/*
* Return a new BigNumber whose value is the maximum of the arguments.
*
* arguments {number|string|BigNumber}
*/
BigNumber.maximum = BigNumber.max = function () {
return maxOrMin(arguments, -1);
};
/*
* Return a new BigNumber whose value is the minimum of the arguments.
*
* arguments {number|string|BigNumber}
*/
BigNumber.minimum = BigNumber.min = function () {
return maxOrMin(arguments, 1);
};
/*
* Return a new BigNumber with a random value equal to or greater than 0 and less than 1,
* and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing
* zeros are produced).
*
* [dp] {number} Decimal places. Integer, 0 to MAX inclusive.
*
* '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'
* '[BigNumber Error] crypto unavailable'
*/
BigNumber.random = (function () {
var pow2_53 = 0x20000000000000;
// Return a 53 bit integer n, where 0 <= n < 9007199254740992.
// Check if Math.random() produces more than 32 bits of randomness.
// If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.
// 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.
var random53bitInt = (Math.random() * pow2_53) & 0x1fffff
? function () { return mathfloor(Math.random() * pow2_53); }
: function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +
(Math.random() * 0x800000 | 0); };
return function (dp) {
var a, b, e, k, v,
i = 0,
c = [],
rand = new BigNumber(ONE);
if (dp == null) dp = DECIMAL_PLACES;
else intCheck(dp, 0, MAX);
k = mathceil(dp / LOG_BASE);
if (CRYPTO) {
// Browsers supporting crypto.getRandomValues.
if (crypto.getRandomValues) {
a = crypto.getRandomValues(new Uint32Array(k *= 2));
for (; i < k;) {
// 53 bits:
// ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)
// 11111 11111111 11111111 11111111 11100000 00000000 00000000
// ((Math.pow(2, 32) - 1) >>> 11).toString(2)
// 11111 11111111 11111111
// 0x20000 is 2^21.
v = a[i] * 0x20000 + (a[i + 1] >>> 11);
// Rejection sampling:
// 0 <= v < 9007199254740992
// Probability that v >= 9e15, is
// 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251
if (v >= 9e15) {
b = crypto.getRandomValues(new Uint32Array(2));
a[i] = b[0];
a[i + 1] = b[1];
} else {
// 0 <= v <= 8999999999999999
// 0 <= (v % 1e14) <= 99999999999999
c.push(v % 1e14);
i += 2;
}
}
i = k / 2;
// Node.js supporting crypto.randomBytes.
} else if (crypto.randomBytes) {
// buffer
a = crypto.randomBytes(k *= 7);
for (; i < k;) {
// 0x1000000000000 is 2^48, 0x10000000000 is 2^40
// 0x100000000 is 2^32, 0x1000000 is 2^24
// 11111 11111111 11111111 11111111 11111111 11111111 11111111
// 0 <= v < 9007199254740992
v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +
(a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +
(a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];
if (v >= 9e15) {
crypto.randomBytes(7).copy(a, i);
} else {
// 0 <= (v % 1e14) <= 99999999999999
c.push(v % 1e14);
i += 7;
}
}
i = k / 7;
} else {
CRYPTO = false;
throw Error
(bignumberError + 'crypto unavailable');
}
}
// Use Math.random.
if (!CRYPTO) {
for (; i < k;) {
v = random53bitInt();
if (v < 9e15) c[i++] = v % 1e14;
}
}
k = c[--i];
dp %= LOG_BASE;
// Convert trailing digits to zeros according to dp.
if (k && dp) {
v = POWS_TEN[LOG_BASE - dp];
c[i] = mathfloor(k / v) * v;
}
// Remove trailing elements which are zero.
for (; c[i] === 0; c.pop(), i--);
// Zero?
if (i < 0) {
c = [e = 0];
} else {
// Remove leading elements which are zero and adjust exponent accordingly.
for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);
// Count the digits of the first element of c to determine leading zeros, and...
for (i = 1, v = c[0]; v >= 10; v /= 10, i++);
// adjust the exponent accordingly.
if (i < LOG_BASE) e -= LOG_BASE - i;
}
rand.e = e;
rand.c = c;
return rand;
};
})();
/*
* Return a BigNumber whose value is the sum of the arguments.
*
* arguments {number|string|BigNumber}
*/
BigNumber.sum = function () {
var i = 1,
args = arguments,
sum = new BigNumber(args[0]);
for (; i < args.length;) sum = sum.plus(args[i++]);
return sum;
};
// PRIVATE FUNCTIONS
// Called by BigNumber and BigNumber.prototype.toString.
convertBase = (function () {
var decimal = '0123456789';
/*
* Convert string of baseIn to an array of numbers of baseOut.
* Eg. toBaseOut('255', 10, 16) returns [15, 15].
* Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].
*/
function toBaseOut(str, baseIn, baseOut, alphabet) {
var j,
arr = [0],
arrL,
i = 0,
len = str.length;
for (; i < len;) {
for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);
arr[0] += alphabet.indexOf(str.charAt(i++));
for (j = 0; j < arr.length; j++) {
if (arr[j] > baseOut - 1) {
if (arr[j + 1] == null) arr[j + 1] = 0;
arr[j + 1] += arr[j] / baseOut | 0;
arr[j] %= baseOut;
}
}
}
return arr.reverse();
}
// Convert a numeric string of baseIn to a numeric string of baseOut.
// If the caller is toString, we are converting from base 10 to baseOut.
// If the caller is BigNumber, we are converting from baseIn to base 10.
return function (str, baseIn, baseOut, sign, callerIsToString) {
var alphabet, d, e, k, r, x, xc, y,
i = str.indexOf('.'),
dp = DECIMAL_PLACES,
rm = ROUNDING_MODE;
// Non-integer.
if (i >= 0) {
k = POW_PRECISION;
// Unlimited precision.
POW_PRECISION = 0;
str = str.replace('.', '');
y = new BigNumber(baseIn);
x = y.pow(str.length - i);
POW_PRECISION = k;
// Co
gitextract_ypy8eb9d/
├── .gitattributes
├── .github/
│ └── workflows/
│ └── ci.yml
├── .gitignore
├── CHANGELOG.md
├── LICENCE.md
├── README.md
├── bignumber.d.ts
├── bignumber.js
├── build.js
├── dist/
│ ├── bignumber.cjs
│ ├── bignumber.d.cts
│ ├── bignumber.d.mts
│ ├── bignumber.d.ts
│ ├── bignumber.js
│ └── bignumber.mjs
├── doc/
│ └── API.html
├── package.json
├── perf/
│ ├── README.md
│ ├── bignumber-vs-bigdecimal.html
│ ├── bigtime-OOM.js
│ ├── bigtime.js
│ └── lib/
│ ├── bigdecimal_GWT/
│ │ ├── BigDecTest.java
│ │ ├── LICENCE.txt
│ │ ├── bigdecimal.js
│ │ └── bugs.js
│ └── bigdecimal_ICU4J/
│ ├── BigDecimal-all-last.js
│ └── LICENCE.txt
└── test/
├── console-errors.html
├── methods/
│ ├── BigNumber.js
│ ├── absoluteValue.js
│ ├── clone.js
│ ├── comparedTo.js
│ ├── config.js
│ ├── decimalPlaces.js
│ ├── dividedBy.js
│ ├── dividedToIntegerBy.js
│ ├── exponentiatedBy.js
│ ├── integerValue.js
│ ├── isBigNumber.js
│ ├── isMethods.js
│ ├── minmax.js
│ ├── minus.js
│ ├── modulo.js
│ ├── multipliedBy.js
│ ├── negated.js
│ ├── plus.js
│ ├── precision.js
│ ├── random.js
│ ├── shiftedBy.js
│ ├── squareRoot.js
│ ├── sum.js
│ ├── toExponential.js
│ ├── toFixed.js
│ ├── toFormat.js
│ ├── toFraction.js
│ ├── toNumber.js
│ ├── toObject.js
│ ├── toPrecision.js
│ └── toString.js
├── methods.html
├── test.html
├── test.js
├── tester.js
└── typescript/
├── README.md
├── test_default_import.ts
├── test_global.ts
├── test_named_import.ts
├── test_require.ts
├── tsconfig.base.json
├── tsconfig.cjs.json
├── tsconfig.esm.json
└── tsconfig.global.json
SYMBOL INDEX (657 symbols across 38 files)
FILE: bignumber.d.ts
type Config (line 36) | interface Config {
type Format (line 280) | interface Format {
type Instance (line 307) | interface Instance {
type Constructor (line 321) | type Constructor = typeof BigNumber;
type ModuloMode (line 322) | type ModuloMode = 0 | 1 | 3 | 6 | 9;
type RoundingMode (line 323) | type RoundingMode = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8;
type Value (line 324) | type Value = string | number | bigint | Instance;
class BigNumber (line 327) | class BigNumber implements BigNumber.Instance {
FILE: bignumber.js
function clone (line 74) | function clone(configObject) {
function bitFloor (line 2770) | function bitFloor(n) {
function coeffToString (line 2777) | function coeffToString(a) {
function compare (line 2798) | function compare(x, y) {
function intCheck (line 2841) | function intCheck(n, min, max, name) {
function isOdd (line 2852) | function isOdd(n) {
function toExponential (line 2858) | function toExponential(str, e) {
function toFixedPoint (line 2864) | function toFixedPoint(str, e, z) {
FILE: dist/bignumber.cjs
function clone (line 74) | function clone(configObject) {
function bitFloor (line 2770) | function bitFloor(n) {
function coeffToString (line 2777) | function coeffToString(a) {
function compare (line 2798) | function compare(x, y) {
function intCheck (line 2841) | function intCheck(n, min, max, name) {
function isOdd (line 2852) | function isOdd(n) {
function toExponential (line 2858) | function toExponential(str, e) {
function toFixedPoint (line 2864) | function toFixedPoint(str, e, z) {
FILE: dist/bignumber.d.ts
type Config (line 36) | interface Config {
type Format (line 280) | interface Format {
type Instance (line 307) | interface Instance {
type Constructor (line 321) | type Constructor = typeof BigNumber;
type ModuloMode (line 322) | type ModuloMode = 0 | 1 | 3 | 6 | 9;
type RoundingMode (line 323) | type RoundingMode = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8;
type Value (line 324) | type Value = string | number | bigint | Instance;
class BigNumber (line 327) | class BigNumber implements BigNumber.Instance {
FILE: dist/bignumber.js
function clone (line 75) | function clone(configObject) {
function bitFloor (line 2771) | function bitFloor(n) {
function coeffToString (line 2778) | function coeffToString(a) {
function compare (line 2799) | function compare(x, y) {
function intCheck (line 2842) | function intCheck(n, min, max, name) {
function isOdd (line 2853) | function isOdd(n) {
function toExponential (line 2859) | function toExponential(str, e) {
function toFixedPoint (line 2865) | function toFixedPoint(str, e, z) {
FILE: dist/bignumber.mjs
function clone (line 74) | function clone(configObject) {
function bitFloor (line 2770) | function bitFloor(n) {
function coeffToString (line 2777) | function coeffToString(a) {
function compare (line 2798) | function compare(x, y) {
function intCheck (line 2841) | function intCheck(n, min, max, name) {
function isOdd (line 2852) | function isOdd(n) {
function toExponential (line 2858) | function toExponential(str, e) {
function toFixedPoint (line 2864) | function toFixedPoint(str, e, z) {
FILE: perf/bigtime.js
function toKB (line 106) | function toKB(m) {return parseFloat((m / 1024).toFixed(1))}
FILE: perf/lib/bigdecimal_GWT/BigDecTest.java
class BigDecTest (line 6) | public class BigDecTest
method main (line 8) | public static void main(String[] args) {
FILE: perf/lib/bigdecimal_GWT/bigdecimal.js
function gwtapp (line 17) | function gwtapp() {}
function H (line 19) | function H(){}
function P (line 20) | function P(){}
function O (line 21) | function O(){}
function N (line 22) | function N(){}
function M (line 23) | function M(){}
function rr (line 24) | function rr(){}
function gb (line 25) | function gb(){}
function ub (line 26) | function ub(){}
function pb (line 27) | function pb(){}
function Fb (line 28) | function Fb(){}
function Ab (line 29) | function Ab(){}
function Lb (line 30) | function Lb(){}
function Tb (line 31) | function Tb(){}
function Kb (line 32) | function Kb(){}
function Zb (line 33) | function Zb(){}
function _b (line 34) | function _b(){}
function fc (line 35) | function fc(){}
function ic (line 36) | function ic(){}
function hc (line 37) | function hc(){}
function Se (line 38) | function Se(){}
function Re (line 39) | function Re(){}
function Ze (line 40) | function Ze(){}
function Ye (line 41) | function Ye(){}
function Xe (line 42) | function Xe(){}
function Ah (line 43) | function Ah(){}
function Hh (line 44) | function Hh(){}
function Gh (line 45) | function Gh(){}
function Ej (line 46) | function Ej(){}
function Mj (line 47) | function Mj(){}
function Uj (line 48) | function Uj(){}
function _j (line 49) | function _j(){}
function gk (line 50) | function gk(){}
function mk (line 51) | function mk(){}
function pk (line 52) | function pk(){}
function wk (line 53) | function wk(){}
function vk (line 54) | function vk(){}
function Dk (line 55) | function Dk(){}
function Ik (line 56) | function Ik(){}
function Qk (line 57) | function Qk(){}
function Uk (line 58) | function Uk(){}
function il (line 59) | function il(){}
function ol (line 60) | function ol(){}
function rl (line 61) | function rl(){}
function Tl (line 62) | function Tl(){}
function Xl (line 63) | function Xl(){}
function km (line 64) | function km(){}
function om (line 65) | function om(){}
function Nn (line 66) | function Nn(){}
function Np (line 67) | function Np(){}
function ep (line 68) | function ep(){}
function dp (line 69) | function dp(){}
function yp (line 70) | function yp(){}
function yo (line 71) | function yo(){}
function Zo (line 72) | function Zo(){}
function xp (line 73) | function xp(){}
function Hp (line 74) | function Hp(){}
function Mp (line 75) | function Mp(){}
function Xp (line 76) | function Xp(){}
function bq (line 77) | function bq(){}
function jq (line 78) | function jq(){}
function qq (line 79) | function qq(){}
function Dq (line 80) | function Dq(){}
function Hq (line 81) | function Hq(){}
function Nq (line 82) | function Nq(){}
function Qq (line 83) | function Qq(){}
function Zq (line 84) | function Zq(){}
function Yq (line 85) | function Yq(){}
function Yj (line 86) | function Yj(){Wj()}
function Ij (line 87) | function Ij(){Gj()}
function Eh (line 88) | function Eh(){Ch()}
function Ek (line 89) | function Ek(){Cb()}
function qk (line 90) | function qk(){Cb()}
function Rk (line 91) | function Rk(){Cb()}
function Vk (line 92) | function Vk(){Cb()}
function jl (line 93) | function jl(){Cb()}
function Oq (line 94) | function Oq(){Cb()}
function kk (line 95) | function kk(){ik()}
function fm (line 96) | function fm(){Yl(this)}
function gm (line 97) | function gm(){Yl(this)}
function mg (line 98) | function mg(a){Hf(this,a)}
function mq (line 99) | function mq(a){this.c=a}
function bk (line 100) | function bk(a){this.b=a}
function Cp (line 101) | function Cp(a){this.b=a}
function Sp (line 102) | function Sp(a){this.b=a}
function V (line 103) | function V(a){Cb();this.f=a}
function nk (line 104) | function nk(a){V.call(this,a)}
function rk (line 105) | function rk(a){V.call(this,a)}
function Sk (line 106) | function Sk(a){V.call(this,a)}
function Wk (line 107) | function Wk(a){V.call(this,a)}
function kl (line 108) | function kl(a){V.call(this,a)}
function Yl (line 109) | function Yl(a){a.b=new fc}
function Ul (line 110) | function Ul(){this.b=new fc}
function rb (line 111) | function rb(){rb=rr;qb=new ub}
function lr (line 112) | function lr(){lr=rr;kr=new gr}
function jr (line 113) | function jr(a,b){return b}
function ac (line 114) | function ac(a,b){a.b+=b}
function bc (line 115) | function bc(a,b){a.b+=b}
function cc (line 116) | function cc(a,b){a.b+=b}
function dc (line 117) | function dc(a,b){a.b+=b}
function or (line 118) | function or(a,b){lr();a[Ls]=b}
function nr (line 119) | function nr(a,b){lr();ar(a,b)}
function _q (line 120) | function _q(a,b,c){rp(a.b,b,c)}
function Jg (line 121) | function Jg(){rf();Hf(this,Tr)}
function pl (line 122) | function pl(a){Sk.call(this,a)}
function Hk (line 123) | function Hk(a){return isNaN(a)}
function Jj (line 124) | function Jj(a){return new Oi(a)}
function Zj (line 125) | function Zj(a){return new Oj(a)}
function dl (line 126) | function dl(a){return a<0?-a:a}
function hl (line 127) | function hl(a,b){return a<b?a:b}
function gl (line 128) | function gl(a,b){return a>b?a:b}
function xe (line 129) | function xe(a,b){return !we(a,b)}
function ye (line 130) | function ye(a,b){return !ve(a,b)}
function ir (line 131) | function ir(a,b){return new b(a)}
function Oj (line 132) | function Oj(a){this.b=new Yn(a)}
function Nj (line 133) | function Nj(){this.b=(Un(),Rn)}
function ak (line 134) | function ak(){this.b=(Qo(),Fo)}
function Wo (line 135) | function Wo(){Qo();return zo}
function mr (line 136) | function mr(a,b){lr();_q(kr,a,b)}
function br (line 137) | function br(a,b){a[b]||(a[b]={})}
function kq (line 138) | function kq(a){return a.b<a.c.c}
function Vn (line 139) | function Vn(a){return a.b<<3|a.c.c}
function Mi (line 140) | function Mi(a){return a.f*a.b[0]}
function Je (line 141) | function Je(a){return a.l|a.m<<22}
function op (line 142) | function op(b,a){return b.f[Qr+a]}
function Yp (line 143) | function Yp(a,b){this.c=a;this.b=b}
function Ro (line 144) | function Ro(a,b){this.b=a;this.c=b}
function Iq (line 145) | function Iq(a,b){this.b=a;this.c=b}
function bm (line 146) | function bm(a,b){ac(a.b,b);return a}
function cm (line 147) | function cm(a,b){bc(a.b,b);return a}
function dm (line 148) | function dm(a,b){cc(a.b,b);return a}
function pr (line 149) | function pr(a){lr();return er(kr,a)}
function qr (line 150) | function qr(a){lr();return fr(kr,a)}
function Oi (line 151) | function Oi(a){Oh();oi.call(this,a)}
function Ni (line 152) | function Ni(){Oh();oi.call(this,Tr)}
function cg (line 153) | function cg(a){dg.call(this,a,0)}
function Kg (line 154) | function Kg(a){mg.call(this,a.tS())}
function el (line 155) | function el(a){return Math.floor(a)}
function yl (line 156) | function yl(b,a){return b.indexOf(a)}
function qp (line 157) | function qp(b,a){return Qr+a in b.f}
function uc (line 158) | function uc(a,b){return a.cM&&a.cM[b]}
function re (line 159) | function re(a,b){return ee(a,b,false)}
function bn (line 160) | function bn(a,b){return cn(a.b,a.e,b)}
function ce (line 161) | function ce(a){return de(a.l,a.m,a.h)}
function Ac (line 162) | function Ac(a){return a==null?null:a}
function sf (line 163) | function sf(a){return a.r()<0?Mf(a):a}
function ob (line 164) | function ob(a){return a.$H||(a.$H=++jb)}
function zc (line 165) | function zc(a){return a.tM==rr||tc(a,1)}
function tc (line 166) | function tc(a,b){return a.cM&&!!a.cM[b]}
function vl (line 167) | function vl(b,a){return b.charCodeAt(a)}
function hm (line 168) | function hm(a){Yl(this);cc(this.b,a)}
function oi (line 169) | function oi(a){Oh();pi.call(this,a,10)}
function Aq (line 170) | function Aq(a,b,c,d){a.splice(b,c,d)}
function dq (line 171) | function dq(a,b){(a<0||a>=b)&&hq(a,b)}
function xc (line 172) | function xc(a,b){return a!=null&&tc(a,b)}
function db (line 173) | function db(a){return yc(a)?Db(wc(a)):Lr}
function Z (line 174) | function Z(a){return yc(a)?$(wc(a)):a+Lr}
function Fl (line 175) | function Fl(a){return lc(Vd,{6:1},1,a,0)}
function vq (line 176) | function vq(){this.b=lc(Td,{6:1},0,0,0)}
function Pl (line 177) | function Pl(){Pl=rr;Ml={};Ol={}}
function Yo (line 178) | function Yo(){Yo=rr;Xo=Jk((Qo(),zo))}
function ik (line 179) | function ik(){if(!hk){hk=true;jk()}}
function Gj (line 180) | function Gj(){if(!Fj){Fj=true;Hj()}}
function Wj (line 181) | function Wj(){if(!Vj){Vj=true;new kk;Xj()}}
function gr (line 182) | function gr(){this.b=new Fq;new Fq;new Fq}
function X (line 183) | function X(a){Cb();this.c=a;Bb(new Tb,this)}
function Pi (line 184) | function Pi(a){Oh();oi.call(this,Hm(a,0))}
function gg (line 185) | function gg(a){hg.call(this,a,0,a.length)}
function fg (line 186) | function fg(a,b){cg.call(this,a);If(this,b)}
function ze (line 187) | function ze(a,b){ee(a,b,true);return ae}
function tq (line 188) | function tq(a,b){dq(b,a.c);return a.b[b]}
function rq (line 189) | function rq(a,b){nc(a.b,a.c++,b);return true}
function _l (line 190) | function _l(a,b,c){dc(a.b,Ll(b,0,c));return a}
function kb (line 191) | function kb(a,b,c){return a.apply(b,c);var d}
function em (line 192) | function em(a,b,c){return ec(a.b,b,b,c),a}
function Af (line 193) | function Af(a,b,c){return yf(a,b,Bc(a.f),c)}
function xf (line 194) | function xf(a,b,c){return yf(a,b,Bc(a.f),Uo(c))}
function Bl (line 195) | function Bl(c,a,b){return c.substr(a,b-a)}
function Al (line 196) | function Al(b,a){return b.substr(a,b.length-a)}
function fl (line 197) | function fl(a){return Math.log(a)*Math.LOG10E}
function cb (line 198) | function cb(a){return a==null?null:a.name}
function $ (line 199) | function $(a){return a==null?null:a.message}
function yc (line 200) | function yc(a){return a!=null&&a.tM!=rr&&!tc(a,1)}
function ec (line 201) | function ec(a,b,c,d){a.b=Bl(a.b,0,b)+d+Al(a.b,c)}
function eg (line 202) | function eg(a,b,c){dg.call(this,a,b);If(this,c)}
function pg (line 203) | function pg(a,b){this.g=a;this.f=b;this.b=sg(a)}
function si (line 204) | function si(a,b,c){Oh();this.f=a;this.e=b;this.b=c}
function sl (line 205) | function sl(a){this.b='Unknown';this.d=a;this.c=-1}
function yk (line 206) | function yk(a,b){var c;c=new wk;c.d=a+b;return c}
function dr (line 207) | function dr(a,b){var c;c=mp(a.b,b);return wc(c)}
function fb (line 208) | function fb(a){var b;return b=a,zc(b)?b.hC():ob(b)}
function To (line 209) | function To(a){Qo();return Ok((Yo(),Xo),a)}
function qe (line 210) | function qe(a,b){return de(a.l&b.l,a.m&b.m,a.h&b.h)}
function De (line 211) | function De(a,b){return de(a.l|b.l,a.m|b.m,a.h|b.h)}
function Le (line 212) | function Le(a,b){return de(a.l^b.l,a.m^b.m,a.h^b.h)}
function Bm (line 213) | function Bm(a,b){return (a.b[~~b>>5]&1<<(b&31))!=0}
function Cq (line 214) | function Cq(a,b){var c;for(c=0;c<b;++c){a[c]=false}}
function Lf (line 215) | function Lf(a,b,c){var d;d=Kf(a,b);If(d,c);return d}
function zb (line 216) | function zb(a,b){a.length>=b&&a.splice(0,b);return a}
function wb (line 217) | function wb(a,b){!a&&(a=[]);a[a.length]=b;return a}
function Ph (line 218) | function Ph(a,b){if(mi(a,b)){return tm(a,b)}return a}
function ii (line 219) | function ii(a,b){if(!mi(a,b)){return tm(a,b)}return a}
function _d (line 220) | function _d(a){if(xc(a,15)){return a}return new X(a)}
function Eb (line 221) | function Eb(){try{null.a()}catch(a){return a}}
function Ak (line 222) | function Ak(a){var b;b=new wk;b.d=Lr+a;b.c=1;return b}
function eb (line 223) | function eb(a,b){var c;return c=a,zc(c)?c.eQ(b):c===b}
function se (line 224) | function se(a,b){return a.l==b.l&&a.m==b.m&&a.h==b.h}
function Ce (line 225) | function Ce(a,b){return a.l!=b.l||a.m!=b.m||a.h!=b.h}
function de (line 226) | function de(a,b,c){return _=new Se,_.l=a,_.m=b,_.h=c,_}
function rp (line 227) | function rp(a,b,c){return !b?tp(a,c):sp(a,b,c,~~ob(b))}
function Eq (line 228) | function Eq(a,b){return Ac(a)===Ac(b)||a!=null&&eb(a,b)}
function Xq (line 229) | function Xq(a,b){return Ac(a)===Ac(b)||a!=null&&eb(a,b)}
function hq (line 230) | function hq(a,b){throw new Wk('Index: '+a+', Size: '+b)}
function Xh (line 231) | function Xh(a,b){if(b<0){throw new nk(ts)}return tm(a,b)}
function dg (line 232) | function dg(a,b){if(!a){throw new jl}this.f=b;Tf(this,a)}
function og (line 233) | function og(a,b){if(!a){throw new jl}this.f=b;Tf(this,a)}
function ig (line 234) | function ig(a,b,c,d){hg.call(this,a,b,c);If(this,d)}
function jg (line 235) | function jg(a,b){hg.call(this,a,0,a.length);If(this,b)}
function ng (line 236) | function ng(a,b){hg.call(this,Cl(a),0,a.length);If(this,b)}
function lm (line 237) | function lm(a){V.call(this,'String index out of range: '+a)}
function Zl (line 238) | function Zl(a,b){dc(a.b,String.fromCharCode(b));return a}
function pn (line 239) | function pn(a,b){tn(a.b,a.b,a.e,b.b,b.e);Sh(a);a.c=-2}
function Tf (line 240) | function Tf(a,b){a.d=b;a.b=b.ab();a.b<54&&(a.g=Ie(ai(b)))}
function qc (line 241) | function qc(){qc=rr;oc=[];pc=[];rc(new ic,oc,pc)}
function Ch (line 242) | function Ch(){if(!Bh){Bh=true;new Yj;new Ij;Dh()}}
function Sl (line 243) | function Sl(){if(Nl==256){Ml=Ol;Ol={};Nl=0}++Nl}
function cr (line 244) | function cr(a){var b;b=a[Ls];if(!b){b=[];a[Ls]=b}return b}
function zk (line 245) | function zk(a,b,c){var d;d=new wk;d.d=a+b;d.c=c?8:0;return d}
function xk (line 246) | function xk(a,b,c){var d;d=new wk;d.d=a+b;d.c=4;d.b=c;return d}
function lc (line 247) | function lc(a,b,c,d,e){var f;f=jc(e,d);mc(a,b,c,f);return f}
function Ll (line 248) | function Ll(a,b,c){var d;d=b+c;El(a.length,b,d);return Gl(a,b,d)}
function mo (line 249) | function mo(a,b){go();return b<fo.length?lo(a,fo[b]):ei(a,po(b))}
function me (line 250) | function me(a){return a.l+a.m*4194304+a.h*17592186044416}
function vc (line 251) | function vc(a,b){if(a!=null&&!uc(a,b)){throw new Ek}return a}
function lq (line 252) | function lq(a){if(a.b>=a.c.c){throw new Oq}return tq(a.c,a.b++)}
function wl (line 253) | function wl(a,b){if(!xc(b,1)){return false}return String(a)==b}
function lb (line 254) | function lb(){if(ib++==0){sb((rb(),qb));return true}return false}
function fi (line 255) | function fi(a){if(a.f<0){throw new nk('start < 0: '+a)}return xo(a)}
function pm (line 256) | function pm(){V.call(this,'Add not supported on this collection')}
function Fq (line 257) | function Fq(){this.b=[];this.f={};this.d=false;this.c=null;this.e=0}
function qi (line 258) | function qi(a,b){Oh();this.f=a;this.e=1;this.b=mc(Od,{6:1},-1,[b])}
function sc (line 259) | function sc(a,b,c){qc();for(var d=0,e=b.length;d<e;++d){a[b[d]]=c[d]}}
function xl (line 260) | function xl(a,b,c,d){var e;for(e=0;e<b;++e){c[d++]=a.charCodeAt(e)}}
function Wh (line 261) | function Wh(a,b){var c;for(c=a.e-1;c>=0&&a.b[c]==b[c];--c){}return c<0}
function tp (line 262) | function tp(a,b){var c;c=a.c;a.c=b;if(!a.d){a.d=true;++a.e}return c}
function $l (line 263) | function $l(a,b){dc(a.b,String.fromCharCode.apply(null,b));return a}
function am (line 264) | function am(a,b,c,d){b==null&&(b=Mr);bc(a.b,b.substr(c,d-c));return a}
function sn (line 265) | function sn(a,b,c,d){var e;e=lc(Od,{6:1},-1,b,1);tn(e,a,b,c,d);return e}
function mc (line 266) | function mc(a,b,c,d){qc();sc(d,oc,pc);d.aC=a;d.cM=b;d.qI=c;return d}
function uq (line 267) | function uq(a,b,c){for(;c<a.c;++c){if(Xq(b,a.b[c])){return c}}return -1}
function sq (line 268) | function sq(a,b,c){(b<0||b>a.c)&&hq(b,a.c);Aq(a.b,b,0,c);++a.c}
function nn (line 269) | function nn(a,b){var c;c=on(a.b,a.e,b);if(c==1){a.b[a.e]=1;++a.e}a.c=-2}
function Sh (line 270) | function Sh(a){while(a.e>0&&a.b[--a.e]==0){}a.b[a.e++]==0&&(a.f=0)}
function Gg (line 271) | function Gg(a){if(we(a,ur)&&xe(a,xr)){return df[Je(a)]}return new qg(a,0)}
function ji (line 272) | function ji(a,b){if(b==0||a.f==0){return a}return b>0?wm(a,b):zm(a,-b)}
function li (line 273) | function li(a,b){if(b==0||a.f==0){return a}return b>0?zm(a,b):wm(a,-b)}
function $h (line 274) | function $h(a){var b;if(a.f==0){return -1}b=Zh(a);return (b<<5)+_k(a.b[b])}
function bl (line 275) | function bl(a){var b;b=Je(a);return b!=0?_k(b):_k(Je(Fe(a,32)))+32}
function Sb (line 276) | function Sb(a,b){var c;c=Mb(a,b);return c.length==0?(new Fb).o(b):zb(c,1)}
function Gl (line 277) | function Gl(a,b,c){a=a.slice(b,c);return String.fromCharCode.apply(null,a)}
function rc (line 278) | function rc(a,b,c){var d=0,e;for(var f in a){if(e=a[f]){b[d]=f;c[d]=e;++...
function up (line 279) | function up(e,a,b){var c,d=e.f;a=Qr+a;a in d?(c=d[a]):++e.e;d[a]=b;retur...
function gn (line 280) | function gn(a,b,c,d){var e;e=lc(Od,{6:1},-1,b+1,1);hn(e,a,b,c,d);return e}
function Cl (line 281) | function Cl(a){var b,c;c=a.length;b=lc(Md,{6:1},-1,c,1);xl(a,c,b,0);retu...
function _e (line 282) | function _e(a){var b;b=bf(a);if(isNaN(b)){throw new pl(Zr+a+$r)}return b}
function Fg (line 283) | function Fg(a){if(!isFinite(a)||isNaN(a)){throw new pl(hs)}return new mg...
function wc (line 284) | function wc(a){if(a!=null&&(a.tM==rr||tc(a,1))){throw new Ek}return a}
function Qf (line 285) | function Qf(a,b){var c;c=new og((!a.d&&(a.d=Li(a.g)),a.d),a.f);If(c,b);r...
function bg (line 286) | function bg(a,b){var c;c=new Pi(Zf(a));if(sm(c)<b){return ai(c)}throw ne...
function ei (line 287) | function ei(a,b){if(b.f==0){return Nh}if(a.f==0){return Nh}return go(),h...
function bi (line 288) | function bi(a,b){var c;if(b.f<=0){throw new nk(us)}c=hi(a,b);return c.f<...
function Ip (line 289) | function Ip(a){var b;b=new vq;a.d&&rq(b,new Sp(a));kp(a,b);jp(a,b);this....
function lp (line 290) | function lp(a,b){return b==null?a.d:xc(b,1)?qp(a,vc(b,1)):pp(a,b,~~fb(b))}
function mp (line 291) | function mp(a,b){return b==null?a.c:xc(b,1)?op(a,vc(b,1)):np(a,b,~~fb(b))}
function Bc (line 292) | function Bc(a){return ~~Math.max(Math.min(a,2147483647),-2147483648)}
function qg (line 293) | function qg(a,b){this.f=b;this.b=tg(a);this.b<54?(this.g=Ie(a)):(this.d=...
function kg (line 294) | function kg(a){if(!isFinite(a)||isNaN(a)){throw new pl(hs)}Hf(this,a.toP...
function mb (line 295) | function mb(b){return function(){try{return nb(b,this,arguments)}catch(a...
function nb (line 296) | function nb(a,b,c){var d;d=lb();try{return kb(a,b,c)}finally{d&&tb((rb()...
function Ok (line 297) | function Ok(a,b){var c;c=a[Qr+b];if(c){return c}if(b==null){throw new jl...
function sb (line 298) | function sb(a){var b,c;if(a.b){c=null;do{b=a.b;a.b=null;c=xb(b,c)}while(...
function tb (line 299) | function tb(a){var b,c;if(a.c){c=null;do{b=a.c;a.c=null;c=xb(b,c)}while(...
function _k (line 300) | function _k(a){var b,c;if(a==0){return 32}else{c=0;for(b=1;(b&a)==0;b<<=...
function Jk (line 301) | function Jk(a){var b,c,d,e;b={};for(d=0,e=a.length;d<e;++d){c=a[d];b[Qr+...
function Rb (line 302) | function Rb(a){var b;b=zb(Sb(a,Eb()),3);b.length==0&&(b=zb((new Fb).k(),...
function Wn (line 303) | function Wn(a){var b;b=new gm;$l(b,Sn);bm(b,a.b);b.b.b+=ys;$l(b,Tn);cm(b...
function Rh (line 304) | function Rh(a){var b;b=lc(Od,{6:1},-1,a.e,1);nm(a.b,0,b,0,a.e);return ne...
function Bf (line 305) | function Bf(a,b){var c;c=lc(Wd,{6:1},16,2,0);nc(c,0,Df(a,b));nc(c,1,Xf(a...
function Cf (line 306) | function Cf(a,b,c){var d;d=lc(Wd,{6:1},16,2,0);nc(d,0,Ef(a,b,c));nc(d,1,...
function $o (line 307) | function $o(a,b){var c;while(a.Pb()){c=a.Qb();if(b==null?c==null:eb(b,c)...
function Zh (line 308) | function Zh(a){var b;if(a.c==-2){if(a.f==0){b=-1}else{for(b=0;a.b[b]==0;...
function bb (line 309) | function bb(a){var b;return a==null?Mr:yc(a)?cb(wc(a)):xc(a,1)?Nr:(b=a,z...
function Uf (line 310) | function Uf(a){if(a.b<54){return a.g<0?-1:a.g>0?1:0}return (!a.d&&(a.d=L...
function Mf (line 311) | function Mf(a){if(a.b<54){return new pg(-a.g,a.f)}return new og((!a.d&&(...
function El (line 312) | function El(a,b,c){if(b<0){throw new lm(b)}if(c<b){throw new lm(c-b)}if(...
function lg (line 313) | function lg(a,b){if(!isFinite(a)||isNaN(a)){throw new pl(hs)}Hf(this,a.t...
function Gk (line 314) | function Gk(a,b){if(isNaN(a)){return isNaN(b)?0:1}else if(isNaN(b)){retu...
function uk (line 315) | function uk(a,b){if(b<2||b>36){return 0}if(a<0||a>=b){return 0}return a<...
function er (line 316) | function er(a,b){var c;if(!b){return null}c=b[Ls];if(c){return c}c=ir(b,...
function ke (line 317) | function ke(a){var b,c;c=$k(a.h);if(c==32){b=$k(a.m);return b==32?$k(a.l...
function be (line 318) | function be(a){var b,c,d;b=a&4194303;c=~~a>>22&4194303;d=a<0?1048575:0;r...
function Qe (line 319) | function Qe(){Qe=rr;Me=de(4194303,4194303,524287);Ne=de(0,0,524288);Oe=u...
function mn (line 320) | function mn(a,b){hn(a.b,a.b,a.e,b.b,b.e);a.e=hl(gl(a.e,b.e)+1,a.b.length...
function um (line 321) | function um(a,b){var c;c=~~b>>5;a.e+=c+($k(a.b[a.e-1])-(b&31)>=0?0:1);xm...
function Tm (line 322) | function Tm(a,b){var c,d;c=~~b>>5;if(a.e<c||a.ab()<=b){return}d=32-(b&31...
function ai (line 323) | function ai(a){var b;b=a.e>1?De(Ee(ue(a.b[1]),32),qe(ue(a.b[0]),yr)):qe(...
function jn (line 324) | function jn(a,b,c){var d;for(d=c-1;d>=0&&a[d]==b[d];--d){}return d<0?0:x...
function ym (line 325) | function ym(a,b,c){var d,e,f;d=0;for(e=0;e<c;++e){f=b[e];a[e]=f<<1|d;d=~...
function ge (line 326) | function ge(a,b,c,d,e){var f;f=Fe(a,b);c&&je(f);if(e){a=ie(a,b);d?(ae=Be...
function gwtOnLoad (line 327) | function gwtOnLoad(b,c,d,e){$moduleName=c;$moduleBase=d;if(b)try{Jr($d)(...
function fr (line 328) | function fr(a,b){var c,d,e;if(b==null){return null}d=cr(b);e=d;for(c=0;c...
function Mb (line 329) | function Mb(a,b){var c,d,e;e=b&&b.stack?b.stack.split('\n'):[];for(c=0,d...
function Um (line 330) | function Um(a,b){var c,d;d=~~b>>5==a.e-1&&a.b[a.e-1]==1<<(b&31);if(d){fo...
function _h (line 331) | function _h(a){var b;if(a.d!=0){return a.d}for(b=0;b<a.b.length;++b){a.d...
function Hg (line 332) | function Hg(a,b){if(b==0){return Gg(a)}if(se(a,ur)&&b>=0&&b<pf.length){r...
function Ig (line 333) | function Ig(a){if(a==Bc(a)){return Hg(ur,Bc(a))}if(a>=0){return new qg(u...
function Li (line 334) | function Li(a){Oh();if(a<0){if(a!=-1){return new ui(-1,-a)}return Ih}els...
function zg (line 335) | function zg(a){var b=qf;!b&&(b=qf=/^[+-]?\d*$/i);if(b.test(a)){return pa...
function kp (line 336) | function kp(e,a){var b=e.f;for(var c in b){if(c.charCodeAt(0)==58){var d...
function Rl (line 337) | function Rl(a){Pl();var b=Qr+a;var c=Ol[b];if(c!=null){return c}c=Ml[b];...
function Be (line 338) | function Be(a){var b,c,d;b=~a.l+1&4194303;c=~a.m+(b==0?1:0)&4194303;d=~a...
function je (line 339) | function je(a){var b,c,d;b=~a.l+1&4194303;c=~a.m+(b==0?1:0)&4194303;d=~a...
function Q (line 340) | function Q(a){var b,c,d;c=lc(Ud,{6:1},13,a.length,0);for(d=0,b=a.length;...
function Cb (line 341) | function Cb(){var a,b,c,d;c=Rb(new Tb);d=lc(Ud,{6:1},13,c.length,0);for(...
function fk (line 342) | function fk(){var a,b,c;c=(Qo(),Qo(),zo);b=lc(Sd,{6:1},5,c.length,0);for...
function ki (line 343) | function ki(a){var b,c,d,e;return a.f==0?a:(e=a.e,c=e+1,b=lc(Od,{6:1},-1...
function Ym (line 344) | function Ym(a,b,c,d){var e,f;e=c.e;f=lc(Od,{6:1},-1,(e<<1)+1,1);io(a.b,h...
function Vh (line 345) | function Vh(a,b){var c;if(a===b){return true}if(xc(b,17)){c=vc(b,17);ret...
function Zk (line 346) | function Zk(a){var b;if(a<0){return -2147483648}else if(a==0){return 0}e...
function sm (line 347) | function sm(a){var b,c,d;if(a.f==0){return 0}b=a.e<<5;c=a.b[a.e-1];if(a....
function io (line 348) | function io(a,b,c,d,e){go();if(b==0||d==0){return}b==1?(e[d]=ko(e,c,d,a[...
function en (line 349) | function en(a,b,c,d,e){var f,g;g=a;for(f=c.ab()-1;f>=0;--f){g=Ym(g,g,d,e...
function on (line 350) | function on(a,b,c){var d,e;d=qe(ue(c),yr);for(e=0;Ce(d,ur)&&e<b;++e){d=p...
function hg (line 351) | function hg(b,c,d){var a,e;try{Hf(this,Ll(b,c,d))}catch(a){a=_d(a);if(xc...
function Dg (line 352) | function Dg(a){if(a<-2147483648){throw new nk('Overflow')}else if(a>2147...
function Xn (line 353) | function Xn(a,b){Un();if(a<0){throw new Sk('Digits < 0')}if(!b){throw ne...
function Ki (line 354) | function Ki(a){Oh();if(xe(a,ur)){if(Ce(a,wr)){return new ti(-1,Be(a))}re...
function tg (line 355) | function tg(a){var b;xe(a,ur)&&(a=de(~a.l&4194303,~a.m&4194303,~a.h&1048...
function pe (line 356) | function pe(a,b){var c,d,e;c=a.l+b.l;d=a.m+b.m+(~~c>>22);e=a.h+b.h+(~~d>...
function He (line 357) | function He(a,b){var c,d,e;c=a.l-b.l;d=a.m-b.m+(~~c>>22);e=a.h-b.h+(~~d>...
function Sm (line 358) | function Sm(a,b){var c;c=b-1;if(a.f>0){while(!a.gb(c)){--c}return b-1-c}...
function fe (line 359) | function fe(a,b){if(a.h==524288&&a.m==0&&a.l==0){b&&(ae=de(0,0,0));retur...
function Ff (line 360) | function Ff(a,b){var c;if(a===b){return true}if(xc(b,16)){c=vc(b,16);ret...
function cn (line 361) | function cn(a,b,c){var d,e,f,g;f=ur;for(d=b-1;d>=0;--d){g=pe(Ee(f,32),qe...
function wm (line 362) | function wm(a,b){var c,d,e,f;c=~~b>>5;b&=31;e=a.e+c+(b==0?0:1);d=lc(Od,{...
function ue (line 363) | function ue(a){var b,c;if(a>-129&&a<128){b=a+128;oe==null&&(oe=lc(Pd,{6:...
function Ai (line 364) | function Ai(a){Oh();var b,c,d;if(a<Mh.length){return Mh[a]}c=~~a>>5;b=a&...
function ri (line 365) | function ri(a){Oh();if(a.length==0){this.f=0;this.e=1;this.b=mc(Od,{6:1}...
function Dl (line 366) | function Dl(c){if(c.length==0||c[0]>ys&&c[c.length-1]>ys){return c}var a...
function Yk (line 367) | function Yk(a){a-=~~a>>1&1431655765;a=(~~a>>2&858993459)+(a&858993459);a...
function nc (line 368) | function nc(a,b,c){if(c!=null){if(a.qI>0&&!uc(c,a.qI)){throw new qk}if(a...
function Qh (line 369) | function Qh(a,b){if(a.f>b.f){return 1}if(a.f<b.f){return -1}if(a.e>b.e){...
function Rf (line 370) | function Rf(a,b){var c;c=a.f-b;if(a.b<54){if(a.g==0){return Ig(c)}return...
function jp (line 371) | function jp(i,a){var b=i.b;for(var c in b){var d=parseInt(c,10);if(c==d)...
function np (line 372) | function np(i,a,b){var c=i.b[b];if(c){for(var d=0,e=c.length;d<e;++d){va...
function pp (line 373) | function pp(i,a,b){var c=i.b[b];if(c){for(var d=0,e=c.length;d<e;++d){va...
function Bq (line 374) | function Bq(a,b){var c,d,e,f;d=0;c=a.length-1;while(d<=c){e=d+(~~(c-d)>>...
function Pk (line 375) | function Pk(a){var b;b=_e(a);if(b>3.4028234663852886E38){return Infinity...
function Ie (line 376) | function Ie(a){if(se(a,(Qe(),Ne))){return -9223372036854775808}if(!we(a,...
function Bb (line 377) | function Bb(a,b){var c,d,e,f;e=Sb(a,yc(b.c)?wc(b.c):null);f=lc(Ud,{6:1},...
function yb (line 378) | function yb(a){var b,c,d;d=Lr;a=Dl(a);b=a.indexOf(Or);if(b!=-1){c=a.inde...
function ie (line 379) | function ie(a,b){var c,d,e;if(b<=22){c=a.l&(1<<b)-1;d=e=0}else if(b<=44)...
function Db (line 380) | function Db(b){var c=Lr;try{for(var d in b){if(d!='name'&&d!='message'&&...
function ti (line 381) | function ti(a,b){this.f=a;if(se(qe(b,zr),ur)){this.e=1;this.b=mc(Od,{6:1...
function ui (line 382) | function ui(a,b){this.f=a;if(b<4294967296){this.e=1;this.b=mc(Od,{6:1},-...
function Xm (line 383) | function Xm(a,b){var c,d;d=new ri(lc(Od,{6:1},-1,1<<b,1));d.e=1;d.b[0]=1...
function Jm (line 384) | function Jm(a){var b,c,d;b=qe(ue(a.b[0]),yr);c=sr;d=vr;do{Ce(qe(Ae(b,c),...
function Gm (line 385) | function Gm(a){var b,c,d;if(we(a,ur)){c=re(a,Ar);d=ze(a,Ar)}else{b=Ge(a,...
function ko (line 386) | function ko(a,b,c,d){go();var e,f;e=ur;for(f=0;f<c;++f){e=pe(Ae(qe(ue(b[...
function _m (line 387) | function _m(a,b,c){var d,e,f,g,i;e=c.e<<5;d=bi(a.eb(e),c);i=bi(Ai(e),c);...
function Om (line 388) | function Om(a,b,c){var d,e,f,g,i,j;d=c.bb();e=c.fb(d);g=_m(a,b,e);i=an(a...
function xb (line 389) | function xb(b,c){var a,d,e,f;for(d=0,e=b.length;d<e;++d){f=b[d];try{f[1]...
function bf (line 390) | function bf(a){var b=$e;!b&&(b=$e=/^\s*[+-]?((\d+\.?\d*)|(\.\d+))([eE][+...
function pi (line 391) | function pi(a,b){if(a==null){throw new jl}if(b<2||b>36){throw new pl('Ra...
function Vq (line 392) | function Vq(){Uq();var a,b,c;c=Tq+++(new Date).getTime();a=Bc(Math.floor...
function un (line 393) | function un(a,b,c,d){var e;if(c>d){return 1}else if(c<d){return -1}else{...
function In (line 394) | function In(a,b){var c,d,e,f;e=a.e;d=lc(Od,{6:1},-1,e,1);hl(Zh(a),Zh(b))...
function Mn (line 395) | function Mn(a,b){var c,d,e,f;e=a.e;d=lc(Od,{6:1},-1,e,1);c=hl(Zh(a),Zh(b...
function Bn (line 396) | function Bn(a,b){var c,d,e,f;e=lc(Od,{6:1},-1,a.e,1);d=hl(a.e,b.e);for(c...
function Dn (line 397) | function Dn(a,b){var c,d,e,f;e=hl(a.e,b.e);c=gl(Zh(a),Zh(b));if(c>=e){re...
function Nf (line 398) | function Nf(a,b){var c;if(b==0){return lf}if(b<0||b>999999999){throw new...
function tk (line 399) | function tk(a,b){if(b<2||b>36){return -1}if(a>=48&&a<48+(b<10?b:10)){ret...
function Uq (line 400) | function Uq(){Uq=rr;var a,b,c;Rq=lc(Nd,{6:1},-1,25,1);Sq=lc(Nd,{6:1},-1,...
function oo (line 401) | function oo(a,b){go();var c,d;d=(Oh(),Jh);c=a;for(;b>1;b>>=1){(b&1)!=0&&...
function nl (line 402) | function nl(){nl=rr;ml=mc(Md,{6:1},-1,[48,49,50,51,52,53,54,55,56,57,97,...
function rm (line 403) | function rm(a){var b,c;b=0;if(a.f==0){return 0}c=Zh(a);if(a.f>0){for(;c<...
function ne (line 404) | function ne(a,b){var c,d,e;e=a.h-b.h;if(e<0){return false}c=a.l-b.l;d=a....
function al (line 405) | function al(a){var b,c,d;b=lc(Md,{6:1},-1,8,1);c=(nl(),ml);d=7;if(a>=0){...
function vn (line 406) | function vn(a,b){if(b.f==0||a.f==0){return Oh(),Nh}if(Vh(b,(Oh(),Ih))){r...
function yn (line 407) | function yn(a,b){if(b.f==0){return a}if(a.f==0){return Oh(),Nh}if(Vh(a,(...
function Gf (line 408) | function Gf(a){var b;if(a.c!=0){return a.c}if(a.b<54){b=te(a.g);a.c=Je(q...
function vg (line 409) | function vg(a,b,c,d){var e,f,g,i,j;f=(j=a/b,j>0?Math.floor(j):Math.ceil(...
function jc (line 410) | function jc(a,b){var c=new Array(b);if(a==3){for(var d=0;d<b;++d){var e=...
function tn (line 411) | function tn(a,b,c,d,e){var f,g;f=ur;for(g=0;g<e;++g){f=pe(f,He(qe(ue(b[g...
function xm (line 412) | function xm(a,b,c,d){var e,f;if(d==0){nm(b,0,a,c,a.length-c)}else{f=32-d...
function rg (line 413) | function rg(a,b,c){if(c<hf.length&&gl(a.b,b.b+jf[Bc(c)])+1<54){return ne...
function Ue (line 414) | function Ue(a){return $stats({moduleName:$moduleName,sessionId:$sessionI...
function vm (line 415) | function vm(a,b){var c,d,e;e=a.r();if(b==0||a.r()==0){return}d=~~b>>5;a....
function ve (line 416) | function ve(a,b){var c,d;c=~~a.h>>19;d=~~b.h>>19;return c==0?d!=0||a.h>b...
function we (line 417) | function we(a,b){var c,d;c=~~a.h>>19;d=~~b.h>>19;return c==0?d!=0||a.h>b...
function Rm (line 418) | function Rm(a,b){var c,d,e;c=bl(a);d=bl(b);e=c<d?c:d;c!=0&&(a=Ge(a,c));d...
function Fn (line 419) | function Fn(a,b){if(Vh(b,(Oh(),Ih))||Vh(a,Ih)){return Ih}if(b.f==0){retu...
function sg (line 420) | function sg(a){var b,c;if(a>-140737488355328&&a<140737488355328){if(a==0...
function Yh (line 421) | function Yh(a,b){var c,d;c=a._();d=b._();if(c.r()==0){return d}else if(d...
function ci (line 422) | function ci(a,b){var c;if(b.f<=0){throw new nk(us)}if(!(a.gb(0)||b.gb(0)...
function Am (line 423) | function Am(a,b,c,d,e){var f,g,i;f=true;for(g=0;g<d;++g){f=f&c[g]==0}if(...
function Ql (line 424) | function Ql(a){var b,c,d,e;b=0;d=a.length;e=d-4;c=0;while(c<e){b=a.charC...
function Pm (line 425) | function Pm(a,b){var c,d,e,f,g;f=b.e;c=a[f]!=0;if(!c){e=b.b;c=true;for(d...
function Kf (line 426) | function Kf(a,b){var c;c=a.f+b.f;if(a.b==0&&a.g!=-1||b.b==0&&b.g!=-1){re...
function sp (line 427) | function sp(k,a,b,c){var d=k.b[c];if(d){for(var e=0,f=d.length;e<f;++e){...
function an (line 428) | function an(a,b,c){var d,e,f,g,i;g=(Oh(),Jh);e=Rh(b);d=Rh(a);a.gb(0)&&Tm...
function ar (line 429) | function ar(a,b){var c,d,e,f,g,i,j;j=zl(a,Ks,0);i=$wnd;for(g=0;g<j.lengt...
function gi (line 430) | function gi(a,b){var c;if(b<0){throw new nk('Negative exponent')}if(b==0...
function Ee (line 431) | function Ee(a,b){var c,d,e;b&=63;if(b<22){c=a.l<<b;d=a.m<<b|~~a.l>>22-b;...
function Ge (line 432) | function Ge(a,b){var c,d,e,f;b&=63;c=a.h&1048575;if(b<22){f=~~c>>>b;e=~~...
function Uo (line 433) | function Uo(a){Qo();switch(a){case 2:return Ao;case 1:return Bo;case 3:r...
function mi (line 434) | function mi(a,b){var c,d,e;if(b==0){return (a.b[0]&1)!=0}if(b<0){throw n...
function Pf (line 435) | function Pf(a){var b,c;if(a.e>0){return a.e}b=1;c=1;if(a.b<54){a.b>=1&&(...
function zh (line 436) | function zh(a){rf();var b,c;c=Lj(a);if(c==ks)b=Fg(a[0]);else if(c==ks)b=...
function Qi (line 437) | function Qi(a){Oh();var b,c;c=Lj(a);if(c==ms)b=new oi(a[0].toString());e...
function Un (line 438) | function Un(){Un=rr;On=new Xn(34,(Qo(),Eo));Pn=new Xn(7,Eo);Qn=new Xn(16...
function Jn (line 439) | function Jn(a,b){if(b.f==0){return a}if(a.f==0){return b}if(Vh(b,(Oh(),I...
function Cn (line 440) | function Cn(a,b){var c,d,e,f,g,i;d=Zh(b);e=Zh(a);if(d>=a.e){return a}g=h...
function Wf (line 441) | function Wf(a){var b,c,d,e,f;b=1;c=nf.length-1;d=a.f;if(a.b==0&&a.g!=-1)...
function jo (line 442) | function jo(a,b,c,d,e){var f,g,i,j;if(Ac(a)===Ac(b)&&d==e){qo(a,d,c);ret...
function hi (line 443) | function hi(a,b){var c,d,e,f,g;if(b.f==0){throw new nk(ss)}g=a.e;c=b.e;i...
function $k (line 444) | function $k(a){var b,c,d;if(a<0){return 0}else if(a==0){return 32}else{d...
function kn (line 445) | function kn(a,b){var c;if(a.f==0){nm(b.b,0,a.b,0,b.e)}else if(b.f==0){re...
function ln (line 446) | function ln(a,b){var c,d;c=Qh(a,b);if(a.f==0){nm(b.b,0,a.b,0,b.e);a.f=-b...
function di (line 447) | function di(a,b,c){var d,e;if(c.f<=0){throw new nk(us)}d=a;if((c.e==1&&c...
function $m (line 448) | function $m(a,b,c,d,e){var f,g,i;f=ur;g=ur;for(i=0;i<d;++i){f=(go(),pe(A...
function ho (line 449) | function ho(a,b){go();var c,d,e,f,g,i,j,k,n;if(b.e>a.e){i=a;a=b;b=i}if(b...
function le (line 450) | function le(a){var b,c,d;c=a.l;if((c&c-1)!=0){return -1}d=a.m;if((d&d-1)...
function wn (line 451) | function wn(a,b){var c,d,e,f,g,i,j;e=Zh(a);d=Zh(b);if(d>=a.e){return Oh(...
function Jf (line 452) | function Jf(a,b){if(a.b==0&&a.g!=-1){return Ig(b>0?b:0)}if(b>=0){if(a.b<...
function Fe (line 453) | function Fe(a,b){var c,d,e,f,g;b&=63;c=a.h;d=(c&524288)!=0;d&&(c|=-10485...
function Oh (line 454) | function Oh(){Oh=rr;var a;Jh=new qi(1,1);Lh=new qi(1,10);Nh=new qi(0,0);...
function lo (line 455) | function lo(a,b){go();var c,d,e,f,g,i,j,k,n;k=a.f;if(k==0){return Oh(),N...
function no (line 456) | function no(a,b){var c,d,e,f,g,i,j,k,n,o,q;d=a.e;f=b.e;i=d+f;j=a.f!=b.f?...
function Hn (line 457) | function Hn(a,b){var c,d,e,f,g,i;d=Zh(b);e=Zh(a);if(e>=b.e){return b}els...
function zm (line 458) | function zm(a,b){var c,d,e,f,g;d=~~b>>5;b&=31;if(d>=a.e){return a.f<0?(O...
function vo (line 459) | function vo(a,b){uo();var c,d;if(b<=0||a.e==1&&a.b[0]==2){return true}if...
function Qm (line 460) | function Qm(a,b){var c,d,e,f;c=a.bb();d=b.bb();e=c<d?c:d;vm(a,c);vm(b,d)...
function Sf (line 461) | function Sf(a,b,c){var d;if(!c){throw new jl}d=b-a.f;if(d==0){return a}i...
function cl (line 462) | function cl(a,b){var c,d,e,f;if(b==10||b<2||b>36){return Lr+Ke(a)}c=lc(M...
function Of (line 463) | function Of(a,b,c){var d,e,f,g,i,j;f=b<0?-b:b;g=c.b;e=Bc(fl(f))+1;i=c;if...
function tf (line 464) | function tf(a,b){var c;c=a.f-b.f;if(a.b==0&&a.g!=-1){if(c<=0){return b}i...
function Nm (line 465) | function Nm(a,b){var c,d,e,f,g;d=qe(ue(b),yr);if(we(a,ur)){f=ee(a,d,fals...
function Ei (line 466) | function Ei(a,b,c){var d,e,f,g,i,j,k,n,o,q,r,s,t,u;r=b.length;k=r;if(b.c...
function te (line 467) | function te(a){var b,c,d,e,f;if(isNaN(a)){return Qe(),Pe}if(a<-922337203...
function Ke (line 468) | function Ke(a){var b,c,d,e,f;if(a.l==0&&a.m==0&&a.h==0){return Tr}if(a.h...
function Uh (line 469) | function Uh(a,b){var c,d,e,f,g,i,j,k,n,o,q,r,s;f=b.f;if(f==0){throw new ...
function Zf (line 470) | function Zf(a){var b;if(a.f==0||a.b==0&&a.g!=-1){return !a.d&&(a.d=Li(a....
function qn (line 471) | function qn(a,b,c,d,e){var f,g;f=ur;if(c<e){for(g=0;g<c;++g){f=pe(f,He(q...
function Lm (line 472) | function Lm(a,b,c){var d,e,f,g,i,j,k,n,o,q,r,s;q=a.b;r=a.e;s=a.f;if(r==1...
function Zm (line 473) | function Zm(a,b,c){var d,e,f,g,i,j,k;i=b.b;j=b.e;k=ur;for(d=0;d<j;++d){e...
function af (line 474) | function af(a,b){var c,d,e,f;if(a==null){throw new pl(Mr)}if(b<2||b>36){...
function En (line 475) | function En(a){var b,c;if(a.f==0){return Oh(),Ih}if(Vh(a,(Oh(),Ih))){ret...
function Bg (line 476) | function Bg(a,b,c){var d;d=0;switch(c.c){case 7:if(b!=0){throw new nk(cs...
function Vf (line 477) | function Vf(a,b,c){var d,e,f,g,i,j;i=te(hf[c]);g=He(te(a.f),ue(c));j=te(...
function tm (line 478) | function tm(a,b){var c,d,e,f,g,i,j,k,n;k=a.f==0?1:a.f;g=~~b>>5;c=b&31;j=...
function wo (line 479) | function wo(a,b){var c,d,e,f,g,i,j,k,n;g=rn(a,(Oh(),Jh));c=g.ab();f=g.bb...
function Mm (line 480) | function Mm(a,b,c,d){var e,f,g,i,j,k,n;k=ur;f=qe(ue(d),yr);for(i=c-1;i>=...
function he (line 481) | function he(a,b,c,d,e,f){var g,i,j,k,n,o,q;k=ke(b)-ke(a);g=Ee(b,k);j=de(...
function dn (line 482) | function dn(a,b,c,d,e){var f,g,i,j,k,n,o;k=lc(Xd,{6:1},17,8,0);n=a;nc(k,...
function Ln (line 483) | function Ln(a,b){var c,d,e,f,g,i,j;i=gl(a.e,b.e);g=lc(Od,{6:1},-1,i,1);e...
function qo (line 484) | function qo(a,b,c){var d,e,f,g;for(e=0;e<b;++e){d=ur;for(g=e+1;g<b;++g){...
function vf (line 485) | function vf(a,b){var c,d,e,f,g,i;e=Uf(a);i=Uf(b);if(e==i){if(a.f==b.f&&a...
function If (line 486) | function If(a,b){var c,d,e,f,g,i,j;f=b.b;if((a.e>0?a.e:el((a.b-1)*0.3010...
function Yf (line 487) | function Yf(a,b,c){var d,e,f,g;d=b.f-a.f;if(b.b==0&&b.g!=-1||a.b==0&&a.g...
function rn (line 488) | function rn(a,b){var c,d,e,f,g,i,j,k,n,o;g=a.f;j=b.f;if(j==0){return a}i...
function zn (line 489) | function zn(a,b){var c,d,e,f,g,i,j;e=Zh(a);d=Zh(b);if(e>=b.e){return Oh(...
function Th (line 490) | function Th(a,b){var c,d,e,f,g,i,j,k,n,o;if(b.f==0){throw new nk(ss)}e=b...
function hn (line 491) | function hn(a,b,c,d,e){var f,g;f=pe(qe(ue(b[0]),yr),qe(ue(d[0]),yr));a[0...
function go (line 492) | function go(){go=rr;var a,b;bo=lc(Xd,{6:1},17,32,0);co=lc(Xd,{6:1},17,32...
function yf (line 493) | function yf(a,b,c,d){var e,f,g;if(!d){throw new jl}if(b.b==0&&b.g!=-1){t...
function Gn (line 494) | function Gn(a,b){var c,d,e,f,g,i,j;d=Zh(b);e=Zh(a);if(e>=b.e){return b}i...
function _f (line 495) | function _f(a){var b,c,d,e;d=Hm((!a.d&&(a.d=Li(a.g)),a.d),0);if(a.f==0||...
function ug (line 496) | function ug(a,b,c,d){var e,f,g,i,j,k,n;g=Uh(a,b);i=g[0];k=g[1];if(k.r()=...
function ag (line 497) | function ag(a){var b,c,d,e,f;if(a.i!=null){return a.i}if(a.b<32){a.i=Im(...
function xn (line 498) | function xn(a,b){var c,d,e,f,g,i,j;e=Zh(a);f=Zh(b);if(e>=b.e){return a}d...
function zl (line 499) | function zl(o,a,b){var c=new RegExp(a,'g');var d=[];var e=0;var f=o;var ...
function po (line 500) | function po(a){go();var b,c,d,e;b=Bc(a);if(a<co.length){return co[b]}els...
function $d (line 501) | function $d(){var a;!!$stats&&Ue('com.iriscouch.gwtapp.client.BigDecimal...
function Vo (line 502) | function Vo(a){Qo();var b,c,d,e,f;if(a==null){throw new jl}d=Cl(a);c=d.l...
function ni (line 503) | function ni(a,b){var d,e,f,g,i,j;Oh();var c;if(a<0){throw new Sk('numBit...
function fn (line 504) | function fn(a,b){var c,d,e,f,g,i,j,k,n,o,q,r;g=a.f;j=b.f;if(g==0){return...
function Yn (line 505) | function Yn(a){Un();var b,c,d,e;if(a==null){throw new kl('null string')}...
function Em (line 506) | function Em(){Em=rr;Cm=mc(Od,{6:1},-1,[-2147483648,1162261467,1073741824...
function uf (line 507) | function uf(a,b,c){var d,e,f,g,i;d=a.f-b.f;if(b.b==0&&b.g!=-1||a.b==0&&a...
function $f (line 508) | function $f(a){var b,c,d,e,f,g,i,j;g=Hm((!a.d&&(a.d=Li(a.g)),a.d),0);if(...
function nm (line 509) | function nm(a,b,c,d,e){var f,g,i,j,k,n,o,q,r;if(a==null||c==null){throw ...
function xo (line 510) | function xo(a){uo();var b,c,d,e,f,g,i;f=lc(Od,{6:1},-1,to.length,1);d=lc...
function Qo (line 511) | function Qo(){Qo=rr;Ho=new Ro('UP',0);Bo=new Ro('DOWN',1);Ao=new Ro('CEI...
function wf (line 512) | function wf(a,b){var c,d,e,f,g,i,j,k,n,o;k=(!a.d&&(a.d=Li(a.g)),a.d);n=(...
function ee (line 513) | function ee(a,b,c){var d,e,f,g,i,j;if(b.l==0&&b.m==0&&b.h==0){throw new ...
function An (line 514) | function An(a,b){var c,d,e,f,g,i,j,k;e=Zh(a);f=Zh(b);if(e>=b.e){return a...
function Lj (line 515) | function Lj(a){var b=[];for(var c in a){var d=typeof a[c];d!=ws?(b[b.len...
function Ae (line 516) | function Ae(a,b){var c,d,e,f,g,i,j,k,n,o,q,r,s,t,u,v,w,x,y,z,A,B,C,D,E,F...
function zf (line 517) | function zf(a,b,c){var d,e,f,g,i,j,k,n;n=Ie(pe(ue(c.b),vr))+(b.e>0?b.e:e...
function Wm (line 518) | function Wm(a,b){var c,d,e,f,g,i,j,k,n,o,q;if(a.f==0){throw new nk(vs)}i...
function Xf (line 519) | function Xf(a,b){var c;c=a.f-b.f;if(a.b==0&&a.g!=-1){if(c<=0){return Mf(...
function Df (line 520) | function Df(a,b){var c,d,e,f,g,i,j;mc(Xd,{6:1},17,[(!a.d&&(a.d=Li(a.g)),...
function Fm (line 521) | function Fm(a,b){Em();var c,d,e,f,g,i,j,k,n,o,q,r,s,t,u,v,w,x;u=a.f;o=a....
function Km (line 522) | function Km(a,b,c,d,e,f){var g,i,j,k,n,o,q,r,s,t,u,v,w,x,y,z,A;u=lc(Od,{...
function Vm (line 523) | function Vm(a,b){var c,d,e,f,g,i,j,k,n,o,q;f=gl(a.e,b.e);n=lc(Od,{6:1},-...
function We (line 524) | function We(){var c=navigator.userAgent.toLowerCase();var d=function(a){...
function Kn (line 525) | function Kn(a,b){var c,d,e,f,g,i,j,k;j=gl(b.e,a.e);e=Zh(b);f=Zh(a);if(e<...
function rf (line 526) | function rf(){rf=rr;var a,b;lf=new qg(sr,0);mf=new qg(tr,0);of=new qg(ur...
function Hf (line 527) | function Hf(a,b){var c,d,e,f,g,i,j,k,n,o;c=0;i=0;g=b.length;n=new gm(b.l...
function Im (line 528) | function Im(a,b){Em();var c,d,e,f,g,i,j,k,n,o;g=xe(a,ur);g&&(a=Be(a));if...
function Ef (line 529) | function Ef(a,b,c){var d,e,f,g,i,j,k,n,o,q,r,s,t;n=c.b;e=Pf(a)-b.q();k=n...
function Ve (line 530) | function Ve(){var a,b,c;b=$doc.compatMode;a=mc(Vd,{6:1},1,[Vr]);for(c=0;...
function Lg (line 531) | function Lg(a){rf();var b,c;c=Lj(a);if(c==is)b=new cg(new oi(a[0].toStri...
function uo (line 532) | function uo(){uo=rr;var a;ro=mc(Od,{6:1},-1,[0,0,1854,1233,927,747,627,5...
function Xj (line 533) | function Xj(){nr(rs,Lr);if($wnd.bigdecimal.MathContext){var b=$wnd.bigde...
function Hm (line 534) | function Hm(a,b){Em();var c,d,e,f,g,i,j,k,n,o,q,r,s,t,u,v,w,x,y,z,A,B,C,...
function jk (line 535) | function jk(){nr(rs,Lr);if($wnd.bigdecimal.RoundingMode){var c=$wnd.bigd...
function Hj (line 536) | function Hj(){nr(rs,Lr);if($wnd.bigdecimal.BigInteger){var d=$wnd.bigdec...
function Dh (line 537) | function Dh(){nr(rs,Lr);if($wnd.bigdecimal.BigDecimal){var c=$wnd.bigdec...
function fix_and_export (line 549) | function fix_and_export(class_name) {
FILE: perf/lib/bigdecimal_ICU4J/BigDecimal-all-last.js
function MathContext (line 482) | function MathContext() {
function getDigits (line 552) | function getDigits() {
function getForm (line 568) | function getForm() {
function getLostDigits (line 583) | function getLostDigits() {
function getRoundingMode (line 605) | function getRoundingMode() {
function toString (line 648) | function toString() {
function isValidRound (line 680) | function isValidRound(testround) {
function div (line 804) | function div(a, b) {
function arraycopy (line 810) | function arraycopy(src, srcindex, dest, destindex, length) {
function createArrayWithZeros (line 827) | function createArrayWithZeros(length) {
function BigDecimal (line 1375) | function BigDecimal() {
function abs (line 1922) | function abs() {
function add (line 1980) | function add() {
function compareTo (line 2282) | function compareTo() {
function divide (line 2465) | function divide() {
function divideInteger (line 2540) | function divideInteger() {
function max (line 2602) | function max() {
function min (line 2666) | function min() {
function multiply (line 2727) | function multiply() {
function negate (line 2878) | function negate() {
function plus (line 2943) | function plus() {
function pow (line 3034) | function pow() {
function remainder (line 3172) | function remainder() {
function subtract (line 3229) | function subtract() {
function equals (line 3358) | function equals(obj) {
function format (line 3598) | function format() {
function intValueExact (line 3906) | function intValueExact() {
function movePointLeft (line 4091) | function movePointLeft(n) {
function movePointRight (line 4123) | function movePointRight(n) {
function scale (line 4144) | function scale() {
function setScale (line 4216) | function setScale() {
function signum (line 4312) | function signum() {
function toString (line 4445) | function toString() {
function layout (line 4578) | function layout() {
function intcheck (line 4735) | function intcheck(min, max) {
function dodivide (line 4795) | function dodivide(code, rhs, set, scale) {
function bad (line 5115) | function bad(prefix, s) {
function badarg (line 5125) | function badarg(name, pos, value) {
function extend (line 5137) | function extend(inarr, newlen) {
function byteaddsub (line 5185) | function byteaddsub(a, avlen, b, bvlen, m, reuse) {
function diginit (line 5303) | function diginit() {
function clone (line 5335) | function clone(dec) {
function checkdigits (line 5352) | function checkdigits(rhs, dig) {
function round (line 5389) | function round() {
function allzero (line 5551) | function allzero(array, start) {
function finish (line 5582) | function finish(set, strip) {
function isGreaterThan (line 5689) | function isGreaterThan(other) {
function isLessThan (line 5692) | function isLessThan(other) {
function isGreaterThanOrEqualTo (line 5695) | function isGreaterThanOrEqualTo(other) {
function isLessThanOrEqualTo (line 5698) | function isLessThanOrEqualTo(other) {
function isPositive (line 5701) | function isPositive() {
function isNegative (line 5704) | function isNegative() {
function isZero (line 5707) | function isZero() {
FILE: test/methods/BigNumber.js
function tx (line 9) | function tx(fn, msg){
FILE: test/methods/absoluteValue.js
function t (line 5) | function t(expected, value){
FILE: test/methods/clone.js
function t (line 5) | function t(value) {
FILE: test/methods/comparedTo.js
function isMinusZero (line 8) | function isMinusZero(n) {
function t (line 12) | function t(a, b, expected) {
FILE: test/methods/config.js
function t (line 6) | function t(expected, value){
function tx (line 10) | function tx(fn, msg){
FILE: test/methods/decimalPlaces.js
function tx (line 1967) | function tx(fn, msg){
FILE: test/methods/dividedBy.js
function t (line 8) | function t(dividend, divisor, expected, dp, rm) {
FILE: test/methods/dividedToIntegerBy.js
function t (line 8) | function t(dividend, divisor, expected) {
FILE: test/methods/integerValue.js
function t (line 6) | function t(expected, value, roundingMode) {
FILE: test/methods/isBigNumber.js
function t (line 5) | function t(expected, value){
FILE: test/methods/isMethods.js
function t (line 19) | function t(expected, value) {
FILE: test/methods/minmax.js
function isMinusZero (line 19) | function isMinusZero(x) {
function isPositiveZero (line 31) | function isPositiveZero(x) {
FILE: test/methods/minus.js
function t (line 8) | function t(minuend, subtrahend, expected) {
FILE: test/methods/modulo.js
function t (line 8) | function t(a, b, expected) {
FILE: test/methods/multipliedBy.js
function t (line 8) | function t(multiplicand, multiplier, expected) {
FILE: test/methods/negated.js
function t (line 5) | function t(expected, value){
FILE: test/methods/plus.js
function t (line 8) | function t(addendA, addendB, expected) {
FILE: test/methods/shiftedBy.js
function t (line 5) | function t(expected, n, k) {
FILE: test/methods/sum.js
function t (line 5) | function t(expected, value){
FILE: test/methods/toExponential.js
function t (line 6) | function t(expected, value, decimalPlaces){
FILE: test/methods/toFixed.js
function t (line 7) | function t(expected, value, decimalPlaces){
FILE: test/methods/toFormat.js
function t (line 5) | function t(expected, value, dp){
FILE: test/methods/toFraction.js
function t (line 6) | function t(expected, value, maxDenominator){
FILE: test/methods/toNumber.js
function isMinusZero (line 5) | function isMinusZero(n) {
function t (line 9) | function t(value, n) {
FILE: test/methods/toObject.js
function t (line 5) | function t(value, expectedC, expectedE, expectedS) {
FILE: test/methods/toPrecision.js
function t (line 6) | function t(expected, value, precision){
FILE: test/methods/toString.js
function t (line 6) | function t(expected, value, base) {
FILE: test/tester.js
function Test (line 5) | function Test(name, tests) {
Condensed preview — 72 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (5,706K chars).
[
{
"path": ".gitattributes",
"chars": 57,
"preview": "# Enforce LF normalization for all text files\n* text=auto"
},
{
"path": ".github/workflows/ci.yml",
"chars": 1032,
"preview": "name: CI\n\non:\n push:\n branches: [main]\n pull_request:\n branches: [main]\n\njobs:\n test:\n name: Test on Node.js"
},
{
"path": ".gitignore",
"chars": 146,
"preview": "node_modules/\ncoverage/\nnpm-debug.log*\nyarn-debug.log*\nyarn-error.log*\npackage-lock.json\nnpm-shrinkwrap.json\n.env\n.vscod"
},
{
"path": "CHANGELOG.md",
"chars": 10149,
"preview": "#### 10.0.2\n\n* 24/02/26\n* Reinstate *README.md* links.\n\n#### 10.0.1\n\n* 24/02/26\n* Commit *dist* folder.\n\n#### 10.0.0\n\n* "
},
{
"path": "LICENCE.md",
"chars": 1112,
"preview": "The MIT License (MIT)\n=====================\n\nCopyright © `<2026>` `Michael Mclaughlin`\n\nPermission is hereby granted, fr"
},
{
"path": "README.md",
"chars": 12335,
"preview": "\n\nA JavaScript library f"
},
{
"path": "bignumber.d.ts",
"chars": 64164,
"preview": "// Type definitions for bignumber.js >=8.1.0\n// Project: https://github.com/MikeMcl/bignumber.js\n// Definitions by: Mich"
},
{
"path": "bignumber.js",
"chars": 80774,
"preview": "/*\n * bignumber.js v10.0.2\n * A JavaScript library for arbitrary-precision arithmetic.\n * https://github."
},
{
"path": "build.js",
"chars": 1809,
"preview": "// Requires Node ≥ 14.14.0 for `fs.rmSync({ recursive: true })`.\nconst {\n existsSync: exists,\n rmSync: rm,\n mkdirSync"
},
{
"path": "dist/bignumber.cjs",
"chars": 80860,
"preview": "/*\n * bignumber.js v10.0.1\n * A JavaScript library for arbitrary-precision arithmetic.\n * https://github."
},
{
"path": "dist/bignumber.d.cts",
"chars": 64185,
"preview": "// Type definitions for bignumber.js >=8.1.0\n// Project: https://github.com/MikeMcl/bignumber.js\n// Definitions by: Mich"
},
{
"path": "dist/bignumber.d.mts",
"chars": 64214,
"preview": "// Type definitions for bignumber.js >=8.1.0\n// Project: https://github.com/MikeMcl/bignumber.js\n// Definitions by: Mich"
},
{
"path": "dist/bignumber.d.ts",
"chars": 64164,
"preview": "// Type definitions for bignumber.js >=8.1.0\n// Project: https://github.com/MikeMcl/bignumber.js\n// Definitions by: Mich"
},
{
"path": "dist/bignumber.js",
"chars": 80917,
"preview": "(function() {\n/*\n * bignumber.js v10.0.1\n * A JavaScript library for arbitrary-precision arithmetic.\n * h"
},
{
"path": "dist/bignumber.mjs",
"chars": 80824,
"preview": "/*\n * bignumber.js v10.0.1\n * A JavaScript library for arbitrary-precision arithmetic.\n * https://github."
},
{
"path": "doc/API.html",
"chars": 83561,
"preview": "<!DOCTYPE HTML>\n<html>\n<head>\n<meta charset=\"utf-8\">\n<meta http-equiv=\"X-UA-Compatible\" content=\"IE=edge\">\n<meta name=\"A"
},
{
"path": "package.json",
"chars": 1609,
"preview": "{\n \"name\": \"bignumber.js\",\n \"description\": \"A library for arbitrary-precision decimal and non-decimal arithmetic\",\n \""
},
{
"path": "perf/README.md",
"chars": 2353,
"preview": "Legacy programs: These tools are old but still work and can be useful for testing and cross-checking BigNumber results o"
},
{
"path": "perf/bignumber-vs-bigdecimal.html",
"chars": 20231,
"preview": "<!DOCTYPE html>\n<html lang='en'>\n<head>\n <meta charset='utf-8' />\n <meta name=\"Author\" content=\"M Mclaughlin\">\n <titl"
},
{
"path": "perf/bigtime-OOM.js",
"chars": 11526,
"preview": "\nvar arg, i, max, method, methodIndex, decimalPlaces,\n reps, rounding, start, timesEqual, Xs, Ys,\n bdM, bdMT, bdOT"
},
{
"path": "perf/bigtime.js",
"chars": 11057,
"preview": "\nvar arg, i, j, max, method, methodIndex, decimalPlaces, rounding, reps, start,\n timesEqual, xs, ys, prevRss, prevHe"
},
{
"path": "perf/lib/bigdecimal_GWT/BigDecTest.java",
"chars": 1397,
"preview": "// javac BigDecTest.java\n// java BigDecTest\n\nimport java.math.BigDecimal;\n\npublic class BigDecTest\n{\n public static v"
},
{
"path": "perf/lib/bigdecimal_GWT/LICENCE.txt",
"chars": 11474,
"preview": "https://github.com/iriscouch/bigdecimal.js\n\nBigDecimal for Javascript is licensed under the Apache License, version 2.0:"
},
{
"path": "perf/lib/bigdecimal_GWT/bigdecimal.js",
"chars": 111757,
"preview": "\n(function(exports) {\n\nif(typeof document === 'undefined')\n var document = {};\n\nif(typeof window === 'undefined')\n var"
},
{
"path": "perf/lib/bigdecimal_GWT/bugs.js",
"chars": 1252,
"preview": "// node bugs\n// Compare with BigDecTest.java\n\nvar i, x, y, r,\n BigDecimal = require('./bigdecimal').BigDecimal;\n\n// r"
},
{
"path": "perf/lib/bigdecimal_ICU4J/BigDecimal-all-last.js",
"chars": 198202,
"preview": "/** @license Copyright (c) 2012 Daniel Trebbien and other contributors\nPortions Copyright (c) 2003 STZ-IDA and PTV AG, K"
},
{
"path": "perf/lib/bigdecimal_ICU4J/LICENCE.txt",
"chars": 3459,
"preview": "Copyright (c) 2012 Daniel Trebbien and other contributors\nPortions Copyright (c) 2003 STZ-IDA and PTV AG, Karlsruhe, Ger"
},
{
"path": "test/console-errors.html",
"chars": 20214,
"preview": "<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n <meta charset=\"utf-8\" />\n <title>BigNumber Errors</title>\n <script src='.."
},
{
"path": "test/methods/BigNumber.js",
"chars": 47075,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('bigNumber', function () {\n\n var t = function (expected,"
},
{
"path": "test/methods/absoluteValue.js",
"chars": 42882,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('absoluteValue', function () {\n\n function t(expected, va"
},
{
"path": "test/methods/clone.js",
"chars": 1266,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('clone', function () {\n\n function t(value) {\n Tes"
},
{
"path": "test/methods/comparedTo.js",
"chars": 265657,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('comparedTo', function () {\n var n = 'null',\n N ="
},
{
"path": "test/methods/config.js",
"chars": 11077,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('config', function () {\n var MAX = 1e9;\n\n function t("
},
{
"path": "test/methods/decimalPlaces.js",
"chars": 220488,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('decimalPlaces', function () {\n var MAX = 1e9;\n\n Test"
},
{
"path": "test/methods/dividedBy.js",
"chars": 196213,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('dividedBy', function () {\n var n = 'null',\n N = "
},
{
"path": "test/methods/dividedToIntegerBy.js",
"chars": 134633,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('dividedToIntegerBy', function () {\n var n = 'null',\n "
},
{
"path": "test/methods/exponentiatedBy.js",
"chars": 125785,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('exponentiatedBy', function () {\n\n var t = function (exp"
},
{
"path": "test/methods/integerValue.js",
"chars": 60848,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('integerValue', function () {\n var MAX = 1e9;\n\n funct"
},
{
"path": "test/methods/isBigNumber.js",
"chars": 3854,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('isBigNumber', function () {\n\n function t(expected, valu"
},
{
"path": "test/methods/isMethods.js",
"chars": 11562,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('`is` methods', function () {\n var n;\n\n // isEqualTo"
},
{
"path": "test/methods/minmax.js",
"chars": 6145,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('minimum and maximum', function () {\n\n var t = function "
},
{
"path": "test/methods/minus.js",
"chars": 277717,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('minus', function () {\n var n = 'null',\n N = 'NaN"
},
{
"path": "test/methods/modulo.js",
"chars": 239520,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('modulo', function () {\n var n = 'null',\n N = 'Na"
},
{
"path": "test/methods/multipliedBy.js",
"chars": 353039,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('multipliedBy', function () {\n var n = 'null',\n N"
},
{
"path": "test/methods/negated.js",
"chars": 14818,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('negated', function () {\n\n function t(expected, value){\n"
},
{
"path": "test/methods/plus.js",
"chars": 275406,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('plus', function () {\n var n = 'null',\n N = 'NaN'"
},
{
"path": "test/methods/precision.js",
"chars": 693183,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('precision', function () {\n var MAX = 1e9;\n\n Test.are"
},
{
"path": "test/methods/random.js",
"chars": 2045,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('random', function () {\n var dp, i, msg, r;\n\n BigNumb"
},
{
"path": "test/methods/shiftedBy.js",
"chars": 2599,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('shiftedBy', function () {\n\n function t(expected, n, k) "
},
{
"path": "test/methods/squareRoot.js",
"chars": 70254,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('squareRoot', function () {\n\n var t = function (root, va"
},
{
"path": "test/methods/sum.js",
"chars": 534,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('sum', function () {\n\n function t(expected, value){\n "
},
{
"path": "test/methods/toExponential.js",
"chars": 55461,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toExponential', function () {\n var MAX = 1e9;\n\n func"
},
{
"path": "test/methods/toFixed.js",
"chars": 95313,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toFixed', function () {\n var u;\n var MAX = 1e9;\n\n "
},
{
"path": "test/methods/toFormat.js",
"chars": 6157,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toFormat', function () {\n\n function t(expected, value, "
},
{
"path": "test/methods/toFraction.js",
"chars": 352430,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toFraction', function () {\n var u;\n\n function t(expe"
},
{
"path": "test/methods/toNumber.js",
"chars": 1796,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toNumber', function () {\n\n function isMinusZero(n) {\n "
},
{
"path": "test/methods/toObject.js",
"chars": 2791,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toObject', function () {\n\n function t(value, expectedC,"
},
{
"path": "test/methods/toPrecision.js",
"chars": 50209,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toPrecision', function () {\n var MAX = 1e9;\n\n functi"
},
{
"path": "test/methods/toString.js",
"chars": 906423,
"preview": "if (typeof Test === 'undefined') require('../tester');\n\nTest('toString', function () {\n //var alphabet = '0123456789a"
},
{
"path": "test/methods.html",
"chars": 2416,
"preview": "<!DOCTYPE html>\n<html lang='en'>\n<head>\n <meta charset='utf-8' />\n <meta name='description' content='Loads selected me"
},
{
"path": "test/test.html",
"chars": 2019,
"preview": "<!DOCTYPE html>\n<html lang='en'>\n<head>\n <meta charset='utf-8' />\n <meta name='description' content='Runs the full bro"
},
{
"path": "test/test.js",
"chars": 1011,
"preview": "var time = process.hrtime(),\n passed = 0,\n total = 0;\n\nconsole.log('\\n Testing bignumber.js\\n');\n\n[\n 'absoluteValue',"
},
{
"path": "test/tester.js",
"chars": 2158,
"preview": "// Add `Test` to global scope in browser and Node.js using unqualified identifier assignment.\nTest = (function () {\n va"
},
{
"path": "test/typescript/README.md",
"chars": 490,
"preview": "In CJS mode (i.e. when the pkg.json does not have type: module) the following does not import the namespace correctly\nim"
},
{
"path": "test/typescript/test_default_import.ts",
"chars": 146,
"preview": "import BigNumber from \"bignumber.js\";\n\nconst v: BigNumber.Value = 42;\nconst x: BigNumber.Instance = new BigNumber(v);\n\nc"
},
{
"path": "test/typescript/test_global.ts",
"chars": 107,
"preview": "const n: BigNumber.Value = 3;\n\nconst x: BigNumber.Instance = new BigNumber(n);\n\nconsole.log(x.toString());\n"
},
{
"path": "test/typescript/test_named_import.ts",
"chars": 150,
"preview": "import { BigNumber } from \"bignumber.js\";\n\nconst v: BigNumber.Value = 42;\nconst x: BigNumber.Instance = new BigNumber(v)"
},
{
"path": "test/typescript/test_require.ts",
"chars": 152,
"preview": "import BigNumber = require(\"bignumber.js\");\n\nconst n: BigNumber.Value = 3;\n\nconst x: BigNumber.Instance = new BigNumber("
},
{
"path": "test/typescript/tsconfig.base.json",
"chars": 119,
"preview": "{\n \"compilerOptions\": {\n \"target\": \"esnext\",\n \"strict\": true,\n \"noEmit\": true,\n \"skipLibCheck\": true\n }\n}"
},
{
"path": "test/typescript/tsconfig.cjs.json",
"chars": 279,
"preview": "{\n \"extends\": \"./tsconfig.base.json\",\n \"compilerOptions\": {\n \"module\": \"commonjs\",\n \"allowSyntheticDefaultImport"
},
{
"path": "test/typescript/tsconfig.esm.json",
"chars": 240,
"preview": "{\n \"extends\": \"./tsconfig.base.json\",\n \"compilerOptions\": {\n \"module\": \"esnext\",\n \"paths\": {\n \"bignumber.js"
},
{
"path": "test/typescript/tsconfig.global.json",
"chars": 161,
"preview": "{\n \"extends\": \"./tsconfig.base.json\",\n \"compilerOptions\": {\n \"module\": \"none\",\n },\n \"files\": [\n \"../../dist/bi"
}
]
About this extraction
This page contains the full source code of the MikeMcl/bignumber.js GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 72 files (5.4 MB), approximately 1.4M tokens, and a symbol index with 657 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.