priorityqueue

package

v4.7.2 Latest Latest Go to latest Published: May 2, 2024 License: MIT Imports: 2 Imported by: 1

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

Repository

github.com/roadrunner-server/sdk

Links

Open Source Insights

Documentation ¶

Index ¶

type BinHeap
- func NewBinHeap[T Item](maxLen uint64) *BinHeap[T]
type Item

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type BinHeap ¶

type BinHeap[T Item] struct {
	// contains filtered or unexported fields
}

func NewBinHeap ¶

func NewBinHeap[T Item](maxLen uint64) *BinHeap[T]

func (*BinHeap[T]) Exists ¶ added in v4.3.1

func (bh *BinHeap[T]) Exists(id string) bool

func (*BinHeap[T]) ExtractMin ¶

func (bh *BinHeap[T]) ExtractMin() T

func (*BinHeap[T]) Insert ¶

func (bh *BinHeap[T]) Insert(item T)

func (*BinHeap[T]) Len ¶

func (bh *BinHeap[T]) Len() uint64

func (*BinHeap[T]) PeekPriority ¶ added in v4.1.0

func (bh *BinHeap[T]) PeekPriority() int64

PeekPriority returns the highest priority

func (*BinHeap[T]) Remove ¶ added in v4.2.0

func (bh *BinHeap[T]) Remove(groupID string) []T

Remove removes all elements with the provided ID and returns the slice with them

type Item ¶

type Item interface {
	// Unique ID of the item
	ID() string
	// Priority returns the Item's priority to sort
	Priority() int64
	// GroupID represents the Item's group, used to delete all Items with the same GroupID
	GroupID() string
}

Item represents binary heap item

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL