🤖 chore: Lint source files.

These changes were automatically generated by a transform whose code can be found at:
  - https://github.com/aureooms/rejuvenate/blob/3361c487f4a9437f3d4eeec1499bf8d09d1f5005/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,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-pairing-heap';
-	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-pairing-heap' ;
-	testlink.target = '_BLANK' ;
+	const testlink = document.querySelector('header > a[data-ice="testLink"]');
+	testlink.href = 'https://coveralls.io/github/aureooms/js-pairing-heap';
+	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/Node.js

@@ -1,27 +1,24 @@
-
 export default class Node {
-
-	constructor ( value ) {
-		this.value = value; // key
-		this.prev = null;   // pointer to previous sibling
-		this.next = null;   // pointer to next sibling
-		this.children = new Beginning(); // pointer to children list
-		                                // first child is this.children.next
+	constructor(value) {
+		this.value = value; // Key
+		this.prev = null; // Pointer to previous sibling
+		this.next = null; // Pointer to next sibling
+		this.children = new Beginning(); // Pointer to children list
+		// first child is this.children.next
 	}
-
 }
 
 /**
  * Avoids if-then-else logic when manipulating child nodes
  */
 export class Beginning {
-	constructor () {
+	constructor() {
 		this.next = null;
 	}
 }
 
-//export class End {
-	//constructor (prev) {
-		//this.prev = prev;
-	//}
-//}
+// Export class End {
+// constructor (prev) {
+// this.prev = prev;
+// }
+// }

src/PairingHeap.js

@@ -1,52 +1,50 @@
-import merge from "./merge.js" ;
-import mergepairs from "./mergepairs.js" ;
-import decreasekey from "./decreasekey.js" ;
-import Node from "./Node.js" ;
+import merge from './merge.js';
+import mergepairs from './mergepairs.js';
+import decreasekey from './decreasekey.js';
+import Node from './Node.js';
 
 export default class PairingHeap {
-
-	constructor (compare) {
-		this.compare = compare ; // comparison function
-		this.min = null ;        // root node, must have .prev = .next = null at all times
+	constructor(compare) {
+		this.compare = compare; // Comparison function
+		this.min = null; // Root node, must have .prev = .next = null at all times
 	}
 
 	/**
-	 * find-min: simply return the top element of the heap.
+	 * Find-min: simply return the top element of the heap.
 	 */
-	head () {
-		if ( this.min === null ) return undefined;
+	head() {
+		if (this.min === null) return undefined;
 		return this.min.value;
 	}
 
-
-	headreference () {
+	headreference() {
 		return this.min;
 	}
 
 	/**
-	 * delete-min: remove the root and merge its subtrees. Various strategies
+	 * Delete-min: remove the root and merge its subtrees. Various strategies
 	 * are employed.
 	 */
-	pop () {
+	pop() {
 		const min = this.popreference();
-		return min === null ? undefined : min.value ;
+		return min === null ? undefined : min.value;
 	}
 
 	/**
 	 */
-	popreference () {
-		if (this.min === null ) return null;
+	popreference() {
+		if (this.min === null) return null;
 		const min = this.min;
-		this.min = mergepairs(this.compare, min.children); // min.children.next = null
+		this.min = mergepairs(this.compare, min.children); // Min.children.next = null
 		return min;
 	}
 
 	/**
-	 * insert: create a new heap for the inserted element and merge into the
+	 * Insert: create a new heap for the inserted element and merge into the
 	 * original heap.
 	 */
-	push ( value ) {
-		const node = new Node(value) ;
+	push(value) {
+		const node = new Node(value);
 		return this.pushreference(node);
 	}
 
@@ -56,88 +54,81 @@ export default class PairingHeap {
 	 * PairingHeap#pushreference with an internal reference from this tree or
 	 * another, except the root of another tree.
 	 */
-	pushreference ( ref ) {
+	pushreference(ref) {
 		if (this.min === null) this.min = ref;
 		else {
-			// this.min != null != ref
-			this.min = merge( this.compare , this.min , ref ) ;
+			// This.min != null != ref
+			this.min = merge(this.compare, this.min, ref);
 		}
+
 		return ref;
 	}
 
-
 	/**
 	 * Supposes the same comparison function is used in both trees.
 	 * We can call pushreference since other.min.next = other.min.prev = null.
 	 */
-	merge ( other ) {
-		const ref = other.min ;
-		if (ref !== null) this.pushreference( ref ) ;
+	merge(other) {
+		const ref = other.min;
+		if (ref !== null) this.pushreference(ref);
 	}
 
-
 	/**
 	 * @param {Node} ref Non-null internal node object.
 	 * @param {Object} value The new value for ref.
 	 */
-	update ( ref , value ) {
-
-		const d = this.compare(value, ref.value) ;
-
-		if      ( d < 0 ) this.decreasekey(ref, value) ;
-		else if ( d > 0 ) this.increasekey(ref, value) ;
-		else              ref.value = value ;
+	update(ref, value) {
+		const d = this.compare(value, ref.value);
 
+		if (d < 0) this.decreasekey(ref, value);
+		else if (d > 0) this.increasekey(ref, value);
+		else ref.value = value;
 	}
 
 	/**
-	 * decrease-key
+	 * Decrease-key
 	 *
 	 * @param {Node} ref Non-null internal node object.
 	 * @param {Object} value The new value for ref.
 	 */
-	decreasekey ( ref , value ) {
-		if (ref === this.min) ref.value = value ;
+	decreasekey(ref, value) {
+		if (ref === this.min) ref.value = value;
 		else {
-			// this.min != null, ref != null
-			this.min = decreasekey( this.compare , this.min , ref , value ) ;
+			// This.min != null, ref != null
+			this.min = decreasekey(this.compare, this.min, ref, value);
 		}
 	}
 
 	/**
-	 * increase-key: remove the item at the key to be increased, replace
+	 * Increase-key: remove the item at the key to be increased, replace
 	 * the key with a larger key, then push the result back into the heap.
 	 *
 	 * @param {Node} ref Non-null internal node object.
 	 * @param {Object} value The new value for ref.
 	 *
 	 */
-	increasekey ( ref , value ) {
-
+	increasekey(ref, value) {
 		this.delete(ref);
 
 		ref.value = value;
 
-		this.pushreference( ref ) ;
-
+		this.pushreference(ref);
 	}
 
 	/**
-	 * ref must be internal
+	 * Ref must be internal
 	 * ref.prev and ref.next get reset to null
 	 */
-	delete ( ref ) {
-
-		if ( ref === this.min ) {
-			this.popreference() ;
-			return ;
+	delete(ref) {
+		if (ref === this.min) {
+			this.popreference();
+			return;
 		}
 
-		const successor = mergepairs(this.compare, ref.children); // ref.children.next = null
+		const successor = mergepairs(this.compare, ref.children); // Ref.children.next = null
 
 		// ref has no children
 		if (successor === null) {
-
 			//  _       _       _
 			// | | --> | | --> | |
 			// |_| <-- |_| <-- |_|
@@ -152,7 +143,7 @@ export default class PairingHeap {
 			//       - |_| <-/
 			//          R
 			//
-			ref.prev.next = ref.next ; // must be != null because ref != min
+			ref.prev.next = ref.next; // Must be != null because ref != min
 
 			if (ref.next !== null) {
 				//
@@ -164,7 +155,7 @@ export default class PairingHeap {
 				//  |----- |_|
 				//          R
 				//
-				ref.next.prev = ref.prev ;
+				ref.next.prev = ref.prev;
 				//
 				//  _               _
 				// | | ----------> | |
@@ -189,20 +180,16 @@ export default class PairingHeap {
 			ref.prev = null;
 
 			return;
-
 		}
 
-		successor.prev = ref.prev ; // must be != null because ref != min
-		successor.prev.next = successor ;
+		successor.prev = ref.prev; // Must be != null because ref != min
+		successor.prev.next = successor;
 		ref.prev = null;
 
 		if (ref.next !== null) {
-			successor.next = ref.next ; // might be null
-			successor.next.prev = successor ;
+			successor.next = ref.next; // Might be null
+			successor.next.prev = successor;
 			ref.next = null;
 		}
-
 	}
-
-
 }

src/decreasekey.js

@@ -1,7 +1,7 @@
-import merge from "./merge.js" ;
+import merge from './merge.js';
 
 /**
- * decrease-key: remove the subtree rooted at the key to be decreased, replace
+ * Decrease-key: remove the subtree rooted at the key to be decreased, replace
  * the key with a smaller key, then merge the result back into the heap.
  *
  * @param {Function} compare Comparison function for keys.
@@ -10,22 +10,21 @@ import merge from "./merge.js" ;
  * @param {Object} value The new value for the key of the node to update.
  * @returns {Node} Returns the node containing the minimum key.
  */
-export default function decreasekey ( compare , min , node , value ) {
+export default function decreasekey(compare, min, node, value) {
+	// Update node's key
+	node.value = value;
 
-	// update node's key
-	node.value = value ;
-
-	// remove node from tree
-	node.prev.next = node.next ; // by assumption node.prev != null
+	// Remove node from tree
+	node.prev.next = node.next; // By assumption node.prev != null
 	if (node.next !== null) {
-		node.next.prev = node.prev ;
-		node.next = null ;
+		node.next.prev = node.prev;
+		node.next = null;
 	}
-	node.prev = null ;
 
-	// merge, remember we move the whole subtree with children
+	node.prev = null;
+
+	// Merge, remember we move the whole subtree with children
 	// node.prev = node.next = null at this point so safe to call merge
 	// min != null and node != null
 	return merge(compare, min, node);
-
 }

src/index.js

@@ -1,17 +1,10 @@
-import Node from "./Node.js" ;
-import PairingHeap from "./PairingHeap.js" ;
-import prepend from "./prepend.js" ;
-import decreasekey from "./decreasekey.js" ;
-import merge from "./merge.js" ;
-import mergepairs from "./mergepairs.js" ;
+import Node from './Node.js';
+import PairingHeap from './PairingHeap.js';
+import prepend from './prepend.js';
+import decreasekey from './decreasekey.js';
+import merge from './merge.js';
+import mergepairs from './mergepairs.js';
 
-export default PairingHeap ;
+export default PairingHeap;
 
-export {
-	Node ,
-	PairingHeap ,
-	prepend ,
-	decreasekey ,
-	merge ,
-	mergepairs ,
-} ;
+export {Node, PairingHeap, prepend, decreasekey, merge, mergepairs};