/* Usage Example: Enter the words or sentences on Code Playground input dialog, separated by new line, the code will process each of the input until there's nothing left to do, for example: SoloLearn rolls out new poll Python vs the black panther ... ... */ #include #include using std::string; using std::cin; using std::cout; using std::endl; /* function isXletWord Description: A function that checks whether or not a substring (of specified length) appears N number of times in the sample string. The settings for how many characters to be checked, and threshold for substring appearance frequency to be considered a match; are adjustable, through the function's parameters. NOTE: The default value for appearance frequency threshold defines that the function's default behaviour is to return matching when the sample passed in is a triplet word or sentence. Parameters: string String to check string [OUT] Repetitive substring size_type Length of scanned substring size_type Frequency threshold required Return value: int, the number set as frequency threshold in function's parameter, or zero if no match was found. @Ipang © 2018 SoloLearn Community Comments, critiques, and suggestions are all welcome : ) */ int isXletWord( string haystack, string& theSubstr, string::size_type substrLength = 2, string::size_type repeatLimit = 3) { // Reject empty samples! if(haystack.empty()) return 0; // Length of the substring cannot be // less than two, or larger than sample // length. The sample length is expected // to be longer than substring size * // required frequency string::size_type len {haystack.length()}; if(substrLength < 2 || (substrLength * repeatLimit) > len || substrLength > len) return 0; string needle; int count; string::size_type start {0}, pos {0}; string::size_type limit {len - (substrLength * repeatLimit)}; while(start <= limit) { // Create the substring to check count = 1; needle = haystack.substr(start, substrLength); // Check if the substring appears, // starting from adjacent position pos = haystack.find(needle, start + substrLength); // Keep searching the substring until // we have reached the threshold while(pos != string::npos) { count++; if(count == repeatLimit) { // Return needle via function // parameter, and frequency // as the return value. theSubstr = needle; return count; } pos = haystack.find(needle, pos + substrLength); } start++; } return 0; } // Main procedure int main() { // Sample, frequent string string sample, anchor, padding {" "}; char dq {'\"'}, nl {'\n'}; // Substring length, frequency threshold string::size_type sl {2}, ft {3}; //cout << "Checking " << sl << " bytes at a time.\nOccurrence required: " << ft << "\n"; cout << "Enter the word/sentence samples:\n\n"; do { getline(cin, sample); if(!cin.good() || sample.empty()) break; cout << dq << sample << dq << nl; int rep = isXletWord (sample, anchor, sl, ft); if(rep) { cout << padding << char(251) << " Triplet sample." << nl; cout << padding << dq << anchor << "\" appeared " << rep << " times."; } else cout << padding << "X Non triplet sample."; cout << nl << nl; } while(true); cout << endl; return 0; }

XletChecker