Computes the greatest common divisor (gcd).
Manipulates bits, nibbles, bytes, and buffers.
compute the greatest common divisor using euclid's algorithm
Compute the greatest common divisor (gcd).
A Long class for representing a 64-bit two's-complement integer value.
A Long class for representing a 64-bit two's-complement integer value.
Bitwise XOR between two Buffers or Strings, returns a Buffer
🐊Putout plugin adds ability to convert bitwice to logical operator
A library for approximate string matching.
CLI for sharp.
Compares JS strings using UTF-8 bitwise semantics
🐊Putout plugin adds ability to transform logical expressions
Calculates the greatest common divisor of two integers.
Provides an enum of all possible VNode Flags used when calling Inferno.createVNode
Homebridge plugin for Amazon Blink security cameras
TypeScript definitions for compute-gcd
A simple module for bitwise operations on buffers.
Optimized 2d/3d/4d and arbitrary length vector operations, support for memory mapping/layouts
A simple module for bitwise-xor on buffers
Generate, and decode, base64 VLQ mappings for source maps and other uses
Powerful mathematics and statistics library for JavaScript.
date & time util toolset
A Long class for representing a 64-bit two's-complement integer value.
A browserify implementation of node-bignum