Fast, light and hassle-free JavaScript data structures, written in CoffeeScript.
- (Hash) Map
- Heap
- Graph
- (Doubly) Linked List
- Queue
- Self-Balancing Binary Search Tree (Red-Black Tree)
- Trie
Using npm:
npm install data-structuresThen where needed:
var Heap = require('data-structures').Heap;
var heap = new Heap();
heap.add(3);
heap.removeMin();Get the whole file here: data-structures.js or minified: data-structures.min.js
Then put the file in your HTML page, note that the code is required differently:
<script src="./data-structures.min.js"></script>
<script>
var heap = require("./Heap");
var heap = new Heap();
heap.add(3);
heap.removeMin();
</script>(Magical client-side require()) courtesy of Browserify.
The wiki page is a formatted version of the documentation in the code.
Tests are done using jasmine-node.
E.g.:
jasmine-node --coffee tests/LinkedList.spec.coffeeLazy method:
npm testnpm run-script browserExport(Compiles CoffeeScript to JavaScript, browserifies them into a bundle, then minifies using uglify-js).
MIT.
