| Age | Commit message (Expand) | Author | Files | Lines |
|---|
| 2009-06-09 | Added initial Spanish doc translation by Omar Campagne <ocampagne@gmail.com> | Jens Seidel | 9 | -5/+18545 |
| 2009-06-07 | Log when the resolver starts processing the pending promotions list. | Daniel Burrows | 1 | -0/+1 |
| 2009-06-07 | Proof-of-concept implementation of dep solver memoization. | Daniel Burrows | 1 | -4/+27 |
| 2009-06-07 | When dumping solver information, dump the address of the expressions attached... | Daniel Burrows | 1 | -2/+12 |
| 2009-06-07 | Fix operator< on dep_solvers objects. | Daniel Burrows | 1 | -5/+1 |
| 2009-06-07 | Be more careful about setting validity conditions on solvers. | Daniel Burrows | 1 | -6/+13 |
| 2009-06-07 | Implement operator< on dep_solvers structures and on solver_information. | Daniel Burrows | 1 | -0/+43 |
| 2009-06-07 | Make imm::list iterators proper models of ForwardIterator, suitable for use w... | Daniel Burrows | 1 | -0/+14 |
| 2009-06-07 | Write an operator< for immlists that is a lexicographical comparison. | Daniel Burrows | 1 | -0/+8 |
| 2009-06-07 | Don't attempt to track tier validity at the solver level; instead, when a pro... | Daniel Burrows | 4 | -122/+216 |
| 2009-06-07 | Be careful whenever iterating over a choice-indexed set/map to always put dep... | Daniel Burrows | 1 | -9/+12 |
| 2009-06-07 | When increasing the tier of a solver, make sure to preserve dependency inform... | Daniel Burrows | 1 | -1/+1 |
| 2009-06-07 | Better logging of what happens to solver sets. | Daniel Burrows | 1 | -11/+17 |
| 2009-06-06 | When striking a choice, remove it from the step's index of solvers. | Daniel Burrows | 1 | -0/+4 |
| 2009-06-06 | Only modify the tier of a solver if it actually changed. | Daniel Burrows | 1 | -17/+25 |
| 2009-06-06 | Don't try to insert empty promotions into the promotion set. | Daniel Burrows | 1 | -1/+3 |
| 2009-06-06 | Only apply promotions to all the steps in the graph if they're new. | Daniel Burrows | 1 | -2/+9 |
| 2009-06-06 | Complain if we actually process a dependency with no solvers. | Daniel Burrows | 1 | -0/+3 |
| 2009-06-06 | Ensure that the first time we add a successor to a step, we do not update the... | Daniel Burrows | 1 | -1/+1 |
| 2009-06-06 | Write a simple routine that can be invoked to dump the structure of the searc... | Daniel Burrows | 1 | -0/+39 |
| 2009-06-06 | Fill in the "reason" field of steps when they're generated. | Daniel Burrows | 1 | -0/+1 |
| 2009-06-06 | Merge with head. | Daniel Burrows | 8 | -627/+485 |
| 2009-06-06 | Only generate entries in the global reverse index of steps when a choice is f... | Daniel Burrows | 2 | -158/+180 |
| 2009-06-06 | Correctly fill in the child link in the parent step when a new step is genera... | Daniel Burrows | 1 | -0/+2 |
| 2009-06-06 | Add explicit dependencies of resolver test stuff on the resolver headers. | Daniel Burrows | 1 | -0/+3 |
| 2009-06-06 | When checking whether a choice has a dependency, only do that test for instal... | Daniel Burrows | 1 | -1/+1 |
| 2009-06-06 | Add support in choice_set for retrieving the choice, if any, that the set con... | Daniel Burrows | 1 | -3/+29 |
| 2009-06-06 | Add a convenience routine in choice_indexed_map that checks whether a map con... | Daniel Burrows | 1 | -0/+21 |
| 2009-06-06 | Log a warning when generating successors if the input choice doesn't have a d... | Daniel Burrows | 1 | -0/+5 |
| 2009-06-06 | When generating successors, refer to the parent by index, not by address. | Daniel Burrows | 1 | -4/+5 |
| 2009-06-06 | Add a sanity-check to ensure that we don't try to mark a step as a clone of i... | Daniel Burrows | 1 | -1/+1 |
| 2009-06-05 | More typos | Christian Perrier | 1 | -3/+3 |
| 2009-06-05 | Put the old handling of "forced" resolutions back in. | Daniel Burrows | 1 | -46/+65 |
| 2009-06-04 | More logging in the test code. | Daniel Burrows | 1 | -1/+4 |
| 2009-06-04 | Split the "process a step and generate successors" logic into a separate rout... | Daniel Burrows | 1 | -72/+80 |
| 2009-06-04 | Don't crash when creating a deferral expression. | Daniel Burrows | 1 | -1/+2 |
| 2009-06-04 | Only start a new search if nothing has been processed, ever. | Daniel Burrows | 1 | -4/+3 |
| 2009-06-04 | Don't take into account whether choices have attached dependencies when check... | Daniel Burrows | 1 | -4/+0 |
| 2009-06-04 | Log at the start of testInitialState. | Daniel Burrows | 1 | -0/+2 |
| 2009-06-04 | When applying an incipient promotion, use the promotions's choice rather than... | Daniel Burrows | 1 | -16/+10 |
| 2009-06-04 | Add support for writing a choice_indexed_map to a std::ostream. | Daniel Burrows | 1 | -1/+43 |
| 2009-06-04 | Slightly more logging of the process of striking a solver from a step. | Daniel Burrows | 1 | -0/+4 |
| 2009-06-04 | "Bless" solutions that the resolver has decided to return, to prevent them fr... | Daniel Burrows | 3 | -2/+71 |
| 2009-06-04 | Strip out more old, unused code. | Daniel Burrows | 1 | -361/+0 |
| 2009-06-04 | Fix operator<< for promotions. | Daniel Burrows | 1 | -1/+3 |
| 2009-06-04 | Automated merge with http://hg.debian.org/hg/aptitude/head | Christian Perrier | 12 | -99/+236 |
| 2009-06-03 | Actually store the solver that caused an incipient promotion when we find one. | Daniel Burrows | 1 | -2/+12 |
| 2009-06-03 | Invoke process_pending_promotions() after adding a new promotion to the globa... | Daniel Burrows | 1 | -0/+2 |
| 2009-06-03 | Log when we add a full-solution bonus to a step's score. | Daniel Burrows | 1 | -1/+7 |
| 2009-06-03 | Fix a compile error in process_promotion (s.step_tier vs s.get_tier()). | Daniel Burrows | 1 | -1/+1 |
