|
@@ -5,7 +5,7 @@
|
|
|
#include <vector>
|
|
#include <vector>
|
|
|
|
|
|
|
|
|
|
|
|
|
-namespace Utilities {
|
|
|
|
|
|
|
+namespace StringAlgorithm {
|
|
|
namespace Internal {
|
|
namespace Internal {
|
|
|
|
|
|
|
|
size_t find_nth(const std::string& haystack, size_t pos, const std::string& needle, size_t nth);
|
|
size_t find_nth(const std::string& haystack, size_t pos, const std::string& needle, size_t nth);
|
|
@@ -18,6 +18,9 @@ bool iequals(const std::string& str1, const std::string& str2);
|
|
|
bool starts_with(const std::string& subject, const std::string& string);
|
|
bool starts_with(const std::string& subject, const std::string& string);
|
|
|
bool istarts_with(const std::string& subject, const std::string& string);
|
|
bool istarts_with(const std::string& subject, const std::string& string);
|
|
|
|
|
|
|
|
|
|
+bool ends_with(const std::string& subject, const std::string& string);
|
|
|
|
|
+bool iends_with(const std::string& subject, const std::string& string);
|
|
|
|
|
+
|
|
|
std::vector<std::string> split(const std::string& subject, const char& delimiter);
|
|
std::vector<std::string> split(const std::string& subject, const char& delimiter);
|
|
|
std::vector<std::string> split(const std::string& subject, const std::string delimiters);
|
|
std::vector<std::string> split(const std::string& subject, const std::string delimiters);
|
|
|
|
|
|
|
@@ -28,6 +31,6 @@ bool icontains(const std::string& subject, const std::string& find);
|
|
|
|
|
|
|
|
std::string::const_iterator find_nth(const std::string& haystack, const std::string& needle, size_t nth);
|
|
std::string::const_iterator find_nth(const std::string& haystack, const std::string& needle, size_t nth);
|
|
|
|
|
|
|
|
-} // namespace Utilities
|
|
|
|
|
|
|
+} // namespace StringAlgorithm
|
|
|
|
|
|
|
|
#endif // STRINGALGORITHM_H
|
|
#endif // STRINGALGORITHM_H
|