Code

History

Commits on git-commitgraph-v0.1.1770+
  1. support for progressSebastian Thiel committed 6 years ago62108fd
  2. support for thread local storage in callbacksSebastian Thiel committed 6 years ago1dad088
  3. support for learning about the objects slice in the packSebastian Thiel committed 6 years agofaec782
  4. And even more caapbilities are required to make tree traversal work nativelySebastian Thiel committed 6 years ago90523bb
  5. refactorSebastian Thiel committed 6 years ago2bbfd82
  6. refactorSebastian Thiel committed 6 years agoefa7cd8
  7. first steps towards actually using the new tree traversal during verificationSebastian Thiel committed 6 years ago785b0ff
  8. thanks clippySebastian Thiel committed 6 years ago44b20de
  9. refactorSebastian Thiel committed 6 years agoafe5e44
  10. refactorSebastian Thiel committed 6 years agofcc660d
  11. reduce memory usage for index considerablySebastian Thiel committed 6 years agoaa802be
  12. and now it works!Sebastian Thiel committed 6 years agof14e10e
  13. use new traversal in index writing, but it doesn't work yetSebastian Thiel committed 6 years ago0dd5570
  14. refactorSebastian Thiel committed 6 years ago4ff69c6
  15. refactorSebastian Thiel committed 6 years ago6cbb7cc
  16. generalized tree traversal can theoretically workSebastian Thiel committed 6 years ago64158e0
  17. make traversal part of the tree for greater ease of useSebastian Thiel committed 6 years ago6629e30
  18. prepare flexible traversal on decompressed objectsSebastian Thiel committed 6 years ago7707ea6
  19. refactorSebastian Thiel committed 6 years agodeea36c
  20. refactorSebastian Thiel committed 6 years ago83a0102
  21. refactorSebastian Thiel committed 6 years agob77d148
  22. generalize tree iterationSebastian Thiel committed 6 years agofdc06de
  23. Also index using the new tree impl during verify (prepare replacement)Sebastian Thiel committed 6 years ago92039b0
  24. refactorSebastian Thiel committed 6 years agoe3ff6af
  25. support for building a tree from offsetsSebastian Thiel committed 6 years ago95858bc
  26. refactorSebastian Thiel committed 6 years ago8cfe025
  27. refactorSebastian Thiel committed 6 years agobb9e518
  28. count sorting into the progress, 7.5 mio entries takes a momentSebastian Thiel committed 6 years ago2fc4cd8
  29. Now it's probably as fast as it gets without miniz-oxide adjustmentsSebastian Thiel committed 6 years ago4cb091b
  30. Use bigger buffers when reading from disk.Sebastian Thiel committed 6 years agoe76e4eb
  31. Only keep decompressed bytes of base objects…Sebastian Thiel committed 6 years agob39ad89
  32. remove memory mode entirely (and some complexity with it)Sebastian Thiel committed 6 years ago8812e91
  33. turns out you never want to keep deltas in memorySebastian Thiel committed 6 years ago657aa2c
  34. Remove support for keeping compressed memory to reduce the index sizeSebastian Thiel committed 6 years ago1e2ec7e
  35. don't cause re-allocs of the compression bufferSebastian Thiel committed 6 years ago2bb6fd2