in reply to Re: Better algorithm or data structure?
in thread Better algorithm or data structure?
I like your lateral thinking.
Unfortunately, I need to find all (any) sets completed by the state change of each boolean, at the time I receive that boolean. @someOrder was intended to represent the program receiving the notification of the booleans changing state over time, in some unspecifiable order.
That said, I think combining @sets into a hash keyed by the booleans is a very smart move. I think. I'm having trouble wrapping my head around how the sets, which will be referenced from multiple kash keys will get removed, but maybe tomorrow...
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Better algorithm or data structure?
by johngg (Canon) on Aug 30, 2010 at 01:30 UTC |