aptitude - [no description]

Age	Commit message (Expand)	Author	Files	Lines
2009-07-10	Eliminating the use of hash tables to save memory: backed out changeset 7c43f...	Daniel Burrows	1	-152/+127
2009-07-05	Reimplement choice_set in terms of boost::unordered_set.	Daniel Burrows	1	-127/+152
2009-06-16	Give choice_set both the ability to find choices contained in a particular ch...	Daniel Burrows	1	-3/+89
2009-06-16	Fix the documentation of get_containing_choice.	Daniel Burrows	1	-1/+1
2009-06-09	Add 3-way comparisons to the resolver layer instead of using operator<.	Daniel Burrows	1	-8/+14
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-03	Instead of dying with an inscrutable assertion failure when conflicting choic...	Daniel Burrows	1	-1/+5
2009-04-05	Build a tree of resolver steps as the resolver runs.	Daniel Burrows	1	-0/+20
2009-03-23	Restructure the resolver so that it stores and returns sets of choices using ...	Daniel Burrows	1	-2/+1
2009-03-09	Write an operator-> for choice_set::const_iterator.	Daniel Burrows	1	-0/+5
2009-03-09	Add a (very inefficient) iterator on choice sets and a test for it.	Daniel Burrows	1	-0/+73
2009-03-09	Let choice_set::for_each() short-circuit, just like imm::set::for_each().	Daniel Burrows	1	-4/+9
2009-03-07	Implement a clone() method on choice sets, analogous to the clone() on soluti...	Daniel Burrows	1	-0/+16
2009-03-07	Add a routine to look up the version of a package that a choice set installs.	Daniel Burrows	1	-0/+23
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 choice sets take the narrowest element added to them, not the widest.	Daniel Burrows	1	-11/+33
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	1	-0/+280