added code comments
This commit is contained in:
parent
63f6039fb3
commit
dc3ed5b6a7
@ -184,8 +184,13 @@ static int LZ4HC_compress_optimal (
|
|||||||
DEBUGLOG(7, "rPos:%u[%u] vs [%u]%u",
|
DEBUGLOG(7, "rPos:%u[%u] vs [%u]%u",
|
||||||
cur, opt[cur].price, opt[cur+1].price, cur+1);
|
cur, opt[cur].price, opt[cur+1].price, cur+1);
|
||||||
if (fullUpdate) {
|
if (fullUpdate) {
|
||||||
if ((opt[cur+1].price <= opt[cur].price) && (opt[cur+MINMATCH].price < opt[cur].price + 3/*min seq price*/)) continue;
|
/* not useful to search here if next position has same (or lower) cost */
|
||||||
|
if ( (opt[cur+1].price <= opt[cur].price)
|
||||||
|
/* in some cases, next position has same cost, but cost rises sharply after, so a small match would still be beneficial */
|
||||||
|
&& (opt[cur+MINMATCH].price < opt[cur].price + 3/*min seq price*/) )
|
||||||
|
continue;
|
||||||
} else {
|
} else {
|
||||||
|
/* not useful to search here if next position has same (or lower) cost */
|
||||||
if (opt[cur+1].price <= opt[cur].price) continue;
|
if (opt[cur+1].price <= opt[cur].price) continue;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user