🎨 style: Lint with xo.

Author: make-github-pseudonymous-again

package.json

@@ -100,7 +100,8 @@
     "np": "6.5.0",
     "nyc": "15.1.0",
     "power-assert": "1.6.1",
-    "regenerator-runtime": "0.13.7"
+    "regenerator-runtime": "0.13.7",
+    "xo": "^0.33.1"
   },
   "files": [
     "lib"
@@ -125,11 +126,21 @@
     "cover": "nyc --reporter=lcov npm test",
     "dev": "npm run lint -- --fix && npm run cover -- -- -st --fail-fast",
     "esdoc": "esdoc",
-    "lint": "true",
+    "lint": "xo",
     "prepare": "npm run build",
     "release": "np",
     "test": "ava",
     "travis": "npm run lint && npm run cover"
   },
-  "sideEffects": false
+  "sideEffects": false,
+  "xo": {
+    "prettier": true,
+    "ignore": [
+      "lib",
+      "doc"
+    ],
+    "plugins": [
+      "unicorn"
+    ]
+  }
 }

src/fordjohnson.js

@@ -1,93 +1,74 @@
+export default function fordjohnson(binarysearch) {
+	const sort = function (compare, swap, a, i, j) {
+		if (j - i < 2) return;
 
-export default function fordjohnson ( binarysearch ) {
+		const m = ((j - i) / 2) | 0;
+		let k = m;
 
-	const sort = function ( compare , swap , a , i , j ) {
-
-		var m , k , t , y , p , q , r , x , l , w , s , pairswap ;
-
-		if ( j - i < 2 ) return ;
-
-		k = m = ( j - i ) / 2 | 0 ;
-
-		// compare pairs of elements and put largest elements at the front of the
+		// Compare pairs of elements and put largest elements at the front of the
 		// array
 
-		while ( k-- ) {
-
-			if ( compare( a[i+k] , a[i+m+k] ) < 0 ) {
-
-				swap( a , i + k , i + m + k ) ;
-
+		while (k--) {
+			if (compare(a[i + k], a[i + m + k]) < 0) {
+				swap(a, i + k, i + m + k);
 			}
-
 		}
 
-		// sort the largest elements at the front recursively
-
-		pairswap = function ( a , i , j ) {
-			swap( a , i , j ) ;
-			swap( a , i + m , j + m ) ;
-		} ;
-
-		sort( compare , pairswap , a , i , i + m ) ;
-
-		// merge the rest of the array into the front, one item at a time
+		// Sort the largest elements at the front recursively
 
-		p = y = t = 1 ;
+		const pairswap = function (a, i, j) {
+			swap(a, i, j);
+			swap(a, i + m, j + m);
+		};
 
-		q = 0 ;
+		sort(compare, pairswap, a, i, i + m);
 
-		while ( i + m + t <= j ) {
+		// Merge the rest of the array into the front, one item at a time
 
-			r = t ;
+		let p = 1;
+		let y = 1;
+		let t = 1;
 
-			while ( r --> q ) {
+		let q = 0;
 
-				w = a[i+m+t-1] ;
+		while (i + m + t <= j) {
+			let r = t;
 
-				x = binarysearch( compare , a , i , i + m + q , w ) ;
-				l = x[0] + x[1] ;
+			while (r-- > q) {
+				const w = a[i + m + t - 1];
 
-				s = i + m + t ;
+				const x = binarysearch(compare, a, i, i + m + q, w);
+				const l = x[0] + x[1];
 
-				while ( --s > l ) {
-
-					swap( a , s , s - 1 ) ;
+				let s = i + m + t;
 
+				while (--s > l) {
+					swap(a, s, s - 1);
 				}
-
 			}
 
-			q = t ;
-
-			p *= 2 ;
-			y = p - 2 * t ;
-			t += y ;
+			q = t;
 
+			p *= 2;
+			y = p - 2 * t;
+			t += y;
 		}
 
-		r = j - i - m ;
-
-		while ( r --> q ) {
-
-			w = a[j-1] ;
+		let r = j - i - m;
 
-			x = binarysearch( compare , a , i , i + m + q , w ) ;
-			l = x[0] + x[1] ;
+		while (r-- > q) {
+			const w = a[j - 1];
 
-			s = j ;
+			const x = binarysearch(compare, a, i, i + m + q, w);
+			const l = x[0] + x[1];
 
-			while ( --s > l ) {
-
-				swap( a , s , s - 1 ) ;
+			let s = j;
 
+			while (--s > l) {
+				swap(a, s, s - 1);
 			}
-
-
 		}
+	};
 
-	} ;
-
-	return sort ;
-
+	return sort;
 }

src/index.js

@@ -1,10 +1,8 @@
-import fordjohnson from './fordjohnson' ;
+import fordjohnson from './fordjohnson';
 
 /* eslint import/no-anonymous-default-export: [2, {"allowObject": true}] */
 export default {
-	fordjohnson ,
-} ;
+	fordjohnson
+};
 
-export {
-	fordjohnson ,
-} ;
+export {fordjohnson};

test/src/spec.js

@@ -1,12 +1,13 @@
-import ava from 'ava' ;
+// eslint-disable-next-line ava/use-test
+import ava from 'ava';
 
-import * as spec from "@aureooms/js-in-situ-sort-spec" ;
+import * as spec from '@aureooms/js-in-situ-sort-spec';
 
-import { swap } from "@aureooms/js-array" ;
-import { binarysearch } from "@aureooms/js-search" ;
-import {fordjohnson} from "../../src" ;
+import {swap} from '@aureooms/js-array';
+import {binarysearch} from '@aureooms/js-search';
+import {fordjohnson} from '../../src';
 
-const fj = fordjohnson( binarysearch ) ;
-const sort = (compare, a, i, j) => fj(compare, swap, a, i, j) ;
+const fj = fordjohnson(binarysearch);
+const sort = (compare, a, i, j) => fj(compare, swap, a, i, j);
 
-spec.test( ava , [ [ "fordjohnson" , sort ] ] ) ;
+spec.test(ava, [['fordjohnson', sort]]);