← 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: Martin Pool
  • Date: 2006-03-21 12:26:54 UTC
  • mto: This revision was merged to the branch mainline in revision 1621.
  • Revision ID: mbp@sourcefrog.net-20060321122654-514047ed65795a17
New developer commands 'weave-list' and 'weave-join'.

Show diffs side-by-side

added added

removed removed

Lines of Context:
bzrlib/tests/test_graph.py
1
 
# Copyright (C) 2005, 2006 Canonical Ltd
2
 
#
3
 
# This program is free software; you can redistribute it and/or modify
4
 
# it under the terms of the GNU General Public License as published by
5
 
# the Free Software Foundation; either version 2 of the License, or
6
 
# (at your option) any later version.
7
 
#
8
 
# This program is distributed in the hope that it will be useful,
9
 
# but WITHOUT ANY WARRANTY; without even the implied warranty of
10
 
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
11
 
# GNU General Public License for more details.
12
 
#
13
 
# You should have received a copy of the GNU General Public License
14
 
# along with this program; if not, write to the Free Software
15
 
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
16
 
 
17
1
from bzrlib.tests import TestCase
18
 
from bzrlib.deprecated_graph import node_distances, nodes_by_distance, Graph
19
 
 
 
2
from bzrlib.graph import node_distances, nodes_by_distance
20
3
 
21
4
class TestBase(TestCase):
22
 
 
23
5
    def edge_add(self, *args):
24
6
        for start, end in zip(args[:-1], args[1:]):
25
7
            if start not in self.graph:
65
47
        distances = node_distances(self.graph, descendants, 'A')
66
48
        self.assertEqual(distances['C'], 3)
67
49
 
68
 
 
69
 
class TestGraph(TestCase):
70
 
 
71
 
    def test_get_descendants(self):
72
 
        # Graph objects let you get a descendants graph in 
73
 
        # node: {direct-children:distance} which contains
74
 
        # known children, including ghost children
75
 
        graph = Graph()
76
 
        graph.add_ghost('ghost')
77
 
        graph.add_node('rev1', ['ghost'])
78
 
        # check the result contains ghosts:
79
 
        self.assertEqual({'ghost': {'rev1': 1}, 'rev1': {}},
80
 
                         graph.get_descendants())