Those who read Apocalypse 3 (and everybody here should because the
Apocalypses describe what we plan to implement) would know that Larry Wall
decided to implement batch operations on arrays. Hence it would be
possible to add two arrays in order to get a third array whose members
equal to the sums of the two other arrays. Likewise for multiplication,
division, etc.
Now, perl5 also has the map operation, which is of a similar concept.
In C, the traditional way to implement them would be by using loops.
However, looping parrot directly would be too slow to be effective. The
way I see it we have two options:
1. Keep them as Parrot loops, and simply make sure we optimize such
patterns in the code.
2. Provide opcodes for all those operations, which would be themselves
optimized for maximal performance in C.
Can anybody think of a better way to do it, and if not or so, how is it
going to be implemented?
Regards,
Shlomi Fish
----------------------------------------------------------------------
Shlomi Fish [EMAIL PROTECTED]
Home Page: http://t2.technion.ac.il/~shlomif/
Home E-mail: [EMAIL PROTECTED]
If:
1. A is A
2. A is not not-A
does it imply that
1. B is B
2. B is not not-B
