Re: [Vala] sorted keys from a hash

2010-02-14 Thread Jan Hudec
On Sat, Feb 13, 2010 at 21:59:20 +0530, Martin DeMello wrote: On Sat, Feb 13, 2010 at 3:39 AM, Jan Hudec b...@ucw.cz wrote: On Sat, Feb 13, 2010 at 02:54:21 +0530, Martin DeMello wrote: What's the most efficient (in terms of speed) way to iterate over a hash in sorted order of the keys? The

Re: [Vala] sorted keys from a hash

2010-02-13 Thread Martin DeMello
On Sat, Feb 13, 2010 at 3:39 AM, Jan Hudec b...@ucw.cz wrote: On Sat, Feb 13, 2010 at 02:54:21 +0530, Martin DeMello wrote: What's the most efficient (in terms of speed) way to iterate over a hash in sorted order of the keys? The keys are strings. To use a balanced tree. Hash can only ever

[Vala] sorted keys from a hash

2010-02-12 Thread Martin DeMello
What's the most efficient (in terms of speed) way to iterate over a hash in sorted order of the keys? The keys are strings. martin ___ Vala-list mailing list Vala-list@gnome.org http://mail.gnome.org/mailman/listinfo/vala-list

Re: [Vala] sorted keys from a hash

2010-02-12 Thread Jan Hudec
On Sat, Feb 13, 2010 at 02:54:21 +0530, Martin DeMello wrote: What's the most efficient (in terms of speed) way to iterate over a hash in sorted order of the keys? The keys are strings. To use a balanced tree. Hash can only ever be iterated in the hash order, which is fixed but pseudo-random.