| 34 | { |
| 35 | |
| 36 | size_t findSubstringCaseInsensitive( const std::string& string, const std::string& substring ) |
| 37 | { |
| 38 | auto iter = std::search( string.begin(), string.end(), |
| 39 | substring.begin(), substring.end(), |
| 40 | [] ( char ch1, char ch2 ) |
| 41 | { |
| 42 | return std::toupper( ch1 ) == std::toupper( ch2 ); |
| 43 | } ); |
| 44 | if ( iter == string.end() ) |
| 45 | return std::string::npos; |
| 46 | return std::distance( string.begin(), iter ); |
| 47 | } |
| 48 | |
| 49 | int calcDamerauLevenshteinDistance( const std::string& stringA, const std::string& stringB, |
| 50 | bool caseSensitive, int* outLeftRightAddition ) |
no test coverage detected