Revision 4fb6087f4a71cbc6c59e7107ebeea36dede62cc9 authored by Brandon Philips on 24 June 2014, 17:55:54 UTC, committed by Brandon Philips on 24 June 2014, 17:56:53 UTC
1 parent 5524131
heap_test.go
package store
import (
"fmt"
"testing"
"time"
)
func TestHeapPushPop(t *testing.T) {
h := newTtlKeyHeap()
// add from older expire time to earlier expire time
// the path is equal to ttl from now
for i := 0; i < 10; i++ {
path := fmt.Sprintf("%v", 10-i)
m := time.Duration(10 - i)
n := newKV(nil, path, path, 0, nil, "", time.Now().Add(time.Second*m))
h.push(n)
}
min := time.Now()
for i := 0; i < 10; i++ {
node := h.pop()
if node.ExpireTime.Before(min) {
t.Fatal("heap sort wrong!")
}
min = node.ExpireTime
}
}
func TestHeapUpdate(t *testing.T) {
h := newTtlKeyHeap()
kvs := make([]*node, 10)
// add from older expire time to earlier expire time
// the path is equal to ttl from now
for i, n := range kvs {
path := fmt.Sprintf("%v", 10-i)
m := time.Duration(10 - i)
n = newKV(nil, path, path, 0, nil, "", time.Now().Add(time.Second*m))
kvs[i] = n
h.push(n)
}
// Path 7
kvs[3].ExpireTime = time.Now().Add(time.Second * 11)
// Path 5
kvs[5].ExpireTime = time.Now().Add(time.Second * 12)
h.update(kvs[3])
h.update(kvs[5])
min := time.Now()
for i := 0; i < 10; i++ {
node := h.pop()
if node.ExpireTime.Before(min) {
t.Fatal("heap sort wrong!")
}
min = node.ExpireTime
if i == 8 {
if node.Path != "7" {
t.Fatal("heap sort wrong!", node.Path)
}
}
if i == 9 {
if node.Path != "5" {
t.Fatal("heap sort wrong!")
}
}
}
}
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...