Re: Clever map / foreach algorithm sought

Im afraid to say that I doubt your going to get much of an answer without explaining what the intention is. Frankly I am completely at a loss as to what you want this to do. In this case is better to tell us what you need than how you are currently doing it.

Yves / DeMerphq
---
Writing a good benchmark isnt as easy as it might look.

Comment on Re: Clever map / foreach algorithm sought

Replies are listed 'Best First'.
Re: Re: Clever map / foreach algorithm sought by bmcatt (Friar) on May 03, 2002 at 14:29 UTC
Ok. :-) Underlying goal is data conversion. I'm processing the output from a (paper) scanning system and trying to convert it into something that's acceptable to our back-end input system. The original paper contains a bunch of mark-sense boxes (think of an SAT or similar test) and just produces a number related to the number of the box. So, for example, an individual block (bunch of mark sense boxes) will appear in the input data as: `"EFD1=1,5,10,"`. The (4, 4, 2) refers to the actualy physical layout of those mark-sense boxes. So there are two rows of 4 boxes and one row of 2. In the above case (1,5,10), that means that the first box of the first two rows were marked as well as the second box of the last row. The 1,5,10 needs to be translated to what they actually "mean", so 1,5,10, needs to turn into (EF01:0, EF02:0, EF03:1). My original idea was to just build an array and index into there (1-1, 5-1, 10-1) and pick out the "right" answer. The algorithm question that started all this was on better ways to build that array (although, now that you mention it, suggestions on better ways to do this whole thing will also be appreciated :-).	[reply] [d/l]

Replies are listed 'Best First'.

Re: Re: Clever map / foreach algorithm sought
by bmcatt (Friar) on May 03, 2002 at 14:29 UTC

Underlying goal is data conversion. I'm processing the output from a (paper) scanning system and trying to convert it into something that's acceptable to our back-end input system. The original paper contains a bunch of mark-sense boxes (think of an SAT or similar test) and just produces a number related to the number of the box.

So, for example, an individual block (bunch of mark sense boxes) will appear in the input data as: "EFD1=1,5,10,".

The (4, 4, 2) refers to the actualy physical layout of those mark-sense boxes. So there are two rows of 4 boxes and one row of 2. In the above case (1,5,10), that means that the first box of the first two rows were marked as well as the second box of the last row.

The 1,5,10 needs to be translated to what they actually "mean", so 1,5,10, needs to turn into (EF01:0, EF02:0, EF03:1). My original idea was to just build an array and index into there (1-1, 5-1, 10-1) and pick out the "right" answer.

The algorithm question that started all this was on better ways to build that array (although, now that you mention it, suggestions on better ways to do this whole thing will also be appreciated :-).

[reply]
[d/l]