git.99rst.org / git.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d210086)
diff-delta.c: Rationalize culling of hash buckets
authorDavid Kastrup <redacted>
Sat, 8 Sep 2007 21:25:55 +0000 (23:25 +0200)
committerJunio C Hamano <redacted>
Mon, 10 Sep 2007 00:16:49 +0000 (17:16 -0700)
commit02e665ce491296245f474dafdc02d47a6c8afa86
treea47e82077da6f80abc52ccc898e5f03f883c3417tree | snapshot
parentd2100860fd67dec6474157697888caaa0a0f51d0commit | diff
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 <redacted>
Acked-by: Nicolas Pitre <redacted>
Signed-off-by: Junio C Hamano <redacted>
diff-delta.c diff | blob | history
git clone https://git.99rst.org/PROJECT