Very good point. But if the order is undefined, the primitive has less
value. An alternative is to expect that we will define a new primitive
whose result has undefined order. If it comes to that.
Henry Rich
On 5/10/2020 10:56 PM, bill lam wrote:
Shouldn't we keep silent or explicitly define the order to be undefined?
Someday, implementation may run in parallel multithreaded.
On Mon, May 11, 2020 at 10:42 AM Henry Rich <henryhr...@gmail.com> wrote:
I don't think pre-/post-order is germane, because only "n-leaves"
(defined as cells with boxing level n) are processed. Processing does go
left to right.
For dyads, what happens defies simple description.
Henry Rich
On 5/10/2020 7:41 PM, Raoul Schorer wrote:
Hello,
After experimenting myself, I am in doubt regarding the type of tree
traversal L: and S: provide.
I am under the impression that the pattern is left pre-order
traversal. Is that right, though?
Thanks for your help,
Raoul
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
--
This email has been checked for viruses by AVG.
https://www.avg.com
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
--
This email has been checked for viruses by AVG.
https://www.avg.com
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
