On Tue, 1 Feb 2022, Vanessa McHale wrote:

easy to imagine that selections and joins (on the ordered keys) are going to be faster since one can implement them differently.

I thought k maintains insertion order? I can imagine fast joins for sorted keys, but not for keys which happen to be in the order they were inserted in.

 -E
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to