denque
Advanced tools
Comparing version 1.0.2 to 1.0.3
10
index.js
@@ -5,7 +5,4 @@ 'use strict'; | ||
* Custom implementation of a double ended queue. | ||
* This is almost double the performance of petkaantonov's double-ended-queue lib. ¯\_(ツ)_/¯ | ||
* 24 mil ops/s compared to 14 mil | ||
* | ||
*/ | ||
class QueueList { | ||
module.exports = class Denque { | ||
constructor(array) { | ||
@@ -251,5 +248,2 @@ // circular buffer | ||
} | ||
} | ||
module.exports = QueueList; | ||
}; |
{ | ||
"name": "denque", | ||
"version": "1.0.2", | ||
"version": "1.0.3", | ||
"description": "The fastest javascript implementation of a double-ended queue. Maintains compatability with deque.", | ||
@@ -5,0 +5,0 @@ "main": "index.js", |
# DENQUE | ||
[![Coverage Status](https://coveralls.io/repos/github/Salakar/denque/badge.svg?branch=master)](https://coveralls.io/github/Salakar/denque?branch=master) | ||
[![dependencies](https://img.shields.io/david/Salakar/denque.svg)](https://david-dm.org/Salakar/denque) | ||
[![build](https://travis-ci.org/Salakar/denque.svg)](https://travis-ci.org/Salakar/denque) | ||
@@ -9,4 +8,6 @@ [![npm version](https://img.shields.io/npm/v/denque.svg)](https://www.npmjs.com/package/denque) | ||
Extremely fast [double-ended queue](http://en.wikipedia.org/wiki/Double-ended_queue) implementation. Double-ended queues can also be used as a: | ||
Extremely fast and lightweight [double-ended queue](http://en.wikipedia.org/wiki/Double-ended_queue) implementation with zero dependencies. | ||
Double-ended queues can also be used as a: | ||
- [Stack](http://en.wikipedia.org/wiki/Stack_\(abstract_data_type\)) | ||
@@ -19,2 +20,4 @@ - [Queue](http://en.wikipedia.org/wiki/Queue_\(data_structure\)) | ||
**Requires Node.js v4+, io.js v3+** or any platform supporting ES6 classes (pretty much all browsers). | ||
# Quick Start | ||
@@ -21,0 +24,0 @@ |
@@ -95,3 +95,3 @@ 'use strict'; | ||
const a = new Denque(); | ||
const before = a.length; | ||
// const before = a.length; | ||
let ret = a.push(0); | ||
@@ -159,3 +159,3 @@ assert.strictEqual(ret, 1); | ||
const a = new Denque(); | ||
const before = a.length; | ||
// const before = a.length; | ||
let ret = a.unshift(0); | ||
@@ -162,0 +162,0 @@ assert.strictEqual(ret, 1); |
253
29908
676