It strives at being:
- As performant as possible for a high-level language.
- Completely modular (don’t need to import the whole library just to use a simple heap).
You can download the source directly from the Github repository or using npm:
npm install --save mnemonist
- Burkhard-Keller Tree
- Bloom Filter
- Fibonacci Heap
- Inverted Index
- Linked List
- Set (helpers)
- Suffix Array
- Generalized Suffix Array
- Vantage Point Tree
Note that this list does not include a
Graph data structure whose implementation is usually far too complex for the scope of this library.
However, we advise the reader to take a look at the
graphology library instead.
Don’t find the data structure you want? Maybe we can work it out together.
Contributions are obviously welcome. Be sure to lint the code & add relevant unit tests.
# Installing git clone firstname.lastname@example.org:Yomguithereal/mnemonist.git cd mnemonist npm install # Linting npm run lint # Running the unit tests npm test
The full changelog for the library can be found here.