Hesham/wireguard-go
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Trie random test

Browse Source 
Test trie against naive implementation of prefix routing.
This commit is contained in:
Mathias Hall-Andersen 2017-06-02 18:02:04 +02:00
parent a377bcaed7
commit dbc3ee3e9d
1 changed files with 10 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/trie_rand_test.go
View File

@ -12,7 +12,13 @@ const (
NumberOfTests = 10000 NumberOfTests = 10000
) )
type SlowRouter []*Trie type SlowNode struct {
peer *Peer
cidr uint
bits []byte
}
type SlowRouter []*SlowNode
func (r SlowRouter) Len() int { func (r SlowRouter) Len() int {
return len(r) return len(r)
@ -34,7 +40,7 @@ func (r SlowRouter) Insert(addr []byte, cidr uint, peer *Peer) SlowRouter {
return r return r
} }
} }
r = append(r, &Trie{ r = append(r, &SlowNode{
cidr: cidr, cidr: cidr,
bits: addr, bits: addr,
peer: peer, peer: peer,
@ -81,7 +87,7 @@ func TestTrieRandomIPv4(t *testing.T) {
peer1 := slow.Lookup(addr[:]) peer1 := slow.Lookup(addr[:])
peer2 := trie.Lookup(addr[:]) peer2 := trie.Lookup(addr[:])
if peer1 != peer2 { if peer1 != peer2 {
t.Error("Trie did not match niave implementation, for:", addr) t.Error("Trie did not match naive implementation, for:", addr)
} }
} }
} }
@ -114,7 +120,7 @@ func TestTrieRandomIPv6(t *testing.T) {
peer1 := slow.Lookup(addr[:]) peer1 := slow.Lookup(addr[:])
peer2 := trie.Lookup(addr[:]) peer2 := trie.Lookup(addr[:])
if peer1 != peer2 { if peer1 != peer2 {
t.Error("Trie did not match niave implementation, for:", addr) t.Error("Trie did not match naive implementation, for:", addr)
} }
} }
} }