Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Iterating over Blocks of 2-Dim Array

by graff (Chancellor)
on Apr 01, 2004 at 03:48 UTC ( #341497=note: print w/replies, xml ) Need Help??

in reply to Iterating over Blocks of 2-Dim Array

What trips me up is that I iterate over the first two cols of the first row, then increment row but reset cols. Then row gets reset and cols adjusted.... it's just a very awkward traversal of the matrix.
Well, maybe it seems awkward, but it sounds like basically the right approach. Perhaps if you showed us the relevant code snippet that walks through the array this way, we could comment on whether the code is awkward, given the intended method (which itself is not that bad).

I've used that sort of "hopping around" within a 2-D data space fairly often -- e.g. when laying out a grid of Tk widgets into related "quadrants"; doing modulo arithmetic and resetting indices from one quadrant to the next is an acceptable (and usually optimal) solution.

So if you think your code yucky, show it to us, so we can decide whether we agree with you.

  • Comment on Re: Iterating over Blocks of 2-Dim Array

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://341497]
[stevieb]: I think that placing the * in C when dealing with pointers is akin to keeping separated the circumfix op from the inner ref in Perl: @{ $aref };, which is all personal preference. In perl, I'm good. C, don't know what I like

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2017-01-24 02:27 GMT
Find Nodes?
    Voting Booth?
    Do you watch meteor showers?

    Results (200 votes). Check out past polls.