Skip to content
Snippets Groups Projects
This project is mirrored from https://github.com/haskell/Cabal. Pull mirroring updated .
  1. Mar 04, 2016
    • Andres Löh's avatar
      Merge branch 'grayjay-backjumping-space-leak' · f78981ac
      Andres Löh authored and Mikhail Glushenkov's avatar Mikhail Glushenkov committed
      (cherry picked from commit 2854bcb3)
      f78981ac
    • kristenk's avatar
      Fix space leaks in dependency solver logging. · 36c153cb
      kristenk authored and Mikhail Glushenkov's avatar Mikhail Glushenkov committed
      This commit removes references to the solver log that prevented it from being
      garbage collected.  It also forces evaluation of the current level and variable
      stack in 'Message.showMessages'.
      
      (cherry picked from commit 37f28f23)
      36c153cb
    • Mikhail Glushenkov's avatar
      Changelog update. · 2739ed71
      Mikhail Glushenkov authored
      (cherry picked from commit d137c93e)
      2739ed71
    • Andres Löh's avatar
      Fix debugging output for infinite backjumps. · 915f6f83
      Andres Löh authored and Mikhail Glushenkov's avatar Mikhail Glushenkov committed
      Previously, a setting of `--max-backjumps=-1` was reported in
      the debug output as `0`. But `0` has a very different meaning,
      and that is confusing.
      
      (cherry picked from commit 8614859d)
      915f6f83
    • Mikhail Glushenkov's avatar
      Changelog update. · 40e36233
      Mikhail Glushenkov authored
      [ci skip]
      40e36233
    • Mikhail Glushenkov's avatar
      Restore the 'Eq AllowNewer' instance. · dd6f20d9
      Mikhail Glushenkov authored
      (cherry picked from commit 28b08d6b)
      dd6f20d9
    • Andres Löh's avatar
      Improve goal reorder heuristics. · 577911d3
      Andres Löh authored and Mikhail Glushenkov's avatar Mikhail Glushenkov committed
      This change primarily does two things:
      
      1. For `--reorder-goals`, we use a dedicated datatype `Degree`
         rather than an `Int` to compute the approximate branching
         degree. We map 0 and 1 to the same value. We then use a
         lazy ordering and a shortcutting minimum function to look
         for the "best" goal.
      
         The motivation here is that we do not want to spend
         unnecessary work. Following any goal that has 0 or 1 as degree
         cannot really be "wrong", so we should not look at any others
         and waste time.
      
         This will still not always make the use of `--reorder-goals`
         better than not using it, but it will reduce the overhead
         introduced by it.
      
      2. We use partitioning rather than sorting for most of the other
         goal reordering heuristics that are active in all situations.
         I think this is slightly more straightforward and also slightly
         more efficient, whether `--reorder-goals` is used or not.
      
      I have run some preliminary performance comparisons and they
      seem to confirm that in both cases separately (with or without
      `--reorder-goals`), these changes are a relative improvement
      over the status quo. I will run additional tests before
      merging this into master.
      
      (cherry picked from commit 150d6ca9)
      577911d3
  2. Mar 03, 2016
  3. Mar 02, 2016
  4. Mar 01, 2016
  5. Feb 27, 2016
  6. Feb 26, 2016
  7. Feb 24, 2016
  8. Feb 22, 2016
Loading