A mutable data structure based on the following operations: push: adds to the top pop: takes from the top enqueue: adds to the bottom The other main feature is that you instantiate it with an Iterator of starting items, which it only traverses as necessary, buffering up to maxBufferSize elements at a time.
A mutable data structure based on the following operations: push: adds to the top pop: takes from the top enqueue: adds to the bottom The other main feature is that you instantiate it with an Iterator of starting items, which it only traverses as necessary, buffering up to maxBufferSize elements at a time. Note that items enqueued into the LazyStackQueue will only be popped off after the source iterator is empty. LazyStackQueue should be viewed as "consuming" the iterator---you should not use the iterator again after passing it into the constructor.
Utility classes, methods, and extension methods for spacro.