Nuitka-winsvc 2.5.1__cp311-cp311-win_amd64.whl → 2.6__cp311-cp311-win_amd64.whl

nuitka/importing/Recursion.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Recursion into other modules.
@@ -21,7 +21,10 @@ from nuitka.plugins.Plugins import Plugins
 from nuitka.PythonVersions import python_version
 from nuitka.Tracing import recursion_logger
 from nuitka.utils.FileOperations import listDir
-from nuitka.utils.Importing import getSharedLibrarySuffixes
+from nuitka.utils.Importing import (
+    getPackageDirFilename,
+    getSharedLibrarySuffixes,
+)
 from nuitka.utils.ModuleNames import ModuleName
 
 from .Importing import (
@@ -334,13 +337,17 @@ def _addIncludedModule(module, package_only):
                     continue
 
                 if isPackageDir(sub_path) and not os.path.exists(sub_path + ".py"):
-                    checkPluginSinglePath(
+                    scanPluginSinglePath(
                         sub_path,
                         module_package=module.getFullName(),
                         package_only=False,
                     )
                 elif sub_filename.endswith(".py"):
-                    checkPluginSinglePath(
+                    if os.path.isdir(sub_path[:-3]):
+                        if getPackageDirFilename(sub_path[:-3]) is not None:
+                            continue
+
+                    scanPluginSinglePath(
                         sub_path,
                         module_package=module.getFullName(),
                         package_only=False,
@@ -351,7 +358,7 @@ def _addIncludedModule(module, package_only):
                             sub_filename.endswith(suffix)
                             and "." not in sub_filename[: -len(suffix)]
                         ):
-                            checkPluginSinglePath(
+                            scanPluginSinglePath(
                                 sub_path,
                                 module_package=module.getFullName(),
                                 package_only=False,
@@ -366,7 +373,7 @@ def _addIncludedModule(module, package_only):
         assert False, module
 
 
-def checkPluginSinglePath(plugin_filename, module_package, package_only):
+def scanPluginSinglePath(plugin_filename, module_package, package_only):
     # The importing wants these to be unique.
     plugin_filename = os.path.abspath(plugin_filename)
 
@@ -422,7 +429,7 @@ the compiled result, and therefore asking to include them makes no sense.
             )
 
 
-def checkPluginPath(plugin_filename, module_package):
+def scanPluginPath(plugin_filename, module_package):
     if Options.isShowInclusion():
         recursion_logger.info(
             "Checking top level inclusion path '%s' '%s'."
@@ -431,7 +438,7 @@ def checkPluginPath(plugin_filename, module_package):
 
     # Files and package directories are handled here.
     if os.path.isfile(plugin_filename) or isPackageDir(plugin_filename):
-        checkPluginSinglePath(
+        scanPluginSinglePath(
             plugin_filename,
             module_package=module_package,
             package_only=False,
@@ -443,7 +450,7 @@ def checkPluginPath(plugin_filename, module_package):
             assert sub_filename != "__init__.py"
 
             if isPackageDir(sub_path) or sub_path.endswith(".py"):
-                checkPluginSinglePath(
+                scanPluginSinglePath(
                     sub_path,
                     module_package=None,
                     package_only=False,
@@ -452,7 +459,7 @@ def checkPluginPath(plugin_filename, module_package):
 
             for suffix in getSharedLibrarySuffixes():
                 if sub_path.endswith(suffix):
-                    checkPluginSinglePath(
+                    scanPluginSinglePath(
                         sub_path,
                         module_package=None,
                         package_only=False,
@@ -464,7 +471,7 @@ def checkPluginPath(plugin_filename, module_package):
         )
 
 
-def checkPluginFilenamePattern(pattern):
+def scanPluginFilenamePattern(pattern):
     if Options.isShowInclusion():
         recursion_logger.info("Checking plug-in pattern '%s':" % pattern)
 
@@ -480,7 +487,7 @@ def checkPluginFilenamePattern(pattern):
             continue
 
         found = True
-        checkPluginSinglePath(
+        scanPluginSinglePath(
             filename,
             module_package=None,
             package_only=False,
@@ -566,6 +573,24 @@ def considerUsedModules(module, pass_count):
         )
 
 
+def scanIncludedPackage(package_name):
+    package_name, package_directory, _module_kind, finding = locateModule(
+        module_name=ModuleName(package_name),
+        parent_package=None,
+        level=0,
+    )
+
+    if finding != "absolute":
+        recursion_logger.sysexit(
+            "Error, failed to locate package '%s' you asked to include." % package_name
+        )
+
+    scanPluginPath(
+        plugin_filename=package_directory,
+        module_package=package_name.getPackageName(),
+    )
+
+
 #     Part of "Nuitka", an optimizing Python compiler that is compatible and
 #     integrates with CPython, but also works on its own.
 #

nuitka/importing/StandardLibrary.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Access to standard library distinction.

nuitka/importing/__init__.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Dummy file to make this directory a package. """

nuitka/nodes/AsyncgenNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Nodes for async generator objects and their creations.

nuitka/nodes/AttributeLookupNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Attribute lookup nodes, generic one and base for generated ones.

nuitka/nodes/AttributeNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Attribute nodes

nuitka/nodes/AttributeNodesGenerated.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 # We are not avoiding these in generated code at all

nuitka/nodes/BuiltinAllNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Batakrishna Sahu, mailto:<Batakrishna.Sahu@suiit.ac.in> find license text at end of file
+#     Copyright 2025, Batakrishna Sahu, mailto:<Batakrishna.Sahu@suiit.ac.in> find license text at end of file
 
 
 """ Node for the calls to the 'all' built-in.

nuitka/nodes/BuiltinAnyNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Batakrishna Sahu, mailto:<Batakrishna.Sahu@suiit.ac.in> find license text at end of file
+#     Copyright 2025, Batakrishna Sahu, mailto:<Batakrishna.Sahu@suiit.ac.in> find license text at end of file
 
 
 """ Node for the calls to the 'any' built-in.

nuitka/nodes/BuiltinComplexNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node for the calls to the 'complex' built-in.

nuitka/nodes/BuiltinDecodingNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Built-in ord/chr nodes

nuitka/nodes/BuiltinDecoratorNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Built-in staticmethod/classmethod nodes

nuitka/nodes/BuiltinDictNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node for the calls to the 'dict' built-in.

nuitka/nodes/BuiltinFormatNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Format related nodes format/bin/oct/hex/ascii.

nuitka/nodes/BuiltinHashNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node the calls to the 'hash' built-in.

nuitka/nodes/BuiltinInputNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node the calls to the 'input' built-in.

nuitka/nodes/BuiltinIntegerNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node for the calls to the 'int' and 'long' (Python2) built-ins.

nuitka/nodes/BuiltinIteratorNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Built-in iterator nodes.
@@ -20,7 +20,7 @@ from .NodeMakingHelpers import (
     makeRaiseTypeErrorExceptionReplacementFromTemplateAndValue,
     wrapExpressionWithSideEffects,
 )
-from .shapes.StandardShapes import tshape_iterator
+from .shapes.IteratorShapes import tshape_iterator
 from .StatementBasesGenerated import (
     StatementSpecialUnpackCheckBase,
     StatementSpecialUnpackCheckFromIteratedBase,

nuitka/nodes/BuiltinLenNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Built-in iterator nodes.

nuitka/nodes/BuiltinNextNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node for the calls to the 'next' built-in and unpacking special next.

nuitka/nodes/BuiltinOpenNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node the calls to the 'open' built-in.

nuitka/nodes/BuiltinOperationNodeBasesGenerated.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 # We are not avoiding these in generated code at all

nuitka/nodes/BuiltinRangeNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node the calls to the 'range' built-in.

nuitka/nodes/BuiltinRefNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Tree nodes for built-in references.

nuitka/nodes/BuiltinSumNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node the calls to the 'sum' built-in.

nuitka/nodes/BuiltinTypeNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Built-in type nodes tuple/list/set/float/str/unicode etc.

nuitka/nodes/BuiltinVarsNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Builtin vars node.

nuitka/nodes/BytesNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Nodes that build and operate on bytes (Python3).

nuitka/nodes/CallNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Call node

nuitka/nodes/Checkers.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node children checkers.

nuitka/nodes/ChildrenHavingMixins.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 # We are not avoiding these in generated code at all
@@ -13025,7 +13025,7 @@ class ChildrenHavingPackageResourceEncodingOptionalErrorsOptionalMixin(object):
     #   ExpressionImportlibResourcesBackportReadText
     #   ExpressionImportlibResourcesBackportReadTextCall
     #   ExpressionImportlibResourcesReadText
-    #   ExpressionImportlibResourcesReadTextCall
+    #   ExpressionImportlibResourcesReadTextBefore313Call
 
     def __init__(
         self,
@@ -13216,11 +13216,235 @@ ChildrenExpressionImportlibResourcesBackportReadTextCallMixin = (
 ChildrenExpressionImportlibResourcesReadTextMixin = (
     ChildrenHavingPackageResourceEncodingOptionalErrorsOptionalMixin
 )
-ChildrenExpressionImportlibResourcesReadTextCallMixin = (
+ChildrenExpressionImportlibResourcesReadTextBefore313CallMixin = (
     ChildrenHavingPackageResourceEncodingOptionalErrorsOptionalMixin
 )
 
 
+class ChildrenHavingPackageOptionalResourcesTupleEncodingOptionalErrorsOptionalMixin(
+    object
+):
+    # Mixins are not allowed to specify slots, pylint: disable=assigning-non-slot
+    __slots__ = ()
+
+    # This is generated for use in
+    #   ExpressionImportlibResourcesReadText
+    #   ExpressionImportlibResourcesReadTextSince313Call
+
+    def __init__(
+        self,
+        package,
+        resources,
+        encoding,
+        errors,
+    ):
+        if package is not None:
+            package.parent = self
+
+        self.subnode_package = package
+
+        assert type(resources) is tuple
+
+        for val in resources:
+            val.parent = self
+
+        self.subnode_resources = resources
+
+        if encoding is not None:
+            encoding.parent = self
+
+        self.subnode_encoding = encoding
+
+        if errors is not None:
+            errors.parent = self
+
+        self.subnode_errors = errors
+
+    def getVisitableNodes(self):
+        """The visitable nodes, with tuple values flattened."""
+
+        result = []
+        value = self.subnode_package
+        if value is None:
+            pass
+        else:
+            result.append(value)
+        result.extend(self.subnode_resources)
+        value = self.subnode_encoding
+        if value is None:
+            pass
+        else:
+            result.append(value)
+        value = self.subnode_errors
+        if value is None:
+            pass
+        else:
+            result.append(value)
+        return tuple(result)
+
+    def getVisitableNodesNamed(self):
+        """Named children dictionary.
+
+        For use in cloning nodes, debugging and XML output.
+        """
+
+        return (
+            ("package", self.subnode_package),
+            ("resources", self.subnode_resources),
+            ("encoding", self.subnode_encoding),
+            ("errors", self.subnode_errors),
+        )
+
+    def replaceChild(self, old_node, new_node):
+        value = self.subnode_package
+        if old_node is value:
+            if new_node is not None:
+                new_node.parent = self
+
+            self.subnode_package = new_node
+
+            return
+
+        value = self.subnode_resources
+        if old_node in value:
+            if new_node is not None:
+                new_node.parent = self
+
+                self.subnode_resources = tuple(
+                    (val if val is not old_node else new_node) for val in value
+                )
+            else:
+                self.subnode_resources = tuple(
+                    val for val in value if val is not old_node
+                )
+
+            return
+
+        value = self.subnode_encoding
+        if old_node is value:
+            if new_node is not None:
+                new_node.parent = self
+
+            self.subnode_encoding = new_node
+
+            return
+
+        value = self.subnode_errors
+        if old_node is value:
+            if new_node is not None:
+                new_node.parent = self
+
+            self.subnode_errors = new_node
+
+            return
+
+        raise AssertionError("Didn't find child", old_node, "in", self)
+
+    def getCloneArgs(self):
+        """Get clones of all children to pass for a new node.
+
+        Needs to make clones of child nodes too.
+        """
+
+        values = {
+            "package": (
+                self.subnode_package.makeClone()
+                if self.subnode_package is not None
+                else None
+            ),
+            "resources": tuple(v.makeClone() for v in self.subnode_resources),
+            "encoding": (
+                self.subnode_encoding.makeClone()
+                if self.subnode_encoding is not None
+                else None
+            ),
+            "errors": (
+                self.subnode_errors.makeClone()
+                if self.subnode_errors is not None
+                else None
+            ),
+        }
+
+        values.update(self.getDetails())
+
+        return values
+
+    def finalize(self):
+        del self.parent
+
+        if self.subnode_package is not None:
+            self.subnode_package.finalize()
+        del self.subnode_package
+        for c in self.subnode_resources:
+            c.finalize()
+        del self.subnode_resources
+        if self.subnode_encoding is not None:
+            self.subnode_encoding.finalize()
+        del self.subnode_encoding
+        if self.subnode_errors is not None:
+            self.subnode_errors.finalize()
+        del self.subnode_errors
+
+    def computeExpressionRaw(self, trace_collection):
+        """Compute an expression.
+
+        Default behavior is to just visit the child expressions first, and
+        then the node "computeExpression". For a few cases this needs to
+        be overloaded, e.g. conditional expressions.
+        """
+
+        # First apply the sub-expressions, as they are evaluated before
+        # the actual operation.
+        for count, sub_expression in enumerate(self.getVisitableNodes()):
+            expression = trace_collection.onExpression(sub_expression)
+
+            if expression.willRaiseAnyException():
+                sub_expressions = self.getVisitableNodes()
+
+                wrapped_expression = wrapExpressionWithSideEffects(
+                    side_effects=sub_expressions[:count],
+                    old_node=sub_expression,
+                    new_node=expression,
+                )
+
+                return (
+                    wrapped_expression,
+                    "new_raise",
+                    lambda: "For '%s' the child expression '%s' will raise."
+                    % (self.getChildNameNice(), expression.getChildNameNice()),
+                )
+
+        # Then ask ourselves to work on it.
+        return self.computeExpression(trace_collection)
+
+    def collectVariableAccesses(self, emit_read, emit_write):
+        """Collect variable reads and writes of child nodes."""
+
+        subnode_package = self.subnode_package
+
+        if subnode_package is not None:
+            self.subnode_package.collectVariableAccesses(emit_read, emit_write)
+        for element in self.subnode_resources:
+            element.collectVariableAccesses(emit_read, emit_write)
+        subnode_encoding = self.subnode_encoding
+
+        if subnode_encoding is not None:
+            self.subnode_encoding.collectVariableAccesses(emit_read, emit_write)
+        subnode_errors = self.subnode_errors
+
+        if subnode_errors is not None:
+            self.subnode_errors.collectVariableAccesses(emit_read, emit_write)
+
+
+# Assign the names that are easier to import with a stable name.
+ChildrenExpressionImportlibResourcesReadTextMixin = (
+    ChildrenHavingPackageOptionalResourcesTupleEncodingOptionalErrorsOptionalMixin
+)
+ChildrenExpressionImportlibResourcesReadTextSince313CallMixin = (
+    ChildrenHavingPackageOptionalResourcesTupleEncodingOptionalErrorsOptionalMixin
+)
+
+
 class ChildrenHavingPackageOrRequirementResourceNameMixin(object):
     # Mixins are not allowed to specify slots, pylint: disable=assigning-non-slot
     __slots__ = ()

nuitka/nodes/ClassNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Nodes for classes and their creations.

nuitka/nodes/CodeObjectSpecs.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Code object specifications.
@@ -97,9 +97,9 @@ class CodeObjectSpec(object):
         self.filename = co_filename
         self.line_number = int(co_lineno)
 
-        if type(co_has_starlist) is not bool:
+        if type(co_new_locals) is not bool:
             co_new_locals = co_new_locals != "False"
-        if type(co_has_starlist) is not bool:
+        if type(co_is_optimized) is not bool:
             co_is_optimized = co_is_optimized != "False"
 
         self.new_locals = co_new_locals
@@ -111,7 +111,7 @@ class CodeObjectSpec(object):
     def __repr__(self):
         return (
             """\
-<CodeObjectSpec %(co_kind)s '%(co_name)s' with %(co_varnames)r>"""
+<CodeObjectSpec %(co_kind)s '%(co_name)s' with var_names %(co_varnames)r>"""
             % self.getDetails()
         )
 

nuitka/nodes/ComparisonNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Nodes for comparisons.

nuitka/nodes/ConditionalNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Conditional nodes.

nuitka/nodes/ConstantRefNodes.py

@@ -1,4 +1,4 @@
-#     Copyright 2024, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
+#     Copyright 2025, Kay Hayen, mailto:kay.hayen@gmail.com find license text at end of file
 
 
 """ Node for constant expressions. Can be all common built-in types.