CLRS study. Codes are written with golang.
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.
Simple and high-performance data structures and algorithms library
golang实现常用集合
A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.
Find functions that return a reference and cause allocations.
Generic data structures in Go.
Implementations of data structures and algorithms in GoLang
Doubly ended heap
Algorithms and Data Structure For Go Applications
offheap - allocate system memory off heap in Go
Fast generic Heap data structure in Golang
Basic data structures and operations written in Go, such as trie, bloom filter union&find etc.
Priority queue (heap) based cache with 'priority' evict policy
Data-Structure implementation in Go
Algorithms, data-structures, patterns and various techniques written in golang.
Add a description, image, and links to the heap topic page so that developers can more easily learn about it.
To associate your repository with the heap topic, visit your repo's landing page and select "manage topics."