Well, I think your problem is this: the TreeSet sorts items *as they are inserted*. Your "get" operation changes the key *after* the items are inserted, but does nothing to force the Set to re-sort. You need to remove the item from the set and reinsert it in order to change the sort order.

Another possibility: use a plain Set to store your items, but when you need to find the LFU, make a TreeSet from the Set contents. Of course, at that point, you might as well just scan the whole set looking for the LFU element, because that's O(n) and building the TreeSet is O(n log(n)), so slower.

=S



---
You are currently subscribed to jdjlist as: [EMAIL PROTECTED]
To unsubscribe send a blank email to [EMAIL PROTECTED]
http://www.sys-con.com/fusetalk
To unsubscribe from all mailing lists, click:
http://sys-con.com/[EMAIL PROTECTED]

Reply via email to