Code

History

Commits on git-commitgraph-v0.0.0 to git-odb/tests/pack35+
  1. better progress for Sha1 of pack and indexSebastian Thiel committed 6 years ago310a59e
  2. Implement optionally keeping the compressed bytesSebastian Thiel committed 6 years agofc26914
  3. first step towards more control over allocation in iteratorSebastian Thiel committed 6 years agocacf76c
  4. never keep decompressed bytes while streaming…Sebastian Thiel committed 6 years ago65c3856
  5. Fix various issues related to 64bit offset support when writing indices…Sebastian Thiel committed 6 years agoda31694
  6. fix unit tests: actually sort the directory entries :DSebastian Thiel committed 6 years agob69717a
  7. Add convenience method to get a new bundle for the index/data just writtenSebastian Thiel committed 6 years agoa6d74ad
  8. bundle write with a given directorySebastian Thiel committed 6 years ago7f29c73
  9. first unit test for bundle writingSebastian Thiel committed 6 years ago74bda39
  10. organize object type comparisons by probability…Sebastian Thiel committed 6 years ago19a5d94
  11. count object types as wellSebastian Thiel committed 6 years agoe04a8d1
  12. remove petgraph entirelySebastian Thiel committed 6 years ago70ba33a
  13. compute statistics for indexed pack verifySebastian Thiel committed 6 years ago3d31c23
  14. keep all metadata per object needed to compute the usual statisticsSebastian Thiel committed 6 years ago961b85e
  15. indexed traversal now works, in theory, but needs error handlingSebastian Thiel committed 6 years ago86f8400
  16. refactorSebastian Thiel committed 6 years ago2bbfd82
  17. refactorSebastian Thiel committed 6 years agoafe5e44
  18. and now it works!Sebastian Thiel committed 6 years agof14e10e
  19. generalize tree iterationSebastian Thiel committed 6 years agofdc06de
  20. support for building a tree from offsetsSebastian Thiel committed 6 years ago95858bc
  21. refactorSebastian Thiel committed 6 years ago8cfe025
  22. Use bigger buffers when reading from disk.Sebastian Thiel committed 6 years agoe76e4eb
  23. Only keep decompressed bytes of base objects…Sebastian Thiel committed 6 years agob39ad89
  24. remove memory mode entirely (and some complexity with it)Sebastian Thiel committed 6 years ago8812e91
  25. turns out you never want to keep deltas in memorySebastian Thiel committed 6 years ago657aa2c
  26. Remove support for keeping compressed memory to reduce the index sizeSebastian Thiel committed 6 years ago1e2ec7e
  27. Use call to produce the resolver, allowing to delay opening a file mapping…Sebastian Thiel committed 6 years agodd30e8d
  28. Tree can now be used as sole data structure, collecting all resultsSebastian Thiel committed 6 years ago3e52d6f
  29. And it works! The new algorithm is sleeker, and really wants to be backported…Sebastian Thiel committed 6 years ago8e025b1
  30. refactorSebastian Thiel committed 6 years ago62a01fe
  31. more experimentation towards a safe tree data structure…Sebastian Thiel committed 6 years agod907ce8
  32. first stab at new Tree datastructure…Sebastian Thiel committed 6 years ago85d7579
  33. refactorSebastian Thiel committed 6 years ago77b3c21
  34. refactorSebastian Thiel committed 6 years agofb23d15
  35. refactorSebastian Thiel committed 6 years ago7da7e08