😒 chore: Remove debug code.

Author: make-github-pseudonymous-again

src/FibonacciHeap.js

@@ -1,6 +1,5 @@
 import Node from './Node';
 
-import list_debug from './list_debug';
 import list_insert from './list_insert';
 import list_remove from './list_remove';
 import list_concatenate from './list_concatenate';
@@ -24,7 +23,6 @@ export default class FibonacciHeap {
 	 * cost of MAKE-FIB-HEAP is thus equal to its O(1) actual cost.
 	 */
 	constructor(compare) {
-		//console.debug('constructor');
 		this.compare = compare; // Comparison function
 		/**
 		 * We access a given Fibonacci heap H by a pointer H.min to the root of
@@ -40,7 +38,6 @@ export default class FibonacciHeap {
 	 * Find-min: simply return the top element of the heap.
 	 */
 	head() {
-		//console.debug('head');
 		if (this.min === null) return undefined;
 		return this.min.value;
 	}
@@ -54,14 +51,12 @@ export default class FibonacciHeap {
 	 * its O(1) actual cost.
 	 */
 	headreference() {
-		//console.debug('headreference');
 		return this.min;
 	}
 
 	/**
 	 */
 	pop() {
-		//console.debug('pop');
 		const min = this.popreference();
 		return min === null ? undefined : min.value;
 	}
@@ -81,22 +76,16 @@ export default class FibonacciHeap {
 	 * which we shall see shortly.
 	 */
 	popreference() {
-		//console.debug('popreference');
 		const z = this.min;
 		if (z === null) return null;
-		//console.debug('z is', z.value);
-		list_debug(z.next, 'z list');
 		if (z.children !== null) {
-			list_debug(z.children, 'z children');
 			list_reset_parent(z.children);
 			list_concatenate(z, z.children);
-			list_debug(z.next, 'z after concatenation with its children');
 		}
 
 		if (z === z.next) this.min = null;
 		else {
 			list_remove(z);
-			list_debug(z.next, 'z after removal');
 			this.min = consolidate(this.compare, z.next);
 		}
 
@@ -105,15 +94,13 @@ export default class FibonacciHeap {
 		z.children = null;
 		z.degree = 0;
 		z.mark = false;
-		//console.debug('popped', z.value);
 		return z;
 	}
 
 	/**
 	 * Create a new node for the inserted element and put it into the heap.
 	 */
 	push(value) {
-		//console.debug('push', value);
 		const node = new Node(value);
 		return this.pushreference(node);
 	}
@@ -128,7 +115,6 @@ export default class FibonacciHeap {
 	 * Change in potential is 1. Therefore amortized cost is O(1).
 	 */
 	pushreference(ref) {
-		//console.debug('pushreference');
 		if (this.min === null) {
 			// Create a root list for H containing just x (by precondition)
 			this.min = ref;
@@ -158,7 +144,6 @@ export default class FibonacciHeap {
 	 * Change in potential is zero. Amortized cost is O(1), the actual cost.
 	 */
 	meld(other) {
-		//console.debug('meld');
 		const ref = other.min;
 		if (ref === null) return;
 		if (this.min === null) this.min = ref;
@@ -186,7 +171,6 @@ export default class FibonacciHeap {
 	 * @param {Object} value The new value for ref.
 	 */
 	update(ref, value) {
-		//console.debug('update');
 		const d = this.compare(value, ref.value);
 
 		if (d < 0) this.decreasekey(ref, value);
@@ -200,7 +184,6 @@ export default class FibonacciHeap {
 	 * @param {Object} value The new value for ref.
 	 */
 	decreasekey(ref, value) {
-		//console.debug('decreasekey');
 		ref.value = value;
 		if (ref !== this.min) {
 			// This.min != null, ref != null
@@ -226,7 +209,6 @@ export default class FibonacciHeap {
 	 *
 	 */
 	increasekey(ref, value) {
-		//console.debug('increasekey');
 		this.delete(ref);
 
 		ref.value = value;
@@ -240,8 +222,6 @@ export default class FibonacciHeap {
 	 * ref.prev and ref.next get reset to null
 	 */
 	delete(ref) {
-		//console.debug('>>>>')
-		//console.debug('DELETE', ref.value);
 		if (ref !== this.min) {
 			// This.min != null, ref != null
 			const y = ref.parent;

src/cascading_cut.js

@@ -1,7 +1,6 @@
 import cut from './cut';
 
 export default function* cascading_cut(y) {
-	//console.debug('cascading_cut');
 	while (true) {
 		const z = y.parent;
 		if (z === null) break;

src/consolidate.js

@@ -1,19 +1,6 @@
 import list_insert from './list_insert';
-import list_debug from './list_debug';
 import fib_heap_link from './fib_heap_link';
 
-function debug_array ( A ) {
-
-	console.debug('DEGREE TABLE');
-	for (let i = 0; i < A.length; ++i) {
-		const x = A[i];
-		if (x === null) continue;
-		if (x.degree !== i) console.error('WRONG DEGREE');
-		list_debug(x.children, i, x.value, '>');
-	}
-
-}
-
 /**
  * CONSOLIDATE: Consolidate the root list of a heap.
  *
@@ -40,13 +27,11 @@ function debug_array ( A ) {
  * @param l Root list.
  */
 export default function consolidate(compare, l) {
-	//console.debug('consolidate');
 	const A = [];
 
 	let next = l;
 
 	do {
-		//debug_array(A);
 		let x = next;
 		next = x.next;
 		let d = x.degree;
@@ -80,8 +65,6 @@ export default function consolidate(compare, l) {
 
 	let min = null;
 
-	//debug_array(A);
-
 	for (const x of A) {
 		if (x === null) continue;
 		if (min === null) {
@@ -97,9 +80,5 @@ export default function consolidate(compare, l) {
 		}
 	}
 
-	//console.debug('ROOT LIST');
-	//list_debug(min);
-	//console.debug('=========');
-
 	return min;
 }

src/cut.js

@@ -1,7 +1,6 @@
 import list_remove from './list_remove';
 
 export default function cut(x, y) {
-	//console.debug('cut', x.value, 'from his parent', y.value);
 	if (x === x.next) y.children = null;
 	else {
 		y.children = x.next;

src/fib_heap_link.js

@@ -1,32 +1,23 @@
 import list_remove from './list_remove';
 import list_insert from './list_insert';
-import list_debug from './list_debug';
 
 /**
  * FIB-HEAP-LINK
  *
  * Precondition: y is in the root list of some heap.
  */
 export default function fib_heap_link(y, x) {
-	//console.debug('fib_heap_link BEGIN', y.value, x.value);
-	//list_debug(y.next, 'y siblings');
 	//list_remove(y); // NOT NECESSARY SINCE y IS ALWAYS FROM ROOT LIST
-	//list_debug(y.next, 'y siblings after');
 	// make y a child of x
 	if (x.children === null) {
-		//console.debug('children of', x.value, 'before', []);
 		y.next = y;
 		y.prev = y;
 		x.children = y;
 	} else {
-		//list_debug(x.children, 'children of', x.value, 'before');
 		list_insert(x.children, y);
 	}
 
-	//list_debug(x.children, 'children of', x.value, 'after');
-
 	y.parent = x;
 	++x.degree; // Increment x.degree
 	y.mark = false; // Unmark y
-	//console.debug('fib_heap_link END');
 }

src/list_concatenate.js

@@ -1,5 +1,4 @@
 export default function list_concatenate(x, y) {
-	//console.debug('list_concatenate');
 	// FROM x - b - c - d - x        y - f - g - h - y
 	//   TO x - b - c - d - y - f - g - h - x
 	const d = x.prev;

src/list_debug.js

@@ -1,5 +1,4 @@
 export default function* list_iter(children) {
-	//console.debug('list_iter');
 	let next = children;
 
 	do {

src/list_iter.js

@@ -3,7 +3,6 @@
  * /!\ y will have dangling pointers after removal if not single element
  */
 export default function list_remove(y) {
-	//console.debug('list_remove');
 	y.prev.next = y.next;
 	y.next.prev = y.prev;
 }

src/list_remove.js

@@ -1,5 +1,4 @@
 export default function list_reset_parent(children) {
-	//console.debug('list_reset_parent');
 	let next = children;
 
 	do {
@@ -8,5 +7,4 @@ export default function list_reset_parent(children) {
 		x.parent = null;
 	} while (next !== children);
 
-	//console.debug('DONE');
 }