-
-
Notifications
You must be signed in to change notification settings - Fork 184
Expand file tree
/
Copy pathSet.ts
More file actions
252 lines (227 loc) · 7.33 KB
/
Set.ts
File metadata and controls
252 lines (227 loc) · 7.33 KB
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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
export class Set<T extends AnyNotNil> {
public static [Symbol.species] = Set;
public [Symbol.toStringTag] = "Set";
public size = 0;
private firstKey: T | undefined;
private lastKey: T | undefined;
private nextKey = new LuaTable<T, T>();
private previousKey = new LuaTable<T, T>();
constructor(values?: Iterable<T> | T[]) {
if (values === undefined) return;
const iterable = values as Iterable<T>;
if (iterable[Symbol.iterator]) {
// Iterate manually because Set is compiled with ES5 which doesn't support Iterables in for...of
const iterator = iterable[Symbol.iterator]();
while (true) {
const result = iterator.next();
if (result.done) {
break;
}
this.add(result.value);
}
} else {
const array = values as T[];
for (const value of array) {
this.add(value);
}
}
}
public add(value: T): Set<T> {
const isNewValue = !this.has(value);
if (isNewValue) {
this.size++;
}
// Do order bookkeeping
if (this.firstKey === undefined) {
this.firstKey = value;
this.lastKey = value;
} else if (isNewValue) {
this.nextKey.set(this.lastKey!, value);
this.previousKey.set(value, this.lastKey!);
this.lastKey = value;
}
return this;
}
public clear(): void {
this.nextKey = new LuaTable();
this.previousKey = new LuaTable();
this.firstKey = undefined;
this.lastKey = undefined;
this.size = 0;
}
public delete(value: T): boolean {
const contains = this.has(value);
if (contains) {
this.size--;
// Do order bookkeeping
const next = this.nextKey.get(value);
const previous = this.previousKey.get(value);
if (next !== undefined && previous !== undefined) {
this.nextKey.set(previous, next);
this.previousKey.set(next, previous);
} else if (next !== undefined) {
this.firstKey = next;
this.previousKey.set(next, undefined!);
} else if (previous !== undefined) {
this.lastKey = previous;
this.nextKey.set(previous, undefined!);
} else {
this.firstKey = undefined;
this.lastKey = undefined;
}
this.nextKey.set(value, undefined!);
this.previousKey.set(value, undefined!);
}
return contains;
}
public forEach(callback: (value: T, key: T, set: Set<T>) => any): void {
for (const key of this.keys()) {
callback(key, key, this);
}
}
public has(value: T): boolean {
return this.nextKey.get(value) !== undefined || this.lastKey === value;
}
public [Symbol.iterator](): IterableIterator<T> {
return this.values();
}
public entries(): IterableIterator<[T, T]> {
const getFirstKey = () => this.firstKey;
const nextKey = this.nextKey;
let key: T | undefined;
let started = false;
return {
[Symbol.iterator](): IterableIterator<[T, T]> {
return this;
},
next(): IteratorResult<[T, T]> {
if (!started) {
started = true;
key = getFirstKey();
} else {
key = nextKey.get(key!);
}
return { done: !key, value: [key!, key!] as [T, T] };
},
};
}
public keys(): IterableIterator<T> {
const getFirstKey = () => this.firstKey;
const nextKey = this.nextKey;
let key: T | undefined;
let started = false;
return {
[Symbol.iterator](): IterableIterator<T> {
return this;
},
next(): IteratorResult<T> {
if (!started) {
started = true;
key = getFirstKey();
} else {
key = nextKey.get(key!);
}
return { done: !key, value: key! };
},
};
}
public values(): IterableIterator<T> {
const getFirstKey = () => this.firstKey;
const nextKey = this.nextKey;
let key: T | undefined;
let started = false;
return {
[Symbol.iterator](): IterableIterator<T> {
return this;
},
next(): IteratorResult<T> {
if (!started) {
started = true;
key = getFirstKey();
} else {
key = nextKey.get(key!);
}
return { done: !key, value: key! };
},
};
}
/**
* @returns a new Set containing all the elements in this Set and also all the elements in the argument.
*/
public union(other: ReadonlySet<T>): Set<T> {
const result = new Set<T>(this);
for (const item of other) {
result.add(item);
}
return result;
}
/**
* @returns a new Set containing all the elements which are both in this Set and in the argument.
*/
public intersection(other: ReadonlySet<T>) {
const result = new Set<T>();
for (const item of this) {
if (other.has(item)) {
result.add(item);
}
}
return result;
}
/**
* @returns a new Set containing all the elements in this Set which are not also in the argument.
*/
public difference(other: ReadonlySet<T>): Set<T> {
const result = new Set<T>(this);
for (const item of other) {
result.delete(item);
}
return result;
}
/**
* @returns a new Set containing all the elements which are in either this Set or in the argument, but not in both.
*/
public symmetricDifference(other: ReadonlySet<T>): Set<T> {
const result = new Set<T>(this);
for (const item of other) {
if (this.has(item)) {
result.delete(item);
} else {
result.add(item);
}
}
return result;
}
/**
* @returns a boolean indicating whether all the elements in this Set are also in the argument.
*/
public isSubsetOf(other: ReadonlySet<unknown>): boolean {
for (const item of this) {
if (!other.has(item)) {
return false;
}
}
return true;
}
/**
* @returns a boolean indicating whether all the elements in the argument are also in this Set.
*/
public isSupersetOf(other: ReadonlySet<unknown>): boolean {
for (const item of other) {
if (!this.has(item as T)) {
return false;
}
}
return true;
}
/**
* @returns a boolean indicating whether this Set has no elements in common with the argument.
*/
public isDisjointFrom(other: ReadonlySetLike<unknown>): boolean {
for (const item of this) {
if (other.has(item)) {
return false;
}
}
return true;
}
}