2015-01-25 06:19:16 +03:00
|
|
|
// Copyright 2015 CoreOS, Inc.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
2014-10-18 02:41:22 +04:00
|
|
|
|
2013-11-04 11:34:47 +04:00
|
|
|
package store
|
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
"testing"
|
|
|
|
"time"
|
|
|
|
)
|
|
|
|
|
|
|
|
func TestHeapPushPop(t *testing.T) {
|
2013-11-05 09:51:14 +04:00
|
|
|
h := newTtlKeyHeap()
|
2013-11-04 11:34:47 +04:00
|
|
|
|
2013-11-04 11:51:48 +04:00
|
|
|
// 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)
|
2015-02-27 01:49:42 +03:00
|
|
|
n := newKV(nil, path, path, 0, nil, time.Now().Add(time.Second*m))
|
2013-11-05 09:33:23 +04:00
|
|
|
h.push(n)
|
2013-11-04 11:51:48 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
min := time.Now()
|
|
|
|
|
|
|
|
for i := 0; i < 10; i++ {
|
2013-11-05 09:33:23 +04:00
|
|
|
node := h.pop()
|
2013-11-04 11:51:48 +04:00
|
|
|
if node.ExpireTime.Before(min) {
|
|
|
|
t.Fatal("heap sort wrong!")
|
|
|
|
}
|
|
|
|
min = node.ExpireTime
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestHeapUpdate(t *testing.T) {
|
2013-11-05 09:51:14 +04:00
|
|
|
h := newTtlKeyHeap()
|
2013-11-04 11:51:48 +04:00
|
|
|
|
2013-11-28 06:02:28 +04:00
|
|
|
kvs := make([]*node, 10)
|
2013-11-04 11:34:47 +04:00
|
|
|
|
|
|
|
// add from older expire time to earlier expire time
|
|
|
|
// the path is equal to ttl from now
|
2015-02-18 00:15:48 +03:00
|
|
|
for i := range kvs {
|
2013-11-04 11:34:47 +04:00
|
|
|
path := fmt.Sprintf("%v", 10-i)
|
|
|
|
m := time.Duration(10 - i)
|
2015-02-27 01:49:42 +03:00
|
|
|
n := newKV(nil, path, path, 0, nil, time.Now().Add(time.Second*m))
|
2013-11-04 11:51:48 +04:00
|
|
|
kvs[i] = n
|
2013-11-05 09:33:23 +04:00
|
|
|
h.push(n)
|
2013-11-04 11:34:47 +04:00
|
|
|
}
|
|
|
|
|
2013-11-04 11:51:48 +04:00
|
|
|
// Path 7
|
|
|
|
kvs[3].ExpireTime = time.Now().Add(time.Second * 11)
|
|
|
|
|
|
|
|
// Path 5
|
|
|
|
kvs[5].ExpireTime = time.Now().Add(time.Second * 12)
|
|
|
|
|
2013-11-05 09:22:22 +04:00
|
|
|
h.update(kvs[3])
|
|
|
|
h.update(kvs[5])
|
2013-11-04 11:51:48 +04:00
|
|
|
|
2013-11-04 11:34:47 +04:00
|
|
|
min := time.Now()
|
|
|
|
|
2013-11-04 11:51:48 +04:00
|
|
|
for i := 0; i < 10; i++ {
|
2013-11-05 09:33:23 +04:00
|
|
|
node := h.pop()
|
2013-11-04 11:34:47 +04:00
|
|
|
if node.ExpireTime.Before(min) {
|
|
|
|
t.Fatal("heap sort wrong!")
|
|
|
|
}
|
|
|
|
min = node.ExpireTime
|
2013-11-04 11:51:48 +04:00
|
|
|
|
|
|
|
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!")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-11-04 11:34:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|