Yes, I thought of that sollution....
It seems a good sollution. But still I am very curious to know how one would
use
hasPrevious()....
I think I will just stop bothering about it and use your sollution.
Rinke
> How about something like this?
>
> TreeBidiMap bidiMap = new TreeBidiMap(myHashMap);
> Collection values = bidiMap.values()
> values.sort()
> values.reverse()
> for(Iterator i=values.iterator(); i.hasNext();) {
> Float value = (Float)i.next()
> }
>
> I wouldn't worry about looping using hasPrevious(), I'd just reverse the
> collection so that it is in descending order.
>
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: [EMAIL PROTECTED]
> For additional commands, e-mail: [EMAIL PROTECTED]
>
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
