forked from mostlygeek/arp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
arp_test.go
94 lines (74 loc) · 1.46 KB
/
arp_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
package arp
import (
"fmt"
"testing"
"time"
)
var (
_ = fmt.Println
)
func TestTable(t *testing.T) {
table := Table()
if table == nil {
t.Errorf("Empty table")
}
}
func TestCacheInfo(t *testing.T) {
prevUpdated := CacheLastUpdate().UnixNano()
prevCount := CacheUpdateCount()
CacheUpdate()
if prevUpdated == CacheLastUpdate().UnixNano() {
t.Error()
}
if prevCount == CacheUpdateCount() {
t.Error()
}
}
func TestAutoRefresh(t *testing.T) {
if testing.Short() {
t.Skip("Skipping autorefresh test")
}
prevUpdated := CacheLastUpdate().UnixNano()
prevCount := CacheUpdateCount()
AutoRefresh(100 * time.Millisecond)
time.Sleep(200 * time.Millisecond)
StopAutoRefresh()
if prevUpdated == CacheLastUpdate().UnixNano() {
t.Error()
}
if prevCount == CacheUpdateCount() {
t.Error()
}
// test to make sure stop worked
prevUpdated = CacheLastUpdate().UnixNano()
prevCount = CacheUpdateCount()
time.Sleep(200 * time.Millisecond)
if prevUpdated != CacheLastUpdate().UnixNano() {
t.Error()
}
if prevCount != CacheUpdateCount() {
t.Error()
}
}
func TestSearch(t *testing.T) {
table := Table()
for ip, test := range table {
result := Search(ip)
if test != result {
t.Errorf("expected %s got %s", test, result)
}
}
}
func BenchmarkSearch(b *testing.B) {
table := Table()
if len(table) == 0 {
return
}
for ip, _ := range Table() {
for i := 0; i < b.N; i++ {
Search(ip)
}
// using the first key is enough
break
}
}