priority_queue TODO
This commit is contained in:
@@ -247,17 +247,11 @@ func TestPutStable(t *testing.T) {
|
||||
// log.SetOutput(f)
|
||||
// 0-1 3 | 2-3 7-8 | 4-7 12-16 | 8-15 20-32 | 16-31 33-58 l := []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 18, 19, 20, 21, 22, 30, 41, 41, 41}
|
||||
|
||||
// for i := 0; i < 100000; i++ {
|
||||
// var l []int
|
||||
// for len(l) < 1000 {
|
||||
// l = append(l, randomdata.Number(0, 100))
|
||||
// }
|
||||
|
||||
// tree := New(compare.Int)
|
||||
// for _, v := range l {
|
||||
// tree.Put(v)
|
||||
// }
|
||||
// }
|
||||
tree := New(compare.Int)
|
||||
for i := 0; i < 10; i++ {
|
||||
tree.Put(randomdata.Number(0, 100))
|
||||
}
|
||||
t.Error(tree.debugString())
|
||||
|
||||
// t.Error(tree.debugString(), tree.TraversalBreadth(), "\n", "-----------")
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user