First, thank you ever so much for UnboundedFifoBuffer. We chagned 4 lines of code to move from using ArrayList as a FIFO to UnboundedFifoBuffer and realized a 600x improvement in the run-time of one of our test cases. That was so astounding that we didn't beleive the numbers at first, but after careful inspection turned out to be correct.
Thank you. Based on that huge win, we started to look at some of our other use of Java 1.4 collections, and I was hoping to find a replacement for a HashMap that preseved key insertion order and increaced performance -- for our application, we're treating the LinkedHashMap as read-only once we've populated it. So I took a crack at implementing a FastLinkedHashMap that minimally wraps FastHashMap and SequencedHashMap (to track the key insertion order). I'd like to offerr it as a contribution to commons collections (I have permission from my employer). It's not alot of code but I thought others might find it useful. Besides, sharing the code opens up the potential of having it improved beyond it's current state and I've enjoyed the privilege of minor contributions to other Jakarta projects and woudl like to continue to do so. The code is available here: http://www.bgw.org/projects/java/misc/FastLinkedHashMap.java Best Regards, Kyle R. Burton -- ------------------------------------------------------------------------------ Wisdom and Compassion are inseparable. -- Christmas Humphreys [EMAIL PROTECTED] http://www.voicenet.com/~mortis ------------------------------------------------------------------------------ -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
