-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcollections_test.go
More file actions
71 lines (67 loc) · 1.5 KB
/
collections_test.go
File metadata and controls
71 lines (67 loc) · 1.5 KB
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
package collections
import (
"testing"
"time"
)
func TestNewQueue(t *testing.T) {
t1 := time.Now()
q, e := NewQueue(100)
if nil != e {
t.Error("New Queue Failed:>", e)
t.Failed()
}
q.OnEvicted(func(v interface{}){
t.Log("Evicted:>", v)
})
for i:=1; i<1000; i++ {
q.Push(i)
}
for _, x := range q.Range(-10) {
t.Log("X1:>", x)
}
for _, x := range q.Range(50,60) {
t.Log("X2:>", x)
}
for _, x := range q.Range(50) {
t.Log("X3:>", x)
}
for _, x := range q.Range(90,0) {
t.Log("X4:>", x)
}
for v, e := q.Pop(); e == nil && v != nil; v, e = q.Pop() {
t.Log("V:>", v)
}
t2 := time.Now()
t.Log("T1:>", t1, "T2:>", t2, "Total:>", t2.Sub(t1))
}
func TestNewStack(t *testing.T) {
t1 := time.Now()
s, e := NewStack(100)
if nil != e {
t.Error("New Stack Failed:>", e)
t.Failed()
}
s.OnEvicted(func(v interface{}){
t.Log("Evicted:>", v)
})
for i:=1; i<1000; i++ {
s.Push(i)
}
for _, x := range s.Range(-10) {
t.Log("X1:>", x)
}
for _, x := range s.Range(50,60) {
t.Log("X2:>", x)
}
for _, x := range s.Range(50) {
t.Log("X3:>", x)
}
for _, x := range s.Range(90,0) {
t.Log("X4:>", x)
}
for v, e := s.Pop(); e == nil && v != nil; v, e = s.Pop() {
t.Log("V:>", v)
}
t2 := time.Now()
t.Log("T1:>", t1, "T2:>", t2, "Total:>", t2.Sub(t1))
}