Re: Equivalent of LinkedHashMap meetingEntries in commons primitives

2013-02-25 Thread Benedikt Ritter
@berenberg.de > > www.berenberg.de > > > > Sitz: Hamburg - Amtsgericht Hamburg HRA 42659 > > -Ursprüngliche Nachricht- > Von: Osman Khalid [mailto:osmankhalid2...@gmail.com] > Gesendet: Sonntag, 24. Februar 2013 06:23 > An: Commons Users List > Betreff

AW: Equivalent of LinkedHashMap meetingEntries in commons primitives

2013-02-25 Thread Klein, Raimund
ndet: Sonntag, 24. Februar 2013 06:23 An: Commons Users List Betreff: Re: Equivalent of LinkedHashMap meetingEntries in commons primitives Thanks Daniel You are right. Trove has some functionality, but again I am stuck. As I want the order of insertion be preserved, but Trove's TDoubleDoubleHas

Re: Equivalent of LinkedHashMap meetingEntries in commons primitives

2013-02-23 Thread Osman Khalid
Thanks Daniel You are right. Trove has some functionality, but again I am stuck. As I want the order of insertion be preserved, but Trove's TDoubleDoubleHashMap does not preserve order of insertion. (I just want a pair of double, double be stored, and later i need to retrieve double[] from values

Re: Equivalent of LinkedHashMap meetingEntries in commons primitives

2013-02-23 Thread Daniel Pitts
First off, floating points make terrible keys. Do you really need them as keys, or are you really using this as pair ? I think Trove is the library you might want, not apache commons. Sent from my iPad On Feb 23, 2013, at 4:57 PM, Osman Khalid wrote: > Hi. > > I am using a data structure us