I am working on an algorithm that uses a very large queue. For all but toy problems, it's too big to fit in the heap. As a queue, that's fine: performance depends only on the first N entries (dequeuing) and the last N entries (enqueueing), so it would be fine to keep all the middle on disk. Are there libraries or middleware that can do this? If not, how can I implement it?I am working on an algorithm that uses a very l