func TestMedianOfSorted(t *testing.T) {
for _, test := range []struct {
l []interface{}
i int
want *big.Rat
err error
}{
// Test for errors.
{[]interface{}{"x"}, 0, nil, ErrType},
{[]interface{}{0, 2, 1, 3}, 0, nil, ErrSort},
{[]interface{}{0, 1, 2}, -1, nil, ErrNode},
// Test lists with cycle.
{[]interface{}{1}, 0, big.NewRat(1, 1), nil},
{[]interface{}{0, 1}, 0, big.NewRat(1, 2), nil},
{[]interface{}{0, 1, 2}, 0, big.NewRat(1, 1), nil},
{[]interface{}{0, 1, 2, 3}, 0, big.NewRat(1+2, 2), nil},
{[]interface{}{10, 20, 30}, 1, big.NewRat(20, 1), nil},
{[]interface{}{10, 20, 30, 40}, 2, big.NewRat(20+30, 2), nil},
{[]interface{}{10, 20, 30, 40, 50}, 4, big.NewRat(30, 1), nil},
// Test lists without cycle.
{[]interface{}{}, -1, nil, nil},
{[]interface{}{0, 1, 2, 3, 4, 5}, -1, big.NewRat(2+3, 2), nil},
{[]interface{}{10, 20, 30, 40, 50}, -1, big.NewRat(30, 1), nil},
} {
l, n := lists.CreateCycle(test.l, test.i)
if test.err == ErrNode { // Setup an unknown node for an ErrNode test.
n = &lists.Node{}
}
if got, err := MedianOfSorted(l, n); !reflect.DeepEqual(got, test.want) || err != test.err {
t.Errorf("MedianOfSorted(%v, %v) = %v, %v; want %v, %v", test.l, n, got, err, test.want, test.err)
}
}
}
func benchMedianOfSorted(b *testing.B, size int) {
ints := rand.New(rand.NewSource(int64(size))).Perm(size)
sort.Ints(ints)
data := make([]interface{}, size)
for i, n := range ints {
data[i] = n
}
l, n := lists.CreateCycle(data, 0)
b.ResetTimer()
for i := 0; i < b.N; i++ {
MedianOfSorted(l, n)
}
}