in reply to Numeric summarisation from data in a hash?
This is a suggestion. It is only a suggestion. It may not work at all...
Try rounding the length up to an integer. Have a single check for the bigger than x case. Use an array of arrays for the others, with the number as the offset of the outer array. Push all the filenames into the inner arrays. Then at the end you just have to grab the length of these arrays and iterate them all out. You can put the bigger than cases into the oute array at the next offset after the higest value you want.
I hope that makes sense. I'm not entirely sure what terms to use when referring to arrays of arrays.
Colin Scott
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
RE: RE: Numeric summarisation from data in a hash?
by splinky (Hermit) on Jul 07, 2000 at 16:55 UTC | |
by cds (Sexton) on Jul 07, 2000 at 17:02 UTC |