queue

package

v0.0.0-...-b51443a Latest Latest Go to latest Published: Nov 24, 2022 License: BSD-2-Clause 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

Repository

github.com/hauson/lib

Links

Open Source Insights

Documentation ¶

Index ¶

type CircularQueue
- func NewCircularQueue(n int) *CircularQueue
type Queue
- func NewQueue() *Queue

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type CircularQueue ¶

type CircularQueue struct {
	*ring.Ring
	// contains filtered or unexported fields
}

CircularQueue circular queue

func NewCircularQueue ¶

func NewCircularQueue(n int) *CircularQueue

NewCircularQueue make a c

func (*CircularQueue) All ¶

func (q *CircularQueue) All() []interface{}

All get all elements order from first to last, but not delete

func (*CircularQueue) AllInReverse ¶

func (q *CircularQueue) AllInReverse() []interface{}

AllInReverse get all elements order from last to first, but not delete

func (*CircularQueue) Cap ¶

func (q *CircularQueue) Cap() int

func (*CircularQueue) EnQueue ¶

func (q *CircularQueue) EnQueue(data interface{})

EnQueue add a data to tail

func (*CircularQueue) IsEmpty ¶

func (q *CircularQueue) IsEmpty() bool

IsEmpty judge a queue is empty

func (*CircularQueue) Len ¶

func (q *CircularQueue) Len() int

type Queue ¶

type Queue struct {
	*list.List
}

Queue keep to FIFO

func NewQueue ¶

func NewQueue() *Queue

NewQueue new queue

func (*Queue) All ¶

func (q *Queue) All() []interface{}

All get all elements order from first to last, but not delete

func (*Queue) AllInReverse ¶

func (q *Queue) AllInReverse() []interface{}

AllInReverse get all elements order from last to first, but not delete

func (*Queue) DeQueue ¶

func (q *Queue) DeQueue() interface{}

DeQueue pop a data from head

func (*Queue) EnQueue ¶

func (q *Queue) EnQueue(data interface{})

EnQueue add a data to tail

func (*Queue) IsEmpty ¶

func (q *Queue) IsEmpty() bool

IsEmpty judge a queue is empty

Source Files ¶

View all Source files

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