 |
Idiom Recognition automatically replaces a set of primitive combinations (such as /?) with highly optimised code, boosting performance of commonly used idioms. |
 |
A super-fast matrix iota function is provided, based upon a specially optimised idiom for this operation. |
 |
It is also now possible to obtain much faster lookup speed by saving the hash tables associated with ?, 1 and other set primitives. This avoids the tables being recalculated when you perform repeated look-ups in the same array. |
 |
A new system function Œ MAP allows you to associate APL arrays with mapped file. Access to the data in the files is about as fast as it gets under Windows. |