| Age | Commit message (Expand) | Author | Files | Lines |
|---|
| 2009-03-21 | Destroy the progress bar window after the file is loaded. | Daniel Burrows | 1 | -0/+1 |
| 2009-03-21 | Actually add visible columns to the tree display, and make sure to set the mo... | Daniel Burrows | 1 | -1/+4 |
| 2009-03-21 | Add a trivial executable that can be used to see how long it takes to load a ... | Daniel Burrows | 2 | -0/+21 |
| 2009-03-21 | Show the current progress as a percent on the load progress bar, and make the... | Daniel Burrows | 1 | -1/+4 |
| 2009-03-21 | Fix the logic that decides when to update the progress bar. | Daniel Burrows | 1 | -4/+6 |
| 2009-03-21 | Move "while" into a separate utility module. | Daniel Burrows | 2 | -7/+9 |
| 2009-03-20 | Finish an initial implementation of code to render the main tree view and add... | Daniel Burrows | 5 | -50/+363 |
| 2009-03-16 | Start working on a tool to parse and graphically display dependency resolver ... | Daniel Burrows | 7 | -0/+1132 |
| 2009-03-09 | Write an operator-> for choice_set::const_iterator. | Daniel Burrows | 2 | -1/+10 |
| 2009-03-09 | Add a (very inefficient) iterator on choice sets and a test for it. | Daniel Burrows | 2 | -0/+110 |
| 2009-03-09 | Let choice_set::for_each() short-circuit, just like imm::set::for_each(). | Daniel Burrows | 1 | -4/+9 |
| 2009-03-08 | Make install_version() choices carry the dependency that led to the install. | Daniel Burrows | 5 | -24/+34 |
| 2009-03-07 | If find_all is "false" in find_best_justification, stop searching after we fi... | Daniel Burrows | 1 | -0/+6 |
| 2009-03-07 | Implement a clone() method on choice sets, analogous to the clone() on soluti... | Daniel Burrows | 2 | -0/+30 |
| 2009-03-07 | Extract the boilerplate that each choice set test sets up into a collection o... | Daniel Burrows | 1 | -91/+45 |
| 2009-03-07 | Fix how RootDir is kept out of the user configuration file. | Daniel Burrows | 1 | -4/+7 |
| 2009-03-07 | Add a routine to look up the version of a package that a choice set installs. | Daniel Burrows | 2 | -0/+68 |
| 2009-03-07 | Attach arbitrary integer tags to choice objects. | Daniel Burrows | 5 | -154/+222 |
| 2009-03-06 | Don't write RootDir into the user's configuration file. | Daniel Burrows | 1 | -0/+4 |
| 2009-03-06 | Add a slightly hacky way to set RootDir before the configuration, source list... | Daniel Burrows | 3 | -4/+23 |
| 2009-03-03 | Don't force the resolver to always prioritize dependencies that impinge on us... | Daniel Burrows | 1 | -30/+0 |
| 2009-03-03 | First step in the actual implementation of tiering. | Daniel Burrows | 5 | -451/+715 |
| 2009-03-03 | Rename promotion_set to generic_promotion_set for consistency with the rest o... | Daniel Burrows | 2 | -9/+9 |
| 2009-03-03 | Give promotions a default constructor. | Daniel Burrows | 1 | -0/+5 |
| 2009-03-03 | Add a routine that inserts one choice set's values into another choice set. | Daniel Burrows | 1 | -0/+14 |
| 2009-03-03 | Make sure that why_display_mode always gets a value. | Daniel Burrows | 1 | -5/+7 |
| 2009-03-03 | Make choice sets take the *narrowest* element added to them, not the widest. | Daniel Burrows | 3 | -149/+180 |
| 2009-03-01 | Use choice sets, not imm::set<choice>s, to store the choices stored in each p... | Daniel Burrows | 1 | -8/+11 |
| 2009-03-01 | Implement a lame operator< on choice sets. | Daniel Burrows | 1 | -0/+12 |
| 2009-03-01 | Output {} around choice sets. | Daniel Burrows | 1 | -0/+2 |
| 2009-03-01 | Write a class that encapsulates the business of storing a set of choices and ... | Daniel Burrows | 3 | -0/+610 |
| 2009-03-01 | Actually run the new unit test (oops). | Daniel Burrows | 1 | -0/+2 |
| 2009-03-01 | Add a test case for the "contains" relationship. | Daniel Burrows | 2 | -0/+157 |
| 2009-03-01 | Write a "contains" relationship in the choice class. | Daniel Burrows | 1 | -0/+33 |
| 2009-03-01 | Add missing #includes to choice.h. | Daniel Burrows | 1 | -0/+4 |
| 2009-03-01 | Add some slightly more paranoid tests of promotions, to check that _containin... | Daniel Burrows | 1 | -3/+68 |
| 2009-03-01 | Add a routine to retrieve the size of a particular tier of the search. | Daniel Burrows | 1 | -0/+9 |
| 2009-02-27 | Sanity-check the size and contents of the promotion set after invoking remove... | Daniel Burrows | 1 | -0/+37 |
| 2009-02-27 | Actually invoke the new test cases (**oops** :-) ). | Daniel Burrows | 1 | -0/+2 |
| 2009-02-27 | Write a test for remove_below_tier. | Daniel Burrows | 1 | -0/+114 |
| 2009-02-27 | Fix remove_below_tier so it compiles. | Daniel Burrows | 1 | -3/+5 |
| 2009-02-27 | Remove the "iterator" member class of promotion_set; I had a notion it would ... | Daniel Burrows | 1 | -31/+0 |
| 2009-02-27 | Write up a test of remove_tier(). | Daniel Burrows | 1 | -0/+64 |
| 2009-02-25 | Add a fifth test of find_highest_promotion, testing that we DTRT when there i... | Daniel Burrows | 1 | -0/+34 |
| 2009-02-25 | Update the doccomment for install_version_index_entry::from_dep_source_entrie... | Daniel Burrows | 1 | -0/+12 |
| 2009-02-25 | Fix a bug in the promotion set which prevented incoming sets containing a fro... | Daniel Burrows | 1 | -4/+27 |
| 2009-02-25 | Write a test that checks that choices made due to a dependency are matched pr... | Daniel Burrows | 1 | -0/+28 |
| 2009-02-25 | Explain the purpose of each test in comments. | Daniel Burrows | 1 | -0/+7 |
| 2009-02-25 | Instantiate the first expected promotion in exactly one place. | Daniel Burrows | 1 | -6/+7 |
| 2009-02-25 | Write a third test of find_highest_promotion. | Daniel Burrows | 1 | -0/+17 |
