1
# Copyright (C) 2005 by Canonical Ltd
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.
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.
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
17
from bzrlib.selftest.testrevision import make_branches
18
from bzrlib.trace import mutter
19
from bzrlib.branch import Branch, find_branch
24
from bzrlib.selftest.HTTPTestUtil import TestCaseWithWebserver
27
class TestFetch(TestCaseWithWebserver):
29
print "REENABLE ME?!!!!! testremotebranch"
31
from bzrlib.fetch import greedy_fetch, has_revision
35
return Branch.initialize(name)
37
#highest indices a: 5, b: 7
38
br_a, br_b = make_branches()
39
# unpack one of br_a's revision files to test .gz fallbacks
40
to_unzip = br_a.revision_history()[-1]
41
to_unzip_source = gzip.open(os.path.join(br_a.base, '.bzr',
44
content = to_unzip_source.read()
45
to_unzip_source.close()
46
os.unlink(os.path.join(br_a.base, '.bzr', 'revision-store',
48
to_unzip_output = open(os.path.join(br_a.base, '.bzr',
49
'revision-store', to_unzip), 'wb')
50
to_unzip_output.write(content)
51
to_unzip_output.close()
53
br_rem = Branch.open(self.get_remote_url(br_a.base))
54
assert not has_revision(br_b, br_rem.revision_history()[3])
55
assert has_revision(br_b, br_rem.revision_history()[2])
56
assert len(br_b.revision_history()) == 7
57
assert greedy_fetch(br_b, br_rem, br_rem.revision_history()[2])[0] == 0
59
# greedy_fetch is not supposed to alter the revision history
60
assert len(br_b.revision_history()) == 7
61
assert not has_revision(br_b, br_rem.revision_history()[3])
63
assert len(br_b.revision_history()) == 7
64
assert greedy_fetch(br_b, br_rem, br_rem.revision_history()[3])[0] == 1
65
assert has_revision(br_b, br_a.revision_history()[3])
66
assert not has_revision(br_rem, br_b.revision_history()[3])
67
assert not has_revision(br_rem, br_b.revision_history()[4])
69
# When a non-branch ancestor is missing, it should be a failure, not
71
br_a4 = new_branch('br_a4')
72
count, failures = greedy_fetch(br_a4, br_rem)
74
assert failures == set((br_b.revision_history()[4],
75
br_b.revision_history()[5]))
77
assert greedy_fetch(br_a, br_b)[0] == 4
78
assert has_revision(br_a, br_b.revision_history()[3])
79
assert has_revision(br_a, br_b.revision_history()[4])
81
br_b2 = new_branch('br_b2')
82
assert greedy_fetch(br_b2, br_b)[0] == 7
83
assert has_revision(br_b2, br_b.revision_history()[4])
84
assert has_revision(br_b2, br_a.revision_history()[2])
85
assert not has_revision(br_b2, br_a.revision_history()[3])
87
br_a2 = new_branch('br_a2')
88
assert greedy_fetch(br_a2, br_rem)[0] == 9
89
assert has_revision(br_a2, br_b.revision_history()[4])
90
assert has_revision(br_a2, br_a.revision_history()[3])