Package Exports
- mnemonist
- mnemonist/heap
- mnemonist/multi-map
- mnemonist/multi-set
- mnemonist/queue
- mnemonist/set
- mnemonist/suffix-array
- mnemonist/vp-tree
This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (mnemonist) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.
Readme
Mnemonist
Mnemonist is a curated collection of data structures for the JavaScript language.
It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.
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).
- Simple & straightforward to use and consistent with JavaScript standard objects' API.
Installation
npm install --save mnemonistDocumentation
Full documentation for the library can be found here.
- BiMap
- BitSet
- Bloom Filter
- Burkhard-Keller Tree
- Fibonacci Heap
- Heap
- Index
- Inverted Index
- Linked List
- MultiIndex
- MultiMap
- MultiSet
- Queue
- Set (helpers)
- Stack
- Suffix Array
- Generalized Suffix Array
- SymSpell
- Trie
- 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.
Contribution
Contributions are obviously welcome. Be sure to lint the code & add relevant unit tests.
# Installing
git clone git@github.com:Yomguithereal/mnemonist.git
cd mnemonist
npm install
# Linting
npm run lint
# Running the unit tests
npm test