Tracy Pierce ([log in to unmask]) wrote:
: per my fuzzy memory, indexing is faster because the indices are stored as
: addresses, and incremented by sizeof(element), as opposed to not-indexed, in
: which case you manipulate your own integers, then convert to addresses as a
: result of dataname(subscript). should be MUCH faster.
No, on PA-RISC we assumed that multiples are fast so indexes are the same
as binary subscripts. It made everything much easier and thats probably
why you can now display them. :-)
* To join/leave the list, search archives, change list settings, *
* etc., please visit http://raven.utc.edu/archives/hp3000-l.html *