I'd use an index vector to store the ordinal fraction as I understand them.
Check my comprehension please. Do the ordinal fractions and tree agree?
c
/
b - d
/ \
a e
\
q
0 0 0 a
0 1 0 b
0 2 0 q
0 1 1 c
0 1 1 d
0 1 2 e
Boxes take a long time in j because, among other things, each open box
must be type and shape and rank checked.
Under ordinal fraction addressing scheme, is there a way to know that
data is stored internally as a regular array? Knowing the stride
between items is key to fast execution.
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
