()
| 35 | } |
| 36 | |
| 37 | func (h *MaxHeap) Pop() Comparable { |
| 38 | if h.heapSize == 0 { |
| 39 | return nil |
| 40 | } |
| 41 | |
| 42 | i := h.slice[0] |
| 43 | h.heapSize-- |
| 44 | |
| 45 | h.slice[0] = h.slice[h.heapSize] |
| 46 | h.updateidx(0) |
| 47 | h.heapifyDown(0) |
| 48 | |
| 49 | h.slice = h.slice[0:h.heapSize] |
| 50 | return i |
| 51 | } |
| 52 | |
| 53 | func (h *MaxHeap) Push(i Comparable) { |
| 54 | h.slice = append(h.slice, i) |
no test coverage detected