diff options
Diffstat (limited to 'src/pkg/container/heap/heap_test.go')
| -rw-r--r-- | src/pkg/container/heap/heap_test.go | 9 |
1 files changed, 0 insertions, 9 deletions
diff --git a/src/pkg/container/heap/heap_test.go b/src/pkg/container/heap/heap_test.go index 5eb54374a..c5c1f76e1 100644 --- a/src/pkg/container/heap/heap_test.go +++ b/src/pkg/container/heap/heap_test.go @@ -10,17 +10,14 @@ import ( . "container/heap" ) - type myHeap struct { // A vector.Vector implements sort.Interface except for Less, // and it implements Push and Pop as required for heap.Interface. vector.Vector } - func (h *myHeap) Less(i, j int) bool { return h.At(i).(int) < h.At(j).(int) } - func (h *myHeap) verify(t *testing.T, i int) { n := h.Len() j1 := 2*i + 1 @@ -41,7 +38,6 @@ func (h *myHeap) verify(t *testing.T, i int) { } } - func TestInit0(t *testing.T) { h := new(myHeap) for i := 20; i > 0; i-- { @@ -59,7 +55,6 @@ func TestInit0(t *testing.T) { } } - func TestInit1(t *testing.T) { h := new(myHeap) for i := 20; i > 0; i-- { @@ -77,7 +72,6 @@ func TestInit1(t *testing.T) { } } - func Test(t *testing.T) { h := new(myHeap) h.verify(t, 0) @@ -105,7 +99,6 @@ func Test(t *testing.T) { } } - func TestRemove0(t *testing.T) { h := new(myHeap) for i := 0; i < 10; i++ { @@ -123,7 +116,6 @@ func TestRemove0(t *testing.T) { } } - func TestRemove1(t *testing.T) { h := new(myHeap) for i := 0; i < 10; i++ { @@ -140,7 +132,6 @@ func TestRemove1(t *testing.T) { } } - func TestRemove2(t *testing.T) { N := 10 |