two-sum

WebJar for two-sum

License	MIT
GroupId	org.webjars.npm
ArtifactId	two-sum
Last Version	1.0.0
Release Date	Mar 10, 2018
Type	jar
Description	two-sum WebJar for two-sum
Project URL	http://webjars.org
Source Code Management	https://github.com/mikolalysenko/two-sum

Download two-sum

Filename	Size
two-sum-1.0.0.pom
two-sum-1.0.0.jar	5 KB
two-sum-1.0.0-sources.jar	22 bytes
two-sum-1.0.0-javadoc.jar	22 bytes

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/org.webjars.npm/two-sum/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>two-sum</artifactId>
    <version>1.0.0</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/org.webjars.npm/two-sum/
implementation 'org.webjars.npm:two-sum:1.0.0'

Gradle Kotlin

// https://jarcasting.com/artifacts/org.webjars.npm/two-sum/
implementation ("org.webjars.npm:two-sum:1.0.0")

Apache Buildr

'org.webjars.npm:two-sum:jar:1.0.0'

Apache Ivy

<dependency org="org.webjars.npm" name="two-sum" rev="1.0.0">
  <artifact name="two-sum" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='org.webjars.npm', module='two-sum', version='1.0.0')
)

Scala SBT

libraryDependencies += "org.webjars.npm" % "two-sum" % "1.0.0"

Leiningen

[org.webjars.npm/two-sum "1.0.0"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

two-sum

Computes the sum of two floating point numbers as a non-overlapping sequence using Knuth's method.

• D.E. Knuth. "The Art of Computer Programming: Seminumerical Algorithms". Volume 2. 1981

Install

Using npm:

	npm install two-sum

Example

var twoSum = require("two-sum")

//Add two wildly different sized floats
var result = twoSum(1e64, 1e-64)
console.log(result)

//Prints:
//  [1e-64, 1e64]

API

require("two-sum")(a, b[, result])

Computes a non-overlapping sequence representing the sum of a and b.

• a is a number
• b is a number
• result is an optional length 2 array encoding the result of the sum of a and b

Returns A length 2 array representing the non-overlapping sequence encoding the sum of a and b. The first term has smaller magnitude than the second.

Credits

Based on an idea from JRS robust geometric predicates paper.

Implementation (c) 2013 Mikola Lysenko. MIT License

Versions

Version
1.0.0 Mar 10, 2018