Hi list,
maybe a stupid question, or maybe I am missing something, but I cannot sort out
how to
do a reverse iteration over the values of a TreeBidiMap, and couldn't find much
about it
on the web.
I want to retrieve the 10 greatest values from a HashMap, and thought it best
to use a
and values.
So when the original map has (1, one), the inversed map has (one, 1).
I'm getting the reversed map because I want to order on values. But I also want
the
greatest value first, in stead of last.
Rinke
rinke hoekstra wrote:
Hi list,
maybe a stupid question, or maybe I am missing
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
