in reply to Sorting hashes with new value detection
In the end, I need to be able to sort and rip parts and pieces of this with ease (like a typical hash). Things to keep in mind are; I need to be able to sort by length of characters in the words, and find specific elements which words start with (or end with) specific characters. Ideally, it’d need to be as maintainable as a hash which I’m sure HOAs and AOAs are capable of.
Can you elaborate on your needs? What does the code do?
Makeshifts last the longest.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Sorting hashes with new value detection
by sulfericacid (Deacon) on Jan 24, 2006 at 17:57 UTC | |
by Aristotle (Chancellor) on Jan 24, 2006 at 18:15 UTC | |
by thundergnat (Deacon) on Jan 24, 2006 at 20:30 UTC |