Generic PriorityQueues, Queues, Stacks, and Deque data structures for Go
-
Updated
May 27, 2023 - Go
Generic PriorityQueues, Queues, Stacks, and Deque data structures for Go
Go datastructures.
⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way.
Ratus is a RESTful asynchronous task queue server. It translated concepts of distributed task queues into a set of resources that conform to REST principles and provides a consistent HTTP API for various backends.
lunar.dev: Ground Control for 3rd Party APIs
A lightweight job scheduler based on priority queue with timeout, retry, replica, context cancellation and easy semantics for job chaining. Build for golang web apps.
GPQ is a high performance embeddable double priority queue with complex priority ordering guarantees
A priority queue for timed events, written in go.
Doubly ended heap
Fast generic Heap data structure in Golang
Priority queue (heap) based cache with 'priority' evict policy
A generic keyed priority queue implementation for Golang.
A priority queue that shuffles elements with the same priority. Written in Go and inspired by https://github.com/mafintosh/shuffled-priority-queue.
Typesafe Go Data Structure with generics, rich interfaces, functional transformation, and more...
Basic Implementation of Data-structures in Go
Priority Queue implementation on Go. FIFO, Concurrency safe.
Unbuffered Generic Concurrent Priority Queue in GoLang.
Go implementation of the van Emde Boas tree data structure: Priority queue for positive whole numbers in O(log log u) time.
A Priority and Delay queue by Golang
Add a description, image, and links to the priority-queue topic page so that developers can more easily learn about it.
To associate your repository with the priority-queue topic, visit your repo's landing page and select "manage topics."