From comp.lang.rexx (firstname.lastname@example.org): "Recently I've been hit by a large run-time penalty when I was using hasItem() to check for the existence of items in a large Set (~500.000 items).
Checking for the existence of 1.000 items with hasItem() took 20+ seconds.
Checking the same with hasIndex() took less than 0.01 seconds.
While I do understand that in the general case, hasItem() may take longer than hasIndex(): in the case of Set, shouldn't those two methods behave the same?"
Clearly this performance issue is a bug in that the user has every right to expect that both hasIndex and hasItem should perform the same.
It would seem that the fix would be straightforward: add a hasItem method to the .set class containing -
use arg it