93d155bc44
-- 3d20ce6cd6541579abecaba169d4b8716d511272 by Jon Cohen <cohenjon@google.com>: Only use LSAN for clang version >= 3.5. This should fix https://github.com/abseil/abseil-cpp/issues/244 PiperOrigin-RevId: 234675129 -- e15bd4ec7a81aa95cc3d09fa1e0e81d58ae478fb by Conrad Parker <conradparker@google.com>: Fix errors in apply() sample code The following changes are made: * Make the example method public. * Give the two user functions different names to avoid confusion about whether apply() can select the correct overload of a function based on its tuple argument (it can't). * Pass tuple2 to the second example apply() invocation, instead of passing its contents individually. * Fix a s/tuple/tuple3/ typo in the third example apply() invocation. PiperOrigin-RevId: 234223407 -- de0ed71e21bc76ddf9fe715fdbaef74cd0df95c7 by Abseil Team <absl-team@google.com>: First test if a macro is defined to avoid -Wundef. ABSL clients may need to compile their code with the -Wundef warning flag. It will be helpful if ABSL header files can be compiled without the -Wundef warning. How to avoid the -Wundef warning: If a macro may be undefined, we need to first test whether the macro is defined before testing its value. We can't rely on the C preprocessor rule that an undefined macro has the value 0L. PiperOrigin-RevId: 234201123 -- fa484ad7dae0cac21140a96662809ecb0ec8eb5d by Abseil Team <absl-team@google.com>: Internal change. PiperOrigin-RevId: 234185697 -- d69b1baef681e27954b065375ecf9c2320463b2b by Samuel Benzaquen <sbenza@google.com>: Mix pointers more thoroughly. Some pointer alignments interact badly with the mixing constant. By mixing twice we reduce this problem. PiperOrigin-RevId: 234178401 -- 1041d0e474610f3a8fea0db90958857327d6da1c by Samuel Benzaquen <sbenza@google.com>: Record rehashes in the hashtablez struct. Only recording the probe length on insertion causes a huge overestimation of the total probe length at any given time. With natural growth, elements are inserted when the load factor is between (max load/2, max load). However, after a rehash the majority of elements are actually inserted when the load factor is less than max/2 and have a much lower average probe length. Also reset some values when the table is cleared. PiperOrigin-RevId: 234013580 -- 299205caf3c89c47339f7409bc831746602cea84 by Mark Barolak <mbar@google.com>: Fix a sample code snippet that assumes `absl::string_view::const_iterator` is `const char*`. This is generally true, however in C++17 builds, absl::string_view is an alias for std::string_view and on MSVC, the std::string_view::const_iterator is an object instead of just a pointer. PiperOrigin-RevId: 233844595 -- af6c6370cf51a1e6c1469c79dfb2a486a4009136 by Abseil Team <absl-team@google.com>: Internal change. PiperOrigin-RevId: 233773470 -- 6e59e4b8e2bb6101b448f0f32b0bea81fe399ccf by Abseil Team <absl-team@google.com>: fix typo in {Starts|Ends}WithIgnoreCase comment in match.h PiperOrigin-RevId: 233662951 GitOrigin-RevId: 3d20ce6cd6541579abecaba169d4b8716d511272 Change-Id: Ib9a29b1c38c6aedf5d9f3f7f00596e8d30e864dd
89 lines
3 KiB
C++
89 lines
3 KiB
C++
//
|
|
// Copyright 2017 The Abseil Authors.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
//
|
|
// -----------------------------------------------------------------------------
|
|
// File: match.h
|
|
// -----------------------------------------------------------------------------
|
|
//
|
|
// This file contains simple utilities for performing string matching checks.
|
|
// All of these function parameters are specified as `absl::string_view`,
|
|
// meaning that these functions can accept `std::string`, `absl::string_view` or
|
|
// nul-terminated C-style strings.
|
|
//
|
|
// Examples:
|
|
// std::string s = "foo";
|
|
// absl::string_view sv = "f";
|
|
// assert(absl::StrContains(s, sv));
|
|
//
|
|
// Note: The order of parameters in these functions is designed to mimic the
|
|
// order an equivalent member function would exhibit;
|
|
// e.g. `s.Contains(x)` ==> `absl::StrContains(s, x).
|
|
#ifndef ABSL_STRINGS_MATCH_H_
|
|
#define ABSL_STRINGS_MATCH_H_
|
|
|
|
#include <cstring>
|
|
|
|
#include "absl/strings/string_view.h"
|
|
|
|
namespace absl {
|
|
|
|
// StrContains()
|
|
//
|
|
// Returns whether a given string `haystack` contains the substring `needle`.
|
|
inline bool StrContains(absl::string_view haystack, absl::string_view needle) {
|
|
return haystack.find(needle, 0) != haystack.npos;
|
|
}
|
|
|
|
// StartsWith()
|
|
//
|
|
// Returns whether a given string `text` begins with `prefix`.
|
|
inline bool StartsWith(absl::string_view text, absl::string_view prefix) {
|
|
return prefix.empty() ||
|
|
(text.size() >= prefix.size() &&
|
|
memcmp(text.data(), prefix.data(), prefix.size()) == 0);
|
|
}
|
|
|
|
// EndsWith()
|
|
//
|
|
// Returns whether a given string `text` ends with `suffix`.
|
|
inline bool EndsWith(absl::string_view text, absl::string_view suffix) {
|
|
return suffix.empty() ||
|
|
(text.size() >= suffix.size() &&
|
|
memcmp(text.data() + (text.size() - suffix.size()), suffix.data(),
|
|
suffix.size()) == 0
|
|
);
|
|
}
|
|
|
|
// EqualsIgnoreCase()
|
|
//
|
|
// Returns whether given ASCII strings `piece1` and `piece2` are equal, ignoring
|
|
// case in the comparison.
|
|
bool EqualsIgnoreCase(absl::string_view piece1, absl::string_view piece2);
|
|
|
|
// StartsWithIgnoreCase()
|
|
//
|
|
// Returns whether a given ASCII string `text` starts with `prefix`,
|
|
// ignoring case in the comparison.
|
|
bool StartsWithIgnoreCase(absl::string_view text, absl::string_view prefix);
|
|
|
|
// EndsWithIgnoreCase()
|
|
//
|
|
// Returns whether a given ASCII string `text` ends with `suffix`, ignoring
|
|
// case in the comparison.
|
|
bool EndsWithIgnoreCase(absl::string_view text, absl::string_view suffix);
|
|
|
|
} // namespace absl
|
|
|
|
#endif // ABSL_STRINGS_MATCH_H_
|