blob: 850e1f8727982940a7748cb74af094e472d1a04a [file] [log] [blame]
Georg Brandl8ec7f652007-08-15 14:28:01 +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 Brandlba2e5192007-09-27 06:26:58 +000031newline. Usually patterns will be expressed in Python code using this raw
32string notation.
Georg Brandl8ec7f652007-08-15 14:28:01 +000033
Georg Brandlb8df1562007-12-05 18:30:48 +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 Brandl8ec7f652007-08-15 14:28:01 +000039.. seealso::
40
41 Mastering Regular Expressions
42 Book on regular expressions by Jeffrey Friedl, published by O'Reilly. The
Georg Brandlba2e5192007-09-27 06:26:58 +000043 second edition of the book no longer covers Python at all, but the first
Georg Brandl8ec7f652007-08-15 14:28:01 +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 Brandl8ec7f652007-08-15 14:28:01 +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
293 .. versionadded:: 2.4
294
295The special sequences consist of ``'\'`` and a character from the list below.
296If the ordinary character is not on the list, then the resulting RE will match
297the second character. For example, ``\$`` matches the character ``'$'``.
298
Georg Brandl8ec7f652007-08-15 14:28:01 +0000299``\number``
300 Matches the contents of the group of the same number. Groups are numbered
301 starting from 1. For example, ``(.+) \1`` matches ``'the the'`` or ``'55 55'``,
302 but not ``'the end'`` (note the space after the group). This special sequence
303 can only be used to match one of the first 99 groups. If the first digit of
304 *number* is 0, or *number* is 3 octal digits long, it will not be interpreted as
305 a group match, but as the character with octal value *number*. Inside the
306 ``'['`` and ``']'`` of a character class, all numeric escapes are treated as
307 characters.
308
309``\A``
310 Matches only at the start of the string.
311
312``\b``
313 Matches the empty string, but only at the beginning or end of a word. A word is
314 defined as a sequence of alphanumeric or underscore characters, so the end of a
315 word is indicated by whitespace or a non-alphanumeric, non-underscore character.
316 Note that ``\b`` is defined as the boundary between ``\w`` and ``\ W``, so the
317 precise set of characters deemed to be alphanumeric depends on the values of the
318 ``UNICODE`` and ``LOCALE`` flags. Inside a character range, ``\b`` represents
319 the backspace character, for compatibility with Python's string literals.
320
321``\B``
322 Matches the empty string, but only when it is *not* at the beginning or end of a
323 word. This is just the opposite of ``\b``, so is also subject to the settings
324 of ``LOCALE`` and ``UNICODE``.
325
326``\d``
327 When the :const:`UNICODE` flag is not specified, matches any decimal digit; this
328 is equivalent to the set ``[0-9]``. With :const:`UNICODE`, it will match
329 whatever is classified as a digit in the Unicode character properties database.
330
331``\D``
332 When the :const:`UNICODE` flag is not specified, matches any non-digit
333 character; this is equivalent to the set ``[^0-9]``. With :const:`UNICODE`, it
334 will match anything other than character marked as digits in the Unicode
335 character properties database.
336
337``\s``
338 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
339 any whitespace character; this is equivalent to the set ``[ \t\n\r\f\v]``. With
340 :const:`LOCALE`, it will match this set plus whatever characters are defined as
341 space for the current locale. If :const:`UNICODE` is set, this will match the
342 characters ``[ \t\n\r\f\v]`` plus whatever is classified as space in the Unicode
343 character properties database.
344
345``\S``
346 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
347 any non-whitespace character; this is equivalent to the set ``[^ \t\n\r\f\v]``
348 With :const:`LOCALE`, it will match any character not in this set, and not
349 defined as space in the current locale. If :const:`UNICODE` is set, this will
350 match anything other than ``[ \t\n\r\f\v]`` and characters marked as space in
351 the Unicode character properties database.
352
353``\w``
354 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
355 any alphanumeric character and the underscore; this is equivalent to the set
356 ``[a-zA-Z0-9_]``. With :const:`LOCALE`, it will match the set ``[0-9_]`` plus
357 whatever characters are defined as alphanumeric for the current locale. If
358 :const:`UNICODE` is set, this will match the characters ``[0-9_]`` plus whatever
359 is classified as alphanumeric in the Unicode character properties database.
360
361``\W``
362 When the :const:`LOCALE` and :const:`UNICODE` flags are not specified, matches
363 any non-alphanumeric character; this is equivalent to the set ``[^a-zA-Z0-9_]``.
364 With :const:`LOCALE`, it will match any character not in the set ``[0-9_]``, and
365 not defined as alphanumeric for the current locale. If :const:`UNICODE` is set,
366 this will match anything other than ``[0-9_]`` and characters marked as
367 alphanumeric in the Unicode character properties database.
368
369``\Z``
370 Matches only at the end of the string.
371
372Most of the standard escapes supported by Python string literals are also
373accepted by the regular expression parser::
374
375 \a \b \f \n
376 \r \t \v \x
377 \\
378
379Octal escapes are included in a limited form: If the first digit is a 0, or if
380there are three octal digits, it is considered an octal escape. Otherwise, it is
381a group reference. As for string literals, octal escapes are always at most
382three digits in length.
383
Georg Brandl8ec7f652007-08-15 14:28:01 +0000384
385.. _matching-searching:
386
387Matching vs Searching
388---------------------
389
390.. sectionauthor:: Fred L. Drake, Jr. <fdrake@acm.org>
391
392
393Python offers two different primitive operations based on regular expressions:
Georg Brandl604c1212007-08-23 21:36:05 +0000394**match** checks for a match only at the beginning of the string, while
395**search** checks for a match anywhere in the string (this is what Perl does
396by default).
Georg Brandl8ec7f652007-08-15 14:28:01 +0000397
Georg Brandl604c1212007-08-23 21:36:05 +0000398Note that match may differ from search even when using a regular expression
399beginning with ``'^'``: ``'^'`` matches only at the start of the string, or in
Georg Brandl8ec7f652007-08-15 14:28:01 +0000400:const:`MULTILINE` mode also immediately following a newline. The "match"
401operation succeeds only if the pattern matches at the start of the string
402regardless of mode, or at the starting position given by the optional *pos*
Georg Brandlb19be572007-12-29 10:57:00 +0000403argument regardless of whether a newline precedes it. ::
Georg Brandl8ec7f652007-08-15 14:28:01 +0000404
Georg Brandlb8df1562007-12-05 18:30:48 +0000405 >>> re.match("c", "abcdef") # No match
406 >>> re.search("c", "abcdef")
Georg Brandlb19be572007-12-29 10:57:00 +0000407 <_sre.SRE_Match object at 0x827e9c0> # Match
Georg Brandl8ec7f652007-08-15 14:28:01 +0000408
409
410.. _contents-of-module-re:
411
412Module Contents
413---------------
414
415The module defines several functions, constants, and an exception. Some of the
416functions are simplified versions of the full featured methods for compiled
417regular expressions. Most non-trivial applications always use the compiled
418form.
419
420
421.. function:: compile(pattern[, flags])
422
Georg Brandlba2e5192007-09-27 06:26:58 +0000423 Compile a regular expression pattern into a regular expression object, which
424 can be used for matching using its :func:`match` and :func:`search` methods,
Georg Brandl8ec7f652007-08-15 14:28:01 +0000425 described below.
426
427 The expression's behaviour can be modified by specifying a *flags* value.
428 Values can be any of the following variables, combined using bitwise OR (the
429 ``|`` operator).
430
431 The sequence ::
432
433 prog = re.compile(pat)
434 result = prog.match(str)
435
436 is equivalent to ::
437
438 result = re.match(pat, str)
439
Georg Brandlba2e5192007-09-27 06:26:58 +0000440 but the version using :func:`compile` is more efficient when the expression
441 will be used several times in a single program.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000442
Georg Brandlb19be572007-12-29 10:57:00 +0000443 .. (The compiled version of the last pattern passed to :func:`re.match` or
444 :func:`re.search` is cached, so programs that use only a single regular
445 expression at a time needn't worry about compiling regular expressions.)
Georg Brandl8ec7f652007-08-15 14:28:01 +0000446
447
448.. data:: I
449 IGNORECASE
450
451 Perform case-insensitive matching; expressions like ``[A-Z]`` will match
452 lowercase letters, too. This is not affected by the current locale.
453
454
455.. data:: L
456 LOCALE
457
Georg Brandlba2e5192007-09-27 06:26:58 +0000458 Make ``\w``, ``\W``, ``\b``, ``\B``, ``\s`` and ``\S`` dependent on the
459 current locale.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000460
461
462.. data:: M
463 MULTILINE
464
465 When specified, the pattern character ``'^'`` matches at the beginning of the
466 string and at the beginning of each line (immediately following each newline);
467 and the pattern character ``'$'`` matches at the end of the string and at the
468 end of each line (immediately preceding each newline). By default, ``'^'``
469 matches only at the beginning of the string, and ``'$'`` only at the end of the
470 string and immediately before the newline (if any) at the end of the string.
471
472
473.. data:: S
474 DOTALL
475
476 Make the ``'.'`` special character match any character at all, including a
477 newline; without this flag, ``'.'`` will match anything *except* a newline.
478
479
480.. data:: U
481 UNICODE
482
483 Make ``\w``, ``\W``, ``\b``, ``\B``, ``\d``, ``\D``, ``\s`` and ``\S`` dependent
484 on the Unicode character properties database.
485
486 .. versionadded:: 2.0
487
488
489.. data:: X
490 VERBOSE
491
492 This flag allows you to write regular expressions that look nicer. Whitespace
493 within the pattern is ignored, except when in a character class or preceded by
494 an unescaped backslash, and, when a line contains a ``'#'`` neither in a
495 character class or preceded by an unescaped backslash, all characters from the
496 leftmost such ``'#'`` through the end of the line are ignored.
497
Georg Brandlb8df1562007-12-05 18:30:48 +0000498 That means that the two following regular expression objects that match a
499 decimal number are functionally equal::
500
501 a = re.compile(r"""\d + # the integral part
502 \. # the decimal point
503 \d * # some fractional digits""", re.X)
504 b = re.compile(r"\d+\.\d*")
Georg Brandl8ec7f652007-08-15 14:28:01 +0000505
506
507.. function:: search(pattern, string[, flags])
508
509 Scan through *string* looking for a location where the regular expression
510 *pattern* produces a match, and return a corresponding :class:`MatchObject`
511 instance. Return ``None`` if no position in the string matches the pattern; note
512 that this is different from finding a zero-length match at some point in the
513 string.
514
515
516.. function:: match(pattern, string[, flags])
517
518 If zero or more characters at the beginning of *string* match the regular
519 expression *pattern*, return a corresponding :class:`MatchObject` instance.
520 Return ``None`` if the string does not match the pattern; note that this is
521 different from a zero-length match.
522
523 .. note::
524
Georg Brandlb8df1562007-12-05 18:30:48 +0000525 If you want to locate a match anywhere in *string*, use :meth:`search`
526 instead.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000527
528
529.. function:: split(pattern, string[, maxsplit=0])
530
531 Split *string* by the occurrences of *pattern*. If capturing parentheses are
532 used in *pattern*, then the text of all groups in the pattern are also returned
533 as part of the resulting list. If *maxsplit* is nonzero, at most *maxsplit*
534 splits occur, and the remainder of the string is returned as the final element
535 of the list. (Incompatibility note: in the original Python 1.5 release,
536 *maxsplit* was ignored. This has been fixed in later releases.) ::
537
538 >>> re.split('\W+', 'Words, words, words.')
539 ['Words', 'words', 'words', '']
540 >>> re.split('(\W+)', 'Words, words, words.')
541 ['Words', ', ', 'words', ', ', 'words', '.', '']
542 >>> re.split('\W+', 'Words, words, words.', 1)
543 ['Words', 'words, words.']
544
Skip Montanaro222907d2007-09-01 17:40:03 +0000545 Note that *split* will never split a string on an empty pattern match.
546 For example ::
547
548 >>> re.split('x*', 'foo')
549 ['foo']
550 >>> re.split("(?m)^$", "foo\n\nbar\n")
551 ['foo\n\nbar\n']
Georg Brandl8ec7f652007-08-15 14:28:01 +0000552
553.. function:: findall(pattern, string[, flags])
554
Georg Brandlba2e5192007-09-27 06:26:58 +0000555 Return all non-overlapping matches of *pattern* in *string*, as a list of
556 strings. If one or more groups are present in the pattern, return a list of
557 groups; this will be a list of tuples if the pattern has more than one group.
558 Empty matches are included in the result unless they touch the beginning of
559 another match.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000560
561 .. versionadded:: 1.5.2
562
563 .. versionchanged:: 2.4
564 Added the optional flags argument.
565
566
567.. function:: finditer(pattern, string[, flags])
568
Georg Brandle7a09902007-10-21 12:10:28 +0000569 Return an :term:`iterator` yielding :class:`MatchObject` instances over all
Georg Brandlba2e5192007-09-27 06:26:58 +0000570 non-overlapping matches for the RE *pattern* in *string*. Empty matches are
571 included in the result unless they touch the beginning of another match.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000572
573 .. versionadded:: 2.2
574
575 .. versionchanged:: 2.4
576 Added the optional flags argument.
577
578
579.. function:: sub(pattern, repl, string[, count])
580
581 Return the string obtained by replacing the leftmost non-overlapping occurrences
582 of *pattern* in *string* by the replacement *repl*. If the pattern isn't found,
583 *string* is returned unchanged. *repl* can be a string or a function; if it is
584 a string, any backslash escapes in it are processed. That is, ``\n`` is
585 converted to a single newline character, ``\r`` is converted to a linefeed, and
586 so forth. Unknown escapes such as ``\j`` are left alone. Backreferences, such
587 as ``\6``, are replaced with the substring matched by group 6 in the pattern.
588 For example::
589
590 >>> re.sub(r'def\s+([a-zA-Z_][a-zA-Z_0-9]*)\s*\(\s*\):',
591 ... r'static PyObject*\npy_\1(void)\n{',
592 ... 'def myfunc():')
593 'static PyObject*\npy_myfunc(void)\n{'
594
595 If *repl* is a function, it is called for every non-overlapping occurrence of
596 *pattern*. The function takes a single match object argument, and returns the
597 replacement string. For example::
598
599 >>> def dashrepl(matchobj):
600 ... if matchobj.group(0) == '-': return ' '
601 ... else: return '-'
602 >>> re.sub('-{1,2}', dashrepl, 'pro----gram-files')
603 'pro--gram files'
604
605 The pattern may be a string or an RE object; if you need to specify regular
606 expression flags, you must use a RE object, or use embedded modifiers in a
607 pattern; for example, ``sub("(?i)b+", "x", "bbbb BBBB")`` returns ``'x x'``.
608
609 The optional argument *count* is the maximum number of pattern occurrences to be
610 replaced; *count* must be a non-negative integer. If omitted or zero, all
611 occurrences will be replaced. Empty matches for the pattern are replaced only
612 when not adjacent to a previous match, so ``sub('x*', '-', 'abc')`` returns
613 ``'-a-b-c-'``.
614
615 In addition to character escapes and backreferences as described above,
616 ``\g<name>`` will use the substring matched by the group named ``name``, as
617 defined by the ``(?P<name>...)`` syntax. ``\g<number>`` uses the corresponding
618 group number; ``\g<2>`` is therefore equivalent to ``\2``, but isn't ambiguous
619 in a replacement such as ``\g<2>0``. ``\20`` would be interpreted as a
620 reference to group 20, not a reference to group 2 followed by the literal
621 character ``'0'``. The backreference ``\g<0>`` substitutes in the entire
622 substring matched by the RE.
623
624
625.. function:: subn(pattern, repl, string[, count])
626
627 Perform the same operation as :func:`sub`, but return a tuple ``(new_string,
628 number_of_subs_made)``.
629
630
631.. function:: escape(string)
632
633 Return *string* with all non-alphanumerics backslashed; this is useful if you
634 want to match an arbitrary literal string that may have regular expression
635 metacharacters in it.
636
637
638.. exception:: error
639
640 Exception raised when a string passed to one of the functions here is not a
641 valid regular expression (for example, it might contain unmatched parentheses)
642 or when some other error occurs during compilation or matching. It is never an
643 error if a string contains no match for a pattern.
644
645
646.. _re-objects:
647
648Regular Expression Objects
649--------------------------
650
651Compiled regular expression objects support the following methods and
652attributes:
653
654
655.. method:: RegexObject.match(string[, pos[, endpos]])
656
657 If zero or more characters at the beginning of *string* match this regular
658 expression, return a corresponding :class:`MatchObject` instance. Return
659 ``None`` if the string does not match the pattern; note that this is different
660 from a zero-length match.
661
662 .. note::
663
Georg Brandlb8df1562007-12-05 18:30:48 +0000664 If you want to locate a match anywhere in *string*, use :meth:`search`
665 instead.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000666
667 The optional second parameter *pos* gives an index in the string where the
668 search is to start; it defaults to ``0``. This is not completely equivalent to
669 slicing the string; the ``'^'`` pattern character matches at the real beginning
670 of the string and at positions just after a newline, but not necessarily at the
671 index where the search is to start.
672
673 The optional parameter *endpos* limits how far the string will be searched; it
674 will be as if the string is *endpos* characters long, so only the characters
675 from *pos* to ``endpos - 1`` will be searched for a match. If *endpos* is less
676 than *pos*, no match will be found, otherwise, if *rx* is a compiled regular
677 expression object, ``rx.match(string, 0, 50)`` is equivalent to
Georg Brandlb8df1562007-12-05 18:30:48 +0000678 ``rx.match(string[:50], 0)``. ::
679
680 >>> pattern = re.compile("o")
681 >>> pattern.match("dog") # No match as "o" is not at the start of "dog."
682 >>> pattern.match("dog", 1) # Match as "o" is the 2nd character of "dog".
683 <_sre.SRE_Match object at 0x827eb10>
Georg Brandl8ec7f652007-08-15 14:28:01 +0000684
685
686.. method:: RegexObject.search(string[, pos[, endpos]])
687
688 Scan through *string* looking for a location where this regular expression
689 produces a match, and return a corresponding :class:`MatchObject` instance.
690 Return ``None`` if no position in the string matches the pattern; note that this
691 is different from finding a zero-length match at some point in the string.
692
693 The optional *pos* and *endpos* parameters have the same meaning as for the
694 :meth:`match` method.
695
696
697.. method:: RegexObject.split(string[, maxsplit=0])
698
699 Identical to the :func:`split` function, using the compiled pattern.
700
701
702.. method:: RegexObject.findall(string[, pos[, endpos]])
703
704 Identical to the :func:`findall` function, using the compiled pattern.
705
706
707.. method:: RegexObject.finditer(string[, pos[, endpos]])
708
709 Identical to the :func:`finditer` function, using the compiled pattern.
710
711
712.. method:: RegexObject.sub(repl, string[, count=0])
713
714 Identical to the :func:`sub` function, using the compiled pattern.
715
716
717.. method:: RegexObject.subn(repl, string[, count=0])
718
719 Identical to the :func:`subn` function, using the compiled pattern.
720
721
722.. attribute:: RegexObject.flags
723
724 The flags argument used when the RE object was compiled, or ``0`` if no flags
725 were provided.
726
727
728.. attribute:: RegexObject.groupindex
729
730 A dictionary mapping any symbolic group names defined by ``(?P<id>)`` to group
731 numbers. The dictionary is empty if no symbolic groups were used in the
732 pattern.
733
734
735.. attribute:: RegexObject.pattern
736
737 The pattern string from which the RE object was compiled.
738
739
740.. _match-objects:
741
742Match Objects
743-------------
744
Georg Brandlba2e5192007-09-27 06:26:58 +0000745Match objects always have a boolean value of :const:`True`, so that you can test
746whether e.g. :func:`match` resulted in a match with a simple if statement. They
747support the following methods and attributes:
Georg Brandl8ec7f652007-08-15 14:28:01 +0000748
749
750.. method:: MatchObject.expand(template)
751
752 Return the string obtained by doing backslash substitution on the template
753 string *template*, as done by the :meth:`sub` method. Escapes such as ``\n`` are
754 converted to the appropriate characters, and numeric backreferences (``\1``,
755 ``\2``) and named backreferences (``\g<1>``, ``\g<name>``) are replaced by the
756 contents of the corresponding group.
757
758
759.. method:: MatchObject.group([group1, ...])
760
761 Returns one or more subgroups of the match. If there is a single argument, the
762 result is a single string; if there are multiple arguments, the result is a
763 tuple with one item per argument. Without arguments, *group1* defaults to zero
764 (the whole match is returned). If a *groupN* argument is zero, the corresponding
765 return value is the entire matching string; if it is in the inclusive range
766 [1..99], it is the string matching the corresponding parenthesized group. If a
767 group number is negative or larger than the number of groups defined in the
768 pattern, an :exc:`IndexError` exception is raised. If a group is contained in a
769 part of the pattern that did not match, the corresponding result is ``None``.
770 If a group is contained in a part of the pattern that matched multiple times,
Georg Brandlb8df1562007-12-05 18:30:48 +0000771 the last match is returned. ::
772
773 >>> m = re.match(r"(\w+) (\w+)", "Isaac Newton, physicist")
774 >>> m.group(0)
775 'Isaac Newton' # The entire match
776 >>> m.group(1)
777 'Isaac' # The first parenthesized subgroup.
778 >>> m.group(2)
779 'Newton' # The second parenthesized subgroup.
780 >>> m.group(1, 2)
781 ('Isaac', 'Newton') # Multiple arguments give us a tuple.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000782
783 If the regular expression uses the ``(?P<name>...)`` syntax, the *groupN*
784 arguments may also be strings identifying groups by their group name. If a
785 string argument is not used as a group name in the pattern, an :exc:`IndexError`
786 exception is raised.
787
788 A moderately complicated example::
789
Georg Brandlb8df1562007-12-05 18:30:48 +0000790 >>> m = re.match(r"(?P<first_name>\w+) (?P<last_name>\w+)", "Malcom Reynolds")
791 >>> m.group('first_name')
792 'Malcom'
793 >>> m.group('last_name')
794 'Reynolds'
Georg Brandl8ec7f652007-08-15 14:28:01 +0000795
Georg Brandlb8df1562007-12-05 18:30:48 +0000796 Named groups can also be referred to by their index::
797
798 >>> m.group(1)
799 'Malcom'
800 >>> m.group(2)
801 'Reynolds'
802
803 If a group matches multiple times, only the last match is accessible::
804 >>> m = re.match(r"(..)+", "a1b2c3") # Matches 3 times.
805 >>> m.group(1) # Returns only the last match.
806 'c3'
Georg Brandl8ec7f652007-08-15 14:28:01 +0000807
808
809.. method:: MatchObject.groups([default])
810
811 Return a tuple containing all the subgroups of the match, from 1 up to however
812 many groups are in the pattern. The *default* argument is used for groups that
813 did not participate in the match; it defaults to ``None``. (Incompatibility
814 note: in the original Python 1.5 release, if the tuple was one element long, a
815 string would be returned instead. In later versions (from 1.5.1 on), a
816 singleton tuple is returned in such cases.)
817
Georg Brandlb8df1562007-12-05 18:30:48 +0000818 For example::
819
820 >>> m = re.match(r"(\d+)\.(\d+)", "24.1632")
821 >>> m.groups()
822 ('24', '1632')
823
824 If we make the decimal place and everything after it optional, not all groups
825 might participate in the match. These groups will default to ``None`` unless
826 the *default* argument is given::
827
828 >>> m = re.match(r"(\d+)\.?(\d+)?", "24")
829 >>> m.groups()
830 ('24', None) # Second group defaults to None.
831 >>> m.groups('0')
832 ('24', '0') # Now, the second group defaults to '0'.
833
Georg Brandl8ec7f652007-08-15 14:28:01 +0000834
835.. method:: MatchObject.groupdict([default])
836
837 Return a dictionary containing all the *named* subgroups of the match, keyed by
838 the subgroup name. The *default* argument is used for groups that did not
Georg Brandlb8df1562007-12-05 18:30:48 +0000839 participate in the match; it defaults to ``None``. For example::
840
841 >>> m = re.match(r"(?P<first_name>\w+) (?P<last_name>\w+)", "Malcom Reynolds")
842 >>> m.groupdict()
843 {'first_name': 'Malcom', 'last_name': 'Reynolds'}
Georg Brandl8ec7f652007-08-15 14:28:01 +0000844
845
846.. method:: MatchObject.start([group])
847 MatchObject.end([group])
848
849 Return the indices of the start and end of the substring matched by *group*;
850 *group* defaults to zero (meaning the whole matched substring). Return ``-1`` if
851 *group* exists but did not contribute to the match. For a match object *m*, and
852 a group *g* that did contribute to the match, the substring matched by group *g*
853 (equivalent to ``m.group(g)``) is ::
854
855 m.string[m.start(g):m.end(g)]
856
857 Note that ``m.start(group)`` will equal ``m.end(group)`` if *group* matched a
858 null string. For example, after ``m = re.search('b(c?)', 'cba')``,
859 ``m.start(0)`` is 1, ``m.end(0)`` is 2, ``m.start(1)`` and ``m.end(1)`` are both
860 2, and ``m.start(2)`` raises an :exc:`IndexError` exception.
861
Georg Brandlb8df1562007-12-05 18:30:48 +0000862 An example that will remove *remove_this* from email addresses::
863
864 >>> email = "tony@tiremove_thisger.net"
865 >>> m = re.search("remove_this", email)
866 >>> email[:m.start()] + email[m.end():]
867 'tony@tiger.net'
868
Georg Brandl8ec7f652007-08-15 14:28:01 +0000869
870.. method:: MatchObject.span([group])
871
872 For :class:`MatchObject` *m*, return the 2-tuple ``(m.start(group),
873 m.end(group))``. Note that if *group* did not contribute to the match, this is
Georg Brandlb8df1562007-12-05 18:30:48 +0000874 ``(-1, -1)``. *group* defaults to zero, the entire match.
Georg Brandl8ec7f652007-08-15 14:28:01 +0000875
876
877.. attribute:: MatchObject.pos
878
879 The value of *pos* which was passed to the :func:`search` or :func:`match`
880 method of the :class:`RegexObject`. This is the index into the string at which
881 the RE engine started looking for a match.
882
883
884.. attribute:: MatchObject.endpos
885
886 The value of *endpos* which was passed to the :func:`search` or :func:`match`
887 method of the :class:`RegexObject`. This is the index into the string beyond
888 which the RE engine will not go.
889
890
891.. attribute:: MatchObject.lastindex
892
893 The integer index of the last matched capturing group, or ``None`` if no group
894 was matched at all. For example, the expressions ``(a)b``, ``((a)(b))``, and
895 ``((ab))`` will have ``lastindex == 1`` if applied to the string ``'ab'``, while
896 the expression ``(a)(b)`` will have ``lastindex == 2``, if applied to the same
897 string.
898
899
900.. attribute:: MatchObject.lastgroup
901
902 The name of the last matched capturing group, or ``None`` if the group didn't
903 have a name, or if no group was matched at all.
904
905
906.. attribute:: MatchObject.re
907
908 The regular expression object whose :meth:`match` or :meth:`search` method
909 produced this :class:`MatchObject` instance.
910
911
912.. attribute:: MatchObject.string
913
914 The string passed to :func:`match` or :func:`search`.
915
916
917Examples
918--------
919
Georg Brandlb8df1562007-12-05 18:30:48 +0000920
921Checking For a Pair
922^^^^^^^^^^^^^^^^^^^
923
924In this example, we'll use the following helper function to display match
925objects a little more gracefully::
926
927 def displaymatch(match):
928 if match is None:
929 return None
930 return '<Match: %r, groups=%r>' % (match.group(), match.groups())
931
932Suppose you are writing a poker program where a player's hand is represented as
933a 5-character string with each character representing a card, "a" for ace, "k"
934for king, "q" for queen, j for jack, "0" for 10, and "1" through "9"
935representing the card with that value.
936
937To see if a given string is a valid hand, one could do the following::
938
939 >>> valid = re.compile(r"[0-9akqj]{5}$"
940 >>> displaymatch(valid.match("ak05q")) # Valid.
941 <Match: 'ak05q', groups=()>
942 >>> displaymatch(valid.match("ak05e")) # Invalid.
943 >>> displaymatch(valid.match("ak0")) # Invalid.
944 >>> displaymatch(valid.match("727ak")) # Valid.
945 <Match: '727ak', groups=()>
946
947That last hand, ``"727ak"``, contained a pair, or two of the same valued cards.
948To match this with a regular expression, one could use backreferences as such::
949
950 >>> pair = re.compile(r".*(.).*\1")
951 >>> displaymatch(pair.match("717ak")) # Pair of 7s.
952 <Match: '717', groups=('7',)>
953 >>> displaymatch(pair.match("718ak")) # No pairs.
954 >>> displaymatch(pair.match("354aa")) # Pair of aces.
955 <Match: '345aa', groups=('a',)>
956
957To find out what card the pair consists of, one could use the :func:`group`
958method of :class:`MatchObject` in the following manner::
959
960 >>> pair.match("717ak").group(1)
961 '7'
962
963 # Error because re.match() returns None, which doesn't have a group() method:
964 >>> pair.match("718ak").group(1)
965 Traceback (most recent call last):
966 File "<pyshell#23>", line 1, in <module>
967 re.match(r".*(.).*\1", "718ak").group(1)
968 AttributeError: 'NoneType' object has no attribute 'group'
969
970 >>> pair.match("354aa").group(1)
971 'a'
972
973
974Simulating scanf()
975^^^^^^^^^^^^^^^^^^
Georg Brandl8ec7f652007-08-15 14:28:01 +0000976
977.. index:: single: scanf()
978
979Python does not currently have an equivalent to :cfunc:`scanf`. Regular
980expressions are generally more powerful, though also more verbose, than
981:cfunc:`scanf` format strings. The table below offers some more-or-less
982equivalent mappings between :cfunc:`scanf` format tokens and regular
983expressions.
984
985+--------------------------------+---------------------------------------------+
986| :cfunc:`scanf` Token | Regular Expression |
987+================================+=============================================+
988| ``%c`` | ``.`` |
989+--------------------------------+---------------------------------------------+
990| ``%5c`` | ``.{5}`` |
991+--------------------------------+---------------------------------------------+
992| ``%d`` | ``[-+]?\d+`` |
993+--------------------------------+---------------------------------------------+
994| ``%e``, ``%E``, ``%f``, ``%g`` | ``[-+]?(\d+(\.\d*)?|\.\d+)([eE][-+]?\d+)?`` |
995+--------------------------------+---------------------------------------------+
996| ``%i`` | ``[-+]?(0[xX][\dA-Fa-f]+|0[0-7]*|\d+)`` |
997+--------------------------------+---------------------------------------------+
998| ``%o`` | ``0[0-7]*`` |
999+--------------------------------+---------------------------------------------+
1000| ``%s`` | ``\S+`` |
1001+--------------------------------+---------------------------------------------+
1002| ``%u`` | ``\d+`` |
1003+--------------------------------+---------------------------------------------+
1004| ``%x``, ``%X`` | ``0[xX][\dA-Fa-f]+`` |
1005+--------------------------------+---------------------------------------------+
1006
1007To extract the filename and numbers from a string like ::
1008
1009 /usr/sbin/sendmail - 0 errors, 4 warnings
1010
1011you would use a :cfunc:`scanf` format like ::
1012
1013 %s - %d errors, %d warnings
1014
1015The equivalent regular expression would be ::
1016
1017 (\S+) - (\d+) errors, (\d+) warnings
1018
Georg Brandlb8df1562007-12-05 18:30:48 +00001019
1020Avoiding recursion
1021^^^^^^^^^^^^^^^^^^
Georg Brandl8ec7f652007-08-15 14:28:01 +00001022
1023If you create regular expressions that require the engine to perform a lot of
1024recursion, you may encounter a :exc:`RuntimeError` exception with the message
1025``maximum recursion limit`` exceeded. For example, ::
1026
1027 >>> import re
1028 >>> s = 'Begin ' + 1000*'a very long string ' + 'end'
1029 >>> re.match('Begin (\w| )*? end', s).end()
1030 Traceback (most recent call last):
1031 File "<stdin>", line 1, in ?
1032 File "/usr/local/lib/python2.5/re.py", line 132, in match
1033 return _compile(pattern, flags).match(string)
1034 RuntimeError: maximum recursion limit exceeded
1035
1036You can often restructure your regular expression to avoid recursion.
1037
1038Starting with Python 2.3, simple uses of the ``*?`` pattern are special-cased to
1039avoid recursion. Thus, the above regular expression can avoid recursion by
1040being recast as ``Begin [a-zA-Z0-9_ ]*?end``. As a further benefit, such
1041regular expressions will run faster than their recursive equivalents.
1042
Georg Brandlb8df1562007-12-05 18:30:48 +00001043
1044search() vs. match()
1045^^^^^^^^^^^^^^^^^^^^
1046
1047In a nutshell, :func:`match` only attempts to match a pattern at the beginning
1048of a string where :func:`search` will match a pattern anywhere in a string.
1049For example::
1050
1051 >>> re.match("o", "dog") # No match as "o" is not the first letter of "dog".
1052 >>> re.search("o", "dog") # Match as search() looks everywhere in the string.
1053 <_sre.SRE_Match object at 0x827e9f8>
1054
1055.. note::
1056
1057 The following applies only to regular expression objects like those created
1058 with ``re.compile("pattern")``, not the primitives
1059 ``re.match(pattern, string)`` or ``re.search(pattern, string)``.
1060
1061:func:`match` has an optional second parameter that gives an index in the string
1062where the search is to start::
1063
1064 >>> pattern = re.compile("o")
1065 >>> pattern.match("dog") # No match as "o" is not at the start of "dog."
1066 # Equivalent to the above expression as 0 is the default starting index:
1067 >>> pattern.match("dog", 0)
1068 # Match as "o" is the 2nd character of "dog" (index 0 is the first):
1069 >>> pattern.match("dog", 1)
1070 <_sre.SRE_Match object at 0x827eb10>
1071 >>> pattern.match("dog", 2) # No match as "o" is not the 3rd character of "dog."
1072
1073
1074Making a Phonebook
1075^^^^^^^^^^^^^^^^^^
1076
1077:func:`split` splits a string into a list delimited by the passed pattern. The
1078method is invaluable for converting textual data into data structures that can be
1079easily read and modified by Python as demonstrated in the following example that
1080creates a phonebook.
1081
Georg Brandld6b20dc2007-12-06 09:45:39 +00001082First, here is the input. Normally it may come from a file, here we are using
1083triple-quoted string syntax::
Georg Brandlb8df1562007-12-05 18:30:48 +00001084
Georg Brandld6b20dc2007-12-06 09:45:39 +00001085 >>> input = """Ross McFluff: 834.345.1254 155 Elm Street
Georg Brandlb8df1562007-12-05 18:30:48 +00001086
Georg Brandld6b20dc2007-12-06 09:45:39 +00001087 Ronald Heathmore: 892.345.3428 436 Finley Avenue
1088 Frank Burger: 925.541.7625 662 South Dogwood Way
Georg Brandlb8df1562007-12-05 18:30:48 +00001089
Georg Brandld6b20dc2007-12-06 09:45:39 +00001090
1091 Heather Albrecht: 548.326.4584 919 Park Place"""
1092
1093The entries are separated by one or more newlines. Now we convert the string
1094into a list with each nonempty line having its own entry::
1095
1096 >>> entries = re.split("\n+", input)
Georg Brandlb8df1562007-12-05 18:30:48 +00001097 >>> entries
1098 ['Ross McFluff 834.345.1254 155 Elm Street',
1099 'Ronald Heathmore 892.345.3428 436 Finley Avenue',
1100 'Frank Burger 925.541.7625 662 South Dogwood Way',
1101 'Heather Albrecht 548.326.4584 919 Park Place']
1102
1103Finally, split each entry into a list with first name, last name, telephone
1104number, and address. We use the ``maxsplit`` paramater of :func:`split`
1105because the address has spaces, our splitting pattern, in it::
1106
Georg Brandld6b20dc2007-12-06 09:45:39 +00001107 >>> [re.split(":? ", entry, 3) for entry in entries]
Georg Brandlb8df1562007-12-05 18:30:48 +00001108 [['Ross', 'McFluff', '834.345.1254', '155 Elm Street'],
1109 ['Ronald', 'Heathmore', '892.345.3428', '436 Finley Avenue'],
1110 ['Frank', 'Burger', '925.541.7625', '662 South Dogwood Way'],
1111 ['Heather', 'Albrecht', '548.326.4584', '919 Park Place']]
1112
Georg Brandld6b20dc2007-12-06 09:45:39 +00001113The ``:?`` pattern matches the colon after the last name, so that it does not
1114occur in the result list. With a ``maxsplit`` of ``4``, we could seperate the
1115house number from the street name::
Georg Brandlb8df1562007-12-05 18:30:48 +00001116
Georg Brandld6b20dc2007-12-06 09:45:39 +00001117 >>> [re.split(":? ", entry, 4) for entry in entries]
Georg Brandlb8df1562007-12-05 18:30:48 +00001118 [['Ross', 'McFluff', '834.345.1254', '155', 'Elm Street'],
1119 ['Ronald', 'Heathmore', '892.345.3428', '436', 'Finley Avenue'],
1120 ['Frank', 'Burger', '925.541.7625', '662', 'South Dogwood Way'],
1121 ['Heather', 'Albrecht', '548.326.4584', '919', 'Park Place']]
1122
1123
1124Text Munging
1125^^^^^^^^^^^^
1126
1127:func:`sub` replaces every occurrence of a pattern with a string or the
1128result of a function. This example demonstrates using :func:`sub` with
1129a function to "munge" text, or randomize the order of all the characters
1130in each word of a sentence except for the first and last characters::
1131
1132 >>> def repl(m):
1133 ... inner_word = list(m.group(2))
1134 ... random.shuffle(inner_word)
1135 ... return m.group(1) + "".join(inner_word) + m.group(3)
1136 >>> text = "Professor Abdolmalek, please report your absences promptly."
1137 >>> re.sub("(\w)(\w+)(\w)", repl, text)
1138 'Poefsrosr Aealmlobdk, pslaee reorpt your abnseces plmrptoy.'
1139 >>> re.sub("(\w)(\w+)(\w)", repl, text)
1140 'Pofsroser Aodlambelk, plasee reoprt yuor asnebces potlmrpy.'
1141
1142
1143Finding all Adverbs
1144^^^^^^^^^^^^^^^^^^^
1145
1146:func:`findall` matches *all* occurences of a pattern, not just the first
1147one as :func:`search` does. For example, if one was a writer and wanted to
1148find all of the adverbs in some text, he or she might use :func:`findall` in
1149the following manner::
1150
1151 >>> text = "He was carefully disguised but captured quickly by police."
1152 >>> re.findall(r"\w+ly", text)
1153 ['carefully', 'quickly']
1154
1155
1156Finding all Adverbs and their Positions
1157^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
1158
1159If one wants more information about all matches of a pattern than the matched
1160text, :func:`finditer` is useful as it provides instances of
1161:class:`MatchObject` instead of strings. Continuing with the previous example,
1162if one was a writer who wanted to find all of the adverbs *and their positions*
1163in some text, he or she would use :func:`finditer` in the following manner::
1164
1165 >>> text = "He was carefully disguised but captured quickly by police."
1166 >>> for m in re.finditer(r"\w+ly", text):
1167 print '%02d-%02d: %s' % (m.start(), m.end(), m.group(0))
1168 07-16: carefully
1169 40-47: quickly
1170
1171
1172Raw String Notation
1173^^^^^^^^^^^^^^^^^^^
1174
1175Raw string notation (``r"text"``) keeps regular expressions sane. Without it,
1176every backslash (``'\'``) in a regular expression would have to be prefixed with
1177another one to escape it. For example, the two following lines of code are
1178functionally identical::
1179
1180 >>> re.match(r"\W(.)\1\W", " ff ")
1181 <_sre.SRE_Match object at 0x8262760>
1182 >>> re.match("\\W(.)\\1\\W", " ff ")
1183 <_sre.SRE_Match object at 0x82627a0>
1184
1185When one wants to match a literal backslash, it must be escaped in the regular
1186expression. With raw string notation, this means ``r"\\"``. Without raw string
1187notation, one must use ``"\\\\"``, making the following lines of code
1188functionally identical::
1189
1190 >>> re.match(r"\\", r"\\")
1191 <_sre.SRE_Match object at 0x827eb48>
1192 >>> re.match("\\\\", r"\\")
1193 <_sre.SRE_Match object at 0x827ec60>