Almost. I did not benchmark it but tend to believe this http://docs.oracle.com/javase/6/docs/api/java/util/LinkedHashMap.html :
"iteration over the collection-views of a LinkedHashMap requires time proportional to the /size/ of the map, regardless of its capacity. Iteration over a HashMap is likely to be more expensive, requiring time proportional to its /capacity/. " André On 02/13/2013 06:58 PM, knort wrote:
If the order is not important, using a HashMap offers the same "fast" iteration on the fields but without having an extra LinkedList. -- View this message in context: http://lucene.472066.n3.nabble.com/Why-SolrInputDocument-use-a-LinkedHashMap-tp4040195p4040260.html Sent from the Solr - User mailing list archive at Nabble.com. -- André Bois-Crettez Search technology, Kelkoo http://www.kelkoo.com/
Kelkoo SAS Société par Actions Simplifiée Au capital de € 4.168.964,30 Siège social : 8, rue du Sentier 75002 Paris 425 093 069 RCS Paris Ce message et les pièces jointes sont confidentiels et établis à l'attention exclusive de leurs destinataires. Si vous n'êtes pas le destinataire de ce message, merci de le détruire et d'en avertir l'expéditeur.
