2.1.1 • Published 5 years ago

modulo-x v2.1.1

Weekly downloads
3
License
MIT
Repository
github
Last release
5 years ago

modulo-x

modulo - floored division implementation.

module.exports(dividend, divisor)number

The notation “x modulo y” (y must be finite and nonzero) computes a value k of the same sign as y (or zero) such that abs(k) < abs(y) and x-k = q × y for some integer q.

Donald Knuth described floored division where the quotient is defined by the floor function q = ⌊a/n⌋ and thus according to equation the remainder would have the same sign as the divisor. Due to the floor function, the quotient is always rounded downwards, even if it is already negative.

Kind: Exported function
Returns: number - The integer remainder.
See

ParamTypeDescription
dividendnumberThe integer to find the remainder of.
divisornumberThe integer to divide by.

Example

import modulo from 'modulo-x';

console.log(modulo(1, 0x1000000)); // 1
console.log(modulo(-1, 0x1000000)); // 16777215 (2^24-1)
2.1.1

5 years ago

2.1.0

5 years ago

2.0.23

5 years ago

2.0.22

5 years ago

2.0.21

5 years ago

2.0.20

5 years ago

2.0.19

5 years ago

2.0.18

5 years ago

2.0.17

5 years ago

2.0.16

5 years ago

2.0.15

5 years ago

2.0.14

5 years ago

2.0.13

5 years ago

2.0.12

5 years ago

2.0.11

5 years ago

2.0.10

5 years ago

2.0.9

5 years ago

2.0.8

5 years ago

2.0.7

5 years ago

2.0.6

5 years ago

2.0.5

5 years ago

2.0.4

5 years ago

2.0.3

5 years ago

2.0.2

5 years ago

2.0.1

5 years ago

2.0.0

5 years ago

1.1.1

7 years ago

1.1.0

7 years ago

1.0.0

7 years ago