From: Nicolas Pitre <nico@fluxnic.net>
Date: Tue, 27 Aug 2013 16:52:03 GMT
Subject: Re: [PATCH 10/23] pack v4: tree object encoding
Message-ID: <alpine.LFD.2.03.1308271250540.14472@syhkavp.arg>
In-Reply-To: <xmqqtxibdtpy.fsf@gitster.dls.corp.google.com>

On Tue, 27 Aug 2013, Junio C Hamano wrote:

> Nicolas Pitre <nico@fluxnic.net> writes:
> 
> > This goes as follows:
> >
> > - Number of tree entries: variable length encoded.
> >
> > Then for each tree entry:
> >
> > - Path component reference: variable length encoded index into the path
> >   string dictionary table which also covers the entry mode.  To make the
> >   overall encoding efficient, the author table is already sorted by usage
> >   frequency so the most used names are first and require the shortest
> >   index encoding.
> 
> s/author table/tree path table/, I think. The reason why it is a
> good idea to sort these tables by use count applies equally to both
> the author table and the tree path table, though.

Exact.  This was a cut and paste mistake.


Nicolas