mirror of https://github.com/tidwall/tile38.git
66 lines
1.3 KiB
Go
66 lines
1.3 KiB
Go
|
package tinyqueue
|
||
|
|
|
||
|
|
import (
|
||
|
|
"math/rand"
|
||
|
|
"sort"
|
||
|
|
"testing"
|
||
|
|
"time"
|
||
|
|
|
||
|
|
"github.com/stretchr/testify/assert"
|
||
|
|
)
|
||
|
|
|
||
|
|
type floatValue float64
|
||
|
|
|
||
|
|
func (a floatValue) Less(b Item) bool {
|
||
|
|
return a < b.(floatValue)
|
||
|
|
}
|
||
|
|
|
||
|
|
var data, sorted = func() ([]Item, []Item) {
|
||
|
|
rand.Seed(time.Now().UnixNano())
|
||
|
|
var data []Item
|
||
|
|
for i := 0; i < 100; i++ {
|
||
|
|
data = append(data, floatValue(rand.Float64()*100))
|
||
|
|
}
|
||
|
|
sorted := make([]Item, len(data))
|
||
|
|
copy(sorted, data)
|
||
|
|
sort.Slice(sorted, func(i, j int) bool {
|
||
|
|
return sorted[i].Less(sorted[j])
|
||
|
|
})
|
||
|
|
return data, sorted
|
||
|
|
}()
|
||
|
|
|
||
|
|
func TestMaintainsPriorityQueue(t *testing.T) {
|
||
|
|
q := New(nil)
|
||
|
|
for i := 0; i < len(data); i++ {
|
||
|
|
q.Push(data[i])
|
||
|
|
}
|
||
|
|
assert.Equal(t, q.Peek(), sorted[0])
|
||
|
|
var result []Item
|
||
|
|
for q.length > 0 {
|
||
|
|
result = append(result, q.Pop())
|
||
|
|
}
|
||
|
|
assert.Equal(t, result, sorted)
|
||
|
|
}
|
||
|
|
|
||
|
|
func TestAcceptsDataInConstructor(t *testing.T) {
|
||
|
|
q := New(data)
|
||
|
|
var result []Item
|
||
|
|
for q.length > 0 {
|
||
|
|
result = append(result, q.Pop())
|
||
|
|
}
|
||
|
|
assert.Equal(t, result, sorted)
|
||
|
|
}
|
||
|
|
func TestHandlesEdgeCasesWithFewElements(t *testing.T) {
|
||
|
|
q := New(nil)
|
||
|
|
q.Push(floatValue(2))
|
||
|
|
q.Push(floatValue(1))
|
||
|
|
q.Pop()
|
||
|
|
q.Pop()
|
||
|
|
q.Pop()
|
||
|
|
q.Push(floatValue(2))
|
||
|
|
q.Push(floatValue(1))
|
||
|
|
assert.Equal(t, float64(q.Pop().(floatValue)), 1.0)
|
||
|
|
assert.Equal(t, float64(q.Pop().(floatValue)), 2.0)
|
||
|
|
assert.Equal(t, q.Pop(), nil)
|
||
|
|
}
|