😒 chore: Rename package.

Author: make-github-pseudonymous-again

.esdoc.json

@@ -17,7 +17,7 @@
           "autoPrivate": true
         },
         "brand": {
-          "title": "@aureooms/js-topological-sorting"
+          "title": "@graph-algorithm/topological-sorting"
         },
         "test": {
           "type": "ava",

README.md

@@ -1,36 +1,36 @@
-:oden: [@aureooms/js-topological-sorting](https://make-github-pseudonymous-again.github.io/js-topological-sorting)
+:oden: [@graph-algorithm/topological-sorting](https://graph-algorithm.github.io/topological-sorting)
 ==
 
 Topological sorting algorithms for JavaScript.
-See [docs](https://make-github-pseudonymous-again.github.io/js-topological-sorting/index.html).
+See [docs](https://graph-algorithm.github.io/topological-sorting/index.html).
 
 > :warning: The code requires `regeneratorRuntime` to be defined, for instance by importing
 > [regenerator-runtime/runtime](https://www.npmjs.com/package/regenerator-runtime).
 
 ```js
 // Sort anything that can be iterated over with `for (const [u, v] of ...)`
-import {sorted} from '@aureooms/js-topological-sorting';
+import {sorted} from '@graph-algorithm/topological-sorting';
 sorted(["ab", "bc"]); // abc
 
 // Add a comparison function to break ties.
-import {increasing} from '@aureooms/js-compare';
+import {increasing} from '@total-order/primitive';
 sorted(["ab", "cd"], increasing); // abcd
 
-import {decreasing} from '@aureooms/js-compare';
+import {decreasing} from '@total-order/primitive';
 sorted(["ab", "cd"], decreasing); // cdab
 ```
 
-[![License](https://img.shields.io/github/license/make-github-pseudonymous-again/js-topological-sorting.svg)](https://raw.githubusercontent.com/make-github-pseudonymous-again/js-topological-sorting/main/LICENSE)
-[![Version](https://img.shields.io/npm/v/@aureooms/js-topological-sorting.svg)](https://www.npmjs.org/package/@aureooms/js-topological-sorting)
-[![Tests](https://img.shields.io/github/workflow/status/make-github-pseudonymous-again/js-topological-sorting/ci:test?event=push&label=tests)](https://github.com/make-github-pseudonymous-again/js-topological-sorting/actions/workflows/ci:test.yml?query=branch:main)
-[![Dependencies](https://img.shields.io/david/make-github-pseudonymous-again/js-topological-sorting.svg)](https://david-dm.org/make-github-pseudonymous-again/js-topological-sorting)
-[![Dev dependencies](https://img.shields.io/david/dev/make-github-pseudonymous-again/js-topological-sorting.svg)](https://david-dm.org/make-github-pseudonymous-again/js-topological-sorting?type=dev)
-[![GitHub issues](https://img.shields.io/github/issues/make-github-pseudonymous-again/js-topological-sorting.svg)](https://github.com/make-github-pseudonymous-again/js-topological-sorting/issues)
-[![Downloads](https://img.shields.io/npm/dm/@aureooms/js-topological-sorting.svg)](https://www.npmjs.org/package/@aureooms/js-topological-sorting)
+[![License](https://img.shields.io/github/license/graph-algorithm/topological-sorting.svg)](https://raw.githubusercontent.com/graph-algorithm/topological-sorting/main/LICENSE)
+[![Version](https://img.shields.io/npm/v/@graph-algorithm/topological-sorting.svg)](https://www.npmjs.org/package/@graph-algorithm/topological-sorting)
+[![Tests](https://img.shields.io/github/workflow/status/graph-algorithm/topological-sorting/ci:test?event=push&label=tests)](https://github.com/graph-algorithm/topological-sorting/actions/workflows/ci:test.yml?query=branch:main)
+[![Dependencies](https://img.shields.io/david/graph-algorithm/topological-sorting.svg)](https://david-dm.org/graph-algorithm/topological-sorting)
+[![Dev dependencies](https://img.shields.io/david/dev/graph-algorithm/topological-sorting.svg)](https://david-dm.org/graph-algorithm/topological-sorting?type=dev)
+[![GitHub issues](https://img.shields.io/github/issues/graph-algorithm/topological-sorting.svg)](https://github.com/graph-algorithm/topological-sorting/issues)
+[![Downloads](https://img.shields.io/npm/dm/@graph-algorithm/topological-sorting.svg)](https://www.npmjs.org/package/@graph-algorithm/topological-sorting)
 
-[![Code issues](https://img.shields.io/codeclimate/issues/make-github-pseudonymous-again/js-topological-sorting.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-topological-sorting/issues)
-[![Code maintainability](https://img.shields.io/codeclimate/maintainability/make-github-pseudonymous-again/js-topological-sorting.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-topological-sorting/trends/churn)
-[![Code coverage (cov)](https://img.shields.io/codecov/c/gh/make-github-pseudonymous-again/js-topological-sorting/main.svg)](https://codecov.io/gh/make-github-pseudonymous-again/js-topological-sorting)
-[![Code technical debt](https://img.shields.io/codeclimate/tech-debt/make-github-pseudonymous-again/js-topological-sorting.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-topological-sorting/trends/technical_debt)
-[![Documentation](https://make-github-pseudonymous-again.github.io/js-topological-sorting/badge.svg)](https://make-github-pseudonymous-again.github.io/js-topological-sorting/source.html)
-[![Package size](https://img.shields.io/bundlephobia/minzip/@aureooms/js-topological-sorting)](https://bundlephobia.com/result?p=@aureooms/js-topological-sorting)
+[![Code issues](https://img.shields.io/codeclimate/issues/graph-algorithm/topological-sorting.svg)](https://codeclimate.com/github/graph-algorithm/topological-sorting/issues)
+[![Code maintainability](https://img.shields.io/codeclimate/maintainability/graph-algorithm/topological-sorting.svg)](https://codeclimate.com/github/graph-algorithm/topological-sorting/trends/churn)
+[![Code coverage (cov)](https://img.shields.io/codecov/c/gh/graph-algorithm/topological-sorting/main.svg)](https://codecov.io/gh/graph-algorithm/topological-sorting)
+[![Code technical debt](https://img.shields.io/codeclimate/tech-debt/graph-algorithm/topological-sorting.svg)](https://codeclimate.com/github/graph-algorithm/topological-sorting/trends/technical_debt)
+[![Documentation](https://graph-algorithm.github.io/topological-sorting/badge.svg)](https://graph-algorithm.github.io/topological-sorting/source.html)
+[![Package size](https://img.shields.io/bundlephobia/minzip/@graph-algorithm/topological-sorting)](https://bundlephobia.com/result?p=@graph-algorithm/topological-sorting)

doc/manual/example.md

@@ -1,3 +1,3 @@
 # Examples
 
-> More examples in [the test files](https://github.com/make-github-pseudonymous-again/js-topological-sorting/tree/main/test/src).
+> More examples in [the test files](https://github.com/graph-algorithm/topological-sorting/tree/main/test/src).

doc/manual/installation.md

@@ -8,15 +8,15 @@ or [jspm](https://jspm.org/docs).
 
 ### yarn
 ```terminal
-yarn add @aureooms/js-topological-sorting
+yarn add @graph-algorithm/topological-sorting
 ```
 
 ### npm
 ```terminal
-npm install @aureooms/js-topological-sorting --save
+npm install @graph-algorithm/topological-sorting --save
 ```
 
 ### jspm
 ```terminal
-jspm install npm:@aureooms/js-topological-sorting
+jspm install npm:@graph-algorithm/topological-sorting
 ```

doc/manual/usage.md

@@ -12,7 +12,7 @@ import 'regenerator-runtime/runtime.js' ;
 
 Then, import the library where needed
 ```js
-const topologicalSorting = require( '@aureooms/js-topological-sorting' ) ;
+const topologicalSorting = require( '@graph-algorithm/topological-sorting' ) ;
 // or
-import * as topologicalSorting from '@aureooms/js-topological-sorting' ;
+import * as topologicalSorting from '@graph-algorithm/topological-sorting' ;
 ```

doc/scripts/header.js

@@ -10,15 +10,15 @@ const domReady = function (callback) {
 domReady(() => {
 	const projectname = document.createElement('a');
 	projectname.classList.add('project-name');
-	projectname.text = 'aureooms/js-topological-sorting';
+	projectname.text = 'graph-algorithm/topological-sorting';
 	projectname.href = './index.html';
 
 	const header = document.querySelector('header');
 	header.insertBefore(projectname, header.firstChild);
 
 	const testlink = document.querySelector('header > a[data-ice="testLink"]');
 	testlink.href =
-		'https://coveralls.io/github/make-github-pseudonymous-again/js-topological-sorting';
+		'https://coveralls.io/github/graph-algorithm/topological-sorting';
 	testlink.target = '_BLANK';
 
 	const searchBox = document.querySelector('.search-box');

package.json

@@ -1,16 +1,16 @@
 {
-  "name": "@aureooms/js-topological-sorting",
+  "name": "@graph-algorithm/topological-sorting",
   "description": "Topological sorting for JavaScript",
   "version": "0.2.2",
   "license": "AGPL-3.0",
-  "author": "aureooms",
-  "homepage": "https://make-github-pseudonymous-again.github.io/js-topological-sorting",
+  "author": "make-github-pseudonymous-again",
+  "homepage": "https://graph-algorithm.github.io/topological-sorting",
   "repository": {
     "type": "git",
-    "url": "https://github.com/make-github-pseudonymous-again/js-topological-sorting"
+    "url": "https://github.com/graph-algorithm/topological-sorting"
   },
   "bugs": {
-    "url": "https://github.com/make-github-pseudonymous-again/js-topological-sorting/issues"
+    "url": "https://github.com/graph-algorithm/topological-sorting/issues"
   },
   "keywords": [
     "acyclic",
@@ -61,19 +61,23 @@
     "test": "ava"
   },
   "dependencies": {
-    "@aureooms/js-pairing-heap": "^3.0.0",
-    "@data-structure/pairs": "^4.0.0"
+    "@collection-abstraction/pairs": "^5.0.0",
+    "@heap-data-structure/pairing-heap": "^4.0.0"
   },
   "devDependencies": {
-    "@aureooms/js-collections-counter": "5.0.0",
-    "@aureooms/js-compare": "2.0.1",
-    "@aureooms/js-itertools": "5.1.1",
     "@babel/cli": "7.14.8",
     "@babel/core": "7.14.8",
     "@babel/preset-env": "7.14.8",
     "@babel/register": "7.14.5",
+    "@collection-abstraction/counter": "6.0.0",
     "@commitlint/cli": "13.1.0",
+    "@iterable-iterator/list": "^1.0.1",
+    "@iterable-iterator/map": "^1.0.1",
+    "@iterable-iterator/range": "^2.0.1",
     "@js-library/commitlint-config": "0.0.4",
+    "@total-order/key": "^1.0.0",
+    "@total-order/lex": "^1.0.0",
+    "@total-order/primitive": "^1.0.1",
     "ava": "3.15.0",
     "babel-plugin-transform-remove-console": "6.9.4",
     "babel-plugin-unassert": "3.1.0",
@@ -88,7 +92,7 @@
     "fixpack": "4.0.0",
     "husky": "7.0.1",
     "lint-staged": "11.1.1",
-    "microbundle": "0.13.3",
+    "microbundle": "0.13.1",
     "np": "7.5.0",
     "pinst": "2.1.6",
     "power-assert": "1.6.1",

src/sorted.js

@@ -1,5 +1,5 @@
-import {PairingHeap as Heap} from '@aureooms/js-pairing-heap';
-import {EfficientlyInvertiblePairs as Pairs} from '@data-structure/pairs';
+import {PairingHeap as Heap} from '@heap-data-structure/pairing-heap';
+import {EfficientlyInvertiblePairs as Pairs} from '@collection-abstraction/pairs';
 
 import subroutine from './subroutine.js';
 
@@ -19,7 +19,7 @@ export default function* sorted(edges, breakTies = undefined) {
 
 	if (graph.size > 0) {
 		throw new Error(
-			'@aureooms/js-topological-sorting#sorted: input graph contains a cycle',
+			'@graph-algorithm/topological-sorting#sorted: input graph contains a cycle',
 		);
 	}
 }

test/src/api/sorted.js

@@ -1,14 +1,13 @@
 import test from 'ava';
 
-import {map, list, range} from '@aureooms/js-itertools';
-import {
-	increasing,
-	decreasing,
-	colexicographical,
-	fn,
-} from '@aureooms/js-compare';
-import {EfficientlyInvertiblePairs as Pairs} from '@data-structure/pairs';
-import counter from '@aureooms/js-collections-counter';
+import {map} from '@iterable-iterator/map';
+import {list} from '@iterable-iterator/list';
+import {range} from '@iterable-iterator/range';
+import {increasing, decreasing} from '@total-order/primitive';
+import {colexicographical} from '@total-order/lex';
+import {key} from '@total-order/key';
+import {EfficientlyInvertiblePairs as Pairs} from '@collection-abstraction/pairs';
+import {counter} from '@collection-abstraction/counter';
 import {sorted} from '../../../src/index.js';
 
 // https://en.wikipedia.org/wiki/Topological_sorting
@@ -98,7 +97,7 @@ test('Coffman-Graham Algorithm step 2', (t) => {
 	const N = (u) => order.get(u);
 
 	const linearOrderOnDecreasingSequences = colexicographical(increasing);
-	const colexOrder = fn(linearOrderOnDecreasingSequences, N);
+	const colexOrder = key(linearOrderOnDecreasingSequences, N);
 
 	const breakTies = (u, v) => colexOrder(u, v) || increasing(u, v);