[concurrency-interest] RE: Concurrency-interest Digest, Vol 9, Issue 14

Doug Lea dl at cs.oswego.edu
Sun Oct 23 15:29:40 EDT 2005


Hu, Jinsong wrote:
>  the first time the
> DataBlock is loaded from disk, I will build up hash index for them,
> if a request for range query coming in, I first use hashing to find
> the correct element, then calling geNext() one by one to get the
> range result. I think a navigable LinkedHashMap is the answer.
> 

See rfe 6266354 http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=6266354
which is probably also what you want.

This won't be in Mustang, but you can vote for it for Dolphin :-)

-Doug




More information about the Concurrency-interest mailing list