On Sat, Apr 9, 2022 at 4:04 AM Elijah Stone <elro...@elronnd.net> wrote:
> Suppose that ~. (and perhaps some relatives) can be implemented much more
> efficiently if no guarantee is made about the order of the result. Is it
> too much of an abuse of notation to use ({~?~@#)@~. as a special
> combination to invoke such an algorithm? If so, what would be better?
Be careful here.
People will say that certain algorithms, such as hashing, are highly
efficient. But these assertions are quite often not accompanied by
adequate benchmarking on large datasets. And, these approaches often
have inefficient worst case behavior.
(I have run into this issue when working with datasets on the order of
1e8 items, so the slowdowns were a bit painful. In my case, it was
order of magnitude faster to sort first and then use the sorted order
to eliminate duplicates.)
--
Raul
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
