Code

History

Commits on git-commitgraph-v0.1.2805+
  1. turns out you never want to keep deltas in memorySebastian Thiel committed 6 years ago657aa2c
  2. Remove support for keeping compressed memory to reduce the index sizeSebastian Thiel committed 6 years ago1e2ec7e
  3. don't cause re-allocs of the compression bufferSebastian Thiel committed 6 years ago2bb6fd2
  4. document miniz-oxide performance opportunity instead of trying to fix itSebastian Thiel committed 6 years ago31934f6
  5. Revert "FAIL: try to use a customized version of just pieces of Miniz-oxide"Sebastian Thiel committed 6 years agoea0fdb3
  6. FAIL: try to use a customized version of just pieces of Miniz-oxideSebastian Thiel committed 6 years ago9945eba
  7. dependency upgrade + updateSebastian Thiel committed 6 years agoc6692c6
  8. refactorSebastian Thiel committed 6 years ago133e3ba
  9. Let go of another handbreak - decompression is much faster nowSebastian Thiel committed 6 years agoae9dc16
  10. thanks clippySebastian Thiel committed 6 years ago393067d
  11. Use call to produce the resolver, allowing to delay opening a file mapping…Sebastian Thiel committed 6 years agodd30e8d
  12. Fix actual memory violation (thanks to unsafe code)Sebastian Thiel committed 6 years agoc44c5e1
  13. thanks clippySebastian Thiel committed 6 years ago1083a0b
  14. Reduce memory consumptionSebastian Thiel committed 6 years ago6d1a7a1
  15. Unfortunately working with an optional for data is unwieldy, let's use defaultSebastian Thiel committed 6 years ago12bbca0
  16. Tree can now be used as sole data structure, collecting all resultsSebastian Thiel committed 6 years ago3e52d6f
  17. preparation for allowing reuse of the tree data structureSebastian Thiel committed 6 years agof565512
  18. refactorSebastian Thiel committed 6 years ago9c4bc0a
  19. And it works! The new algorithm is sleeker, and really wants to be backported…Sebastian Thiel committed 6 years ago8e025b1
  20. thanks, clippy…Sebastian Thiel committed 6 years ago079ce9c
  21. Basis for re-implementing core algorithm using new Tree data structureSebastian Thiel committed 6 years agobe6caf4
  22. Allow for bigger git-odb packageSebastian Thiel committed 6 years ago65f23dd
  23. refactorSebastian Thiel committed 6 years ago290c29a
  24. incorporate proper filtering of basesSebastian Thiel committed 6 years ago0880998
  25. overhauled iterator logic, still missing 'is_root' filterSebastian Thiel committed 6 years ago2bfbae1
  26. First impl of the Iterator shows it's 'unknown' what a root node isSebastian Thiel committed 6 years ago3f32938
  27. sketch on how children access could look likeSebastian Thiel committed 6 years ago16a35df
  28. How a referenced version would look like…Sebastian Thiel committed 6 years agoe36021d
  29. refactorSebastian Thiel committed 6 years ago62a01fe
  30. more experimentation towards a safe tree data structure…Sebastian Thiel committed 6 years agod907ce8
  31. first stab at new Tree datastructure…Sebastian Thiel committed 6 years ago85d7579
  32. Safety for handling base pack offsetsSebastian Thiel committed 6 years ago17d8375
  33. …but there seem to be issues with the kernel pack…Sebastian Thiel committed 6 years agocc147bc
  34. minor fixes after first local tests - it's up to twice as fast!!Sebastian Thiel committed 6 years ago43c7fd1
  35. quick and dirty impl of lean command-line for index-from-packSebastian Thiel committed 6 years ago9660bbf