queue

package
v0.2.0 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Oct 30, 2024 License: MIT Imports: 4 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Deque

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

Deque is a highly optimized double-ended queue.

func NewDeque

func NewDeque[T any](opts ...Option) *Deque[T]

NewDeque creates a new Deque instance.

func (*Deque[T]) Back

func (dq *Deque[T]) Back() (_ T, ok bool)

Back returns the last value of dq if any. The return value ok indicates whether it succeeded.

func (*Deque[T]) Clear

func (dq *Deque[T]) Clear()

Clear removes all the values from dq.

func (*Deque[T]) Dequeue

func (dq *Deque[T]) Dequeue() T

Dequeue is an alias of PopFront.

func (*Deque[T]) DequeueMany

func (dq *Deque[T]) DequeueMany(max int) []T

DequeueMany removes a number of values from the front of dq and returns the removed values or nil if dq is empty.

If max <= 0, DequeueMany removes and returns all the values in dq.

func (*Deque[T]) DequeueManyWithBuffer

func (dq *Deque[T]) DequeueManyWithBuffer(max int, buf []T) []T

DequeueManyWithBuffer is similar to DequeueMany except that it uses buf to store the removed values as long as it has enough space.

func (*Deque[T]) Dump

func (dq *Deque[T]) Dump() []T

Dump returns all the values in dq.

func (*Deque[T]) Enqueue

func (dq *Deque[T]) Enqueue(v T)

Enqueue is an alias of PushBack.

func (*Deque[T]) Front

func (dq *Deque[T]) Front() (_ T, ok bool)

Front returns the first value of dq if any. The return value ok indicates whether it succeeded.

func (*Deque[T]) Insert

func (dq *Deque[T]) Insert(idx int, v T)

Insert inserts a new value v before the value at idx.

Insert may cause the split of a chunk inside dq. Because the size of a chunk is fixed, the amount of time taken by Insert has a reasonable limit.

func (*Deque[T]) IsEmpty

func (dq *Deque[T]) IsEmpty() bool

IsEmpty returns whether dq is empty.

func (*Deque[T]) Len

func (dq *Deque[T]) Len() int

Len returns the number of values in dq.

func (*Deque[T]) Peek

func (dq *Deque[T]) Peek(idx int) T

Peek returns the value at idx. It panics if idx is out of range.

func (*Deque[T]) PopBack

func (dq *Deque[T]) PopBack() T

PopBack removes a value from the back of dq and returns the removed value. It panics if dq is empty.

func (*Deque[T]) PopFront

func (dq *Deque[T]) PopFront() T

PopFront removes a value from the front of dq and returns the removed value. It panics if dq is empty.

func (*Deque[T]) PushBack

func (dq *Deque[T]) PushBack(v T)

PushBack adds a new value at the back of dq.

func (*Deque[T]) PushFront

func (dq *Deque[T]) PushFront(v T)

PushFront adds a new value at the front of dq.

func (*Deque[T]) Range

func (dq *Deque[T]) Range(f func(i int, v T) bool)

Range iterates all the values in dq. Do NOT add values to dq or remove values from dq during Range.

func (*Deque[T]) Remove

func (dq *Deque[T]) Remove(idx int)

Remove removes the value at idx. It panics if idx is out of range.

func (*Deque[T]) Replace

func (dq *Deque[T]) Replace(idx int, v T)

Replace replaces the value at idx with v. It panics if idx is out of range.

func (*Deque[T]) Swap

func (dq *Deque[T]) Swap(idx1, idx2 int)

Swap exchanges the two values at idx1 and idx2. It panics if idx1 or idx2 is out of range.

func (*Deque[T]) TryDequeue

func (dq *Deque[T]) TryDequeue() (_ T, ok bool)

TryDequeue is an alias of TryPopFront.

func (*Deque[T]) TryPopBack

func (dq *Deque[T]) TryPopBack() (_ T, ok bool)

TryPopBack tries to remove a value from the back of dq and returns the removed value if any. The return value ok indicates whether it succeeded.

func (*Deque[T]) TryPopFront

func (dq *Deque[T]) TryPopFront() (_ T, ok bool)

TryPopFront tries to remove a value from the front of dq and returns the removed value if any. The return value ok indicates whether it succeeded.

type Option

type Option func(*optionHolder)

Option represents the option of Deque.

func WithChunkSize

func WithChunkSize(n int) Option

WithChunkSize sets the chunk size of a Deque.

type Queue

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

Queue 相当于容量可无限制的channel 设置无限buffer的channel(max<=0) Enqueue 接口会阻塞直到可以元素放入队列中,阻塞的情况只在队列满的时候才会出现 Dequeue 接口会阻塞直到队列中有元素返回,阻塞的情况只在队列空的时候才会出现

func NewQueue

func NewQueue[T any]() *Queue[T]

func NewQueueWithSize

func NewQueueWithSize[T any](max int, inChanSize int) *Queue[T]

NewQueueWithSize max代表队列元素个数上限,若小于等于0,则队列无元素上限 内部会启动一个goroutine用于channel同步,可用Destroy()方法销毁。 注意调用Destroy()后就不可执行入队出队操作,否则会一直阻塞下去。

func (*Queue[T]) Clear

func (q *Queue[T]) Clear()

func (*Queue[T]) Dequeue

func (q *Queue[T]) Dequeue() T

func (*Queue[T]) DequeueC

func (q *Queue[T]) DequeueC() <-chan T

func (*Queue[T]) Destroy

func (q *Queue[T]) Destroy()

func (*Queue[T]) Enqueue

func (q *Queue[T]) Enqueue(v T)

func (*Queue[T]) EnqueueC

func (q *Queue[T]) EnqueueC() chan<- T

func (*Queue[T]) MaxSize

func (q *Queue[T]) MaxSize() int

func (*Queue[T]) Size

func (q *Queue[T]) Size() int

func (*Queue[T]) TuneSize

func (q *Queue[T]) TuneSize(max int)

Jump to

Keyboard shortcuts

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