deheap

MITGov1.1.2

A generic double-ended heap (min-max heap) for Go providing O(1) access to both minimum and maximum elements.

17 stars2 forks0 contributors

Overview

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

Community-curated · Updated weekly · 100% open source

Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.

3 months ago

CreatedSince 2019

Auto-fetched 8 days ago

🪓 An orchestration engine for background tasks, AI agents, and durable workflows

Fast ring-buffer deque (double-ended queue)

Go concurrent-safe, goroutine-safe, thread-safe queue

⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way.