🤖 chore: Lint source files.

These changes were automatically generated by a transform whose code can be found at:
  - https://github.com/aureooms/rejuvenate/blob/1fe650dc2407c6c6395828a28777fe8137a3bd2f/src/transforms/sources:initial-lint.js
Please contact the author of the transform if you believe there was an error.

Author: a-flying-potato

doc/scripts/header.js

@@ -1,34 +1,31 @@
-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 = 'combinatorics/permutation';
-	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/make-github-pseudonymous-again/js-permutation' ;
-	testlink.target = '_BLANK' ;
+	const testlink = document.querySelector('header > a[data-ice="testLink"]');
+	testlink.href =
+		'https://coveralls.io/github/make-github-pseudonymous-again/js-permutation';
+	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/_apply.js

@@ -1,4 +1,4 @@
-import { _transpose } from './_transpose.js' ;
+import {_transpose} from './_transpose.js';
 
 /**
  * Applies a given sequence (in the given order) of transpositions (given as
@@ -8,9 +8,6 @@ import { _transpose } from './_transpose.js' ;
  * @param {Array} sigma The permutation to apply the transpositions to
  * (modified in-place).
  */
-export function _apply ( transpositions , sigma ) {
-
-	for ( const [ s , t ] of transpositions ) _transpose( s , t , sigma ) ;
-
+export function _apply(transpositions, sigma) {
+	for (const [s, t] of transpositions) _transpose(s, t, sigma);
 }
-

src/_bitreversal.js

@@ -1,4 +1,3 @@
-
 /**
  * Fills an input array with the bitreversal permutation for input
  * <code>n</code> items. The array is filled starting at index <code>0</code>
@@ -8,23 +7,16 @@
  * @param {Array} array The array to fill.
  * @param {Number} n The size of the permutation, must be a power of 2.
  */
-export function _bitreversal ( array , n ) {
-
-	let i = 1 ;
-
-	array[0] = 0 ;
-
-	while ( i < n ) {
+export function _bitreversal(array, n) {
+	let i = 1;
 
-		for ( let j = 0 ; j < i ; ++j ) {
-
-			array[i+j] = ( array[j] <<= 1 ) + 1 ;
+	array[0] = 0;
 
+	while (i < n) {
+		for (let j = 0; j < i; ++j) {
+			array[i + j] = (array[j] <<= 1) + 1;
 		}
 
-		i <<= 1 ;
-
+		i <<= 1;
 	}
-
 }
-

src/_compose.js

@@ -1,4 +1,3 @@
-
 /**
  * Compose two input permutations. The resulting permutation is output as an
  * iterator of indices instead of an array of indices.
@@ -7,9 +6,6 @@
  * @param {Array} tau The second input permutation.
  * @returns {Iterator} An iterator over the items of the resulting permutation.
  */
-export function* _compose ( sigma , tau ) {
-
-	for ( const t of tau ) yield sigma[t] ;
-
+export function* _compose(sigma, tau) {
+	for (const t of tau) yield sigma[t];
 }
-

src/_copy.js

@@ -1,14 +1,10 @@
-
 /**
  * Copy an input permutation to an output array.
  *
  * @param {Array} sigma The input permutation.
  * @param {Number} n The size of the input permutation to copy.
  * @param {Array} tau The output array.
  */
-export function _copy ( sigma , n , tau ) {
-
-	for ( let i = 0 ; i < n ; ++i ) tau[i] = sigma[i] ;
-
+export function _copy(sigma, n, tau) {
+	for (let i = 0; i < n; ++i) tau[i] = sigma[i];
 }
-

src/_cycles.js

@@ -1,4 +1,3 @@
-
 /**
  * Computes a cycle decomposition of an input permutation. This algorithm is
  * deterministic; the algorithm will procedes in a sequential manner, first
@@ -17,31 +16,24 @@
  * @param {Array} used The helper array.
  * @returns {Iterator} The cycles <code>[a, [b, c, ...]]</code> for sigma.
  */
-export function* _cycles ( sigma , used ) {
-
-	for ( const s of sigma ) {
-
-		if ( used[s] ) continue ;
-
-		used[s] = true ;
+export function* _cycles(sigma, used) {
+	for (const s of sigma) {
+		if (used[s]) continue;
 
-		let image = sigma[s] ;
+		used[s] = true;
 
-		const cycle = [ ] ;
+		let image = sigma[s];
 
-		while ( image !== s ) {
+		const cycle = [];
 
-			used[image] = true ;
+		while (image !== s) {
+			used[image] = true;
 
-			cycle.push( image ) ;
-
-			image = sigma[image] ;
+			cycle.push(image);
 
+			image = sigma[image];
 		}
 
-		yield [ s , cycle ] ;
-
+		yield [s, cycle];
 	}
-
 }
-

src/_identity.js

@@ -1,14 +1,10 @@
-
 /**
  * Fills an input array with the identity permutation on input <code>n</code>
  * elements.
  *
  * @param {Array} sigma The input array.
  * @param {Number} n The size to use for the permutation.
  */
-export function _identity ( sigma , n ) {
-
-	for ( let i = 0 ; i < n ; ++i ) sigma[i] = i ;
-
+export function _identity(sigma, n) {
+	for (let i = 0; i < n; ++i) sigma[i] = i;
 }
-

src/_invert.js

@@ -9,8 +9,6 @@
  * @param {Number} n The size of the input permutation.
  * @param {Array} tau The array where to put the inverse of the input permutation.
  */
-export function _invert ( sigma , n , tau ) {
-
-	for ( let i = 0 ; i < n ; ++i ) tau[sigma[i]] = i ;
-
+export function _invert(sigma, n, tau) {
+	for (let i = 0; i < n; ++i) tau[sigma[i]] = i;
 }

src/_invertcycles.js

@@ -1,4 +1,4 @@
-import { _transpose } from './_transpose.js' ;
+import {_transpose} from './_transpose.js';
 
 /**
  * Inverts given cycles in a given permutation ___in-place___. Can be used as
@@ -16,13 +16,8 @@ import { _transpose } from './_transpose.js' ;
  * @param {Iterable} cycles The cycles to invert.
  * @param {Array} tau The given permutation (modified in-place).
  */
-export function _invertcycles ( cycles , tau ) {
-
-	for ( const [ s , cycle ] of cycles ) {
-
-		for ( const t of cycle ) _transpose( s , t , tau ) ;
-
+export function _invertcycles(cycles, tau) {
+	for (const [s, cycle] of cycles) {
+		for (const t of cycle) _transpose(s, t, tau);
 	}
-
 }
-

src/_itranspositions.js

@@ -8,26 +8,20 @@
  * @param {Array} used Helper array.
  * @return {Iterator} Iterator over the transpositions.
  */
-export function* _itranspositions ( sigma , used ) {
+export function* _itranspositions(sigma, used) {
+	for (const s of sigma) {
+		if (used[s]) continue;
 
-	for ( const s of sigma ) {
+		used[s] = true;
 
-		if ( used[s] ) continue ;
+		let image = sigma[s];
 
-		used[s] = true ;
+		while (image !== s) {
+			used[image] = true;
 
-		let image = sigma[s] ;
-
-		while ( image !== s ) {
-
-			used[image] = true ;
-
-			yield [ s , image ] ;
-
-			image = sigma[image] ;
+			yield [s, image];
 
+			image = sigma[image];
 		}
-
 	}
-
 }

src/_next.js

@@ -1,5 +1,5 @@
-import { _transpose } from './_transpose.js' ;
-import { _reverse } from './_reverse.js' ;
+import {_transpose} from './_transpose.js';
+import {_reverse} from './_reverse.js';
 
 /**
  * Updates the input permutation to the next one ___in-place___. Returns true
@@ -11,29 +11,24 @@ import { _reverse } from './_reverse.js' ;
  * @returns {Boolean} Whether the input permutation is
  * __NOT__ the last for its elements.
  */
-export function _next ( sigma , n ) {
+export function _next(sigma, n) {
+	let i = n - 1;
 
-	let i = n - 1 ;
+	while (i > 0) {
+		--i;
 
-	while ( i > 0 ) {
+		if (sigma[i] > sigma[i + 1]) continue;
 
-		--i ;
+		let j = n - 1;
 
-		if ( sigma[i] > sigma[i+1] ) continue ;
+		while (sigma[j] < sigma[i]) --j;
 
-		let j = n - 1 ;
+		_transpose(i, j, sigma);
 
-		while ( sigma[j] < sigma[i] ) --j ;
-
-		_transpose( i , j , sigma ) ;
-
-		_reverse( sigma , i + 1 , n ) ;
-
-		return true ;
+		_reverse(sigma, i + 1, n);
 
+		return true;
 	}
 
-	return false ;
-
+	return false;
 }
-

src/_permutations.js

@@ -1,4 +1,4 @@
-import { _next } from './_next.js' ;
+import {_next} from './_next.js';
 
 /**
  * Yields all permutations starting from a given one and ending at the last
@@ -9,9 +9,8 @@ import { _next } from './_next.js' ;
  * @returns {Iterator} Iterator over all permutations between the starting one
  * and the last permutation on its elements.
  */
-export function* _permutations ( sigma , n ) {
-
-	do { yield sigma ; } while ( _next( sigma , n ) ) ;
-
+export function* _permutations(sigma, n) {
+	do {
+		yield sigma;
+	} while (_next(sigma, n));
 }
-

src/_reverse.js

@@ -1,4 +1,4 @@
-import { _transpose } from './_transpose.js' ;
+import {_transpose} from './_transpose.js';
 
 /**
  * Reverses input permutation ___in-place___ from input index <code>i</code>
@@ -8,8 +8,6 @@ import { _transpose } from './_transpose.js' ;
  * @param {Number} i The left bound (included).
  * @param {Number} j The right bound (excluded).
  */
-export function _reverse ( sigma , i , j ) {
-
-	while ( i <-- j ) _transpose( i++ , j , sigma ) ;
-
+export function _reverse(sigma, i, j) {
+	while (i < --j) _transpose(i++, j, sigma);
 }

src/_transpose.js

@@ -1,4 +1,3 @@
-
 /**
  * Transpose elements of input index <code>a</code> and <code>b</code> in the
  * input permutation.
@@ -7,11 +6,8 @@
  * @param {Number} b The second input index.
  * @param {Array} sigma The input permutation.
  */
-export function _transpose ( a , b , sigma ) {
-
-	const tmp = sigma[a] ;
-	sigma[a]  = sigma[b] ;
-	sigma[b]  =      tmp ;
-
+export function _transpose(a, b, sigma) {
+	const tmp = sigma[a];
+	sigma[a] = sigma[b];
+	sigma[b] = tmp;
 }
-