queue

Documentation

Index

• Variables
• type PriorityQueue
  • func NewPriorityQueue[T any](capacity int, compare ekit.Comparator[T]) *PriorityQueue[T]
  • func (p *PriorityQueue[T]) Cap() int
  • func (p *PriorityQueue[T]) Dequeue() (T, error)
  • func (p *PriorityQueue[T]) Enqueue(t T) error
  • func (p *PriorityQueue[T]) IsBoundless() bool
  • func (p *PriorityQueue[T]) Len() int
  • func (p *PriorityQueue[T]) Peek() (T, error)

Variables

var (
	ErrOutOfCapacity = errors.New("ekit: 超出最大容量限制")
	ErrEmptyQueue    = errors.New("ekit: 队列为空")
)

Types

type PriorityQueue

type PriorityQueue[T any] struct {
	// contains filtered or unexported fields
}

PriorityQueue 是一个基于小顶堆的优先队列 当capacity <= 0时，为无界队列，切片容量会动态扩缩容 当capacity > 0 时，为有界队列，初始化后就固定容量，不会扩缩容

func NewPriorityQueue

func NewPriorityQueue[T any](capacity int, compare ekit.Comparator[T]) *PriorityQueue[T]

NewPriorityQueue 创建优先队列 capacity <= 0 时，为无界队列，否则有有界队列

func (*PriorityQueue[T]) Cap

func (p *PriorityQueue[T]) Cap() int

Cap 无界队列返回0，有界队列返回创建队列时设置的值

func (*PriorityQueue[T]) Dequeue

func (p *PriorityQueue[T]) Dequeue() (T, error)

func (*PriorityQueue[T]) Enqueue

func (p *PriorityQueue[T]) Enqueue(t T) error

func (*PriorityQueue[T]) IsBoundless

func (p *PriorityQueue[T]) IsBoundless() bool

func (*PriorityQueue[T]) Len

func (p *PriorityQueue[T]) Len() int

func (*PriorityQueue[T]) Peek

func (p *PriorityQueue[T]) Peek() (T, error)