(self: HashSet<V0>, that: HashSet<V1>)
| 124 | |
| 125 | /** @internal */ |
| 126 | export const intersection = <V0, V1>(self: HashSet<V0>, that: HashSet<V1>): HashSet<V0 & V1> => { |
| 127 | let result = HashMap.empty<V0 & V1, boolean>() |
| 128 | for (const value of self) { |
| 129 | if (has(that, value as any)) { |
| 130 | result = HashMap.set(result, value as V0 & V1, true) |
| 131 | } |
| 132 | } |
| 133 | return makeImpl(result) |
| 134 | } |
| 135 | |
| 136 | /** @internal */ |
| 137 | export const difference = <V0, V1>(self: HashSet<V0>, that: HashSet<V1>): HashSet<V0> => |
no test coverage detected
searching dependent graphs…