👕 refactor: Lint all JavaScript files.

Author: make-github-pseudonymous-again

doc/scripts/header.js

@@ -1,34 +1,30 @@
-var domReady = function(callback) {
-	var state = document.readyState ;
-    if ( state === 'interactive' || state === 'complete' ) {
-		callback() ;
-	}
-	else {
+const domReady = function (callback) {
+	const state = document.readyState;
+	if (state === 'interactive' || state === 'complete') {
+		callback();
+	} else {
 		document.addEventListener('DOMContentLoaded', callback);
 	}
-} ;
-
+};
 
-domReady(function(){
-
-	var projectname = document.createElement('a');
+domReady(() => {
+	const projectname = document.createElement('a');
 	projectname.classList.add('project-name');
 	projectname.text = 'aureooms/js-mincut';
-	projectname.href = './index.html' ;
+	projectname.href = './index.html';
 
-	var header = document.getElementsByTagName('header')[0] ;
-	header.insertBefore(projectname,header.firstChild);
+	const header = document.querySelectorAll('header')[0];
+	header.insertBefore(projectname, header.firstChild);
 
-	var testlink = document.querySelector('header > a[data-ice="testLink"]') ;
-	testlink.href = 'https://coveralls.io/github/aureooms/js-mincut' ;
-	testlink.target = '_BLANK' ;
+	const testlink = document.querySelector('header > a[data-ice="testLink"]');
+	testlink.href = 'https://coveralls.io/github/aureooms/js-mincut';
+	testlink.target = '_BLANK';
 
-	var searchBox = document.querySelector('.search-box');
-	var input = document.querySelector('.search-input');
+	const searchBox = document.querySelector('.search-box');
+	const input = document.querySelector('.search-input');
 
-	// active search box when focus on searchBox.
-	input.addEventListener('focus', function(){
+	// Active search box when focus on searchBox.
+	input.addEventListener('focus', () => {
 		searchBox.classList.add('active');
 	});
-
 });

src/adj.js

@@ -1,18 +1,18 @@
-
 /**
  * Constructs the adjacency list for an undirected unweighted connected
  * loopless multigraph G given as a list of edges.
  *
  * @param {Iterable} edges The edges of G.
  * @returns {Map} The adjacency list G.
  */
-export default function adj ( edges ) {
+export default function adj(edges) {
 	const G = new Map();
-	for ( const [ u , v ] of edges ) {
-		if ( !G.has(u) ) G.set(u, []) ;
+	for (const [u, v] of edges) {
+		if (!G.has(u)) G.set(u, []);
 		G.get(u).push(v);
-		if ( !G.has(v) ) G.set(v, []) ;
+		if (!G.has(v)) G.set(v, []);
 		G.get(v).push(u);
 	}
+
 	return G;
 }

src/index.js

@@ -1,11 +1,7 @@
-import adj from "./adj.js" ;
-import maxback from "./maxback/index.js" ;
-import mincut from "./mincut.js" ;
+import adj from './adj.js';
+import maxback from './maxback/index.js';
+import mincut from './mincut.js';
 
-export default mincut ;
+export default mincut;
 
-export {
-	adj ,
-	maxback ,
-	mincut ,
-} ;
+export {adj, maxback, mincut};

src/maxback/_contract.js

@@ -1,4 +1,4 @@
-import { head } from '@aureooms/js-itertools' ;
+import {head} from '@aureooms/js-itertools';
 
 /**
  * Given G and some ordering, computes the graph H obtained from G by
@@ -8,26 +8,24 @@ import { head } from '@aureooms/js-itertools' ;
  * @param {Array} ordering
  * @returns {Map}
  */
-export default function _contract ( G, ordering ) {
-
-	const u = ordering[ordering.length-2];
-	const v = ordering[ordering.length-1];
+export default function _contract(G, ordering) {
+	const u = ordering[ordering.length - 2];
+	const v = ordering[ordering.length - 1];
 
 	const H = new Map();
 
-	// replace each edge xv by the edge xu, x != u ^ x != v
-	for ( const x of head( ordering , -2 ) ) {
+	// Replace each edge xv by the edge xu, x != u ^ x != v
+	for (const x of head(ordering, -2)) {
 		const n = [];
 		H.set(x, n);
-		for ( const y of G.get(x) ) n.push(y === v ? u : y);
+		for (const y of G.get(x)) n.push(y === v ? u : y);
 	}
 
 	const nx = [];
-	H.set(u,nx);
-	// keep all edges ux with, x != v (x != u is implied because G is loopless)
-	for ( const x of G.get(u) ) if ( x !== v ) nx.push(x);
-	// replace each edge vx by the edge ux, x != u ^ x != v
-	for ( const x of G.get(v) ) if ( x !== u && x !== v ) nx.push(x);
+	H.set(u, nx);
+	// Keep all edges ux with, x != v (x != u is implied because G is loopless)
+	for (const x of G.get(u)) if (x !== v) nx.push(x);
+	// Replace each edge vx by the edge ux, x != u ^ x != v
+	for (const x of G.get(v)) if (x !== u && x !== v) nx.push(x);
 	return H;
-
 }

src/maxback/_order.js

@@ -1,5 +1,5 @@
-import { attr , decreasing } from '@aureooms/js-compare' ;
-import { PairingHeap } from '@aureooms/js-pairing-heap' ;
+import {attr, decreasing} from '@aureooms/js-compare';
+import {PairingHeap} from '@aureooms/js-pairing-heap';
 
 /**
  * Lists the vertices of an undirected unweighted connected loopless multigraph
@@ -8,31 +8,28 @@ import { PairingHeap } from '@aureooms/js-pairing-heap' ;
  * @param {Map} G The adjacency list of G.
  * @returns {Iterable} The vertices of G in max-back order.
  */
-export default function* _order ( G ) {
-
-	const heap = new PairingHeap( attr( decreasing , 'weight' ) );
+export default function* _order(G) {
+	const heap = new PairingHeap(attr(decreasing, 'weight'));
 	const refs = new Map();
 
-	for ( const v of G.keys() ) refs.set(v, heap.push({ weight : 0 , vertex : v })) ;
-
-	for ( const _ of G ) {
+	for (const v of G.keys()) refs.set(v, heap.push({weight: 0, vertex: v}));
 
-		const max = heap.pop() ;
-		const u = max.vertex ;
-		yield [ u , max.weight ] ;
+	// eslint-disable-next-line no-unused-vars
+	for (const _ of G) {
+		const max = heap.pop();
+		const u = max.vertex;
+		yield [u, max.weight];
 		refs.delete(u);
 
-		// update keys
-		for ( const v of G.get(u) ) {
+		// Update keys
+		for (const v of G.get(u)) {
 			if (!refs.has(v)) continue;
 			const ref = refs.get(v);
-			// max heap so decrease-weight is used for +
+			// Max heap so decrease-weight is used for +
 			heap.decreasekey(ref, {
-				weight : ref.value.weight + 1 ,
-				vertex : ref.value.vertex
-			} );
+				weight: ref.value.weight + 1,
+				vertex: ref.value.vertex,
+			});
 		}
-
 	}
-
 }

src/maxback/_smallcuts.js

@@ -1,7 +1,7 @@
-import { list , map , head , filter , chain } from '@aureooms/js-itertools' ;
+import {list, map} from '@aureooms/js-itertools';
 
-import _order from "./_order.js" ;
-import _contract from "./_contract.js" ;
+import _order from './_order.js';
+import _contract from './_contract.js';
 
 /**
  * Yields the small cuts of undirected unweighted connected loopless multigraph G.
@@ -10,24 +10,20 @@ import _contract from "./_contract.js" ;
  * @param {Map} G The adjacency list of G.
  * @returns {Iterable} The small cuts of G.
  */
-export default function* _smallcuts ( G ) {
-
+export default function* _smallcuts(G) {
 	let H = G;
 	const id = new Map();
-	for ( const v of G.keys()) id.set(v,[v]);
-
-	while ( H.size >= 2 ) {
+	for (const v of G.keys()) id.set(v, [v]);
 
-		const ordering = list(_order(H)); // compute the max-back order
-		const [ x ] = ordering[ordering.length-2];
-		const [ y , cutsize ] = ordering[ordering.length-1];
+	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];
 
-		yield [ new Set(id.get(y)) , cutsize ] ; // yield a small cut with its size
+		yield [new Set(id.get(y)), cutsize]; // Yield a small cut with its size
 
-		id.set(x, id.get(x).concat(id.get(y))); // associate the last vertex with the penultimate one
-
-		H = _contract(H, list(map(([u,_]) => u , ordering))); // contract all edges between those two vertices
+		id.set(x, id.get(x).concat(id.get(y))); // Associate the last vertex with the penultimate one
 
+		H = _contract(H, list(map(([u, _]) => u, ordering))); // Contract all edges between those two vertices
 	}
-
 }

src/maxback/index.js

@@ -1,15 +1,9 @@
-import _contract from "./_contract.js" ;
-import _order from "./_order.js" ;
-import _smallcuts from "./_smallcuts.js" ;
-import maxback from "./maxback.js" ;
-import mb from "./mb.js" ;
+import _contract from './_contract.js';
+import _order from './_order.js';
+import _smallcuts from './_smallcuts.js';
+import maxback from './maxback.js';
+import mb from './mb.js';
 
-export default maxback ;
+export default maxback;
 
-export {
-	_contract ,
-	_order ,
-	_smallcuts ,
-	maxback ,
-	mb ,
-} ;
+export {_contract, _order, _smallcuts, maxback, mb};

src/maxback/maxback.js

@@ -1,15 +1,15 @@
-import adj from "../adj.js";
-import mb from "./mb.js";
-import outgoingedges from "../outgoingedges.js";
+import adj from '../adj.js';
+import mb from './mb.js';
+import outgoingedges from '../outgoingedges.js';
 
 /**
  * Convenience wrapper around Nagamochi-Ibaraki poly-time algorithm.
  *
  * @param {Iterable} edges List of edges of an undirected unweighted connected loopless multigraph G.
  * @returns {Iterable} An iterable over the edges of a minimum cut of G.
  */
-export default function maxback ( edges ) {
-	const G = adj( edges ) ;
-	const [ U ] = mb( G ) ;
-	return outgoingedges( G , U ) ;
+export default function maxback(edges) {
+	const G = adj(edges);
+	const [U] = mb(G);
+	return outgoingedges(G, U);
 }

src/maxback/mb.js

@@ -1,14 +1,14 @@
-import { min } from '@aureooms/js-itertools' ;
-import { attr , increasing } from '@aureooms/js-compare' ;
+import {min} from '@aureooms/js-itertools';
+import {attr, increasing} from '@aureooms/js-compare';
 
-import _smallcuts from "./_smallcuts.js" ;
+import _smallcuts from './_smallcuts.js';
 
 /**
  * Nagamochi-Ibaraki poly-time algorithm.
  *
  * @param {Map} G The adjacency list of an undirected unweighted connected loopless multigraph G.
  * @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 ) ;
+export default function mb(G) {
+	return min(attr(increasing, 1), _smallcuts(G), undefined);
 }

src/mincut.js

@@ -1,6 +1,6 @@
-import maxback from "./maxback/index.js" ;
+import maxback from './maxback/index.js';
 
 /**
  * Default to the maxback algorithm.
  */
-export default maxback ;
+export default maxback;