阅读背景:

Java - 非常大的队列(对于Heap而言太大)

来源:互联网 

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




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: