On 2019-06-24 14:21, Derrick Stolee wrote:
On 6/24/2019 8:07 AM, Nathaniel Filardo wrote:
If the user is careful to mark .pack files as kept only when they
refer
to (other) kept packs, then we can rely on this when walking the
object
graph in subsequent repack operations and reduce the time and
On 2019-03-12 13:47, Derrick Stolee wrote:
On 3/12/2019 9:18 AM, Nathaniel Filardo wrote:
The sparse connectivity algorithm saves a whole lot of time when there
are UNINTERESTING trees around.
Interesting! Do you have some performance numbers to include with
this statement?
Not UNINTERESTING
2 matches
Mail list logo
