diff options
| author | René Scharfe <l.s.r@web.de> | 2014-10-01 17:02:37 +0200 |
|---|---|---|
| committer | Junio C Hamano <gitster@pobox.com> | 2014-10-01 13:32:19 -0700 |
| commit | 0eb0fb889e2e7e063e7dd8cbee38af106aa195f6 (patch) | |
| tree | e58599db7b1f213bed7556af99176d1fbc089cbb /t/t0064-sha1-array.sh | |
| parent | 38d905bf585999367a24fa27645ece6fe996d6f0 (diff) | |
| download | git-0eb0fb889e2e7e063e7dd8cbee38af106aa195f6.tar.gz | |
sha1-lookup: handle duplicates in sha1_pos()rs/sha1-array-test
If the first 18 bytes of the SHA1's of all entries are the same then
sha1_pos() dies and reports that the lower and upper limits of the
binary search were the same that this wasn't supposed to happen. This
is wrong because the remaining two bytes could still differ.
Furthermore: It wouldn't be a problem if they actually were the same,
i.e. if all entries have the same SHA1. The code already handles
duplicates just fine. Simply remove the erroneous check.
Signed-off-by: Rene Scharfe <l.s.r@web.de>
Acked-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't/t0064-sha1-array.sh')
| -rwxr-xr-x | t/t0064-sha1-array.sh | 20 |
1 files changed, 20 insertions, 0 deletions
diff --git a/t/t0064-sha1-array.sh b/t/t0064-sha1-array.sh index 06549656c8..50b31ffe75 100755 --- a/t/t0064-sha1-array.sh +++ b/t/t0064-sha1-array.sh @@ -71,4 +71,24 @@ test_expect_success 'lookup non-existing entry with duplicates' ' test "$n" -lt 0 ' +test_expect_success 'lookup with almost duplicate values' ' + { + echo "append 5555555555555555555555555555555555555555" && + echo "append 555555555555555555555555555555555555555f" && + echo20 lookup 55 + } | test-sha1-array >actual && + n=$(cat actual) && + test "$n" -eq 0 +' + +test_expect_success 'lookup with single duplicate value' ' + { + echo20 append 55 55 && + echo20 lookup 55 + } | test-sha1-array >actual && + n=$(cat actual) && + test "$n" -ge 0 && + test "$n" -le 1 +' + test_done |