-
Notifications
You must be signed in to change notification settings - Fork 0
/
pricelist_test.go
125 lines (107 loc) · 2.48 KB
/
pricelist_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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
package orderbook
import (
"context"
"testing"
pool "github.com/jolestar/go-commons-pool"
"github.com/stretchr/testify/assert"
)
type action struct {
typ string
val int
}
func TestAscend(t *testing.T) {
tests := []struct {
actions []action
out []int
}{
{
[]action{{"get", 3}, {"get", 5}, {"get", 10}},
[]int{3, 5, 10},
},
{
[]action{{"get", 3}, {"get", 5}, {"get", 10}, {"del", 5}},
[]int{3, 10},
},
{
[]action{{"get", 203}, {"get", 293}, {"get", 1}, {"get", 4}},
[]int{1, 4, 203, 293},
},
{
[]action{{"get", 203}, {"get", 293}, {"get", 1}, {"get", 4}, {"del", 203}},
[]int{1, 4, 293},
},
{
[]action{{"get", 100}, {"del", 100}, {"del", 200}},
[]int{},
},
}
for _, test := range tests {
priceList := initPriceList(t)
processAction(t, priceList, test.actions...)
result := make([]int, 0, priceList.l.GetNodeCount())
priceList.Ascend(func(item *PriceItem) bool {
result = append(result, item.Price)
return true
})
assert.Equal(t, test.out, result)
}
}
func TestDescend(t *testing.T) {
tests := []struct {
actions []action
out []int
}{
{
[]action{{"get", 3}, {"get", 5}, {"get", 10}},
[]int{10, 5, 3},
},
{
[]action{{"get", 3}, {"get", 5}, {"get", 10}, {"del", 5}},
[]int{10, 3},
},
{
[]action{{"get", 203}, {"get", 293}, {"get", 1}, {"get", 4}},
[]int{293, 203, 4, 1},
},
{
[]action{{"get", 203}, {"get", 293}, {"get", 1}, {"get", 4}, {"del", 203}},
[]int{293, 4, 1},
},
{
[]action{{"get", 100}, {"del", 100}, {"del", 200}},
[]int{},
},
}
for _, test := range tests {
priceList := initPriceList(t)
processAction(t, priceList, test.actions...)
result := make([]int, 0, priceList.l.GetNodeCount())
priceList.Descend(func(item *PriceItem) bool {
result = append(result, item.Price)
return true
})
assert.Equal(t, test.out, result)
}
}
func initPriceList(t *testing.T) *PriceList {
t.Helper()
ctx := context.WithValue(context.Background(), "order_queue_size", uint64(1))
cfg := pool.NewDefaultPoolConfig()
cfg.MaxTotal = 10
cfg.MaxIdle = -1
cfg.MinIdle = -1
orderQueuePool := pool.NewObjectPool(ctx, &OrderQueueObjectFactory{}, cfg)
pool.Prefill(ctx, orderQueuePool, 10)
return NewPriceList(orderQueuePool)
}
func processAction(t *testing.T, priceList *PriceList, actions ...action) {
t.Helper()
for _, action := range actions {
switch action.typ {
case "get":
priceList.GetItem(action.val)
case "del":
priceList.Delete(action.val)
}
}
}