Since you’re operating on these "stacks" as "dequeues", a `List` from Collections would probably perform better for large sizes. It’s implemented as a doubly-linked-list-with-a-head-node with most of the Array interface covered, including indexed `splice`. Although indexed splice performs poorly on a linked list for random-access, you’re always splicing from index 0 which will always be fast.