Yes, you got it right. Well done! But I omit blanks between digits in the
ordinal fractions. And zeroes to the right may be omitted.
a
1 b
11 c
12 d
13 e
2 q
Thank you!
Bo
Den 12:52 fredag den 22. december 2017 skrev R.E. Boss
<[email protected]>:
0 1 1 c
0 1 2 d
0 1 3 e
Would correspond to the tree, AFAIR.
R.E. Boss
> -----Original Message-----
> From: Chat [mailto:[email protected]] On Behalf Of
> David Lambert
> Sent: vrijdag 22 december 2017 04:22
> To: chat <[email protected]>
> Subject: [Jchat] ordinal fractions
>
> 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
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
