~bzr-pqm/bzr/bzr.dev

« back to all changes in this revision

Viewing changes to bzrlib/tests/test_graph.py

• browse files at revision 2493.2.5
• compare with another revision
• download diff
• download tarball
• view history from revision 2493.2.5

• reverse the comparison (2493.2.5 to 1185.33.36)
• stop comparing with revision 1185.33.36

Show diffs side-by-side

added

removed

bzrlib/tests/test_graph.py

1

 

from bzrlib.selftest import TestCase

2

 

from bzrlib.graph import node_distances, nodes_by_distance

 

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

from bzrlib.tests import TestCase

 

18

from bzrlib.graph import node_distances, nodes_by_distance, Graph

 

19

 

3

20

 

4

21

class TestBase(TestCase):

 

22

 

5

23

    def edge_add(self, *args):

6

24

        for start, end in zip(args[:-1], args[1:]):

7

25

            if start not in self.graph:

47

65

        distances = node_distances(self.graph, descendants, 'A')

48

66

        self.assertEqual(distances['C'], 3)

49

67

 

 

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())

• Older »

Loggerhead is a web-based interface for Breezy
Version: 2.0.1