13 c2 :
while(k > 0 && pattern[k] != pattern[q]){
16 if(pattern[k] == pattern[q]){
28 CPF(pattern, kmpNext);
32 k2 :
while (q > 0 && pattern[q] !=
input[i]){
35 if (pattern[q] ==
input[i]){
38 if (q >= PATTERN_SIZE){
int kmp(char pattern[PATTERN_SIZE], char input[STRING_SIZE], int32_t kmpNext[PATTERN_SIZE], int32_t n_matches[1])
static const uint32_t k[]
void CPF(char pattern[PATTERN_SIZE], int32_t kmpNext[PATTERN_SIZE])