implement SRE_Pattern.finditer as a generator

Author: timfel

graalpython/lib-graalpython/_sre.py

@@ -299,6 +299,22 @@ def __sanitize_out_type(self, elem):
         else:
             return str(elem)
 
+    def finditer(self, string, pos=0, endpos=-1):
+        self.__check_input_type(string)
+        if endpos > len(string):
+            endpos = len(string)
+        elif endpos < 0:
+            endpos = endpos % len(string) + 1
+        while pos < endpos:
+            result = tregex_call_exec(self.__tregex_compile(self.pattern).exec, string, pos)
+            if not result.isMatch:
+                break
+            else:
+                yield SRE_Match(self, pos, endpos, result)
+            no_progress = (result.start[0] == result.end[0])
+            pos = result.end[0] + no_progress
+        return
+
     def findall(self, string, pos=0, endpos=-1):
         self.__check_input_type(string)
         if endpos > len(string):
@@ -320,7 +336,6 @@ def findall(self, string, pos=0, endpos=-1):
             pos = result.end[0] + no_progress
         return matchlist
 
-
     def __replace_groups(self, repl, string, match_result, pattern):
         def group(match_result, group_nr, string):
             if group_nr >= match_result.groupCount: