in reply to Re^2: Better algorithm or data structure?
in thread Better algorithm or data structure?
How about making each "set" an object rather than just an anonymous array and store references to the objects in the %bools hash. You could then iterate over @someOrder in a loop rather than hash slicing and use the object destructor to take some action when the final reference to a "set" is deleteed from %bools.
Just a thought that occurred to me while trying to get to sleep :-/
Cheers,
JohnGG
|
|---|