Code

History

Commits on git-commitgraph-v0.8.27525+
  1. refactorSebastian Thiel committed 6 years ago8cfe025
  2. refactorSebastian Thiel committed 6 years agobb9e518
  3. count sorting into the progress, 7.5 mio entries takes a momentSebastian Thiel committed 6 years ago2fc4cd8
  4. Now it's probably as fast as it gets without miniz-oxide adjustmentsSebastian Thiel committed 6 years ago4cb091b
  5. Use bigger buffers when reading from disk.Sebastian Thiel committed 6 years agoe76e4eb
  6. Only keep decompressed bytes of base objects…Sebastian Thiel committed 6 years agob39ad89
  7. remove memory mode entirely (and some complexity with it)Sebastian Thiel committed 6 years ago8812e91
  8. turns out you never want to keep deltas in memorySebastian Thiel committed 6 years ago657aa2c
  9. Remove support for keeping compressed memory to reduce the index sizeSebastian Thiel committed 6 years ago1e2ec7e
  10. don't cause re-allocs of the compression bufferSebastian Thiel committed 6 years ago2bb6fd2
  11. document miniz-oxide performance opportunity instead of trying to fix itSebastian Thiel committed 6 years ago31934f6
  12. Revert "FAIL: try to use a customized version of just pieces of Miniz-oxide"Sebastian Thiel committed 6 years agoea0fdb3
  13. FAIL: try to use a customized version of just pieces of Miniz-oxideSebastian Thiel committed 6 years ago9945eba
  14. dependency upgrade + updateSebastian Thiel committed 6 years agoc6692c6
  15. refactorSebastian Thiel committed 6 years ago133e3ba
  16. Let go of another handbreak - decompression is much faster nowSebastian Thiel committed 6 years agoae9dc16
  17. thanks clippySebastian Thiel committed 6 years ago393067d
  18. Use call to produce the resolver, allowing to delay opening a file mapping…Sebastian Thiel committed 6 years agodd30e8d
  19. Fix actual memory violation (thanks to unsafe code)Sebastian Thiel committed 6 years agoc44c5e1
  20. thanks clippySebastian Thiel committed 6 years ago1083a0b
  21. Reduce memory consumptionSebastian Thiel committed 6 years ago6d1a7a1
  22. Unfortunately working with an optional for data is unwieldy, let's use defaultSebastian Thiel committed 6 years ago12bbca0
  23. Tree can now be used as sole data structure, collecting all resultsSebastian Thiel committed 6 years ago3e52d6f
  24. preparation for allowing reuse of the tree data structureSebastian Thiel committed 6 years agof565512
  25. refactorSebastian Thiel committed 6 years ago9c4bc0a
  26. And it works! The new algorithm is sleeker, and really wants to be backported…Sebastian Thiel committed 6 years ago8e025b1
  27. thanks, clippy…Sebastian Thiel committed 6 years ago079ce9c
  28. Basis for re-implementing core algorithm using new Tree data structureSebastian Thiel committed 6 years agobe6caf4
  29. Allow for bigger git-odb packageSebastian Thiel committed 6 years ago65f23dd
  30. refactorSebastian Thiel committed 6 years ago290c29a
  31. incorporate proper filtering of basesSebastian Thiel committed 6 years ago0880998
  32. overhauled iterator logic, still missing 'is_root' filterSebastian Thiel committed 6 years ago2bfbae1
  33. First impl of the Iterator shows it's 'unknown' what a root node isSebastian Thiel committed 6 years ago3f32938
  34. sketch on how children access could look likeSebastian Thiel committed 6 years ago16a35df
  35. How a referenced version would look like…Sebastian Thiel committed 6 years agoe36021d