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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
|
# Copyright (C) 2005 by 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
import os
import sys
import bzrlib.errors
from bzrlib.selftest.testrevision import make_branches
from bzrlib.trace import mutter
from bzrlib.branch import Branch
from bzrlib.fetch import greedy_fetch
from bzrlib.selftest import TestCaseInTempDir
def has_revision(branch, revision_id):
try:
branch.get_revision_xml_file(revision_id)
return True
except bzrlib.errors.NoSuchRevision:
return False
class TestFetch(TestCaseInTempDir):
def SKIPPED_old_test_fetch(self):
"""obsolete: new commit code depends on parents being present
so the test data no longer suits this test."""
def new_branch(name):
os.mkdir(name)
return Branch.initialize(name)
#highest indices a: 5, b: 7
br_a, br_b = make_branches()
assert not has_revision(br_b, br_a.revision_history()[3])
assert has_revision(br_b, br_a.revision_history()[2])
assert len(br_b.revision_history()) == 7
assert greedy_fetch(br_b, br_a, br_a.revision_history()[2])[0] == 0
# greedy_fetch is not supposed to alter the revision history
assert len(br_b.revision_history()) == 7
assert not has_revision(br_b, br_a.revision_history()[3])
assert len(br_b.revision_history()) == 7
assert greedy_fetch(br_b, br_a, br_a.revision_history()[3])[0] == 1
assert has_revision(br_b, br_a.revision_history()[3])
assert not has_revision(br_a, br_b.revision_history()[3])
assert not has_revision(br_a, br_b.revision_history()[4])
# When a non-branch ancestor is missing, it should be a failure, not
# exception
br_a4 = new_branch('br_a4')
count, failures = greedy_fetch(br_a4, br_a)
assert count == 6
assert failures == set((br_b.revision_history()[4],
br_b.revision_history()[5]))
assert greedy_fetch(br_a, br_b)[0] == 4
assert has_revision(br_a, br_b.revision_history()[3])
assert has_revision(br_a, br_b.revision_history()[4])
br_b2 = new_branch('br_b2')
assert greedy_fetch(br_b2, br_b)[0] == 7
assert has_revision(br_b2, br_b.revision_history()[4])
assert has_revision(br_b2, br_a.revision_history()[2])
assert not has_revision(br_b2, br_a.revision_history()[3])
br_a2 = new_branch('br_a2')
assert greedy_fetch(br_a2, br_a)[0] == 9
assert has_revision(br_a2, br_b.revision_history()[4])
assert has_revision(br_a2, br_a.revision_history()[3])
br_a3 = new_branch('br_a3')
assert greedy_fetch(br_a3, br_a2)[0] == 0
for revno in range(4):
assert not has_revision(br_a3, br_a.revision_history()[revno])
assert greedy_fetch(br_a3, br_a2, br_a.revision_history()[2])[0] == 3
fetched = greedy_fetch(br_a3, br_a2, br_a.revision_history()[3])[0]
assert fetched == 3, "fetched %d instead of 3" % fetched
# InstallFailed should be raised if the branch is missing the revision
# that was requested.
self.assertRaises(bzrlib.errors.InstallFailed, greedy_fetch, br_a3,
br_a2, 'pizza')
# InstallFailed should be raised if the branch is missing a revision
# from its own revision history
br_a2.append_revision('a-b-c')
self.assertRaises(bzrlib.errors.InstallFailed, greedy_fetch, br_a3,
br_a2)
if __name__ == '__main__':
import unittest
unittest.main()
|