A node.js based data structures library.
npm install all-structuresstructures
==========
A node based basic data structures library with type safety. Following data structures are currently supported.
1. Array List
2. Linked List
3. Doubly Linked List
For example to create a LinkedList, use the following snippet:
var structures = require("all-structures");
var list = new structures.LinkedList({type: String, maxSize: 4});
{
maxSize: 10, //the maximum size of the list, defaults to machine specific maximum
type: String //type of the objects to be added to the list. Required option!
}
#### Supported Functions
1. add()
list.add("Hello")
2. remove()
list.remove(0);
3. size()
list.size();
4. toString()
list.toString();
5. get()
list.get(0);
A Linked list is a Singly LinkedList implementation
While creating a linked list, following options are supported:
{
maxSize: 10, //the maximum size of the list, defaults to machine specific maximum
type: String //type of the objects to be added to the list. Required option!
}
#### Supported Functions
1. add()
list.add("Hello")
2. remove()
list.remove(0);
3. size()
list.size();
4. toString()
list.toString();
5. get()
list.get(0);
6. next() - gets the next node. Returns undefined if reached to end.
list.next();
A doubly linked list can be traversed in both directions.
While creating a doubly linked list, following options are supported:
{
maxSize: 10, //the maximum size of the list, defaults to machine specific maximum
type: String //type of the objects to be added to the list. Required option!
}
#### Supported Functions
1. add()
list.add("Hello")
2. remove()
list.remove(0);
3. size()
list.size();
4. toString()
list.toString();
5. get()
list.get(0);
6. next() - gets the next node. Returns undefined if reached to end.
list.next();
7. prev() - gets the previous node. Returns undefined if reached to start.
list.prev();
Install dependencies
$ npm install
Run the mocha test cases
$ mocha