❤

npm

Search results

20 packages found

Sort by: Default

Default
Most downloaded this week
Most downloaded this month
Most dependents
Recently published

compute-gcd

Computes the greatest common divisor (gcd).

published version 1.2.1, 4 years ago20 dependents

2,890,965

compute-lcm

Computes the least common multiple (lcm).

published version 1.1.2, 4 years ago10 dependents

2,889,707

gcd

compute the greatest common divisor using euclid's algorithm

published version 0.0.1, 11 years ago13 dependents licensed under $MIT

111,718

@stdlib/math-base-special-gcd

Compute the greatest common divisor (gcd).

published version 0.3.0, 4 months ago4 dependents licensed under $Apache-2.0

18,596

euclidean-distance

Calculate the Euclidean distance been two points in 2D/3D/nD space.

published version 1.0.0, 9 years ago14 dependents licensed under $MIT

4,464

math-hypot

Computes the square root of a sum of squares.

published version 1.0.0, 9 years ago1 dependents licensed under $MIT

137

geometry

JavaScript library for working with objects in a two-dimensional coordinate system.

published version 0.1.0, 13 years ago3 dependents licensed under $MIT

133

@stdlib/math-base-special-hypot

Compute the hypotenuse avoiding overflow and underflow.

published version 0.2.2, 4 months ago2 dependents licensed under $Apache-2.0

119

@stdlib/math-base-special-fast-hypot

Compute the hypotenuse.

published version 0.3.0, 4 months ago1 dependents licensed under $Apache-2.0

114

@stdlib/math-base-special-fast-alpha-max-plus-beta-min

Compute the hypotenuse using the alpha max plus beta min algorithm.

published version 0.3.0, 4 months ago1 dependents licensed under $Apache-2.0

97

@euclidprotocol/graphql-codegen

Euclid Graphql Codegen for React and Nodejs

published version 1.0.3, a month ago0 dependents licensed under $ISC

96

base100

This library provides a simple way to do math operations in base 100

published version 1.0.7, 9 months ago0 dependents licensed under $ISC

71

@stdlib/math-base-special-lcm

Compute the least common multiple (lcm).

published version 0.3.0, 4 months ago1 dependents licensed under $Apache-2.0

66

@stdlib/math-base-special-hypotf

Compute the hypotenuse avoiding overflow and underflow (single-precision).

published version 0.2.2, 4 months ago2 dependents licensed under $Apache-2.0

49

euclidean-rhythms

Calculates the patterns based on the euclidean/bjorklund's algorithm

published version 3.1.1, 2 years ago1 dependents licensed under $MIT

51

pythagorean-triples

Generate Pythagorean triples using Euclid's formula

published version 1.6.0, 9 years ago0 dependents licensed under $ISC

22

glsl-gcd

glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.

published version 1.0.1, 6 years ago0 dependents licensed under $MIT

12

extgcd

Compute the gcd and solve Bezout's identity using the extended Euclidean algorithm.

published version 1.0.0, 6 years ago0 dependents licensed under $MIT

8

thaw-gcd

Euclid's greatest common divisor algorithm as a JavaScript component

tom-weatherhead

published version 0.0.0, 7 years ago0 dependents licensed under $MIT

3

@euclid/clamp

Constrain a value to lie between two further values

published version 1.0.0-alpha.0, 6 years ago0 dependents licensed under $MIT

1