|No such thing as a small change|
How to code this?by BrowserUk (Pope)
|on Nov 14, 2011 at 23:02 UTC||Need Help??|
BrowserUk has asked for the
wisdom of the Perl Monks concerning the following question:
I have a hash of several hundred arrays. The keys are integers, the arrays can be up to several thousand items each.
The keys need to be processed in order -- say small to large -- in groups of a fixed integer intervals.
Ie. If the interval were 4, then first all the items in the arrays keyed by 3,4,6 & 7 must be processed together. Then all those in the arrays keyed by 4, 6, 7 & 8; then those keyed by 6,7 & 8; then 7, 8, 11.
But, the processing within each group involves processing every item against every other item within the group. And when the first group (3,4,6,7) has been processed, all those have been processed against one another already, so once the 3 array is removed and the 8 array is added, all that need to be processed is the 8 array against those in 4, 6 & 7 arrays.
Then the 4 array gets dropped and there is nothing to add, so no work to do. Then the 6 array gets dropped and the 11 array need to be processed against the 7 & 8 arrays.
I hope that is a clear explanation.
The question is, how to code that?
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.