README
¶
pq
Heap based Priority Queue. Based on the containers/heap standard library.
Usage
package main
import (
"fmt"
"github.com/libds/pq"
)
func main() {
p := pq.NewMin()
p.Push(&Item{
Value: "build:src",
Priority: 5,
})
p.Push(&Item{
Value: "test:run",
Priority: 15,
})
job := p.Pop()
fmt.Println(job) // {Value: test:run, Priority: 15, Index: 0}
item := p.Peek()
fmt.Println(item.Value) // build:src
fmt.Println(p.Size()) // 1
}
API Docs
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type MaxPQ ¶
type MaxPQ struct {
// contains filtered or unexported fields
}
func (*MaxPQ) Peek ¶
Returns the maximum item in the queue without removing it
The complexity is O(1)
func (*MaxPQ) Pop ¶
Pop removes the maximum element from the heap and returns it.
The complexity is O(log(n)) where n = p.Size().
func (*MaxPQ) Push ¶
Push pushes the element x onto the heap.
The complexity is O(log(n)) where n = p.Size().
type MinPQ ¶
type MinPQ struct {
// contains filtered or unexported fields
}
func (*MinPQ) Peek ¶
Returns the minimum item in the queue without removing it
The complexity is O(1)
func (*MinPQ) Pop ¶
Pop removes the minimum element from the heap and returns it.
The complexity is O(log(n)) where n = p.Size().
func (*MinPQ) Push ¶
Push pushes the element x onto the heap.
The complexity is O(log(n)) where n = p.Size().
Source Files
Click to show internal directories.
Click to hide internal directories.