Oops. I meant 'array of boxes' instead of 'boxed arrays' in the second paragraph.
On Wed, Oct 23, 2013 at 4:47 PM, Ganesh Rapolu <[email protected]> wrote: > This new i. would be useful primarily on strings, where using symbols > instead already solves the problem more effectively. It might also slow > down i. if it had to use another algorithm every time there was a mismatch > in the lengths of the arguments. > > In K ragged arrays (called general lists) are like boxed arrays in J: > they are implemented as an array of pointers, not as a contiguous block of > memory. This makes reducing or mapping over the list somewhat expensive. > > > > On Wed, Oct 23, 2013 at 11:55 AM, greg heil <[email protected]> wrote: > >> >Ragged arrays are a problem for J, if boxing is costly. Eg a dictionary >> of the English language can be easily be represented as a (very sparse) >> array of dimension the longest word {an extent of 26 in each dimension). No >> problem using this representation in a language such as K. But for an >> alternative in J ... i do not know, even memory mapping the full >> rectangularity would be taxing. >> >> greg >> ~krsnadas.org > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
