Showing 3 of 3 projects
A fast ring-buffer deque (double-ended queue) implementation in Go with O(1) operations and optimized memory performance.
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.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.