⬆️ deps: Upgrade.

Author: make-github-pseudonymous-again

package.json

@@ -60,16 +60,22 @@
     "test": "ava"
   },
   "dependencies": {
-    "@aureooms/js-compare": "^2.0.0",
-    "@aureooms/js-itertools": "^5.1.0",
-    "@aureooms/js-pairing-heap": "^3.0.0"
+    "@heap-data-structure/pairing-heap": "^4.0.0",
+    "@iterable-iterator/list": "^1.0.1",
+    "@iterable-iterator/map": "^1.0.1",
+    "@iterable-iterator/reduce": "^1.0.1",
+    "@iterable-iterator/slice": "^1.0.1",
+    "@total-order/key": "^1.0.0",
+    "@total-order/primitive": "^1.0.1"
   },
   "devDependencies": {
     "@babel/core": "7.14.8",
     "@babel/preset-env": "7.14.8",
     "@babel/register": "7.14.5",
     "@commitlint/cli": "12.1.4",
+    "@iterable-iterator/sorted": "^1.0.0",
     "@js-library/commitlint-config": "0.0.4",
+    "@total-order/lex": "^1.0.0",
     "ava": "3.15.0",
     "babel-plugin-transform-remove-console": "6.9.4",
     "babel-plugin-unassert": "3.1.0",

src/maxback/_contract.js

@@ -1,4 +1,4 @@
-import {head} from '@aureooms/js-itertools';
+import {head} from '@iterable-iterator/slice';
 
 /**
  * Given G and some ordering, computes the graph H obtained from G by

src/maxback/_order.js

@@ -1,5 +1,6 @@
-import {attr, decreasing} from '@aureooms/js-compare';
-import {PairingHeap as Heap} from '@aureooms/js-pairing-heap';
+import {prop} from '@total-order/key';
+import {decreasing} from '@total-order/primitive';
+import {PairingHeap as Heap} from '@heap-data-structure/pairing-heap';
 
 /**
  * Lists the vertices of an undirected unweighted connected loopless multigraph
@@ -9,7 +10,7 @@ import {PairingHeap as Heap} from '@aureooms/js-pairing-heap';
  * @returns {Iterable} The vertices of G in max-back order.
  */
 export default function* _order(G) {
-	const heap = new Heap(attr(decreasing, 'weight'));
+	const heap = new Heap(prop(decreasing, 'weight'));
 	const refs = new Map();
 
 	for (const v of G.keys()) refs.set(v, heap.push({weight: 0, vertex: v}));

src/maxback/_smallcuts.js

@@ -1,4 +1,5 @@
-import {list, map} from '@aureooms/js-itertools';
+import {list} from '@iterable-iterator/list';
+import {map} from '@iterable-iterator/map';
 
 import _order from './_order.js';
 import _contract from './_contract.js';

src/maxback/mb.js

@@ -1,5 +1,6 @@
-import {min} from '@aureooms/js-itertools';
-import {attr, increasing} from '@aureooms/js-compare';
+import {min} from '@iterable-iterator/reduce';
+import {prop} from '@total-order/key';
+import {increasing} from '@total-order/primitive';
 
 import _smallcuts from './_smallcuts.js';
 
@@ -10,5 +11,5 @@ import _smallcuts from './_smallcuts.js';
  * @returns {Array} A pair <code>[U,cutsize]</code> reprensenting a minimum cut of G.
  */
 export default function mb(G) {
-	return min(attr(increasing, 1), _smallcuts(G), undefined);
+	return min(prop(increasing, 1), _smallcuts(G), undefined);
 }

test/src/mincut.js

@@ -1,6 +1,8 @@
 import test from 'ava';
-import {map, sorted} from '@aureooms/js-itertools';
-import {increasing, fixedlexicographical} from '@aureooms/js-compare';
+import {map} from '@iterable-iterator/map';
+import {sorted} from '@iterable-iterator/sorted';
+import {increasing} from '@total-order/primitive';
+import {fixedlexicographical} from '@total-order/lex';
 import {mincut} from '../../src/index.js';
 
 function order(edge) {