adjust test expectations such that all tests are passing

temporarily increase pack size file limit for linux.git

add a missing log message

add existing parent commits to commit graph Ensure that parent commits already present in the archive are added to the commit graph. Otherwise we will end up with invalid parent commit references during incremental visits.

stop sending all of the trees if all blobs are missing Also try to optimize the missing deps lookup by converting to a bitarray first. Not sure if this is really faster, but it works

make the bitarray helper functions class methods, and tweak their naming

ensure that missing_releases is always defined

avoid division by zero via num_commits_total on uneventful visits

create a snapshot even if no new objects were fetched

remove redundant check: we already know that parent is in the pack

fix missing commit parent edges in commit graph

list missing trees more efficiently

show progress output while searching through packed trees

use a faster way to find all blob object IDs

cache bitarrays for recursive tree dependencies

progress reporting improvements

swap tree entry bitarrays out to disk if needed

compress bitarrays which represent tree entries

reduce debug log noise again

switch from graphs to bitarrays for tree entries

switch from bitstring to using bitarray directly

fix topolodical load test failure Clear the set of known-traversed objects before building the graph for the next commit's root-tree. Otherwise our tree graphs will be incomplete, as objects referred to via multiple commits would only be stored in the graph of one particular root-tree.

initialize 'counts' earlier to avoid spurious errors from tests If self.counts is not initialized then failing tests may produce an additional error about self.counts not existing, rather than failing on actual test assertions.

clear lists of added vertices

make graph file format somewhat configurable