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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
# (C) 2005 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
from xml import ElementTree, Element
def write_inventory(inv, f):
el = Element('inventory', {'version': '2'})
el.text = '\n'
root = Element('root_directory', {'id': inv.root.file_id})
root.tail = root.text = '\n'
el.append(root)
def descend(parent_el, ie):
kind = ie.kind
el = Element(kind, {'name': ie.name,
'id': ie.file_id,})
if kind == 'file':
if ie.text_id:
el.set('text_id', ie.text_id)
if ie.text_sha1:
el.set('text_sha1', ie.text_sha1)
if ie.text_size != None:
el.set('text_size', ('%d' % ie.text_size))
elif kind != 'directory':
raise BzrError('unknown InventoryEntry kind %r' % kind)
el.tail = '\n'
parent_el.append(el)
if kind == 'directory':
el.text = '\n' # break before having children
l = ie.children.items()
l.sort()
for child_name, child_ie in l:
descend(el, child_ie)
# walk down through inventory, adding all directories
l = inv.root.children.items()
l.sort()
for entry_name, ie in l:
descend(root, ie)
ElementTree(el).write(f, 'utf-8')
f.write('\n')
def escape_attr(text):
return text.replace("&", "&") \
.replace("'", "'") \
.replace('"', """) \
.replace("<", "<") \
.replace(">", ">")
# This writes out an inventory without building an XML tree first,
# just to see if it's faster. Not currently used.
def write_slacker_inventory(inv, f):
def descend(ie):
kind = ie.kind
f.write('<%s name="%s" id="%s" ' % (kind, escape_attr(ie.name),
escape_attr(ie.file_id)))
if kind == 'file':
if ie.text_id:
f.write('text_id="%s" ' % ie.text_id)
if ie.text_sha1:
f.write('text_sha1="%s" ' % ie.text_sha1)
if ie.text_size != None:
f.write('text_size="%d" ' % ie.text_size)
f.write('/>\n')
elif kind == 'directory':
f.write('>\n')
l = ie.children.items()
l.sort()
for child_name, child_ie in l:
descend(child_ie)
f.write('</directory>\n')
else:
raise BzrError('unknown InventoryEntry kind %r' % kind)
f.write('<inventory>\n')
f.write('<root_directory id="%s">\n' % escape_attr(inv.root.file_id))
l = inv.root.children.items()
l.sort()
for entry_name, ie in l:
descend(ie)
f.write('</root_directory>\n')
f.write('</inventory>\n')
def read_new_inventory(f):
from inventory import Inventory, InventoryEntry
def descend(parent_ie, el):
kind = el.tag
name = el.get('name')
file_id = el.get('id')
ie = InventoryEntry(file_id, name, el.tag)
parent_ie.children[name] = ie
inv._byid[file_id] = ie
if kind == 'directory':
for child_el in el:
descend(ie, child_el)
elif kind == 'file':
assert len(el) == 0
ie.text_id = el.get('text_id')
v = el.get('text_size')
ie.text_size = v and int(v)
ie.text_sha1 = el.get('text_sha1')
else:
raise BzrError("unknown inventory entry %r" % kind)
inv_el = ElementTree().parse(f)
assert inv_el.tag == 'inventory'
root_el = inv_el[0]
assert root_el.tag == 'root_directory'
inv = Inventory()
for el in root_el:
descend(inv.root, el)
|