From e5b50757feff685cc7e2fe280ee940c1160b3aad Mon Sep 17 00:00:00 2001 From: Christian Wieninger Date: Sun, 14 Apr 2013 19:34:58 +0200 Subject: fix summary comparison when checking for repeats (was ML 'Epgsearch mysteries') --- README | 2 +- epgsearchext.c | 2 +- epgsearchtools.c | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/README b/README index b18b191..b16bb82 120000 --- a/README +++ b/README @@ -1 +1 @@ -README.git \ No newline at end of file +./doc/en/epgsearch.1.txt \ No newline at end of file diff --git a/epgsearchext.c b/epgsearchext.c index 9db9158..db0a9a7 100644 --- a/epgsearchext.c +++ b/epgsearchext.c @@ -1201,7 +1201,7 @@ void cSearchExt::CheckRepeatTimers(cSearchResults* pResults) if (!pResultObjP->needsTimer) continue; - if (EventsMatch(pEvent, pEventP, compareTitle, compareSubtitle, compareSummary, compareDate, catvaluesAvoidRepeat)) + if (EventsMatch(pEvent, pEventP, compareTitle, compareSubtitle, compareSummary, compareDate, catvaluesAvoidRepeat, compareSummaryMatchInPercent)) { if (!pFirstResultMatching) pFirstResultMatching = pResultObjP; plannedTimers++; diff --git a/epgsearchtools.c b/epgsearchtools.c index 66c537f..6f7485a 100644 --- a/epgsearchtools.c +++ b/epgsearchtools.c @@ -506,7 +506,7 @@ bool DescriptionMatches(const char* eDescr, const char* rDescr, int matchLimit) // last try with Levenshtein Distance, only compare the first 1000 chars double fMatch = FuzzyMatch(eDescr, rDescr, 1000); double tmp_matchlimit = matchLimit/100.0; - if(maxLength - minLength < 5) + if(maxLength - minLength < 5 && matchLimit < 95) { tmp_matchlimit = 0.95; LogFile.Log(2,"difference between both descriptions is < 5 setting matchlimit to: %.2f %%", tmp_matchlimit*100); -- cgit v1.2.3