|
| 1 | +//// [tests/cases/compiler/setMethods.ts] //// |
| 2 | + |
| 3 | +//// [setMethods.ts] |
| 4 | +let numberSet = new Set([0, 1, 2]); |
| 5 | + |
| 6 | +let stringSet = new Set(["a", "b"]); |
| 7 | + |
| 8 | +let numberMap = new Map([[4, {}], [5, {}]]); |
| 9 | + |
| 10 | +let numberSetLike = { |
| 11 | + size: 1, |
| 12 | + *keys() { yield 3 }, |
| 13 | + has(x) { return x === 3 }, |
| 14 | +}; |
| 15 | + |
| 16 | +numberSet.union([]); |
| 17 | +numberSet.union(new Set); |
| 18 | +numberSet.union(stringSet); |
| 19 | +numberSet.union(numberMap); |
| 20 | +numberSet.union(numberSetLike); |
| 21 | + |
| 22 | +numberSet.intersection([]); |
| 23 | +numberSet.intersection(new Set); |
| 24 | +numberSet.intersection(stringSet); |
| 25 | +numberSet.intersection(numberMap); |
| 26 | +numberSet.intersection(numberSetLike); |
| 27 | + |
| 28 | +numberSet.difference([]); |
| 29 | +numberSet.difference(new Set); |
| 30 | +numberSet.difference(stringSet); |
| 31 | +numberSet.difference(numberMap); |
| 32 | +numberSet.difference(numberSetLike); |
| 33 | + |
| 34 | +numberSet.symmetricDifference([]); |
| 35 | +numberSet.symmetricDifference(new Set); |
| 36 | +numberSet.symmetricDifference(stringSet); |
| 37 | +numberSet.symmetricDifference(numberMap); |
| 38 | +numberSet.symmetricDifference(numberSetLike); |
| 39 | + |
| 40 | +numberSet.isSubsetOf([]); |
| 41 | +numberSet.isSubsetOf(new Set); |
| 42 | +numberSet.isSubsetOf(stringSet); |
| 43 | +numberSet.isSubsetOf(numberMap); |
| 44 | +numberSet.isSubsetOf(numberSetLike); |
| 45 | + |
| 46 | +numberSet.isSupersetOf([]); |
| 47 | +numberSet.isSupersetOf(new Set); |
| 48 | +numberSet.isSupersetOf(stringSet); |
| 49 | +numberSet.isSupersetOf(numberMap); |
| 50 | +numberSet.isSupersetOf(numberSetLike); |
| 51 | + |
| 52 | +numberSet.isDisjointFrom([]); |
| 53 | +numberSet.isDisjointFrom(new Set); |
| 54 | +numberSet.isDisjointFrom(stringSet); |
| 55 | +numberSet.isDisjointFrom(numberMap); |
| 56 | +numberSet.isDisjointFrom(numberSetLike); |
| 57 | + |
| 58 | + |
| 59 | +//// [setMethods.js] |
| 60 | +let numberSet = new Set([0, 1, 2]); |
| 61 | +let stringSet = new Set(["a", "b"]); |
| 62 | +let numberMap = new Map([[4, {}], [5, {}]]); |
| 63 | +let numberSetLike = { |
| 64 | + size: 1, |
| 65 | + *keys() { yield 3; }, |
| 66 | + has(x) { return x === 3; }, |
| 67 | +}; |
| 68 | +numberSet.union([]); |
| 69 | +numberSet.union(new Set); |
| 70 | +numberSet.union(stringSet); |
| 71 | +numberSet.union(numberMap); |
| 72 | +numberSet.union(numberSetLike); |
| 73 | +numberSet.intersection([]); |
| 74 | +numberSet.intersection(new Set); |
| 75 | +numberSet.intersection(stringSet); |
| 76 | +numberSet.intersection(numberMap); |
| 77 | +numberSet.intersection(numberSetLike); |
| 78 | +numberSet.difference([]); |
| 79 | +numberSet.difference(new Set); |
| 80 | +numberSet.difference(stringSet); |
| 81 | +numberSet.difference(numberMap); |
| 82 | +numberSet.difference(numberSetLike); |
| 83 | +numberSet.symmetricDifference([]); |
| 84 | +numberSet.symmetricDifference(new Set); |
| 85 | +numberSet.symmetricDifference(stringSet); |
| 86 | +numberSet.symmetricDifference(numberMap); |
| 87 | +numberSet.symmetricDifference(numberSetLike); |
| 88 | +numberSet.isSubsetOf([]); |
| 89 | +numberSet.isSubsetOf(new Set); |
| 90 | +numberSet.isSubsetOf(stringSet); |
| 91 | +numberSet.isSubsetOf(numberMap); |
| 92 | +numberSet.isSubsetOf(numberSetLike); |
| 93 | +numberSet.isSupersetOf([]); |
| 94 | +numberSet.isSupersetOf(new Set); |
| 95 | +numberSet.isSupersetOf(stringSet); |
| 96 | +numberSet.isSupersetOf(numberMap); |
| 97 | +numberSet.isSupersetOf(numberSetLike); |
| 98 | +numberSet.isDisjointFrom([]); |
| 99 | +numberSet.isDisjointFrom(new Set); |
| 100 | +numberSet.isDisjointFrom(stringSet); |
| 101 | +numberSet.isDisjointFrom(numberMap); |
| 102 | +numberSet.isDisjointFrom(numberSetLike); |
0 commit comments