(t *testing.T)
| 6 | ) |
| 7 | |
| 8 | func TestHeap(t *testing.T) { |
| 9 | queue := make(Queue, 10) |
| 10 | for i := 0; i < 10; i++ { |
| 11 | item:=&Item{ |
| 12 | data: i + 1, |
| 13 | ref: i + 1, |
| 14 | index: i, |
| 15 | } |
| 16 | queue[i] = item |
| 17 | } |
| 18 | heap.Init(&queue) |
| 19 | item := Item{ |
| 20 | data: 8, |
| 21 | ref: 1, |
| 22 | } |
| 23 | heap.Push(&queue, &item) |
| 24 | heap.Fix(&queue, 2) |
| 25 | for queue.Len() > 0 { |
| 26 | item := heap.Pop(&queue).(*Item) |
| 27 | t.Log("index", item.index, "ref", item.ref, "val", item.data) |
| 28 | } |
| 29 | } |