Commits

Commit:
430fd565ceaf00f09c92d9a11ae84dbe9033e4c7
From:
Stefan Sperling <stsp@stsp.name>
Date:
remove redundant check: we already know that parent is in the pack
diff | patch | tree
Commit:
0c2ef7d5d21625100807b4ee37bc74831e351a4b
From:
Stefan Sperling <stsp@stsp.name>
Date:
fix missing commit parent edges in commit graph
diff | patch | tree
Commit:
4c3333066c370989f34d96881f559e3eee03391d
From:
Stefan Sperling <stsp@stsp.name>
Date:
list missing trees more efficiently
diff | patch | tree
Commit:
fc5f2bb353e14a8a06d1cd6bda751d2e02ac8915
From:
Stefan Sperling <stsp@stsp.name>
Date:
show progress output while searching through packed trees
diff | patch | tree
Commit:
4f62e31e79cb1498c62ca45b0b9d9d72ef03a334
From:
Stefan Sperling <stsp@stsp.name>
Date:
use a faster way to find all blob object IDs
diff | patch | tree
Commit:
d9e70c37d9c1f727bf5c52714f64189717706d01
From:
Stefan Sperling <stsp@stsp.name>
Date:
cache bitarrays for recursive tree dependencies
diff | patch | tree
Commit:
607a92048c2b18c77d6930d181b8326ec9158074
From:
Stefan Sperling <stsp@stsp.name>
Date:
progress reporting improvements
diff | patch | tree
Commit:
b1e497a6d0bae8ab541b45d1ffcd4b58be2c5b25
From:
Stefan Sperling <stsp@stsp.name>
Date:
swap tree entry bitarrays out to disk if needed
diff | patch | tree
Commit:
568a6ca9ddd97a61bce58ce17be126c949f0c071
From:
Stefan Sperling <stsp@stsp.name>
Date:
compress bitarrays which represent tree entries
diff | patch | tree
Commit:
b97647df3d1b5227a81c4c5f301f759bd0cac936
From:
Stefan Sperling <stsp@stsp.name>
Date:
reduce debug log noise again
diff | patch | tree
Commit:
caa004fc71ad2f2e0667e7a1957ca06c86e730a0
From:
Stefan Sperling <stsp@stsp.name>
Date:
switch from graphs to bitarrays for tree entries
diff | patch | tree
Commit:
c902a02aaa278d1ecbb79ad2ccb2dcaf6f2523da
From:
Stefan Sperling <stsp@stsp.name>
Date:
switch from bitstring to using bitarray directly
diff | patch | tree
Commit:
891dbef691a3e5a6102a1383ca2576ecd3e5e589
From:
Stefan Sperling <stsp@stsp.name>
Date:
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.
diff | patch | tree
Commit:
76be9a1488e60ace3c035cd20d62c82a4c7ca9f5
From:
Stefan Sperling <stsp@stsp.name>
Date:
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.
diff | patch | tree
Commit:
6696db87df596de8919995f7239e85752ae6fba1
From:
Stefan Sperling <stsp@stsp.name>
Date:
clear lists of added vertices
diff | patch | tree
Commit:
37fcc2f01565ecba5b08bf3e04cfb7ca4cb51bad
From:
Stefan Sperling <stsp@stsp.name>
Date:
make graph file format somewhat configurable
diff | patch | tree
Commit:
730a71f50c224102e5e26481f18a7f2773fd9167
From:
Stefan Sperling <stsp@stsp.name>
Date:
debug
diff | patch | tree
Commit:
310666ca1b675f5b9ea18bd71bbda18b9f0da97d
From:
Stefan Sperling <stsp@stsp.name>
Date:
improve tree crawl efficiency and tweak progress display
diff | patch | tree
Commit:
2d1a69eeca244bc64d106fff5b1a4e25fa1e1728
From:
Stefan Sperling <stsp@stsp.name>
Date:
avoid compression
diff | patch | tree
Commit:
51b5b0c65c78fcde4d9df304a0783a8ef7fa4b87
From:
Stefan Sperling <stsp@stsp.name>
Date:
store trees in subgraphs which can be swapped out to a temporary file This should reduce memory requirements significantly. Storing all trees of all commits with all tree entries in a single igraph uses too much memory to load repositories such as git.git.
diff | patch | tree
Commit:
a77c88011f70493a154286133edefe6cf85fec7e
From:
Stefan Sperling <stsp@stsp.name>
Date:
avoid multiple lookups of the same ID in the pack index
diff | patch | tree
Commit:
6c6f6338fe67e530e3ed5171fc67ad4754545d37
From:
Stefan Sperling <stsp@stsp.name>
Date:
use a bitstring to keep track of traversed object IDs The aim is to reduce the memory footprint of object graph construction
diff | patch | tree
Commit:
7b0e91db76ad97ace322f6ffbb46cfa524e6eb9e
From:
Stefan Sperling <stsp@stsp.name>
Date:
try using a set() instead of commits.keys() to track traversed commits
diff | patch | tree
Commit:
0bfa06e59123c574243c899182ffa6cc208efd09
From:
Stefan Sperling <stsp@stsp.name>
Date:
don't add graph edges to parent commits missing from pack file
diff | patch | tree
Commit:
66e8444bc467881687c000565173eb3e8afac02d
From:
Stefan Sperling <stsp@stsp.name>
Date:
remove incorrect check for missing objects
diff | patch | tree