1. 21 Jul, 2009 2 commits
  2. 20 Jul, 2009 2 commits
  3. 17 Jul, 2009 5 commits
  4. 16 Jul, 2009 4 commits
  5. 15 Jul, 2009 2 commits
  6. 14 Jul, 2009 3 commits
  7. 13 Jul, 2009 1 commit
  8. 22 Jun, 2009 1 commit
  9. 20 Jun, 2009 1 commit
  10. 16 Jun, 2009 1 commit
  11. 16 Apr, 2009 3 commits
  12. 14 Apr, 2009 1 commit
    • Timo Teräs's avatar
      state: rework changeset calculation algorithm · a23f6f4a
      Timo Teräs authored
      Calculate changesets directly by stabilizating the package graph instead of
      recalculating the whole graph and then diffing (similar approach as seen
      in 'smart' package manager). The algorithm is not complete: defferred
      search space forking is missing. So you don't always get a solution on
      complex graphs.
      
      Benefits:
      - usually the search state tree is smaller (less memory used)
      - speed relational to changeset size, not database size (usually faster)
      - touch only packages related to users request (can work on partitially
        broken state; upgrades only necessary packages, fixes #7)
      
      Also implemented:
      - command prompt to confirm operation if packages are deleted or downgraded
      - requesting deletion of package suggests removal of all packages depending
        on the package being removed (you'll get list of packages that also get
        removed if you want package X removed)
      - option --simulate to see what would have been done (mainly for testing)
      - an untested implementation of versioned dependencies and conflicts
      
      A lot has changed, so expect new bugs too.
      a23f6f4a
  13. 17 Mar, 2009 1 commit
  14. 27 Feb, 2009 1 commit
  15. 21 Jan, 2009 2 commits
  16. 20 Jan, 2009 1 commit
  17. 16 Jan, 2009 1 commit
  18. 13 Jan, 2009 2 commits
  19. 11 Jan, 2009 1 commit
  20. 09 Jan, 2009 1 commit
  21. 08 Jan, 2009 2 commits
  22. 07 Jan, 2009 1 commit
  23. 06 Jan, 2009 1 commit