🧪 test(sample): Simplify.

Author: make-github-pseudonymous-again

package.json

@@ -65,6 +65,7 @@
   "dependencies": {},
   "devDependencies": {
     "@aureooms/js-array": "4.0.0",
+    "@aureooms/js-compare": "^2.0.1",
     "@aureooms/js-functools": "2.0.3",
     "@aureooms/js-itertools": "5.0.1",
     "@aureooms/js-memory": "4.0.0",

test/src/sample.js

@@ -1,54 +1,50 @@
 import test from 'ava';
-import * as random from '../../src/index.js';
+import {sample, _fisheryates, randint} from '../../src/index.js';
 
-import * as mem from '@aureooms/js-memory';
-import * as array from '@aureooms/js-array';
-import operator from '@aureooms/js-operator';
+import {_calloc} from '@aureooms/js-memory';
+import {iota, copy} from '@aureooms/js-array';
+import {increasing} from '@aureooms/js-compare';
 
-function one(type, sample_name, sample) {
-	const type_name = type.toString().split(' ')[1].slice(0, -2);
-
-	const calloc = mem._calloc(type);
-
-	const n = 100;
+const macro = (t, type, _sample_name, sample, n, k, i, j) => {
+	const calloc = _calloc(type);
 
 	const a = calloc(n);
 	const b = calloc(n);
 
-	array.iota(a, 0, n, 0);
-
-	const range = function (k, i, j) {
-		const name = `sample ( ${type_name}, ${sample_name}, ${k}, ${i}, ${j} )`;
-
-		test(name, (t) => {
-			array.copy(a, 0, n, b, 0);
-			sample(k, b, i, j);
+	iota(a, 0, n, 0);
 
-			for (let it = 0; it < i; ++it) {
-				const msg = `b[${it}] === a[${it}]`;
-				t.deepEqual(b[it], a[it], msg);
-			}
+	copy(a, 0, n, b, 0);
+	sample(k, b, i, j);
 
-			const _a = Array.prototype.slice.call(a, i, j).sort(operator.sub);
-			const _b = Array.prototype.slice.call(b, i, j).sort(operator.sub);
+	for (let it = 0; it < i; ++it) {
+		const msg = `b[${it}] === a[${it}]`;
+		t.deepEqual(b[it], a[it], msg);
+	}
 
-			const msg = 'shuffled region contains same elements as original';
+	const _a = Array.prototype.slice.call(a, i, j).sort(increasing);
+	const _b = Array.prototype.slice.call(b, i, j).sort(increasing);
 
-			t.deepEqual(_b, _a, msg);
+	const msg = 'shuffled region contains same elements as original';
 
-			for (let it = j; it < n; ++it) {
-				const msg = `b[${it}] === a[${it}]`;
-				t.deepEqual(b[it], a[it], msg);
-			}
-		});
-	};
+	t.deepEqual(_b, _a, msg);
 
-	range(n, 0, n);
-	range(n - 20, 20, n);
-	range(n - 20, 0, n - 20);
-	range(n - 20, 10, n - 10);
-	range(n - 30, 10, n - 10);
-}
+	for (let it = j; it < n; ++it) {
+		const msg = `b[${it}] === a[${it}]`;
+		t.deepEqual(b[it], a[it], msg);
+	}
+};
+
+macro.title = (title, type, sample_name, _sample, n, k, i, j) =>
+	title || `[${n}] sample ( ${type.name}, ${sample_name}, ${k}, ${i}, ${j} )`;
+
+const n = 100;
+const params = [
+	[n, n, 0, n],
+	[n, n - 20, 20, n],
+	[n, n - 20, 0, n - 20],
+	[n, n - 20, 10, n - 10],
+	[n, n - 30, 10, n - 10],
+];
 
 const types = [
 	Array,
@@ -64,12 +60,14 @@ const types = [
 ];
 
 const algorithms = [
-	['Fisher-Yates', random._fisheryates(random.randint)],
-	['API', random.sample],
+	['Fisher-Yates', _fisheryates(randint)],
+	['API', sample],
 ];
 
 for (const type of types) {
 	for (const [name, algorithm] of algorithms) {
-		one(type, name, algorithm);
+		for (const [n, k, i, j] of params) {
+			test(macro, type, name, algorithm, n, k, i, j);
+		}
 	}
 }

yarn.lock

@@ -14,6 +14,11 @@
   dependencies:
     "@aureooms/js-error" "^5.0.2"
 
+"@aureooms/js-compare@^2.0.1":
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/@aureooms/js-compare/-/js-compare-2.0.1.tgz#4636ea0736945abbcca38d5bd56a1f405034b2f9"
+  integrity sha512-J+gG1wlwF401ySv0mOYhIIVUuoukvZaRkIwYNH9xZTLhRyI4VxoaFi3k8GA0ebjHqndLGYJS9uEeG3cuQcg+7w==
+
 "@aureooms/js-error@^5.0.2":
   version "5.0.2"
   resolved "https://registry.yarnpkg.com/@aureooms/js-error/-/js-error-5.0.2.tgz#dc2ad2fc2b10365581c32c28222daccc5c3c9600"