Curated collection of data structures for the JavaScript/TypeScript language.
JavaScript
0
0
MIT License
Mnemonist is a JavaScript/TypeScript library offering a curated collection of data structures, ranging from classic ones like heaps and tries to more specialized structures such as Burkhard-Keller trees and Bloom filters. It is designed for developers seeking high-performance, modular, and well-typed data structures that integrate seamlessly with JavaScript's standard APIs.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of jerome-benoit/mnemonist
Higher order iterator library for JavaScript/TypeScript.
Just an eslint config.
Draw vertical ASCII tree
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
Benchmark your code.
simple, flexible, fun test framework
Typical random-related functions for JavaScript.
Seeded random number generator for Javascript.
A kdtree data structure
TypeScript is a language for application scale JavaScript development
Top contributors
Yomguithereal
674 contributions
jerome-benoit
7 contributions
yoursunny
6 contributions
PhilippeMorier
6 contributions
farjasju
6 contributions
trivikr
5 contributions
dmitri-gb
2 contributions
veggiesaurus
2 contributions
mrflip
2 contributions
em-ctc
1 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet