Changed

• Improve performance of resizing the internal array by inlining the logic partially

Fixed

• Correct pop, popLeft and rotate return types

Update Deque to expose iterator methods that mirror Set behavior such as Set#keys(), Set#values() and Set#entries().

Added support for optional start parameter to indexOf.

Since rotate() is a likely used feature in round-robins and other deque places, inline the behavior to improve overall perf. Based on benchmarks it's running moderately faster than the other two libraries comparable libraries:

@blakeembrey/deque x 207,539,277 ops/sec ±1.02% (95 runs sampled)
denque x 170,141,506 ops/sec ±0.63% (92 runs sampled)
double-ended-queue x 176,605,102 ops/sec ±0.59% (92 runs sampled)

First release of deque, quick operations of a queue library using circular array as backing structure.