| Age | Commit message (Expand) | Author | Files | Lines |
|---|
| 2012-03-23 | [curses] Hack to prevent debug messages dumping to the screen | Daniel Hartwig | 1 | -1/+3 |
| 2010-05-28 | Transition from log4cxx to the new logging framework. | Daniel Burrows | 1 | -21/+23 |
| 2010-04-21 | Rename the log4cxx namespace to logging. | Daniel Burrows | 1 | -11/+11 |
| 2010-04-11 | Remove all traces of the nonfunctional "stupid elimination" algorithm. | Daniel Burrows | 1 | -16/+1 |
| 2010-04-09 | Fix a potential performance problem: the cost of solver sets was being undere... | Daniel Burrows | 1 | -6/+26 |
| 2010-04-09 | Refactor the problem resolver to move all the checks of whether costs make a ... | Daniel Burrows | 1 | -16/+41 |
| 2010-04-09 | Terminology change: replace "tier operation" with "cost" everywhere. | Daniel Burrows | 1 | -386/+387 |
| 2010-04-09 | Restructure the source tree to move tier_ related code into files whose name ... | Daniel Burrows | 1 | -3/+2 |
| 2010-04-08 | Yank out the "tier" type and just use operations instead. | Daniel Burrows | 1 | -91/+60 |
| 2010-04-08 | Add support for attaching a cost to unresolved recommends. | Daniel Burrows | 1 | -3/+8 |
| 2010-03-12 | Introduce a new method on the resolver that tests whether a tier should cause... | Daniel Burrows | 1 | -21/+56 |
| 2010-03-11 | Attempt to optimize the resolver by not creating unnecessary intermediate tie... | Daniel Burrows | 1 | -14/+18 |
| 2010-03-05 | Overhaul the resolver to distinguish between tiers and changes to tiers; this... | Daniel Burrows | 1 | -292/+448 |
| 2010-02-15 | Document why we choose between two different algorithms to look for new promo... | Daniel Burrows | 1 | -0/+14 |
| 2010-01-23 | Rewire the rest of the dependency solver to account for the new tier type. | Daniel Burrows | 1 | -52/+2 |
| 2009-11-17 | Have the resolver ignore unresolved dependencies that were unresolved before ... | Daniel Burrows | 1 | -2/+26 |
| 2009-07-28 | Always use make_shared to construct shared pointers. | Daniel Burrows | 1 | -1/+2 |
| 2009-07-15 | Don't waste time building information about a solver set if nothing would be ... | Daniel Burrows | 1 | -10/+33 |
| 2009-07-10 | Merge with backout. | Daniel Burrows | 1 | -30/+272 |
| 2009-07-10 | Eliminating the use of hash tables to save memory: backed out changeset 7c43f... | Daniel Burrows | 1 | -2/+2 |
| 2009-07-10 | Merge backout. | Daniel Burrows | 1 | -11/+82 |
| 2009-07-10 | Eliminating the use of hash tables to save memory: backed out changeset 8ff97... | Daniel Burrows | 1 | -60/+45 |
| 2009-07-10 | Eliminating the use of hash tables to save memory: backed out changeset 13ac7... | Daniel Burrows | 1 | -57/+42 |
| 2009-07-07 | Switch the unresolved dep set representation to a boost::unordered_map. | Daniel Burrows | 1 | -42/+57 |
| 2009-07-07 | When increasing the tier of a solver that's newly deferred, only increase exa... | Daniel Burrows | 1 | -7/+9 |
| 2009-07-07 | Fix recompute_step_tier() to correctly compute the tier. | Daniel Burrows | 1 | -4/+73 |
| 2009-07-07 | Fix the sanity-check stuff to account for recent changes to the resolver code. | Daniel Burrows | 1 | -45/+60 |
| 2009-07-07 | Log the semantic content of deferral/validity expressions rather than object ... | Daniel Burrows | 1 | -16/+158 |
| 2009-07-07 | Add an extra sanity-check that all solvers have the right associated dependen... | Daniel Burrows | 1 | -0/+3 |
| 2009-07-06 | Hopefully fix how the number of deferred steps is counted. | Daniel Burrows | 1 | -0/+4 |
| 2009-07-06 | Put every step, even deferred ones, into "pending". | Daniel Burrows | 1 | -2/+1 |
| 2009-07-06 | When recomputing a step tier from scratch, really recompute it from scratch. | Daniel Burrows | 1 | -1/+7 |
| 2009-07-06 | When modifying a step tier, if it was previously in "pending" and it is a via... | Daniel Burrows | 1 | -0/+11 |
| 2009-07-06 | If we're trying to un-defer a solver that's embedded in a step as an action, ... | Daniel Burrows | 1 | -1/+5 |
| 2009-07-06 | Better logging when the resolver needs to retract a deferral. | Daniel Burrows | 1 | -0/+2 |
| 2009-07-05 | Reimplement choice_set in terms of boost::unordered_set. | Daniel Burrows | 1 | -2/+2 |
| 2009-07-05 | Since choice-set installations hold a reference to the set they contain, we s... | Daniel Burrows | 1 | -1/+2 |
| 2009-07-01 | Hide the representation of the solvers set from client code. | Daniel Burrows | 1 | -24/+23 |
| 2009-06-30 | Switch to boost::flyweight from the custom memoization the resolver was doing. | Daniel Burrows | 1 | -37/+31 |
| 2009-06-27 | Fix the promotion sanity-check to not claim that global promotions apply to a... | Daniel Burrows | 1 | -1/+1 |
| 2009-06-27 | When generating successors, make sure that promotions which apply to one chil... | Daniel Burrows | 1 | -0/+25 |
| 2009-06-25 | Don't treat it as an error when a solver already exists when it's added. | Daniel Burrows | 1 | -4/+1 |
| 2009-06-25 | Add sanity-checks to problemresolver.h. | Daniel Burrows | 1 | -2/+171 |
| 2009-06-24 | When looking for promotions, don't discard maximum-tier promotions. | Daniel Burrows | 1 | -15/+18 |
| 2009-06-23 | Don't consider the current version of a package to be a solver of a dependency. | Daniel Burrows | 1 | -0/+8 |
| 2009-06-23 | Fix how we determine when choices are deferred. | Daniel Burrows | 1 | -1/+15 |
| 2009-06-19 | Manage the closed set using boost::unordered_set. | Daniel Burrows | 1 | -14/+49 |
| 2009-06-19 | When a dependency is forced, don't leave the parent step hanging around in th... | Daniel Burrows | 1 | -0/+4 |
| 2009-06-19 | Tweak another log line for easier parsing. | Daniel Burrows | 1 | -1/+1 |
| 2009-06-18 | Spit out the number of actions in a step when logging the "Examining" line. | Daniel Burrows | 1 | -1/+1 |
