🤖 config(xo): Configure import/order.

These changes were automatically generated by a transform whose code can be found at:
  - https://github.com/make-github-pseudonymous-again/rejuvenate/blob/31b7e48f29789fa2e2ad9e16013ff277c3bbca57/src/transforms/xo:config-import-order.js
Please contact the author of the transform if you believe there was an error.

Author: a-flying-potato

package.json

@@ -103,7 +103,7 @@
     "pinst": "3.0.0",
     "power-assert": "1.6.1",
     "regenerator-runtime": "0.14.1",
-    "xo": "0.53.1"
+    "xo": "0.57.0"
   },
   "ava": {
     "files": [
@@ -219,7 +219,43 @@
       "unicorn/prefer-math-trunc": "off",
       "unicorn/no-new-array": "off",
       "no-negated-condition": "off",
-      "unicorn/prefer-node-protocol": "off"
+      "unicorn/prefer-node-protocol": "off",
+      "import/order": [
+        "error",
+        {
+          "groups": [
+            "builtin",
+            "external",
+            "internal",
+            "parent",
+            "sibling",
+            "index",
+            "object",
+            "type"
+          ],
+          "pathGroups": [
+            {
+              "pattern": "ava",
+              "group": "external",
+              "position": "before"
+            },
+            {
+              "pattern": "#module",
+              "group": "index",
+              "position": "after"
+            }
+          ],
+          "pathGroupsExcludedImportTypes": [],
+          "distinctGroup": true,
+          "newlines-between": "always",
+          "alphabetize": {
+            "order": "asc",
+            "orderImportKind": "asc",
+            "caseInsensitive": false
+          },
+          "warnOnUnassignedImports": true
+        }
+      ]
     },
     "overrides": [
       {

src/maxback/_contract.js

@@ -9,8 +9,8 @@ import {head} from '@iterable-iterator/slice';
  * @returns {Map}
  */
 export default function _contract(G, ordering) {
-	const u = ordering[ordering.length - 2];
-	const v = ordering[ordering.length - 1];
+	const u = ordering.at(-2);
+	const v = ordering.at(-1);
 
 	const H = new Map();
 

src/maxback/_order.js

@@ -1,6 +1,6 @@
+import {PairingHeap as Heap} from '@heap-data-structure/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
@@ -15,7 +15,6 @@ export default function* _order(G) {
 
 	for (const v of G.keys()) refs.set(v, heap.push({weight: 0, vertex: v}));
 
-	// eslint-disable-next-line no-unused-vars
 	for (const _ of G) {
 		const max = heap.pop();
 		const u = max.vertex;

src/maxback/_smallcuts.js

@@ -1,8 +1,8 @@
 import {list} from '@iterable-iterator/list';
 import {map} from '@iterable-iterator/map';
 
-import _order from './_order.js';
 import _contract from './_contract.js';
+import _order from './_order.js';
 
 /**
  * Yields the small cuts of undirected unweighted connected loopless multigraph G.
@@ -18,8 +18,8 @@ export default function* _smallcuts(G) {
 
 	while (H.size >= 2) {
 		const ordering = list(_order(H)); // Compute the max-back order
-		const [x] = ordering[ordering.length - 2];
-		const [y, cutsize] = ordering[ordering.length - 1];
+		const [x] = ordering.at(-2);
+		const [y, cutsize] = ordering.at(-1);
 
 		yield [new Set(id.get(y)), cutsize]; // Yield a small cut with its size
 

src/maxback/maxback.js

@@ -1,5 +1,6 @@
 import adj from '../adj.js';
 import outgoingedges from '../outgoingedges.js';
+
 import mb from './mb.js';
 
 /**

test/src/mincut.js

@@ -1,8 +1,10 @@
 import test from 'ava';
+
 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 {increasing} from '@total-order/primitive';
+
 import {mincut} from '#module';
 
 function order(edge) {