robust-dot-product

WebJar for robust-dot-product

License

License

MIT
GroupId

GroupId

org.webjars.npm
ArtifactId

ArtifactId

robust-dot-product
Last Version

Last Version

1.0.0
Release Date

Release Date

Type

Type

jar
Description

Description

robust-dot-product
WebJar for robust-dot-product
Project URL

Project URL

http://webjars.org
Source Code Management

Source Code Management

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

Download robust-dot-product

How to add to project

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

Dependencies

compile (2)

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

Project Modules

There are no modules declared in this project.

robust-dot-product

Exactly computes the dot product between vectors as an nonoverlapping increasing sequence.

Install

npm install robust-dot-product

Example

var robustDot = require("robust-dot-product")

robustDot([2, 3], [4, 5])

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

Computes the dot product of a and b as a nonoverlapping increasing sequence

  • a, b are both arrays of numbers

Returns A nonoverlapping increasing sequence representing the dot product of a and b

Credits

(c) 2013 Mikola Lysenko. MIT License

Versions

Version
1.0.0