sonolus.py 0.6.0__tar.gz → 0.6.2__tar.gz

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: sonolus.py
-Version: 0.6.0
+Version: 0.6.2
 Summary: Sonolus engine development in Python
 License-File: LICENSE
 Requires-Python: >=3.12

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "sonolus.py"
-version = "0.6.0"
+version = "0.6.2"
 description = "Sonolus engine development in Python"
 readme = "README.md"
 requires-python = ">=3.12"

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/sonolus/script/array_like.py

@@ -16,7 +16,7 @@ from sonolus.script.values import copy
 # Note: we don't use Range in this file because Range itself inherits from ArrayLike
 
 
-class ArrayLike[T](Sequence):
+class ArrayLike[T](Sequence[T]):
     """Mixin for array-like objects.
 
     Inheritors must implement `__len__`, `__getitem__`, and `__setitem__`.
@@ -190,7 +190,7 @@ class ArrayLike[T](Sequence):
             key: A one-argument ordering function to use for comparison.
             reverse: If `True`, sort in descending order, otherwise sort in ascending order.
         """
-        if len(self) < 15 or key is not None:
+        if key is not None or len(self) < 15:
             if key is None:
                 key = _identity  # type: ignore
             # May be worth adding a block sort variant for better performance on large arrays in the future

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/sonolus/script/containers.py

@@ -1,5 +1,7 @@
 from __future__ import annotations
 
+from typing import Self
+
 from sonolus.backend.visitor import compile_and_call
 from sonolus.script.array import Array
 from sonolus.script.array_like import ArrayLike, get_positive_index
@@ -102,7 +104,7 @@ class VarArray[T, Capacity](Record, ArrayLike[T]):
     _array: Array[T, Capacity]
 
     @classmethod
-    def new(cls):
+    def new(cls) -> Self:
         """Create a new empty array."""
         element_type = cls.type_var_value(T)
         capacity = cls.type_var_value(Capacity)
@@ -380,7 +382,7 @@ class ArraySet[T, Capacity](Record):
     _values: VarArray[T, Capacity]
 
     @classmethod
-    def new(cls):
+    def new(cls) -> Self:
         """Create a new empty set."""
         element_type = cls.type_var_value(T)
         capacity = cls.type_var_value(Capacity)
@@ -394,7 +396,7 @@ class ArraySet[T, Capacity](Record):
         """Return whether the given value is present in the set."""
         return value in self._values
 
-    def __iter__(self):
+    def __iter__(self) -> SonolusIterator[T]:
         """Return an iterator over the values in the set."""
         return self._values.__iter__()
 
@@ -457,7 +459,7 @@ class ArrayMap[K, V, Capacity](Record):
     _array: Array[_ArrayMapEntry[K, V], Capacity]
 
     @classmethod
-    def new(cls):
+    def new(cls) -> Self:
         """Create a new empty map."""
         key_type = cls.type_var_value(K)
         value_type = cls.type_var_value(V)
@@ -489,7 +491,7 @@ class ArrayMap[K, V, Capacity](Record):
         """Return an iterator over the key-value pairs in the map."""
         return _ArrayMapEntryIterator(self, 0)
 
-    def __iter__(self):
+    def __iter__(self) -> SonolusIterator[K]:
         """Return an iterator over the keys in the map."""
         return self.keys()
 

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/sonolus/script/globals.py

@@ -239,6 +239,7 @@ def level_memory[T](cls: type[T]) -> T:
     ([`preprocess`][sonolus.script.archetype.PlayArchetype.preprocess],
     [`update_sequential`][sonolus.script.archetype.PlayArchetype.update_sequential],
     [`touch`][sonolus.script.archetype.PlayArchetype.touch]).
+    Compared to level data, it allows modification during gameplay, but prevents some optimizations.
 
     Usage:
         ```python
@@ -246,7 +247,7 @@ def level_memory[T](cls: type[T]) -> T:
         class LevelMemory:
             variable: int
 
-        variable = level_data(Array[int, 10])
+        variable = level_memory(Array[int, 10])
 
         def f():
             LevelMemory.variable = 1
@@ -269,6 +270,8 @@ def level_data[T](cls: type[T]) -> T:
     """Define level data.
 
     Level data may only be modified during [`preprocess`][sonolus.script.archetype.PlayArchetype.preprocess].
+    Compared to level memory, it enables some optimizations during gameplay, so it's recommended to use it
+    if mutation is only needed during preprocessing.
 
     Usage:
         ```python

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/sonolus/script/internal/builtin_impls.py

@@ -84,7 +84,7 @@ def _zip(*iterables, strict: bool = False):
     from sonolus.backend.visitor import compile_and_call
     from sonolus.script.containers import Pair
 
-    if validate_value(strict)._as_py_():
+    if validate_value(strict)._as_py_():  # type: ignore
         raise NotImplementedError("Strict zipping is not supported")
 
     if not iterables:

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/sonolus/script/internal/impl.py

@@ -92,7 +92,7 @@ def try_validate_value(value: Any) -> Value | None:
             Union,
         }:
             return TypingSpecialFormConstant.of(special_form)
-        case other_type if get_origin(value) in {Literal, Annotated, UnionType, tuple}:
+        case other_type if get_origin(value) in {Literal, Annotated, UnionType, tuple, type}:
             return BasicConstantValue.of(other_type)
         case _GlobalPlaceholder():
             return value.get()

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/sonolus/script/record.py

@@ -230,6 +230,8 @@ class Record(GenericValue, metaclass=RecordMeta):
         result = []
         for field in cls._fields_:
             result.extend(field.type._flat_keys_(f"{prefix}.{field.name}"))
+        if len(result) == 1:
+            return [prefix]
         return result
 
     def _get_(self) -> Self:

{sonolus_py-0.6.0 → sonolus_py-0.6.2}/uv.lock

@@ -1,5 +1,5 @@
 version = 1
-revision = 3
+revision = 2
 requires-python = ">=3.12"
 
 [[package]]
@@ -694,7 +694,7 @@ wheels = [
 
 [[package]]
 name = "sonolus-py"
-version = "0.6.0"
+version = "0.6.2"
 source = { editable = "." }
 
 [package.dev-dependencies]