79
90
>>> i.add(InventoryDirectory('123', 'src', ROOT_ID))
80
InventoryDirectory('123', 'src', parent_id='TREE_ROOT')
91
InventoryDirectory('123', 'src', parent_id='TREE_ROOT', revision=None)
81
92
>>> i.add(InventoryFile('2323', 'hello.c', parent_id='123'))
82
InventoryFile('2323', 'hello.c', parent_id='123')
83
>>> shouldbe = {0: 'src', 1: pathjoin('src','hello.c')}
93
InventoryFile('2323', 'hello.c', parent_id='123', sha1=None, len=None)
94
>>> shouldbe = {0: '', 1: 'src', 2: 'src/hello.c'}
84
95
>>> for ix, j in enumerate(i.iter_entries()):
85
96
... print (j[0] == shouldbe[ix], j[1])
87
(True, InventoryDirectory('123', 'src', parent_id='TREE_ROOT'))
88
(True, InventoryFile('2323', 'hello.c', parent_id='123'))
89
>>> i.add(InventoryFile('2323', 'bye.c', '123'))
90
Traceback (most recent call last):
92
BzrError: inventory already contains entry with id {2323}
98
(True, InventoryDirectory('TREE_ROOT', u'', parent_id=None, revision=None))
99
(True, InventoryDirectory('123', 'src', parent_id='TREE_ROOT', revision=None))
100
(True, InventoryFile('2323', 'hello.c', parent_id='123', sha1=None, len=None))
93
101
>>> i.add(InventoryFile('2324', 'bye.c', '123'))
94
InventoryFile('2324', 'bye.c', parent_id='123')
102
InventoryFile('2324', 'bye.c', parent_id='123', sha1=None, len=None)
95
103
>>> i.add(InventoryDirectory('2325', 'wibble', '123'))
96
InventoryDirectory('2325', 'wibble', parent_id='123')
104
InventoryDirectory('2325', 'wibble', parent_id='123', revision=None)
97
105
>>> i.path2id('src/wibble')
101
109
>>> i.add(InventoryFile('2326', 'wibble.c', '2325'))
102
InventoryFile('2326', 'wibble.c', parent_id='2325')
110
InventoryFile('2326', 'wibble.c', parent_id='2325', sha1=None, len=None)
104
InventoryFile('2326', 'wibble.c', parent_id='2325')
112
InventoryFile('2326', 'wibble.c', parent_id='2325', sha1=None, len=None)
105
113
>>> for path, entry in i.iter_entries():
107
... assert i.path2id(path)
136
142
return False, False
138
def diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
139
output_to, reverse=False):
140
"""Perform a diff from this to to_entry.
142
text_diff will be used for textual difference calculation.
143
This is a template method, override _diff in child classes.
145
self._read_tree_state(tree.id2path(self.file_id), tree)
147
# cannot diff from one kind to another - you must do a removal
148
# and an addif they do not match.
149
assert self.kind == to_entry.kind
150
to_entry._read_tree_state(to_tree.id2path(to_entry.file_id),
152
self._diff(text_diff, from_label, tree, to_label, to_entry, to_tree,
155
144
def _diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
156
145
output_to, reverse=False):
157
146
"""Perform a diff between two entries of the same kind."""
159
def find_previous_heads(self, previous_inventories,
160
versioned_file_store,
163
"""Return the revisions and entries that directly preceed this.
165
Returned as a map from revision to inventory entry.
167
This is a map containing the file revisions in all parents
168
for which the file exists, and its revision is not a parent of
169
any other. If the file is new, the set will be empty.
171
:param versioned_file_store: A store where ancestry data on this
172
file id can be queried.
173
:param transaction: The transaction that queries to the versioned
174
file store should be completed under.
175
:param entry_vf: The entry versioned file, if its already available.
148
def parent_candidates(self, previous_inventories):
149
"""Find possible per-file graph parents.
151
This is currently defined by:
152
- Select the last changed revision in the parent inventory.
153
- Do deal with a short lived bug in bzr 0.8's development two entries
154
that have the same last changed but different 'x' bit settings are
177
def get_ancestors(weave, entry):
178
return set(weave.get_ancestry(entry.revision))
179
157
# revision:ie mapping for each ie found in previous_inventories.
181
# revision:ie mapping with one revision for each head.
183
# revision: ancestor list for each head
185
159
# identify candidate head revision ids.
186
160
for inv in previous_inventories:
187
161
if self.file_id in inv:
188
162
ie = inv[self.file_id]
189
assert ie.file_id == self.file_id
190
163
if ie.revision in candidates:
191
164
# same revision value in two different inventories:
192
165
# correct possible inconsistencies:
198
171
ie.executable = False
199
172
except AttributeError:
201
# must now be the same.
202
assert candidates[ie.revision] == ie
204
175
# add this revision as a candidate.
205
176
candidates[ie.revision] = ie
207
# common case optimisation
208
if len(candidates) == 1:
209
# if there is only one candidate revision found
210
# then we can opening the versioned file to access ancestry:
211
# there cannot be any ancestors to eliminate when there is
212
# only one revision available.
213
heads[ie.revision] = ie
216
# eliminate ancestors amongst the available candidates:
217
# heads are those that are not an ancestor of any other candidate
218
# - this provides convergence at a per-file level.
219
for ie in candidates.values():
220
# may be an ancestor of a known head:
221
already_present = 0 != len(
222
[head for head in heads
223
if ie.revision in head_ancestors[head]])
225
# an ancestor of an analyzed candidate.
227
# not an ancestor of a known head:
228
# load the versioned file for this file id if needed
230
entry_vf = versioned_file_store.get_weave_or_empty(
231
self.file_id, transaction)
232
ancestors = get_ancestors(entry_vf, ie)
233
# may knock something else out:
234
check_heads = list(heads.keys())
235
for head in check_heads:
236
if head in ancestors:
237
# this previously discovered 'head' is not
238
# really a head - its an ancestor of the newly
241
head_ancestors[ie.revision] = ancestors
242
heads[ie.revision] = ie
179
@deprecated_method(deprecated_in((1, 6, 0)))
245
180
def get_tar_item(self, root, dp, now, tree):
246
181
"""Get a tarfile item and a file stream for its content."""
247
item = tarfile.TarInfo(pathjoin(root, dp))
182
item = tarfile.TarInfo(osutils.pathjoin(root, dp).encode('utf8'))
248
183
# TODO: would be cool to actually set it to the timestamp of the
249
184
# revision it was last changed
304
239
raise BzrError("don't know how to export {%s} of kind %r" %
305
240
(self.file_id, self.kind))
242
@deprecated_method(deprecated_in((1, 6, 0)))
307
243
def put_on_disk(self, dest, dp, tree):
308
244
"""Create a representation of self on disk in the prefix dest.
310
246
This is a template method - implement _put_on_disk in subclasses.
312
fullpath = pathjoin(dest, dp)
248
fullpath = osutils.pathjoin(dest, dp)
313
249
self._put_on_disk(fullpath, tree)
314
mutter(" export {%s} kind %s to %s", self.file_id,
250
# mutter(" export {%s} kind %s to %s", self.file_id,
251
# self.kind, fullpath)
317
253
def _put_on_disk(self, fullpath, tree):
318
254
"""Put this entry onto disk at fullpath, from tree tree."""
319
255
raise BzrError("don't know how to export {%s} of kind %r" % (self.file_id, self.kind))
321
257
def sorted_children(self):
322
l = self.children.items()
258
return sorted(self.children.items())
327
261
def versionable_kind(kind):
328
return kind in ('file', 'directory', 'symlink')
262
return (kind in ('file', 'directory', 'symlink', 'tree-reference'))
330
264
def check(self, checker, rev_id, inv, tree):
331
265
"""Check this inventory entry is intact.
397
333
return 'unchanged'
399
335
def __repr__(self):
400
return ("%s(%r, %r, parent_id=%r)"
336
return ("%s(%r, %r, parent_id=%r, revision=%r)"
401
337
% (self.__class__.__name__,
406
def snapshot(self, revision, path, previous_entries,
407
work_tree, commit_builder):
408
"""Make a snapshot of this entry which may or may not have changed.
410
This means that all its fields are populated, that it has its
411
text stored in the text store or weave.
413
mutter('new parents of %s are %r', path, previous_entries)
414
self._read_tree_state(path, work_tree)
415
# TODO: Where should we determine whether to reuse a
416
# previous revision id or create a new revision? 20060606
417
if len(previous_entries) == 1:
418
# cannot be unchanged unless there is only one parent file rev.
419
parent_ie = previous_entries.values()[0]
420
if self._unchanged(parent_ie):
421
mutter("found unchanged entry")
422
self.revision = parent_ie.revision
424
return self._snapshot_into_revision(revision, previous_entries,
425
work_tree, commit_builder)
427
def _snapshot_into_revision(self, revision, previous_entries, work_tree,
429
"""Record this revision unconditionally into a store.
431
The entry's last-changed revision property (`revision`) is updated to
432
that of the new revision.
434
:param revision: id of the new revision that is being recorded.
436
:returns: String description of the commit (e.g. "merged", "modified"), etc.
438
mutter('new revision {%s} for {%s}', revision, self.file_id)
439
self.revision = revision
440
self._snapshot_text(previous_entries, work_tree, commit_builder)
442
def _snapshot_text(self, file_parents, work_tree, commit_builder):
443
"""Record the 'text' of this entry, whatever form that takes.
445
This default implementation simply adds an empty text.
447
raise NotImplementedError(self._snapshot_text)
449
343
def __eq__(self, other):
450
344
if not isinstance(other, InventoryEntry):
500
397
class RootEntry(InventoryEntry):
399
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
400
'text_id', 'parent_id', 'children', 'executable',
401
'revision', 'symlink_target', 'reference_revision']
502
403
def _check(self, checker, rev_id, tree):
503
404
"""See InventoryEntry._check"""
505
406
def __init__(self, file_id):
506
407
self.file_id = file_id
507
408
self.children = {}
508
self.kind = 'root_directory'
409
self.kind = 'directory'
509
410
self.parent_id = None
413
symbol_versioning.warn('RootEntry is deprecated as of bzr 0.10.'
414
' Please use InventoryDirectory instead.',
415
DeprecationWarning, stacklevel=2)
512
417
def __eq__(self, other):
513
418
if not isinstance(other, RootEntry):
520
425
class InventoryDirectory(InventoryEntry):
521
426
"""A directory in an inventory."""
428
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
429
'text_id', 'parent_id', 'children', 'executable',
430
'revision', 'symlink_target', 'reference_revision']
523
432
def _check(self, checker, rev_id, tree):
524
433
"""See InventoryEntry._check"""
525
if self.text_sha1 != None or self.text_size != None or self.text_id != None:
434
if self.text_sha1 is not None or self.text_size is not None or self.text_id is not None:
526
435
raise BzrCheckError('directory {%s} has text in revision {%s}'
527
436
% (self.file_id, rev_id))
555
464
"""See InventoryEntry._put_on_disk."""
556
465
os.mkdir(fullpath)
558
def _snapshot_text(self, file_parents, work_tree, commit_builder):
559
"""See InventoryEntry._snapshot_text."""
560
commit_builder.modified_directory(self.file_id, file_parents)
563
468
class InventoryFile(InventoryEntry):
564
469
"""A file in an inventory."""
471
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
472
'text_id', 'parent_id', 'children', 'executable',
473
'revision', 'symlink_target', 'reference_revision']
566
475
def _check(self, checker, tree_revision_id, tree):
567
476
"""See InventoryEntry._check"""
568
t = (self.file_id, self.revision)
569
if t in checker.checked_texts:
570
prev_sha = checker.checked_texts[t]
477
key = (self.file_id, self.revision)
478
if key in checker.checked_texts:
479
prev_sha = checker.checked_texts[key]
571
480
if prev_sha != self.text_sha1:
572
raise BzrCheckError('mismatched sha1 on {%s} in {%s}' %
573
(self.file_id, tree_revision_id))
482
'mismatched sha1 on {%s} in {%s} (%s != %s) %r' %
483
(self.file_id, tree_revision_id, prev_sha, self.text_sha1,
575
486
checker.repeated_text_cnt += 1
578
if self.file_id not in checker.checked_weaves:
579
mutter('check weave {%s}', self.file_id)
580
w = tree.get_weave(self.file_id)
581
# Not passing a progress bar, because it creates a new
582
# progress, which overwrites the current progress,
583
# and doesn't look nice
585
checker.checked_weaves[self.file_id] = True
587
w = tree.get_weave(self.file_id)
589
489
mutter('check version {%s} of {%s}', tree_revision_id, self.file_id)
590
490
checker.checked_text_cnt += 1
591
491
# We can't check the length, because Weave doesn't store that
592
492
# information, and the whole point of looking at the weave's
593
493
# sha1sum is that we don't have to extract the text.
594
if self.text_sha1 != w.get_sha1(self.revision):
595
raise BzrCheckError('text {%s} version {%s} wrong sha1'
596
% (self.file_id, self.revision))
597
checker.checked_texts[t] = self.text_sha1
494
if (self.text_sha1 != tree._repository.texts.get_sha1s([key])[key]):
495
raise BzrCheckError('text {%s} version {%s} wrong sha1' % key)
496
checker.checked_texts[key] = self.text_sha1
600
499
other = InventoryFile(self.file_id, self.name, self.parent_id)
616
513
def _diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
617
514
output_to, reverse=False):
618
515
"""See InventoryEntry._diff."""
620
from_text = tree.get_file(self.file_id).readlines()
622
to_text = to_tree.get_file(to_entry.file_id).readlines()
626
text_diff(from_label, from_text,
627
to_label, to_text, output_to)
629
text_diff(to_label, to_text,
630
from_label, from_text, output_to)
633
label_pair = (to_label, from_label)
635
label_pair = (from_label, to_label)
636
print >> output_to, "Binary files %s and %s differ" % label_pair
516
from bzrlib.diff import DiffText
517
from_file_id = self.file_id
519
to_file_id = to_entry.file_id
523
to_file_id, from_file_id = from_file_id, to_file_id
524
tree, to_tree = to_tree, tree
525
from_label, to_label = to_label, from_label
526
differ = DiffText(tree, to_tree, output_to, 'utf-8', '', '',
528
return differ.diff_text(from_file_id, to_file_id, from_label, to_label)
638
530
def has_text(self):
639
531
"""See InventoryEntry.has_text."""
671
563
# in _read_tree_state
672
564
self.executable = work_tree.is_executable(self.file_id, path=path)
567
return ("%s(%r, %r, parent_id=%r, sha1=%r, len=%s)"
568
% (self.__class__.__name__,
674
575
def _forget_tree_state(self):
675
576
self.text_sha1 = None
676
self.executable = None
678
def _snapshot_text(self, file_parents, work_tree, commit_builder):
679
"""See InventoryEntry._snapshot_text."""
680
def get_content_byte_lines():
681
return work_tree.get_file(self.file_id).readlines()
682
self.text_sha1, self.text_size = commit_builder.modified_file_text(
683
self.file_id, file_parents, get_content_byte_lines, self.text_sha1, self.text_size)
685
578
def _unchanged(self, previous_ie):
686
579
"""See InventoryEntry._unchanged."""
699
592
class InventoryLink(InventoryEntry):
700
593
"""A file in an inventory."""
702
__slots__ = ['symlink_target']
595
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
596
'text_id', 'parent_id', 'children', 'executable',
597
'revision', 'symlink_target', 'reference_revision']
704
599
def _check(self, checker, rev_id, tree):
705
600
"""See InventoryEntry._check"""
706
if self.text_sha1 != None or self.text_size != None or self.text_id != None:
601
if self.text_sha1 is not None or self.text_size is not None or self.text_id is not None:
707
602
raise BzrCheckError('symlink {%s} has text in revision {%s}'
708
603
% (self.file_id, rev_id))
709
604
if self.symlink_target is None:
728
623
def _diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
729
624
output_to, reverse=False):
730
625
"""See InventoryEntry._diff."""
731
from_text = self.symlink_target
626
from bzrlib.diff import DiffSymlink
627
old_target = self.symlink_target
732
628
if to_entry is not None:
733
to_text = to_entry.symlink_target
738
print >>output_to, '=== target changed %r => %r' % (from_text, to_text)
741
print >>output_to, '=== target was %r' % self.symlink_target
743
print >>output_to, '=== target is %r' % self.symlink_target
629
new_target = to_entry.symlink_target
638
new_target, old_target = old_target, new_target
639
differ = DiffSymlink(old_tree, new_tree, output_to)
640
return differ.diff_symlink(old_target, new_target)
745
642
def __init__(self, file_id, name, parent_id):
746
643
super(InventoryLink, self).__init__(file_id, name, parent_id)
780
677
compatible = False
781
678
return compatible
783
def _snapshot_text(self, file_parents, work_tree, commit_builder):
784
"""See InventoryEntry._snapshot_text."""
785
commit_builder.modified_link(
786
self.file_id, file_parents, self.symlink_target)
681
class TreeReference(InventoryEntry):
683
kind = 'tree-reference'
685
def __init__(self, file_id, name, parent_id, revision=None,
686
reference_revision=None):
687
InventoryEntry.__init__(self, file_id, name, parent_id)
688
self.revision = revision
689
self.reference_revision = reference_revision
692
return TreeReference(self.file_id, self.name, self.parent_id,
693
self.revision, self.reference_revision)
695
def _read_tree_state(self, path, work_tree):
696
"""Populate fields in the inventory entry from the given tree.
698
self.reference_revision = work_tree.get_reference_revision(
701
def _forget_tree_state(self):
702
self.reference_revision = None
704
def _unchanged(self, previous_ie):
705
"""See InventoryEntry._unchanged."""
706
compatible = super(TreeReference, self)._unchanged(previous_ie)
707
if self.reference_revision != previous_ie.reference_revision:
789
712
class Inventory(object):
819
742
May also look up by name:
821
744
>>> [x[0] for x in inv.iter_entries()]
823
746
>>> inv = Inventory('TREE_ROOT-12345678-12345678')
824
747
>>> inv.add(InventoryFile('123-123', 'hello.c', ROOT_ID))
825
InventoryFile('123-123', 'hello.c', parent_id='TREE_ROOT-12345678-12345678')
748
Traceback (most recent call last):
749
BzrError: parent_id {TREE_ROOT} not in inventory
750
>>> inv.add(InventoryFile('123-123', 'hello.c', 'TREE_ROOT-12345678-12345678'))
751
InventoryFile('123-123', 'hello.c', parent_id='TREE_ROOT-12345678-12345678', sha1=None, len=None)
827
753
def __init__(self, root_id=ROOT_ID, revision_id=None):
828
754
"""Create or read an inventory.
834
760
The inventory is created with a default root directory, with
837
# We are letting Branch.create() create a unique inventory
838
# root id. Rather than generating a random one here.
840
# root_id = bzrlib.branch.gen_file_id('TREE_ROOT')
841
self.root = RootEntry(root_id)
763
if root_id is not None:
764
self._set_root(InventoryDirectory(root_id, u'', None))
842
768
self.revision_id = revision_id
771
return "<Inventory object at %x, contents=%r>" % (id(self), self._byid)
773
def apply_delta(self, delta):
774
"""Apply a delta to this inventory.
776
:param delta: A list of changes to apply. After all the changes are
777
applied the final inventory must be internally consistent, but it
778
is ok to supply changes which, if only half-applied would have an
779
invalid result - such as supplying two changes which rename two
780
files, 'A' and 'B' with each other : [('A', 'B', 'A-id', a_entry),
781
('B', 'A', 'B-id', b_entry)].
783
Each change is a tuple, of the form (old_path, new_path, file_id,
786
When new_path is None, the change indicates the removal of an entry
787
from the inventory and new_entry will be ignored (using None is
788
appropriate). If new_path is not None, then new_entry must be an
789
InventoryEntry instance, which will be incorporated into the
790
inventory (and replace any existing entry with the same file id).
792
When old_path is None, the change indicates the addition of
793
a new entry to the inventory.
795
When neither new_path nor old_path are None, the change is a
796
modification to an entry, such as a rename, reparent, kind change
799
The children attribute of new_entry is ignored. This is because
800
this method preserves children automatically across alterations to
801
the parent of the children, and cases where the parent id of a
802
child is changing require the child to be passed in as a separate
803
change regardless. E.g. in the recursive deletion of a directory -
804
the directory's children must be included in the delta, or the
805
final inventory will be invalid.
808
# Remove all affected items which were in the original inventory,
809
# starting with the longest paths, thus ensuring parents are examined
810
# after their children, which means that everything we examine has no
811
# modified children remaining by the time we examine it.
812
for old_path, file_id in sorted(((op, f) for op, np, f, e in delta
813
if op is not None), reverse=True):
814
if file_id not in self:
817
# Preserve unaltered children of file_id for later reinsertion.
818
file_id_children = getattr(self[file_id], 'children', {})
819
if len(file_id_children):
820
children[file_id] = file_id_children
821
# Remove file_id and the unaltered children. If file_id is not
822
# being deleted it will be reinserted back later.
823
self.remove_recursive_id(file_id)
824
# Insert all affected which should be in the new inventory, reattaching
825
# their children if they had any. This is done from shortest path to
826
# longest, ensuring that items which were modified and whose parents in
827
# the resulting inventory were also modified, are inserted after their
829
for new_path, new_entry in sorted((np, e) for op, np, f, e in
830
delta if np is not None):
831
if new_entry.kind == 'directory':
832
# Pop the child which to allow detection of children whose
833
# parents were deleted and which were not reattached to a new
835
new_entry.children = children.pop(new_entry.file_id, {})
838
# Get the parent id that was deleted
839
parent_id, children = children.popitem()
840
raise errors.InconsistentDelta("<deleted>", parent_id,
841
"The file id was deleted but its children were not deleted.")
843
def _set_root(self, ie):
843
845
self._byid = {self.root.file_id: self.root}
846
848
# TODO: jam 20051218 Should copy also copy the revision_id?
847
other = Inventory(self.root.file_id)
849
entries = self.iter_entries()
850
if self.root is None:
851
return Inventory(root_id=None)
852
other = Inventory(entries.next()[1].file_id)
853
other.root.revision = self.root.revision
848
854
# copy recursively so we know directories will be added before
849
855
# their children. There are more efficient ways than this...
850
for path, entry in self.iter_entries():
851
if entry == self.root:
856
for path, entry in entries:
853
857
other.add(entry.copy())
910
917
lexicographically sorted order, and is a hybrid between
911
918
depth-first and breadth-first.
920
:param yield_parents: If True, yield the parents from the root leading
921
down to specific_file_ids that have been requested. This has no
922
impact if specific_file_ids is None.
913
923
:return: This yields (path, entry) pairs
925
if specific_file_ids and not isinstance(specific_file_ids, set):
926
specific_file_ids = set(specific_file_ids)
915
927
# TODO? Perhaps this should return the from_dir so that the root is
916
928
# yielded? or maybe an option?
917
929
if from_dir is None:
930
if self.root is None:
932
# Optimize a common case
933
if (not yield_parents and specific_file_ids is not None and
934
len(specific_file_ids) == 1):
935
file_id = list(specific_file_ids)[0]
937
yield self.id2path(file_id), self[file_id]
919
939
from_dir = self.root
940
if (specific_file_ids is None or yield_parents or
941
self.root.file_id in specific_file_ids):
920
943
elif isinstance(from_dir, basestring):
921
944
from_dir = self._byid[from_dir]
946
if specific_file_ids is not None:
947
# TODO: jam 20070302 This could really be done as a loop rather
948
# than a bunch of recursive calls.
951
def add_ancestors(file_id):
952
if file_id not in byid:
954
parent_id = byid[file_id].parent_id
955
if parent_id is None:
957
if parent_id not in parents:
958
parents.add(parent_id)
959
add_ancestors(parent_id)
960
for file_id in specific_file_ids:
961
add_ancestors(file_id)
923
965
stack = [(u'', from_dir)]
930
972
child_relpath = cur_relpath + child_name
932
yield child_relpath, child_ie
974
if (specific_file_ids is None or
975
child_ie.file_id in specific_file_ids or
976
(yield_parents and child_ie.file_id in parents)):
977
yield child_relpath, child_ie
934
979
if child_ie.kind == 'directory':
935
child_dirs.append((child_relpath+'/', child_ie))
980
if parents is None or child_ie.file_id in parents:
981
child_dirs.append((child_relpath+'/', child_ie))
936
982
stack.extend(reversed(child_dirs))
984
def make_entry(self, kind, name, parent_id, file_id=None):
985
"""Simple thunk to bzrlib.inventory.make_entry."""
986
return make_entry(kind, name, parent_id, file_id)
938
988
def entries(self):
939
989
"""Return list of (path, ie) for all entries except the root.
975
1025
>>> inv = Inventory()
976
1026
>>> inv.add(InventoryFile('123', 'foo.c', ROOT_ID))
977
InventoryFile('123', 'foo.c', parent_id='TREE_ROOT')
1027
InventoryFile('123', 'foo.c', parent_id='TREE_ROOT', sha1=None, len=None)
978
1028
>>> '123' in inv
980
1030
>>> '456' in inv
983
return file_id in self._byid
1033
return (file_id in self._byid)
985
1035
def __getitem__(self, file_id):
986
1036
"""Return the entry for given file_id.
988
1038
>>> inv = Inventory()
989
1039
>>> inv.add(InventoryFile('123123', 'hello.c', ROOT_ID))
990
InventoryFile('123123', 'hello.c', parent_id='TREE_ROOT')
1040
InventoryFile('123123', 'hello.c', parent_id='TREE_ROOT', sha1=None, len=None)
991
1041
>>> inv['123123'].name
995
1045
return self._byid[file_id]
996
1046
except KeyError:
998
raise BzrError("can't look up file_id None")
1000
raise BzrError("file_id {%s} not in inventory" % file_id)
1047
# really we're passing an inventory, not a tree...
1048
raise errors.NoSuchId(self, file_id)
1002
1050
def get_file_kind(self, file_id):
1003
1051
return self._byid[file_id].kind
1014
1072
Returns the new entry object.
1016
1074
if entry.file_id in self._byid:
1017
raise BzrError("inventory already contains entry with id {%s}" % entry.file_id)
1019
if entry.parent_id == ROOT_ID or entry.parent_id is None:
1020
entry.parent_id = self.root.file_id
1023
parent = self._byid[entry.parent_id]
1025
raise BzrError("parent_id {%s} not in inventory" % entry.parent_id)
1027
if parent.children.has_key(entry.name):
1028
raise BzrError("%s is already versioned" %
1029
pathjoin(self.id2path(parent.file_id), entry.name))
1031
self._byid[entry.file_id] = entry
1032
parent.children[entry.name] = entry
1075
raise errors.DuplicateFileId(entry.file_id,
1076
self._byid[entry.file_id])
1078
if entry.parent_id is None:
1082
parent = self._byid[entry.parent_id]
1084
raise BzrError("parent_id {%s} not in inventory" %
1087
if entry.name in parent.children:
1088
raise BzrError("%s is already versioned" %
1089
osutils.pathjoin(self.id2path(parent.file_id),
1090
entry.name).encode('utf-8'))
1091
parent.children[entry.name] = entry
1092
return self._add_child(entry)
1035
1094
def add_path(self, relpath, kind, file_id=None, parent_id=None):
1036
1095
"""Add entry from a path.
1086
1141
>>> i1.add(InventoryFile('123', 'foo', ROOT_ID))
1087
InventoryFile('123', 'foo', parent_id='TREE_ROOT')
1142
InventoryFile('123', 'foo', parent_id='TREE_ROOT', sha1=None, len=None)
1090
1145
>>> i2.add(InventoryFile('123', 'foo', ROOT_ID))
1091
InventoryFile('123', 'foo', parent_id='TREE_ROOT')
1146
InventoryFile('123', 'foo', parent_id='TREE_ROOT', sha1=None, len=None)
1095
1150
if not isinstance(other, Inventory):
1096
1151
return NotImplemented
1098
if len(self._byid) != len(other._byid):
1099
# shortcut: obviously not the same
1102
1153
return self._byid == other._byid
1104
1155
def __ne__(self, other):
1177
1231
return bool(self.path2id(names))
1179
1233
def has_id(self, file_id):
1180
return self._byid.has_key(file_id)
1234
return (file_id in self._byid)
1236
def remove_recursive_id(self, file_id):
1237
"""Remove file_id, and children, from the inventory.
1239
:param file_id: A file_id to remove.
1241
to_find_delete = [self._byid[file_id]]
1243
while to_find_delete:
1244
ie = to_find_delete.pop()
1245
to_delete.append(ie.file_id)
1246
if ie.kind == 'directory':
1247
to_find_delete.extend(ie.children.values())
1248
for file_id in reversed(to_delete):
1250
del self._byid[file_id]
1251
if ie.parent_id is not None:
1252
del self[ie.parent_id].children[ie.name]
1182
1256
def rename(self, file_id, new_parent_id, new_name):
1183
1257
"""Move a file within the inventory.
1185
1259
This can change either the name, or the parent, or both.
1187
This does not move the working file."""
1261
This does not move the working file.
1263
new_name = ensure_normalized_name(new_name)
1188
1264
if not is_valid_name(new_name):
1189
1265
raise BzrError("not an acceptable filename: %r" % new_name)
1218
1304
:param file_id: the file_id to use. if None, one will be created.
1220
1306
if file_id is None:
1221
file_id = bzrlib.workingtree.gen_file_id(name)
1222
if kind == 'directory':
1223
return InventoryDirectory(file_id, name, parent_id)
1224
elif kind == 'file':
1225
return InventoryFile(file_id, name, parent_id)
1226
elif kind == 'symlink':
1227
return InventoryLink(file_id, name, parent_id)
1307
file_id = generate_ids.gen_file_id(name)
1308
name = ensure_normalized_name(name)
1310
factory = entry_factory[kind]
1229
1312
raise BzrError("unknown kind %r" % kind)
1313
return factory(file_id, name, parent_id)
1316
def ensure_normalized_name(name):
1319
:raises InvalidNormalization: When name is not normalized, and cannot be
1320
accessed on this platform by the normalized path.
1321
:return: The NFC normalised version of name.
1323
#------- This has been copied to bzrlib.dirstate.DirState.add, please
1324
# keep them synchronised.
1325
# we dont import normalized_filename directly because we want to be
1326
# able to change the implementation at runtime for tests.
1327
norm_name, can_access = osutils.normalized_filename(name)
1328
if norm_name != name:
1332
# TODO: jam 20060701 This would probably be more useful
1333
# if the error was raised with the full path
1334
raise errors.InvalidNormalization(name)
1233
1338
_NAME_RE = None