Currently, L. finds the depth of a boxed array by recursively inspecting all contained boxes (vo.c -- jtlevel1).
Conceptually, this should be a header attribute for boxed arrays. I expect there's some "deep" issues which have prevented us from using that approach. Does anyone have a good summary of them? Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
