Worrying about small effects like iterating over keys or entries should be made moot by just switching to a dedicated primitive based hash table. Trove has a nice implementation, but I believe the license would prevent it's use. Colt has another, not quite as nice implementation that is fast and I think it comes under a BSD license. It is also very easy to hack a special purpose structure into place.
On Fri, Aug 8, 2008 at 8:49 AM, Sean Owen <[EMAIL PROTECTED]> wrote: > ... > This is sort unrelated, but on this subject, looking through the code > I think there are some opportunities to cut down on runtime, > boxing/unboxing (i.e. object allocation), and memory usage. >
