109
print >>to_file, '%s %-30s %s' % (short_status_letter, path, fid)
105
print >>to_file, ' %-30s %s' % (path, fid)
111
print >>to_file, '%s %s' % (short_status_letter, path)
107
print >>to_file, ' ', path
115
print >>to_file, 'removed:'
116
show_list(self.removed)
118
show_list(self.removed, 'D')
110
print >>to_file, 'removed:'
111
show_list(self.removed)
122
print >>to_file, 'added:'
123
show_list(self.added)
125
show_list(self.added, 'A')
114
print >>to_file, 'added:'
115
show_list(self.added)
127
117
extra_modified = []
130
short_status_letter = 'R'
132
print >>to_file, 'renamed:'
133
short_status_letter = ''
120
print >>to_file, 'renamed:'
134
121
for (oldpath, newpath, fid, kind,
135
122
text_modified, meta_modified) in self.renamed:
136
123
if text_modified or meta_modified:
139
126
if meta_modified:
142
print >>to_file, '%s %s => %s %s' % (short_status_letter,
143
oldpath, newpath, fid)
129
print >>to_file, ' %s => %s %s' % (oldpath, newpath, fid)
145
print >>to_file, '%s %s => %s' % (short_status_letter,
131
print >>to_file, ' %s => %s' % (oldpath, newpath)
148
133
if self.modified or extra_modified:
149
short_status_letter = 'M'
151
print >>to_file, 'modified:'
152
short_status_letter = ''
153
show_list(self.modified, short_status_letter)
154
show_list(extra_modified, short_status_letter)
134
print >>to_file, 'modified:'
135
show_list(self.modified)
136
show_list(extra_modified)
156
138
if show_unchanged and self.unchanged:
158
print >>to_file, 'unchanged:'
159
show_list(self.unchanged)
161
show_list(self.unchanged, 'S')
164
@deprecated_function(zero_nine)
165
def compare_trees(old_tree, new_tree, want_unchanged=False,
166
specific_files=None, extra_trees=None,
167
require_versioned=False):
168
"""compare_trees was deprecated in 0.10. Please see Tree.changes_from."""
169
return new_tree.changes_from(old_tree,
170
want_unchanged=want_unchanged,
171
specific_files=specific_files,
172
extra_trees=extra_trees,
173
require_versioned=require_versioned,
177
def _compare_trees(old_tree, new_tree, want_unchanged, specific_file_ids,
139
print >>to_file, 'unchanged:'
140
show_list(self.unchanged)
144
def compare_trees(old_tree, new_tree, want_unchanged=False, specific_files=None):
145
"""Describe changes from one tree to another.
147
Returns a TreeDelta with details of added, modified, renamed, and
150
The root entry is specifically exempt.
152
This only considers versioned files.
155
If true, also list files unchanged from one version to
159
If true, only check for changes to specified names or
163
from osutils import is_inside_any
165
old_inv = old_tree.inventory
166
new_inv = new_tree.inventory
179
167
delta = TreeDelta()
180
# mutter('start compare_trees')
182
for (file_id, path, content_change, versioned, parent_id, name, kind,
183
executable) in new_tree._iter_changes(old_tree, want_unchanged,
185
if not include_root and (None, None) == parent_id:
187
assert kind[0] == kind[1] or None in kind
188
# the only 'kind change' permitted is creation/deletion
189
fully_present = tuple((versioned[x] and kind[x] is not None) for
191
if fully_present[0] != fully_present[1]:
192
if fully_present[1] is True:
193
delta.added.append((path, file_id, kind[1]))
195
assert fully_present[0] is True
196
old_path = old_tree.id2path(file_id)
197
delta.removed.append((old_path, file_id, kind[0]))
198
elif fully_present[0] is False:
200
elif name[0] != name[1] or parent_id[0] != parent_id[1]:
201
# If the name changes, or the parent_id changes, we have a rename
202
# (if we move a parent, that doesn't count as a rename for the
204
old_path = old_tree.id2path(file_id)
205
delta.renamed.append((old_path,
210
(executable[0] != executable[1])))
211
elif content_change is True or executable[0] != executable[1]:
212
delta.modified.append((path, file_id, kind[1],
214
(executable[0] != executable[1])))
168
mutter('start compare_trees')
170
# TODO: match for specific files can be rather smarter by finding
171
# the IDs of those files up front and then considering only that.
173
for file_id in old_tree:
174
if file_id in new_tree:
175
old_ie = old_inv[file_id]
176
new_ie = new_inv[file_id]
179
assert kind == new_ie.kind
181
assert kind in InventoryEntry.known_kinds, \
182
'invalid file kind %r' % kind
184
if kind == 'root_directory':
188
if (not is_inside_any(specific_files, old_inv.id2path(file_id))
189
and not is_inside_any(specific_files, new_inv.id2path(file_id))):
192
# temporary hack until all entries are populated before clients
194
old_path = old_inv.id2path(file_id)
195
new_path = new_inv.id2path(file_id)
196
old_ie._read_tree_state(old_path, old_tree)
197
new_ie._read_tree_state(new_path, new_tree)
198
text_modified, meta_modified = new_ie.detect_changes(old_ie)
200
# TODO: Can possibly avoid calculating path strings if the
201
# two files are unchanged and their names and parents are
202
# the same and the parents are unchanged all the way up.
203
# May not be worthwhile.
205
if (old_ie.name != new_ie.name
206
or old_ie.parent_id != new_ie.parent_id):
207
delta.renamed.append((old_path,
210
text_modified, meta_modified))
211
elif text_modified or meta_modified:
212
delta.modified.append((new_path, file_id, kind,
213
text_modified, meta_modified))
215
delta.unchanged.append((new_path, file_id, kind))
216
delta.unchanged.append((path, file_id, kind[1]))
217
kind = old_inv.get_file_kind(file_id)
218
if kind == 'root_directory':
220
old_path = old_inv.id2path(file_id)
222
if not is_inside_any(specific_files, old_path):
224
delta.removed.append((old_path, file_id, kind))
226
mutter('start looking for new files')
227
for file_id in new_inv:
228
if file_id in old_inv or file_id not in new_tree:
230
kind = new_inv.get_file_kind(file_id)
231
if kind == 'root_directory':
233
new_path = new_inv.id2path(file_id)
235
if not is_inside_any(specific_files, new_path):
237
delta.added.append((new_path, file_id, kind))
218
239
delta.removed.sort()
219
240
delta.added.sort()
220
241
delta.renamed.sort()
221
# TODO: jam 20060529 These lists shouldn't need to be sorted
222
# since we added them in alphabetical order.
223
242
delta.modified.sort()
224
243
delta.unchanged.sort()