«

hi,

is there anywhere a class that does soemthing
akin to java.util.SortedMap? that is sorting
and iterating over the hash in the order of its
keys.

i had a look into facets dictionary but that does
only preserve the ordering of insertion which
is not what i want.

any other suggestions?

ciao robertj

Hi Robert,

> i had a look into facets dictionary but that does
> only preserve the ordering of insertion which
> is not what i want.

The dictionary class in Facets/Calibre is basically the ordered hash
written by jan molic. I've been wanting to improve on it. This looks
like the oppornunity. What is it that you need? I'd be happy to work in
your critera.

Thanks,
T.

On Thursday 08 December 2005 12:37 pm, robertj wrote:
> hi,
>
> is there anywhere a class that does soemthing
> akin to java.util.SortedMap? that is sorting
> and iterating over the hash in the order of its
> keys.

When I tried it, it seemed that Ruby automatically sorted the keys. I'm not
sure if this is what you want, but see this:

http://www.troubleshooters.com/codec...al.htm#_Hashes

HTH

SteveT

Steve Litt
http://www.troubleshooters.com

From: "robertj" <>
>
> is there anywhere a class that does soemthing
> akin to java.util.SortedMap? that is sorting
> and iterating over the hash in the order of its
> keys.

Perhaps rbtree?
http://raa.ruby-lang.org/project/ruby-rbtree/


Regards,

Bill

Steve Litt wrote:
> On Thursday 08 December 2005 12:37 pm, robertj wrote:
> > hi,
> >
> > is there anywhere a class that does soemthing
> > akin to java.util.SortedMap? that is sorting
> > and iterating over the hash in the order of its
> > keys.
>
> When I tried it, it seemed that Ruby automatically sorted the keys. I'm not
> sure if this is what you want, but see this:
>
> http://www.troubleshooters.com/codec...al.htm#_Hashes
>

Not sure what "it" is, but Hash#sort will convert the hash to a list of
lists, sorted by their keys

Then others have put in rbtrees, arrays accessed by keywords,
http://raa.ruby-lang.org/project/ruby-rbtree/
http://codeforpeople.com/lib/ruby/ar...s-3.5.0/README

Gene Tani wrote:
> Steve Litt wrote:
>
>>On Thursday 08 December 2005 12:37 pm, robertj wrote:
>>
>>>hi,
>>>
>>>is there anywhere a class that does soemthing
>>>akin to java.util.SortedMap? that is sorting
>>>and iterating over the hash in the order of its
>>>keys.
>>
>>When I tried it, it seemed that Ruby automatically sorted the keys. I'm not
>>sure if this is what you want, but see this:
>>
>>http://www.troubleshooters.com/codec...al.htm#_Hashes
>>
>
>
> Not sure what "it" is, but Hash#sort will convert the hash to a list of
> lists, sorted by their keys

True, but unless you need the values stored in order internally, just do this:

hash.sort.each{ |e| puts "#{e[0]} => #{e[1]}" }

Regards,

Dan

hi,

the only real requirement is
that #each returns me the
key value pairs in an ordered fashion.

default ordering should be by key.

one could but think of also having
a switch that allows for ordering by
value.

ciao robertj

hi daniel,

>>hash.sort.each{ |e| puts "#{e[0]} => #{e[1]}" }
this has the effect that clients of that hash
need to know that they must order the hash +
the interface for iteration has changed.

instead of hash.each { |k, v| ...} you get hash.sort.each { |v| ...}

in short your solution requires "sorting" to become part of
the "official" interface of my hash.

ciao robertj

hi T.

another idea would be to be able to define
a comperator block that does the actual
comparisson.

ciao robertj

Thank robertj I'll work on it now.

By the way have you seen calibre/association? That's kind of neat. It
isn't quite like a regular hash, but you can use it do order hash-like
strucutures.

require 'calibre/association'

assoc_array = [ :a >> 1, :b >> :2, :c >> 3 ]

assoc_array.each{ |k,v| p k,v }

produces

:a
1
:b
2
:c
3

T.