queue

Documentation

Index

• Variables
• func Run(c Call, lock sync.Locker, qu Queue)
• type Call
• type Capacity
  • func NewCapacity(capacity int) *Capacity
  • func (sq *Capacity) Add(elem any) error
  • func (sq *Capacity) Empty() bool
  • func (sq *Capacity) Find(fn IndexFunc) (any, int)
  • func (sq *Capacity) Get(index int) any
  • func (sq *Capacity) Len() int
  • func (sq *Capacity) Less(i, j int) bool
  • func (sq *Capacity) Peek() any
  • func (sq *Capacity) Pop() any
  • func (sq *Capacity) Push(elem any)
  • func (sq *Capacity) Swap(i, j int)
  • func (sq *Capacity) ToList() []any
• type Circular
  • func NewCircular(size int, resetFunc ResetFunc) *Circular
  • func (cr *Circular) Add(it any) error
  • func (cr *Circular) Empty() bool
  • func (cr *Circular) Find(fn IndexFunc) (any, int)
  • func (cr *Circular) Len() int
  • func (cr *Circular) Next(index int) (any, int)
  • func (cr *Circular) Peek() any
  • func (cr *Circular) Pop() any
  • func (cr *Circular) Reset()
• type IPriority
  • func NewPriorityItem(elem any) IPriority
• type IndexFunc
• type Linked
  • func NewLinked(capacity int) *Linked
  • func (lq *Linked) Add(val any) error
  • func (lq *Linked) AddTail(val any) error
  • func (lq *Linked) Cap() int
  • func (lq *Linked) Empty() bool
  • func (lq *Linked) Find(fn IndexFunc) (any, int)
  • func (lq *Linked) Len() int
  • func (lq *Linked) Peek() any
  • func (lq *Linked) Pop() any
  • func (lq *Linked) ToList() []any
• type Node
• type Priority
  • func NewPriority() *Priority
  • func (pq *Priority) Add(elem any) error
  • func (pq *Priority) Empty() bool
  • func (pq *Priority) Find(fn IndexFunc) (any, int)
  • func (pq *Priority) Head() IPriority
  • func (pq *Priority) Len() int
  • func (pq *Priority) Less(i, j int) bool
  • func (pq *Priority) Peek() any
  • func (pq *Priority) Pop() any
  • func (pq *Priority) Push(x any)
  • func (pq *Priority) Remove(i int) any
  • func (pq *Priority) Swap(i, j int)
• type Queue
• type ResetFunc

Variables

var ErrIsFull = errors.New("is full")

var ErrIsReleased = errors.New("size is zero")

var PriorityType = reflect.TypeOf((*IPriority)(nil)).Elem()

Functions

func Run

func Run(c Call, lock sync.Locker, qu Queue)

Types

type Call

type Call struct {
	PopCount int
	Duration time.Duration
	Wait     func(dur time.Duration)
	Begin    func(count int) any
	Process  func(be any, data any)
}

type Capacity

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

Capacity 固定长度的队列

func NewCapacity

func NewCapacity(capacity int) *Capacity

func (*Capacity) Add

func (sq *Capacity) Add(elem any) error

func (*Capacity) Empty

func (sq *Capacity) Empty() bool

func (*Capacity) Find

func (sq *Capacity) Find(fn IndexFunc) (any, int)

Find return index -1 not found.

func (*Capacity) Get

func (sq *Capacity) Get(index int) any

Get index -1 refers to the last.

func (*Capacity) Len

func (sq *Capacity) Len() int

func (*Capacity) Less

func (sq *Capacity) Less(i, j int) bool

Less 权重越少，越在前面

func (*Capacity) Peek

func (sq *Capacity) Peek() any

func (*Capacity) Pop

func (sq *Capacity) Pop() any

func (*Capacity) Push

func (sq *Capacity) Push(elem any)

Push implements the heap.Interface.Push. Adds x as element Len().

func (*Capacity) Swap

func (sq *Capacity) Swap(i, j int)

Swap swaps the elements with indexes i and j.

func (*Capacity) ToList

func (sq *Capacity) ToList() []any

type Circular

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

Circular 环型队列

func NewCircular

func NewCircular(size int, resetFunc ResetFunc) *Circular

func (*Circular) Add

func (cr *Circular) Add(it any) error

func (*Circular) Empty

func (cr *Circular) Empty() bool

func (*Circular) Find

func (cr *Circular) Find(fn IndexFunc) (any, int)

Find return index -1 not found.

func (*Circular) Len

func (cr *Circular) Len() int

func (*Circular) Next

func (cr *Circular) Next(index int) (any, int)

func (*Circular) Peek

func (cr *Circular) Peek() any

func (*Circular) Pop

func (cr *Circular) Pop() any

func (*Circular) Reset

func (cr *Circular) Reset()

type IPriority

type IPriority interface {
	GValue() any
	PValue() int64 //优先级值，越小越前
}

func NewPriorityItem

func NewPriorityItem(elem any) IPriority

type IndexFunc

type IndexFunc func(v any, index int) bool

type Linked

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

Linked 链表式队列

func NewLinked

func NewLinked(capacity int) *Linked

func (*Linked) Add

func (lq *Linked) Add(val any) error

func (*Linked) AddTail

func (lq *Linked) AddTail(val any) error

func (*Linked) Cap

func (lq *Linked) Cap() int

func (*Linked) Empty

func (lq *Linked) Empty() bool

func (*Linked) Find

func (lq *Linked) Find(fn IndexFunc) (any, int)

Find return index -1 not found.

func (*Linked) Len

func (lq *Linked) Len() int

func (*Linked) Peek

func (lq *Linked) Peek() any

func (*Linked) Pop

func (lq *Linked) Pop() any

func (*Linked) ToList

func (lq *Linked) ToList() []any

type Node

type Node []IPriority

type Priority

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

Priority 优先级

func NewPriority

func NewPriority() *Priority

func (*Priority) Add

func (pq *Priority) Add(elem any) error

func (*Priority) Empty

func (pq *Priority) Empty() bool

func (*Priority) Find

func (pq *Priority) Find(fn IndexFunc) (any, int)

Find return index -1 not found.

func (*Priority) Head

func (pq *Priority) Head() IPriority

Head returns the first item of a Priority without removing it.

func (*Priority) Len

func (pq *Priority) Len() int

Len returns the Priority length.

func (*Priority) Less

func (pq *Priority) Less(i, j int) bool

Less 权重越少越大前面

func (*Priority) Peek

func (pq *Priority) Peek() any

func (*Priority) Pop

func (pq *Priority) Pop() any

Pop implements the heap.Interface.Pop. Removes and returns element Len() - 1.

func (*Priority) Push

func (pq *Priority) Push(x any)

Push implements the heap.Interface.Push. Adds x as element Len().

func (*Priority) Remove

func (pq *Priority) Remove(i int) any

Remove removes and returns the element at index i from the Priority.

func (*Priority) Swap

func (pq *Priority) Swap(i, j int)

Swap exchanges the indexes of the items.

type Queue

type Queue interface {
	Add(elem any) error
	Pop() any
	Peek() any
	Find(fn IndexFunc) (any, int)
	Empty() bool
	Len() int
}

type ResetFunc

type ResetFunc func()