The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.

salakar

denque

- fix: issue where `clear()` is still keeping references to the elements (#47)
 - refactor: performance optimizations for growth and array copy (#43)
 - refactor: performance optimizations for toArray and fromArray (#46)
 - test: add additional benchmarks for queue growth and `toArray` (#45)

2.1.0

- fix(types): incorrect return type on `size()`

2.0.1

- fix!: `push` & `unshift` now accept `undefined` values to match behaviour of `Array` (fixes #25) (#35)
   - This is only a **BREAKING** change if you are currently expecting `push(undefined)` and `unshift(undefined)` to do
     nothing - the new behaviour now correctly adds undefined values to the queue.
   - **Note**: behaviour of `push()` & `unshift()` (no arguments) remains unchanged (nothing gets added to the queue).
   - **Note**: If you need to differentiate between `undefined` values in the queue and the return value of `pop()` then
     check the queue `.length` before popping.
 - fix: incorrect methods in types definition file

2.1.0

2.1.0

2.0.1

2.0.1

2.0.0

2.0.0

1.5.1

1.5.1

1.5.0

1.5.0

1.4.1

1.4.0

1.3.0

1.2.6

1.2.5

2.1.0

.css-1z04cui{margin-bottom:var(--chakra-space-4);font-size:var(--chakra-fontSizes-md);}2.1.0

2.0.1

2.0.1

2.0.0

2.0.0

1.5.1

1.5.1

1.5.0

1.5.0

1.4.1

1.4.0

1.3.0

1.2.6

1.2.5

2.1.0