stv0g/Criterion
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Fixed typos in extmatch size heuristic

Browse source
This commit is contained in:
Snaipe 2015-12-13 00:44:16 +01:00
parent 0becccc403
commit 2411660cba
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
src/string/extmatch.c
View file

@ -237,12 +237,12 @@ static int transform(const char *pattern, char *result, const char **errmsg) {
*
* let num be the function that yields the number of occurences of a string.
* let spec be the set {(s, num(s)) | ∀s}
* ∀s, lenght(T(s)) = length(s) + Σ((c_i, n_i) ∈ spec, n_i * diff(c_i))
* ∀s, length(T(s)) = length(s) + Σ((c_i, n_i) ∈ spec, n_i * diff(c_i))
*
* let S = {'*', '!()', '|', '.', '(', ')'}.
* since ∀s ∉ S, diff(s) = 0, we can simplify the above equation as:
*
* ∀s, lenght(T(s)) = length(s) + num('*') + num('|') + num('.')
* ∀s, length(T(s)) = length(s) + num('*') + num('|') + num('.')
* + num('(') + num(')') + 4 * num('!()').
*
* We must now find the maximal length L such as ∀s, L >= length(T(s))
@ -255,7 +255,7 @@ static int transform(const char *pattern, char *result, const char **errmsg) {
* let Q = length(u(s)) mod 3,
* hence num('!()') = N.
*
* ∀s | lenght(s) = length(u(s)),
* ∀s | length(s) = length(u(s)),
* length(T(s)) <= length(T(u(s)))
* <= length(u(s)) | the original length
* + 4 * N | the expansion of all '!()'