Skip to main content

Alternative regular expression module, to replace re.

Project description

Introduction

This new regex implementation is intended eventually to replace Python’s current re module implementation.

For testing and comparison with the current ‘re’ module the new implementation is in the form of a module called ‘regex’.

Old vs new behaviour

This module has 2 behaviours:

  • Version 0 behaviour (old behaviour, compatible with the current re module):

    • Indicated by the VERSION0 or V0 flag, or (?V0) in the pattern.

    • Zero-width matches are handled like in the re module:

      • .split won’t split a string at a zero-width match.

      • .sub will advance by one character after a zero-width match.

    • Inline flags apply to the entire pattern, and they can’t be turned off.

    • Only simple sets are supported.

    • Case-insensitive matches in Unicode use simple case-folding by default.

  • Version 1 behaviour (new behaviour, different from the current re module):

    • Indicated by the VERSION1 or V1 flag, or (?V1) in the pattern.

    • Zero-width matches are handled like in Perl and PCRE:

      • .split will split a string at a zero-width match.

      • .sub will handle zero-width matches correctly.

    • Inline flags apply to the end of the group or pattern, and they can be turned off.

    • Nested sets and set operations are supported.

    • Case-insensitive matches in Unicode use full case-folding by default.

If no version is specified, the regex module will default to regex.DEFAULT_VERSION. In the short term this will be VERSION0, but in the longer term it will be VERSION1.

Case-insensitive matches in Unicode

The regex module supports both simple and full case-folding for case-insensitive matches in Unicode. Use of full case-folding can be turned on using the FULLCASE or F flag, or (?f) in the pattern. Please note that this flag affects how the IGNORECASE flag works; the FULLCASE flag itself does not turn on case-insensitive matching.

In the version 0 behaviour, the flag is off by default.

In the version 1 behaviour, the flag is on by default.

Nested sets and set operations

It’s not possible to support both simple sets, as used in the re module, and nested sets at the same time because of a difference in the meaning of an unescaped "[" in a set.

For example, the pattern [[a-z]--[aeiou]] is treated in the version 0 behaviour (simple sets, compatible with the re module) as:

  • Set containing “[” and the letters “a” to “z”

  • Literal “–”

  • Set containing letters “a”, “e”, “i”, “o”, “u”

but in the version 1 behaviour (nested sets, enhanced behaviour) as:

  • Set which is:

    • Set containing the letters “a” to “z”

  • but excluding:

    • Set containing the letters “a”, “e”, “i”, “o”, “u”

Version 0 behaviour: only simple sets are supported.

Version 1 behaviour: nested sets and set operations are supported.

Flags

There are 2 kinds of flag: scoped and global. Scoped flags can apply to only part of a pattern and can be turned on or off; global flags apply to the entire pattern and can only be turned on.

The scoped flags are: FULLCASE, IGNORECASE, MULTILINE, DOTALL, VERBOSE, WORD.

The global flags are: ASCII, BESTMATCH, ENHANCEMATCH, LOCALE, POSIX, REVERSE, UNICODE, VERSION0, VERSION1.

If neither the ASCII, LOCALE nor UNICODE flag is specified, it will default to UNICODE if the regex pattern is a Unicode string and ASCII if it’s a bytestring.

The ENHANCEMATCH flag makes fuzzy matching attempt to improve the fit of the next match that it finds.

The BESTMATCH flag makes fuzzy matching search for the best match instead of the next match.

Notes on named capture groups

All capture groups have a group number, starting from 1.

Groups with the same group name will have the same group number, and groups with a different group name will have a different group number.

The same name can be used by more than one group, with later captures ‘overwriting’ earlier captures. All of the captures of the group will be available from the captures method of the match object.

Group numbers will be reused across different branches of a branch reset, eg. (?|(first)|(second)) has only group 1. If capture groups have different group names then they will, of course, have different group numbers, eg. (?|(?P<foo>first)|(?P<bar>second)) has group 1 (“foo”) and group 2 (“bar”).

In the regex (\s+)(?|(?P<foo>[A-Z]+)|(\w+) (?P<foo>[0-9]+) there are 2 groups:

  • (\s+) is group 1.

  • (?P<foo>[A-Z]+) is group 2, also called “foo”.

  • (\w+) is group 2 because of the branch reset.

  • (?P<foo>[0-9]+) is group 2 because it’s called “foo”.

If you want to prevent (\w+) from being group 2, you need to name it (different name, different group number).

Multithreading

The regex module releases the GIL during matching on instances of the built-in (immutable) string classes, enabling other Python threads to run concurrently. It is also possible to force the regex module to release the GIL during matching by calling the matching methods with the keyword argument concurrent=True. The behaviour is undefined if the string changes during matching, so use it only when it is guaranteed that that won’t happen.

Building for 64-bits

If the source files are built for a 64-bit target then the string positions will also be 64-bit.

Unicode

This module supports Unicode 8.0.

Full Unicode case-folding is supported.

Additional features

The issue numbers relate to the Python bug tracker, except where listed as “Hg issue”.

  • Added support for lookaround in conditional pattern (Hg issue 163)

    The test of a conditional pattern can now be a lookaround.

    Examples:

    >>> regex.match(r'(?(?=\d)\d+|\w+)', '123abc')
    <regex.Match object; span=(0, 3), match='123'>
    >>> regex.match(r'(?(?=\d)\d+|\w+)', 'abc123')
    <regex.Match object; span=(0, 6), match='abc123'>

    This is not quite the same as putting a lookaround in the first branch of a pair of alternatives.

    Examples:

    >>> print(regex.match(r'(?:(?=\d)\d+\b|\w+)', '123abc'))
    <regex.Match object; span=(0, 6), match='123abc'>
    >>> print(regex.match(r'(?(?=\d)\d+\b|\w+)', '123abc'))
    None

    In the first example, the lookaround matched, but the remainder of the first branch failed to match, and so the second branch was attempted, whereas in the second example, the lookaround matched, and the first branch failed to match, but the second branch was not attempted.

  • Added POSIX matching (leftmost longest) (Hg issue 150)

    The POSIX standard for regex is to return the leftmost longest match. This can be turned on using the POSIX flag ((?p)).

    Examples:

    >>> # Normal matching.
    >>> regex.search(r'Mr|Mrs', 'Mrs')
    <regex.Match object; span=(0, 2), match='Mr'>
    >>> regex.search(r'one(self)?(selfsufficient)?', 'oneselfsufficient')
    <regex.Match object; span=(0, 7), match='oneself'>
    >>> # POSIX matching.
    >>> regex.search(r'(?p)Mr|Mrs', 'Mrs')
    <regex.Match object; span=(0, 3), match='Mrs'>
    >>> regex.search(r'(?p)one(self)?(selfsufficient)?', 'oneselfsufficient')
    <regex.Match object; span=(0, 17), match='oneselfsufficient'>

    Note that it will take longer to find matches because when it finds a match at a certain position, it won’t return that immediately, but will keep looking to see if there’s another longer match there.

  • Added (?(DEFINE)...) (Hg issue 152)

    If there’s no group called “DEFINE”, then … will be ignored, but any group definitions within it will be available.

    Examples:

    >>> regex.search(r'(?(DEFINE)(?P<quant>\d+)(?P<item>\w+))(?&quant) (?&item)', '5 elephants')
    <regex.Match object; span=(0, 11), match='5 elephants'>
  • Added (*PRUNE), (*SKIP) and (*FAIL) (Hg issue 153)

    (*PRUNE) discards the backtracking info up to that point. When used in an atomic group or a lookaround, it won’t affect the enclosing pattern.

    (*SKIP) is similar to (*PRUNE), except that it also sets where in the text the next attempt to match will start. When used in an atomic group or a lookaround, it won’t affect the enclosing pattern.

    (*FAIL) causes immediate backtracking. (*F) is a permitted abbreviation.

  • Added \K (Hg issue 151)

    Keeps the part of the entire match after the position where \K occurred; the part before it is discarded.

    It does not affect what capture groups return.

    Examples:

    >>> m = regex.search(r'(\w\w\K\w\w\w)', 'abcdef')
    >>> m[0]
    'cde'
    >>> m[1]
    'abcde'
    >>>
    >>> m = regex.search(r'(?r)(\w\w\K\w\w\w)', 'abcdef')
    >>> m[0]
    'bc'
    >>> m[1]
    'bcdef'
  • Added capture subscripting for expandf and subf/subfn (Hg issue 133) (Python 2.6 and above)

    You can now use subscripting to get the captures of a repeated capture group.

    Examples:

    >>> m = regex.match(r"(\w)+", "abc")
    >>> m.expandf("{1}")
    'c'
    >>> m.expandf("{1[0]} {1[1]} {1[2]}")
    'a b c'
    >>> m.expandf("{1[-1]} {1[-2]} {1[-3]}")
    'c b a'
    >>>
    >>> m = regex.match(r"(?P<letter>\w)+", "abc")
    >>> m.expandf("{letter}")
    'c'
    >>> m.expandf("{letter[0]} {letter[1]} {letter[2]}")
    'a b c'
    >>> m.expandf("{letter[-1]} {letter[-2]} {letter[-3]}")
    'c b a'
  • Added support for referring to a group by number using (?P=...).

    This is in addition to the existing \g<...>.

  • Fixed the handling of locale-sensitive regexes.

    The LOCALE flag is intended for legacy code and has limited support. You’re still recommended to use Unicode instead.

  • Added partial matches (Hg issue 102)

    A partial match is one that matches up to the end of string, but that string has been truncated and you want to know whether a complete match could be possible if the string had not been truncated.

    Partial matches are supported by match, search, fullmatch and finditer with the partial keyword argument.

    Match objects have a partial attribute, which is True if it’s a partial match.

    For example, if you wanted a user to enter a 4-digit number and check it character by character as it was being entered:

    >>> pattern = regex.compile(r'\d{4}')
    
    >>> # Initially, nothing has been entered:
    >>> print(pattern.fullmatch('', partial=True))
    <regex.Match object; span=(0, 0), match='', partial=True>
    
    >>> # An empty string is OK, but it's only a partial match.
    >>> # The user enters a letter:
    >>> print(pattern.fullmatch('a', partial=True))
    None
    >>> # It'll never match.
    
    >>> # The user deletes that and enters a digit:
    >>> print(pattern.fullmatch('1', partial=True))
    <regex.Match object; span=(0, 1), match='1', partial=True>
    >>> # It matches this far, but it's only a partial match.
    
    >>> # The user enters 2 more digits:
    >>> print(pattern.fullmatch('123', partial=True))
    <regex.Match object; span=(0, 3), match='123', partial=True>
    >>> # It matches this far, but it's only a partial match.
    
    >>> # The user enters another digit:
    >>> print(pattern.fullmatch('1234', partial=True))
    <regex.Match object; span=(0, 4), match='1234'>
    >>> # It's a complete match.
    
    >>> # If the user enters another digit:
    >>> print(pattern.fullmatch('12345', partial=True))
    None
    >>> # It's no longer a match.
    
    >>> # This is a partial match:
    >>> pattern.match('123', partial=True).partial
    True
    
    >>> # This is a complete match:
    >>> pattern.match('1233', partial=True).partial
    False
  • * operator not working correctly with sub() (Hg issue 106)

    Sometimes it’s not clear how zero-width matches should be handled. For example, should .* match 0 characters directly after matching >0 characters?

    Most regex implementations follow the lead of Perl (PCRE), but the re module sometimes doesn’t. The Perl behaviour appears to be the most common (and the re module is sometimes definitely wrong), so in version 1 the regex module follows the Perl behaviour, whereas in version 0 it follows the legacy re behaviour.

    Examples:

    >>> # Version 0 behaviour (like re)
    >>> regex.sub('(?V0).*', 'x', 'test')
    'x'
    >>> regex.sub('(?V0).*?', '|', 'test')
    '|t|e|s|t|'
    
    >>> # Version 1 behaviour (like Perl)
    >>> regex.sub('(?V1).*', 'x', 'test')
    'xx'
    >>> regex.sub('(?V1).*?', '|', 'test')
    '|||||||||'
  • re.group() should never return a bytearray (issue #18468)

    For compatibility with the re module, the regex module returns all matching bytestrings as bytes, starting from Python 3.4.

    Examples:

    >>> # Python 3.4 and later
    >>> regex.match(b'.', bytearray(b'a')).group()
    b'a'
    
    >>> # Python 3.1-3.3
    >>> regex.match(b'.', bytearray(b'a')).group()
    bytearray(b'a')
  • Added capturesdict (Hg issue 86)

    capturesdict is a combination of groupdict and captures:

    groupdict returns a dict of the named groups and the last capture of those groups.

    captures returns a list of all the captures of a group

    capturesdict returns a dict of the named groups and lists of all the captures of those groups.

    Examples:

    >>> m = regex.match(r"(?:(?P<word>\w+) (?P<digits>\d+)\n)+", "one 1\ntwo 2\nthree 3\n")
    >>> m.groupdict()
    {'word': 'three', 'digits': '3'}
    >>> m.captures("word")
    ['one', 'two', 'three']
    >>> m.captures("digits")
    ['1', '2', '3']
    >>> m.capturesdict()
    {'word': ['one', 'two', 'three'], 'digits': ['1', '2', '3']}
  • Allow duplicate names of groups (Hg issue 87)

    Group names can now be duplicated.

    Examples:

    >>> # With optional groups:
    >>>
    >>> # Both groups capture, the second capture 'overwriting' the first.
    >>> m = regex.match(r"(?P<item>\w+)? or (?P<item>\w+)?", "first or second")
    >>> m.group("item")
    'second'
    >>> m.captures("item")
    ['first', 'second']
    >>> # Only the second group captures.
    >>> m = regex.match(r"(?P<item>\w+)? or (?P<item>\w+)?", " or second")
    >>> m.group("item")
    'second'
    >>> m.captures("item")
    ['second']
    >>> # Only the first group captures.
    >>> m = regex.match(r"(?P<item>\w+)? or (?P<item>\w+)?", "first or ")
    >>> m.group("item")
    'first'
    >>> m.captures("item")
    ['first']
    >>>
    >>> # With mandatory groups:
    >>>
    >>> # Both groups capture, the second capture 'overwriting' the first.
    >>> m = regex.match(r"(?P<item>\w*) or (?P<item>\w*)?", "first or second")
    >>> m.group("item")
    'second'
    >>> m.captures("item")
    ['first', 'second']
    >>> # Again, both groups capture, the second capture 'overwriting' the first.
    >>> m = regex.match(r"(?P<item>\w*) or (?P<item>\w*)", " or second")
    >>> m.group("item")
    'second'
    >>> m.captures("item")
    ['', 'second']
    >>> # And yet again, both groups capture, the second capture 'overwriting' the first.
    >>> m = regex.match(r"(?P<item>\w*) or (?P<item>\w*)", "first or ")
    >>> m.group("item")
    ''
    >>> m.captures("item")
    ['first', '']
  • Added fullmatch (issue #16203)

    fullmatch behaves like match, except that it must match all of the string.

    Examples:

    >>> print(regex.fullmatch(r"abc", "abc").span())
    (0, 3)
    >>> print(regex.fullmatch(r"abc", "abcx"))
    None
    >>> print(regex.fullmatch(r"abc", "abcx", endpos=3).span())
    (0, 3)
    >>> print(regex.fullmatch(r"abc", "xabcy", pos=1, endpos=4).span())
    (1, 4)
    >>>
    >>> regex.match(r"a.*?", "abcd").group(0)
    'a'
    >>> regex.fullmatch(r"a.*?", "abcd").group(0)
    'abcd'
  • Added subf and subfn (Python 2.6 and above)

    subf and subfn are alternatives to sub and subn respectively. When passed a replacement string, they treat it as a format string.

    Examples:

    >>> regex.subf(r"(\w+) (\w+)", "{0} => {2} {1}", "foo bar")
    'foo bar => bar foo'
    >>> regex.subf(r"(?P<word1>\w+) (?P<word2>\w+)", "{word2} {word1}", "foo bar")
    'bar foo'
  • Added expandf to match object (Python 2.6 and above)

    expandf is an alternative to expand. When passed a replacement string, it treats it as a format string.

    Examples:

    >>> m = regex.match(r"(\w+) (\w+)", "foo bar")
    >>> m.expandf("{0} => {2} {1}")
    'foo bar => bar foo'
    >>>
    >>> m = regex.match(r"(?P<word1>\w+) (?P<word2>\w+)", "foo bar")
    >>> m.expandf("{word2} {word1}")
    'bar foo'
  • Detach searched string

    A match object contains a reference to the string that was searched, via its string attribute. The match object now has a detach_string method that will ‘detach’ that string, making it available for garbage collection (this might save valuable memory if that string is very large).

    Example:

    >>> m = regex.search(r"\w+", "Hello world")
    >>> print(m.group())
    Hello
    >>> print(m.string)
    Hello world
    >>> m.detach_string()
    >>> print(m.group())
    Hello
    >>> print(m.string)
    None
  • Characters in a group name (issue #14462)

    A group name can now contain the same characters as an identifier. These are different in Python 2 and Python 3.

  • Recursive patterns (Hg issue 27)

    Recursive and repeated patterns are supported.

    (?R) or (?0) tries to match the entire regex recursively. (?1), (?2), etc, try to match the relevant capture group.

    (?&name) tries to match the named capture group.

    Examples:

    >>> regex.match(r"(Tarzan|Jane) loves (?1)", "Tarzan loves Jane").groups()
    ('Tarzan',)
    >>> regex.match(r"(Tarzan|Jane) loves (?1)", "Jane loves Tarzan").groups()
    ('Jane',)
    
    >>> m = regex.search(r"(\w)(?:(?R)|(\w?))\1", "kayak")
    >>> m.group(0, 1, 2)
    ('kayak', 'k', None)

    The first two examples show how the subpattern within the capture group is reused, but is _not_ itself a capture group. In other words, "(Tarzan|Jane) loves (?1)" is equivalent to "(Tarzan|Jane) loves (?:Tarzan|Jane)".

    It’s possible to backtrack into a recursed or repeated group.

    You can’t call a group if there is more than one group with that group name or group number ("ambiguous group reference"). For example, (?P<foo>\w+) (?P<foo>\w+) (?&foo)? has 2 groups called “foo” (both group 1) and (?|([A-Z]+)|([0-9]+)) (?1)? has 2 groups with group number 1.

    The alternative forms (?P>name) and (?P&name) are also supported.

  • repr(regex) doesn’t include actual regex (issue #13592)

    The repr of a compiled regex is now in the form of a eval-able string. For example:

    >>> r = regex.compile("foo", regex.I)
    >>> repr(r)
    "regex.Regex('foo', flags=regex.I | regex.V0)"
    >>> r
    regex.Regex('foo', flags=regex.I | regex.V0)

    The regex module has Regex as an alias for the ‘compile’ function.

  • Improve the repr for regular expression match objects (issue #17087)

    The repr of a match object is now a more useful form. For example:

    >>> regex.search(r"\d+", "abc012def")
    <regex.Match object; span=(3, 6), match='012'>
  • Python lib re cannot handle Unicode properly due to narrow/wide bug (issue #12729)

    The source code of the regex module has been updated to support PEP 393 (“Flexible String Representation”), which is new in Python 3.3.

  • Full Unicode case-folding is supported.

    In version 1 behaviour, the regex module uses full case-folding when performing case-insensitive matches in Unicode.

    Examples (in Python 3):

    >>> regex.match(r"(?iV1)strasse", "stra\N{LATIN SMALL LETTER SHARP S}e").span()
    (0, 6)
    >>> regex.match(r"(?iV1)stra\N{LATIN SMALL LETTER SHARP S}e", "STRASSE").span()
    (0, 7)

    In version 0 behaviour, it uses simple case-folding for backward compatibility with the re module.

  • Approximate “fuzzy” matching (Hg issue 12, Hg issue 41, Hg issue 109)

    Regex usually attempts an exact match, but sometimes an approximate, or “fuzzy”, match is needed, for those cases where the text being searched may contain errors in the form of inserted, deleted or substituted characters.

    A fuzzy regex specifies which types of errors are permitted, and, optionally, either the minimum and maximum or only the maximum permitted number of each type. (You cannot specify only a minimum.)

    The 3 types of error are:

    • Insertion, indicated by “i”

    • Deletion, indicated by “d”

    • Substitution, indicated by “s”

    In addition, “e” indicates any type of error.

    The fuzziness of a regex item is specified between “{” and “}” after the item.

    Examples:

    • foo match “foo” exactly

    • (?:foo){i} match “foo”, permitting insertions

    • (?:foo){d} match “foo”, permitting deletions

    • (?:foo){s} match “foo”, permitting substitutions

    • (?:foo){i,s} match “foo”, permitting insertions and substitutions

    • (?:foo){e} match “foo”, permitting errors

    If a certain type of error is specified, then any type not specified will not be permitted.

    In the following examples I’ll omit the item and write only the fuzziness:

    • {i<=3} permit at most 3 insertions, but no other types

    • {d<=3} permit at most 3 deletions, but no other types

    • {s<=3} permit at most 3 substitutions, but no other types

    • {i<=1,s<=2} permit at most 1 insertion and at most 2 substitutions, but no deletions

    • {e<=3} permit at most 3 errors

    • {1<=e<=3} permit at least 1 and at most 3 errors

    • {i<=2,d<=2,e<=3} permit at most 2 insertions, at most 2 deletions, at most 3 errors in total, but no substitutions

    It’s also possible to state the costs of each type of error and the maximum permitted total cost.

    Examples:

    • {2i+2d+1s<=4} each insertion costs 2, each deletion costs 2, each substitution costs 1, the total cost must not exceed 4

    • {i<=1,d<=1,s<=1,2i+2d+1s<=4} at most 1 insertion, at most 1 deletion, at most 1 substitution; each insertion costs 2, each deletion costs 2, each substitution costs 1, the total cost must not exceed 4

    You can also use “<” instead of “<=” if you want an exclusive minimum or maximum:

    • {e<=3} permit up to 3 errors

    • {e<4} permit fewer than 4 errors

    • {0<e<4} permit more than 0 but fewer than 4 errors

    By default, fuzzy matching searches for the first match that meets the given constraints. The ENHANCEMATCH flag will cause it to attempt to improve the fit (i.e. reduce the number of errors) of the match that it has found.

    The BESTMATCH flag will make it search for the best match instead.

    Further examples to note:

    • regex.search("(dog){e}", "cat and dog")[1] returns "cat" because that matches "dog" with 3 errors, which is within the limit (an unlimited number of errors is permitted).

    • regex.search("(dog){e<=1}", "cat and dog")[1] returns " dog" (with a leading space) because that matches "dog" with 1 error, which is within the limit (1 error is permitted).

    • regex.search("(?e)(dog){e<=1}", "cat and dog")[1] returns "dog" (without a leading space) because the fuzzy search matches " dog" with 1 error, which is within the limit (1 error is permitted), and the (?e) then makes it attempt a better fit.

    In the first two examples there are perfect matches later in the string, but in neither case is it the first possible match.

    The match object has an attribute fuzzy_counts which gives the total number of substitutions, insertions and deletions.

    >>> # A 'raw' fuzzy match:
    >>> regex.fullmatch(r"(?:cats|cat){e<=1}", "cat").fuzzy_counts
    (0, 0, 1)
    >>> # 0 substitutions, 0 insertions, 1 deletion.
    
    >>> # A better match might be possible if the ENHANCEMATCH flag used:
    >>> regex.fullmatch(r"(?e)(?:cats|cat){e<=1}", "cat").fuzzy_counts
    (0, 0, 0)
    >>> # 0 substitutions, 0 insertions, 0 deletions.
  • Named lists (Hg issue 11)

    \L<name>

    There are occasions where you may want to include a list (actually, a set) of options in a regex.

    One way is to build the pattern like this:

    >>> p = regex.compile(r"first|second|third|fourth|fifth")

    but if the list is large, parsing the resulting regex can take considerable time, and care must also be taken that the strings are properly escaped if they contain any character that has a special meaning in a regex, and that if there is a shorter string that occurs initially in a longer string that the longer string is listed before the shorter one, for example, “cats” before “cat”.

    The new alternative is to use a named list:

    >>> option_set = ["first", "second", "third", "fourth", "fifth"]
    >>> p = regex.compile(r"\L<options>", options=option_set)

    The order of the items is irrelevant, they are treated as a set. The named lists are available as the .named_lists attribute of the pattern object :

    >>> print(p.named_lists)
    {'options': frozenset({'second', 'fifth', 'fourth', 'third', 'first'})}
  • Start and end of word

    \m matches at the start of a word.

    \M matches at the end of a word.

    Compare with \b, which matches at the start or end of a word.

  • Unicode line separators

    Normally the only line separator is \n (\x0A), but if the WORD flag is turned on then the line separators are the pair \x0D\x0A, and \x0A, \x0B, \x0C and \x0D, plus \x85, \u2028 and \u2029 when working with Unicode.

    This affects the regex dot ".", which, with the DOTALL flag turned off, matches any character except a line separator. It also affects the line anchors ^ and $ (in multiline mode).

  • Set operators

    Version 1 behaviour only

    Set operators have been added, and a set [...] can include nested sets.

    The operators, in order of increasing precedence, are:

    • || for union (“x||y” means “x or y”)

    • ~~ (double tilde) for symmetric difference (“x~~y” means “x or y, but not both”)

    • && for intersection (“x&&y” means “x and y”)

    • -- (double dash) for difference (“x–y” means “x but not y”)

    Implicit union, ie, simple juxtaposition like in [ab], has the highest precedence. Thus, [ab&&cd] is the same as [[a||b]&&[c||d]].

    Examples:

    • [ab] # Set containing ‘a’ and ‘b’

    • [a-z] # Set containing ‘a’ .. ‘z’

    • [[a-z]--[qw]] # Set containing ‘a’ .. ‘z’, but not ‘q’ or ‘w’

    • [a-z--qw] # Same as above

    • [\p{L}--QW] # Set containing all letters except ‘Q’ and ‘W’

    • [\p{N}--[0-9]] # Set containing all numbers except ‘0’ .. ‘9’

    • [\p{ASCII}&&\p{Letter}] # Set containing all characters which are ASCII and letter

  • regex.escape (issue #2650)

    regex.escape has an additional keyword parameter special_only. When True, only ‘special’ regex characters, such as ‘?’, are escaped.

    Examples:

    >>> regex.escape("foo!?")
    'foo\\!\\?'
    >>> regex.escape("foo!?", special_only=True)
    'foo!\\?'
  • Repeated captures (issue #7132)

    A match object has additional methods which return information on all the successful matches of a repeated capture group. These methods are:

    • matchobject.captures([group1, ...])

      • Returns a list of the strings matched in a group or groups. Compare with matchobject.group([group1, ...]).

    • matchobject.starts([group])

      • Returns a list of the start positions. Compare with matchobject.start([group]).

    • matchobject.ends([group])

      • Returns a list of the end positions. Compare with matchobject.end([group]).

    • matchobject.spans([group])

      • Returns a list of the spans. Compare with matchobject.span([group]).

    Examples:

    >>> m = regex.search(r"(\w{3})+", "123456789")
    >>> m.group(1)
    '789'
    >>> m.captures(1)
    ['123', '456', '789']
    >>> m.start(1)
    6
    >>> m.starts(1)
    [0, 3, 6]
    >>> m.end(1)
    9
    >>> m.ends(1)
    [3, 6, 9]
    >>> m.span(1)
    (6, 9)
    >>> m.spans(1)
    [(0, 3), (3, 6), (6, 9)]
  • Atomic grouping (issue #433030)

    (?>...)

    If the following pattern subsequently fails, then the subpattern as a whole will fail.

  • Possessive quantifiers.

    (?:...)?+ ; (?:...)*+ ; (?:...)++ ; (?:...){min,max}+

    The subpattern is matched up to ‘max’ times. If the following pattern subsequently fails, then all of the repeated subpatterns will fail as a whole. For example, (?:...)++ is equivalent to (?>(?:...)+).

  • Scoped flags (issue #433028)

    (?flags-flags:...)

    The flags will apply only to the subpattern. Flags can be turned on or off.

  • Inline flags (issue #433024, issue #433027)

    (?flags-flags)

    Version 0 behaviour: the flags apply to the entire pattern, and they can’t be turned off.

    Version 1 behaviour: the flags apply to the end of the group or pattern, and they can be turned on or off.

  • Repeated repeats (issue #2537)

    A regex like ((x|y+)*)* will be accepted and will work correctly, but should complete more quickly.

  • Definition of ‘word’ character (issue #1693050)

    The definition of a ‘word’ character has been expanded for Unicode. It now conforms to the Unicode specification at http://www.unicode.org/reports/tr29/. This applies to \w, \W, \b and \B.

  • Groups in lookahead and lookbehind (issue #814253)

    Groups and group references are permitted in both lookahead and lookbehind.

  • Variable-length lookbehind

    A lookbehind can match a variable-length string.

  • Correct handling of charset with ignore case flag (issue #3511)

    Ranges within charsets are handled correctly when the ignore-case flag is turned on.

  • Unmatched group in replacement (issue #1519638)

    An unmatched group is treated as an empty string in a replacement template.

  • ‘Pathological’ patterns (issue #1566086, issue #1662581, issue #1448325, issue #1721518, issue #1297193)

    ‘Pathological’ patterns should complete more quickly.

  • Flags argument for regex.split, regex.sub and regex.subn (issue #3482)

    regex.split, regex.sub and regex.subn support a ‘flags’ argument.

  • Pos and endpos arguments for regex.sub and regex.subn

    regex.sub and regex.subn support ‘pos’ and ‘endpos’ arguments.

  • ‘Overlapped’ argument for regex.findall and regex.finditer

    regex.findall and regex.finditer support an ‘overlapped’ flag which permits overlapped matches.

  • Unicode escapes (issue #3665)

    The Unicode escapes \uxxxx and \Uxxxxxxxx are supported.

  • Large patterns (issue #1160)

    Patterns can be much larger.

  • Zero-width match with regex.finditer (issue #1647489)

    regex.finditer behaves correctly when it splits at a zero-width match.

  • Zero-width split with regex.split (issue #3262)

    Version 0 behaviour: a string won’t be split at a zero-width match.

    Version 1 behaviour: a string will be split at a zero-width match.

  • Splititer

    regex.splititer has been added. It’s a generator equivalent of regex.split.

  • Subscripting for groups

    A match object accepts access to the captured groups via subscripting and slicing:

    >>> m = regex.search(r"(?P<before>.*?)(?P<num>\d+)(?P<after>.*)", "pqr123stu")
    >>> print m["before"]
    pqr
    >>> print m["num"]
    123
    >>> print m["after"]
    stu
    >>> print len(m)
    4
    >>> print m[:]
    ('pqr123stu', 'pqr', '123', 'stu')
  • Named groups

    Groups can be named with (?<name>...) as well as the current (?P<name>...).

  • Group references

    Groups can be referenced within a pattern with \g<name>. This also allows there to be more than 99 groups.

  • Named characters

    \N{name}

    Named characters are supported. (Note: only those known by Python’s Unicode database are supported.)

  • Unicode codepoint properties, including scripts and blocks

    \p{property=value}; \P{property=value}; \p{value} ; \P{value}

    Many Unicode properties are supported, including blocks and scripts. \p{property=value} or \p{property:value} matches a character whose property property has value value. The inverse of \p{property=value} is \P{property=value} or \p{^property=value}.

    If the short form \p{value} is used, the properties are checked in the order: General_Category, Script, Block, binary property:

    • Latin, the ‘Latin’ script (Script=Latin).

    • Cyrillic, the ‘Cyrillic’ script (Script=Cyrillic).

    • BasicLatin, the ‘BasicLatin’ block (Block=BasicLatin).

    • Alphabetic, the ‘Alphabetic’ binary property (Alphabetic=Yes).

    A short form starting with Is indicates a script or binary property:

    • IsLatin, the ‘Latin’ script (Script=Latin).

    • IsCyrillic, the ‘Cyrillic’ script (Script=Cyrillic).

    • IsAlphabetic, the ‘Alphabetic’ binary property (Alphabetic=Yes).

    A short form starting with In indicates a block property:

    • InBasicLatin, the ‘BasicLatin’ block (Block=BasicLatin).

    • InCyrillic, the ‘Cyrillic’ block (Block=Cyrillic).

  • POSIX character classes

    [[:alpha:]]; [[:^alpha:]]

    POSIX character classes are supported. These are normally treated as an alternative form of \p{...}.

    The exceptions are alnum, digit, punct and xdigit, whose definitions are different from those of Unicode.

    [[:alnum:]] is equivalent to \p{posix_alnum}.

    [[:digit:]] is equivalent to \p{posix_digit}.

    [[:punct:]] is equivalent to \p{posix_punct}.

    [[:xdigit:]] is equivalent to \p{posix_xdigit}.

  • Search anchor

    \G

    A search anchor has been added. It matches at the position where each search started/continued and can be used for contiguous matches or in negative variable-length lookbehinds to limit how far back the lookbehind goes:

    >>> regex.findall(r"\w{2}", "abcd ef")
    ['ab', 'cd', 'ef']
    >>> regex.findall(r"\G\w{2}", "abcd ef")
    ['ab', 'cd']
    • The search starts at position 0 and matches 2 letters ‘ab’.

    • The search continues at position 2 and matches 2 letters ‘cd’.

    • The search continues at position 4 and fails to match any letters.

    • The anchor stops the search start position from being advanced, so there are no more results.

  • Reverse searching

    Searches can now work backwards:

    >>> regex.findall(r".", "abc")
    ['a', 'b', 'c']
    >>> regex.findall(r"(?r).", "abc")
    ['c', 'b', 'a']

    Note: the result of a reverse search is not necessarily the reverse of a forward search:

    >>> regex.findall(r"..", "abcde")
    ['ab', 'cd']
    >>> regex.findall(r"(?r)..", "abcde")
    ['de', 'bc']
  • Matching a single grapheme

    \X

    The grapheme matcher is supported. It now conforms to the Unicode specification at http://www.unicode.org/reports/tr29/.

  • Branch reset

    (?|...|...)

    Capture group numbers will be reused across the alternatives, but groups with different names will have different group numbers.

    Examples:

    >>> regex.match(r"(?|(first)|(second))", "first").groups()
    ('first',)
    >>> regex.match(r"(?|(first)|(second))", "second").groups()
    ('second',)

    Note that there is only one group.

  • Default Unicode word boundary

    The WORD flag changes the definition of a ‘word boundary’ to that of a default Unicode word boundary. This applies to \b and \B.

  • SRE engine do not release the GIL (issue #1366311)

    The regex module can release the GIL during matching (see the above section on multithreading).

    Iterators can be safely shared across threads.

Project details


Release history Release notifications | RSS feed

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

regex-2016.03.02.tar.gz (575.7 kB view details)

Uploaded Source

Built Distributions

regex-2016.03.02-cp35-none-win_amd64.whl (233.6 kB view details)

Uploaded CPython 3.5Windows x86-64

regex-2016.03.02-cp35-none-win32.whl (228.0 kB view details)

Uploaded CPython 3.5Windows x86

regex-2016.03.02-cp34-none-win_amd64.whl (233.8 kB view details)

Uploaded CPython 3.4Windows x86-64

regex-2016.03.02-cp34-none-win32.whl (228.0 kB view details)

Uploaded CPython 3.4Windows x86

regex-2016.03.02-cp33-none-win_amd64.whl (233.7 kB view details)

Uploaded CPython 3.3Windows x86-64

regex-2016.03.02-cp33-none-win32.whl (227.8 kB view details)

Uploaded CPython 3.3Windows x86

regex-2016.03.02-cp32-none-win_amd64.whl (232.6 kB view details)

Uploaded CPython 3.2Windows x86-64

regex-2016.03.02-cp32-none-win32.whl (226.9 kB view details)

Uploaded CPython 3.2Windows x86

regex-2016.03.02-cp31-none-win_amd64.whl (232.7 kB view details)

Uploaded CPython 3.1Windows x86-64

regex-2016.03.02-cp31-none-win32.whl (227.0 kB view details)

Uploaded CPython 3.1Windows x86

regex-2016.03.02-cp27-none-win_amd64.whl (232.7 kB view details)

Uploaded CPython 2.7Windows x86-64

regex-2016.03.02-cp27-none-win32.whl (226.9 kB view details)

Uploaded CPython 2.7Windows x86

regex-2016.03.02-cp26-none-win_amd64.whl (232.6 kB view details)

Uploaded CPython 2.6Windows x86-64

regex-2016.03.02-cp26-none-win32.whl (226.8 kB view details)

Uploaded CPython 2.6Windows x86

regex-2016.03.02-cp25-none-win_amd64.whl (230.9 kB view details)

Uploaded CPython 2.5Windows x86-64

regex-2016.03.02-cp25-none-win32.whl (225.3 kB view details)

Uploaded CPython 2.5Windows x86

File details

Details for the file regex-2016.03.02.tar.gz.

File metadata

  • Download URL: regex-2016.03.02.tar.gz
  • Upload date:
  • Size: 575.7 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No

File hashes

Hashes for regex-2016.03.02.tar.gz
Algorithm Hash digest
SHA256 1de144c68e96f719987f789fcd6f349f2c1cd89d642f785c9d4e438e6c23222f
MD5 7e6056389b39af87cf4e60d8ac88402a
BLAKE2b-256 b9d34ab157c48301159d84abd07c7df0690bf00181a773b0b31e4593ffc7e437

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp35-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp35-none-win_amd64.whl
Algorithm Hash digest
SHA256 2884b30aa8df0c8a4918742c4eb8184b35a28654a23e3fb1872ae3e8bf5e85f4
MD5 7d2fa3aa181d4f373877de82c6b7a201
BLAKE2b-256 3d151e97847bcd7fce19ef3bf9d213b3c23a4277b7899bdaf8a23a3219db2da0

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp35-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp35-none-win32.whl
Algorithm Hash digest
SHA256 c497f30def125ca174fa1221ffcae617eca4124b6a04fb357cdb2977d055a403
MD5 f3471999d4ba748acc860c963f2aebd7
BLAKE2b-256 8f252dbc28ef14b6e81d5b0146ca5cd25816f0b8086f94448ea14559dff86567

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp34-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp34-none-win_amd64.whl
Algorithm Hash digest
SHA256 df0d8fd287bbee891e6c0ae7676b51eca9e2bd9e0b00c3ed7f376001faaad8e2
MD5 6a23202ccfa8475c62c3bdfbdf11456f
BLAKE2b-256 ab48cf2fca5e561f39dd2603a5e3e3db9ec5d4c3d35e8c4af991e6c160964d1c

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp34-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp34-none-win32.whl
Algorithm Hash digest
SHA256 2ca50e0d38e1d0fc3984a29d23072bdd12b614d6b34fd614a6e4cf2bfe631433
MD5 6793444b922eee542ce54fa7b6740c55
BLAKE2b-256 3acea0eb5a6818a9ce31c97e3a95ae9d7d6612cbf8dff3482389fa9dd7053ae9

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp33-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp33-none-win_amd64.whl
Algorithm Hash digest
SHA256 522bc8e9257d6769607b5865e37c102d239b8cfbed9c67bc791c0e68b24b7c1a
MD5 93bb63b8c572f9bde24ab333cf778216
BLAKE2b-256 6055b157914621f4b5567e914e8b2f5ad9f71acf1e3b7e0642334a3fb8019284

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp33-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp33-none-win32.whl
Algorithm Hash digest
SHA256 7fbe0a68be2c2700ae98b5e5820439a1d91b315dc9bb9deb11dba48ce5fd81d9
MD5 02ae4e7d0fc9be11ea31889036d78f16
BLAKE2b-256 713cf20ccf70381822ca13c8901854a7c0bf94b0593859b0f550567fc5ab1ed0

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp32-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp32-none-win_amd64.whl
Algorithm Hash digest
SHA256 d3759a005c5966700604ec4d9d02ee4443babdf18eaa575923a1b080bd45f02c
MD5 6ef0a6bb5a65c2daa310cb2634db84a8
BLAKE2b-256 db594f1bfac758c9305e2d2d352b4e5886531d6c552e61e7b960c36dabb519a1

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp32-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp32-none-win32.whl
Algorithm Hash digest
SHA256 a2b141c528b38fe9ac8044acc1f191c4dbfd20c8dfe37f92a5884cd1013df7d3
MD5 70c67bcd299d2762c3a48e78630d300c
BLAKE2b-256 711e3c5c06bacb491210dd70756f2996d6534ef6b37086f39f7185211d5ca08b

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp31-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp31-none-win_amd64.whl
Algorithm Hash digest
SHA256 c3b6645505a07b1cadd2aef290a1a7325b354f1f9763dacf9120590d043b3719
MD5 c7c93187a79f93e32e9fe7a67451f10e
BLAKE2b-256 67bb7ffd69dc46ca61212abbe502a16bc99040dd36d644fb71e6cd41827e15e2

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp31-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp31-none-win32.whl
Algorithm Hash digest
SHA256 e9bb1b1759d0cc9dafd557dc575635f9447a4b084a096af47d19f297074987f8
MD5 6f3fe2c43aaefa64fdc911e59172fa45
BLAKE2b-256 221fbd03e2e9ec68b5025ea7fbc3d0dd211e5431bdb0ba8e7622b8c53d461b0d

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp27-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp27-none-win_amd64.whl
Algorithm Hash digest
SHA256 da396c62c58ff81cfadb623e9dccf0b216d1a13573231d8613c25da66351121e
MD5 3effc42acc35bd50999c243e8b570d3f
BLAKE2b-256 bf65c4ee5f7b089e511595c7e96fff0d8afaf087ae10632ade2663586774ac34

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp27-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp27-none-win32.whl
Algorithm Hash digest
SHA256 230a24ebeb6ce8f7a6bf3b4b0aa3781097727433a164551f7995bad54b7765bd
MD5 ba48f5d4e6a039dcf1f9e9f14375853f
BLAKE2b-256 22a0ccb3f8c2296e3ee74120bfa8f79cc600ebb0878cede4a708cea8b0c7457f

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp26-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp26-none-win_amd64.whl
Algorithm Hash digest
SHA256 c10156a79cd2eaf78415bf3a8f43e2ae75e850afad5b7653ebb59d9cb5e22b48
MD5 2c6d24ff6a6dc8c776ac986a3c3477a2
BLAKE2b-256 33860a8912a4b31de286fc2a66ec35309a0e75d61366c9df8e34741df56fe19e

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp26-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp26-none-win32.whl
Algorithm Hash digest
SHA256 6af89e35fbcaf42b38365c1c40c1a4c2c88b36efce5ada45ca3759eb8134b738
MD5 7849b69d13f6b1cd130701ab35686966
BLAKE2b-256 8623a6d7b95bebea9d0c0a0eaf65e7750a057367b3f210f7a49437f7bd476afe

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp25-none-win_amd64.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp25-none-win_amd64.whl
Algorithm Hash digest
SHA256 ed1296f888a91eddac1b36e806c42e1a9bd942c22fddceeedc44c700341d76a4
MD5 3d3dc1cb05a3df1a7bd2bf8b90e3c8d6
BLAKE2b-256 b8a01b6639cf7c812c1c33a6f8f900ffa87c768a77e018898f0837a9b46e0cc4

See more details on using hashes here.

File details

Details for the file regex-2016.03.02-cp25-none-win32.whl.

File metadata

File hashes

Hashes for regex-2016.03.02-cp25-none-win32.whl
Algorithm Hash digest
SHA256 d6b3d6554f50e8806edc6f1a065759fb546723da31ac12d11b81265b7979f635
MD5 e5700f9e6adee4c2ef0ec7b1f46e96f1
BLAKE2b-256 92b6f58a9c322759cdf9870c0a8583bf883cf513480d083d0737424a1bc4f916

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page