mirror of
https://gitee.com/johng/gf.git
synced 2024-11-30 03:07:45 +08:00
84 lines
1.9 KiB
Go
84 lines
1.9 KiB
Go
// Copyright GoFrame Author(https://goframe.org). All Rights Reserved.
|
|
//
|
|
// This Source Code Form is subject to the terms of the MIT License.
|
|
// If a copy of the MIT was not distributed with this file,
|
|
// You can obtain one at https://github.com/gogf/gf.
|
|
|
|
package gtimer
|
|
|
|
import (
|
|
"github.com/gogf/gf/container/garray"
|
|
"github.com/gogf/gf/test/gtest"
|
|
"testing"
|
|
"time"
|
|
)
|
|
|
|
func TestTimer_Proceed(t *testing.T) {
|
|
gtest.C(t, func(t *gtest.T) {
|
|
array := garray.New(true)
|
|
timer := New(TimerOptions{
|
|
Interval: time.Hour,
|
|
})
|
|
timer.Add(10000*time.Hour, func() {
|
|
array.Append(1)
|
|
})
|
|
timer.proceed(10001)
|
|
time.Sleep(10 * time.Millisecond)
|
|
t.Assert(array.Len(), 1)
|
|
timer.proceed(20001)
|
|
time.Sleep(10 * time.Millisecond)
|
|
t.Assert(array.Len(), 2)
|
|
})
|
|
gtest.C(t, func(t *gtest.T) {
|
|
array := garray.New(true)
|
|
timer := New(TimerOptions{
|
|
Interval: time.Millisecond * 100,
|
|
})
|
|
timer.Add(10000*time.Hour, func() {
|
|
array.Append(1)
|
|
})
|
|
ticks := int64((10000 * time.Hour) / (time.Millisecond * 100))
|
|
timer.proceed(ticks + 1)
|
|
time.Sleep(10 * time.Millisecond)
|
|
t.Assert(array.Len(), 1)
|
|
timer.proceed(2*ticks + 1)
|
|
time.Sleep(10 * time.Millisecond)
|
|
t.Assert(array.Len(), 2)
|
|
})
|
|
}
|
|
|
|
func TestTimer_PriorityQueue(t *testing.T) {
|
|
gtest.C(t, func(t *gtest.T) {
|
|
queue := newPriorityQueue()
|
|
queue.Push(1, 1)
|
|
queue.Push(4, 4)
|
|
queue.Push(5, 5)
|
|
queue.Push(2, 2)
|
|
queue.Push(3, 3)
|
|
t.Assert(queue.Pop(), 1)
|
|
t.Assert(queue.Pop(), 2)
|
|
t.Assert(queue.Pop(), 3)
|
|
t.Assert(queue.Pop(), 4)
|
|
t.Assert(queue.Pop(), 5)
|
|
})
|
|
}
|
|
|
|
func TestTimer_PriorityQueue_FirstOneInArrayIsTheLeast(t *testing.T) {
|
|
gtest.C(t, func(t *gtest.T) {
|
|
var (
|
|
size = 1000000
|
|
array = garray.NewIntArrayRange(0, size, 1)
|
|
)
|
|
array.Shuffle()
|
|
queue := newPriorityQueue()
|
|
array.Iterator(func(k int, v int) bool {
|
|
queue.Push(v, int64(v))
|
|
return true
|
|
})
|
|
for i := 0; i < size; i++ {
|
|
t.Assert(queue.Pop(), i)
|
|
t.Assert(queue.heap.array[0].priority, i+1)
|
|
}
|
|
})
|
|
}
|