| commit | 02e665ce491296245f474dafdc02d47a6c8afa86 | |
| author | David Kastrup <dak@gnu.org> | |
| Sat, 8 Sep 2007 21:25:55 +0000 (8 23:25 +0200) | ||
| committer | Junio C Hamano <gitster@pobox.com> | |
| Mon, 10 Sep 2007 00:16:49 +0000 (9 17:16 -0700) | ||
| tree | a47e82077da6f80abc52ccc898e5f03f883c3417 | treesnapshot (tar.gz zip) |
| parent | d2100860fd67dec6474157697888caaa0a0f51d0 | commitdiff |
diff-delta.c: Rationalize culling of hash buckets
The previous hash bucket culling resulted in a somewhat unpredictable
number of hash bucket entries in the order of magnitude of HASH_LIMIT.
Replace this with a Bresenham-like algorithm leaving us with exactly
HASH_LIMIT entries by uniform culling.
Signed-off-by: David Kastrup <dak@gnu.org>
Acked-by: Nicolas Pitre <nico@cam.org>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
The previous hash bucket culling resulted in a somewhat unpredictable
number of hash bucket entries in the order of magnitude of HASH_LIMIT.
Replace this with a Bresenham-like algorithm leaving us with exactly
HASH_LIMIT entries by uniform culling.
Signed-off-by: David Kastrup <dak@gnu.org>
Acked-by: Nicolas Pitre <nico@cam.org>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
| diff-delta.c | diffblobblamehistory |