Comparing version 0.0.4 to 0.0.5
{ | ||
"name": "eter", | ||
"version": "0.0.4", | ||
"version": "0.0.5", | ||
"description": "Lightweight collections for JavaScript", | ||
"keywords": ["collections", "stack", "queue", "linked list", "trie"], | ||
"author": "Keyvan Akbary <kiwwito@gmail.com>", | ||
@@ -6,0 +7,0 @@ "repository": { |
@@ -8,3 +8,2 @@ # Eter | ||
## Usage | ||
For node, [install the package](https://www.npmjs.org/package/eter) and include it | ||
@@ -23,2 +22,3 @@ ```javascript | ||
### Stack | ||
A [Stack](http://en.wikipedia.org/wiki/Stack_(abstract_data_type)) is a [Last-In-First-Out (LIFO)](http://en.wikipedia.org/wiki/LIFO_(computing)) data structure. | ||
```javascript | ||
@@ -35,2 +35,3 @@ var s = new eter.Stack(); | ||
### Queue | ||
A [Queue](http://en.wikipedia.org/wiki/Queue_(abstract_data_type)) is a [First-In-First-Out (FIFO)](http://en.wikipedia.org/wiki/FIFO_(computing)) data structure. | ||
```javascript | ||
@@ -47,2 +48,3 @@ var q = new eter.Queue(); | ||
### LinkedList | ||
A [Linked List](http://www.wikiwand.com/en/Linked_list) is a data structure consisting of a group of nodes which together represent a sequence. | ||
```javascript | ||
@@ -64,1 +66,20 @@ var l = new eter.LinkedList(); | ||
``` | ||
### Trie | ||
A [Trie](http://en.wikipedia.org/wiki/Trie) is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. | ||
```javascript | ||
var t = new eter.Trie(); | ||
t.insertAll(['one', 'oh', 'on']); | ||
t.getAll();//['on', 'oh', 'one'] | ||
t.contains('one');//true | ||
t.insert('foo'); | ||
t.getAll();//['foo', 'on', 'oh', 'one'] | ||
t.remove('foo'); | ||
t.getAll();//['on', 'oh', 'one'] | ||
t.getPrefixed('on');//['on', 'one'] | ||
``` |
21723
20
424
81