priq

Documentation

Overview

Package priq 带优先级功的队列，可以进行select操作，并且有容量限制

Index

• Variables
• type EntryList
  • func (e EntryList) Len() int
  • func (e EntryList) Less(i, j int) bool
  • func (e *EntryList) Pop() interface{}
  • func (e *EntryList) Push(x interface{})
  • func (e EntryList) Swap(i, j int)
• type IEntry
• type PriQueue
  • func NewPriQueue(capability int) *PriQueue
  • func (pq *PriQueue) Len() int
  • func (pq *PriQueue) Pop() IEntry
  • func (pq *PriQueue) Push(e IEntry) error
  • func (pq *PriQueue) WaitCh() <-chan struct{}

Variables

var ErrQueueIsFull = errors.New("queue.is.full")

Types

type EntryList

type EntryList []*wrapEntry

func (EntryList) Len

func (e EntryList) Len() int

func (EntryList) Less

func (e EntryList) Less(i, j int) bool

Less 根据less从小到大排列，排在前面的先Pop（也就是优先级更高）

func (*EntryList) Pop

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

func (*EntryList) Push

func (e *EntryList) Push(x interface{})

func (EntryList) Swap

func (e EntryList) Swap(i, j int)

type IEntry

type IEntry interface {
	GetPriority() int
}

type PriQueue

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

func NewPriQueue

func NewPriQueue(capability int) *PriQueue

func (*PriQueue) Len

func (pq *PriQueue) Len() int

func (*PriQueue) Pop

func (pq *PriQueue) Pop() IEntry

Pop 不阻塞，如果返回nil代表当前队列是空的

func (*PriQueue) Push

func (pq *PriQueue) Push(e IEntry) error

Push 不阻塞

func (*PriQueue) WaitCh

func (pq *PriQueue) WaitCh() <-chan struct{}

WaitCh 对 WaitCh() 返回的channel进行select，然后再使用Pop