modulo - floored division implementation.
zlib port to javascript - fast, modularized, with browser support
Reads / writes floats / doubles from / to buffers in both modern and ancient browsers.
Cryptographically secure pseudo-random token of n digits
Tests whether one path is inside another path
Stringify your JSON at max speed
UI utilities
A library to create readable "multipart/form-data" streams. Can be used to submit forms and file uploads to other web applications.
Reactive Extensions for modern JavaScript
An iteration of the Node.js core streams with a series of improvements
Fastest random ID and random string generation for Node.js
A utility to work with tsconfig.json without typescript
Stable JS value hash.
modulo of a number and a divisor
A little library for asserting types and values, with zero dependencies.
Json Schema Type Builder with Static Type Resolution for TypeScript
Big number implementation in pure javascript
babel module loader for webpack
Color string parser
High-performance Base64 encoder and decoder
concatenative mapdashery
Display PDFs in your React app as easily as if they were images.
Build and manage the fast-json-stringify instances for the fastify framework
Tests if ES6 Symbol is supported.
Given two integers ‘a’ and ‘m’, find modular multiplicative inverse of ‘a’ under modulo ‘m’. The modular multiplicative inverse is an integer ‘x’ such that. a x ≡ 1 (mod m) and x belongs to [0,1,2, .. m-1]
This gives the basic for representing elliptic curves of the form y^2 = x^3 + ax + b, including adding and (p^-1 modulo q).
Where applicable, they come with a standard version and a class mix in. Ex: NumberDust.nearest(value) is also available as Integer.pd_nearest == FEATURES/PROBLEMS: Features: * Get random numbers in arbitrary ranges from OpenSSL (without skew due to modulo) Problems: * Need a good way to make sure that the OpenSSL library isn't using a broken PRNG == SYNOPSIS: require 'pixiedust' x = RandomDust.between(10,20)
No description provided.
No description provided.
No description provided.
No description provided.