No packages match
rstackdeque - Persistent Fast Amortized Stack and Queue Data Structures
Provides fast, persistent (side-effect-free) stack, queue and deque (double-ended-queue) data structures. While deques include a superset of functionality provided by queues, in these implementations queues are more efficient in some specialized situations. See the documentation for rstack, rdeque, and rpqueue for details.
Last updated
6.96 score 33 stars 26 dependents 71 scripts 978 downloads
Immutables - Fast and Functional Data Structures
Provides fast, side-effect free data structures, including catenable named lists, priority queues, double-ended queues, ordered sequences, and interval indices. Implementation is based on the finger-tree data structure of Hinze and Paterson (2006) <doi:10.1017/S0956796805005769>.
Last updated
functional-programmingpriority-queuesequencecpp
4.92 score 7 stars 16 scripts 294 downloads