libstl/Tests/minheap.js

Standard JavaScript/TypeScript Library: DoublyLinkedList, Stack, Queue, Heap, MaxHeap, MinHeap, PriorityQueue

console.log('Testing: MinHeap');

/**
 * MinHeap tests
 * @type {MinHeap}
 */
var MinHeap = require('./../Datastructures/MinHeap.js');

// testing MinHeap
var heap = new MinHeap();

// MinHeap::insert
// MinHeap::toArray
// MinHeap::count
assert(heap.count() === 0);
assert(heap.insert(1) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1]));
assert(heap.insert(2) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2]));
assert(heap.insert(3) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2, 3]));
assert(heap.insert(4) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2, 3, 4]));
assert(heap.insert(5) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2, 3, 4, 5]));
assert(heap.count() === 5);
assert(heap.insert(10) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2, 3, 4, 5, 10]));
assert(heap.insert(1000) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2, 3, 4, 5, 10, 1000]));
assert(heap.insert(90) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2, 3, 4, 5, 10, 90, 1000]));
assert(heap.insert(7) === undefined);
//assert(JSON.stringify(heap.toArray()) === JSON.stringify([1, 2, 3, 4, 5, 7, 10, 90, 1000]));

// MinHeap::extract
// MinHeap::count
assert(heap.count() === 9);
assert(heap.extract() === 1);
assert(heap.count() === 8);
assert(heap.count() === 8);
assert(heap.extract() === 2);
assert(heap.extract() === 3);
assert(heap.extract() === 4);
assert(heap.extract() === 5);
assert(heap.extract() === 7);
assert(heap.extract() === 10);
assert(heap.extract() === 90);
assert(heap.extract() === 1000);
assert(heap.count() === 0);

// MinHeap.compare
assert(heap.compare(0,0) === 0);
assert(heap.compare('A', 'A') === 0);
assert(heap.compare(-101, -101) === 0);
assert(heap.compare(0.0001, 0.0001) === 0);
assert(heap.compare(0.0001, 0.0002) === -1);
assert(heap.compare(1, 2) === -1);
assert(heap.compare('A', 'Z') === -1);
assert(heap.compare(-102, -101) === -1);
assert(heap.compare(0.001, 0.0002) === 1);
assert(heap.compare(2, 1) === 1);
assert(heap.compare('Z', 'B') === 1);
assert(heap.compare(-102, -103) === 1);

// MinHeap.top
// MinHeap.isEmpty
assert(heap.isEmpty() === true);
assert(heap.insert(-1) === undefined);
assert(heap.isEmpty() === false);
assert(heap.top() === -1);
assert(heap.insert(5) === undefined);
assert(heap.top() === -1);
assert(heap.insert(-10) === undefined);
assert(heap.top() === -10);
assert(heap.isEmpty() === false);
assert(heap.insert(0) === undefined);
assert(heap.top() === -10);
assert(heap.extract() === -10);
assert(heap.top() === -1);
assert(heap.isEmpty() === false);

//// MinHeap.toString
//var toString = "\
//  -1\n\
//  ├─5\n\
//  └─0";
//assert(heap.toString() === toString);
//assert(heap.extract() === -1);
//var toString = "\
//  0\n\
//  └─5";
//assert(heap.toString() === toString);
//assert(heap.extract() === 0);
//toString = "\
//  5";
//assert(heap.toString() === toString);

/**
 current
 key
 next
 recoverFromCorruption
 rewind
 valid
 */