Computes the greatest common divisor (gcd).
Compute the Highest Common Factor (HCF / GCD) of two integers
Compute the greatest common divisor (gcd).
> Some friendly semver range utilities
Two-factor authentication for Node.js. One-time passcode generator (HOTP/TOTP) with support for Google Authenticator.
Returns the prime factor decomposition in an array when given a single integer input. When given two integer inputs, it returns an array containing the highest common factor and the lowest common mutliple.
One Time Password (HOTP/TOTP) library for Node.js, Deno, Bun and browsers
Retries a function that returns a promise, leveraging the power of the retry module.
Retrying made simple, easy and async
Treat React JSX elements as value types and hoist them to the highest scope
A Better Auth component for Convex.
Changes the size of a geometry by scaling it up or down.
Retries a function that returns a promise, leveraging the power of the retry module.
Base class for regression modules
Zero dependency library to safe merge objects.
hint for best practices related to usage of the X-UA-Compatible meta tag and response header
Best-effort discovery of the machine's default gateway and local network IP exclusively with UDP sockets.
a few common utility template tags for ES2015
Utilities for SQL instrumentations
Find the latest version of an npm module matching a given semver range
Redis utilities for redis instrumentations
factor browser-pack bundles into common shared bundles
Microsoft Authentication Library for js
NAVI Lending SDK