← Back to branch summary

~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_graph.py

  • Committer: Vincent Ladeuil
  • Date: 2010-03-10 09:33:04 UTC
  • mto: (5082.1.1 integration)
  • mto: This revision was merged to the branch mainline in revision 5083.
  • Revision ID: v.ladeuil+lp@free.fr-20100310093304-4245t4tazd4sxoav
Cleanup test from overly cautious checks.

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_graph.py
1
 
# Copyright (C) 2007-2011 Canonical Ltd
 
1
# Copyright (C) 2007-2010 Canonical Ltd
2
2
#
3
3
# This program is free software; you can redistribute it and/or modify
4
4
# it under the terms of the GNU General Public License as published by
17
17
from bzrlib import (
18
18
    errors,
19
19
    graph as _mod_graph,
 
20
    symbol_versioning,
20
21
    tests,
21
22
    )
22
23
from bzrlib.revision import NULL_REVISION
23
24
from bzrlib.tests import TestCaseWithMemoryTransport
 
25
from bzrlib.symbol_versioning import deprecated_in
24
26
 
25
27
 
26
28
# Ancestry 1:
424
426
    def __init__(self, parents_provider):
425
427
        self.calls = []
426
428
        self._real_parents_provider = parents_provider
427
 
        get_cached = getattr(parents_provider, 'get_cached_parent_map', None)
428
 
        if get_cached is not None:
429
 
            # Only expose the underlying 'get_cached_parent_map' function if
430
 
            # the wrapped provider has it.
431
 
            self.get_cached_parent_map = self._get_cached_parent_map
432
429
 
433
430
    def get_parent_map(self, nodes):
434
431
        self.calls.extend(nodes)
435
432
        return self._real_parents_provider.get_parent_map(nodes)
436
433
 
437
 
    def _get_cached_parent_map(self, nodes):
438
 
        self.calls.append(('cached', sorted(nodes)))
439
 
        return self._real_parents_provider.get_cached_parent_map(nodes)
440
 
 
441
 
 
442
 
class SharedInstrumentedParentsProvider(object):
443
 
 
444
 
    def __init__(self, parents_provider, calls, info):
445
 
        self.calls = calls
446
 
        self.info = info
447
 
        self._real_parents_provider = parents_provider
448
 
        get_cached = getattr(parents_provider, 'get_cached_parent_map', None)
449
 
        if get_cached is not None:
450
 
            # Only expose the underlying 'get_cached_parent_map' function if
451
 
            # the wrapped provider has it.
452
 
            self.get_cached_parent_map = self._get_cached_parent_map
453
 
 
454
 
    def get_parent_map(self, nodes):
455
 
        self.calls.append((self.info, sorted(nodes)))
456
 
        return self._real_parents_provider.get_parent_map(nodes)
457
 
 
458
 
    def _get_cached_parent_map(self, nodes):
459
 
        self.calls.append((self.info, 'cached', sorted(nodes)))
460
 
        return self._real_parents_provider.get_cached_parent_map(nodes)
461
 
 
462
434
 
463
435
class TestGraphBase(tests.TestCase):
464
436
 
703
675
        self.assertEqual((set(['e']), set(['f', 'g'])),
704
676
                         graph.find_difference('e', 'f'))
705
677
 
 
678
 
 
679
    def test_stacked_parents_provider(self):
 
680
        parents1 = _mod_graph.DictParentsProvider({'rev2': ['rev3']})
 
681
        parents2 = _mod_graph.DictParentsProvider({'rev1': ['rev4']})
 
682
        stacked = _mod_graph.StackedParentsProvider([parents1, parents2])
 
683
        self.assertEqual({'rev1':['rev4'], 'rev2':['rev3']},
 
684
                         stacked.get_parent_map(['rev1', 'rev2']))
 
685
        self.assertEqual({'rev2':['rev3'], 'rev1':['rev4']},
 
686
                         stacked.get_parent_map(['rev2', 'rev1']))
 
687
        self.assertEqual({'rev2':['rev3']},
 
688
                         stacked.get_parent_map(['rev2', 'rev2']))
 
689
        self.assertEqual({'rev1':['rev4']},
 
690
                         stacked.get_parent_map(['rev1', 'rev1']))
 
691
    
 
692
    def test_stacked_parents_provider_overlapping(self):
 
693
        # rev2 is availible in both providers.
 
694
        # 1
 
695
        # |
 
696
        # 2
 
697
        parents1 = _mod_graph.DictParentsProvider({'rev2': ['rev1']})
 
698
        parents2 = _mod_graph.DictParentsProvider({'rev2': ['rev1']})
 
699
        stacked = _mod_graph.StackedParentsProvider([parents1, parents2])
 
700
        self.assertEqual({'rev2': ['rev1']},
 
701
                         stacked.get_parent_map(['rev2']))
 
702
 
 
703
    def test__stacked_parents_provider_deprecated(self):
 
704
        parents1 = _mod_graph.DictParentsProvider({'rev2': ['rev3']})
 
705
        parents2 = _mod_graph.DictParentsProvider({'rev1': ['rev4']})
 
706
        stacked = self.applyDeprecated(deprecated_in((1, 16, 0)),
 
707
                    _mod_graph._StackedParentsProvider, [parents1, parents2])
 
708
        self.assertEqual({'rev1':['rev4'], 'rev2':['rev3']},
 
709
                         stacked.get_parent_map(['rev1', 'rev2']))
 
710
        self.assertEqual({'rev2':['rev3'], 'rev1':['rev4']},
 
711
                         stacked.get_parent_map(['rev2', 'rev1']))
 
712
        self.assertEqual({'rev2':['rev3']},
 
713
                         stacked.get_parent_map(['rev2', 'rev2']))
 
714
        self.assertEqual({'rev1':['rev4']},
 
715
                         stacked.get_parent_map(['rev1', 'rev1']))
 
716
 
706
717
    def test_iter_topo_order(self):
707
718
        graph = self.make_graph(ancestry_1)
708
719
        args = ['rev2a', 'rev3', 'rev1']
1029
1040
                search.start_searching(starts)
1030
1041
            if stops is not None:
1031
1042
                search.stop_searching_any(stops)
1032
 
            state = search.get_state()
1033
 
            self.assertEqual(set(included_keys), state[2])
 
1043
            result = search.get_result()
 
1044
            self.assertEqual(recipe, result.get_recipe())
 
1045
            self.assertEqual(set(included_keys), result.get_keys())
1034
1046
            self.assertEqual(seen, search.seen)
1035
1047
 
1036
1048
    def test_breadth_first_get_result_excludes_current_pending(self):
1041
1053
            })
1042
1054
        search = graph._make_breadth_first_searcher(['head'])
1043
1055
        # At the start, nothing has been seen, to its all excluded:
1044
 
        state = search.get_state()
1045
 
        self.assertEqual((set(['head']), set(['head']), set()),
1046
 
            state)
 
1056
        result = search.get_result()
 
1057
        self.assertEqual(('search', set(['head']), set(['head']), 0),
 
1058
            result.get_recipe())
 
1059
        self.assertEqual(set(), result.get_keys())
1047
1060
        self.assertEqual(set(), search.seen)
1048
1061
        # using next:
1049
1062
        expected = [
1072
1085
        # Starting with nothing and adding a search works:
1073
1086
        search.start_searching(['head'])
1074
1087
        # head has been seen:
1075
 
        state = search.get_state()
1076
 
        self.assertEqual((set(['head']), set(['child']), set(['head'])),
1077
 
            state)
 
1088
        result = search.get_result()
 
1089
        self.assertEqual(('search', set(['head']), set(['child']), 1),
 
1090
            result.get_recipe())
 
1091
        self.assertEqual(set(['head']), result.get_keys())
1078
1092
        self.assertEqual(set(['head']), search.seen)
1079
1093
        # using next:
1080
1094
        expected = [
1231
1245
        self.assertSeenAndResult(expected, search, search.next)
1232
1246
        self.assertRaises(StopIteration, search.next)
1233
1247
        self.assertEqual(set(['head', 'ghost', NULL_REVISION]), search.seen)
1234
 
        state = search.get_state()
1235
 
        self.assertEqual(
1236
 
            (set(['ghost', 'head']), set(['ghost']),
1237
 
                set(['head', NULL_REVISION])),
1238
 
            state)
 
1248
        result = search.get_result()
 
1249
        self.assertEqual(('search', set(['ghost', 'head']), set(['ghost']), 2),
 
1250
            result.get_recipe())
 
1251
        self.assertEqual(set(['head', NULL_REVISION]), result.get_keys())
1239
1252
        # using next_with_ghosts:
1240
1253
        search = graph._make_breadth_first_searcher(['head'])
1241
1254
        self.assertSeenAndResult(expected, search, search.next_with_ghosts)
1242
1255
        self.assertRaises(StopIteration, search.next)
1243
1256
        self.assertEqual(set(['head', 'ghost', NULL_REVISION]), search.seen)
1244
 
        state = search.get_state()
1245
 
        self.assertEqual(
1246
 
            (set(['ghost', 'head']), set(['ghost']),
1247
 
                set(['head', NULL_REVISION])),
1248
 
            state)
 
1257
        result = search.get_result()
 
1258
        self.assertEqual(('search', set(['ghost', 'head']), set(['ghost']), 2),
 
1259
            result.get_recipe())
 
1260
        self.assertEqual(set(['head', NULL_REVISION]), result.get_keys())
1249
1261
 
1250
1262
 
1251
1263
class TestFindUniqueAncestors(TestGraphBase):
1412
1424
        self.assertMergeOrder(['rev3', 'rev1'], graph, 'rev4', ['rev1', 'rev3'])
1413
1425
 
1414
1426
 
1415
 
class TestFindDescendants(TestGraphBase):
1416
 
 
1417
 
    def test_find_descendants_rev1_rev3(self):
1418
 
        graph = self.make_graph(ancestry_1)
1419
 
        descendants = graph.find_descendants('rev1', 'rev3')
1420
 
        self.assertEqual(set(['rev1', 'rev2a', 'rev3']), descendants)
1421
 
 
1422
 
    def test_find_descendants_rev1_rev4(self):
1423
 
        graph = self.make_graph(ancestry_1)
1424
 
        descendants = graph.find_descendants('rev1', 'rev4')
1425
 
        self.assertEqual(set(['rev1', 'rev2a', 'rev2b', 'rev3', 'rev4']),
1426
 
                         descendants)
1427
 
 
1428
 
    def test_find_descendants_rev2a_rev4(self):
1429
 
        graph = self.make_graph(ancestry_1)
1430
 
        descendants = graph.find_descendants('rev2a', 'rev4')
1431
 
        self.assertEqual(set(['rev2a', 'rev3', 'rev4']), descendants)
1432
 
 
1433
 
class TestFindLefthandMerger(TestGraphBase):
1434
 
 
1435
 
    def check_merger(self, result, ancestry, merged, tip):
1436
 
        graph = self.make_graph(ancestry)
1437
 
        self.assertEqual(result, graph.find_lefthand_merger(merged, tip))
1438
 
 
1439
 
    def test_find_lefthand_merger_rev2b(self):
1440
 
        self.check_merger('rev4', ancestry_1, 'rev2b', 'rev4')
1441
 
 
1442
 
    def test_find_lefthand_merger_rev2a(self):
1443
 
        self.check_merger('rev2a', ancestry_1, 'rev2a', 'rev4')
1444
 
 
1445
 
    def test_find_lefthand_merger_rev4(self):
1446
 
        self.check_merger(None, ancestry_1, 'rev4', 'rev2a')
1447
 
 
1448
 
    def test_find_lefthand_merger_f(self):
1449
 
        self.check_merger('i', complex_shortcut, 'f', 'm')
1450
 
 
1451
 
    def test_find_lefthand_merger_g(self):
1452
 
        self.check_merger('i', complex_shortcut, 'g', 'm')
1453
 
 
1454
 
    def test_find_lefthand_merger_h(self):
1455
 
        self.check_merger('n', complex_shortcut, 'h', 'n')
1456
 
 
1457
 
 
1458
 
class TestGetChildMap(TestGraphBase):
1459
 
 
1460
 
    def test_get_child_map(self):
1461
 
        graph = self.make_graph(ancestry_1)
1462
 
        child_map = graph.get_child_map(['rev4', 'rev3', 'rev2a', 'rev2b'])
1463
 
        self.assertEqual({'rev1': ['rev2a', 'rev2b'],
1464
 
                          'rev2a': ['rev3'],
1465
 
                          'rev2b': ['rev4'],
1466
 
                          'rev3': ['rev4']},
1467
 
                          child_map)
1468
 
 
1469
 
 
1470
1427
class TestCachingParentsProvider(tests.TestCase):
1471
1428
    """These tests run with:
1472
1429
 
1477
1434
 
1478
1435
    def setUp(self):
1479
1436
        super(TestCachingParentsProvider, self).setUp()
1480
 
        dict_pp = _mod_graph.DictParentsProvider({'a': ('b',)})
 
1437
        dict_pp = _mod_graph.DictParentsProvider({'a':('b',)})
1481
1438
        self.inst_pp = InstrumentedParentsProvider(dict_pp)
1482
1439
        self.caching_pp = _mod_graph.CachingParentsProvider(self.inst_pp)
1483
1440
 
1522
1479
        self.assertEqual([], self.inst_pp.calls)
1523
1480
        self.assertEqual(set(['b']), self.caching_pp.missing_keys)
1524
1481
 
1525
 
    def test_get_cached_parent_map(self):
1526
 
        self.assertEqual({}, self.caching_pp.get_cached_parent_map(['a']))
1527
 
        self.assertEqual([], self.inst_pp.calls)
1528
 
        self.assertEqual({'a': ('b',)}, self.caching_pp.get_parent_map(['a']))
1529
 
        self.assertEqual(['a'], self.inst_pp.calls)
1530
 
        self.assertEqual({'a': ('b',)},
1531
 
                         self.caching_pp.get_cached_parent_map(['a']))
1532
 
 
1533
1482
 
1534
1483
class TestCachingParentsProviderExtras(tests.TestCaseWithTransport):
1535
1484
    """Test the behaviour when parents are provided that were not requested."""
1594
1543
                         self.caching_pp.get_parent_map(['rev2']))
1595
1544
        self.assertEqual(['rev3'], self.inst_pp.calls)
1596
1545
 
1597
 
    def test_extras_using_cached(self):
1598
 
        self.assertEqual({}, self.caching_pp.get_cached_parent_map(['rev3']))
1599
 
        self.assertEqual({}, self.caching_pp.get_parent_map(['rev3']))
1600
 
        self.assertEqual({'rev2': ['rev1']},
1601
 
                         self.caching_pp.get_cached_parent_map(['rev2']))
1602
 
        self.assertEqual(['rev3'], self.inst_pp.calls)
1603
 
 
1604
 
 
1605
1546
 
1606
1547
class TestCollapseLinearRegions(tests.TestCase):
1607
1548
 
1658
1599
        self.assertEqual(['D'], sorted(graph_thunk.heads(['D', 'C'])))
1659
1600
        self.assertEqual(['B', 'C'], sorted(graph_thunk.heads(['B', 'C'])))
1660
1601
 
1661
 
    def test_add_node(self):
1662
 
        d = {('C',):[('A',)], ('B',): [('A',)], ('A',): []}
1663
 
        g = _mod_graph.KnownGraph(d)
1664
 
        graph_thunk = _mod_graph.GraphThunkIdsToKeys(g)
1665
 
        graph_thunk.add_node("D", ["A", "C"])
1666
 
        self.assertEqual(['B', 'D'],
1667
 
            sorted(graph_thunk.heads(['D', 'B', 'A'])))
1668
 
 
1669
 
    def test_merge_sort(self):
1670
 
        d = {('C',):[('A',)], ('B',): [('A',)], ('A',): []}
1671
 
        g = _mod_graph.KnownGraph(d)
1672
 
        graph_thunk = _mod_graph.GraphThunkIdsToKeys(g)
1673
 
        graph_thunk.add_node("D", ["A", "C"])
1674
 
        self.assertEqual([('C', 0, (2,), False), ('A', 0, (1,), True)],
1675
 
            [(n.key, n.merge_depth, n.revno, n.end_of_merge)
1676
 
                 for n in graph_thunk.merge_sort('C')])
1677
 
 
1678
 
 
1679
 
class TestStackedParentsProvider(tests.TestCase):
1680
 
 
1681
 
    def setUp(self):
1682
 
        super(TestStackedParentsProvider, self).setUp()
1683
 
        self.calls = []
1684
 
 
1685
 
    def get_shared_provider(self, info, ancestry, has_cached):
1686
 
        pp = _mod_graph.DictParentsProvider(ancestry)
1687
 
        if has_cached:
1688
 
            pp.get_cached_parent_map = pp.get_parent_map
1689
 
        return SharedInstrumentedParentsProvider(pp, self.calls, info)
1690
 
 
1691
 
    def test_stacked_parents_provider(self):
1692
 
        parents1 = _mod_graph.DictParentsProvider({'rev2': ['rev3']})
1693
 
        parents2 = _mod_graph.DictParentsProvider({'rev1': ['rev4']})
1694
 
        stacked = _mod_graph.StackedParentsProvider([parents1, parents2])
1695
 
        self.assertEqual({'rev1':['rev4'], 'rev2':['rev3']},
1696
 
                         stacked.get_parent_map(['rev1', 'rev2']))
1697
 
        self.assertEqual({'rev2':['rev3'], 'rev1':['rev4']},
1698
 
                         stacked.get_parent_map(['rev2', 'rev1']))
1699
 
        self.assertEqual({'rev2':['rev3']},
1700
 
                         stacked.get_parent_map(['rev2', 'rev2']))
1701
 
        self.assertEqual({'rev1':['rev4']},
1702
 
                         stacked.get_parent_map(['rev1', 'rev1']))
1703
 
 
1704
 
    def test_stacked_parents_provider_overlapping(self):
1705
 
        # rev2 is availible in both providers.
1706
 
        # 1
1707
 
        # |
1708
 
        # 2
1709
 
        parents1 = _mod_graph.DictParentsProvider({'rev2': ['rev1']})
1710
 
        parents2 = _mod_graph.DictParentsProvider({'rev2': ['rev1']})
1711
 
        stacked = _mod_graph.StackedParentsProvider([parents1, parents2])
1712
 
        self.assertEqual({'rev2': ['rev1']},
1713
 
                         stacked.get_parent_map(['rev2']))
1714
 
 
1715
 
    def test_handles_no_get_cached_parent_map(self):
1716
 
        # this shows that we both handle when a provider doesn't implement
1717
 
        # get_cached_parent_map
1718
 
        pp1 = self.get_shared_provider('pp1', {'rev2': ('rev1',)},
1719
 
                                       has_cached=False)
1720
 
        pp2 = self.get_shared_provider('pp2', {'rev2': ('rev1',)},
1721
 
                                       has_cached=True)
1722
 
        stacked = _mod_graph.StackedParentsProvider([pp1, pp2])
1723
 
        self.assertEqual({'rev2': ('rev1',)}, stacked.get_parent_map(['rev2']))
1724
 
        # No call on 'pp1' because it doesn't provide get_cached_parent_map
1725
 
        self.assertEqual([('pp2', 'cached', ['rev2'])], self.calls)
1726
 
 
1727
 
    def test_query_order(self):
1728
 
        # We should call get_cached_parent_map on all providers before we call
1729
 
        # get_parent_map. Further, we should track what entries we have found,
1730
 
        # and not re-try them.
1731
 
        pp1 = self.get_shared_provider('pp1', {'a': ()}, has_cached=True)
1732
 
        pp2 = self.get_shared_provider('pp2', {'c': ('b',)}, has_cached=False)
1733
 
        pp3 = self.get_shared_provider('pp3', {'b': ('a',)}, has_cached=True)
1734
 
        stacked = _mod_graph.StackedParentsProvider([pp1, pp2, pp3])
1735
 
        self.assertEqual({'a': (), 'b': ('a',), 'c': ('b',)},
1736
 
                         stacked.get_parent_map(['a', 'b', 'c', 'd']))
1737
 
        self.assertEqual([('pp1', 'cached', ['a', 'b', 'c', 'd']),
1738
 
                          # No call to pp2, because it doesn't have cached
1739
 
                          ('pp3', 'cached', ['b', 'c', 'd']),
1740
 
                          ('pp1', ['c', 'd']),
1741
 
                          ('pp2', ['c', 'd']),
1742
 
                          ('pp3', ['d']),
1743
 
                         ], self.calls)
 
1602
 
 
1603
class TestPendingAncestryResultGetKeys(TestCaseWithMemoryTransport):
 
1604
    """Tests for bzrlib.graph.PendingAncestryResult."""
 
1605
 
 
1606
    def test_get_keys(self):
 
1607
        builder = self.make_branch_builder('b')
 
1608
        builder.start_series()
 
1609
        builder.build_snapshot('rev-1', None, [
 
1610
            ('add', ('', 'root-id', 'directory', ''))])
 
1611
        builder.build_snapshot('rev-2', ['rev-1'], [])
 
1612
        builder.finish_series()
 
1613
        repo = builder.get_branch().repository
 
1614
        repo.lock_read()
 
1615
        self.addCleanup(repo.unlock)
 
1616
        result = _mod_graph.PendingAncestryResult(['rev-2'], repo)
 
1617
        self.assertEqual(set(['rev-1', 'rev-2']), set(result.get_keys()))
 
1618
 
 
1619
    def test_get_keys_excludes_ghosts(self):
 
1620
        builder = self.make_branch_builder('b')
 
1621
        builder.start_series()
 
1622
        builder.build_snapshot('rev-1', None, [
 
1623
            ('add', ('', 'root-id', 'directory', ''))])
 
1624
        builder.build_snapshot('rev-2', ['rev-1', 'ghost'], [])
 
1625
        builder.finish_series()
 
1626
        repo = builder.get_branch().repository
 
1627
        repo.lock_read()
 
1628
        self.addCleanup(repo.unlock)
 
1629
        result = _mod_graph.PendingAncestryResult(['rev-2'], repo)
 
1630
        self.assertEqual(sorted(['rev-1', 'rev-2']), sorted(result.get_keys()))
 
1631
 
 
1632
    def test_get_keys_excludes_null(self):
 
1633
        # Make a 'graph' with an iter_ancestry that returns NULL_REVISION
 
1634
        # somewhere other than the last element, which can happen in real
 
1635
        # ancestries.
 
1636
        class StubGraph(object):
 
1637
            def iter_ancestry(self, keys):
 
1638
                return [(NULL_REVISION, ()), ('foo', (NULL_REVISION,))]
 
1639
        result = _mod_graph.PendingAncestryResult(['rev-3'], None)
 
1640
        result_keys = result._get_keys(StubGraph())
 
1641
        # Only the non-null keys from the ancestry appear.
 
1642
        self.assertEqual(set(['foo']), set(result_keys))
 
1643
 
 
1644
 
 
1645
class TestPendingAncestryResultRefine(TestGraphBase):
 
1646
 
 
1647
    def test_refine(self):
 
1648
        # Used when pulling from a stacked repository, so test some revisions
 
1649
        # being satisfied from the stacking branch.
 
1650
        g = self.make_graph(
 
1651
            {"tip":["mid"], "mid":["base"], "tag":["base"],
 
1652
             "base":[NULL_REVISION], NULL_REVISION:[]})
 
1653
        result = _mod_graph.PendingAncestryResult(['tip', 'tag'], None)
 
1654
        result = result.refine(set(['tip']), set(['mid']))
 
1655
        self.assertEqual(set(['mid', 'tag']), result.heads)
 
1656
        result = result.refine(set(['mid', 'tag', 'base']),
 
1657
            set([NULL_REVISION]))
 
1658
        self.assertEqual(set([NULL_REVISION]), result.heads)
 
1659
        self.assertTrue(result.is_empty())
 
1660
 
 
1661
 
 
1662
class TestSearchResultRefine(TestGraphBase):
 
1663
 
 
1664
    def test_refine(self):
 
1665
        # Used when pulling from a stacked repository, so test some revisions
 
1666
        # being satisfied from the stacking branch.
 
1667
        g = self.make_graph(
 
1668
            {"tip":["mid"], "mid":["base"], "tag":["base"],
 
1669
             "base":[NULL_REVISION], NULL_REVISION:[]})
 
1670
        result = _mod_graph.SearchResult(set(['tip', 'tag']),
 
1671
            set([NULL_REVISION]), 4, set(['tip', 'mid', 'tag', 'base']))
 
1672
        result = result.refine(set(['tip']), set(['mid']))
 
1673
        recipe = result.get_recipe()
 
1674
        # We should be starting from tag (original head) and mid (seen ref)
 
1675
        self.assertEqual(set(['mid', 'tag']), recipe[1])
 
1676
        # We should be stopping at NULL (original stop) and tip (seen head)
 
1677
        self.assertEqual(set([NULL_REVISION, 'tip']), recipe[2])
 
1678
        self.assertEqual(3, recipe[3])
 
1679
        result = result.refine(set(['mid', 'tag', 'base']),
 
1680
            set([NULL_REVISION]))
 
1681
        recipe = result.get_recipe()
 
1682
        # We should be starting from nothing (NULL was known as a cut point)
 
1683
        self.assertEqual(set([]), recipe[1])
 
1684
        # We should be stopping at NULL (original stop) and tip (seen head) and
 
1685
        # tag (seen head) and mid(seen mid-point head). We could come back and
 
1686
        # define this as not including mid, for minimal results, but it is
 
1687
        # still 'correct' to include mid, and simpler/easier.
 
1688
        self.assertEqual(set([NULL_REVISION, 'tip', 'tag', 'mid']), recipe[2])
 
1689
        self.assertEqual(0, recipe[3])
 
1690
        self.assertTrue(result.is_empty())