Documentation
¶
There is no documentation for this package.
Directories
¶
| Path | Synopsis |
|---|---|
|
Package multiset provides a generic sorted multiset backed by a treap (randomized binary search tree), giving O(log n) expected time for all structural operations — equivalent to C++'s std::multiset.
|
Package multiset provides a generic sorted multiset backed by a treap (randomized binary search tree), giving O(log n) expected time for all structural operations — equivalent to C++'s std::multiset. |
|
Package priorityqueue provides a generic priority queue backed by a binary heap.
|
Package priorityqueue provides a generic priority queue backed by a binary heap. |
|
Package queue provides a generic FIFO queue backed by a ring buffer (circular buffer), giving amortized O(1) Enqueue and O(1) Dequeue.
|
Package queue provides a generic FIFO queue backed by a ring buffer (circular buffer), giving amortized O(1) Enqueue and O(1) Dequeue. |
|
Package stack provides a generic LIFO stack backed by a slice.
|
Package stack provides a generic LIFO stack backed by a slice. |
Click to show internal directories.
Click to hide internal directories.