/* * The MIT License (MIT) * * Copyright (c) 2015-2022 Advanced Micro Devices, Inc. All rights reserved. * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ #ifndef MIGRAPHX_GUARD_MIGRAPHLIB_STRINGUTILS_HPP #define MIGRAPHX_GUARD_MIGRAPHLIB_STRINGUTILS_HPP #include #include #include #include #include #include #include namespace migraphx { inline namespace MIGRAPHX_INLINE_NS { #define MIGRAPHX_STRINGIZE_1(...) #__VA_ARGS__ #define MIGRAPHX_STRINGIZE(...) MIGRAPHX_STRINGIZE_1(__VA_ARGS__) template auto with_char(F f) { return [=](unsigned char c) -> bool { return f(c); }; } inline void replace_string_inplace(std::string& subject, const std::string& search, const std::string& replace) { size_t pos = 0; while((pos = subject.find(search, pos)) != std::string::npos) { subject.replace(pos, search.length(), replace); pos += replace.length(); } } inline std::string replace_string(std::string subject, const std::string& search, const std::string& replace) { replace_string_inplace(subject, search, replace); return subject; } inline bool ends_with(const std::string& value, const std::string& suffix) { if(suffix.size() > value.size()) return false; else return std::equal(suffix.rbegin(), suffix.rend(), value.rbegin()); } template inline std::string join_strings(Strings strings, const std::string& delim) { auto it = strings.begin(); if(it == strings.end()) return ""; auto nit = std::next(it); return std::accumulate(nit, strings.end(), *it, [&](std::string x, std::string y) { return std::move(x) + delim + std::move(y); }); } inline std::vector split_string(const std::string& s, char delim) { std::vector elems; std::stringstream ss(s + ' '); std::string item; while(std::getline(ss, item, delim)) { elems.push_back(item); } return elems; } template std::string trim(const std::string& s, F f) { auto start = std::find_if_not(s.begin(), s.end(), f); auto last = std::find_if_not(s.rbegin(), std::string::const_reverse_iterator(start), f).base(); return {start, last}; } inline std::string trim(const std::string& s) { return trim(s, [](unsigned char c) { return std::isspace(c); }); } template inline std::string transform_string(std::string s, F f) { std::transform(s.begin(), s.end(), s.begin(), f); return s; } inline std::string to_upper(std::string s) { return transform_string(std::move(s), ::toupper); } inline std::string to_lower(std::string s) { return transform_string(std::move(s), ::tolower); } inline bool starts_with(const std::string& value, const std::string& prefix) { if(prefix.size() > value.size()) return false; else return std::equal(prefix.begin(), prefix.end(), value.begin()); } inline std::string remove_prefix(std::string s, const std::string& prefix) { if(starts_with(s, prefix)) return s.substr(prefix.length()); else return s; } template inline std::string interpolate_string(const std::string& input, F f, std::string start = "${", std::string end = "}") { std::string result = ""; result.reserve(input.size()); auto it = input.begin(); while(it != input.end()) { auto next_start = std::search(it, input.end(), start.begin(), start.end()); auto next_end = std::search(next_start, input.end(), end.begin(), end.end()); result.append(it, next_start); if(next_start == input.end()) break; auto r = f(next_start + start.size(), next_end); result.append(r.begin(), r.end()); it = next_end + end.size(); } return result; } inline std::string interpolate_string(const std::string& input, const std::unordered_map& vars, std::string start = "${", std::string end = "}") { return interpolate_string( input, [&](auto start_it, auto last_it) { auto key = trim({start_it, last_it}); auto it = vars.find(key); if(it == vars.end()) throw std::runtime_error("Unknown key: " + key); return it->second; }, std::move(start), std::move(end)); } template inline std::string to_string_range(Iterator start, Iterator last) { std::stringstream ss; if(start != last) { ss << *start; std::for_each(std::next(start), last, [&](auto&& x) { ss << ", " << x; }); } return ss.str(); } template inline std::string to_string_range(const Range& r) { return to_string_range(r.begin(), r.end()); } template inline std::string to_string_range(const std::initializer_list& r) { return to_string_range(r.begin(), r.end()); } template inline auto to_string(const T& x) -> decltype((std::declval() << x), std::string{}) { std::stringstream ss; ss << x; return ss.str(); } } // namespace MIGRAPHX_INLINE_NS } // namespace migraphx #endif