From: Kevin C. <Kev...@or...> - 2003-05-21 14:22:14
|
Hiya Alex. > I had several implementations with different approaches such as > writting from scratch, based on SequencedHashMap and some others. I > tried to not duplicate the data internally and achieve decent > performance > on iterations and operations like add, contains. > I don't remember the numbers but we agreed with Dain to postpone it as > there were no many complaints and you can use Collection and DISTINCT > for a workaround. I have written one from scratch that uses an internal double linked list with a HashMap. The key of the HashMap is the object and the value is the linked list entry. The iterator just walks down the linked list whilst the add and contains uses the HashMap to find the entry. I've still to write a performance test before submitting it, just to make sure there are no nasty surprises :-) > But, indeed, there is a bug report on it assigned to me. Do you have the bug number? Can I upload the source against it for you to check? > I would look at your variant with interest. Wish you a good luck ;) Thanks, Kev Kevin Conner This is a personal e-mail. Any views or opinions presented are solely those of the author and do not necessarily represent those of Orchard Information Systems Ltd. |