// Copyright 2020 The Chromium Authors // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef BASE_STRINGS_STRING_UTIL_INTERNAL_H_ #define BASE_STRINGS_STRING_UTIL_INTERNAL_H_ #include #include #include #include "base/ranges/algorithm.h" #include "base/strings/string_piece.h" namespace base::internal { // ASCII-specific tolower. The standard library's tolower is locale sensitive, // so we don't want to use it here. template requires(std::integral) constexpr CharT ToLowerASCII(CharT c) { return (c >= 'A' && c <= 'Z') ? (c + ('a' - 'A')) : c; } template requires(std::integral) constexpr int CompareCaseInsensitiveASCIIT(T a, T b) { // Find the first characters that aren't equal and compare them. If the end // of one of the strings is found before a nonequal character, the lengths // of the strings are compared. Compare using the unsigned type so the sort // order is independent of the signedness of `char`. using UCharT = std::make_unsigned_t; size_t i = 0; while (i < a.length() && i < b.length()) { UCharT lower_a = static_cast(ToLowerASCII(a[i])); UCharT lower_b = static_cast(ToLowerASCII(b[i])); if (lower_a < lower_b) return -1; if (lower_a > lower_b) return 1; i++; } // End of one string hit before finding a different character. Expect the // common case to be "strings equal" at this point so check that first. if (a.length() == b.length()) return 0; if (a.length() < b.length()) return -1; return 1; } template inline bool EqualsCaseInsensitiveASCIIT(std::basic_string_view a, std::basic_string_view b) { return ranges::equal(a, b, [](auto lhs, auto rhs) { return ToLowerASCII(lhs) == ToLowerASCII(rhs); }); } } // namespace base::internal #endif // BASE_STRINGS_STRING_UTIL_INTERNAL_H_