-
Notifications
You must be signed in to change notification settings - Fork 0
/
set.test.ts
65 lines (58 loc) · 2.15 KB
/
set.test.ts
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
import * as set from './set.ts'
import * as iter from './iter.ts'
import { describe, it } from 'node:test'
import * as assert from 'node:assert'
describe('set', () => {
describe('intersect', () => {
it('should return empty set when one or both inputs are empty', () => {
const result = set.intersect(new Set([]))(new Set([]))
assert.equal(result instanceof Set, true)
assert.equal(result.size, 0)
const result_2 = set.intersect(new Set([1,2,3]))(new Set([]))
assert.equal(result_2 instanceof Set, true)
assert.equal(result_2.size, 0)
const result_3 = set.intersect(new Set([]))(new Set([1,2,3]))
assert.equal(result_3 instanceof Set, true)
assert.equal(result_3.size, 0)
});
it('should intersect two sets', () => {
const result = set.intersect(new Set([1,2,3]))(new Set([1,3,4]))
assert.equal(result instanceof Set, true)
assert.equal(result.size, 2)
assert.deepEqual(Array.from(result), [1,3])
});
it('should compose with foldl1', () => {
const sets = [
new Set([1,2,3]),
new Set([1,3,'test']),
new Set([3]),
]
const result = iter.foldl1(set.intersect, new Set())(sets)
assert.equal(result instanceof Set, true)
assert.equal(result.size, 1)
assert.deepEqual(Array.from(result), [3])
});
});
describe('add1', () => {
it('should return a new set with an extra element', () => {
const as = new Set([1, 2])
const bs = set.add1(3)(as)
assert.notEqual(as, bs)
assert.deepEqual(
Array.from(bs),
[ 1, 2, 3 ]
)
})
})
describe('remove1', () => {
it('should return a new set with an element fewer', () => {
const as = new Set([1, 2])
const bs = set.remove1(2)(as)
assert.notEqual(as, bs)
assert.deepEqual(
Array.from(bs),
[ 1 ]
)
})
})
})