Package deque provides a fast ring-buffer deque (double-ended queue) implementation.

Package lane provides queue, priority queue, stack and deque data structures implementations.

Package deque implements a very fast and efficient general purpose queue/stack/deque data structure that is specifically optimized to perform when used by Microservices and serverless services running in production environments.

Package deque implements a highly optimized double-ended queue, which is much efficient compared with list.List when adding or removing elements from the beginning or the end.

Package deque implements an efficient double-ended queue data structure called Deque.

Lane package provides queue, priority queue, stack and deque data structures implementations.

The deque package implements an efficient double-ended queue data structure called Deque.

Package deque implements a double ended queue supporting arbitrary types (even a mixture).

Package queue implements a double-ended queue (aka "deque") data structure on top of a slice.

Package queue implements a double-ended queue (aka "deque") data structure on top of a slice.

linked-list deque

Package deque provides a double ended queue modeled after Python's collections.deque Example: import ( "fmt" "github.com/tebeka/deque" ) func Example() { // Create a new deque and put some numbers in it.

Package deque provides a type-safe, slice-backed, double-ended queue.

Lane package provides queue, priority queue, stack and deque data structures implementations.

Package deque provides a fast ring-buffer deque (double-ended queue) implementation.

Package deque implements a double ended queue supporting arbitrary types (even a mixture).

Lane package provides queue, priority queue, stack and deque data structures implementations.

Package deque contains a double-ended queue.

Package deque provides a flexible implementation of the deque ADT.

Package deque provides a fast ring-buffer deque (double-ended queue) implementation.

Package deque provides a fast ring-buffer deque (double-ended queue) implementation.

Package deque implements a generic deque using a doubly-linked-list as the underlying data structure.

Package deque implements deque data structure for fast append and pop at both ends of the queue.

Package deque represents deque abstract data structure and basic operations on it.