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
|
# 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 bzrlib.errors
from bzrlib.selftest.testrevision import make_branches
from bzrlib.trace import mutter
from bzrlib.branch import Branch, find_branch
import gzip
import sys
import os
from bzrlib.selftest.HTTPTestUtil import TestCaseWithWebserver
class TestFetch(TestCaseWithWebserver):
def runTest(self):
print "REENABLE ME?!!!!! testremotebranch"
return
from bzrlib.fetch import greedy_fetch, has_revision
def new_branch(name):
os.mkdir(name)
return Branch.initialize(name)
#highest indices a: 5, b: 7
br_a, br_b = make_branches()
# unpack one of br_a's revision files to test .gz fallbacks
to_unzip = br_a.revision_history()[-1]
to_unzip_source = gzip.open(os.path.join(br_a.base, '.bzr',
'revision-store',
to_unzip + '.gz'))
content = to_unzip_source.read()
to_unzip_source.close()
os.unlink(os.path.join(br_a.base, '.bzr', 'revision-store',
to_unzip + '.gz'))
to_unzip_output = open(os.path.join(br_a.base, '.bzr',
'revision-store', to_unzip), 'wb')
to_unzip_output.write(content)
to_unzip_output.close()
br_rem = Branch.open(self.get_remote_url(br_a.base))
assert not has_revision(br_b, br_rem.revision_history()[3])
assert has_revision(br_b, br_rem.revision_history()[2])
assert len(br_b.revision_history()) == 7
assert greedy_fetch(br_b, br_rem, br_rem.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_rem.revision_history()[3])
assert len(br_b.revision_history()) == 7
assert greedy_fetch(br_b, br_rem, br_rem.revision_history()[3])[0] == 1
assert has_revision(br_b, br_a.revision_history()[3])
assert not has_revision(br_rem, br_b.revision_history()[3])
assert not has_revision(br_rem, 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_rem)
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_rem)[0] == 9
assert has_revision(br_a2, br_b.revision_history()[4])
assert has_revision(br_a2, br_a.revision_history()[3])
|