heap

package

v0.4.6 Latest Latest Go to latest Published: Jun 16, 2022 License: Apache-2.0 Imports: 4 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

type Elem[E any, W constraints.Ordered] struct {
	Value  E
	Weight W
}

type PriorityQueue struct {
	// contains filtered or unexported fields
}

PriorityQueue represents the priority queue.

func NewPriorityQueue(desc bool) *PriorityQueue

NewPriorityQueue initializes an empty priority queue.

func (p *PriorityQueue) Clone() *PriorityQueue

func (p *PriorityQueue) Elems() []Elem[int32, float32]

func (e *PriorityQueue) Len() int

func (e *PriorityQueue) Less(i, j int) bool

func (p *PriorityQueue) Peek() (int32, float32)

func (p *PriorityQueue) Pop() (int32, float32)

Pop removes the element with the highest priority from the queue and returns it. In case of an empty queue, an error is returned.

func (p *PriorityQueue) Push(v int32, weight float32)

Push inserts a new element into the queue. No action is performed on duplicate elements.

func (p *PriorityQueue) Reverse() *PriorityQueue

func (e *PriorityQueue) Swap(i, j int)

func (p *PriorityQueue) Values() []int32

type TopKFilter[T any, W constraints.Ordered] struct {
	// contains filtered or unexported fields
}

TopKFilter filters out top k items with maximum weights.

func NewTopKFilter[T any, W constraints.Ordered](k int) *TopKFilter[T, W]

NewTopKFilter creates a top k filter.

func (e *TopKFilter) Len() int

func (e *TopKFilter) Less(i, j int) bool

func (e *TopKFilter) Pop() interface{}

func (filter *TopKFilter[T, W]) PopAll() ([]T, []W)

PopAll pops all items in the filter with decreasing order.

func (filter *TopKFilter[T, W]) Push(item T, weight W)

Push pushes the element x onto the heap. The complexity is O(log n) where n = h.Count().

func (e *TopKFilter) Swap(i, j int)