Yes. Of course. On Oct 6, 2011 10:54 AM, "T.J. Crowder" <[email protected]> wrote: > On Oct 5, 2:39 pm, Shane McCarron <[email protected]> wrote: >> If the sorted order of the hash keys isn't what you want, you might also >> consider assigning ordinals as part of the hash key. Assuming you have less >> than 10000 hash keys, I would do something like NNNN_myKey as a key, where >> NNNN is a number that you increase each time you put an item into the hash. > > You'd still have to sort the keys after retrieving them, they won't be > guaranteed to be iterated in order. > -- > T.J. Crowder > Independent Software Engineer > tj / crowder software / com > www / crowder software / com > > -- > You received this message because you are subscribed to the Google Groups "Prototype & script.aculo.us" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to [email protected]. > For more options, visit this group at http://groups.google.com/group/prototype-scriptaculous?hl=en. >
-- You received this message because you are subscribed to the Google Groups "Prototype & script.aculo.us" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/prototype-scriptaculous?hl=en.
