编写优先级队列时，如何向用户隐藏堆方法？

Question

I'm following this code to implement a priority queue. The thing I don't like is that when using it in the main method, the user has to call heap.Push and heap.Pop. It would make more sense to me to have my Priority queue contain a heap, rather than wrapping it in a heap. Am I thinking about this wrong, or does the example code show the right way to do it in Golang?

Answer 1

I created a wrapper class which calls heap.Push and heap.Pop.

package huffman

import "container/heap"

type RunePriorityQueue struct {
    queue PriorityQueue
}

func (RunePriorityQueue) NewRunePriorityQueue() *RunePriorityQueue {
    newRPQ := new(RunePriorityQueue)
    heap.Init(&newRPQ.queue)
    return newRPQ
}

func (rpq *RunePriorityQueue) Push(item *Item) {
    heap.Push(&rpq.queue, item)
}

func (rpq *RunePriorityQueue) Pop() *Item {
    return heap.Pop(&rpq.queue).(*Item)
}