10   // Checks that the queue is fundamentally correct.
11   const queue = new PriorityQueue();  constant
13     queue.insert(i);
16     assert.strictEqual(queue.peek(), i);
17     assert.strictEqual(queue.shift(), i);
20   assert.strictEqual(queue.shift(), undefined);
24     queue.insert(i);
27     assert.strictEqual(queue.shift(), i);
30   assert.strictEqual(queue.shift(), undefined);
34   // Checks that the queue is capable of resizing and fitting more elements.
35   const queue = new PriorityQueue();  constant
37     queue.insert(i);
40     assert.strictEqual(queue.shift(), i);
43   assert.strictEqual(queue.shift(), undefined);
48   const queue = new PriorityQueue();  constant
50     queue.insert(i);
54     assert(queue.remove(id));
56   assert(!queue.remove(100));
57   assert(!queue.remove(-100));
61       assert.strictEqual(queue.shift(), i);
64   assert.strictEqual(queue.shift(), undefined);
69   const queue = new PriorityQueue((a, b) => b - a);  constant
71     queue.insert(i);
74     assert.strictEqual(queue.shift(), i);
77   assert.strictEqual(queue.shift(), undefined);
85   const queue = new PriorityQueue((a, b) => {  constant
89     queue.insert({ value: i, position: null });
92     assert.strictEqual(queue.peek().value, i);
93     queue.removeAt(queue.peek().position);
96   assert.strictEqual(queue.peek(), undefined);
100   const queue = new PriorityQueue((a, b) => {  constant
104   queue.insert({ value: 1, position: null });
105   queue.insert({ value: 2, position: null });
106   queue.insert({ value: 3, position: null });
107   queue.insert({ value: 4, position: null });
108   queue.insert({ value: 5, position: null });
110   queue.insert({ value: 2, position: null });
112   queue.insert(secondLargest);
114   queue.insert(largest);
116   queue.removeAt(5);
120   queue.removeAt(6);
124   queue.removeAt(6);
126   assert.strictEqual(queue.shift().value, 1);
127   assert.strictEqual(queue.shift().value, 2);
128   assert.strictEqual(queue.shift().value, 2);
129   assert.strictEqual(queue.shift().value, 4);
130   assert.strictEqual(queue.shift().value, 15);
132   assert.strictEqual(queue.shift(), undefined);
138   const queue = new PriorityQueue((a, b) => {  constant
146   queue.insert({ value: 1, position: null });
147   queue.insert({ value: 6, position: null });
148   queue.insert({ value: 2, position: null });
149   queue.insert(i7);
150   queue.insert(i8);
151   queue.insert(i3);
154   queue.removeAt(4);
159   queue.removeAt(2);