Playground for data structure code bricks in JavaScript. This is the twin project of js-algo.

This project is just a playground for any data structure that doesn't fit in any of those project,

• aureooms/js-arraylist : dynamic array code bricks for JavaScript
• aureooms/js-bst : binary search tree code bricks in JavaScript
• aureooms/js-cg : computational geometry code bricks for JavaScript
• aureooms/js-dict : dictionary ADT code bricks for JavaScript
• aureooms/js-gn : graphs and networks code bricks for JavaScript
• aureooms/js-pubsub : publish-subscribe pattern code bricks for JavaScript

Those packages aim to provide code bricks that are as generic as possible. Some examples are a d-ary heap that can be parametrized with any d, BST's built on the same left rotate and right rotate functions, an ArrayList implementation with parametrizable allocator.

Binary and Binomial heap reference:

• http://www.cs.princeton.edu/~wayne/cs423/lectures/heaps-4up.pdf
• http://stackoverflow.com/questions/6531543/efficient-implementation-of-binary-heaps

Other projects implementing data structures in other languages :

• https://github.com/patmorin/ods (C++, Java, Python)
• http://rosettacode.org (All kinds of languages)

Other reference:

• http://en.wikipedia.org/wiki/Disjoint-set_data_structure
• http://en.wikipedia.org/wiki/Partition_refinement