Re: [PATCH 0/3] pack-bitmap: boundary-based bitmap traversal
- From
Junio C Hamano <gitster@pobox.com>
- Date
- Apr 25, 2023, 18:02 UTC
- Message-ID
- <xmqqy1mfzvpq.fsf@gitster.g>
- In-Reply-To
- <cover.1682380788.git.me@ttaylorr.com>
Taylor Blau <me@ttaylorr.com> writes:
Show 11 quoted lines
> This improves many cases where using bitmaps was significantly *slower* > than regular, non-bitmap traversal. In some instances, using bitmaps is > still slower than the non-bitmap case, but it is a substantial > improvement over the classic bitmap walk. > ... > In a large repository on GitHub.com, the timings to compute the objects > unique to "master", as in: > > $ git rev-list --count --objects master --not --exclude=master --branches > > improve as follows:
Curious---when would it be significantly faster to use bitmaps? "Most of the time"? "In not-too-large repository?"