A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.

Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.

A Raku implementation of double ended priority queue

A C++ implementation of a Circular Double-ended Vector data-structure.

An unstable double-ended selection sort algorithm.