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]
