Gecko [ renovalkoronred.com.tr ]

Name	Size	Permission
__pycache__	[ DIR ]	drwxr-xr-x
__init__.py	2.15 KB	-rw-r--r--
_identifier.py	1.73 KB	-rw-r--r--
async_utils.py	1.9 KB	-rw-r--r--
bccache.py	12.37 KB	-rw-r--r--
compiler.py	70.52 KB	-rw-r--r--
constants.py	1.4 KB	-rw-r--r--
debug.py	8.29 KB	-rw-r--r--
defaults.py	1.24 KB	-rw-r--r--
environment.py	59.55 KB	-rw-r--r--
exceptions.py	4.95 KB	-rw-r--r--
ext.py	31.37 KB	-rw-r--r--
filters.py	51.38 KB	-rw-r--r--
idtracking.py	10.47 KB	-rw-r--r--
lexer.py	29.23 KB	-rw-r--r--
loaders.py	22.22 KB	-rw-r--r--
meta.py	4.29 KB	-rw-r--r--
nativetypes.py	3.88 KB	-rw-r--r--
nodes.py	33.74 KB	-rw-r--r--
optimizer.py	1.61 KB	-rw-r--r--
parser.py	38.83 KB	-rw-r--r--
py.typed	0 B	-rw-r--r--
runtime.py	34.23 KB	-rw-r--r--
sandbox.py	14.26 KB	-rw-r--r--
tests.py	5.77 KB	-rw-r--r--
utils.py	26.34 KB	-rw-r--r--
visitor.py	3.49 KB	-rw-r--r--

Name

Size

Permission

Action

__pycache__

[ DIR ]

drwxr-xr-x

__init__.py

2.15 KB

-rw-r--r--

_identifier.py

1.73 KB

-rw-r--r--

async_utils.py

1.9 KB

-rw-r--r--

bccache.py

12.37 KB

-rw-r--r--

compiler.py

70.52 KB

-rw-r--r--

constants.py

1.4 KB

-rw-r--r--

debug.py

8.29 KB

-rw-r--r--

defaults.py

1.24 KB

-rw-r--r--

environment.py

59.55 KB

-rw-r--r--

exceptions.py

4.95 KB

-rw-r--r--

ext.py

31.37 KB

-rw-r--r--

filters.py

51.38 KB

-rw-r--r--

idtracking.py

10.47 KB

-rw-r--r--

lexer.py

29.23 KB

-rw-r--r--

loaders.py

22.22 KB

-rw-r--r--

meta.py

4.29 KB

-rw-r--r--

nativetypes.py

3.88 KB

-rw-r--r--

nodes.py

33.74 KB

-rw-r--r--

optimizer.py

1.61 KB

-rw-r--r--

parser.py

38.83 KB

-rw-r--r--

py.typed

0 B

-rw-r--r--

runtime.py

34.23 KB

-rw-r--r--

sandbox.py

14.26 KB

-rw-r--r--

tests.py

5.77 KB

-rw-r--r--

utils.py

26.34 KB

-rw-r--r--

visitor.py

3.49 KB

-rw-r--r--

Code Editor : optimizer.py

"""The optimizer tries to constant fold expressions and modify the AST
in place so that it should be faster to evaluate.

Because the AST does not contain all the scoping information and the
compiler has to find that out, we cannot do all the optimizations we
want. For example, loop unrolling doesn't work because unrolled loops
would have a different scope. The solution would be a second syntax tree
that stored the scoping rules.
"""
import typing as t

from . import nodes
from .visitor import NodeTransformer

if t.TYPE_CHECKING:
    from .environment import Environment

def optimize(node: nodes.Node, environment: "Environment") -> nodes.Node:
    """The context hint can be used to perform an static optimization
    based on the context given."""
    optimizer = Optimizer(environment)
    return t.cast(nodes.Node, optimizer.visit(node))

class Optimizer(NodeTransformer):
    def __init__(self, environment: "t.Optional[Environment]") -> None:
        self.environment = environment

def generic_visit(
        self, node: nodes.Node, *args: t.Any, **kwargs: t.Any
    ) -> nodes.Node:
        node = super().generic_visit(node, *args, **kwargs)

# Do constant folding. Some other nodes besides Expr have
        # as_const, but folding them causes errors later on.
        if isinstance(node, nodes.Expr):
            try:
                return nodes.Const.from_untrusted(
                    node.as_const(args[0] if args else None),
                    lineno=node.lineno,
                    environment=self.environment,
                )
            except nodes.Impossible:
                pass

return node

${this.title}

Code Editor : optimizer.py