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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
|
# Copyright (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
# \subsection{\emph{rio} - simple text metaformat}
#
# \emph{r} stands for `restricted', `reproducible', or `rfc822-like'.
#
# The stored data consists of a series of \emph{stanzas}, each of which contains
# \emph{fields} identified by an ascii name, with Unicode or string contents.
# The field tag is constrained to alphanumeric characters.
# There may be more than one field in a stanza with the same name.
#
# The format itself does not deal with character encoding issues, though
# the result will normally be written in Unicode.
#
# The format is intended to be simple enough that there is exactly one character
# stream representation of an object and vice versa, and that this relation
# will continue to hold for future versions of bzr.
import re
from bzrlib.iterablefile import IterableFile
# XXX: some redundancy is allowing to write stanzas in isolation as well as
# through a writer object.
class RioWriter(object):
def __init__(self, to_file):
self._soft_nl = False
self._to_file = to_file
def write_stanza(self, stanza):
if self._soft_nl:
print >>self._to_file
stanza.write(self._to_file)
self._soft_nl = True
class RioReader(object):
"""Read stanzas from a file as a sequence
to_file can be anything that can be enumerated as a sequence of
lines (with newlines.)
"""
def __init__(self, from_file):
self._from_file = from_file
def __iter__(self):
while True:
s = read_stanza(self._from_file)
if s is None:
break
else:
yield s
def rio_file(stanzas, header=None):
"""Produce a rio IterableFile from an iterable of stanzas"""
def str_iter():
if header is not None:
yield header + '\n'
first_stanza = True
for s in stanzas:
if first_stanza is not True:
yield '\n'
for line in s.to_lines():
yield line
first_stanza = False
return IterableFile(str_iter())
def read_stanzas(from_file):
while True:
s = read_stanza(from_file)
if s is None:
break
else:
yield s
class Stanza(object):
"""One stanza for rio.
Each stanza contains a set of named fields.
Names must be non-empty ascii alphanumeric plus _. Names can be repeated
within a stanza. Names are case-sensitive. The ordering of fields is
preserved.
Each field value must be either an int or a string.
"""
__slots__ = ['items']
def __init__(self, **kwargs):
"""Construct a new Stanza.
The keyword arguments, if any, are added in sorted order to the stanza.
"""
self.items = []
if kwargs:
for tag, value in sorted(kwargs.items()):
self.add(tag, value)
def add(self, tag, value):
"""Append a name and value to the stanza."""
assert valid_tag(tag), \
("invalid tag %r" % tag)
if isinstance(value, str):
value = unicode(value)
elif isinstance(value, unicode):
pass
## elif isinstance(value, (int, long)):
## value = str(value) # XXX: python2.4 without L-suffix
else:
raise TypeError("invalid type for rio value: %r of type %s"
% (value, type(value)))
self.items.append((tag, value))
def __contains__(self, find_tag):
"""True if there is any field in this stanza with the given tag."""
for tag, value in self.items:
if tag == find_tag:
return True
return False
def __len__(self):
"""Return number of pairs in the stanza."""
return len(self.items)
def __eq__(self, other):
if not isinstance(other, Stanza):
return False
return self.items == other.items
def __ne__(self, other):
return not self.__eq__(other)
def __repr__(self):
return "Stanza(%r)" % self.items
def iter_pairs(self):
"""Return iterator of tag, value pairs."""
return iter(self.items)
def to_lines(self):
"""Generate sequence of lines for external version of this file.
The lines are always utf-8 encoded strings.
"""
if not self.items:
# max() complains if sequence is empty
return []
result = []
for tag, value in self.items:
assert isinstance(tag, str), type(tag)
assert isinstance(value, unicode)
if value == '':
result.append(tag + ': \n')
elif '\n' in value:
# don't want splitlines behaviour on empty lines
val_lines = value.split('\n')
result.append(tag + ': ' + val_lines[0].encode('utf-8') + '\n')
for line in val_lines[1:]:
result.append('\t' + line.encode('utf-8') + '\n')
else:
result.append(tag + ': ' + value.encode('utf-8') + '\n')
return result
def to_string(self):
"""Return stanza as a single string"""
return ''.join(self.to_lines())
def to_unicode(self):
"""Return stanza as a single Unicode string.
This is most useful when adding a Stanza to a parent Stanza
"""
if not self.items:
return u''
result = []
for tag, value in self.items:
if value == '':
result.append(tag + ': \n')
elif '\n' in value:
# don't want splitlines behaviour on empty lines
val_lines = value.split('\n')
result.append(tag + ': ' + val_lines[0] + '\n')
for line in val_lines[1:]:
result.append('\t' + line + '\n')
else:
result.append(tag + ': ' + value + '\n')
return u''.join(result)
def write(self, to_file):
"""Write stanza to a file"""
to_file.writelines(self.to_lines())
def get(self, tag):
"""Return the value for a field wih given tag.
If there is more than one value, only the first is returned. If the
tag is not present, KeyError is raised.
"""
for t, v in self.items:
if t == tag:
return v
else:
raise KeyError(tag)
__getitem__ = get
def get_all(self, tag):
r = []
for t, v in self.items:
if t == tag:
r.append(v)
return r
def as_dict(self):
"""Return a dict containing the unique values of the stanza.
"""
d = {}
for tag, value in self.items:
assert tag not in d
d[tag] = value
return d
_tag_re = re.compile(r'^[-a-zA-Z0-9_]+$')
def valid_tag(tag):
return bool(_tag_re.match(tag))
def read_stanza(line_iter):
"""Return new Stanza read from list of lines or a file
Returns one Stanza that was read, or returns None at end of file. If a
blank line follows the stanza, it is consumed. It's not an error for
there to be no blank at end of file. If there is a blank file at the
start of the input this is really an empty stanza and that is returned.
Only the stanza lines and the trailing blank (if any) are consumed
from the line_iter.
The raw lines must be in utf-8 encoding.
"""
unicode_iter = (line.decode('utf-8') for line in line_iter)
return read_stanza_unicode(unicode_iter)
def read_stanza_unicode(unicode_iter):
"""Read a Stanza from a list of lines or a file.
The lines should already be in unicode form. This returns a single
stanza that was read. If there is a blank line at the end of the Stanza,
it is consumed. It is not an error for there to be no blank line at
the end of the iterable. If there is a blank line at the beginning,
this is treated as an empty Stanza and None is returned.
Only the stanza lines and the trailing blank (if any) are consumed
from the unicode_iter
:param unicode_iter: A iterable, yeilding Unicode strings. See read_stanza
if you have a utf-8 encoded string.
:return: A Stanza object if there are any lines in the file.
None otherwise
"""
stanza = Stanza()
tag = None
accum_value = None
# TODO: jam 20060922 This code should raise real errors rather than
# using 'assert' to process user input, or raising ValueError
# rather than a more specific error.
for line in unicode_iter:
if line is None or line == '':
break # end of file
if line == '\n':
break # end of stanza
assert line.endswith('\n')
real_l = line
if line[0] == '\t': # continues previous value
if tag is None:
raise ValueError('invalid continuation line %r' % real_l)
accum_value += '\n' + line[1:-1]
else: # new tag:value line
if tag is not None:
stanza.add(tag, accum_value)
try:
colon_index = line.index(': ')
except ValueError:
raise ValueError('tag/value separator not found in line %r'
% real_l)
tag = str(line[:colon_index])
assert valid_tag(tag), \
"invalid rio tag %r" % tag
accum_value = line[colon_index+2:-1]
if tag is not None: # add last tag-value
stanza.add(tag, accum_value)
return stanza
else: # didn't see any content
return None
def to_patch_lines(stanza, max_width=72):
"""Convert a stanza into RIO-Patch format lines.
RIO-Patch is a RIO variant designed to be e-mailed as part of a patch.
It resists common forms of damage such as newline conversion or the removal
of trailing whitespace, yet is also reasonably easy to read.
:param max_width: The maximum number of characters per physical line.
:return: a list of lines
"""
assert max_width > 6
max_rio_width = max_width - 4
lines = []
for pline in stanza.to_lines():
for line in pline.split('\n')[:-1]:
line = re.sub('\\\\', '\\\\\\\\', line)
while len(line) > 0:
partline = line[:max_rio_width]
line = line[max_rio_width:]
if len(line) > 0 and line[0] != [' ']:
break_index = -1
break_index = partline.rfind(' ', -20)
if break_index < 3:
break_index = partline.rfind('-', -20)
break_index += 1
if break_index < 3:
break_index = partline.rfind('/', -20)
if break_index >= 3:
line = partline[break_index:] + line
partline = partline[:break_index]
if len(line) > 0:
line = ' ' + line
partline = re.sub('\r', '\\\\r', partline)
blank_line = False
if len(line) > 0:
partline += '\\'
elif re.search(' $', partline):
partline += '\\'
blank_line = True
lines.append('# ' + partline + '\n')
if blank_line:
lines.append('# \n')
return lines
def _patch_stanza_iter(line_iter):
map = {'\\\\': '\\',
'\\r' : '\r',
'\\\n': ''}
def mapget(match):
return map[match.group(0)]
last_line = None
for line in line_iter:
if line.startswith('# '):
line = line[2:]
else:
assert line.startswith('#')
line = line[1:]
if last_line is not None and len(line) > 2:
line = line[2:]
line = re.sub('\r', '', line)
line = re.sub('\\\\(.|\n)', mapget, line)
if last_line is None:
last_line = line
else:
last_line += line
if last_line[-1] == '\n':
yield last_line
last_line = None
if last_line is not None:
yield last_line
def read_patch_stanza(line_iter):
"""Convert an iterable of RIO-Patch format lines into a Stanza.
RIO-Patch is a RIO variant designed to be e-mailed as part of a patch.
It resists common forms of damage such as newline conversion or the removal
of trailing whitespace, yet is also reasonably easy to read.
:return: a Stanza
"""
return read_stanza(_patch_stanza_iter(line_iter))
|