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