mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

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.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

CodeJam - Set of handy reusable

•    CSharp

---

CodeJam is a set of handy reusable .NET components that can simplify your daily work and save your time when you copy and paste your favorite helper methods and classes from one project to another.CodeJam is dedicated to one principal goal: creating and maintaining reusable code. The CodeJam main package is a place for collaboration and sharing, where developers community can work together on code to be shared by the CodeJam.

codejam list string collections data-structures threading xml reflection async assertions io algorithm utilities suffix-tree range discriminated-unions

level-trie - The TRIE data structure and search algorithm, on top of leveldb.

•    Javascript

---

The TRIE data structure and search algorithm, on top of leveldb.Create a new Trie that stores its data in db.

trie tree leveldb levelup level search fuzzy suffix-tree suffix radix-tree radix digital

radixtree - Fork of the project http://code.google.com/p/radixtree

•    Javascript

---

Fork of the project http://code.google.com/p/radixtree

data-structures radix-tree radix-trie suffix-tree