Michael,
I got some time to test OrderedHashMap, and found it was maintaining
"reverse insertion order" or FILO. FIFO was *my* desired behaviour,
but FILO could be desirable in other situations. Perhaps this
condition would merit a different naming scheme than "Ordered" (Ordered
according to what?).
Getting it to FIFO involved this change:
private void insertEntry(Entry entry) {
entry.next = sentinel;
entry.prev = sentinel.prev;
sentinel.prev.next = entry;
sentinel.prev = entry;
}
I've attached a little tester class that proves that for large Maps,
OrderedHashMap is faster (at 1400 keys it is twice as fast). While it
doesn't provide proper support for the keySet, entrySet & values
methods, FIFOMap was faster for small Maps (tested on an order of 10:
140 keys vs 1400 keys). I doubt its worth the investigation to get
FIFOMap to support these methods properly, but I might do it anyway for
my own education.
Lance
__________________________________________________
Do You Yahoo!?
Find a job, post your resume.
http://careers.yahoo.com
InsertionTester.java
--
To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]>
For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
