blob: 49c52151375939c8dadc2312daa364c116a9e54a [file] [log] [blame]
Georg Brandl116aa622007-08-15 14:28:22 +00001
2:mod:`re` --- Regular expression operations
3===========================================
4
5.. module:: re
6 :synopsis: Regular expression operations.
7.. moduleauthor:: Fredrik Lundh <fredrik@pythonware.com>
8.. sectionauthor:: Andrew M. Kuchling <amk@amk.ca>
9
10
11
12
13This module provides regular expression matching operations similar to
14those found in Perl. Both patterns and strings to be searched can be
15Unicode strings as well as 8-bit strings. The :mod:`re` module is
16always available.
17
18Regular expressions use the backslash character (``'\'``) to indicate
19special forms or to allow special characters to be used without invoking
20their special meaning. This collides with Python's usage of the same
21character for the same purpose in string literals; for example, to match
22a literal backslash, one might have to write ``'\\\\'`` as the pattern
23string, because the regular expression must be ``\\``, and each
24backslash must be expressed as ``\\`` inside a regular Python string
25literal.
26
27The solution is to use Python's raw string notation for regular expression
28patterns; backslashes are not handled in any special way in a string literal
29prefixed with ``'r'``. So ``r"\n"`` is a two-character string containing
30``'\'`` and ``'n'``, while ``"\n"`` is a one-character string containing a
Georg Brandl9afde1c2007-11-01 20:32:30 +000031newline. Usually patterns will be expressed in Python code using this raw
32string notation.
Georg Brandl116aa622007-08-15 14:28:22 +000033
Christian Heimesb9eccbf2007-12-05 20:18:38 +000034It is important to note that most regular expression operations are available as
35module-level functions and :class:`RegexObject` methods. The functions are
36shortcuts that don't require you to compile a regex object first, but miss some
37fine-tuning parameters.
38
Georg Brandl116aa622007-08-15 14:28:22 +000039.. seealso::
40
41 Mastering Regular Expressions
42 Book on regular expressions by Jeffrey Friedl, published by O'Reilly. The
Georg Brandl9afde1c2007-11-01 20:32:30 +000043 second edition of the book no longer covers Python at all, but the first
Georg Brandl116aa622007-08-15 14:28:22 +000044 edition covered writing good regular expression patterns in great detail.
45
46
47.. _re-syntax:
48
49Regular Expression Syntax
50-------------------------
51
52A regular expression (or RE) specifies a set of strings that matches it; the
53functions in this module let you check if a particular string matches a given
54regular expression (or if a given regular expression matches a particular
55string, which comes down to the same thing).
56
57Regular expressions can be concatenated to form new regular expressions; if *A*
58and *B* are both regular expressions, then *AB* is also a regular expression.
59In general, if a string *p* matches *A* and another string *q* matches *B*, the
60string *pq* will match AB. This holds unless *A* or *B* contain low precedence
61operations; boundary conditions between *A* and *B*; or have numbered group
62references. Thus, complex expressions can easily be constructed from simpler
63primitive expressions like the ones described here. For details of the theory
64and implementation of regular expressions, consult the Friedl book referenced
65above, or almost any textbook about compiler construction.
66
67A brief explanation of the format of regular expressions follows. For further
68information and a gentler presentation, consult the Regular Expression HOWTO,
69accessible from http://www.python.org/doc/howto/.
70
71Regular expressions can contain both special and ordinary characters. Most
72ordinary characters, like ``'A'``, ``'a'``, or ``'0'``, are the simplest regular
73expressions; they simply match themselves. You can concatenate ordinary
74characters, so ``last`` matches the string ``'last'``. (In the rest of this
75section, we'll write RE's in ``this special style``, usually without quotes, and
76strings to be matched ``'in single quotes'``.)
77
78Some characters, like ``'|'`` or ``'('``, are special. Special
79characters either stand for classes of ordinary characters, or affect
80how the regular expressions around them are interpreted. Regular
81expression pattern strings may not contain null bytes, but can specify
82the null byte using the ``\number`` notation, e.g., ``'\x00'``.
83
84
85The special characters are:
86
Georg Brandl116aa622007-08-15 14:28:22 +000087``'.'``
88 (Dot.) In the default mode, this matches any character except a newline. If
89 the :const:`DOTALL` flag has been specified, this matches any character
90 including a newline.
91
92``'^'``
93 (Caret.) Matches the start of the string, and in :const:`MULTILINE` mode also
94 matches immediately after each newline.
95
96``'$'``
97 Matches the end of the string or just before the newline at the end of the
98 string, and in :const:`MULTILINE` mode also matches before a newline. ``foo``
99 matches both 'foo' and 'foobar', while the regular expression ``foo$`` matches
100 only 'foo'. More interestingly, searching for ``foo.$`` in ``'foo1\nfoo2\n'``
101 matches 'foo2' normally, but 'foo1' in :const:`MULTILINE` mode.
102
103``'*'``
104 Causes the resulting RE to match 0 or more repetitions of the preceding RE, as
105 many repetitions as are possible. ``ab*`` will match 'a', 'ab', or 'a' followed
106 by any number of 'b's.
107
108``'+'``
109 Causes the resulting RE to match 1 or more repetitions of the preceding RE.
110 ``ab+`` will match 'a' followed by any non-zero number of 'b's; it will not
111 match just 'a'.
112
113``'?'``
114 Causes the resulting RE to match 0 or 1 repetitions of the preceding RE.
115 ``ab?`` will match either 'a' or 'ab'.
116
117``*?``, ``+?``, ``??``
118 The ``'*'``, ``'+'``, and ``'?'`` qualifiers are all :dfn:`greedy`; they match
119 as much text as possible. Sometimes this behaviour isn't desired; if the RE
120 ``<.*>`` is matched against ``'<H1>title</H1>'``, it will match the entire
121 string, and not just ``'<H1>'``. Adding ``'?'`` after the qualifier makes it
122 perform the match in :dfn:`non-greedy` or :dfn:`minimal` fashion; as *few*
123 characters as possible will be matched. Using ``.*?`` in the previous
124 expression will match only ``'<H1>'``.
125
126``{m}``
127 Specifies that exactly *m* copies of the previous RE should be matched; fewer
128 matches cause the entire RE not to match. For example, ``a{6}`` will match
129 exactly six ``'a'`` characters, but not five.
130
131``{m,n}``
132 Causes the resulting RE to match from *m* to *n* repetitions of the preceding
133 RE, attempting to match as many repetitions as possible. For example,
134 ``a{3,5}`` will match from 3 to 5 ``'a'`` characters. Omitting *m* specifies a
135 lower bound of zero, and omitting *n* specifies an infinite upper bound. As an
136 example, ``a{4,}b`` will match ``aaaab`` or a thousand ``'a'`` characters
137 followed by a ``b``, but not ``aaab``. The comma may not be omitted or the
138 modifier would be confused with the previously described form.
139
140``{m,n}?``
141 Causes the resulting RE to match from *m* to *n* repetitions of the preceding
142 RE, attempting to match as *few* repetitions as possible. This is the
143 non-greedy version of the previous qualifier. For example, on the
144 6-character string ``'aaaaaa'``, ``a{3,5}`` will match 5 ``'a'`` characters,
145 while ``a{3,5}?`` will only match 3 characters.
146
147``'\'``
148 Either escapes special characters (permitting you to match characters like
149 ``'*'``, ``'?'``, and so forth), or signals a special sequence; special
150 sequences are discussed below.
151
152 If you're not using a raw string to express the pattern, remember that Python
153 also uses the backslash as an escape sequence in string literals; if the escape
154 sequence isn't recognized by Python's parser, the backslash and subsequent
155 character are included in the resulting string. However, if Python would
156 recognize the resulting sequence, the backslash should be repeated twice. This
157 is complicated and hard to understand, so it's highly recommended that you use
158 raw strings for all but the simplest expressions.
159
160``[]``
161 Used to indicate a set of characters. Characters can be listed individually, or
162 a range of characters can be indicated by giving two characters and separating
163 them by a ``'-'``. Special characters are not active inside sets. For example,
164 ``[akm$]`` will match any of the characters ``'a'``, ``'k'``,
165 ``'m'``, or ``'$'``; ``[a-z]`` will match any lowercase letter, and
166 ``[a-zA-Z0-9]`` matches any letter or digit. Character classes such
167 as ``\w`` or ``\S`` (defined below) are also acceptable inside a
168 range, although the characters they match depends on whether :const:`LOCALE`
169 or :const:`UNICODE` mode is in force. If you want to include a
170 ``']'`` or a ``'-'`` inside a set, precede it with a backslash, or
171 place it as the first character. The pattern ``[]]`` will match
172 ``']'``, for example.
173
174 You can match the characters not within a range by :dfn:`complementing` the set.
175 This is indicated by including a ``'^'`` as the first character of the set;
176 ``'^'`` elsewhere will simply match the ``'^'`` character. For example,
177 ``[^5]`` will match any character except ``'5'``, and ``[^^]`` will match any
178 character except ``'^'``.
179
180``'|'``
181 ``A|B``, where A and B can be arbitrary REs, creates a regular expression that
182 will match either A or B. An arbitrary number of REs can be separated by the
183 ``'|'`` in this way. This can be used inside groups (see below) as well. As
184 the target string is scanned, REs separated by ``'|'`` are tried from left to
185 right. When one pattern completely matches, that branch is accepted. This means
186 that once ``A`` matches, ``B`` will not be tested further, even if it would
187 produce a longer overall match. In other words, the ``'|'`` operator is never
188 greedy. To match a literal ``'|'``, use ``\|``, or enclose it inside a
189 character class, as in ``[|]``.
190
191``(...)``
192 Matches whatever regular expression is inside the parentheses, and indicates the
193 start and end of a group; the contents of a group can be retrieved after a match
194 has been performed, and can be matched later in the string with the ``\number``
195 special sequence, described below. To match the literals ``'('`` or ``')'``,
196 use ``\(`` or ``\)``, or enclose them inside a character class: ``[(] [)]``.
197
198``(?...)``
199 This is an extension notation (a ``'?'`` following a ``'('`` is not meaningful
200 otherwise). The first character after the ``'?'`` determines what the meaning
201 and further syntax of the construct is. Extensions usually do not create a new
202 group; ``(?P<name>...)`` is the only exception to this rule. Following are the
203 currently supported extensions.
204
205``(?iLmsux)``
206 (One or more letters from the set ``'i'``, ``'L'``, ``'m'``, ``'s'``,
207 ``'u'``, ``'x'``.) The group matches the empty string; the letters
208 set the corresponding flags: :const:`re.I` (ignore case),
209 :const:`re.L` (locale dependent), :const:`re.M` (multi-line),
210 :const:`re.S` (dot matches all), :const:`re.U` (Unicode dependent),
211 and :const:`re.X` (verbose), for the entire regular expression. (The
212 flags are described in :ref:`contents-of-module-re`.) This
213 is useful if you wish to include the flags as part of the regular
214 expression, instead of passing a *flag* argument to the
215 :func:`compile` function.
216
217 Note that the ``(?x)`` flag changes how the expression is parsed. It should be
218 used first in the expression string, or after one or more whitespace characters.
219 If there are non-whitespace characters before the flag, the results are
220 undefined.
221
222``(?:...)``
223 A non-grouping version of regular parentheses. Matches whatever regular
224 expression is inside the parentheses, but the substring matched by the group
225 *cannot* be retrieved after performing a match or referenced later in the
226 pattern.
227
228``(?P<name>...)``
229 Similar to regular parentheses, but the substring matched by the group is
230 accessible via the symbolic group name *name*. Group names must be valid Python
231 identifiers, and each group name must be defined only once within a regular
232 expression. A symbolic group is also a numbered group, just as if the group
233 were not named. So the group named 'id' in the example below can also be
234 referenced as the numbered group 1.
235
236 For example, if the pattern is ``(?P<id>[a-zA-Z_]\w*)``, the group can be
237 referenced by its name in arguments to methods of match objects, such as
238 ``m.group('id')`` or ``m.end('id')``, and also by name in pattern text (for
239 example, ``(?P=id)``) and replacement text (such as ``\g<id>``).
240
241``(?P=name)``
242 Matches whatever text was matched by the earlier group named *name*.
243
244``(?#...)``
245 A comment; the contents of the parentheses are simply ignored.
246
247``(?=...)``
248 Matches if ``...`` matches next, but doesn't consume any of the string. This is
249 called a lookahead assertion. For example, ``Isaac (?=Asimov)`` will match
250 ``'Isaac '`` only if it's followed by ``'Asimov'``.
251
252``(?!...)``
253 Matches if ``...`` doesn't match next. This is a negative lookahead assertion.
254 For example, ``Isaac (?!Asimov)`` will match ``'Isaac '`` only if it's *not*
255 followed by ``'Asimov'``.
256
257``(?<=...)``
258 Matches if the current position in the string is preceded by a match for ``...``
259 that ends at the current position. This is called a :dfn:`positive lookbehind
260 assertion`. ``(?<=abc)def`` will find a match in ``abcdef``, since the
261 lookbehind will back up 3 characters and check if the contained pattern matches.
262 The contained pattern must only match strings of some fixed length, meaning that
263 ``abc`` or ``a|b`` are allowed, but ``a*`` and ``a{3,4}`` are not. Note that
264 patterns which start with positive lookbehind assertions will never match at the
265 beginning of the string being searched; you will most likely want to use the
266 :func:`search` function rather than the :func:`match` function::
267
268 >>> import re
269 >>> m = re.search('(?<=abc)def', 'abcdef')
270 >>> m.group(0)
271 'def'
272
273 This example looks for a word following a hyphen::
274
275 >>> m = re.search('(?<=-)\w+', 'spam-egg')
276 >>> m.group(0)
277 'egg'
278
279``(?<!...)``
280 Matches if the current position in the string is not preceded by a match for
281 ``...``. This is called a :dfn:`negative lookbehind assertion`. Similar to
282 positive lookbehind assertions, the contained pattern must only match strings of
283 some fixed length. Patterns which start with negative lookbehind assertions may
284 match at the beginning of the string being searched.
285
286``(?(id/name)yes-pattern|no-pattern)``
287 Will try to match with ``yes-pattern`` if the group with given *id* or *name*
288 exists, and with ``no-pattern`` if it doesn't. ``no-pattern`` is optional and
289 can be omitted. For example, ``(<)?(\w+@\w+(?:\.\w+)+)(?(1)>)`` is a poor email
290 matching pattern, which will match with ``'<user@host.com>'`` as well as
291 ``'user@host.com'``, but not with ``'<user@host.com'``.
292
Georg Brandl116aa622007-08-15 14:28:22 +0000293
294The special sequences consist of ``'\'`` and a character from the list below.
295If the ordinary character is not on the list, then the resulting RE will match
296the second character. For example, ``\$`` matches the character ``'$'``.
297
Georg Brandl116aa622007-08-15 14:28:22 +0000298``\number``
299 Matches the contents of the group of the same number. Groups are numbered
300 starting from 1. For example, ``(.+) \1`` matches ``'the the'`` or ``'55 55'``,
301 but not ``'the end'`` (note the space after the group). This special sequence
302 can only be used to match one of the first 99 groups. If the first digit of
303 *number* is 0, or *number* is 3 octal digits long, it will not be interpreted as
304 a group match, but as the character with octal value *number*. Inside the
305 ``'['`` and ``']'`` of a character class, all numeric escapes are treated as
306 characters.
307
308``\A``
309 Matches only at the start of the string.
310
311``\b``
312 Matches the empty string, but only at the beginning or end of a word. A word is
313 defined as a sequence of alphanumeric or underscore characters, so the end of a
314 word is indicated by whitespace or a non-alphanumeric, non-underscore character.
315 Note that ``\b`` is defined as the boundary between ``\w`` and ``\ W``, so the
316 precise set of characters deemed to be alphanumeric depends on the values of the
317 ``UNICODE`` and ``LOCALE`` flags. Inside a character range, ``\b`` represents
318 the backspace character, for compatibility with Python's string literals.
319
320``\B``
321 Matches the empty string, but only when it is *not* at the beginning or end of a
322 word. This is just the opposite of ``\b``, so is also subject to the settings
323 of ``LOCALE`` and ``UNICODE``.
324
325``\d``
326 When the :const:`UNICODE` flag is not specified, matches any decimal digit; this
327 is equivalent to the set ``[0-9]``. With :const:`UNICODE`, it will match
328 whatever is classified as a digit in the Unicode character properties database.
329
330``\D``
331 When the :const:`UNICODE` flag is not specified, matches any non-digit
332 character; this is equivalent to the set ``[^0-9]``. With :const:`UNICODE`, it
333 will match anything other than character marked as digits in the Unicode
334 character properties database.
335
336``\s``
337 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
338 any whitespace character; this is equivalent to the set ``[ \t\n\r\f\v]``. With
339 :const:`LOCALE`, it will match this set plus whatever characters are defined as
340 space for the current locale. If :const:`UNICODE` is set, this will match the
341 characters ``[ \t\n\r\f\v]`` plus whatever is classified as space in the Unicode
342 character properties database.
343
344``\S``
345 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
346 any non-whitespace character; this is equivalent to the set ``[^ \t\n\r\f\v]``
347 With :const:`LOCALE`, it will match any character not in this set, and not
348 defined as space in the current locale. If :const:`UNICODE` is set, this will
349 match anything other than ``[ \t\n\r\f\v]`` and characters marked as space in
350 the Unicode character properties database.
351
352``\w``
353 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
354 any alphanumeric character and the underscore; this is equivalent to the set
355 ``[a-zA-Z0-9_]``. With :const:`LOCALE`, it will match the set ``[0-9_]`` plus
356 whatever characters are defined as alphanumeric for the current locale. If
357 :const:`UNICODE` is set, this will match the characters ``[0-9_]`` plus whatever
358 is classified as alphanumeric in the Unicode character properties database.
359
360``\W``
361 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
362 any non-alphanumeric character; this is equivalent to the set ``[^a-zA-Z0-9_]``.
363 With :const:`LOCALE`, it will match any character not in the set ``[0-9_]``, and
364 not defined as alphanumeric for the current locale. If :const:`UNICODE` is set,
365 this will match anything other than ``[0-9_]`` and characters marked as
366 alphanumeric in the Unicode character properties database.
367
368``\Z``
369 Matches only at the end of the string.
370
371Most of the standard escapes supported by Python string literals are also
372accepted by the regular expression parser::
373
374 \a \b \f \n
375 \r \t \v \x
376 \\
377
378Octal escapes are included in a limited form: If the first digit is a 0, or if
379there are three octal digits, it is considered an octal escape. Otherwise, it is
380a group reference. As for string literals, octal escapes are always at most
381three digits in length.
382
Georg Brandl116aa622007-08-15 14:28:22 +0000383
384.. _matching-searching:
385
386Matching vs Searching
387---------------------
388
389.. sectionauthor:: Fred L. Drake, Jr. <fdrake@acm.org>
390
391
392Python offers two different primitive operations based on regular expressions:
Guido van Rossum04110fb2007-08-24 16:32:05 +0000393**match** checks for a match only at the beginning of the string, while
394**search** checks for a match anywhere in the string (this is what Perl does
395by default).
Georg Brandl116aa622007-08-15 14:28:22 +0000396
Guido van Rossum04110fb2007-08-24 16:32:05 +0000397Note that match may differ from search even when using a regular expression
398beginning with ``'^'``: ``'^'`` matches only at the start of the string, or in
Georg Brandl116aa622007-08-15 14:28:22 +0000399:const:`MULTILINE` mode also immediately following a newline. The "match"
400operation succeeds only if the pattern matches at the start of the string
401regardless of mode, or at the starting position given by the optional *pos*
Christian Heimes5b5e81c2007-12-31 16:14:33 +0000402argument regardless of whether a newline precedes it. ::
Georg Brandl116aa622007-08-15 14:28:22 +0000403
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000404 >>> re.match("c", "abcdef") # No match
405 >>> re.search("c", "abcdef")
Christian Heimes5b5e81c2007-12-31 16:14:33 +0000406 <_sre.SRE_Match object at 0x827e9c0> # Match
Georg Brandl116aa622007-08-15 14:28:22 +0000407
408
409.. _contents-of-module-re:
410
411Module Contents
412---------------
413
414The module defines several functions, constants, and an exception. Some of the
415functions are simplified versions of the full featured methods for compiled
416regular expressions. Most non-trivial applications always use the compiled
417form.
418
419
420.. function:: compile(pattern[, flags])
421
Georg Brandl9afde1c2007-11-01 20:32:30 +0000422 Compile a regular expression pattern into a regular expression object, which
423 can be used for matching using its :func:`match` and :func:`search` methods,
Georg Brandl116aa622007-08-15 14:28:22 +0000424 described below.
425
426 The expression's behaviour can be modified by specifying a *flags* value.
427 Values can be any of the following variables, combined using bitwise OR (the
428 ``|`` operator).
429
430 The sequence ::
431
432 prog = re.compile(pat)
433 result = prog.match(str)
434
435 is equivalent to ::
436
437 result = re.match(pat, str)
438
Georg Brandl9afde1c2007-11-01 20:32:30 +0000439 but the version using :func:`compile` is more efficient when the expression
440 will be used several times in a single program.
Georg Brandl116aa622007-08-15 14:28:22 +0000441
Christian Heimes5b5e81c2007-12-31 16:14:33 +0000442 .. (The compiled version of the last pattern passed to :func:`re.match` or
443 :func:`re.search` is cached, so programs that use only a single regular
444 expression at a time needn't worry about compiling regular expressions.)
Georg Brandl116aa622007-08-15 14:28:22 +0000445
446
447.. data:: I
448 IGNORECASE
449
450 Perform case-insensitive matching; expressions like ``[A-Z]`` will match
451 lowercase letters, too. This is not affected by the current locale.
452
453
454.. data:: L
455 LOCALE
456
Georg Brandl9afde1c2007-11-01 20:32:30 +0000457 Make ``\w``, ``\W``, ``\b``, ``\B``, ``\s`` and ``\S`` dependent on the
458 current locale.
Georg Brandl116aa622007-08-15 14:28:22 +0000459
460
461.. data:: M
462 MULTILINE
463
464 When specified, the pattern character ``'^'`` matches at the beginning of the
465 string and at the beginning of each line (immediately following each newline);
466 and the pattern character ``'$'`` matches at the end of the string and at the
467 end of each line (immediately preceding each newline). By default, ``'^'``
468 matches only at the beginning of the string, and ``'$'`` only at the end of the
469 string and immediately before the newline (if any) at the end of the string.
470
471
472.. data:: S
473 DOTALL
474
475 Make the ``'.'`` special character match any character at all, including a
476 newline; without this flag, ``'.'`` will match anything *except* a newline.
477
478
479.. data:: U
480 UNICODE
481
482 Make ``\w``, ``\W``, ``\b``, ``\B``, ``\d``, ``\D``, ``\s`` and ``\S`` dependent
483 on the Unicode character properties database.
484
Georg Brandl116aa622007-08-15 14:28:22 +0000485
486.. data:: X
487 VERBOSE
488
489 This flag allows you to write regular expressions that look nicer. Whitespace
490 within the pattern is ignored, except when in a character class or preceded by
491 an unescaped backslash, and, when a line contains a ``'#'`` neither in a
492 character class or preceded by an unescaped backslash, all characters from the
493 leftmost such ``'#'`` through the end of the line are ignored.
494
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000495 That means that the two following regular expression objects that match a
496 decimal number are functionally equal::
Georg Brandl81ac1ce2007-08-31 17:17:17 +0000497
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000498 a = re.compile(r"""\d + # the integral part
499 \. # the decimal point
500 \d * # some fractional digits""", re.X)
501 b = re.compile(r"\d+\.\d*")
Georg Brandl116aa622007-08-15 14:28:22 +0000502
503
504.. function:: search(pattern, string[, flags])
505
506 Scan through *string* looking for a location where the regular expression
507 *pattern* produces a match, and return a corresponding :class:`MatchObject`
508 instance. Return ``None`` if no position in the string matches the pattern; note
509 that this is different from finding a zero-length match at some point in the
510 string.
511
512
513.. function:: match(pattern, string[, flags])
514
515 If zero or more characters at the beginning of *string* match the regular
516 expression *pattern*, return a corresponding :class:`MatchObject` instance.
517 Return ``None`` if the string does not match the pattern; note that this is
518 different from a zero-length match.
519
520 .. note::
521
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000522 If you want to locate a match anywhere in *string*, use :meth:`search`
523 instead.
Georg Brandl116aa622007-08-15 14:28:22 +0000524
525
526.. function:: split(pattern, string[, maxsplit=0])
527
528 Split *string* by the occurrences of *pattern*. If capturing parentheses are
529 used in *pattern*, then the text of all groups in the pattern are also returned
530 as part of the resulting list. If *maxsplit* is nonzero, at most *maxsplit*
531 splits occur, and the remainder of the string is returned as the final element
532 of the list. (Incompatibility note: in the original Python 1.5 release,
533 *maxsplit* was ignored. This has been fixed in later releases.) ::
534
535 >>> re.split('\W+', 'Words, words, words.')
536 ['Words', 'words', 'words', '']
537 >>> re.split('(\W+)', 'Words, words, words.')
538 ['Words', ', ', 'words', ', ', 'words', '.', '']
539 >>> re.split('\W+', 'Words, words, words.', 1)
540 ['Words', 'words, words.']
541
Thomas Wouters89d996e2007-09-08 17:39:28 +0000542 Note that *split* will never split a string on an empty pattern match.
543 For example ::
544
545 >>> re.split('x*', 'foo')
546 ['foo']
547 >>> re.split("(?m)^$", "foo\n\nbar\n")
548 ['foo\n\nbar\n']
Georg Brandl116aa622007-08-15 14:28:22 +0000549
550.. function:: findall(pattern, string[, flags])
551
Georg Brandl9afde1c2007-11-01 20:32:30 +0000552 Return all non-overlapping matches of *pattern* in *string*, as a list of
553 strings. If one or more groups are present in the pattern, return a list of
554 groups; this will be a list of tuples if the pattern has more than one group.
555 Empty matches are included in the result unless they touch the beginning of
556 another match.
Georg Brandl116aa622007-08-15 14:28:22 +0000557
Georg Brandl116aa622007-08-15 14:28:22 +0000558
559.. function:: finditer(pattern, string[, flags])
560
Georg Brandl9afde1c2007-11-01 20:32:30 +0000561 Return an :term:`iterator` yielding :class:`MatchObject` instances over all
562 non-overlapping matches for the RE *pattern* in *string*. Empty matches are
563 included in the result unless they touch the beginning of another match.
Georg Brandl116aa622007-08-15 14:28:22 +0000564
Georg Brandl116aa622007-08-15 14:28:22 +0000565
566.. function:: sub(pattern, repl, string[, count])
567
568 Return the string obtained by replacing the leftmost non-overlapping occurrences
569 of *pattern* in *string* by the replacement *repl*. If the pattern isn't found,
570 *string* is returned unchanged. *repl* can be a string or a function; if it is
571 a string, any backslash escapes in it are processed. That is, ``\n`` is
572 converted to a single newline character, ``\r`` is converted to a linefeed, and
573 so forth. Unknown escapes such as ``\j`` are left alone. Backreferences, such
574 as ``\6``, are replaced with the substring matched by group 6 in the pattern.
575 For example::
576
577 >>> re.sub(r'def\s+([a-zA-Z_][a-zA-Z_0-9]*)\s*\(\s*\):',
578 ... r'static PyObject*\npy_\1(void)\n{',
579 ... 'def myfunc():')
580 'static PyObject*\npy_myfunc(void)\n{'
581
582 If *repl* is a function, it is called for every non-overlapping occurrence of
583 *pattern*. The function takes a single match object argument, and returns the
584 replacement string. For example::
585
586 >>> def dashrepl(matchobj):
587 ... if matchobj.group(0) == '-': return ' '
588 ... else: return '-'
589 >>> re.sub('-{1,2}', dashrepl, 'pro----gram-files')
590 'pro--gram files'
591
592 The pattern may be a string or an RE object; if you need to specify regular
593 expression flags, you must use a RE object, or use embedded modifiers in a
594 pattern; for example, ``sub("(?i)b+", "x", "bbbb BBBB")`` returns ``'x x'``.
595
596 The optional argument *count* is the maximum number of pattern occurrences to be
597 replaced; *count* must be a non-negative integer. If omitted or zero, all
598 occurrences will be replaced. Empty matches for the pattern are replaced only
599 when not adjacent to a previous match, so ``sub('x*', '-', 'abc')`` returns
600 ``'-a-b-c-'``.
601
602 In addition to character escapes and backreferences as described above,
603 ``\g<name>`` will use the substring matched by the group named ``name``, as
604 defined by the ``(?P<name>...)`` syntax. ``\g<number>`` uses the corresponding
605 group number; ``\g<2>`` is therefore equivalent to ``\2``, but isn't ambiguous
606 in a replacement such as ``\g<2>0``. ``\20`` would be interpreted as a
607 reference to group 20, not a reference to group 2 followed by the literal
608 character ``'0'``. The backreference ``\g<0>`` substitutes in the entire
609 substring matched by the RE.
610
611
612.. function:: subn(pattern, repl, string[, count])
613
614 Perform the same operation as :func:`sub`, but return a tuple ``(new_string,
615 number_of_subs_made)``.
616
617
618.. function:: escape(string)
619
620 Return *string* with all non-alphanumerics backslashed; this is useful if you
621 want to match an arbitrary literal string that may have regular expression
622 metacharacters in it.
623
624
625.. exception:: error
626
627 Exception raised when a string passed to one of the functions here is not a
628 valid regular expression (for example, it might contain unmatched parentheses)
629 or when some other error occurs during compilation or matching. It is never an
630 error if a string contains no match for a pattern.
631
632
633.. _re-objects:
634
635Regular Expression Objects
636--------------------------
637
638Compiled regular expression objects support the following methods and
639attributes:
640
641
642.. method:: RegexObject.match(string[, pos[, endpos]])
643
644 If zero or more characters at the beginning of *string* match this regular
645 expression, return a corresponding :class:`MatchObject` instance. Return
646 ``None`` if the string does not match the pattern; note that this is different
647 from a zero-length match.
648
649 .. note::
650
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000651 If you want to locate a match anywhere in *string*, use :meth:`search`
652 instead.
Georg Brandl116aa622007-08-15 14:28:22 +0000653
654 The optional second parameter *pos* gives an index in the string where the
655 search is to start; it defaults to ``0``. This is not completely equivalent to
656 slicing the string; the ``'^'`` pattern character matches at the real beginning
657 of the string and at positions just after a newline, but not necessarily at the
658 index where the search is to start.
659
660 The optional parameter *endpos* limits how far the string will be searched; it
661 will be as if the string is *endpos* characters long, so only the characters
662 from *pos* to ``endpos - 1`` will be searched for a match. If *endpos* is less
663 than *pos*, no match will be found, otherwise, if *rx* is a compiled regular
664 expression object, ``rx.match(string, 0, 50)`` is equivalent to
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000665 ``rx.match(string[:50], 0)``. ::
666
667 >>> pattern = re.compile("o")
668 >>> pattern.match("dog") # No match as "o" is not at the start of "dog."
669 >>> pattern.match("dog", 1) # Match as "o" is the 2nd character of "dog".
670 <_sre.SRE_Match object at 0x827eb10>
Georg Brandl116aa622007-08-15 14:28:22 +0000671
672
673.. method:: RegexObject.search(string[, pos[, endpos]])
674
675 Scan through *string* looking for a location where this regular expression
676 produces a match, and return a corresponding :class:`MatchObject` instance.
677 Return ``None`` if no position in the string matches the pattern; note that this
678 is different from finding a zero-length match at some point in the string.
679
680 The optional *pos* and *endpos* parameters have the same meaning as for the
681 :meth:`match` method.
682
683
684.. method:: RegexObject.split(string[, maxsplit=0])
685
686 Identical to the :func:`split` function, using the compiled pattern.
687
688
689.. method:: RegexObject.findall(string[, pos[, endpos]])
690
691 Identical to the :func:`findall` function, using the compiled pattern.
692
693
694.. method:: RegexObject.finditer(string[, pos[, endpos]])
695
696 Identical to the :func:`finditer` function, using the compiled pattern.
697
698
699.. method:: RegexObject.sub(repl, string[, count=0])
700
701 Identical to the :func:`sub` function, using the compiled pattern.
702
703
704.. method:: RegexObject.subn(repl, string[, count=0])
705
706 Identical to the :func:`subn` function, using the compiled pattern.
707
708
709.. attribute:: RegexObject.flags
710
711 The flags argument used when the RE object was compiled, or ``0`` if no flags
712 were provided.
713
714
715.. attribute:: RegexObject.groupindex
716
717 A dictionary mapping any symbolic group names defined by ``(?P<id>)`` to group
718 numbers. The dictionary is empty if no symbolic groups were used in the
719 pattern.
720
721
722.. attribute:: RegexObject.pattern
723
724 The pattern string from which the RE object was compiled.
725
726
727.. _match-objects:
728
729Match Objects
730-------------
731
Georg Brandl9afde1c2007-11-01 20:32:30 +0000732Match objects always have a boolean value of :const:`True`, so that you can test
733whether e.g. :func:`match` resulted in a match with a simple if statement. They
734support the following methods and attributes:
Georg Brandl116aa622007-08-15 14:28:22 +0000735
736
737.. method:: MatchObject.expand(template)
738
739 Return the string obtained by doing backslash substitution on the template
740 string *template*, as done by the :meth:`sub` method. Escapes such as ``\n`` are
741 converted to the appropriate characters, and numeric backreferences (``\1``,
742 ``\2``) and named backreferences (``\g<1>``, ``\g<name>``) are replaced by the
743 contents of the corresponding group.
744
745
746.. method:: MatchObject.group([group1, ...])
747
748 Returns one or more subgroups of the match. If there is a single argument, the
749 result is a single string; if there are multiple arguments, the result is a
750 tuple with one item per argument. Without arguments, *group1* defaults to zero
751 (the whole match is returned). If a *groupN* argument is zero, the corresponding
752 return value is the entire matching string; if it is in the inclusive range
753 [1..99], it is the string matching the corresponding parenthesized group. If a
754 group number is negative or larger than the number of groups defined in the
755 pattern, an :exc:`IndexError` exception is raised. If a group is contained in a
756 part of the pattern that did not match, the corresponding result is ``None``.
757 If a group is contained in a part of the pattern that matched multiple times,
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000758 the last match is returned. ::
759
760 >>> m = re.match(r"(\w+) (\w+)", "Isaac Newton, physicist")
761 >>> m.group(0)
762 'Isaac Newton' # The entire match
763 >>> m.group(1)
764 'Isaac' # The first parenthesized subgroup.
765 >>> m.group(2)
766 'Newton' # The second parenthesized subgroup.
767 >>> m.group(1, 2)
768 ('Isaac', 'Newton') # Multiple arguments give us a tuple.
Georg Brandl116aa622007-08-15 14:28:22 +0000769
770 If the regular expression uses the ``(?P<name>...)`` syntax, the *groupN*
771 arguments may also be strings identifying groups by their group name. If a
772 string argument is not used as a group name in the pattern, an :exc:`IndexError`
773 exception is raised.
774
775 A moderately complicated example::
776
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000777 >>> m = re.match(r"(?P<first_name>\w+) (?P<last_name>\w+)", "Malcom Reynolds")
778 >>> m.group('first_name')
779 'Malcom'
780 >>> m.group('last_name')
781 'Reynolds'
Georg Brandl116aa622007-08-15 14:28:22 +0000782
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000783 Named groups can also be referred to by their index::
784
785 >>> m.group(1)
786 'Malcom'
787 >>> m.group(2)
788 'Reynolds'
789
790 If a group matches multiple times, only the last match is accessible::
791 >>> m = re.match(r"(..)+", "a1b2c3") # Matches 3 times.
792 >>> m.group(1) # Returns only the last match.
793 'c3'
Georg Brandl116aa622007-08-15 14:28:22 +0000794
795
796.. method:: MatchObject.groups([default])
797
798 Return a tuple containing all the subgroups of the match, from 1 up to however
799 many groups are in the pattern. The *default* argument is used for groups that
800 did not participate in the match; it defaults to ``None``. (Incompatibility
801 note: in the original Python 1.5 release, if the tuple was one element long, a
802 string would be returned instead. In later versions (from 1.5.1 on), a
803 singleton tuple is returned in such cases.)
804
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000805 For example::
806
807 >>> m = re.match(r"(\d+)\.(\d+)", "24.1632")
808 >>> m.groups()
809 ('24', '1632')
810
811 If we make the decimal place and everything after it optional, not all groups
812 might participate in the match. These groups will default to ``None`` unless
813 the *default* argument is given::
814
815 >>> m = re.match(r"(\d+)\.?(\d+)?", "24")
816 >>> m.groups()
817 ('24', None) # Second group defaults to None.
818 >>> m.groups('0')
819 ('24', '0') # Now, the second group defaults to '0'.
820
Georg Brandl116aa622007-08-15 14:28:22 +0000821
822.. method:: MatchObject.groupdict([default])
823
824 Return a dictionary containing all the *named* subgroups of the match, keyed by
825 the subgroup name. The *default* argument is used for groups that did not
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000826 participate in the match; it defaults to ``None``. For example::
827
828 >>> m = re.match(r"(?P<first_name>\w+) (?P<last_name>\w+)", "Malcom Reynolds")
829 >>> m.groupdict()
830 {'first_name': 'Malcom', 'last_name': 'Reynolds'}
Georg Brandl116aa622007-08-15 14:28:22 +0000831
832
833.. method:: MatchObject.start([group])
834 MatchObject.end([group])
835
836 Return the indices of the start and end of the substring matched by *group*;
837 *group* defaults to zero (meaning the whole matched substring). Return ``-1`` if
838 *group* exists but did not contribute to the match. For a match object *m*, and
839 a group *g* that did contribute to the match, the substring matched by group *g*
840 (equivalent to ``m.group(g)``) is ::
841
842 m.string[m.start(g):m.end(g)]
843
844 Note that ``m.start(group)`` will equal ``m.end(group)`` if *group* matched a
845 null string. For example, after ``m = re.search('b(c?)', 'cba')``,
846 ``m.start(0)`` is 1, ``m.end(0)`` is 2, ``m.start(1)`` and ``m.end(1)`` are both
847 2, and ``m.start(2)`` raises an :exc:`IndexError` exception.
848
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000849 An example that will remove *remove_this* from email addresses::
850
851 >>> email = "tony@tiremove_thisger.net"
852 >>> m = re.search("remove_this", email)
853 >>> email[:m.start()] + email[m.end():]
854 'tony@tiger.net'
855
Georg Brandl116aa622007-08-15 14:28:22 +0000856
857.. method:: MatchObject.span([group])
858
859 For :class:`MatchObject` *m*, return the 2-tuple ``(m.start(group),
860 m.end(group))``. Note that if *group* did not contribute to the match, this is
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000861 ``(-1, -1)``. *group* defaults to zero, the entire match.
Georg Brandl116aa622007-08-15 14:28:22 +0000862
863
864.. attribute:: MatchObject.pos
865
866 The value of *pos* which was passed to the :func:`search` or :func:`match`
867 method of the :class:`RegexObject`. This is the index into the string at which
868 the RE engine started looking for a match.
869
870
871.. attribute:: MatchObject.endpos
872
873 The value of *endpos* which was passed to the :func:`search` or :func:`match`
874 method of the :class:`RegexObject`. This is the index into the string beyond
875 which the RE engine will not go.
876
877
878.. attribute:: MatchObject.lastindex
879
880 The integer index of the last matched capturing group, or ``None`` if no group
881 was matched at all. For example, the expressions ``(a)b``, ``((a)(b))``, and
882 ``((ab))`` will have ``lastindex == 1`` if applied to the string ``'ab'``, while
883 the expression ``(a)(b)`` will have ``lastindex == 2``, if applied to the same
884 string.
885
886
887.. attribute:: MatchObject.lastgroup
888
889 The name of the last matched capturing group, or ``None`` if the group didn't
890 have a name, or if no group was matched at all.
891
892
893.. attribute:: MatchObject.re
894
895 The regular expression object whose :meth:`match` or :meth:`search` method
896 produced this :class:`MatchObject` instance.
897
898
899.. attribute:: MatchObject.string
900
901 The string passed to :func:`match` or :func:`search`.
902
903
904Examples
905--------
906
Christian Heimesb9eccbf2007-12-05 20:18:38 +0000907
908Checking For a Pair
909^^^^^^^^^^^^^^^^^^^
910
911In this example, we'll use the following helper function to display match
912objects a little more gracefully::
913
914 def displaymatch(match):
915 if match is None:
916 return None
917 return '<Match: %r, groups=%r>' % (match.group(), match.groups())
918
919Suppose you are writing a poker program where a player's hand is represented as
920a 5-character string with each character representing a card, "a" for ace, "k"
921for king, "q" for queen, j for jack, "0" for 10, and "1" through "9"
922representing the card with that value.
923
924To see if a given string is a valid hand, one could do the following::
925
926 >>> valid = re.compile(r"[0-9akqj]{5}$"
927 >>> displaymatch(valid.match("ak05q")) # Valid.
928 <Match: 'ak05q', groups=()>
929 >>> displaymatch(valid.match("ak05e")) # Invalid.
930 >>> displaymatch(valid.match("ak0")) # Invalid.
931 >>> displaymatch(valid.match("727ak")) # Valid.
932 <Match: '727ak', groups=()>
933
934That last hand, ``"727ak"``, contained a pair, or two of the same valued cards.
935To match this with a regular expression, one could use backreferences as such::
936
937 >>> pair = re.compile(r".*(.).*\1")
938 >>> displaymatch(pair.match("717ak")) # Pair of 7s.
939 <Match: '717', groups=('7',)>
940 >>> displaymatch(pair.match("718ak")) # No pairs.
941 >>> displaymatch(pair.match("354aa")) # Pair of aces.
942 <Match: '345aa', groups=('a',)>
943
944To find out what card the pair consists of, one could use the :func:`group`
945method of :class:`MatchObject` in the following manner::
946
947 >>> pair.match("717ak").group(1)
948 '7'
949
950 # Error because re.match() returns None, which doesn't have a group() method:
951 >>> pair.match("718ak").group(1)
952 Traceback (most recent call last):
953 File "<pyshell#23>", line 1, in <module>
954 re.match(r".*(.).*\1", "718ak").group(1)
955 AttributeError: 'NoneType' object has no attribute 'group'
956
957 >>> pair.match("354aa").group(1)
958 'a'
959
960
961Simulating scanf()
962^^^^^^^^^^^^^^^^^^
Georg Brandl116aa622007-08-15 14:28:22 +0000963
964.. index:: single: scanf()
965
966Python does not currently have an equivalent to :cfunc:`scanf`. Regular
967expressions are generally more powerful, though also more verbose, than
968:cfunc:`scanf` format strings. The table below offers some more-or-less
969equivalent mappings between :cfunc:`scanf` format tokens and regular
970expressions.
971
972+--------------------------------+---------------------------------------------+
973| :cfunc:`scanf` Token | Regular Expression |
974+================================+=============================================+
975| ``%c`` | ``.`` |
976+--------------------------------+---------------------------------------------+
977| ``%5c`` | ``.{5}`` |
978+--------------------------------+---------------------------------------------+
979| ``%d`` | ``[-+]?\d+`` |
980+--------------------------------+---------------------------------------------+
981| ``%e``, ``%E``, ``%f``, ``%g`` | ``[-+]?(\d+(\.\d*)?|\.\d+)([eE][-+]?\d+)?`` |
982+--------------------------------+---------------------------------------------+
983| ``%i`` | ``[-+]?(0[xX][\dA-Fa-f]+|0[0-7]*|\d+)`` |
984+--------------------------------+---------------------------------------------+
985| ``%o`` | ``0[0-7]*`` |
986+--------------------------------+---------------------------------------------+
987| ``%s`` | ``\S+`` |
988+--------------------------------+---------------------------------------------+
989| ``%u`` | ``\d+`` |
990+--------------------------------+---------------------------------------------+
991| ``%x``, ``%X`` | ``0[xX][\dA-Fa-f]+`` |
992+--------------------------------+---------------------------------------------+
993
994To extract the filename and numbers from a string like ::
995
996 /usr/sbin/sendmail - 0 errors, 4 warnings
997
998you would use a :cfunc:`scanf` format like ::
999
1000 %s - %d errors, %d warnings
1001
1002The equivalent regular expression would be ::
1003
1004 (\S+) - (\d+) errors, (\d+) warnings
1005
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001006
1007Avoiding recursion
1008^^^^^^^^^^^^^^^^^^
Georg Brandl116aa622007-08-15 14:28:22 +00001009
1010If you create regular expressions that require the engine to perform a lot of
1011recursion, you may encounter a :exc:`RuntimeError` exception with the message
1012``maximum recursion limit`` exceeded. For example, ::
1013
1014 >>> import re
1015 >>> s = 'Begin ' + 1000*'a very long string ' + 'end'
1016 >>> re.match('Begin (\w| )*? end', s).end()
1017 Traceback (most recent call last):
1018 File "<stdin>", line 1, in ?
1019 File "/usr/local/lib/python2.5/re.py", line 132, in match
1020 return _compile(pattern, flags).match(string)
1021 RuntimeError: maximum recursion limit exceeded
1022
1023You can often restructure your regular expression to avoid recursion.
1024
1025Starting with Python 2.3, simple uses of the ``*?`` pattern are special-cased to
1026avoid recursion. Thus, the above regular expression can avoid recursion by
1027being recast as ``Begin [a-zA-Z0-9_ ]*?end``. As a further benefit, such
1028regular expressions will run faster than their recursive equivalents.
1029
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001030
1031search() vs. match()
1032^^^^^^^^^^^^^^^^^^^^
1033
1034In a nutshell, :func:`match` only attempts to match a pattern at the beginning
1035of a string where :func:`search` will match a pattern anywhere in a string.
1036For example::
1037
1038 >>> re.match("o", "dog") # No match as "o" is not the first letter of "dog".
1039 >>> re.search("o", "dog") # Match as search() looks everywhere in the string.
1040 <_sre.SRE_Match object at 0x827e9f8>
1041
1042.. note::
1043
1044 The following applies only to regular expression objects like those created
1045 with ``re.compile("pattern")``, not the primitives
1046 ``re.match(pattern, string)`` or ``re.search(pattern, string)``.
1047
1048:func:`match` has an optional second parameter that gives an index in the string
1049where the search is to start::
1050
1051 >>> pattern = re.compile("o")
1052 >>> pattern.match("dog") # No match as "o" is not at the start of "dog."
1053 # Equivalent to the above expression as 0 is the default starting index:
1054 >>> pattern.match("dog", 0)
1055 # Match as "o" is the 2nd character of "dog" (index 0 is the first):
1056 >>> pattern.match("dog", 1)
1057 <_sre.SRE_Match object at 0x827eb10>
1058 >>> pattern.match("dog", 2) # No match as "o" is not the 3rd character of "dog."
1059
1060
1061Making a Phonebook
1062^^^^^^^^^^^^^^^^^^
1063
1064:func:`split` splits a string into a list delimited by the passed pattern. The
1065method is invaluable for converting textual data into data structures that can be
1066easily read and modified by Python as demonstrated in the following example that
1067creates a phonebook.
1068
Christian Heimes255f53b2007-12-08 15:33:56 +00001069First, here is the input. Normally it may come from a file, here we are using
1070triple-quoted string syntax::
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001071
Christian Heimes255f53b2007-12-08 15:33:56 +00001072 >>> input = """Ross McFluff: 834.345.1254 155 Elm Street
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001073
Christian Heimes255f53b2007-12-08 15:33:56 +00001074 Ronald Heathmore: 892.345.3428 436 Finley Avenue
1075 Frank Burger: 925.541.7625 662 South Dogwood Way
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001076
Christian Heimes255f53b2007-12-08 15:33:56 +00001077
1078 Heather Albrecht: 548.326.4584 919 Park Place"""
1079
1080The entries are separated by one or more newlines. Now we convert the string
1081into a list with each nonempty line having its own entry::
1082
1083 >>> entries = re.split("\n+", input)
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001084 >>> entries
1085 ['Ross McFluff 834.345.1254 155 Elm Street',
1086 'Ronald Heathmore 892.345.3428 436 Finley Avenue',
1087 'Frank Burger 925.541.7625 662 South Dogwood Way',
1088 'Heather Albrecht 548.326.4584 919 Park Place']
1089
1090Finally, split each entry into a list with first name, last name, telephone
1091number, and address. We use the ``maxsplit`` paramater of :func:`split`
1092because the address has spaces, our splitting pattern, in it::
1093
Christian Heimes255f53b2007-12-08 15:33:56 +00001094 >>> [re.split(":? ", entry, 3) for entry in entries]
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001095 [['Ross', 'McFluff', '834.345.1254', '155 Elm Street'],
1096 ['Ronald', 'Heathmore', '892.345.3428', '436 Finley Avenue'],
1097 ['Frank', 'Burger', '925.541.7625', '662 South Dogwood Way'],
1098 ['Heather', 'Albrecht', '548.326.4584', '919 Park Place']]
1099
Christian Heimes255f53b2007-12-08 15:33:56 +00001100The ``:?`` pattern matches the colon after the last name, so that it does not
1101occur in the result list. With a ``maxsplit`` of ``4``, we could seperate the
1102house number from the street name::
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001103
Christian Heimes255f53b2007-12-08 15:33:56 +00001104 >>> [re.split(":? ", entry, 4) for entry in entries]
Christian Heimesb9eccbf2007-12-05 20:18:38 +00001105 [['Ross', 'McFluff', '834.345.1254', '155', 'Elm Street'],
1106 ['Ronald', 'Heathmore', '892.345.3428', '436', 'Finley Avenue'],
1107 ['Frank', 'Burger', '925.541.7625', '662', 'South Dogwood Way'],
1108 ['Heather', 'Albrecht', '548.326.4584', '919', 'Park Place']]
1109
1110
1111Text Munging
1112^^^^^^^^^^^^
1113
1114:func:`sub` replaces every occurrence of a pattern with a string or the
1115result of a function. This example demonstrates using :func:`sub` with
1116a function to "munge" text, or randomize the order of all the characters
1117in each word of a sentence except for the first and last characters::
1118
1119 >>> def repl(m):
1120 ... inner_word = list(m.group(2))
1121 ... random.shuffle(inner_word)
1122 ... return m.group(1) + "".join(inner_word) + m.group(3)
1123 >>> text = "Professor Abdolmalek, please report your absences promptly."
1124 >>> re.sub("(\w)(\w+)(\w)", repl, text)
1125 'Poefsrosr Aealmlobdk, pslaee reorpt your abnseces plmrptoy.'
1126 >>> re.sub("(\w)(\w+)(\w)", repl, text)
1127 'Pofsroser Aodlambelk, plasee reoprt yuor asnebces potlmrpy.'
1128
1129
1130Finding all Adverbs
1131^^^^^^^^^^^^^^^^^^^
1132
1133:func:`findall` matches *all* occurences of a pattern, not just the first
1134one as :func:`search` does. For example, if one was a writer and wanted to
1135find all of the adverbs in some text, he or she might use :func:`findall` in
1136the following manner::
1137
1138 >>> text = "He was carefully disguised but captured quickly by police."
1139 >>> re.findall(r"\w+ly", text)
1140 ['carefully', 'quickly']
1141
1142
1143Finding all Adverbs and their Positions
1144^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1145
1146If one wants more information about all matches of a pattern than the matched
1147text, :func:`finditer` is useful as it provides instances of
1148:class:`MatchObject` instead of strings. Continuing with the previous example,
1149if one was a writer who wanted to find all of the adverbs *and their positions*
1150in some text, he or she would use :func:`finditer` in the following manner::
1151
1152 >>> text = "He was carefully disguised but captured quickly by police."
1153 >>> for m in re.finditer(r"\w+ly", text):
1154 print '%02d-%02d: %s' % (m.start(), m.end(), m.group(0))
1155 07-16: carefully
1156 40-47: quickly
1157
1158
1159Raw String Notation
1160^^^^^^^^^^^^^^^^^^^
1161
1162Raw string notation (``r"text"``) keeps regular expressions sane. Without it,
1163every backslash (``'\'``) in a regular expression would have to be prefixed with
1164another one to escape it. For example, the two following lines of code are
1165functionally identical::
1166
1167 >>> re.match(r"\W(.)\1\W", " ff ")
1168 <_sre.SRE_Match object at 0x8262760>
1169 >>> re.match("\\W(.)\\1\\W", " ff ")
1170 <_sre.SRE_Match object at 0x82627a0>
1171
1172When one wants to match a literal backslash, it must be escaped in the regular
1173expression. With raw string notation, this means ``r"\\"``. Without raw string
1174notation, one must use ``"\\\\"``, making the following lines of code
1175functionally identical::
1176
1177 >>> re.match(r"\\", r"\\")
1178 <_sre.SRE_Match object at 0x827eb48>
1179 >>> re.match("\\\\", r"\\")
1180 <_sre.SRE_Match object at 0x827ec60>