/* Distributed under the OSI-approved BSD 3-Clause License. See accompanying file Copyright.txt or https://cmake.org/licensing for details. */ #ifndef cmStringAlgorithms_h #define cmStringAlgorithms_h #include "cmConfigure.h" // IWYU pragma: keep #include "cmRange.h" #include "cm_string_view.hxx" #include #include #include #include #include #include #include typedef cmRange::const_iterator> cmStringRange; struct cmStrCmp { cmStrCmp(const char* test) : m_test(test) { } cmStrCmp(std::string test) : m_test(std::move(test)) { } bool operator()(const std::string& input) const { return m_test == input; } bool operator()(const char* input) const { return strcmp(input, m_test.c_str()) == 0; } private: const std::string m_test; }; template std::string cmJoin(Range const& r, const char* delimiter) { if (r.empty()) { return std::string(); } std::ostringstream os; typedef typename Range::value_type ValueType; typedef typename Range::const_iterator InputIt; const InputIt first = r.begin(); InputIt last = r.end(); --last; std::copy(first, last, std::ostream_iterator(os, delimiter)); os << *last; return os.str(); } template std::string cmJoin(Range const& r, std::string const& delimiter) { return cmJoin(r, delimiter.c_str()); } template std::string cmWrap(std::string const& prefix, Range const& r, std::string const& suffix, std::string const& sep) { if (r.empty()) { return std::string(); } return prefix + cmJoin(r, suffix + sep + prefix) + suffix; } template std::string cmWrap(char prefix, Range const& r, char suffix, std::string const& sep) { return cmWrap(std::string(1, prefix), r, std::string(1, suffix), sep); } /** Returns true if string @a str starts with the character @a prefix. **/ inline bool cmHasPrefix(cm::string_view str, char prefix) { return !str.empty() && (str.front() == prefix); } /** Returns true if string @a str starts with string @a prefix. **/ inline bool cmHasPrefix(cm::string_view str, cm::string_view prefix) { return str.compare(0, prefix.size(), prefix) == 0; } /** Returns true if string @a str starts with string @a prefix. **/ template inline bool cmHasLiteralPrefix(cm::string_view str, const char (&prefix)[N]) { return cmHasPrefix(str, cm::string_view(prefix, N - 1)); } /** Returns true if string @a str ends with the character @a suffix. **/ inline bool cmHasSuffix(cm::string_view str, char suffix) { return !str.empty() && (str.back() == suffix); } /** Returns true if string @a str ends with string @a suffix. **/ inline bool cmHasSuffix(cm::string_view str, cm::string_view suffix) { return str.size() >= suffix.size() && str.compare(str.size() - suffix.size(), suffix.size(), suffix) == 0; } /** Returns true if string @a str ends with string @a suffix. **/ template inline bool cmHasLiteralSuffix(cm::string_view str, const char (&suffix)[N]) { return cmHasSuffix(str, cm::string_view(suffix, N - 1)); } /** Removes an existing suffix character of from the string @a str. **/ inline void cmStripSuffixIfExists(std::string& str, char suffix) { if (cmHasSuffix(str, suffix)) { str.pop_back(); } } /** Removes an existing suffix string of from the string @a str. **/ inline void cmStripSuffixIfExists(std::string& str, cm::string_view suffix) { if (cmHasSuffix(str, suffix)) { str.resize(str.size() - suffix.size()); } } #endif