|
|
|
|
|
by _qrpb
599 days ago
|
|
Great question! By default, with libgit2 each write to a repo (e.g. push) will create a new pack file. We have written a simple packing algorithm that runs after each write. It works like this: Choose these values: * P, pack "Planck" size, e.g. 100kB * N, branching factor, e.g. 8 After each write: 1. iterate over each pack (pack size is S) and assign each pack a class C which is the smallest integer that satisfies P * N^C > S 2. iterate variable c from 0 to the maximum value of C that you got in step 2 * if there are N packs of class c, repack them into a new pack, new pack is going to be at most of class c+1 |
|