Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Item ¶
type Item struct {
// contains filtered or unexported fields
}
An Item is something we manage in a priority queue.
type PriorityQueue ¶
type PriorityQueue []*Item
A PriorityQueue implements heap.Interface and holds Items.
func (PriorityQueue) AtIdx ¶
func (pq PriorityQueue) AtIdx(i int) *Item
AtIdx gets item at given index
func (PriorityQueue) Cap ¶
func (pq PriorityQueue) Cap() int
Cap returns the current capacity of the underlying array of the Priority Queue
func (PriorityQueue) Len ¶
func (pq PriorityQueue) Len() int
Len returns the current length of the underlying array of the PriorityQueue
func (PriorityQueue) Less ¶
func (pq PriorityQueue) Less(i, j int) bool
Less defines item ordering. Priority is defined by trigger time in the future
func (*PriorityQueue) Pop ¶
func (pq *PriorityQueue) Pop() interface{}
Pop the item with the closest trigger time (priority)
func (*PriorityQueue) Push ¶
func (pq *PriorityQueue) Push(x interface{})
Push an item to this PriorityQueue
func (PriorityQueue) Swap ¶
func (pq PriorityQueue) Swap(i, j int)
Source Files
Click to show internal directories.
Click to hide internal directories.