possible speedup for numeric comparison

Let it all hang out

possible speedup for numeric comparison

PostPosted by drab » Wed Jan 11, 2017 10:20 am

Using a large numeric array


I compared the performance of comparisons with zero and non zero comparison tolerance using

t←⎕t ⋄ ←x=1 ⋄ ⎕t-t

I expected a dramatic speedup for ⎕ct=0 over ⎕ct>0, because it is so much simpler.

But I did not see a consistent difference at all.

I concluded that must be no internal check for a comparison tolerance of 0. Is that right?
If not, couldn't there be a dramatic speedup?
Posts: 315
Joined: Thu Oct 09, 2014 6:23 am

Return to Open Discussion

Who is online

Users browsing this forum: No registered users and 1 guest