-
-
Notifications
You must be signed in to change notification settings - Fork 92
/
sparse-queue-set.js
218 lines (179 loc) · 4.11 KB
/
sparse-queue-set.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
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
/**
* Mnemonist SparseQueueSet
* =========================
*
* JavaScript sparse queue set implemented on top of byte arrays.
*
* [Reference]: https://research.swtch.com/sparse
*/
var Iterator = require('obliterator/iterator'),
getPointerArray = require('./utils/typed-arrays.js').getPointerArray;
/**
* SparseQueueSet.
*
* @constructor
*/
function SparseQueueSet(capacity) {
var ByteArray = getPointerArray(capacity);
// Properties
this.start = 0;
this.size = 0;
this.capacity = capacity;
this.dense = new ByteArray(capacity);
this.sparse = new ByteArray(capacity);
}
/**
* Method used to clear the structure.
*
* @return {undefined}
*/
SparseQueueSet.prototype.clear = function() {
this.start = 0;
this.size = 0;
};
/**
* Method used to check the existence of a member in the queue.
*
* @param {number} member - Member to test.
* @return {SparseQueueSet}
*/
SparseQueueSet.prototype.has = function(member) {
if (this.size === 0)
return false;
var index = this.sparse[member];
var inBounds = (
index < this.capacity &&
(
index >= this.start &&
index < this.start + this.size
) ||
(
index < ((this.start + this.size) % this.capacity)
)
);
return (
inBounds &&
this.dense[index] === member
);
};
/**
* Method used to add a member to the queue.
*
* @param {number} member - Member to add.
* @return {SparseQueueSet}
*/
SparseQueueSet.prototype.enqueue = function(member) {
var index = this.sparse[member];
if (this.size !== 0) {
var inBounds = (
index < this.capacity &&
(
index >= this.start &&
index < this.start + this.size
) ||
(
index < ((this.start + this.size) % this.capacity)
)
);
if (inBounds && this.dense[index] === member)
return this;
}
index = (this.start + this.size) % this.capacity;
this.dense[index] = member;
this.sparse[member] = index;
this.size++;
return this;
};
/**
* Method used to remove the next member from the queue.
*
* @param {number} member - Member to delete.
* @return {boolean}
*/
SparseQueueSet.prototype.dequeue = function() {
if (this.size === 0)
return;
var index = this.start;
this.size--;
this.start++;
if (this.start === this.capacity)
this.start = 0;
var member = this.dense[index];
this.sparse[member] = this.capacity;
return member;
};
/**
* Method used to iterate over the queue's values.
*
* @param {function} callback - Function to call for each item.
* @param {object} scope - Optional scope.
* @return {undefined}
*/
SparseQueueSet.prototype.forEach = function(callback, scope) {
scope = arguments.length > 1 ? scope : this;
var c = this.capacity,
l = this.size,
i = this.start,
j = 0;
while (j < l) {
callback.call(scope, this.dense[i], j, this);
i++;
j++;
if (i === c)
i = 0;
}
};
/**
* Method used to create an iterator over a set's values.
*
* @return {Iterator}
*/
SparseQueueSet.prototype.values = function() {
var dense = this.dense,
c = this.capacity,
l = this.size,
i = this.start,
j = 0;
return new Iterator(function() {
if (j >= l)
return {
done: true
};
var value = dense[i];
i++;
j++;
if (i === c)
i = 0;
return {
value: value,
done: false
};
});
};
/**
* Attaching the #.values method to Symbol.iterator if possible.
*/
if (typeof Symbol !== 'undefined')
SparseQueueSet.prototype[Symbol.iterator] = SparseQueueSet.prototype.values;
/**
* Convenience known methods.
*/
SparseQueueSet.prototype.inspect = function() {
var proxy = [];
this.forEach(function(member) {
proxy.push(member);
});
// Trick so that node displays the name of the constructor
Object.defineProperty(proxy, 'constructor', {
value: SparseQueueSet,
enumerable: false
});
proxy.capacity = this.capacity;
return proxy;
};
if (typeof Symbol !== 'undefined')
SparseQueueSet.prototype[Symbol.for('nodejs.util.inspect.custom')] = SparseQueueSet.prototype.inspect;
/**
* Exporting.
*/
module.exports = SparseQueueSet;