--- re.py       2008-01-25 11:56:06.000000000 +0000
+++ re-patched.py       2008-01-25 12:54:47.000000000 +0000
@@ -38,7 +38,7 @@
     *?,+?,?? Non-greedy versions of the previous three special characters.
     {m,n}    Matches from m to n repetitions of the preceding RE.
     {m,n}?   Non-greedy version of the above.
-    "\\"      Either escapes special characters or signals a special sequence.
+    "\\"     Either escapes special characters or signals a special sequence.
     []       Indicates a set of characters.
              A "^" as the first character indicates a complementing set.
     "|"      A|B, creates an RE that will match either A or B.
@@ -51,6 +51,11 @@
     (?#...)  A comment; ignored.
     (?=...)  Matches if ... matches next, but doesn't consume the string.
     (?!...)  Matches if ... doesn't match next.
+    (?<=...) Matches if preceded by a match for ... (must be fixed length).
+    (?<!...) Matches if not preceded by a match for ... (must be fixed length).
+    (?(id/name)yes-pattern|no-pattern)
+             Match with yes-pattern if a group with given id or name exists.
+             If not, matches with no-pattern if given. |no-pattern is optional.

 The special sequences consist of "\\" and a character from the list
 below.  If the ordinary character is not on the list, then the
@@ -77,6 +82,7 @@
     subn     Same as sub, but also return the number of substitutions made.
     split    Split a string by the occurrences of a pattern.
     findall  Find all occurrences of a pattern in a string.
+    finditer Returns an iterator yielding a match object for each occurrence.
     compile  Compile a pattern into a RegexObject.
     purge    Clear the regular expression cache.
     escape   Backslash all non-alphanumerics in a string.