😒 chore: Patch tests.

Author: make-github-pseudonymous-again

test/src/undirected/offline/algo/eulerian/dup.js

@@ -1,3 +1,4 @@
+import test from 'ava';
 
 
 
@@ -68,7 +69,7 @@ var check = function(label, n, E, m){
 			});
 		});
 
-		deepEqual(count[1], count[0], 'check edge count');
+		t.deepEqual(count[1], count[0], 'check edge count');
 
 
 	});

test/src/undirected/offline/algo/eulerian/eventour.js

@@ -1,3 +1,4 @@
+import test from 'ava';
 
 
 var check = function(label, n, x, E, _E){
@@ -45,20 +46,20 @@ var check = function(label, n, x, E, _E){
 
 		eventour(g, v, x, done, it, tour, []);
 
-		deepEqual(tour.length, E.length, 'check length');
+		t.deepEqual(tour.length, E.length, 'check length');
 
 		var free = [];
 		edges.forEach(function(e){
 			free.push(e.free);
 		});
 
-		deepEqual(free, gn.sqmat(1, E.length, false), 'check free');
+		t.deepEqual(free, gn.sqmat(1, E.length, false), 'check free');
 
 
 		i = tour.length;
 		if(i){
 			tour.push(tour[0]);
-			while(i--) ok(d[tour[i]][tour[i+1]] < Infinity, 'check path component ' + i);
+			while(i--) t.truthy(d[tour[i]][tour[i+1]] < Infinity, 'check path component ' + i);
 		}
 
 

test/src/undirected/offline/algo/eulerian/oddgraph.js

@@ -1,3 +1,4 @@
+import test from 'ava';
 
 
 var check = function(label, n, E){
@@ -45,16 +46,16 @@ var check = function(label, n, E){
 		oddgraph(g, d, h);
 
 		h.vitr(function(v){
-			ok(degree[v[1][0]] % 2, v[1][0] + ' odd');
+			t.truthy(degree[v[1][0]] % 2, v[1][0] + ' odd');
 			ainside[v[1][0]] = 1;
 			if(degree[v[1][0]] % 2){
 				h.eitr(v, function(_, u, w){
-					deepEqual(w, d[v[1][0]][u[1][0]], 'd['+v[1][0]+']['+u[1][0]+'] check');
+					t.deepEqual(w, d[v[1][0]][u[1][0]], 'd['+v[1][0]+']['+u[1][0]+'] check');
 				});
 			}
 		});
 
-		deepEqual(ainside, einside, 'count all check')
+		t.deepEqual(ainside, einside, 'count all check')
 
 	});
 

test/src/undirected/offline/algo/eulerian/simplegraph.js

@@ -1,3 +1,4 @@
+import test from 'ava';
 var check = function(name, order, E){
 
 
@@ -56,14 +57,14 @@ var check = function(name, order, E){
 
 				if(i !== j){
 					edgecountg[i][j] = 1;
-					ok(edgevalh[i][j] <= w, 'check (' + i + ', ' + j + ')');
+					t.truthy(edgevalh[i][j] <= w, 'check (' + i + ', ' + j + ')');
 				}
 
 			});
 		});
 
 
-		deepEqual(edgecounth, edgecountg, "check simplegraph");
+		t.deepEqual(edgecounth, edgecountg, "check simplegraph");
 
 	});
 

test/src/undirected/offline/algo/eulerian/wblossom_n3.js

@@ -1,3 +1,4 @@
+import test from 'ava';
 
 var check = function(key, alg, callback){
 	test(key, function(assert){
@@ -10,98 +11,98 @@ var tests = {
 
 	test10_empty : function(alg){
 		// empty input graph
-		deepEqual(alg([]), []);
+		t.deepEqual(alg([]), []);
 	},
 	test11_singleedge : function(alg){
 		// single edge
-		deepEqual(alg([ [0,1,1] ]), [1, 0]);
+		t.deepEqual(alg([ [0,1,1] ]), [1, 0]);
 	},
 
 	test12 : function(alg){
-		deepEqual(alg([ [1,2,10], [2,3,11] ]), [ -1, -1, 3, 2 ]);
+		t.deepEqual(alg([ [1,2,10], [2,3,11] ]), [ -1, -1, 3, 2 ]);
 	},
 
 	test13 : function(alg){
-		deepEqual(alg([ [1,2,5], [2,3,11], [3,4,5] ]), [ -1, -1, 3, 2, -1 ]);
+		t.deepEqual(alg([ [1,2,5], [2,3,11], [3,4,5] ]), [ -1, -1, 3, 2, -1 ]);
 	},
 
 	test14_maxcard : function(alg){
 		// maximum cardinality
-		deepEqual(alg([ [1,2,5], [2,3,11], [3,4,5] ], true), [ -1, 2, 1, 4, 3 ]);
+		t.deepEqual(alg([ [1,2,5], [2,3,11], [3,4,5] ], true), [ -1, 2, 1, 4, 3 ]);
 	},
 
 	test15_float : function(alg){
 		// floating point weigths
-		deepEqual(alg([ [1,2,Math.PI], [2,3,Math.E], [1,3,3.0], [1,4,Math.sqrt(2.0)] ]), [ -1, 4, 3, 2, 1 ]);
+		t.deepEqual(alg([ [1,2,Math.PI], [2,3,Math.E], [1,3,3.0], [1,4,Math.sqrt(2.0)] ]), [ -1, 4, 3, 2, 1 ]);
 	},
 
 	test16_negative : function(alg){
 		// negative weights
-		deepEqual(alg([ [1,2,2], [1,3,-2], [2,3,1], [2,4,-1], [3,4,-6] ], false), [ -1, 2, 1, -1, -1 ]);
-		deepEqual(alg([ [1,2,2], [1,3,-2], [2,3,1], [2,4,-1], [3,4,-6] ], true), [ -1, 3, 4, 1, 2 ]);
+		t.deepEqual(alg([ [1,2,2], [1,3,-2], [2,3,1], [2,4,-1], [3,4,-6] ], false), [ -1, 2, 1, -1, -1 ]);
+		t.deepEqual(alg([ [1,2,2], [1,3,-2], [2,3,1], [2,4,-1], [3,4,-6] ], true), [ -1, 3, 4, 1, 2 ]);
 	},
 
 	test20_sblossom : function(alg){
 		// create S-blossom and use it for augmentation
-		deepEqual(alg([ [1,2,8], [1,3,9], [2,3,10], [3,4,7] ]), [ -1, 2, 1, 4, 3 ]);
-		deepEqual(alg([ [1,2,8], [1,3,9], [2,3,10], [3,4,7], [1,6,5], [4,5,6] ]), [ -1, 6, 3, 2, 5, 4, 1 ]);
+		t.deepEqual(alg([ [1,2,8], [1,3,9], [2,3,10], [3,4,7] ]), [ -1, 2, 1, 4, 3 ]);
+		t.deepEqual(alg([ [1,2,8], [1,3,9], [2,3,10], [3,4,7], [1,6,5], [4,5,6] ]), [ -1, 6, 3, 2, 5, 4, 1 ]);
 	},
 
 	test21_tblossom : function(alg){
 		// create S-blossom, relabel as T-blossom, use for augmentation
-		deepEqual(alg([ [1,2,9], [1,3,8], [2,3,10], [1,4,5], [4,5,4], [1,6,3] ]), [ -1, 6, 3, 2, 5, 4, 1 ]);
-		deepEqual(alg([ [1,2,9], [1,3,8], [2,3,10], [1,4,5], [4,5,3], [1,6,4] ]), [ -1, 6, 3, 2, 5, 4, 1 ]);
-		deepEqual(alg([ [1,2,9], [1,3,8], [2,3,10], [1,4,5], [4,5,3], [3,6,4] ]), [ -1, 2, 1, 6, 5, 4, 3 ]);
+		t.deepEqual(alg([ [1,2,9], [1,3,8], [2,3,10], [1,4,5], [4,5,4], [1,6,3] ]), [ -1, 6, 3, 2, 5, 4, 1 ]);
+		t.deepEqual(alg([ [1,2,9], [1,3,8], [2,3,10], [1,4,5], [4,5,3], [1,6,4] ]), [ -1, 6, 3, 2, 5, 4, 1 ]);
+		t.deepEqual(alg([ [1,2,9], [1,3,8], [2,3,10], [1,4,5], [4,5,3], [3,6,4] ]), [ -1, 2, 1, 6, 5, 4, 3 ]);
 	},
 
 	test22_s_nest : function(alg){
 		// create nested S-blossom, use for augmentation
-		deepEqual(alg([ [1,2,9], [1,3,9], [2,3,10], [2,4,8], [3,5,8], [4,5,10], [5,6,6] ]), [ -1, 3, 4, 1, 2, 6, 5 ]);
+		t.deepEqual(alg([ [1,2,9], [1,3,9], [2,3,10], [2,4,8], [3,5,8], [4,5,10], [5,6,6] ]), [ -1, 3, 4, 1, 2, 6, 5 ]);
 	},
 
 	test23_s_relabel_nest : function(alg){
 		// create S-blossom, relabel as S, include in nested S-blossom
-		deepEqual(alg([ [1,2,10], [1,7,10], [2,3,12], [3,4,20], [3,5,20], [4,5,25], [5,6,10], [6,7,10], [7,8,8] ]), [ -1, 2, 1, 4, 3, 6, 5, 8, 7 ]);
+		t.deepEqual(alg([ [1,2,10], [1,7,10], [2,3,12], [3,4,20], [3,5,20], [4,5,25], [5,6,10], [6,7,10], [7,8,8] ]), [ -1, 2, 1, 4, 3, 6, 5, 8, 7 ]);
 	},
 
 	test24_s_nest_expand : function(alg){
 		// create nested S-blossom, augment, expand recursively
-		deepEqual(alg([ [1,2,8], [1,3,8], [2,3,10], [2,4,12], [3,5,12], [4,5,14], [4,6,12], [5,7,12], [6,7,14], [7,8,12] ]), [ -1, 2, 1, 5, 6, 3, 4, 8, 7 ]);
+		t.deepEqual(alg([ [1,2,8], [1,3,8], [2,3,10], [2,4,12], [3,5,12], [4,5,14], [4,6,12], [5,7,12], [6,7,14], [7,8,12] ]), [ -1, 2, 1, 5, 6, 3, 4, 8, 7 ]);
 	},
 
 	test25_s_t_expand : function(alg){
 		// create S-blossom, relabel as T, expand
-		deepEqual(alg([ [1,2,23], [1,5,22], [1,6,15], [2,3,25], [3,4,22], [4,5,25], [4,8,14], [5,7,13] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4 ]);
+		t.deepEqual(alg([ [1,2,23], [1,5,22], [1,6,15], [2,3,25], [3,4,22], [4,5,25], [4,8,14], [5,7,13] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4 ]);
 	},
 
 	test26_s_nest_t_expand : function(alg){
 		// create nested S-blossom, relabel as T, expand
-		deepEqual(alg([ [1,2,19], [1,3,20], [1,8,8], [2,3,25], [2,4,18], [3,5,18], [4,5,13], [4,7,7], [5,6,7] ]), [ -1, 8, 3, 2, 7, 6, 5, 4, 1 ]);
+		t.deepEqual(alg([ [1,2,19], [1,3,20], [1,8,8], [2,3,25], [2,4,18], [3,5,18], [4,5,13], [4,7,7], [5,6,7] ]), [ -1, 8, 3, 2, 7, 6, 5, 4, 1 ]);
 	},
 
 	test30_tnasty_expand : function(alg){
 		// create blossom, relabel as T in more than one way, expand, augment
-		deepEqual(alg([ [1,2,45], [1,5,45], [2,3,50], [3,4,45], [4,5,50], [1,6,30], [3,9,35], [4,8,35], [5,7,26], [9,10,5] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4, 10, 9 ]);
+		t.deepEqual(alg([ [1,2,45], [1,5,45], [2,3,50], [3,4,45], [4,5,50], [1,6,30], [3,9,35], [4,8,35], [5,7,26], [9,10,5] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4, 10, 9 ]);
 	},
 
 	test31_tnasty2_expand : function(alg){
 		// again but slightly different
-		deepEqual(alg([ [1,2,45], [1,5,45], [2,3,50], [3,4,45], [4,5,50], [1,6,30], [3,9,35], [4,8,26], [5,7,40], [9,10,5] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4, 10, 9 ]);
+		t.deepEqual(alg([ [1,2,45], [1,5,45], [2,3,50], [3,4,45], [4,5,50], [1,6,30], [3,9,35], [4,8,26], [5,7,40], [9,10,5] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4, 10, 9 ]);
 	},
 
 	test32_t_expand_leastslack : function(alg){
 		// create blossom, relabel as T, expand such that a new least-slack S-to-free edge is produced, augment
-		deepEqual(alg([ [1,2,45], [1,5,45], [2,3,50], [3,4,45], [4,5,50], [1,6,30], [3,9,35], [4,8,28], [5,7,26], [9,10,5] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4, 10, 9 ]);
+		t.deepEqual(alg([ [1,2,45], [1,5,45], [2,3,50], [3,4,45], [4,5,50], [1,6,30], [3,9,35], [4,8,28], [5,7,26], [9,10,5] ]), [ -1, 6, 3, 2, 8, 7, 1, 5, 4, 10, 9 ]);
 	},
 
 	test33_nest_tnasty_expand : function(alg){
 		// create nested blossom, relabel as T in more than one way, expand outer blossom such that inner blossom ends up on an augmenting path
-		deepEqual(alg([ [1,2,45], [1,7,45], [2,3,50], [3,4,45], [4,5,95], [4,6,94], [5,6,94], [6,7,50], [1,8,30], [3,11,35], [5,9,36], [7,10,26], [11,12,5] ]), [ -1, 8, 3, 2, 6, 9, 4, 10, 1, 5, 7, 12, 11 ]);
+		t.deepEqual(alg([ [1,2,45], [1,7,45], [2,3,50], [3,4,45], [4,5,95], [4,6,94], [5,6,94], [6,7,50], [1,8,30], [3,11,35], [5,9,36], [7,10,26], [11,12,5] ]), [ -1, 8, 3, 2, 6, 9, 4, 10, 1, 5, 7, 12, 11 ]);
 	},
 
 	test34_nest_relabel_expand : function(alg){
 		// create nested S-blossom, relabel as S, expand recursively
-		deepEqual(alg([ [1,2,40], [1,3,40], [2,3,60], [2,4,55], [3,5,55], [4,5,50], [1,8,15], [5,7,30], [7,6,10], [8,10,10], [4,9,30] ]), [ -1, 2, 1, 5, 9, 3, 7, 6, 10, 4, 8 ]);
+		t.deepEqual(alg([ [1,2,40], [1,3,40], [2,3,60], [2,4,55], [3,5,55], [4,5,50], [1,8,15], [5,7,30], [7,6,10], [8,10,10], [4,9,30] ]), [ -1, 2, 1, 5, 9, 3, 7, 6, 10, 4, 8 ]);
 	}
 };
 

test/src/undirected/offline/algo/sp/dijkstra.js

@@ -1,12 +1,12 @@
+import test from 'ava';
 
-var one, binomialheap, functools;
 
-binomialheap = require( "@aureooms/js-binomial-heap" );
-functools = require( "@aureooms/js-functools" );
+import binomialheap from "@aureooms/js-binomial-heap" ;
+import functools from "@aureooms/js-functools" ;
 
-one = function ( label, n, s, edges, prev, dist ) {
+function one ( label, n, s, edges, prev, dist ) {
 
-	test( "dijkstra #" + label, function () {
+test( "dijkstra #" + label, t => {
 
 		var Graph, PriorityQueue;
 		var g, i, v, e, j, p, d, used, ref, left, predicate;
@@ -42,8 +42,8 @@ one = function ( label, n, s, edges, prev, dist ) {
 
 		gn.dijkstra( g, n, v[s], p, d, used, ref, left );
 
-		deepEqual( p, prev, "prev" );
-		deepEqual( d, dist, "dist" );
+		t.deepEqual( p, prev, "prev" );
+		t.deepEqual( d, dist, "dist" );
 
 	});
 

test/src/undirected/offline/algo/sp/floyd.js

@@ -1,12 +1,12 @@
+import test from 'ava';
 
-var one, binomialheap, functools;
 
-binomialheap = require( "@aureooms/js-binomial-heap" );
-functools = require( "@aureooms/js-functools" );
+import binomialheap from "@aureooms/js-binomial-heap" ;
+import functools from "@aureooms/js-functools" ;
 
-one = function ( label, n, edges ) {
+function one ( label, n, edges ) {
 
-	test( "floyd #" + label, function () {
+test( "floyd #" + label, t => {
 
 		var prev, dist, used, ref, left, predicate;
 
@@ -70,7 +70,7 @@ one = function ( label, n, edges ) {
 		amat( g, n, d );
 		floyd( n, d );
 
-		deepEqual( d, dist, "dist" );
+		t.deepEqual( d, dist, "dist" );
 
 	});
 

test/src/undirected/offline/algo/sp/sptreedfs.js

@@ -1,12 +1,12 @@
+import test from 'ava';
 
-var one, binomialheap, functools;
 
-binomialheap = require( "@aureooms/js-binomial-heap" );
-functools = require( "@aureooms/js-functools" );
+import binomialheap from "@aureooms/js-binomial-heap" ;
+import functools from "@aureooms/js-functools" ;
 
-one = function ( label, n, edges ) {
+function one ( label, n, edges ) {
 
-	test( "sptreedfs #" + label, function () {
+test( "sptreedfs #" + label, t => {
 
 		var g, i, v, e, j, prev, dist, used, ref, left, predicate;
 
@@ -78,7 +78,7 @@ one = function ( label, n, edges ) {
 		sptreedfs( g, n, successors, d );
 
 
-		deepEqual( successors, next, "next" );
+		t.deepEqual( successors, next, "next" );
 
 	});
 

test/src/undirected/offline/algo/util/copy.js

@@ -1,7 +1,8 @@
+import test from 'ava';
 
 var check = function(label, n, edges){
 
-	test('copy', function(){
+test( 'copy', t => {
 
 		var DGraph = gn.dense_graph_t();
 		var SGraph = gn.sparse_graph_t();
@@ -34,7 +35,7 @@ var check = function(label, n, edges){
 		amat(G, n, dist_G);
 		amat(H, n, dist_H);
 
-		deepEqual(dist_G, dist_H, 'H === copy(G)');
+		t.deepEqual(dist_G, dist_H, 'H === copy(G)');
 
 
 
@@ -61,7 +62,7 @@ var check = function(label, n, edges){
 		amat(G, n, dist_G);
 		amat(H, n, dist_H);
 
-		deepEqual(dist_G, dist_H, 'H === copy(G)');
+		t.deepEqual(dist_G, dist_H, 'H === copy(G)');
 
 
 	});

test/src/undirected/online/data/aeitr.js

@@ -1,7 +1,8 @@
+import test from 'ava';
 
 var check = function(label, n, edges){
 
-	test('aeitr', function(){
+test( 'aeitr', t => {
 
 		var DGraph = gn.dense_graph_t();
 		var SGraph = gn.sparse_graph_t();
@@ -49,7 +50,7 @@ var check = function(label, n, edges){
 		G.aeitr(push_expected);
 
 
-		deepEqual(seq[0], seq[1], 'sparse aeitr consistent');
+		t.deepEqual(seq[0], seq[1], 'sparse aeitr consistent');
 
 
 		e = undefined;
@@ -63,7 +64,7 @@ var check = function(label, n, edges){
 		H.aeitr(push_expected);
 
 
-		deepEqual(seq[0], seq[1], 'dense aeitr consistent');
+		t.deepEqual(seq[0], seq[1], 'dense aeitr consistent');
 
 
 	});