CLRS study. Codes are written with golang.

When storing a value in a Go interface allocates memory on the heap.

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

Go GC visualizer TUI for gctrace, runtime/metrics, STW pauses, heap live/goal, and pacer signals.

A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.

golang实现常用集合

Generic data structures and utility types in Go

Find functions that return a reference and cause allocations.

Implementations of data structures and algorithms in GoLang

Generic double-ended heap (min-max heap) for Go — O(1) min and max, O(log n) push/pop

Package heap implements a generic heap data structure.

offheap - allocate system memory off heap in Go

Algorithms and data structures for Go applications

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

go timer

algorithms, data structures and solved questions with golang (under development)

Algorithms, data-structures, patterns and various techniques written in golang.

Data-Structure implementation in Go