an eslint rule plugin companion to babel-eslint

Min Heap

JSON without touching any globals

An experimental ESLint runner for Jest

Syntax tree data structure and parser interfaces for the lezer parser

Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.

SWT3 AI Witness SDK: cryptographic attestation for AI inference. 113 procedures, 61 namespaces, 9 languages, 18 profiles. EU AI Act, NIST AI RMF, CMMC, SR 11-7.

Encode/decode circular structures for converting to and from JSON.

record and replay the web

A collection of algorithms and utilities for analyzing and selecting maximally distinct colors. Now includes a unified pickDistinctColors API for easy color selection.

Implementation of Disjoint sets data structure.

ECMAScript scope analyzer for ESLint

An implementation of the Paillier cryptosystem using native JS (ECMA 2020) implementation of BigInt

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

Eslint rule for consistent filenames.

Probabilistic data structures for JavaScript. Space-efficient, approximate-membership filters (Bloom, Blocked Bloom, Binary Fuse) with tunable error and a portable binary format; zero dependencies, universal.

The Astro language server, implement the [language server protocol](https://microsoft.github.io/language-server-protocol/)

A public domain JSON Schema validator for JavaScript

Smaller & Faster Single-File Vector Search Engine from Unum