1. For lists, sort-then-search is more expensive than the hashtable
usually. Also, the order of inputs matters, as tolerant-equals is not
transitive.
2. For tables, which we were discussing, sort (always intolerant)
doesn't get the job done. The entire first column might be tolerantly
equal and provide no help toward indexing later columns.
It's a hard problem, which has defeated me and Roger before me. Any
progress would be much welcomed.
Henry Rich
On 8/30/2023 7:43 AM, Raul Miller wrote:
Shouldn't tolerant i.~ use grade, sort and a binary search?
Thanks,
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
