/usr/lib/python2.7/dist-packages/bzrlib/plugins/bzrtools/tests/test_graph.py is in bzrtools 2.6.0-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 | # Copyright (C) 2005, 2006 Canonical Ltd
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
from bzrlib.tests import (
TestCase,
TestCaseWithMemoryTransport,
)
from bzrlib.plugins.bzrtools.graph import (
get_rev_info,
node_distances,
nodes_by_distance,
)
class TestBase(TestCase):
def edge_add(self, *args):
for start, end in zip(args[:-1], args[1:]):
if start not in self.graph:
self.graph[start] = {}
if end not in self.graph:
self.graph[end] = {}
self.graph[start][end] = 1
def setUp(self):
TestCase.setUp(self)
self.graph = {}
self.edge_add('A', 'B', 'C', 'D')
self.edge_add('A', 'E', 'F', 'C')
self.edge_add('A', 'G', 'H', 'I', 'B')
self.edge_add('A', 'J', 'K', 'L', 'M', 'N')
self.edge_add('O', 'N')
def node_descendants(self):
descendants = {'A':set()}
for node in self.graph:
for ancestor in self.graph[node]:
if ancestor not in descendants:
descendants[ancestor] = set()
descendants[ancestor].add(node)
return descendants
def test_distances(self):
descendants = self.node_descendants()
distances = node_distances(self.graph, descendants, 'A')
nodes = nodes_by_distance(distances)
self.assertEqual(nodes[0], 'D')
self.assert_(nodes[1] in ('N', 'C'))
self.assert_(nodes[2] in ('N', 'C'))
self.assert_(nodes[3] in ('B', 'M'))
self.assert_(nodes[4] in ('B', 'M'))
#Ensure we don't shortcut through B when there's only a difference of
# 1 in distance
self.graph = {}
self.edge_add('A', 'B', 'C')
self.edge_add('A', 'D', 'E', 'C')
descendants = self.node_descendants()
distances = node_distances(self.graph, descendants, 'A')
self.assertEqual(distances['C'], 3)
class TestGetRevInfo(TestCaseWithMemoryTransport):
def test_revision_not_present(self):
repo = self.make_repository('foo')
revision = 'aaron@aaronbentley.com-20110925012351-s3q6441rx3t'
committer, message, nick, date = get_rev_info(revision, repo)
self.assertEqual('aaron@aaronbentley.com', committer)
self.assertIs(None, message)
self.assertIs(None, nick)
self.assertIs(None, date)
|