Data structure and algorithm library for go, designed to provide functions similar to C++ STL
Repository Index
47,133 repositories indexed
1–5 of 5 · Most stars
Fast ring-buffer deque (double-ended queue)
A highly optimized double-ended queue
🎀 Just the cutest and tiniest queue/deque implementation!
Generic double-ended heap (min-max heap) for Go — O(1) min and max, O(log n) push/pop