-- enabled some temporarily disabled RE tests
-- added basic unicode tests to test_re
-- added test case for Sjoerd's xmllib problem to re_tests
diff --git a/Lib/test/output/test_re b/Lib/test/output/test_re
index 75c46fc..2f5ad4b 100644
--- a/Lib/test/output/test_re
+++ b/Lib/test/output/test_re
@@ -1 +1,2 @@
test_re
+maximum recursion limit exceeded
diff --git a/Lib/test/re_tests.py b/Lib/test/re_tests.py
index adc3a7d..14a2cee 100755
--- a/Lib/test/re_tests.py
+++ b/Lib/test/re_tests.py
@@ -587,4 +587,10 @@
('\t\n\v\r\f\a\g', '\t\n\v\r\f\ag', SUCCEED, 'found', '\t\n\v\r\f\ag'),
(r'\t\n\v\r\f\a', '\t\n\v\r\f\a', SUCCEED, 'found', chr(9)+chr(10)+chr(11)+chr(13)+chr(12)+chr(7)),
(r'[\t][\n][\v][\r][\f][\b]', '\t\n\v\r\f\b', SUCCEED, 'found', '\t\n\v\r\f\b'),
+
+ # additional regression tests (1.6 and later)
+
+ # xmllib problem
+ (r'(([a-z]+):)?([a-z]+)$', 'smil', SUCCEED, 'g1+"-"+g2+"-"+g3', 'None-None-smil'),
+
]
diff --git a/Lib/test/test_re.py b/Lib/test/test_re.py
index fa28417..6929800 100644
--- a/Lib/test/test_re.py
+++ b/Lib/test/test_re.py
@@ -28,10 +28,6 @@
except:
raise TestFailed, "re.search"
-# Try nasty case that overflows the straightforward recursive
-# implementation of repeated groups.
-#assert re.match('(x)*', 50000*'x').span() == (0, 50000)
-
if verbose:
print 'Running tests on re.sub'
@@ -154,8 +150,8 @@
assert re.split("(?::*)", ":a:b::c") == ['', 'a', 'b', 'c']
assert re.split("(:)*", ":a:b::c") == ['', ':', 'a', ':', 'b', ':', 'c']
assert re.split("([b:]+)", ":a:b::c") == ['', ':', 'a', ':b::', 'c']
-## assert re.split("(b)|(:+)", ":a:b::c") == \
-## ['', None, ':', 'a', None, ':', '', 'b', None, '', None, '::', 'c']
+ assert re.split("(b)|(:+)", ":a:b::c") == \
+ ['', None, ':', 'a', None, ':', '', 'b', None, '', None, '::', 'c']
assert re.split("(?:b)|(?::+)", ":a:b::c") == ['', 'a', '', '', 'c']
except AssertionError:
raise TestFailed, "re.split"
@@ -253,6 +249,16 @@
except:
print 'Exception raised on flag', flags
+if verbose:
+ print 'Test engine limitations'
+
+# Try nasty case that overflows the straightforward recursive
+# implementation of repeated groups.
+try:
+ assert re.match('(x)*', 50000*'x').span() == (0, 50000)
+except RuntimeError, v:
+ print v
+
from re_tests import *
if verbose:
@@ -326,6 +332,19 @@
else:
print '=== Failed incorrectly', t
+ # Try the match on a unicode string, and check that it
+ # still succeeds.
+ result=obj.search(unicode(s, "latin-1"))
+ if result==None:
+ print '=== Fails on unicode match', t
+
+ # Try the match on a unicode pattern, and check that it
+ # still succeeds.
+ obj=re.compile(unicode(pattern, "latin-1"))
+ result=obj.search(s)
+ if result==None:
+ print '=== Fails on unicode pattern match', t
+
# Try the match with the search area limited to the extent
# of the match and see if it still succeeds. \B will
# break (because it won't match at the end or start of a
@@ -350,3 +369,10 @@
result=obj.search(s)
if result==None:
print '=== Fails on locale-sensitive match', t
+
+ # Try the match with UNICODE locale enabled, and check
+ # that it still succeeds.
+ obj=re.compile(pattern, re.UNICODE)
+ result=obj.search(s)
+ if result==None:
+ print '=== Fails on unicode-sensitive match', t