81
75
>>> i.add(InventoryDirectory('123', 'src', ROOT_ID))
82
InventoryDirectory('123', 'src', parent_id='TREE_ROOT', revision=None)
76
InventoryDirectory('123', 'src', parent_id='TREE_ROOT')
83
77
>>> i.add(InventoryFile('2323', 'hello.c', parent_id='123'))
84
InventoryFile('2323', 'hello.c', parent_id='123', sha1=None, len=None)
85
>>> shouldbe = {0: '', 1: 'src', 2: pathjoin('src','hello.c')}
86
>>> for ix, j in enumerate(i.iter_entries()):
87
... print (j[0] == shouldbe[ix], j[1])
78
InventoryFile('2323', 'hello.c', parent_id='123')
79
>>> for j in i.iter_entries():
89
(True, InventoryDirectory('TREE_ROOT', '', parent_id=None, revision=None))
90
(True, InventoryDirectory('123', 'src', parent_id='TREE_ROOT', revision=None))
91
(True, InventoryFile('2323', 'hello.c', parent_id='123', sha1=None, len=None))
82
('src', InventoryDirectory('123', 'src', parent_id='TREE_ROOT'))
83
('src/hello.c', InventoryFile('2323', 'hello.c', parent_id='123'))
92
84
>>> i.add(InventoryFile('2323', 'bye.c', '123'))
93
85
Traceback (most recent call last):
95
87
BzrError: inventory already contains entry with id {2323}
96
88
>>> i.add(InventoryFile('2324', 'bye.c', '123'))
97
InventoryFile('2324', 'bye.c', parent_id='123', sha1=None, len=None)
89
InventoryFile('2324', 'bye.c', parent_id='123')
98
90
>>> i.add(InventoryDirectory('2325', 'wibble', '123'))
99
InventoryDirectory('2325', 'wibble', parent_id='123', revision=None)
91
InventoryDirectory('2325', 'wibble', parent_id='123')
100
92
>>> i.path2id('src/wibble')
104
96
>>> i.add(InventoryFile('2326', 'wibble.c', '2325'))
105
InventoryFile('2326', 'wibble.c', parent_id='2325', sha1=None, len=None)
97
InventoryFile('2326', 'wibble.c', parent_id='2325')
107
InventoryFile('2326', 'wibble.c', parent_id='2325', sha1=None, len=None)
99
InventoryFile('2326', 'wibble.c', parent_id='2325')
108
100
>>> for path, entry in i.iter_entries():
101
... print path.replace('\\\\', '/') # for win32 os.sep
110
102
... assert i.path2id(path)
117
108
src/wibble/wibble.c
118
>>> i.id2path('2326')
109
>>> i.id2path('2326').replace('\\\\', '/')
119
110
'src/wibble/wibble.c'
122
# Constants returned by describe_change()
124
# TODO: These should probably move to some kind of FileChangeDescription
125
# class; that's like what's inside a TreeDelta but we want to be able to
126
# generate them just for one file at a time.
128
MODIFIED_AND_RENAMED = 'modified and renamed'
113
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
114
'text_id', 'parent_id', 'children', 'executable',
117
def _add_text_to_weave(self, new_lines, parents, weave_store, transaction):
118
weave_store.add_text(self.file_id, self.revision, new_lines, parents,
132
121
def detect_changes(self, old_entry):
133
122
"""Return a (text_modified, meta_modified) from this to old_entry.
158
147
output_to, reverse=False):
159
148
"""Perform a diff between two entries of the same kind."""
161
def find_previous_heads(self, previous_inventories,
162
versioned_file_store,
165
"""Return the revisions and entries that directly precede this.
150
def find_previous_heads(self, previous_inventories, entry_weave):
151
"""Return the revisions and entries that directly preceed this.
167
153
Returned as a map from revision to inventory entry.
169
155
This is a map containing the file revisions in all parents
170
156
for which the file exists, and its revision is not a parent of
171
157
any other. If the file is new, the set will be empty.
173
:param versioned_file_store: A store where ancestry data on this
174
file id can be queried.
175
:param transaction: The transaction that queries to the versioned
176
file store should be completed under.
177
:param entry_vf: The entry versioned file, if its already available.
179
159
def get_ancestors(weave, entry):
180
return set(weave.get_ancestry(entry.revision))
181
# revision:ie mapping for each ie found in previous_inventories.
183
# revision:ie mapping with one revision for each head.
160
return set(map(weave.idx_to_name,
161
weave.inclusions([weave.lookup(entry.revision)])))
185
# revision: ancestor list for each head
186
163
head_ancestors = {}
187
# identify candidate head revision ids.
188
164
for inv in previous_inventories:
189
165
if self.file_id in inv:
190
166
ie = inv[self.file_id]
191
167
assert ie.file_id == self.file_id
192
if ie.revision in candidates:
193
# same revision value in two different inventories:
194
# correct possible inconsistencies:
195
# * there was a bug in revision updates with 'x' bit
168
if ie.revision in heads:
169
# fixup logic, there was a bug in revision updates.
170
# with x bit support.
198
if candidates[ie.revision].executable != ie.executable:
199
candidates[ie.revision].executable = False
172
if heads[ie.revision].executable != ie.executable:
173
heads[ie.revision].executable = False
200
174
ie.executable = False
201
175
except AttributeError:
203
# must now be the same.
204
assert candidates[ie.revision] == ie
177
assert heads[ie.revision] == ie
206
# add this revision as a candidate.
207
candidates[ie.revision] = ie
209
# common case optimisation
210
if len(candidates) == 1:
211
# if there is only one candidate revision found
212
# then we can opening the versioned file to access ancestry:
213
# there cannot be any ancestors to eliminate when there is
214
# only one revision available.
215
heads[ie.revision] = ie
218
# eliminate ancestors amongst the available candidates:
219
# heads are those that are not an ancestor of any other candidate
220
# - this provides convergence at a per-file level.
221
for ie in candidates.values():
222
# may be an ancestor of a known head:
223
already_present = 0 != len(
224
[head for head in heads
225
if ie.revision in head_ancestors[head]])
227
# an ancestor of an analyzed candidate.
229
# not an ancestor of a known head:
230
# load the versioned file for this file id if needed
232
entry_vf = versioned_file_store.get_weave_or_empty(
233
self.file_id, transaction)
234
ancestors = get_ancestors(entry_vf, ie)
235
# may knock something else out:
236
check_heads = list(heads.keys())
237
for head in check_heads:
238
if head in ancestors:
239
# this previously discovered 'head' is not
240
# really a head - its an ancestor of the newly
243
head_ancestors[ie.revision] = ancestors
244
heads[ie.revision] = ie
179
# may want to add it.
180
# may already be covered:
181
already_present = 0 != len(
182
[head for head in heads
183
if ie.revision in head_ancestors[head]])
185
# an ancestor of a known head.
188
ancestors = get_ancestors(entry_weave, ie)
189
# may knock something else out:
190
check_heads = list(heads.keys())
191
for head in check_heads:
192
if head in ancestors:
193
# this head is not really a head
195
head_ancestors[ie.revision] = ancestors
196
heads[ie.revision] = ie
247
199
def get_tar_item(self, root, dp, now, tree):
248
200
"""Get a tarfile item and a file stream for its content."""
249
item = tarfile.TarInfo(pathjoin(root, dp))
201
item = tarfile.TarInfo(os.path.join(root, dp))
250
202
# TODO: would be cool to actually set it to the timestamp of the
251
203
# revision it was last changed
312
265
This is a template method - implement _put_on_disk in subclasses.
314
fullpath = pathjoin(dest, dp)
267
fullpath = appendpath(dest, dp)
315
268
self._put_on_disk(fullpath, tree)
316
# mutter(" export {%s} kind %s to %s", self.file_id,
317
# self.kind, fullpath)
269
mutter(" export {%s} kind %s to %s" % (self.file_id, self.kind, fullpath))
319
271
def _put_on_disk(self, fullpath, tree):
320
272
"""Put this entry onto disk at fullpath, from tree tree."""
321
273
raise BzrError("don't know how to export {%s} of kind %r" % (self.file_id, self.kind))
323
275
def sorted_children(self):
324
return sorted(self.children.items())
276
l = self.children.items()
327
281
def versionable_kind(kind):
352
298
raise BzrCheckError('unknown entry kind %r in revision {%s}' %
353
299
(self.kind, rev_id))
356
303
"""Clone this inventory entry."""
357
304
raise NotImplementedError
360
def describe_change(old_entry, new_entry):
361
"""Describe the change between old_entry and this.
363
This smells of being an InterInventoryEntry situation, but as its
364
the first one, we're making it a static method for now.
366
An entry with a different parent, or different name is considered
367
to be renamed. Reparenting is an internal detail.
368
Note that renaming the parent does not trigger a rename for the
371
# TODO: Perhaps return an object rather than just a string
372
if old_entry is new_entry:
373
# also the case of both being None
375
elif old_entry is None:
306
def _get_snapshot_change(self, previous_entries):
307
if len(previous_entries) > 1:
309
elif len(previous_entries) == 0:
377
elif new_entry is None:
379
text_modified, meta_modified = new_entry.detect_changes(old_entry)
380
if text_modified or meta_modified:
384
# TODO 20060511 (mbp, rbc) factor out 'detect_rename' here.
385
if old_entry.parent_id != new_entry.parent_id:
387
elif old_entry.name != new_entry.name:
391
if renamed and not modified:
392
return InventoryEntry.RENAMED
393
if modified and not renamed:
395
if modified and renamed:
396
return InventoryEntry.MODIFIED_AND_RENAMED
312
return 'modified/renamed/reparented'
399
314
def __repr__(self):
400
return ("%s(%r, %r, parent_id=%r, revision=%r)"
315
return ("%s(%r, %r, parent_id=%r)"
401
316
% (self.__class__.__name__,
407
321
def snapshot(self, revision, path, previous_entries,
408
work_tree, commit_builder):
322
work_tree, weave_store, transaction):
409
323
"""Make a snapshot of this entry which may or may not have changed.
411
325
This means that all its fields are populated, that it has its
412
326
text stored in the text store or weave.
414
# mutter('new parents of %s are %r', path, previous_entries)
328
mutter('new parents of %s are %r', path, previous_entries)
415
329
self._read_tree_state(path, work_tree)
416
# TODO: Where should we determine whether to reuse a
417
# previous revision id or create a new revision? 20060606
418
330
if len(previous_entries) == 1:
419
331
# cannot be unchanged unless there is only one parent file rev.
420
332
parent_ie = previous_entries.values()[0]
421
333
if self._unchanged(parent_ie):
422
# mutter("found unchanged entry")
334
mutter("found unchanged entry")
423
335
self.revision = parent_ie.revision
424
336
return "unchanged"
425
return self._snapshot_into_revision(revision, previous_entries,
426
work_tree, commit_builder)
428
def _snapshot_into_revision(self, revision, previous_entries, work_tree,
430
"""Record this revision unconditionally into a store.
432
The entry's last-changed revision property (`revision`) is updated to
433
that of the new revision.
435
:param revision: id of the new revision that is being recorded.
437
:returns: String description of the commit (e.g. "merged", "modified"), etc.
439
# mutter('new revision {%s} for {%s}', revision, self.file_id)
337
return self.snapshot_revision(revision, previous_entries,
338
work_tree, weave_store, transaction)
340
def snapshot_revision(self, revision, previous_entries, work_tree,
341
weave_store, transaction):
342
"""Record this revision unconditionally."""
343
mutter('new revision for {%s}', self.file_id)
440
344
self.revision = revision
441
self._snapshot_text(previous_entries, work_tree, commit_builder)
345
change = self._get_snapshot_change(previous_entries)
346
self._snapshot_text(previous_entries, work_tree, weave_store,
443
def _snapshot_text(self, file_parents, work_tree, commit_builder):
350
def _snapshot_text(self, file_parents, work_tree, weave_store, transaction):
444
351
"""Record the 'text' of this entry, whatever form that takes.
446
353
This default implementation simply adds an empty text.
448
raise NotImplementedError(self._snapshot_text)
355
mutter('storing file {%s} in revision {%s}',
356
self.file_id, self.revision)
357
self._add_text_to_weave([], file_parents, weave_store, transaction)
450
359
def __eq__(self, other):
451
360
if not isinstance(other, InventoryEntry):
494
403
# first requested, or preload them if they're already known
495
404
pass # nothing to do by default
497
def _forget_tree_state(self):
501
407
class RootEntry(InventoryEntry):
503
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
504
'text_id', 'parent_id', 'children', 'executable',
505
'revision', 'symlink_target']
507
409
def _check(self, checker, rev_id, tree):
508
410
"""See InventoryEntry._check"""
510
412
def __init__(self, file_id):
511
413
self.file_id = file_id
512
414
self.children = {}
513
self.kind = 'directory'
415
self.kind = 'root_directory'
514
416
self.parent_id = None
517
warn('RootEntry is deprecated as of bzr 0.10. Please use '
518
'InventoryDirectory instead.',
519
DeprecationWarning, stacklevel=2)
521
419
def __eq__(self, other):
522
420
if not isinstance(other, RootEntry):
568
462
"""See InventoryEntry._put_on_disk."""
569
463
os.mkdir(fullpath)
571
def _snapshot_text(self, file_parents, work_tree, commit_builder):
572
"""See InventoryEntry._snapshot_text."""
573
commit_builder.modified_directory(self.file_id, file_parents)
576
466
class InventoryFile(InventoryEntry):
577
467
"""A file in an inventory."""
579
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
580
'text_id', 'parent_id', 'children', 'executable',
581
'revision', 'symlink_target']
583
def _check(self, checker, tree_revision_id, tree):
469
def _check(self, checker, rev_id, tree):
584
470
"""See InventoryEntry._check"""
585
t = (self.file_id, self.revision)
471
revision = self.revision
472
t = (self.file_id, revision)
586
473
if t in checker.checked_texts:
587
prev_sha = checker.checked_texts[t]
474
prev_sha = checker.checked_texts[t]
588
475
if prev_sha != self.text_sha1:
589
476
raise BzrCheckError('mismatched sha1 on {%s} in {%s}' %
590
(self.file_id, tree_revision_id))
477
(self.file_id, rev_id))
592
479
checker.repeated_text_cnt += 1
595
if self.file_id not in checker.checked_weaves:
596
mutter('check weave {%s}', self.file_id)
597
w = tree.get_weave(self.file_id)
598
# Not passing a progress bar, because it creates a new
599
# progress, which overwrites the current progress,
600
# and doesn't look nice
602
checker.checked_weaves[self.file_id] = True
604
w = tree.get_weave(self.file_id)
606
mutter('check version {%s} of {%s}', tree_revision_id, self.file_id)
607
checker.checked_text_cnt += 1
608
# We can't check the length, because Weave doesn't store that
609
# information, and the whole point of looking at the weave's
610
# sha1sum is that we don't have to extract the text.
611
if self.text_sha1 != w.get_sha1(self.revision):
612
raise BzrCheckError('text {%s} version {%s} wrong sha1'
613
% (self.file_id, self.revision))
481
mutter('check version {%s} of {%s}', rev_id, self.file_id)
482
file_lines = tree.get_file_lines(self.file_id)
483
checker.checked_text_cnt += 1
484
if self.text_size != sum(map(len, file_lines)):
485
raise BzrCheckError('text {%s} wrong size' % self.text_id)
486
if self.text_sha1 != sha_strings(file_lines):
487
raise BzrCheckError('text {%s} wrong sha1' % self.text_id)
614
488
checker.checked_texts[t] = self.text_sha1
633
507
def _diff(self, text_diff, from_label, tree, to_label, to_entry, to_tree,
634
508
output_to, reverse=False):
635
509
"""See InventoryEntry._diff."""
637
from_text = tree.get_file(self.file_id).readlines()
639
to_text = to_tree.get_file(to_entry.file_id).readlines()
643
text_diff(from_label, from_text,
644
to_label, to_text, output_to)
646
text_diff(to_label, to_text,
647
from_label, from_text, output_to)
650
label_pair = (to_label, from_label)
652
label_pair = (from_label, to_label)
653
print >> output_to, "Binary files %s and %s differ" % label_pair
510
from_text = tree.get_file(self.file_id).readlines()
512
to_text = to_tree.get_file(to_entry.file_id).readlines()
516
text_diff(from_label, from_text,
517
to_label, to_text, output_to)
519
text_diff(to_label, to_text,
520
from_label, from_text, output_to)
655
522
def has_text(self):
656
523
"""See InventoryEntry.has_text."""
684
551
def _read_tree_state(self, path, work_tree):
685
552
"""See InventoryEntry._read_tree_state."""
686
self.text_sha1 = work_tree.get_file_sha1(self.file_id, path=path)
687
# FIXME: 20050930 probe for the text size when getting sha1
688
# in _read_tree_state
689
self.executable = work_tree.is_executable(self.file_id, path=path)
692
return ("%s(%r, %r, parent_id=%r, sha1=%r, len=%s)"
693
% (self.__class__.__name__,
700
def _forget_tree_state(self):
701
self.text_sha1 = None
703
def _snapshot_text(self, file_parents, work_tree, commit_builder):
553
self.text_sha1 = work_tree.get_file_sha1(self.file_id)
554
self.executable = work_tree.is_executable(self.file_id)
556
def _snapshot_text(self, file_parents, work_tree, weave_store, transaction):
704
557
"""See InventoryEntry._snapshot_text."""
705
def get_content_byte_lines():
706
return work_tree.get_file(self.file_id).readlines()
707
self.text_sha1, self.text_size = commit_builder.modified_file_text(
708
self.file_id, file_parents, get_content_byte_lines, self.text_sha1, self.text_size)
558
mutter('storing file {%s} in revision {%s}',
559
self.file_id, self.revision)
560
# special case to avoid diffing on renames or
562
if (len(file_parents) == 1
563
and self.text_sha1 == file_parents.values()[0].text_sha1
564
and self.text_size == file_parents.values()[0].text_size):
565
previous_ie = file_parents.values()[0]
566
weave_store.add_identical_text(
567
self.file_id, previous_ie.revision,
568
self.revision, file_parents, transaction)
570
new_lines = work_tree.get_file(self.file_id).readlines()
571
self._add_text_to_weave(new_lines, file_parents, weave_store,
573
self.text_sha1 = sha_strings(new_lines)
574
self.text_size = sum(map(len, new_lines))
710
577
def _unchanged(self, previous_ie):
711
578
"""See InventoryEntry._unchanged."""
724
591
class InventoryLink(InventoryEntry):
725
592
"""A file in an inventory."""
727
__slots__ = ['text_sha1', 'text_size', 'file_id', 'name', 'kind',
728
'text_id', 'parent_id', 'children', 'executable',
729
'revision', 'symlink_target']
594
__slots__ = ['symlink_target']
731
596
def _check(self, checker, rev_id, tree):
732
597
"""See InventoryEntry._check"""
733
if self.text_sha1 is not None or self.text_size is not None or self.text_id is not None:
598
if self.text_sha1 != None or self.text_size != None or self.text_id != None:
734
599
raise BzrCheckError('symlink {%s} has text in revision {%s}'
735
600
% (self.file_id, rev_id))
736
if self.symlink_target is None:
601
if self.symlink_target == None:
737
602
raise BzrCheckError('symlink {%s} has no target in revision {%s}'
738
603
% (self.file_id, rev_id))
861
718
The inventory is created with a default root directory, with
864
# We are letting Branch.create() create a unique inventory
721
# We are letting Branch.initialize() create a unique inventory
865
722
# root id. Rather than generating a random one here.
866
723
#if root_id is None:
867
724
# root_id = bzrlib.branch.gen_file_id('TREE_ROOT')
868
self.root = InventoryDirectory(root_id, '', None)
869
# FIXME: this isn't ever used, changing it to self.revision may break
870
# things. TODO make everything use self.revision_id
871
self.revision_id = revision_id
725
self.root = RootEntry(root_id)
872
726
self._byid = {self.root.file_id: self.root}
875
# TODO: jam 20051218 Should copy also copy the revision_id?
876
entries = self.iter_entries()
877
other = Inventory(entries.next()[1].file_id)
730
other = Inventory(self.root.file_id)
878
731
# copy recursively so we know directories will be added before
879
732
# their children. There are more efficient ways than this...
880
for path, entry in entries():
733
for path, entry in self.iter_entries():
734
if entry == self.root:
881
736
other.add(entry.copy())
884
740
def __iter__(self):
885
741
return iter(self._byid)
887
744
def __len__(self):
888
745
"""Returns number of entries."""
889
746
return len(self._byid)
891
749
def iter_entries(self, from_dir=None):
892
750
"""Return (path, entry) pairs, in order by name."""
897
elif isinstance(from_dir, basestring):
898
from_dir = self._byid[from_dir]
900
# unrolling the recursive called changed the time from
901
# 440ms/663ms (inline/total) to 116ms/116ms
902
children = from_dir.children.items()
904
children = collections.deque(children)
905
stack = [(u'', children)]
907
from_dir_relpath, children = stack[-1]
910
name, ie = children.popleft()
912
# we know that from_dir_relpath never ends in a slash
913
# and 'f' doesn't begin with one, we can do a string op, rather
914
# than the checks of pathjoin(), though this means that all paths
916
path = from_dir_relpath + '/' + name
920
if ie.kind != 'directory':
923
# But do this child first
924
new_children = ie.children.items()
926
new_children = collections.deque(new_children)
927
stack.append((path, new_children))
928
# Break out of inner loop, so that we start outer loop with child
931
# if we finished all children, pop it off the stack
934
def iter_entries_by_dir(self, from_dir=None):
935
"""Iterate over the entries in a directory first order.
937
This returns all entries for a directory before returning
938
the entries for children of a directory. This is not
939
lexicographically sorted order, and is a hybrid between
940
depth-first and breadth-first.
942
:return: This yields (path, entry) pairs
944
# TODO? Perhaps this should return the from_dir so that the root is
945
# yielded? or maybe an option?
950
elif isinstance(from_dir, basestring):
951
from_dir = self._byid[from_dir]
953
stack = [(u'', from_dir)]
955
cur_relpath, cur_dir = stack.pop()
958
for child_name, child_ie in sorted(cur_dir.children.iteritems()):
960
child_relpath = cur_relpath + child_name
962
yield child_relpath, child_ie
964
if child_ie.kind == 'directory':
965
child_dirs.append((child_relpath+'/', child_ie))
966
stack.extend(reversed(child_dirs))
754
elif isinstance(from_dir, basestring):
755
from_dir = self._byid[from_dir]
757
kids = from_dir.children.items()
759
for name, ie in kids:
761
if ie.kind == 'directory':
762
for cn, cie in self.iter_entries(from_dir=ie.file_id):
763
yield os.path.join(name, cn), cie
968
766
def entries(self):
969
767
"""Return list of (path, ie) for all entries except the root.
1013
814
return file_id in self._byid
1015
817
def __getitem__(self, file_id):
1016
818
"""Return the entry for given file_id.
1018
820
>>> inv = Inventory()
1019
821
>>> inv.add(InventoryFile('123123', 'hello.c', ROOT_ID))
1020
InventoryFile('123123', 'hello.c', parent_id='TREE_ROOT', sha1=None, len=None)
822
InventoryFile('123123', 'hello.c', parent_id='TREE_ROOT')
1021
823
>>> inv['123123'].name
1025
827
return self._byid[file_id]
1026
828
except KeyError:
1028
830
raise BzrError("can't look up file_id None")
1030
832
raise BzrError("file_id {%s} not in inventory" % file_id)
1032
835
def get_file_kind(self, file_id):
1033
836
return self._byid[file_id].kind
1035
838
def get_child(self, parent_id, filename):
1036
839
return self[parent_id].children.get(filename)
1038
842
def add(self, entry):
1039
843
"""Add entry to inventory.
1054
858
except KeyError:
1055
859
raise BzrError("parent_id {%s} not in inventory" % entry.parent_id)
1057
if entry.name in parent.children:
861
if parent.children.has_key(entry.name):
1058
862
raise BzrError("%s is already versioned" %
1059
pathjoin(self.id2path(parent.file_id), entry.name))
863
appendpath(self.id2path(parent.file_id), entry.name))
1061
865
self._byid[entry.file_id] = entry
1062
866
parent.children[entry.name] = entry
1065
def add_path(self, relpath, kind, file_id=None, parent_id=None):
870
def add_path(self, relpath, kind, file_id=None):
1066
871
"""Add entry from a path.
1068
873
The immediate parent must already be versioned.
1070
875
Returns the new entry object."""
876
from bzrlib.branch import gen_file_id
1072
parts = osutils.splitpath(relpath)
878
parts = bzrlib.osutils.splitpath(relpath)
1074
879
if len(parts) == 0:
1076
file_id = bzrlib.workingtree.gen_root_id()
1077
self.root = InventoryDirectory(file_id, '', None)
1078
self._byid = {self.root.file_id: self.root}
880
raise BzrError("cannot re-add root of inventory")
883
file_id = gen_file_id(relpath)
885
parent_path = parts[:-1]
886
parent_id = self.path2id(parent_path)
887
if parent_id == None:
888
raise NotVersionedError(parent_path)
890
if kind == 'directory':
891
ie = InventoryDirectory(file_id, parts[-1], parent_id)
893
ie = InventoryFile(file_id, parts[-1], parent_id)
894
elif kind == 'symlink':
895
ie = InventoryLink(file_id, parts[-1], parent_id)
1081
parent_path = parts[:-1]
1082
parent_id = self.path2id(parent_path)
1083
if parent_id is None:
1084
raise NotVersionedError(path=parent_path)
1085
ie = make_entry(kind, parts[-1], parent_id, file_id)
897
raise BzrError("unknown kind %r" % kind)
1086
898
return self.add(ie)
1088
901
def __delitem__(self, file_id):
1089
902
"""Remove entry by id.
1091
904
>>> inv = Inventory()
1092
905
>>> inv.add(InventoryFile('123', 'foo.c', ROOT_ID))
1093
InventoryFile('123', 'foo.c', parent_id='TREE_ROOT', sha1=None, len=None)
906
InventoryFile('123', 'foo.c', parent_id='TREE_ROOT')
1094
907
>>> '123' in inv
1096
909
>>> del inv['123']
1116
935
>>> i1.add(InventoryFile('123', 'foo', ROOT_ID))
1117
InventoryFile('123', 'foo', parent_id='TREE_ROOT', sha1=None, len=None)
936
InventoryFile('123', 'foo', parent_id='TREE_ROOT')
1120
939
>>> i2.add(InventoryFile('123', 'foo', ROOT_ID))
1121
InventoryFile('123', 'foo', parent_id='TREE_ROOT', sha1=None, len=None)
940
InventoryFile('123', 'foo', parent_id='TREE_ROOT')
1125
944
if not isinstance(other, Inventory):
1126
945
return NotImplemented
947
if len(self._byid) != len(other._byid):
948
# shortcut: obviously not the same
1128
951
return self._byid == other._byid
1130
954
def __ne__(self, other):
1131
955
return not self.__eq__(other)
1133
958
def __hash__(self):
1134
959
raise ValueError('not hashable')
1136
def _iter_file_id_parents(self, file_id):
1137
"""Yield the parents of file_id up to the root."""
1138
while file_id is not None:
1140
ie = self._byid[file_id]
1142
raise BzrError("file_id {%s} not found in inventory" % file_id)
1144
file_id = ie.parent_id
1146
962
def get_idpath(self, file_id):
1147
963
"""Return a list of file_ids for the path to an entry.
1152
968
root directory as depth 1.
1155
for parent in self._iter_file_id_parents(file_id):
1156
p.insert(0, parent.file_id)
971
while file_id != None:
973
ie = self._byid[file_id]
975
raise BzrError("file_id {%s} not found in inventory" % file_id)
976
p.insert(0, ie.file_id)
977
file_id = ie.parent_id
1159
981
def id2path(self, file_id):
1160
"""Return as a string the path to file_id.
982
"""Return as a list the path to file_id.
1162
984
>>> i = Inventory()
1163
985
>>> e = i.add(InventoryDirectory('src-id', 'src', ROOT_ID))
1164
986
>>> e = i.add(InventoryFile('foo-id', 'foo.c', parent_id='src-id'))
1165
>>> print i.id2path('foo-id')
987
>>> print i.id2path('foo-id').replace(os.sep, '/')
1168
990
# get all names, skipping root
1169
return '/'.join(reversed(
1170
[parent.name for parent in
1171
self._iter_file_id_parents(file_id)][:-1]))
991
p = [self._byid[fid].name for fid in self.get_idpath(file_id)[1:]]
992
return os.sep.join(p)
1173
996
def path2id(self, name):
1174
997
"""Walk down through directories to return entry of last component.
1235
1061
file_ie.parent_id = new_parent_id
1238
def make_entry(kind, name, parent_id, file_id=None):
1239
"""Create an inventory entry.
1241
:param kind: the type of inventory entry to create.
1242
:param name: the basename of the entry.
1243
:param parent_id: the parent_id of the entry.
1244
:param file_id: the file_id to use. if None, one will be created.
1247
file_id = bzrlib.workingtree.gen_file_id(name)
1249
norm_name, can_access = osutils.normalized_filename(name)
1250
if norm_name != name:
1254
# TODO: jam 20060701 This would probably be more useful
1255
# if the error was raised with the full path
1256
raise errors.InvalidNormalization(name)
1258
if kind == 'directory':
1259
return InventoryDirectory(file_id, name, parent_id)
1260
elif kind == 'file':
1261
return InventoryFile(file_id, name, parent_id)
1262
elif kind == 'symlink':
1263
return InventoryLink(file_id, name, parent_id)
1265
raise BzrError("unknown kind %r" % kind)
1268
1066
_NAME_RE = None
1270
1068
def is_valid_name(name):
1271
1069
global _NAME_RE
1272
if _NAME_RE is None:
1070
if _NAME_RE == None:
1273
1071
_NAME_RE = re.compile(r'^[^/\\]+$')
1275
1073
return bool(_NAME_RE.match(name))