⬆️ deps: Upgrade.

Author: make-github-pseudonymous-again

package.json

@@ -60,7 +60,7 @@
     "test": "ava"
   },
   "dependencies": {
-    "@failure-abstraction/error": "^5.0.3"
+    "@failure-abstraction/error": "^5.0.7"
   },
   "devDependencies": {
     "@aureooms/js-itertools": "5.1.1",
@@ -87,7 +87,7 @@
     "pinst": "2.1.6",
     "power-assert": "1.6.1",
     "regenerator-runtime": "0.13.7",
-    "xo": "0.39.1"
+    "xo": "0.40.1"
   },
   "ava": {
     "files": [

src/implementation/ArbitrarySizeDeque.js

@@ -1,5 +1,5 @@
-import Deque from './Deque.js';
 import {NotImplementedError} from '@failure-abstraction/error';
+import Deque from './Deque.js';
 
 /**
  * ArbitrarySizeDeque.

test/src/deque.js

@@ -204,7 +204,7 @@ test('SingleElementDeque', (t) => {
 test('unbounded', (t) => {
 	let i = 0;
 
-	let j = 10000;
+	let j = 10_000;
 
 	const d = deque(r(i, j, 1));
 
@@ -234,19 +234,19 @@ test('unbounded', (t) => {
 
 	t.is(d.len(), 0, 'unbounded is empty');
 
-	d.extend(r(5000, 10000, 1));
+	d.extend(r(5000, 10_000, 1));
 
 	d.extendleft(r(4999, -1, -1));
 
-	t.deepEqual(l(d), l(r(0, 10000, 1)), 'big unbounded extend');
+	t.deepEqual(l(d), l(r(0, 10_000, 1)), 'big unbounded extend');
 
 	t.deepEqual(l(d.copy()), l(d), 'big unbounded copy');
 });
 
 test('bounded without overflow', (t) => {
 	let i = 0;
 
-	let j = 10000;
+	let j = 10_000;
 
 	const d = deque(r(i, j, 1), j - i);
 
@@ -276,21 +276,21 @@ test('bounded without overflow', (t) => {
 
 	t.is(d.len(), 0, 'bounded(10000) is empty');
 
-	d.extend(r(5000, 10000, 1));
+	d.extend(r(5000, 10_000, 1));
 
 	d.extendleft(r(4999, -1, -1));
 
-	t.deepEqual(l(d), l(r(0, 10000, 1)), 'big bounded(10000) extend');
+	t.deepEqual(l(d), l(r(0, 10_000, 1)), 'big bounded(10000) extend');
 
 	t.deepEqual(l(d.copy()), l(d), 'big bounded(10000) copy');
 });
 
 test('bounded with overflow', (t) => {
 	const d = deque([], 5000);
 
-	d.extend(r(0, 10000, 1));
+	d.extend(r(0, 10_000, 1));
 
-	t.deepEqual(l(d), l(r(5000, 10000, 1)), 'bounded overflow extend');
+	t.deepEqual(l(d), l(r(5000, 10_000, 1)), 'bounded overflow extend');
 
 	d.extendleft(r(0, 2500, 1));
 
@@ -304,7 +304,7 @@ test('bounded with overflow', (t) => {
 test('count', (t) => {
 	const d = deque([], 5000);
 
-	d.extend(r(0, 10000, 1));
+	d.extend(r(0, 10_000, 1));
 
 	d.extendleft(r(0, 2500, 1));
 
@@ -330,7 +330,7 @@ test('count', (t) => {
 test('miscellaneous', (t) => {
 	const d = deque([], 5000);
 
-	d.extend(r(0, 10000, 1));
+	d.extend(r(0, 10_000, 1));
 
 	d.extendleft(r(0, 2500, 1));