# two-product

> Multiplies two floating point numbers together producing a non-overlapping increasing sequence of floats

Latest version **1.0.2** (published 2014-05-05) · MIT license · 0 weekly downloads

## Install

```sh
npm install two-product
pnpm add two-product
yarn add two-product
bun add two-product
```

## Health

**Score 15/100 (F)** — status: abandoned.

Positive: no vulnerabilities.

Warnings: low downloads; no types; no esm support.

Negative: abandoned; low maintenance score.

## Facts

| | |
|---|---|
| Version | 1.0.2 |
| Published | 2014-05-05 |
| First published | 2013-09-18 |
| Weekly downloads | 0 |
| License | MIT |
| TypeScript types | none |
| Module format | CommonJS |
| Dependencies | 0 |
| Known vulnerabilities | 0 |
| Install scripts | no |
| GitHub stars | 4 |
| Author | Mikola Lysenko |
| Maintainers | mikolalysenko |
| Keywords | robust, float, multiply, product, shewchuk |

## Links

- npm: https://www.npmjs.com/package/two-product
- Repository: https://github.com/mikolalysenko/two-product
- Issues: https://github.com/mikolalysenko/two-product/issues
- npm.io page: https://npm.io/package/two-product

## Recent versions

- 1.0.2 (latest) — 2014-05-05
- 1.0.1 — 2014-05-01
- 1.0.0 — 2014-04-27
- 0.0.1 — 2013-10-23
- 0.0.0 — 2013-09-18

## README

two-product
===========
Computes the product of two floating point numbers as a 2-term nonoverlapping increasing sequence.

## Install

```
npm install two-product
```
		
## Example

```javascript
var twoProduct = require("two-product")

console.log(twoProduct(1 + Math.pow(2, -52), Math.pow(2, 52) + 1))
```

Output:

```javascript
[ 2.220446049250313e-16, 4503599627370498 ]
```

## API

### `require("two-product")(a, b[, result])`
Multiplies `a` and `b` and returns the product as a non-overlapping sequence.  `result` is an optional length 2 array that stores the result.

* `a` is a number
* `b` is a number
* `result` is an optional length 2 array that gets the result of multiplying `a` and `b`

**Returns** A length 2 array representing the product of `a` and `b` as an expansion.  The first entry is the lower order bits, and the second entry is the upper order bits.

**Note** This algorithm does not work correctly with denormalized numbers.

## Credits
JavaScript implementation (c) 2013-2014 Mikola Lysenko.  Based on ideas from Jonathan Shewchuk's [robust adaptive geometric predicates](http://www.cs.cmu.edu/~quake/robust.html).

---
_Source: https://npm.io/package/two-product · Machine-readable twin of the npm.io package page. Health data is recomputed on every publish._