JSPM

  • ESM via JSPM
  • ES Module Entrypoint
  • Export Map
  • Keywords
  • License
  • Repository URL
  • TypeScript Types
  • README
  • Created
  • Published
  • Downloads 3
  • Score
    100M100P100Q72960F
  • License MIT

modulo - floored division implementation.

Package Exports

  • modulo-x

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (modulo-x) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

Travis status Dependency status devDependency status npm version jsDelivr hits bettercodehub score Coverage Status

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

Param Type Description
dividend number The integer to find the remainder of.
divisor number The 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)