Next: binary heaps, Previous: queues, Up: Top [Index]
The library (vicare containers deques) implements deques
(pronounced “decks”) holding arbitrary Scheme objects and designed for
efficient insertion and removal at both ends.
| • deques objects: | Deque objects. | |
| • deques inspection: | Inspecting deque objects. | |
| • deques access: | Deque accessors and mutators. | |
| • deques folding: | Folding over deques. | |
| • deques mapping: | Mapping over deques. | |
| • deques searching: | Searching in deques. | |
| • deques filtering: | Filtering in deques. | |
| • deques conversion: | Converting deques to other objects. | |
| • deques iteration thunks: | Deque iteration thunks. | |
| • deques misc: | Miscellaneous operations on deques. |