mapres 3.dev16__py3-none-any.whl → 3.dev18__py3-none-any.whl

mapres/evaluator.py

@@ -14,73 +14,45 @@ class Evaluator:
         self.ctx = ctx or {}
         self._seen = set()  # cycle detection
 
-    # public api
     def evaluate(self, node):
         return self._eval(node)
 
-    # internal dispatch
     def _eval(self, node):
         if isinstance(node, TemplateNode):
             return self._eval_template(node)
-
         if isinstance(node, TextNode):
             return node.text
-
         if isinstance(node, IdentNode):
             return self._eval_ident(node)
-
         if isinstance(node, CallNode):
             return self._eval_call(node)
-
         raise EvaluationError(f'Unknown AST node: {node}')
 
-    # template
     def _eval_template(self, node: TemplateNode):
         parts = []
         for child in node.children:
             parts.append(self._eval(child))
         out = ''.join(parts)
 
-        # recursion over full template output
-        if self._has_recursive_maps():
-            seen = set()
-            depth = 0
-            max_depth = self._get_max_depth()
-
-            while depth < max_depth:
-                new_out = self._re_resolve(out)
-                if new_out == out:
-                    break
-                if new_out in seen:
-                    raise EvaluationError('Cycle detected in template recursion')
-                seen.add(new_out)
-                out = new_out
-                depth += 1
-
+        # recursion disabled for now
         return out
 
-    # identifier
     def _eval_ident(self, node: IdentNode):
         name = node.name
 
-        # ignore_delimiters: treat token as literal for this syntax
-        if self._syntax_ignores_delimiters(node.syntax):
-            return self._literal_from_syntax(name, node.syntax)
-
-        # cycle detection
         if name in self._seen:
             raise EvaluationError(f"Cycle detected in identifier '{name}'")
         self._seen.add(name)
 
         parts = name.split('.')
 
-        # 1. ctx first
+        # ctx first
         val = self._lookup_hierarchical(self.ctx, parts)
         if val is not None:
             self._seen.remove(name)
             return str(val)
 
-        # 2. syntax-bound maps
+        # syntax-bound maps
         for m in self.layerstack.all_maps():
             if getattr(m, '__syntax__', None) not in (None, node.syntax):
                 continue
@@ -94,15 +66,9 @@ class Evaluator:
         self._seen.remove(name)
         raise MissingKeyError(name)
 
-    # call (nested token)
     def _eval_call(self, node: CallNode):
         outer = node.name
 
-        # ignore_delimiters: treat call token as literal
-        if self._syntax_ignores_delimiters(node.syntax):
-            arg_text = self._eval(node.arg)
-            return self._literal_from_syntax(outer, node.syntax, is_call=True, arg_text=arg_text)
-
         if outer in self._seen:
             raise EvaluationError(f"Cycle detected in call '{outer}'")
         self._seen.add(outer)
@@ -130,7 +96,6 @@ class Evaluator:
         self._seen.remove(outer)
         raise MissingKeyError(f'{outer}({arg_value})')
 
-    # helpers
     def _map_to_dict(self, m):
         if hasattr(m, 'as_map'):
             return m.as_map()
@@ -148,74 +113,14 @@ class Evaluator:
             cur = cur[p]
         return cur
 
+    # recursion helpers now unused
     def _has_recursive_maps(self):
-        for m in self.layerstack.all_maps():
-            if getattr(m, '__recursive__', False):
-                return True
         return False
 
     def _get_max_depth(self):
-        depths = [
-            getattr(m, '__max_depth__', 10)
-            for m in self.layerstack.all_maps()
-            if getattr(m, '__recursive__', False)
-        ]
-        return max(depths) if depths else 0
+        return 0
 
     def _re_resolve(self, text: str) -> str:
         tokens = Tokenizer(text).tokenize()
         ast = Parser(tokens).parse()
         return self.evaluate(ast)
-
-    def _syntax_ignores_delimiters(self, syntax_name: str) -> bool:
-        for m in self.layerstack.all_maps():
-            if getattr(m, '__syntax__', None) == syntax_name:
-                if getattr(m, '__ignore_delimiters__', False):
-                    return True
-        return False
-
-    def _literal_from_syntax(self, name: str, syntax_name: str, is_call: bool = False, arg_text: str | None = None) -> str:
-        if not is_call:
-            if syntax_name == 'colons':
-                return f':{name}:'
-            if syntax_name == 'braces':
-                return f'{{{{{name}}}}}'
-            if syntax_name == 'dollars':
-                return f'${{{name}}}'
-            if syntax_name == 'angles':
-                return f'<{name}>'
-            if syntax_name == 'pipes':
-                return f'|{name}|'
-            if syntax_name == 'percents':
-                return f'%{name}%'
-            if syntax_name == 'paren_dollars':
-                return f'$({name})'
-            if syntax_name == 'at_tags':
-                return f'@{name}@'
-            if syntax_name == 'hash_tags':
-                return f'#{name}#'
-            return name
-
-        # call literal: syntax-specific wrapping of name(arg_text)
-        arg = arg_text or ''
-        inner = f'{name}({arg})'
-
-        if syntax_name == 'colons':
-            return f':{inner}:'
-        if syntax_name == 'braces':
-            return f'{{{{{inner}}}}}'
-        if syntax_name == 'dollars':
-            return f'${{{inner}}}'
-        if syntax_name == 'angles':
-            return f'<{inner}>'
-        if syntax_name == 'pipes':
-            return f'|{inner}|'
-        if syntax_name == 'percents':
-            return f'%{inner}%'
-        if syntax_name == 'paren_dollars':
-            return f'$({inner})'
-        if syntax_name == 'at_tags':
-            return f'@{inner}@'
-        if syntax_name == 'hash_tags':
-            return f'#{inner}#'
-        return inner

{mapres-3.dev16.dist-info → mapres-3.dev18.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: mapres
-Version: 3.dev16
+Version: 3.dev18
 Summary: A powerfull mapping utility
 Author: iFamished
 License: MIT

{mapres-3.dev16.dist-info → mapres-3.dev18.dist-info}/RECORD

@@ -2,7 +2,7 @@ mapres/__init__.py,sha256=t23ofM-wzpPByYi1rEQonxyU1yyza4ZzwwHDZUa5QqA,1010
 mapres/ast.py,sha256=6PcMkwtNHYD8xEkdyzDgn_mRTj1ZaWSyuHZK3BtXiuo,427
 mapres/cache.py,sha256=hbvsoc6Qw3RhWAEfOOpKHtC7i9EomoUgWzyd4dnH71w,333
 mapres/datamap.py,sha256=v9DAIYaS-vkBU1BKmshGYnquZa2JPwcct661zaEFocs,5256
-mapres/evaluator.py,sha256=ElKliQ4z0vSTFHtbTxSafRBVrPpksjqFjq5spKKEFwI,6962
+mapres/evaluator.py,sha256=19oUC5BGqMz0j0SDsE_FJkL7C6HR4DTDlztvAJR-HkU,3631
 mapres/exceptions.py,sha256=D2XKnrMkZDyUXQt2PmaKbj08FObWU00yXKGHwNpjvww,222
 mapres/layers.py,sha256=sFc1eUOBg2BoB2cBXIleq8RMYcg5GZpUoCnGh-uKN6U,1380
 mapres/parser.py,sha256=8XLCzYosvh81bN-Jddc1AM4w0X7bsHnBzmA8sq5_72w,4018
@@ -11,8 +11,8 @@ mapres/tokenizer.py,sha256=js0S1s8MkltdQoH5V1cLjdY0fFqZoGqmtP_OhEJEM6M,6539
 mapres/maps/__init__.py,sha256=lIRRfem1Fw4iynuwUQ7BY5qrC4fbJKxqLivao2_Dtm4,239
 mapres/maps/color.py,sha256=noRTGFNo9xLl5YEhX0tttV6i_oDAiptXmRVnkr5EzwM,1348
 mapres/maps/time.py,sha256=TyncycYoIGVZWps32qWlFy2a2hTayvZWVHu9uh2nid8,2050
-mapres-3.dev16.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
-mapres-3.dev16.dist-info/METADATA,sha256=KHiZBTclH89lWV6Kr85_SIuH3igO8i6fm6tarBaD0lE,1476
-mapres-3.dev16.dist-info/WHEEL,sha256=K260EYznzXsJYBQGqmI8VTxEdiZYNvDZwW9cBh9-_MA,91
-mapres-3.dev16.dist-info/top_level.txt,sha256=5LMVQqJdtyjxfzv7wJBOZ-360m0Yc79w_-Y7s3n6cTw,7
-mapres-3.dev16.dist-info/RECORD,,
+mapres-3.dev18.dist-info/licenses/LICENSE,sha256=OXLcl0T2SZ8Pmy2_dmlvKuetivmyPd5m1q-Gyd-zaYY,35149
+mapres-3.dev18.dist-info/METADATA,sha256=5Kx-vfrbYympon_lWZsDhJagWAcOKQI51mvKC3D1-Cc,1476
+mapres-3.dev18.dist-info/WHEEL,sha256=K260EYznzXsJYBQGqmI8VTxEdiZYNvDZwW9cBh9-_MA,91
+mapres-3.dev18.dist-info/top_level.txt,sha256=5LMVQqJdtyjxfzv7wJBOZ-360m0Yc79w_-Y7s3n6cTw,7
+mapres-3.dev18.dist-info/RECORD,,