deque

package

v0.2.0 Latest Latest Go to latest Published: Apr 17, 2023 License: BSD-3-Clause Imports: 0 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

Package deque implements a deque using a circular array.

This section is empty.

This section is empty.

This section is empty.

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

T is the type of queues.

func (q *T) Back() interface{}

Back returns the last element of the deque, or nil if there is none.

func (q *T) Clear()

Clear removes all the elements of the queue.

func (q *T) Front() interface{}

Front returns the first element of the deque, or nil if there is none.

func (q *T) Iter(f func(item interface{}) bool)

Iter iterates over the elements of the deque. f should return false to terminate the iteration early.

func (q *T) PopBack() interface{}

PopBack removes an element from the front of the queue and returns it.

func (q *T) PopFront() interface{}

PopFront removes an element from the front of the queue and returns it.

func (q *T) PushBack(item interface{})

PushBack adds an element to the back of the queue.

func (q *T) PushFront(item interface{})

PushFront adds an element to the front of the deque.

func (q *T) Size() int

Size returns the number of items in the queue.