-
Notifications
You must be signed in to change notification settings - Fork 46
/
Copy pathtest.js
54 lines (39 loc) · 1.2 KB
/
test.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
import test from 'node:test';
import assert from 'node:assert/strict';
import TinyQueue from './index.js';
const data = [];
for (let i = 0; i < 100; i++) {
data.push(Math.floor(100 * Math.random()));
}
const sorted = data.slice().sort((a, b) => a - b);
test('maintains a priority queue', () => {
const queue = new TinyQueue();
for (let i = 0; i < data.length; i++) queue.push(data[i]);
assert.equal(queue.peek(), sorted[0]);
const result = [];
while (queue.length) result.push(queue.pop());
assert.deepEqual(result, sorted);
});
test('accepts data in constructor', () => {
const queue = new TinyQueue(data.slice());
const result = [];
while (queue.length) result.push(queue.pop());
assert.deepEqual(result, sorted);
});
test('handles edge cases with few elements', () => {
const queue = new TinyQueue();
queue.push(2);
queue.push(1);
queue.pop();
queue.pop();
queue.pop();
queue.push(2);
queue.push(1);
assert.equal(queue.pop(), 1);
assert.equal(queue.pop(), 2);
assert.equal(queue.pop(), undefined);
});
test('handles init with empty array', () => {
const queue = new TinyQueue([]);
assert.deepEqual(queue.data, []);
});