ACM Home Page
Please provide us with feedback. Feedback
Replacing an explicit loop by the "each" operator
Full text PdfPdf (168 KB)
Source International Conference on APL archive
Proceedings of the 2001 conference on APL: an arrays odyssey table of contents
New Haven, Connecticut
Pages: 35 - 37  
Year of Publication: 2001
ISBN:1-58113-419-3
Also published in ...
Authors
Samir Lipovaca  New York Stock Exchange, Inc., New York, NY
Joseph Burchfield  New York Stock Exchange, Inc., New York, NY
Sponsors
: NY Special Interest Group for the APL Programming Language (the NYC area APL chapter of ACM)
SIGAPL: ACM Special Interest Group on APL Programming Language
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 20,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/570407.570410
What is a DOI?

ABSTRACT

A method of replacing an explicit loop by the "each" operator was studied. The repetitive, computational part of the loop was extracted into a function FOO. Then, the function was applied to each value of the loop counter vector C (FOO "each" C). Since array operations are optimized on most APL systems, this replacement should produce a most reasonable loop, assuming that in the function FOO array operations were used as much as possible. Two examples of performance measurements showed that this, generally, did not lead to smaller execution time. In one example the "each" operator was faster than an explicit loop while in another the opposite was true.



Collaborative Colleagues:
Samir Lipovaca: colleagues
Joseph Burchfield: colleagues