How to sort a map with values

The ordering on a hashmap is defined by the hashing funtion. If you
just mean you want the pairs sorted by the second element, try

treasureMap.toSeq.sortBy(_._2)

On 4 January 2012 16:01, yannick wrote:
> import scala.collection.mutable.HashMap
> val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
> 0.5, "m4" -> 0.3)
>
> What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
> 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>
> Anybody knows how to do this?
> Thanks!
>

...sortBy(- _._2) if you want highest values first.
  --Rex

On Wed, Jan 4, 2012 at 11:14 AM, Alec Zorab <aleczorab@googlemail.com> wrote:

The ordering on a hashmap is defined by the hashing funtion. If you
just mean you want the pairs sorted by the second element, try

 treasureMap.toSeq.sortBy(_._2)

On 4 January 2012 16:01, yannick <yannick.crystal@gmail.com> wrote:
> import scala.collection.mutable.HashMap
> val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
> 0.5, "m4" -> 0.3)
>
> What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
> 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>
> Anybody knows how to do this?
> Thanks!
>

new LinkedHashMap ++ oldMap.toSeq.sortBy(...)

or use a treemap

Am 04.01.2012 17:01, schrieb yannick:
> import scala.collection.mutable.HashMap
> val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
> 0.5, "m4" -> 0.3)
>
> What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
> 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>
> Anybody knows how to do this?
> Thanks!
>
>

On Wed, Jan 4, 2012 at 14:01, yannick wrote:
> import scala.collection.mutable.HashMap
> val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
> 0.5, "m4" -> 0.3)
>
> What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
> 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>
> Anybody knows how to do this?

Use a SortedMap instead.

TreeMap is the only subclass of the SortedMap trait, so they're the same thing :)


On 4 January 2012 17:35, Daniel Sobral <dcsobral@gmail.com> wrote:

On Wed, Jan 4, 2012 at 14:01, yannick <yannick.crystal@gmail.com> wrote:
> import scala.collection.mutable.HashMap
> val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
> 0.5, "m4" -> 0.3)
>
> What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
> 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>
> Anybody knows how to do this?

Use a SortedMap instead.


--
Daniel C. Sobral

I travel to the future all the time.

--
Kevin Wright
mail: kevin.wright@scalatechnology.com
gtalk / msn : kev.lee.wright@gmail.com quora: http://www.quora.com/Kevin-Wrightgoogle+: http://gplus.to/thecoda
kev.lee.wright@gmail.com twitter: @thecoda
vibe / skype: kev.lee.wrightsteam: kev_lee_wright
"My point today is that, if we wish to count lines of code, we should not regard them as "lines produced" but as "lines spent": the current conventional wisdom is so foolish as to book that count on the wrong side of the ledger" ~ Dijkstra

On Wed, Jan 4, 2012 at 11:35 AM, Daniel Sobral <dcsobral@gmail.com> wrote:

On Wed, Jan 4, 2012 at 14:01, yannick <yannick.crystal@gmail.com> wrote:
> import scala.collection.mutable.HashMap
> val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
> 0.5, "m4" -> 0.3)
>
> What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
> 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>
> Anybody knows how to do this?

Use a SortedMap instead.

He wants to sort the values, not the keys 

--
Daniel C. Sobral

I travel to the future all the time.

On Wed, Jan 4, 2012 at 15:47, Kevin Wright wrote:
> TreeMap is the only subclass of the SortedMap trait, so they're the same
> thing :)

I saw no TreeMap being used, and I still don't see it.

>
>
>
> On 4 January 2012 17:35, Daniel Sobral wrote:
>>
>> On Wed, Jan 4, 2012 at 14:01, yannick wrote:
>> > import scala.collection.mutable.HashMap
>> > val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
>> > 0.5, "m4" -> 0.3)
>> >
>> > What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
>> > 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>> >
>> > Anybody knows how to do this?
>>
>> Use a SortedMap instead.
>>
>>
>> --
>> Daniel C. Sobral
>>
>> I travel to the future all the time.
>
>
>
>
> --
> Kevin Wright
> mail: kevin.wright@scalatechnology.com
> gtalk / msn : kev.lee.wright@gmail.com
> quora: http://www.quora.com/Kevin-Wright
> google+: http://gplus.to/thecoda
> twitter: @thecoda
> vibe / skype: kev.lee.wright
> steam: kev_lee_wright
>
> "My point today is that, if we wish to count lines of code, we should not
> regard them as "lines produced" but as "lines spent": the current
> conventional wisdom is so foolish as to book that count on the wrong side of
> the ledger" ~ Dijkstra
>

On Wed, Jan 4, 2012 at 16:29, Nils Kilden-Pedersen wrote:
> On Wed, Jan 4, 2012 at 11:35 AM, Daniel Sobral wrote:
>>
>> On Wed, Jan 4, 2012 at 14:01, yannick wrote:
>> > import scala.collection.mutable.HashMap
>> > val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
>> > 0.5, "m4" -> 0.3)
>> >
>> > What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
>> > 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>> >
>> > Anybody knows how to do this?
>>
>> Use a SortedMap instead.
>
>
> He wants to sort the values, not the keys

Oops... yes, there's that.

you can use a comparator that takes the value to both keys and compares them

Am 04.01.2012 19:29, schrieb Nils Kilden-Pedersen:

CABDULvUShcZW-DwRi9qqyC833F6_-W9EZnpK2zR0uoMZ4ULdRg [at] mail [dot] gmail [dot] com" type="cite"> On Wed, Jan 4, 2012 at 11:35 AM, Daniel Sobral <dcsobral [at] gmail [dot] com" rel="nofollow">dcsobral@gmail.com> wrote:

On Wed, Jan 4, 2012 at 14:01, yannick <yannick [dot] crystal [at] gmail [dot] com" rel="nofollow">yannick.crystal@gmail.com> wrote:
> import scala.collection.mutable.HashMap
> val treasureMap =HashMap("m5" -> 0.5, "m2" -> 0.3,"m1" -> 0.2, "m3" ->
> 0.5, "m4" -> 0.3)
>
> What I want to get is another HashMap as ("m3" -> 0.5, "m5" ->
> 0.5,"m2" -> 0.3, "m4" -> 0.3, "m1" -> 0.2)
>
> Anybody knows how to do this?

Use a SortedMap instead.

He wants to sort the values, not the keys  

--
Daniel C. Sobral

I travel to the future all the time.