/brz/remove-bazaar : changes

» Changes from revision 3377.3.43

To get this branch, use:

bzr branch
http://gegoxaren.bato24.eu/bzr/brz/remove-bazaar

From Revision 3377.3.43 to 3377.3.24

expand all

Rev	Summary	Authors	Date
3377.3.43	Ian's review feedback Ian's review feedback	John Arbash Meinel	17 years ago
3377.3.42	Get the tests to actually work, and get the code to go along... Get the tests to actually work, and get the code to go along with. Turns out I was using an api wrong anyway, but now the tests pass.	John Arbash Meinel	17 years ago
3377.3.41	Fix up a couple of the tests Fix up a couple of the tests	John Arbash Meinel	17 years ago
3377.3.40	a little bit more cleanup, change how ghosts are handled a little bit more cleanup, change how ghosts are handled	John Arbash Meinel	17 years ago
3377.3.39	More tweaks for show_pending_merges More tweaks for show_pending_merges Display the pending merge itself right away. Factor out the sorting code to a helper function. Pull out common operations to outside the loop.	John Arbash Meinel	17 years ago
3377.3.38	Pull out terminal width from the inner loop of show_pending_... Pull out terminal width from the inner loop of show_pending_merges	John Arbash Meinel	17 years ago
3377.3.37	Ian's first review comments. Ian's first review comments.	John Arbash Meinel	17 years ago
3377.3.36	Small updates, try to write a test for the race condition. Small updates, try to write a test for the race condition. So far I have been unsuccessful, it is very hard to artificially create the race that I found in bzr.dev.	John Arbash Meinel	17 years ago
3377.3.35	Add a test that exercises the multiple interesting unique co... Add a test that exercises the multiple interesting unique code The previous tests never entered the second loop, because they only had a single interesting graph path. Still missing some tests, though everything passes for bzr.dev.	John Arbash Meinel	17 years ago
3377.3.34	When collapsing common revisions into another searcher, When collapsing common revisions into another searcher, we need to make sure that anything considered 'common' is also common with the common-to-all-unique-node searcher. This does not include a test case, though I really want to.	John Arbash Meinel	17 years ago
3377.3.33	Add some logging with -Dgraph Add some logging with -Dgraph	John Arbash Meinel	17 years ago
3377.3.32	try collapsing the common revisions into a single searcher. try collapsing the common revisions into a single searcher.	John Arbash Meinel	17 years ago
3377.3.31	change the status code to use find_unique_ancestors() change the status code to use find_unique_ancestors()	John Arbash Meinel	17 years ago
3377.3.30	Can we avoid the extra _do_query in start_searching? Can we avoid the extra _do_query in start_searching?	John Arbash Meinel	17 years ago
3377.3.29	Revert the _find_any_seen change. Revert the _find_any_seen change. The overhead of combining the searchers swamps the benefits of combining the search.	John Arbash Meinel	17 years ago
3377.3.28	Try using _find_any_seen_ancestors, Try using _find_any_seen_ancestors, which pulls out the loop around find_seen_ancestors. This may not be a net win yet.	John Arbash Meinel	17 years ago
3377.3.27	some simple updates some simple updates	John Arbash Meinel	17 years ago
3377.3.26	Found a graph leak. Found a graph leak. Needed set.update() rather than set = The results were still correct, but it would generally cause a large leak into the rest of the graph.	John Arbash Meinel	17 years ago
3377.3.25	A few more minimal ancestry checks A few more minimal ancestry checks	John Arbash Meinel	17 years ago
3377.3.24	For some reason find_unique_ancestors is much slower than it... For some reason find_unique_ancestors is much slower than it should be. Start trying to assert that it doesn't access more ancestry than it needs to.	John Arbash Meinel	17 years ago

Older »