robust-product

WebJar for robust-product

License

License

MIT
GroupId

GroupId

org.webjars.npm
ArtifactId

ArtifactId

robust-product
Last Version

Last Version

1.0.0
Release Date

Release Date

Type

Type

jar
Description

Description

robust-product
WebJar for robust-product
Project URL

Project URL

http://webjars.org
Source Code Management

Source Code Management

https://github.com/mikolalysenko/robust-product

Download robust-product

How to add to project

<!-- https://jarcasting.com/artifacts/org.webjars.npm/robust-product/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>robust-product</artifactId>
    <version>1.0.0</version>
</dependency>
// https://jarcasting.com/artifacts/org.webjars.npm/robust-product/
implementation 'org.webjars.npm:robust-product:1.0.0'
// https://jarcasting.com/artifacts/org.webjars.npm/robust-product/
implementation ("org.webjars.npm:robust-product:1.0.0")
'org.webjars.npm:robust-product:jar:1.0.0'
<dependency org="org.webjars.npm" name="robust-product" rev="1.0.0">
  <artifact name="robust-product" type="jar" />
</dependency>
@Grapes(
@Grab(group='org.webjars.npm', module='robust-product', version='1.0.0')
)
libraryDependencies += "org.webjars.npm" % "robust-product" % "1.0.0"
[org.webjars.npm/robust-product "1.0.0"]

Dependencies

compile (2)

Group / Artifact Type Version
org.webjars.npm : robust-scale jar [1.0.0,2)
org.webjars.npm : robust-sum jar [1.0.0,2)

Project Modules

There are no modules declared in this project.

robust-product

Computes the product of two non-overlapping increasing sequences exactly.

Install

npm install robust-product

Example

var robustProduct = require("robust-product")

var a = [ Math.pow(2, -50), Math.pow(2, 50) ]

var b = robustProduct(a,a)

//Now:
//
//    b == [ Math.pow(2, -100), 2.0, Math.pow(2, 100) ]
//

API

require("robust-product")(a, b)

Multiplies a and b together exactly.

  • a, b are both non-overlapping increasing sequences

Returns A non-overlapping increasing sequence representing the product of a and b

Credits

(c) 2013 Mikola Lysenko. MIT License

Versions

Version
1.0.0