Lists, stacks, queues and dynamic arrays

Sequential containers and their amortized costs: linked lists (singly, doubly, sentinel), stacks with multipop, queues, deques, dynamic tables, binary counters, LRU caches, and generic list operations (ordered insertion, splitting, chunking, inclusive prefixes) that support them.

• Binary counter
• Double-ended queue
• Doubly linked list
• Dynamic table
• Join list (catenable heap)
• Least-recently-used cache
• List operations
• Singly linked list
• Stack with multipop
• Two-list queue

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.