A new Queue data structure that inherits the positive properties of array-based Queues
while removing their main drawback: a fixed size.
The Queue is backed by arrays of Objects with exponentially growing sizes, of which all are in use,
but only the first one (with initialCapacity) is allocated up-front.
A detailed description is given in Paper.
Performance figures are in the Paper as well.
Get acquainted with the new Queue here
- Currently (2024) this code is in its early stage and only for academic interest, not for production use.
- Do not send me Pull Requests – the code is small so I want to maintain it single-handedly.
- Reviews, tests and comments are welcome.
MIT License
