👕 refactor: Initial lint.

Author: make-github-pseudonymous-again

package.json

@@ -101,7 +101,7 @@
     "pinst": "2.1.6",
     "power-assert": "1.6.1",
     "regenerator-runtime": "0.13.9",
-    "xo": "0.36.1"
+    "xo": "0.47.0"
   },
   "ava": {
     "files": [
@@ -203,6 +203,7 @@
   "xo": {
     "prettier": true,
     "rules": {
+      "no-bitwise": "off",
       "unicorn/filename-case": [
         "error",
         {

src/array/api/index.js

@@ -1,31 +1,8 @@
-import sort from './sort.js';
-import sortFloat32 from './sortFloat32.js';
-import sortInt16 from './sortInt16.js';
-import sortInt32 from './sortInt32.js';
-import sortInt8 from './sortInt8.js';
-import sortUint16 from './sortUint16.js';
-import sortUint32 from './sortUint32.js';
-import sortUint8 from './sortUint8.js';
-
-/* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
-export default {
-	sort,
-	sortFloat32,
-	sortInt16,
-	sortInt32,
-	sortInt8,
-	sortUint16,
-	sortUint32,
-	sortUint8
-};
-
-export {
-	sort,
-	sortFloat32,
-	sortInt16,
-	sortInt32,
-	sortInt8,
-	sortUint16,
-	sortUint32,
-	sortUint8
-};
+export {default as sort} from './sort.js';
+export {default as sortInt16} from './sortInt16.js';
+export {default as sortFloat32} from './sortFloat32.js';
+export {default as sortInt8} from './sortInt8.js';
+export {default as sortInt32} from './sortInt32.js';
+export {default as sortUint32} from './sortUint32.js';
+export {default as sortUint16} from './sortUint16.js';
+export {default as sortUint8} from './sortUint8.js';

src/array/api/sort.js

@@ -15,6 +15,7 @@ const sort = (k, M, tuples) => {
 		return tuples;
 	}
 
+	// eslint-disable-next-line unicorn/no-new-array
 	const output = new Array(N);
 	if (k >= 1) {
 		return sortFixedLengthTuples(k, M, tuples, output, 0, N);

src/array/api/sortFloat32.js

@@ -3,12 +3,12 @@ import sortUint32 from './sortUint32.js';
 // http://www.codercorner.com/RadixSortRevisited.htm
 // http://stereopsis.com/radix.html
 const floatFlip = (f) => {
-	const mask = -(f >>> 31) | 0x80000000;
+	const mask = -(f >>> 31) | 0x80_00_00_00;
 	return f ^ mask;
 };
 
 const iFloatFlip = (f) => {
-	const mask = ((f >>> 31) - 1) | 0x80000000;
+	const mask = ((f >>> 31) - 1) | 0x80_00_00_00;
 	return f ^ mask;
 };
 

src/array/api/sortUint16.js

@@ -5,8 +5,8 @@ const sortUint16 = (array) => {
 	const M = 2 ** 8;
 	// TODO avoid copying back and forth
 	const tuples = Array.prototype.map.call(array, (x) => [
-		(x & 0xff00) >>> 8,
-		(x & 0xff) >>> 0
+		(x & 0xff_00) >>> 8,
+		(x & 0xff) >>> 0,
 	]);
 	const output = sort(k, M, tuples);
 	return Array.prototype.map.call(output, ([c, d]) => ((c << 8) | d) >>> 0);

src/array/api/sortUint32.js

@@ -5,15 +5,15 @@ const sortUint32 = (array) => {
 	const M = 2 ** 8; // TODO another good option is k = 3 M = 2**11
 	// TODO avoid copying back and forth
 	const tuples = Array.prototype.map.call(array, (x) => [
-		(x & 0xff000000) >>> 24,
-		(x & 0xff0000) >>> 16,
-		(x & 0xff00) >>> 8,
-		(x & 0xff) >>> 0
+		(x & 0xff_00_00_00) >>> 24,
+		(x & 0xff_00_00) >>> 16,
+		(x & 0xff_00) >>> 8,
+		(x & 0xff) >>> 0,
 	]);
 	const output = sort(k, M, tuples);
 	return Array.prototype.map.call(
 		output,
-		([a, b, c, d]) => ((a << 24) | (b << 16) | (c << 8) | d) >>> 0
+		([a, b, c, d]) => ((a << 24) | (b << 16) | (c << 8) | d) >>> 0,
 	);
 };
 

src/array/core/reset.js

@@ -1,3 +1,4 @@
 import fill from './fill.js';
+
 const reset = (array, i, j) => fill(array, 0, i, j);
 export default reset;

src/index.js

@@ -1,33 +1,10 @@
-import {
+export {
 	sort,
-	sortFloat32,
 	sortInt16,
-	sortInt32,
-	sortInt8,
-	sortUint16,
-	sortUint32,
-	sortUint8
-} from './array/api/index.js';
-
-/* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
-export default {
-	sort,
 	sortFloat32,
-	sortInt16,
-	sortInt32,
 	sortInt8,
-	sortUint16,
-	sortUint32,
-	sortUint8
-};
-
-export {
-	sort,
-	sortFloat32,
-	sortInt16,
 	sortInt32,
-	sortInt8,
 	sortUint16,
+	sortUint8,
 	sortUint32,
-	sortUint8
-};
+} from './array/api/index.js';

test/_old/nodes.js

@@ -23,9 +23,11 @@ export function nodes(lsb, head, hi, lo, si, sj) {
 
 	while (head !== null) {
 		if (lsb(head.value, si) === 0) {
-			_lo = _lo.next = head;
+			_lo.next = head;
+			_lo = head;
 		} else {
-			_hi = _hi.next = head;
+			_hi.next = head;
+			_hi = head;
 		}
 
 		head = head.next;

test/src/api/sort.js

@@ -1,5 +1,5 @@
-import test from 'ava';
 import {AssertionError} from 'assert';
+import test from 'ava';
 import {list} from '@iterable-iterator/list';
 import {all} from '@iterable-iterator/reduce';
 import {map} from '@iterable-iterator/map';
@@ -48,7 +48,7 @@ test(throws, 2, 2, [[1], [0]]);
 test(throws, 3, 3, [
 	[2, 1, 3],
 	[3, 2, 1],
-	[1, 2, 3]
+	[1, 2, 3],
 ]);
 
 // Degenerates to counting sort
@@ -59,14 +59,14 @@ test(singletons, 3, [0, 2, 1]);
 test(limbs, 3, 3, [
 	[2, 1, 0],
 	[0, 2, 1],
-	[1, 2, 0]
+	[1, 2, 0],
 ]);
 
 // Custom radix
 test(limbs, 3, 4, [
 	[2, 1, 3],
 	[3, 2, 1],
-	[1, 2, 3]
+	[1, 2, 3],
 ]);
 
 test('Wikipedia example', limbs, 3, 10, [
@@ -77,7 +77,7 @@ test('Wikipedia example', limbs, 3, 10, [
 	[0, 0, 2],
 	[0, 2, 4],
 	[8, 0, 2],
-	[0, 6, 6]
+	[0, 6, 6],
 ]);
 
 // Variable tuple length
@@ -89,5 +89,5 @@ test(limbs, -1, 10, [
 	[2],
 	[8, 0, 2],
 	[2],
-	[6, 6]
+	[6, 6],
 ]);