Oh, great, on this mac, the key sequence I use to paste text will also in at least one context send the message.
Anyways, picking up where I left off: On Tue, Oct 15, 2013 at 12:55 PM, Raul Miller <[email protected]> wrote: > I just now used the json parsing code at > http://rosettacode.org/wiki/JSON#J on a moderately sized json string > (219003 characters). > > Here's what space and time look like for this effort: 16.1096 5.26771e6 That seems excessively slow. I think the speed loss has to do with the way boxing is managed. The result has a depth of six. I've seen similar performance problems when I've tried to use J parsing other data from foreign contexts. (For example, parsing bethesda games .nif files.) I've considered other representations (like using locales as objects to represent what I'm using a box to represent), but that winds up with object counts in the millions, and the manual memory management required with locales makes this approach scary. I might as well be working in some other language, for all that J offers me here. But Arthur Whitney's K/Q has a tree structure that is almost like J's boxing mechanism and allegedly it has good performance. And then there's https://github.com/kevinlawler/kona So I'm wondering if perhaps we could improve J's implementation here? But I'm not focussed enough on this issue to say how that would work. Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
