forked from rjNemo/underscore
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpipe_test.go
110 lines (94 loc) · 2.17 KB
/
pipe_test.go
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
package underscore_test
import (
"testing"
u "github.com/rjNemo/underscore"
"github.com/stretchr/testify/assert"
)
func TestChainFilter(t *testing.T) {
want := []int{2, 4, 6, 8}
assert.Equal(t,
want,
u.NewPipe(nums).Filter(isEven).Value,
)
}
func TestChainFilterMap(t *testing.T) {
want := []int{4, 16, 36, 64}
assert.Equal(t,
want,
u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Value)
}
func TestChainFilterMapReduce(t *testing.T) {
want := 120
assert.Equal(t,
want,
u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Reduce(sum, 0))
}
func TestChainFilterMapContains(t *testing.T) {
assert.True(t, u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Contains(16))
}
func TestChainFilterMapEach(t *testing.T) {
want := []int{5, 17, 37, 65}
res := make([]int, 0)
u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Each(func(n int) { res = append(res, n+1) })
assert.Equal(t, want, res)
}
func TestChainFilterMapAll(t *testing.T) {
assert.True(t, u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
All(func(n int) bool { return n%4 == 0 }))
}
func TestChainFilterMapFind(t *testing.T) {
n, err := u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Find(func(n int) bool { return n%4 == 0 })
assert.Equal(t, 4, n)
assert.NoError(t, err)
}
func TestChainFilterMapMax(t *testing.T) {
want := 64
assert.Equal(t, want, u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Max())
}
func TestChainFilterMapMin(t *testing.T) {
w := 4
assert.Equal(t, w, u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Min())
}
func TestChainFilterMapPartition(t *testing.T) {
wantLeft := []int{4, 16}
wantRight := []int{36, 64}
left, right := u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Partition(func(n int) bool { return n < 20 })
assert.Equal(t, wantLeft, left)
assert.Equal(t, wantRight, right)
}
func TestChainFilterMapAny(t *testing.T) {
assert.True(t, u.NewPipe(nums).
Filter(isEven).
Map(toSquare).
Any(func(n int) bool { return n%64 == 0 }))
}
var nums = []int{1, 2, 3, 4, 5, 6, 7, 8, 9}
var isEven = func(n int) bool { return n%2 == 0 }
var toSquare = func(n int) int { return n * n }
var sum = func(n, acc int) int { return n + acc }