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.
--
Jan 'Bulb' Hudec <[email protected]>
_______________________________________________
Vala-list mailing list
[email protected]
http://mail.gnome.org/mailman/listinfo/vala-list
