Re: [PATCH WIP] sha1-lookup: make selection of 'middle' less aggressive
- From
- Marco Costalba <mcostalba@gmail.com>
- Date
- Dec 30, 2007, 22:04 UTC
- Message-ID
- <e5bfff550712301404g273dd092w9b36b48d94ed1e70@mail.gmail.com>
- In-Reply-To
- <7vodc77t0o.fsf@gitster.siamese.dyndns.org>
On Dec 30, 2007 10:49 PM, Junio C Hamano <gitster@pobox.com> wrote:
Show 6 quoted lines
> Linus Torvalds <torvalds@linux-foundation.org> writes: > > > The cost of the key comparison done in each round is > insignificant compared to the actual cost of accessing the > object data through zlib.
Sorry to ask, but just out of curiosity, what were the reasons to choose zlib compression algorithm among the possible ones?
There is a thread where this has been discussed in the past? Sorry to ask but I didn't find such a thread myself.
Thanks Marco