👕 refactor: Lint tests and benchmark sources.

Author: make-github-pseudonymous-again

_benchmark/tree.js

@@ -20,7 +20,7 @@ let t;
 let i;
 const length = 100000;
 
-let start = Number(new Date());
+let start = Date.now();
 
 console.log('number of operations:', length);
 
@@ -71,7 +71,7 @@ for (i = 0; i < length; ++i) {
 
 console.timeEnd('split');
 
-const time = Number(new Date()) - start;
+const time = Date.now() - start;
 
 const splits = [];
 for (i = 0; i < length; ++i) {
@@ -82,7 +82,7 @@ for (i = 0; i < length; ++i) {
 	);
 }
 
-start = Number(new Date()) - time;
+start = Date.now() - time;
 
 console.time('concat');
 for (i = 0; i < length; ++i) {
@@ -92,4 +92,4 @@ for (i = 0; i < length; ++i) {
 console.timeEnd('concat');
 
 splits.splice(0);
-console.log('total:', Number(new Date()) - start + 'ms');
+console.log('total:', Date.now() - start + 'ms');

package.json

@@ -147,7 +147,9 @@
     ],
     "rules": {
       "camelcase": "off",
-      "unicorn/filename-case": "off"
+      "unicorn/filename-case": "off",
+      "unicorn/explicit-length-check": "off",
+      "unicorn/no-array-push-push": "off"
     },
     "overrides": [
       {

test/src/FingerTree.js

@@ -14,12 +14,8 @@ test('FingerTree', (t) => {
 
 	const N = 10;
 
-	list(range(N)).forEach((value) => {
-		T = T.push(value);
-	});
-	list(range(N)).forEach((value) => {
-		T = T.cons(value);
-	});
+	for (const value of range(N)) T = T.push(value);
+	for (const value of range(N)) T = T.cons(value);
 
 	t.deepEqual(
 		list(T),
@@ -29,10 +25,11 @@ test('FingerTree', (t) => {
 
 	let U = from(COUNTER, range(N));
 
-	list(range(N)).forEach(() => {
+	// eslint-disable-next-line no-unused-vars
+	for (const _ of range(N)) {
 		U = U.push(T.head());
 		T = T.tail();
-	});
+	}
 
 	t.deepEqual(
 		list(U),