Code

History

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