On 2013-10-23 17:51, robin wrote: >>> >> ... the value of comparison operands [operators -- gil] having >> a ternary result. Of course this is available in (zSeries) >> assembler. It might typically shorten a table search by one >> iteration. > > How is that? > The search may be terminated early (however infrequently) on discovering an exact match. But this requires an extra comparison if ternary results are unavailable (as they are in assembler -- is that sufficiently on-topic?) The cost of that extra comparison is unlikely to be offset by terminating the loop early (usually only on the last iteration) if ternary comparisons are unavailable.
-- gil
