🧪 test: Split tests, cover new API.

Author: make-github-pseudonymous-again

test/fixtures.js

@@ -1,4 +1,6 @@
 import {increasing as _inc, decreasing as _dec} from '@aureooms/js-compare';
 
 export const increasing = (a, b) => _inc(a, b);
+increasing.step = 1;
 export const decreasing = (a, b) => _dec(a, b);
+decreasing.step = -1;

test/src/RedBlackTree/get.js

@@ -1,14 +1,14 @@
 import test from 'ava';
 
-import {increasing, decreasing} from '@aureooms/js-compare';
+import {increasing, decreasing} from '../../fixtures.js';
 
 import {range} from '@aureooms/js-itertools';
 
 import {RedBlackTree} from '../../../src/index.js';
 
-test('RedBlackTree::get', (t) => {
-	for (const compare of [increasing, decreasing]) {
-		const tree = new RedBlackTree(compare);
+for (const compare of [increasing, decreasing]) {
+	test(`RedBlackTree::get [${compare.name}]`, (t) => {
+		const tree = RedBlackTree.empty(compare);
 
 		t.is(tree.get(0), null);
 
@@ -28,5 +28,5 @@ test('RedBlackTree::get', (t) => {
 
 		t.is(tree.get(-1), null);
 		t.is(tree.get(n), null);
-	}
-});
+	});
+}

test/src/RedBlackTree/has.js

@@ -1,13 +1,13 @@
 import test from 'ava';
 
-import {increasing, decreasing} from '@aureooms/js-compare';
+import {increasing, decreasing} from '../../fixtures.js';
 
 import {range} from '@aureooms/js-itertools';
 
 import {RedBlackTree} from '../../../src/index.js';
 
-test('RedBlackTree::has', (t) => {
-	for (const compare of [increasing, decreasing]) {
+for (const compare of [increasing, decreasing]) {
+	test(`RedBlackTree::has [${compare.name}]`, (t) => {
 		const tree = new RedBlackTree(compare);
 
 		t.falsy(tree.has(0));
@@ -28,5 +28,5 @@ test('RedBlackTree::has', (t) => {
 
 		t.falsy(tree.has(-1));
 		t.falsy(tree.has(n));
-	}
-});
+	});
+}

test/src/RedBlackTree/isEmpty.js

@@ -4,7 +4,30 @@ import {range} from '@aureooms/js-itertools';
 
 import {increasing, decreasing} from '../../fixtures.js';
 
-import {RedBlackTree} from '../../../src/index.js';
+import {empty, from, RedBlackTree} from '../../../src/index.js';
+
+for (const compare of [increasing, decreasing]) {
+	test(`empty(${compare.name})`, (t) => {
+		t.true(empty(compare).isEmpty());
+	});
+
+	test(`from(${compare.name}, [])`, (t) => {
+		t.true(from(compare, []).isEmpty());
+	});
+
+	test(`from(${compare.name}, range(100))`, (t) => {
+		t.false(from(compare, range(100)).isEmpty());
+	});
+
+	test(`RedBlackTree.empty(${compare.name}) + add + remove`, (t) => {
+		const tree = RedBlackTree.empty(compare);
+		t.true(tree.isEmpty());
+		tree.add('x');
+		t.false(tree.isEmpty());
+		tree.remove('x');
+		t.true(tree.isEmpty());
+	});
+}
 
 const macro = (t, compare, items, expected) => {
 	const tree = RedBlackTree.from(compare, items);

test/src/RedBlackTree/iter.js

@@ -1,13 +1,13 @@
 import test from 'ava';
 
-import {increasing, decreasing} from '@aureooms/js-compare';
+import {increasing, decreasing} from '../../fixtures.js';
 
 import {list, range} from '@aureooms/js-itertools';
 
 import {RedBlackTree} from '../../../src/index.js';
 
-test('RedBlackTree::Symbol.iterator', (t) => {
-	for (const compare of [increasing, decreasing]) {
+for (const compare of [increasing, decreasing]) {
+	test(`RedBlackTree::Symbol.iterator [${compare.name}]`, (t) => {
 		const tree = new RedBlackTree(compare);
 
 		const a1 = list(tree);
@@ -30,5 +30,5 @@ test('RedBlackTree::Symbol.iterator', (t) => {
 
 		t.deepEqual(a2.length, n, `tree contains ${n} elements`);
 		t.deepEqual(a2, reference, 'tree is sorted');
-	}
-});
+	});
+}

test/src/RedBlackTree/range.js

@@ -1,26 +1,23 @@
 import test from 'ava';
 
-import {increasing, decreasing} from '@aureooms/js-compare';
+import {increasing, decreasing} from '../../fixtures.js';
 
 import {list, range} from '@aureooms/js-itertools';
 
 import {shuffle} from '@aureooms/js-random';
 
 import {RedBlackTree} from '../../../src/index.js';
 
-test('RedBlackTree::range', (t) => {
-	for (const [s, compare] of [
-		[1, increasing],
-		[-1, decreasing],
-	]) {
+for (const compare of [increasing, decreasing]) {
+	test(`RedBlackTree::range [${compare.name}]`, (t) => {
 		const n = 10000;
 		const reference = range(n);
 		shuffle(reference, 0, n);
 
 		const tree = RedBlackTree.from(compare, reference);
 
 		const x = (a, b) =>
-			t.deepEqual(list(tree.range(a, b)), list(range(a, b, s)));
+			t.deepEqual(list(tree.range(a, b)), list(range(a, b, compare.step)));
 
 		x(0, n);
 		x(10, 20);
@@ -29,5 +26,5 @@ test('RedBlackTree::range', (t) => {
 		x(13, 7);
 		x(n - 1, -1);
 		x(10, 10);
-	}
-});
+	});
+}

test/src/RedBlackTree/remove.js

@@ -1,6 +1,6 @@
 import test from 'ava';
 
-import {increasing} from '@aureooms/js-compare';
+import {increasing} from '../../fixtures.js';
 
 import {list, range, sorted, head, iter, exhaust} from '@aureooms/js-itertools';