Dequeue 移除并返回最小元素
()
| 79 | |
| 80 | // Dequeue 移除并返回最小元素 |
| 81 | func (pq *PriorityQueue[T]) Dequeue() (T, error) { |
| 82 | if pq.Len() == 0 { |
| 83 | var zero T |
| 84 | return zero, ErrEmptyQueue |
| 85 | } |
| 86 | result := heap.Pop(pq) |
| 87 | if result == nil { |
| 88 | var zero T |
| 89 | return zero, ErrEmptyQueue |
| 90 | } |
| 91 | return result.(T), nil |
| 92 | } |
no test coverage detected