stack

package

v0.0.4 Latest Latest Go to latest Published: Sep 10, 2023 License: MIT Imports: 3 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

This section is empty.

This section is empty.

func New[Value any](opts ...options.Option[core.Options]) core.Stack[Value]

New creates a new lock-free stack.

func NewQueueAdapter[T any](capacity int) core.Queue[T]

type LLStack[Value any] struct {
	// contains filtered or unexported fields
}

LLStack is a lock-free stack implemented with linked list, based on atomic compare-and-swap operations.

func (s *LLStack[Value]) Empty() bool

Len returns the number of items in the stack.

func (s *LLStack[Value]) Full() bool

Len returns the number of items in the stack.

func (s *LLStack[Value]) Pop() (Value, bool)

Pop removes the next value from the stack.

func (s *LLStack[Value]) Push(value Value) bool

Push adds a new value to the stack. It keeps retrying in case of conflict with concurrent Pop()/Push() operations.

func (s *LLStack[Value]) Range(iterator func(val Value) bool)

Range iterates over the stack, accepts a custom iterator that returns true to stop.

func (s *LLStack[Value]) Size() int

Size returns the number of items in the stack.

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

func (q *QueueAdapter[T]) Dequeue() (T, bool)

func (q *QueueAdapter[T]) Empty() bool

func (q *QueueAdapter[T]) Enqueue(v T) bool

func (q *QueueAdapter[T]) Full() bool

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