PageRenderTime 52ms CodeModel.GetById 18ms RepoModel.GetById 0ms app.codeStats 0ms

/IronPython_2_0/Src/Tests/test_re.py

#
Python | 787 lines | 709 code | 38 blank | 40 comment | 11 complexity | d1ba1048d7f93eec3028f5cefed5c976 MD5 | raw file
Possible License(s): GPL-2.0, MPL-2.0-no-copyleft-exception, CPL-1.0, CC-BY-SA-3.0, BSD-3-Clause, ISC, AGPL-3.0, LGPL-2.1, Apache-2.0
  1. #####################################################################################
  2. #
  3. # Copyright (c) Microsoft Corporation. All rights reserved.
  4. #
  5. # This source code is subject to terms and conditions of the Microsoft Public License. A
  6. # copy of the license can be found in the License.html file at the root of this distribution. If
  7. # you cannot locate the Microsoft Public License, please send an email to
  8. # ironpy@microsoft.com. By using this source code in any fashion, you are agreeing to be bound
  9. # by the terms of the Microsoft Public License.
  10. #
  11. # You must not remove this notice, or any other, from this software.
  12. #
  13. #
  14. #####################################################################################
  15. from iptest.assert_util import *
  16. import re
  17. def test_none():
  18. for x in 'compile search match split findall finditer'.split():
  19. y = getattr(re, x)
  20. AssertError(TypeError, y, None)
  21. AssertError(TypeError, y, None, None)
  22. AssertError(TypeError, y, None, 'abc')
  23. AssertError(TypeError, y, 'abc', None)
  24. # Other exceptional input tests
  25. for x in (re.sub, re.subn):
  26. AssertError(TypeError, x, 'abc', None, 'abc')
  27. AssertError(TypeError, x, 'abc', None, None)
  28. AssertError(TypeError, x, None, 'abc', 'abc')
  29. AssertError(TypeError, x, 'abc', 'abc', None)
  30. AssertError(TypeError, re.escape, None)
  31. def test_sanity_re():
  32. '''
  33. Basic sanity tests for the re module. Each module member is
  34. used at least once.
  35. '''
  36. #compile
  37. Assert(hasattr(re.compile("(abc){1}"), "pattern"))
  38. Assert(hasattr(re.compile("(abc){1}", re.L), "pattern"))
  39. Assert(hasattr(re.compile("(abc){1}", flags=re.L), "pattern"))
  40. #I IGNORECASE L LOCAL MMULTILINE S DOTALL U UNICODE X VERBOSE
  41. flags = ["I", "IGNORECASE",
  42. "L", "LOCALE",
  43. "M", "MULTILINE",
  44. "S", "DOTALL",
  45. "U", "UNICODE",
  46. "X", "VERBOSE"]
  47. for f in flags:
  48. Assert(hasattr(re, f))
  49. #search
  50. AreEqual(re.search("(abc){1}", ""), None)
  51. AreEqual(re.search("(abc){1}", "abcxyz").span(), (0,3))
  52. AreEqual(re.search("(abc){1}", "abcxyz", re.L).span(), (0,3))
  53. AreEqual(re.search("(abc){1}", "abcxyz", flags=re.L).span(), (0,3))
  54. AreEqual(re.search("(abc){1}", "xyzabc").span(), (3,6))
  55. #match
  56. AreEqual(re.match("(abc){1}", ""), None)
  57. AreEqual(re.match("(abc){1}", "abcxyz").span(), (0,3))
  58. AreEqual(re.match("(abc){1}", "abcxyz", re.L).span(), (0,3))
  59. AreEqual(re.match("(abc){1}", "abcxyz", flags=re.L).span(), (0,3))
  60. #split
  61. AreEqual(re.split("(abc){1}", ""), [''])
  62. AreEqual(re.split("(abc){1}", "abcxyz"), ['', 'abc', 'xyz'])
  63. #maxsplit
  64. AreEqual(re.split("(abc){1}", "abc", 0), ['', 'abc', ''])
  65. for i in xrange(3):
  66. AreEqual(re.split("(abc){1}", "abc", maxsplit=i), ['', 'abc', ''])
  67. AreEqual(re.split("(abc){1}", "", maxsplit=i), [''])
  68. AreEqual(re.split("(abc){1}", "abcxyz", maxsplit=i), ['', 'abc', 'xyz'])
  69. AreEqual(re.split("(abc){1}", "abcxyzabc", maxsplit=0), ['', 'abc', 'xyz', 'abc', ''])
  70. AreEqual(re.split("(abc){1}", "abcxyzabc", maxsplit=1), ['', 'abc', 'xyzabc'])
  71. AreEqual(re.split("(abc){1}", "abcxyzabc", maxsplit=2), ['', 'abc', 'xyz', 'abc', ''])
  72. #findall
  73. AreEqual(re.findall("(abc){1}", ""), [])
  74. AreEqual(re.findall("(abc){1}", "abcxyz"), ['abc'])
  75. AreEqual(re.findall("(abc){1}", "abcxyz", re.L), ['abc'])
  76. AreEqual(re.findall("(abc){1}", "abcxyz", flags=re.L), ['abc'])
  77. AreEqual(re.findall("(abc){1}", "xyzabcabc"), ['abc', 'abc'])
  78. #finditer
  79. AreEqual([x.group() for x in re.finditer("(abc){1}", "")], [])
  80. AreEqual([x.group() for x in re.finditer("(abc){1}", "abcxyz")], ['abc'])
  81. AreEqual([x.group() for x in re.finditer("(abc){1}", "abcxyz", re.L)], ['abc'])
  82. AreEqual([x.group() for x in re.finditer("(abc){1}", "abcxyz", flags=re.L)], ['abc'])
  83. AreEqual([x.group() for x in re.finditer("(abc){1}", "xyzabcabc")], ['abc', 'abc'])
  84. rex = re.compile("foo")
  85. for m in rex.finditer("this is a foo and a foo bar"):
  86. AreEqual((m.pos, m.endpos), (0, 27))
  87. for m in rex.finditer(""):
  88. AreEqual((m.pos, m.endpos), (0, 1))
  89. for m in rex.finditer("abc"):
  90. AreEqual((m.pos, m.endpos), (0, 4))
  91. for m in rex.finditer("foo foo foo foo foo"):
  92. AreEqual((m.pos, m.endpos), (0, 19))
  93. #sub
  94. AreEqual(re.sub("(abc){1}", "9", "abcd"), "9d")
  95. AreEqual(re.sub("(abc){1}", "abcxyz",'abcd'), "abcxyzd")
  96. AreEqual(re.sub("(abc){1}", "1", "abcd", 0), "1d")
  97. AreEqual(re.sub("(abc){1}", "1", "abcd", count=0), "1d")
  98. AreEqual(re.sub("(abc){1}", "1", "abcdabcd", 1), "1dabcd")
  99. AreEqual(re.sub("(abc){1}", "1", "abcdabcd", 2), "1d1d")
  100. #subn
  101. AreEqual(re.subn("(abc){1}", "9", "abcd"), ("9d", 1))
  102. AreEqual(re.subn("(abc){1}", "abcxyz",'abcd'), ("abcxyzd",1))
  103. AreEqual(re.subn("(abc){1}", "1", "abcd", 0), ("1d",1))
  104. AreEqual(re.subn("(abc){1}", "1", "abcd", count=0), ("1d",1))
  105. AreEqual(re.subn("(abc){1}", "1", "abcdabcd", 1), ("1dabcd",1))
  106. AreEqual(re.subn("(abc){1}", "1", "abcdabcd", 2), ("1d1d",2))
  107. #escape
  108. AreEqual(re.escape("abc"), "abc")
  109. AreEqual(re.escape(""), "")
  110. AreEqual(re.escape("_"), "\\_")
  111. AreEqual(re.escape("a_c"), "a\\_c")
  112. #error
  113. exc = re.error()
  114. exc = re.error("some args")
  115. #purge
  116. #CodePlex Work Item 6277
  117. #re.purge()
  118. def test_sanity_re_pattern():
  119. '''
  120. Basic sanity tests for the re module's Regular Expression
  121. objects (i.e., Pattern in CPython). Each method/member is
  122. utilized at least once.
  123. '''
  124. pattern = re.compile("(abc){1}")
  125. #match
  126. AreEqual(pattern.match(""), None)
  127. AreEqual(pattern.match("abcxyz").span(), (0,3))
  128. AreEqual(pattern.match("abc", 0).span(), (0,3))
  129. AreEqual(pattern.match("abc", 0, 3).span(), (0,3))
  130. AreEqual(pattern.match("abc", pos=0, endpos=3).span(), (0,3))
  131. for i in [-1, -2, -5, -7, -8, -65536]:
  132. for j in [3, 4, 5, 7, 8, 65536]:
  133. AreEqual(pattern.match("abc", i, j).span(), (0,3))
  134. AssertError(OverflowError, lambda: pattern.match("abc", 0, 2**32).span())
  135. AssertError(OverflowError, lambda: pattern.match("abc", -(2**32), 3).span())
  136. #search
  137. AreEqual(pattern.search(""), None)
  138. AreEqual(pattern.search("abcxyz").span(), (0,3))
  139. AreEqual(pattern.search("abc", 0).span(), (0,3))
  140. AreEqual(pattern.search("abc", 0, 3).span(), (0,3))
  141. AreEqual(pattern.search("abc", pos=0, endpos=3).span(), (0,3))
  142. AreEqual(pattern.search("xyzabc").span(), (3,6))
  143. #split
  144. AreEqual(pattern.split(""), [''])
  145. AreEqual(pattern.split("abcxyz"), ['', 'abc', 'xyz'])
  146. AreEqual(pattern.split("abc", 0), ['', 'abc', ''])
  147. AreEqual(pattern.split("abc", maxsplit=0), ['', 'abc', ''])
  148. AreEqual(pattern.split("abcxyzabc", maxsplit=1), ['', 'abc', 'xyzabc'])
  149. #findall
  150. AreEqual(pattern.findall(""), [])
  151. AreEqual(pattern.findall("abcxyz"), ['abc'])
  152. AreEqual(pattern.findall("abc", 0), ['abc'])
  153. AreEqual(pattern.findall("abc", 0, 3), ['abc'])
  154. AreEqual(pattern.findall("abc", pos=0, endpos=3), ['abc'])
  155. AreEqual(pattern.findall("xyzabcabc"), ['abc', 'abc'])
  156. #sub
  157. AreEqual(pattern.sub("9", "abcd"), "9d")
  158. AreEqual(pattern.sub("abcxyz",'abcd'), "abcxyzd")
  159. AreEqual(pattern.sub("1", "abcd", 0), "1d")
  160. AreEqual(pattern.sub("1", "abcd", count=0), "1d")
  161. AreEqual(pattern.sub("1", "abcdabcd", 1), "1dabcd")
  162. AreEqual(pattern.sub("1", "abcdabcd", 2), "1d1d")
  163. #subn
  164. AreEqual(pattern.subn("9", "abcd"), ("9d", 1))
  165. AreEqual(pattern.subn("abcxyz",'abcd'), ("abcxyzd",1))
  166. AreEqual(pattern.subn("1", "abcd", 0), ("1d",1))
  167. AreEqual(pattern.subn("1", "abcd", count=0), ("1d",1))
  168. AreEqual(pattern.subn("1", "abcdabcd", 1), ("1dabcd",1))
  169. AreEqual(pattern.subn("1", "abcdabcd", 2), ("1d1d",2))
  170. #flags
  171. AreEqual(pattern.flags, 0)
  172. AreEqual(re.compile("(abc){1}", re.L).flags, re.L)
  173. #groupindex
  174. AreEqual(pattern.groupindex, {})
  175. AreEqual(re.compile("(?P<abc>)(?P<bcd>)").groupindex, {'bcd': 2, 'abc': 1})
  176. #pattern
  177. AreEqual(pattern.pattern, "(abc){1}")
  178. AreEqual(re.compile("").pattern, "")
  179. def test_groupindex_empty():
  180. test_list = [ ".", "^", "$", "1*", "2+", "3?", "4*?", "5+?", "6??", "7{1}", "8{1,2}",
  181. "9{1,2}?", "[a-z]", "|", "(...)", "(?:abc)",
  182. "\(\?P\<Blah\>abc\)", "(?#...)", "(?=...)", "(?!...)", "(?<=...)",
  183. "(?<!...)", "\1", "\A", "\d"
  184. ]
  185. for x in test_list:
  186. AreEqual(re.compile(x).groupindex, {})
  187. def test_sanity_re_match():
  188. '''
  189. Basic sanity tests for the re module's Match objects. Each method/member
  190. is utilized at least once.
  191. '''
  192. pattern = re.compile("(abc){1}")
  193. match_obj = pattern.match("abcxyzabc123 and some other words...")
  194. #expand
  195. AreEqual(match_obj.expand("\1\g<1>.nt"), '\x01abc.nt')
  196. #group
  197. AreEqual(match_obj.group(), 'abc')
  198. AreEqual(match_obj.group(1), 'abc')
  199. #groups
  200. AreEqual(match_obj.groups(), ('abc',))
  201. AreEqual(match_obj.groups(1), ('abc',))
  202. AreEqual(match_obj.groups(99), ('abc',))
  203. #groupdict
  204. AreEqual(match_obj.groupdict(), {})
  205. AreEqual(match_obj.groupdict(None), {})
  206. AreEqual(re.compile("(abc)").match("abcxyzabc123 and...").groupdict(), {})
  207. #start
  208. AreEqual(match_obj.start(), 0)
  209. AreEqual(match_obj.start(1), 0)
  210. #end
  211. AreEqual(match_obj.end(), 3)
  212. AreEqual(match_obj.end(1), 3)
  213. #span
  214. AreEqual(match_obj.span(), (0,3))
  215. AreEqual(match_obj.span(1), (0,3))
  216. #pos
  217. AreEqual(match_obj.pos, 0)
  218. #endpos
  219. AreEqual(match_obj.endpos, 36)
  220. #lastindex
  221. AreEqual(match_obj.lastindex, 1)
  222. #lastgroup
  223. #CodePlex Work Item 5518
  224. #AreEqual(match_obj.lastgroup, None)
  225. #re
  226. Assert(match_obj.re==pattern)
  227. #string
  228. AreEqual(match_obj.string, "abcxyzabc123 and some other words...")
  229. def test_comment():
  230. '''
  231. (?#...)
  232. '''
  233. pattern = "a(?#foo)bc"
  234. c = re.compile(pattern)
  235. AreEqual(c.findall("abc"), ['abc'])
  236. pattern = "a(?#)bc"
  237. c = re.compile(pattern)
  238. AreEqual(c.findall("abc"), ['abc'])
  239. pattern = "a(?#foo)bdc"
  240. c = re.compile(pattern)
  241. AreEqual(len(c.findall("abc")), 0)
  242. def test_optional_paren():
  243. pattern = r"""\(?\w+\)?"""
  244. c = re.compile(pattern, re.X)
  245. AreEqual(c.findall('abc'), ['abc'])
  246. def test_back_match():
  247. p = re.compile('(?P<grp>.+?)(?P=grp)')
  248. AreEqual(p.match('abcabc').groupdict(), {'grp':'abc'})
  249. p = re.compile(r'(?P<delim>[%$])(?P<escaped>(?P=delim))')
  250. AreEqual(p.match('$$').groupdict(), {'escaped': '$', 'delim': '$'})
  251. AreEqual(p.match('$%'), None)
  252. p = re.compile(r'(?P<grp>ab)(a(?P=grp)b)')
  253. AreEqual(p.match('abaabb').groups(), ('ab', 'aabb'))
  254. def test_expand():
  255. AreEqual(re.match("(a)(b)", "ab").expand("blah\g<1>\g<2>"), "blahab")
  256. AreEqual(re.match("(a)()", "ab").expand("blah\g<1>\g<2>\n\r\t\\\\"),'blaha\n\r\t\\')
  257. AreEqual(re.match("(a)()", "ab").expand(""),'')
  258. def test_sub():
  259. x = '\n #region Generated Foo\nblah\nblah#end region'
  260. a = re.compile("^([ \t]+)#region Generated Foo.*?#end region", re.MULTILINE|re.DOTALL)
  261. AreEqual(a.sub("xx", x), "\nxx") # should match successfully
  262. AreEqual(a.sub("\\x12", x), "\n\\x12") # should match, but shouldn't un-escape for \x
  263. #if optional count arg is 0 then all occurrences should be replaced
  264. AreEqual('bbbb', re.sub("a","b","abab", 0))
  265. AreEqual(re.sub(r'(?P<id>b)', '\g<id>\g<id>yadayada', 'bb'), 'bbyadayadabbyadayada')
  266. AreEqual(re.sub(r'(?P<id>b)', '\g<1>\g<id>yadayada', 'bb'), 'bbyadayadabbyadayada')
  267. AssertError(IndexError, re.sub, r'(?P<id>b)', '\g<1>\g<i2>yadayada', 'bb')
  268. # the native implementation just gives a sre_constants.error instead indicating an invalid
  269. # group reference
  270. if is_cli:
  271. AssertError(IndexError, re.sub, r'(?P<id>b)', '\g<1>\g<30>yadayada', 'bb')
  272. AreEqual(re.sub('x*', '-', 'abc'), '-a-b-c-')
  273. AreEqual(re.subn('x*', '-', 'abc'), ('-a-b-c-', 4))
  274. AreEqual(re.sub('a*', '-', 'abc'), '-b-c-')
  275. AreEqual(re.subn('a*', '-', 'abc'), ('-b-c-', 3))
  276. AreEqual(re.sub('a*', '-', 'a'), '-')
  277. AreEqual(re.subn('a*', '-', 'a'), ('-', 1))
  278. AreEqual(re.sub("a*", "-", "abaabb"), '-b-b-b-')
  279. AreEqual(re.subn("a*", "-", "abaabb"), ('-b-b-b-', 4))
  280. AreEqual(re.sub("(a*)b", "-", "abaabb"), '---')
  281. AreEqual(re.subn("(a*)b", "-", "abaabb"), ('---', 3))
  282. AreEqual(re.subn("(ab)*", "cd", "abababababab", 10), ('cd', 1))
  283. AreEqual(re.sub('x*', '-', 'abxd'), '-a-b-d-')
  284. AreEqual(re.subn('x*', '-', 'abxd'), ('-a-b-d-', 4))
  285. Assert(re.sub('([^aeiou])y$', r'\lies', 'vacancy') == 'vacan\\lies')
  286. Assert(re.sub('([^aeiou])y$', r'\1ies', 'vacancy') == 'vacancies')
  287. AreEqual(re.sub("a+", "\n\t\\\?\"\b", "abc"), '\n\t\\?"\x08bc')
  288. AreEqual(re.sub("a+", r"\n\t\\\?\"\b", "abc"), '\n\t\\\\?\\"\x08bc')
  289. AreEqual(re.sub("a+", "\n\t\\\\\\?\"\b", "abc"), '\n\t\\\\?"\x08bc')
  290. def test_dot():
  291. a = re.compile('.')
  292. AreEqual(a.groupindex, {})
  293. p = re.compile('.')
  294. z = []
  295. for c in p.finditer('abc'): z.append((c.start(), c.end()))
  296. z.sort()
  297. AreEqual(z, [(0,1), (1,2), (2,3)])
  298. def test_x():
  299. nonmatchingp = re.compile('x')
  300. AreEqual(nonmatchingp.search('ecks', 1, 4), None)
  301. def test_match():
  302. p = re.compile('.')
  303. AreEqual(p.match('bazbar', 1,2).span(), (1,2))
  304. def test_span():
  305. AreEqual(re.match('(baz)(bar)(m)', "bazbarmxyz").span(2),(3, 6))
  306. def test_regs():
  307. AreEqual(re.match('(baz)(bar)(m)', "bazbarmxyz").regs,
  308. ((0, 7), (0, 3), (3, 6), (6, 7)))
  309. AreEqual(re.match('bazbar(mm)+(abc)(xyz)', "bazbarmmmmabcxyz123456abc").regs,
  310. ((0, 16), (8, 10), (10, 13), (13, 16)))
  311. def test_endpos():
  312. AreEqual(re.match('(baz)(bar)(m)', "bazbarmx").endpos, 8)
  313. pass
  314. def test_re():
  315. #Just ensure it's there for now
  316. stuff = re.match('a(baz)(bar)(m)', "abazbarmx")
  317. Assert(hasattr(stuff, "re"))
  318. Assert(hasattr(stuff.re, "sub"))
  319. def test_pos():
  320. AreEqual(re.match('(baz)(bar)(m)', "bazbarmx").pos, 0)
  321. def test_startandend():
  322. m = re.match(r'(a)|(b)', 'b')
  323. AreEqual(m.groups(), (None, 'b'))
  324. AreEqual(m.group(0), "b")
  325. AreEqual(m.start(0), 0)
  326. AreEqual(m.end(0), 1)
  327. AreEqual(m.start(1), -1)
  328. AreEqual(m.end(1), -1)
  329. m = re.match(".*", '')
  330. AreEqual(m.groups(), ())
  331. AreEqual(m.start(0), 0)
  332. AreEqual(m.end(0), 0)
  333. AssertError(IndexError, m.group, "112")
  334. AssertError(IndexError, m.group, 112)
  335. AssertError(IndexError, m.group, "-1")
  336. AssertError(IndexError, m.group, -1)
  337. AssertError(IndexError, m.start, 112)
  338. AssertError(IndexError, m.start, -1)
  339. AssertError(IndexError, m.end, "112")
  340. AssertError(IndexError, m.end, 112)
  341. AssertError(IndexError, m.end, "-1")
  342. AssertError(IndexError, m.end, -1)
  343. match = re.match(r'(?P<test>test)', 'test')
  344. AreEqual(match.start('test'), 0)
  345. AreEqual(match.end('test'), 4)
  346. def test_start_of_str():
  347. startOfStr = re.compile('^')
  348. AreEqual(startOfStr.match('bazbar', 1), None)
  349. AreEqual(startOfStr.match('bazbar', 0,0).span(), (0,0))
  350. AreEqual(startOfStr.match('bazbar', 1,2), None)
  351. AreEqual(startOfStr.match('bazbar', endpos=3).span(), (0,0))
  352. AreEqual(re.sub('^', 'x', ''), 'x')
  353. AreEqual(re.sub('^', 'x', ' '), 'x ')
  354. AreEqual(re.sub('^', 'x', 'abc'), 'xabc')
  355. # check that groups in split RE are added properly
  356. def test_split():
  357. AreEqual(re.split('{(,)?}', '1 {} 2 {,} 3 {} 4'), ['1 ', None, ' 2 ', ',', ' 3 ', None, ' 4'])
  358. pnogrp = ','
  359. ptwogrp = '((,))'
  360. csv = '0,1,1,2,3,5,8,13,21,44'
  361. AreEqual(re.split(pnogrp, csv, 1), ['0', csv[2:]])
  362. AreEqual(re.split(pnogrp, csv, 2), ['0','1', csv[4:]])
  363. AreEqual(re.split(pnogrp, csv, 1000), re.split(pnogrp, csv))
  364. AreEqual(re.split(pnogrp, csv, 0), re.split(pnogrp, csv))
  365. AreEqual(re.split(pnogrp, csv, -1), [csv])
  366. ponegrp = '(,)'
  367. AreEqual(re.split(ponegrp, csv, 1), ['0', ',', csv[2:]])
  368. def test_escape():
  369. compiled = re.compile(re.escape("hi_"))
  370. all = re.compile('(.*)')
  371. AreEqual(all.search('abcdef', 3).group(0), 'def')
  372. AssertError(IndexError, re.match("a[bcd]*b", 'abcbd').group, 1)
  373. AreEqual(re.match('(a[bcd]*b)', 'abcbd').group(1), 'abcb')
  374. s = ''
  375. for i in range(32, 128):
  376. if not chr(i).isalnum():
  377. s = s + chr(i)
  378. x = re.escape(s)
  379. Assert(x == '\\ \\!\\"\\#\\$\\%\\&\\\'\\(\\)\\*\\+\\,\\-\\.\\/\\:\\;\\<\\=\\>\\?\\@\\[\\\\\\]\\^\\_\\`\\{\\|\\}\\~\\\x7f')
  380. x = re.compile(r'[\\A-Z\.\+]')
  381. Assert(x.search('aaaA\\B\\Caaa'))
  382. # From the docs: "^" matches only at the start of the string, or in MULTILINE mode also immediately
  383. # following a newline.
  384. # bug 827
  385. #m = re.compile("a").match("ba", 1) # succeed
  386. #AreEqual('a', m.group(0))
  387. #AreEqual(re.compile("^a").search("ba", 1), None) # fails; 'a' not at start
  388. #AreEqual(re.compile("^a").search("\na", 1), None) # fails; 'a' not at start
  389. #m = re.compile("^a", re.M).search("\na", 1) # succeed (multiline)
  390. #AreEqual('a', m.group(0))
  391. # bug 938
  392. #AreEqual(re.compile("^a", re.M).search("ba", 1), None) # fails; no preceding \n
  393. # findall
  394. def test_findall():
  395. for (x, y, z) in (
  396. ('\d+', '99 blahblahblah 183 blah 12 blah 7777 yada yada', ['99', '183', '12', '7777']),
  397. ('^\d+', '0blahblahblah blah blah yada yada1', ['0']),
  398. ('^\d+', 'blahblahblah blah blah yada yada1', []),
  399. ("(\d+)|(\w+)", "x = 999y + 23", [('', 'x'), ('999', ''), ('', 'y'), ('23', '')]),
  400. ("(\d)(\d\d)(\d\d\d)", "123456789123456789", [('1', '23', '456'), ('7', '89', '123'), ('4', '56', '789')]),
  401. (r"(?i)(\w+)\s+fish\b", "green fish black fish red fish blue fish", ['green', 'black', 'red', 'blue']),
  402. ('(a)(b)', 'abab', [('a', 'b'), ('a', 'b')]),
  403. ):
  404. AreEqual(re.findall(x, y), z)
  405. AreEqual(re.compile(x).findall(y), z)
  406. def test_match_groups():
  407. m = re.match('(?P<test>a)(b)', 'ab')
  408. Assert(m.groups() == ('a', 'b'))
  409. m = re.match('(u)(?P<test>v)(b)(?P<Named2>w)(x)(y)', 'uvbwxy')
  410. Assert(m.groups() == ('u', 'v', 'b', 'w', 'x', 'y'))
  411. def test_options():
  412. # coverage for ?iLmsux options in re.compile path
  413. tests = [ ("t(?=s)", "atreftsadbeatwttta", ['t']),
  414. ("t(?!s)", "atreftsadbeatststs", ['t']) ]
  415. # native implementation does not handle extensions specified in this way
  416. if is_cli:
  417. tests.extend([
  418. ("(?i:foo)", "fooFoo FOO fOo fo oFO O\n\t\nFo ofO O", ['foo', 'Foo', 'FOO', 'fOo']),
  419. ("(?im:^foo)", "fooFoo FOO fOo\n\t\nFoo\nFOO", ['foo', 'Foo', 'FOO']), # ignorecase, multiline (matches at beginning of string and at each newline)
  420. ("(?s:foo.*bar)", "foo yadayadayada\nyadayadayada bar", ['foo yadayadayada\nyadayadayada bar']), # dotall (make "." match any chr, including a newline)
  421. ("(?x:baz bar)", "bazbar foo bar bazbar \n\n\tbazbar", ['bazbar', 'bazbar', 'bazbar']), #verbose (ignore whitespace)
  422. ])
  423. for (x, y, z) in tests:
  424. AreEqual(re.findall(x, y), z)
  425. AreEqual(re.compile(x).findall(y), z)
  426. def test_bug858():
  427. pattern = r"""\(? #optional paren
  428. \)? #optional paren
  429. \d+ """
  430. c = re.compile(pattern, re.X)
  431. l = c.findall("989")
  432. Assert(l == ['989'])
  433. def test_finditer():
  434. # finditer
  435. matches = re.finditer("baz","barbazbarbazbar")
  436. num = 0
  437. for m in matches:
  438. num = num + 1
  439. AreEqual("baz", m.group(0))
  440. Assert(num == 2)
  441. matches = re.finditer("baz","barbazbarbazbar", re.L)
  442. num = 0
  443. for m in matches:
  444. num = num + 1
  445. AreEqual("baz", m.group(0))
  446. Assert(num == 2)
  447. matches = re.compile("baz").finditer("barbazbarbazbar", 0)
  448. num = 0
  449. for m in matches:
  450. num = num + 1
  451. AreEqual("baz", m.group(0))
  452. Assert(num == 2)
  453. matches = re.compile("baz").finditer("barbazbarbazbar", 14)
  454. num = 0
  455. for m in matches:
  456. num = num + 1
  457. AreEqual("baz", m.group(0))
  458. Assert(num == 0)
  459. matches = re.compile("baz").finditer("barbazbarbazbar", 0, 14)
  460. num = 0
  461. for m in matches:
  462. num = num + 1
  463. AreEqual("baz", m.group(0))
  464. Assert(num == 2)
  465. matches = re.compile("baz").finditer("barbazbarbazbar", 9, 12)
  466. num = 0
  467. for m in matches:
  468. num = num + 1
  469. AreEqual("baz", m.group(0))
  470. AreEqual(num, 1)
  471. matches = re.compile("baz").finditer("barbazbarbazbar", 9, 11)
  472. num = 0
  473. for m in matches:
  474. num = num + 1
  475. AreEqual("baz", m.group(0))
  476. AreEqual(num, 0)
  477. matches = re.compile("baz").finditer("barbazbarbazbar", 10, 12)
  478. num = 0
  479. for m in matches:
  480. num = num + 1
  481. AreEqual("baz", m.group(0))
  482. AreEqual(num, 0)
  483. def test_search():
  484. # search
  485. sp = re.search('super', 'blahsupersuper').span()
  486. Assert(sp == (4, 9))
  487. sp = re.search('super', 'superblahsuper').span()
  488. Assert(sp == (0, 5))
  489. #re.search.group() index error
  490. AreEqual(re.search("z.*z", "az123za").group(),'z123z')
  491. AreEqual(re.search("z.*z", "az12za").group(),'z12z')
  492. AreEqual(re.search("z.*z", "azza").group(),'zz')
  493. AreEqual(re.search("z123p+z", "az123ppppppppppza").group(),'z123ppppppppppz')
  494. AreEqual(re.search("z123p+z", "az123pza").group(),'z123pz')
  495. AreEqual(re.search("z123p?z", "az123pza").group(),'z123pz')
  496. AreEqual(re.search("z123p?z", "az123za").group(),'z123z')
  497. AreEqual(re.search('b', 'abc').string, 'abc')
  498. def test_subn():
  499. # subn
  500. tup = re.subn("ab", "cd", "abababababab")
  501. Assert(tup == ('cdcdcdcdcdcd', 6))
  502. tup = re.subn("ab", "cd", "abababababab", 0)
  503. Assert(tup == ('cdcdcdcdcdcd', 6))
  504. tup = re.subn("ab", "cd", "abababababab", 1)
  505. Assert(tup == ('cdababababab', 1))
  506. tup = re.subn("ab", "cd", "abababababab", 10)
  507. Assert(tup == ('cdcdcdcdcdcd', 6))
  508. tup = re.subn("ababab", "cd", "ab", 10)
  509. Assert(tup == ('ab', 0))
  510. tup = re.subn("ababab", "cd", "ab")
  511. Assert(tup == ('ab', 0))
  512. tup = re.subn("(ab)*", "cd", "abababababab", 10)
  513. Assert(tup == ('cd', 1))
  514. tup = re.subn("(ab)?", "cd", "abababababab", 10)
  515. Assert(tup == ('cdcdcdcdcdcd', 6))
  516. def test_groups():
  517. reg = re.compile("\[(?P<header>.*?)\]")
  518. m = reg.search("[DEFAULT]")
  519. Assert( m.groups() == ('DEFAULT',))
  520. Assert( m.group('header') == 'DEFAULT' )
  521. reg2 = re.compile("(?P<grp>\S+)?")
  522. m2 = reg2.search("")
  523. Assert ( m2.groups() == (None,))
  524. Assert ( m2.groups('Default') == ('Default',))
  525. def test_locale_flags():
  526. AreEqual(re.compile(r"^\#[ \t]*(\w[\d\w]*)[ \t](.*)").flags, 0)
  527. AreEqual(re.compile(r"^\#[ \t]*(\w[\d\w]*)[ \t](.*)", re.L).flags, re.L)
  528. AreEqual(re.compile(r"(?L)^\#[ \t]*(\w[\d\w]*)[ \t](.*)").flags, re.L)
  529. def test_end():
  530. ex = re.compile(r'\s+')
  531. m = ex.match('(object Petal', 7)
  532. Assert (m.end(0) == 8)
  533. def test_lone_hat():
  534. """Single ^ reg-ex shouldn't match w/ a sub-set of a string"""
  535. sol = re.compile('^')
  536. AreEqual(sol.match('bazbar', 1, 2), None)
  537. AreEqual(sol.match('foobar', 1, 2), None)
  538. def test_escape_backslash():
  539. x = re.compile (r"[\\A-Z\.\+]")
  540. AreEqual(x.search('aaaA\\B\\Caaa').span(), (3,4))
  541. def test_eol():
  542. r = re.compile(r'<(/|\Z)')
  543. s = r.search("<", 0)
  544. Assert(s != None)
  545. AreEqual(s.span(), (0, 1))
  546. AreEqual(s.group(0), '<')
  547. AreEqual(r.search("<Z", 0), None)
  548. def test_lastindex():
  549. for (pat, index) in [
  550. ('(a)b', 1), ('((a)(b))', 1), ('((ab))', 1),
  551. ('(a)(b)', 2),
  552. ('(a)?ab', None),
  553. ('(a)?b', 1),
  554. ]:
  555. AreEqual(re.match(pat, 'ab').lastindex, index)
  556. for (pat, index) in [
  557. ('(a)ab', 1),
  558. ('(a)(a)b', 2),
  559. ('(a)(a)(b)', 3),
  560. ('((a)a(b))', 1),
  561. ('((a)(a)(b))', 1),
  562. ('(a(a)(b))', 1),
  563. ('(a(a)?(b))', 1),
  564. ('(aa(a)?(b))', 1),
  565. ('(aa(b))', 1),
  566. ('(a(ab))', 1),
  567. ('(a)?ab', 1),
  568. ('a(a)?ab', None),
  569. ('a(a)?(a)?b', 1),
  570. ('a(a)?(a)?(b)', 3),
  571. ('a(a)b', 1),
  572. ('(a(a))(b)', 3),
  573. ('(a(a))b', 1),
  574. ('((a)(a))(b)', 4),
  575. ('((a)(a))b', 1),
  576. ]:
  577. AreEqual(re.match(pat, 'aab').lastindex, index)
  578. def test_empty_split():
  579. cases =[
  580. ('', ['']),
  581. ('*', ['*']),
  582. (':', ['', '']),
  583. ('::', ['', '']),
  584. ('a::', ['a', '']),
  585. ('::b', ['', 'b']),
  586. (':c:', ['', 'c', '']),
  587. (':\t: ', ['', '\t', ' ']),
  588. ('a:b::c', ['a', 'b', 'c']),
  589. (':a:b::c', ['', 'a', 'b', 'c']),
  590. ('::a:b::c:', ['', 'a', 'b', 'c', '']),
  591. ]
  592. for expr, result in cases:
  593. AreEqual(re.split(":*", expr), result)
  594. @skip("win32", "silverlight")
  595. def test_cp15298():
  596. import time
  597. tmin_compiled = 100
  598. tmin_string = 100
  599. regex = "^" + "\d\.\d\.\d \(IronPython \d\.\d(\.\d)? ((Alpha )|(Beta )|())\(\d\.\d\.\d\.\d{3,4}\) on \.NET \d(\.\d{1,5}){3}\)" * 15 + "$"
  600. match_str = "2.5.0 (IronPython 2.0 Beta (2.0.0.1000) on .NET 2.0.50727.1433)" * 15
  601. compiled_regex = re.compile(regex)
  602. for i in xrange(100):
  603. t0 = time.time()
  604. for i in xrange(250):
  605. retval = compiled_regex.match(match_str)
  606. t1 = time.time()
  607. Assert(retval != None)
  608. if t1-t0 < tmin_compiled:
  609. tmin_compiled = t1-t0
  610. t0 = time.time()
  611. for i in xrange(250):
  612. retval = re.match(regex, match_str)
  613. t1 = time.time()
  614. Assert(retval != None)
  615. if t1-t0 < tmin_string:
  616. tmin_string = t1-t0
  617. Assert(tmin_compiled<=tmin_string, "re.compile(...).match(...) is slower than re.match(..., ...)")
  618. def test_cp11136():
  619. regex = re.compile(r"^(?P<msg>NMAKE[A-Za-z0-9]*)'\"?(?P<file>[\\A-Za-z0-9/:_\.\+]+)" )
  620. Assert(regex.search(r"NMAKE0119'adirectory\afile.txt")!=None)
  621. def test_cp17111():
  622. test_cases = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789~!@#%&_+-=]{};':,.//<>" + '"'
  623. for x in test_cases:
  624. regex = re.compile(r".*\\%s" % x)
  625. Assert(regex.search(r"\\%s" % x)!=None)
  626. Assert(regex.search(r"")==None)
  627. def test_cp1089():
  628. test_cases = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789~!@#%&_+-=]{};':,.//<>" + '"'
  629. for x in test_cases:
  630. #Just make sure they don't throw
  631. temp = re.compile('\\\\' + x)
  632. def test_cp16657():
  633. Assert(re.compile(r'^bar', re.M).search('foo\nbar') != None)
  634. Assert(re.compile(r'^bar(?m)').search('foo\nbar') != None)
  635. Assert(re.compile(r'^bar', re.M).search('foo\nbaar') == None)
  636. Assert(re.compile(r'^bar(?m)').search('foo\nbaar') == None)
  637. Assert(re.compile(r'^bar', re.U).search('bar') != None)
  638. Assert(re.compile(r'^bar(?u)').search('bar') != None)
  639. Assert(re.compile(r'^bar', re.U).search('baar') == None)
  640. Assert(re.compile(r'^bar(?u)').search('baar') == None)
  641. Assert(re.compile(r' b ar ', re.X).search('bar') != None)
  642. Assert(re.compile(r'b ar(?x)').search('bar') != None)
  643. Assert(re.compile(r' b ar ', re.X).search('baar') == None)
  644. Assert(re.compile(r'b ar(?x)').search('baar') == None)
  645. Assert(re.compile(r'b ar').search('bar') == None)
  646. def test_n_m_quantifier():
  647. AreEqual(re.search('ab{,2}a', 'abba').span(), (0, 4))
  648. AreEqual(re.search('ab{,2}a', 'aba').span(), (0, 3))
  649. AreEqual(re.search('ab{,2}a', 'abbba'), None)
  650. AreEqual(re.search('ab{,2}a', 'abba').span(), re.search('ab{0,2}a', 'abba').span())
  651. AreEqual(re.search('ab{0,2}a', 'abbba'), None)
  652. AreEqual(re.search('ab{2,}a', 'abba').span(), (0,4))
  653. AreEqual(re.search('ab{2,}a', 'abbba').span(), (0,5))
  654. AreEqual(re.search('ab{2,}a', 'aba'), None)
  655. run_test(__name__)