| commit | 7d83b630d54a66911e64079979e7cd85e0fe2c9a | |
| author | Uoti Urpala <uau@symbol.nonexistent.invalid> | |
| Sun, 3 Aug 2008 21:57:44 +0000 (4 00:57 +0300) | ||
| committer | Uoti Urpala <uau@glyph.nonexistent.invalid> | |
| Sun, 10 Apr 2011 13:03:35 +0000 (10 16:03 +0300) | ||
| tree | 972ced3bb42b79fe600372f2f905a25b127dae7a | treesnapshot (tar.gz zip) |
| parent | 6d30b479f75f7133874a5658cb1fa34884a5448c | commitdiff |
Store pickaxe per-file match counts in a hash
The count of string matches was calculated at least twice for most
file revisions: once when comparing the count with that of the
previous commit and again when comparing with the next commit. Store
the value in a hash to avoid recalculating. The hash contents are
never freed and are static in diffcore-pickaxe.c so it only works if
the process doesn't search for multiple keys (bad style but that's how
most of git seems to be coded).
The count of string matches was calculated at least twice for most
file revisions: once when comparing the count with that of the
previous commit and again when comparing with the next commit. Store
the value in a hash to avoid recalculating. The hash contents are
never freed and are static in diffcore-pickaxe.c so it only works if
the process doesn't search for multiple keys (bad style but that's how
most of git seems to be coded).
| diffcore-pickaxe.c | diffblobblamehistory |