On Sat, Apr 30, 2016 at 1:46 AM, David Turner wrote:
> On Thu, 2016-04-28 at 11:58 -0700, Junio C Hamano wrote:
>> David Turner writes:
>>
>> > From: Nguyễn Thái Ngọc Duy
>> > ...
>> > The biggest gain is not having to verify the trailing SHA-1, which
>> > takes lots of time especially on large
David Turner writes:
> Per working tree/repository, yes (not quite per-index because working
> trees with split indexes have two).
Heh, I consider "split index" merely an implementation detail of a
(logical) single index file that happens to be represented with two
physical files.
Anyway, thank
On Thu, 2016-04-28 at 11:58 -0700, Junio C Hamano wrote:
> David Turner writes:
>
> > From: Nguyễn Thái Ngọc Duy
> > ...
> > The biggest gain is not having to verify the trailing SHA-1, which
> > takes lots of time especially on large index files. But this also
> > opens doors for further optimi
David Turner writes:
> From: Nguyễn Thái Ngọc Duy
> ...
> The biggest gain is not having to verify the trailing SHA-1, which
> takes lots of time especially on large index files. But this also
> opens doors for further optimiztions:
optimizAtion
> Git can poke the daemon via unix domain socket
From: Nguyễn Thái Ngọc Duy
Instead of reading the index from disk and worrying about disk
corruption, the index is cached in memory (memory bit-flips happen
too, but hopefully less often). The result is faster read. Read time
is reduced by 70%.
The biggest gain is not having to verify the traili
5 matches
Mail list logo