Do not care about recursion limit (Python will)

sznqalibs/hoover.py

@@ -1021,7 +1021,7 @@ class Tracker(dict):
                     cw.writerow(argset)
 
 
-def dataMatch(pattern, data, rmax=10, _r=0):
+def dataMatch(pattern, data):
     """Check if data structure matches a pattern data structure.
 
     Supports lists, dictionaries and scalars (int, float, string).
@@ -1036,7 +1036,7 @@ def dataMatch(pattern, data, rmax=10, _r=0):
         assert all([hasattr(o, 'append') for o in [pattern, data]])
         results = []
         for pv in pattern:
-            if any([dataMatch(pv, dv, _r=_r+1) for dv in data]):
+            if any([dataMatch(pv, dv) for dv in data]):
                 results.append(True)
             else:
                 results.append(False)
@@ -1048,14 +1048,11 @@ def dataMatch(pattern, data, rmax=10, _r=0):
         results = []
         try:
             for pk, pv in pattern.items():
-                results.append(dataMatch(pv, data[pk], _r=_r+1))
+                results.append(dataMatch(pv, data[pk]))
         except KeyError:
             results.append(False)
         return all(results)
 
-    if _r == rmax:
-        raise RuntimeError("recursion limit hit")
-
     result = None
     if pattern == data:
         result = True
@@ -1318,7 +1315,6 @@ class Cartman:
     optimization became possible based on what was used.
     """
 
-
     # TODO: support for arbitrary ordering (profile / nginx)
     # TODO: implement getstats and fmtstats
     # TODO: N-wise
@@ -1332,13 +1328,9 @@ class Cartman:
     class Iterable(_BaseMark):
         pass
 
-    def __init__(self, source, scheme, recursion_limit=10, _r=0):
+    def __init__(self, source, scheme):
         self.source = source
         self.scheme = scheme
-        self.recursion_limit = recursion_limit
-        self._r = _r
-        if self._r > self.recursion_limit:
-            raise RuntimeError("recursion limit exceeded")
 
         # validate scheme + source and throw useful error
         scheme_ok = isinstance(self.scheme, collections.Mapping)
@@ -1374,7 +1366,7 @@ class Cartman:
         elif self._means_iterable(subscheme):
             return subsource
         else:   # try to use it as scheme
-            return iter(Cartman(subsource, subscheme, _r=self._r+1))
+            return iter(Cartman(subsource, subscheme))
 
     def __iter__(self):