forked from rocicorp/mono
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathset-utils.ts
More file actions
62 lines (58 loc) · 1.25 KB
/
set-utils.ts
File metadata and controls
62 lines (58 loc) · 1.25 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
export function equals<T>(a: Set<T>, b: Set<T>) {
if (a.size !== b.size) {
return false;
}
for (const value of a) {
if (!b.has(value)) {
return false;
}
}
return true;
}
export function union<T>(...sets: Set<T>[]): Set<T> {
const result = new Set<T>();
for (const set of sets) {
for (const value of set) {
result.add(value);
}
}
return result;
}
export function intersection<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): Set<T> {
const result = new Set<T>();
if (a.size > b.size) {
// Optimization: iterate over the smaller Set.
const swap = a;
a = b;
b = swap;
}
for (const value of a) {
if (b.has(value)) {
result.add(value);
}
}
return result;
}
/**
* Returns the elements in {@link a} that are not in {@link b}.
*/
export function difference<T>(a: ReadonlySet<T>, b: ReadonlySet<T>): Set<T> {
const result = new Set<T>();
for (const value of a) {
if (!b.has(value)) {
result.add(value);
}
}
return result;
}
export function symmetricDifference<T>(a: Set<T>, b: Set<T>): Set<T> {
const result = new Set<T>(a);
for (const value of b) {
if (a.has(value)) {
result.delete(value);
} else {
result.add(value);
}
}
return result;
}