blob: a01147627bcc1993ec826d5f52546b6399bb3ff9 (
plain)
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
//SEE https://github.com/mourner/flatqueue
export default class FlatQueue {
constructor() {
this.ids = [];
this.values = [];
this.length = 0;
}
clear() {
this.length = 0;
}
push(id, value) {
let pos = this.length++;
while (pos > 0) {
let parent = ((pos + 1) >>> 1) - 1;
let parentValue = this.values[parent];
if (value >= parentValue) break;
this.ids[pos] = this.ids[parent];
this.values[pos] = parentValue;
pos = parent;
}
this.ids[pos] = id;
this.values[pos] = value;
}
pop() {
if (this.length === 0) return undefined;
let top = this.ids[0];
this.length--;
if (this.length > 0) {
let id = this.ids[0] = this.ids[this.length];
let value = this.values[0] = this.values[this.length];
let halfLength = this.length >> 1;
let pos = 0;
while (pos < halfLength) {
let left = (pos << 1) + 1;
let right = left + 1;
let bestIndex = this.ids[left];
let bestValue = this.values[left];
let rightValue = this.values[right];
if (right < this.length && rightValue < bestValue) {
left = right;
bestIndex = this.ids[right];
bestValue = rightValue;
}
if (bestValue >= value) break;
this.ids[pos] = bestIndex;
this.values[pos] = bestValue;
pos = left;
}
this.ids[pos] = id;
this.values[pos] = value;
}
return top;
}
peek() {
if (this.length === 0) return undefined;
return this.ids[0];
}
peekValue() {
if (this.length === 0) return undefined;
return this.values[0];
}
shrink() {
this.ids.length = this.values.length = this.length;
}
}
|