Showing 7 of 7 projects
A comprehensive data structures and algorithms library for Go, inspired by C++ STL with goroutine-safe implementations.
A fast ring-buffer deque (double-ended queue) implementation in Go with O(1) operations and optimized memory performance.
A header-only C library providing generic, type-safe data structures using macros for easy integration and modularity.
A highly optimized double-ended queue for Go, significantly faster than container/list for adding/removing elements at both ends.
A tiny, fast, tree-shakeable queue and deque implementation for JavaScript.
A generic double-ended heap (min-max heap) for Go providing O(1) access to both minimum and maximum elements.
Two Elixir deque implementations: a two-list Deque and a mutable DoublyLinkedList using gen_server.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.