dsjslib

dsjslib
=======================================
This is a collection of different data structures and utilities, implemented in JavaScript.
Its written and tested using Node.js which is also the target platform.

###API Documentation >>


Overview
----------------
*

New

*

Bloom Filter

- Probabilistic data structure to test whether an element is a member of a set.

*

Maps

*

Sorted Maps

Maps sorted according to natural ordering of keys or by comparator function provided at creation time.
Two different backing stores are available
* AVLTree
* Skip List
*

Tries

Map optimized for prefix searching on string keys
* Multi Way Trie
* Ternary Search Trie
*

Multi-Valued

Map supporting multiple values for a key
* MultiMap
* TreeMultiMap - In addition, Map is sorted on keys. Uses AVLTree as backing store
*

Queues

*

Linked Deque

- An optionally capacity constrained deque based on linked nodes
*

Priority Queue

- Priority Queue based on a Binary Heap
*

Delay Queue

- Queue of 'Delayed' items, item can only be taken when its delay has expired.
For example usage see wiki: DelayQueue-for-Scheduled-Task-Management

*

Utilities

*

LRU Cache with Stats

Google Guava inspired LRU cache. Reference: Google Guava
- Max Size and weight
- Cache Stats recording
For usage and overview see wiki: https://github.com/monmohan/dsjslib/wiki/LRU-Cache-Feature-and-usage-overview

*

BitSet

- An array of bits with operations to set, examine and clear individual bits
*

CircularBuffer

- A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.
When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.
*

Bloom Filter

- Probabilistic data structure to test whether an element is a member of a set.
*

BTree

- Self balancing generalized Search Tree


Installation
-------------------------
``js
npm install dsjslib
``
Current version 0.6.9 is stable and thoroughly tested on Node v0.10