A quick and inefficient implementation of the bisection method in TS.

Attempts to find a root of an input function within a given boundary interval, using the [bisection method](https://en.wikipedia.org/wiki/Bisection_method).

A JavaScript port of the bisection algorithm that is used in Python

find, approximately, by bisection, a point or interval where f(x)=0 for a strictly non-decreasing function f

Use interpolation methods in CSS gradient functions

Bridging the gap between buffers and typed arrays

Quick DAG CLI for agent-readable project orchestration

Match human-quality input to potential matches by edit distance.

Lazy-evaluating list of files, based on globs or regex patterns

Stop throwing errors, and instead return Results!

LRU and FIFO caches for Client or Server

Utility package to determine if an `Array.prototype` method properly boxes the callback's receiver and third argument.

create empirical cumulative distribution function from array of values

Generate or verify a Proof Key for Code Exchange (PKCE) challenge pair

A library for manipulating IPv4 and IPv6 addresses in JavaScript.

A fast, efficient Node.js Worker Thread Pool implementation

Override HTTP verbs

Crazy fast http radix based router

[](https://www.npmjs.com/package/@reflink/reflink) [](https://github.com/pnpm/reflink/actions)

A Node.js module for efficient sampling from a discrete probability distribution using the alias method.