aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorJonathan Wakely <jwakely@redhat.com>2020-03-03 11:06:26 +0000
committerJonathan Wakely <jwakely@redhat.com>2020-03-03 11:06:26 +0000
commit9b4f00dd3f799337d8b8ef5e79f5a682c8059ab9 (patch)
treeb443d9547c4ac12c012084225ec211a52d9d5695 /gcc
parentb07e4e7c7520ca3e798f514dec0711eea2c027be (diff)
downloadgcc-9b4f00dd3f799337d8b8ef5e79f5a682c8059ab9.zip
gcc-9b4f00dd3f799337d8b8ef5e79f5a682c8059ab9.tar.gz
gcc-9b4f00dd3f799337d8b8ef5e79f5a682c8059ab9.tar.bz2
libstdc++: Micro-optimisations for lexicographical_compare_three_way
As noted in LWG 3410 the specification in the C++20 draft performs more iterator comparisons than necessary when the end of either range is reached. Our implementation followed that specification. This removes the redundant comparisons so that we do no unnecessary work as soon as we find that we've reached the end of either range. The odd-looking return statement is because it generates better code than the original version that copied the global constants. * include/bits/stl_algobase.h (lexicographical_compare_three_way): Avoid redundant iterator comparisons (LWG 3410).
Diffstat (limited to 'gcc')
0 files changed, 0 insertions, 0 deletions