1. 28 Feb, 2012 2 commits
  2. 27 Feb, 2012 1 commit
  3. 24 Feb, 2012 5 commits
  4. 23 Feb, 2012 1 commit
  5. 20 Jan, 2012 1 commit
  6. 17 Jan, 2012 1 commit
    • Timo Teräs's avatar
      solver: calculate branch minimum penalty early · 12183024
      Timo Teräs authored
      Previously we would cache the penalty when evaluating the final
      solution, and adding that until we backtrack to first topology
      position changing that penalty. However, we can just keep track
      of minimum penalty based on name state, and add it. This allows
      us to bail out early on bad branches because we know in advance
      how things will turn out.
      12183024
  7. 29 Oct, 2011 1 commit
  8. 24 Oct, 2011 1 commit
  9. 14 Oct, 2011 1 commit
  10. 05 Sep, 2011 1 commit
  11. 18 Aug, 2011 1 commit
    • Timo Teräs's avatar
      solver: reintroduce install_if support · 1fb1afc5
      Timo Teräs authored
       * each package name has two sorting positions, one which causes
         install_if triggers to be run, and other for bulk dependencies
       * fix also inverted ordering of package installations
      1fb1afc5
  12. 01 Aug, 2011 1 commit
    • Timo Teräs's avatar
      solver: generate proper error messages · a5146f1b
      Timo Teräs authored
       * the solver no longer does look-ahead locking of names
         (could be possibly optimized later); instead names are now
         always ordered strictly to properly detect the package names
         which are unsolveable
       * basic error tests added, so we can see the most likely problem
         in dependencies easily
      a5146f1b
  13. 27 Jul, 2011 2 commits
  14. 26 Jul, 2011 1 commit
    • Timo Teräs's avatar
      solver: new package selection logic (which is not yet used) · 79b53d4d
      Timo Teräs authored
       * basic code for a backtracking, forward checking dependency satisfier
       * works better when there are tricky dependencies to solve
         (when can't just upgrade everything to most preferred versions)
       * the new code always evaluates all of 'world' constraints
         (old code just does incremental updates based on heuristics)
       * is probably somewhat slower than old code (probably unnoticeable
         difference in most cases)
       * makes easier to write support for provides and repository pinning
       * test applet and a bunch of test cases added which uses the new code
       * from the old feature set install_if is not yet implemented
      79b53d4d
  15. 15 Jun, 2010 3 commits
  16. 06 Nov, 2009 1 commit