CLRS study. Codes are written with golang.
-
Updated
Mar 17, 2021 - Go
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
A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.
golang实现常用集合
Find functions that return a reference and cause allocations.
Generic data structures and utility types 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
Priority queue (heap) based cache with 'priority' evict policy
Basic data structures and operations written in Go, such as trie, bloom filter union&find etc.
algorithms, data structures and solved questions with golang (under development)
Data-Structure implementation in Go
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."