Documentation
¶
Overview ¶
This example demonstrates a priority queue built using the heap interface.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func PlayKthElement ¶
func PlayKthElement()
Types ¶
type IMinHeapSizeK ¶
func NewMinHeapSizeK ¶
func NewMinHeapSizeK(k int) IMinHeapSizeK
type Item ¶
type Item struct {
// contains filtered or unexported fields
}
An Item is something we manage in a priority queue.
type MinHeapSizeK ¶
type MinHeapSizeK struct {
// contains filtered or unexported fields
}
func (*MinHeapSizeK) GetSize ¶
func (m *MinHeapSizeK) GetSize() int
func (*MinHeapSizeK) GetSmallestElement ¶
func (m *MinHeapSizeK) GetSmallestElement() int
func (*MinHeapSizeK) Insert ¶
func (m *MinHeapSizeK) Insert(n int)
type PriorityQueue ¶
type PriorityQueue []*Item
A PriorityQueue implements heap.Interface and holds Items.
func (PriorityQueue) Len ¶
func (pq PriorityQueue) Len() int
func (PriorityQueue) Less ¶
func (pq PriorityQueue) Less(i, j int) bool
func (*PriorityQueue) Pop ¶
func (pq *PriorityQueue) Pop() interface{}
func (*PriorityQueue) Push ¶
func (pq *PriorityQueue) Push(x interface{})
func (PriorityQueue) Swap ¶
func (pq PriorityQueue) Swap(i, j int)
Source Files
Click to show internal directories.
Click to hide internal directories.