← 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: Robert Collins
  • Date: 2006-07-20 13:00:31 UTC
  • mto: (1852.9.1 Tree.compare().)
  • mto: This revision was merged to the branch mainline in revision 1890.
  • Revision ID: robertc@robertcollins.net-20060720130031-d26103a427ea10f3
Start tree implementation tests.

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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 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, Graph
20
3
 
21
4
class TestBase(TestCase):
22
5
 
45
28
                    descendants[ancestor] = set()
46
29
                descendants[ancestor].add(node)
47
30
        return descendants
48
 
 
 
31
    
49
32
    def test_distances(self):
50
33
        descendants = self.node_descendants()
51
34
        distances = node_distances(self.graph, descendants, 'A')
69
52
class TestGraph(TestCase):
70
53
 
71
54
    def test_get_descendants(self):
72
 
        # Graph objects let you get a descendants graph in
 
55
        # Graph objects let you get a descendants graph in 
73
56
        # node: {direct-children:distance} which contains
74
57
        # known children, including ghost children
75
58
        graph = Graph()