Mailing-List: contact commons-user-help@jakarta.apache.org; run by ezmlm
Precedence: bulk
Reply-To: "Jakarta Commons Users List" <commons-user@jakarta.apache.org>
Received-SPF: pass (hermes.apache.org: local policy)
From: "rinke hoekstra" <rinkeh@home.nl>
To: commons-user@jakarta.apache.org
Date: Wed, 30 Mar 2005 11:42:29 +0200
MIME-Version: 1.0
Subject: [commons-collections]: how to do reverse iteration in TreeBidiMap
Message-ID: <424A90A5.1407.CDDC03@localhost>
Priority: normal
Content-type: text/plain; charset=US-ASCII
Content-transfer-encoding: 7BIT
Content-description: Mail message body

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 
TreeBidiMap for it.

I have this:

TreeBidiMap bidiMap = new TreeBidiMap(myHashMap);
OrderedBidiMap invMap = bidiMap.inverseOrderedBidiMap(); //creates inversed map
OrderedMapIterator oit = invMap.orderedMapIterator();
while (oit.hasPrevious()) {
      Float value = (Float)oit.previous();
      .....
}


The iterator however seems to be initialized at the first element, so hasPrevious() is 
usually false, and the loop isn't run. 

How to initialize the iterator at the last element, so you can start iterating using 
hasPrevious()? 

thanks, 
Rinke

---------------------------------------------------------------------
To unsubscribe, e-mail: commons-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: commons-user-help@jakarta.apache.org