| commit | 33aa9a0b65e04bee685efdcdce8bf53899a65208 | |
| author | Petr Tesarik <petr@tesarici.cz> | |
| Mon, 1 Oct 2012 16:15:06 +0000 (1 18:15 +0200) | ||
| committer | Petr Tesarik <petr@tesarici.cz> | |
| Mon, 1 Oct 2012 17:01:33 +0000 (1 19:01 +0200) | ||
| tree | f41a13a2e8496b5ae4e16ba6b870937908079740 | treesnapshot (tar.gz zip) |
| parent | 4ee1a80e5f3bdad6c8c5161ff011a3103bcd4def | commitdiff |
Split Boyer-Moore forward and backward search
While the algorithm is the same, it is better to write two functions
to allow better optimization of this innermost loop.
While the algorithm is the same, it is better to write two functions
to allow better optimization of this innermost loop.
| libhed/file.c | diffblobblamehistory |