priority_queue

package

v0.1.1 Latest Latest Go to latest Published: Jan 26, 2019 License: MIT Imports: 2 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

Package priority_queue implement a thread safe priority powered by "container/heap"

View Source

const (
	Default_PQueue_Size = 1024
)

This section is empty.

This section is empty.

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

PQueue implement a priority queue

func NewPQueue(size int) *PQueue

return a fix size priority queue

func (pq *PQueue) Cap() int

return queue size

func (pq *PQueue) IsEmpty() bool

check if queue is empty

func (pq *PQueue) IsFull() bool

check if queue if full(reach max capacity)

func (pq PQueue) Len() int

below is used to implement internal interface ref:https://godoc.org/container/heap shall not use it directly

func (pq *PQueue) Length() int

return queue size

func (pq PQueue) Less(i, j int) bool

func (pq *PQueue) Pop() interface{}

func (pq *PQueue) PopItem() (interface{}, bool)

Pop a item from priority queue

func (pq *PQueue) Push(v interface{})

func (pq *PQueue) PushItem(v *Payload) (evicted bool)

Push a item into priority queue

func (pq PQueue) Swap(i, j int)

type Payload struct {
	Value    interface{}
	Priority int
	// contains filtered or unexported fields
}

payload holds the data in priority queue