diff options
Diffstat (limited to 'helpers.c')
| -rw-r--r-- | helpers.c | 16 |
1 files changed, 8 insertions, 8 deletions
@@ -213,7 +213,7 @@ int FindIgnoreCase(const std::string& expr, const std::string& query) char* GetAuxValue(const char* aux, const char* name) { if (isempty(aux)) return NULL; - + char* descr = strdup(aux); char* beginaux = strstr(descr, "<epgsearch>"); char* endaux = strstr(descr, "</epgsearch>"); @@ -245,7 +245,7 @@ char* GetAuxValue(const char* aux, const char* name) { cat += namelen + 2; char* end = strstr(cat, "</"); if (!end) { - free(descr); + free(descr); return NULL; } end[0] = 0; @@ -286,10 +286,10 @@ ARGUMENTS: kerr Number of possible errors. Shouldn't exceed pattern length UseFilter Use agrep filter algorithm that speeds up search. fuzzy pointer to the structure that will be later passes to Check* - (the first 6 elements should be NULLs for the first call) - + (the first 6 elements should be NULLs for the first call) + RETURN VALUE: - none + none ALGORITHM see. the article on agrep algorithms. @@ -379,7 +379,7 @@ void afuzzy_init(const char *p, int kerr, int UseFilter, AFUZZY *fuzzy) for (i = p_len - fuzzy->k - 1; i <= p_len - 1; i++) /* k+1 times */ fuzzy->filter_ok |= 1 << i; - /* k+1 first bits set to 1 */ + /* k+1 first bits set to 1 */ fuzzy->filter_shift = (1 << (fuzzy->k + 2)) - 1; } } @@ -391,9 +391,9 @@ FUNCTION afuzzy_free() ARGUMENTS: fuzzy pointer to the afuzzy parameters structure - + RETURN VALUE: - none + none ******************************************************************************/ void afuzzy_free(AFUZZY *fuzzy) { |