koro 2.0.0rc3__tar.gz → 2.0.2__tar.gz

{koro-2.0.0rc3 → koro-2.0.2}/LICENSE

@@ -1,24 +1,24 @@
-This is free and unencumbered software released into the public domain.
-
-Anyone is free to copy, modify, publish, use, compile, sell, or
-distribute this software, either in source code form or as a compiled
-binary, for any purpose, commercial or non-commercial, and by any
-means.
-
-In jurisdictions that recognize copyright laws, the author or authors
-of this software dedicate any and all copyright interest in the
-software to the public domain. We make this dedication for the benefit
-of the public at large and to the detriment of our heirs and
-successors. We intend this dedication to be an overt act of
-relinquishment in perpetuity of all present and future rights to this
-software under copyright law.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
-OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
-ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
-OTHER DEALINGS IN THE SOFTWARE.
-
-For more information, please refer to <https://unlicense.org>
+This is free and unencumbered software released into the public domain.
+
+Anyone is free to copy, modify, publish, use, compile, sell, or
+distribute this software, either in source code form or as a compiled
+binary, for any purpose, commercial or non-commercial, and by any
+means.
+
+In jurisdictions that recognize copyright laws, the author or authors
+of this software dedicate any and all copyright interest in the
+software to the public domain. We make this dedication for the benefit
+of the public at large and to the detriment of our heirs and
+successors. We intend this dedication to be an overt act of
+relinquishment in perpetuity of all present and future rights to this
+software under copyright law.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
+OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
+
+For more information, please refer to <https://unlicense.org>

koro-2.0.2/PKG-INFO

@@ -0,0 +1,52 @@
+Metadata-Version: 2.1
+Name: koro
+Version: 2.0.2
+Summary: Tools for manipulating levels made in Marble Saga: Kororinpa
+Home-page: https://github.com/DigitalDetective47/koro
+Author: DigitalDetective47
+Author-email: ninji2701@gmail.com
+Project-URL: Bug Tracker, https://github.com/DigitalDetective47/koro/issues
+Project-URL: Documentation, https://github.com/DigitalDetective47/koro/wiki
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: License :: OSI Approved :: The Unlicense (Unlicense)
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: File Formats
+Classifier: Topic :: Games/Entertainment
+Classifier: Typing :: Typed
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+
+koro (stylized in all lowercase) is a Python package that can read and modify stages from *Marble Saga: Kororinpa*.
+
+# *Marble Saga: Kororinpa*
+
+*Marble Saga: Kororinpa* is a video game released for the Nintendo Wii in March of 2009 in North America; the game was released in PAL regions under the title *Marbles! Balance Challenge* in May of the same year. Like its predecessor *Kororinpa*/*Kororinpa: Marble Mania*, it is a ball‐rolling game which is very similar to the *Super Monkey Ball* series in which the player character is controlled by tilting the game world. This game makes use of the Wii Remote's motion control capabilities by using the orientation of the controller to manipulate the world.
+
+# Problems
+
+*Marble Saga: Kororinpa* included a stage editor in which parts could be created by combining junk parts collected within the main game. The game provides the player with 20 slots in which to save stages that they have created. During the time period following the game's release, players could share their created stages using the WiiConnect24 service. After WiiConnect24 shut down on the 28<sup>th</sup> of June 2013, sharing stages with other players became impossible through official means. Sharing save files is not possible through the Wii system menu as the game had online leaderboards for ten stages specifically designed for online competition. As a result, saves of this game are marked as protected and cannot be copied from the save manager present in the Wii system menu.
+
+# This package
+
+This package allows you to extract the saved stages from your save file and store them in their own files, and to import stages downloaded online into your existing save file. (This package does not provide tools to get saves to or from the Wii console, there is plenty of homebrew software already in existence for this purpose.) This package also contains reverse&hyphen;engineered replicas of the game's compression format used internally, allowing for stage substitution in mods.
+
+# Usage
+
+To install this package, simply run
+```
+pip install koro
+```
+in a command prompt. For detailed documentation of the contents of the package, please view the wiki. For basic users, simple command&hyphen;line tools are available in the `scripts` folder of this repository. **Use of these tools requires installing the package from PyPI.**
+
+## Playing downloaded stages
+
+`unpacker.py` is a script designed to inject stages downloaded online into your save file. Simply run the script with the stages, the data directory of your save file, and if injecting a single stage, the slot to inject it into. The stages should then appear in the **Friend** tab. To find the location of your save in Dophin, right&hyphen;click the game and select **Open Wii Save Folder**.
+
+## Uploading your stages
+
+`packer.py` is a script that allows you to easily extract and upload stages that you've created. Run the script with your save directory, destination (ZIP archive), and optionally which stages to export. This script only exports stages stored in the **Original** tab of the editor. To specify which stages to export, simply enter the stage numbers in the order that they should appear when downloaded. If a custom ordering is not specified, the default is to extract all 20 stages in the order that they appear in&hyphen;game. To share single levels, extract files from the resulting archive.

koro-2.0.2/README.md

@@ -0,0 +1,29 @@
+koro (stylized in all lowercase) is a Python package that can read and modify stages from *Marble Saga: Kororinpa*.
+
+# *Marble Saga: Kororinpa*
+
+*Marble Saga: Kororinpa* is a video game released for the Nintendo Wii in March of 2009 in North America; the game was released in PAL regions under the title *Marbles! Balance Challenge* in May of the same year. Like its predecessor *Kororinpa*/*Kororinpa: Marble Mania*, it is a ball‐rolling game which is very similar to the *Super Monkey Ball* series in which the player character is controlled by tilting the game world. This game makes use of the Wii Remote's motion control capabilities by using the orientation of the controller to manipulate the world.
+
+# Problems
+
+*Marble Saga: Kororinpa* included a stage editor in which parts could be created by combining junk parts collected within the main game. The game provides the player with 20 slots in which to save stages that they have created. During the time period following the game's release, players could share their created stages using the WiiConnect24 service. After WiiConnect24 shut down on the 28<sup>th</sup> of June 2013, sharing stages with other players became impossible through official means. Sharing save files is not possible through the Wii system menu as the game had online leaderboards for ten stages specifically designed for online competition. As a result, saves of this game are marked as protected and cannot be copied from the save manager present in the Wii system menu.
+
+# This package
+
+This package allows you to extract the saved stages from your save file and store them in their own files, and to import stages downloaded online into your existing save file. (This package does not provide tools to get saves to or from the Wii console, there is plenty of homebrew software already in existence for this purpose.) This package also contains reverse&hyphen;engineered replicas of the game's compression format used internally, allowing for stage substitution in mods.
+
+# Usage
+
+To install this package, simply run
+```
+pip install koro
+```
+in a command prompt. For detailed documentation of the contents of the package, please view the wiki. For basic users, simple command&hyphen;line tools are available in the `scripts` folder of this repository. **Use of these tools requires installing the package from PyPI.**
+
+## Playing downloaded stages
+
+`unpacker.py` is a script designed to inject stages downloaded online into your save file. Simply run the script with the stages, the data directory of your save file, and if injecting a single stage, the slot to inject it into. The stages should then appear in the **Friend** tab. To find the location of your save in Dophin, right&hyphen;click the game and select **Open Wii Save Folder**.
+
+## Uploading your stages
+
+`packer.py` is a script that allows you to easily extract and upload stages that you've created. Run the script with your save directory, destination (ZIP archive), and optionally which stages to export. This script only exports stages stored in the **Original** tab of the editor. To specify which stages to export, simply enter the stage numbers in the order that they should appear when downloaded. If a custom ordering is not specified, the default is to extract all 20 stages in the order that they appear in&hyphen;game. To share single levels, extract files from the resulting archive.

{koro-2.0.0rc3 → koro-2.0.2}/pyproject.toml

@@ -1,3 +1,3 @@
-[build-system]
-requires = ["setuptools>=42"]
+[build-system]
+requires = ["setuptools>=42"]
 build-backend = "setuptools.build_meta"

{koro-2.0.0rc3 → koro-2.0.2}/setup.cfg

@@ -1,34 +1,37 @@
-[metadata]
-name = koro
-version = 2.0.0rc3
-author = DigitalDetective47
-author_email = ninji2701@gmail.com
-description = Tools for manipulating levels made in Marble Saga: Kororinpa
-url = https://github.com/DigitalDetective47/koro
-project_urls = 
-	Bug Tracker = https://github.com/DigitalDetective47/koro/issues
-classifiers = 
-	Development Status :: 5 - Production/Stable
-	License :: OSI Approved :: The Unlicense (Unlicense)
-	Operating System :: OS Independent
-	Programming Language :: Python :: 3
-	Programming Language :: Python :: 3 :: Only
-	Programming Language :: Python :: 3.11
-	Programming Language :: Python :: 3.12
-	Topic :: File Formats
-	Topic :: Games/Entertainment
-	Typing :: Typed
-
-[options]
-package_dir = 
-	= src
-packages = find:
-python_requires = >=3.11
-
-[options.packages.find]
-where = src
-
-[egg_info]
-tag_build = 
-tag_date = 0
-
+[metadata]
+name = koro
+version = 2.0.2
+author = DigitalDetective47
+author_email = ninji2701@gmail.com
+description = Tools for manipulating levels made in Marble Saga: Kororinpa
+long_description = file: README.md
+long_description_content_type = text/markdown
+url = https://github.com/DigitalDetective47/koro
+project_urls = 
+	Bug Tracker = https://github.com/DigitalDetective47/koro/issues
+	Documentation = https://github.com/DigitalDetective47/koro/wiki
+classifiers = 
+	Development Status :: 5 - Production/Stable
+	License :: OSI Approved :: The Unlicense (Unlicense)
+	Operating System :: OS Independent
+	Programming Language :: Python :: 3
+	Programming Language :: Python :: 3 :: Only
+	Programming Language :: Python :: 3.11
+	Programming Language :: Python :: 3.12
+	Topic :: File Formats
+	Topic :: Games/Entertainment
+	Typing :: Typed
+
+[options]
+package_dir = 
+	= src
+packages = find:
+python_requires = >=3.11
+
+[options.packages.find]
+where = src
+
+[egg_info]
+tag_build = 
+tag_date = 0
+

{koro-2.0.0rc3 → koro-2.0.2}/src/koro/__init__.py

@@ -1,8 +1,8 @@
-from .slot import *
-from .slot.bin import *
-from .slot.file import *
-from .slot.save import *
-from .slot.xml import *
-from .stage import *
-from .stage.model import *
-from .stage.part import *
+from .slot import *
+from .slot.bin import *
+from .slot.file import *
+from .slot.save import *
+from .slot.xml import *
+from .stage import *
+from .stage.model import *
+from .stage.part import *

{koro-2.0.0rc3 → koro-2.0.2}/src/koro/slot/__init__.py

@@ -1,21 +1,21 @@
-from abc import ABC, abstractmethod
-
-from ..stage import Stage
-
-__all__ = ["Slot"]
-
-
-class Slot(ABC):
-    __slots__ = ()
-
-    def __bool__(self) -> bool:
-        """Return whether this slot is filled."""
-        return self.load() is not None
-
-    @abstractmethod
-    def load(self) -> Stage | None:
-        pass
-
-    @abstractmethod
-    def save(self, data: Stage | None, /) -> None:
-        pass
+from abc import ABC, abstractmethod
+
+from ..stage import Stage
+
+__all__ = ["Slot"]
+
+
+class Slot(ABC):
+    __slots__ = ()
+
+    def __bool__(self) -> bool:
+        """Return whether this slot is filled."""
+        return self.load() is not None
+
+    @abstractmethod
+    def load(self) -> Stage | None:
+        pass
+
+    @abstractmethod
+    def save(self, data: Stage | None, /) -> None:
+        pass

{koro-2.0.0rc3 → koro-2.0.2}/src/koro/slot/bin.py

@@ -1,155 +1,158 @@
-from itertools import chain
-from typing import Final
-
-from ..stage import Stage
-from .file import FileSlot
-from .xml import XmlSlot
-
-
-class BinSlot(FileSlot):
-    __slots__ = ()
-
-    @staticmethod
-    def compress(data: bytes, /) -> bytes:
-        buffer: bytearray = bytearray(1024)
-        buffer_index: int = 958
-        chunk: bytearray
-        data_index: int = 0
-        output: Final[bytearray] = bytearray(
-            b"\x00\x00\x00\x01\x00\x00\x00\x08"
-            + len(data).to_bytes(4, byteorder="big")
-            + b"\x00\x00\x00\x01"
-        )
-        reference_indices: list[int]
-        test_buffer: bytearray
-        test_length: int
-        test_reference_indicies: list[int]
-        while data_index < len(data):
-            chunk = bytearray(b"\x00")
-            for bit in range(8):
-                if data_index >= len(data):
-                    chunk[0] >>= 8 - bit
-                    output.extend(chunk)
-                    return output + b"\x00" * (len(output) & 1)
-                if len(data) - data_index <= 2:
-                    buffer[buffer_index] = data[data_index]
-                    buffer_index = buffer_index + 1 & 1023
-                    chunk[0] = chunk[0] >> 1 | 128
-                    chunk.append(data[data_index])
-                    data_index += 1
-                    continue
-                reference_indices = []
-                for i in chain(range(buffer_index, 1024), range(buffer_index)):
-                    if data[data_index] == buffer[i]:
-                        reference_indices.append(i)
-                if not reference_indices:
-                    buffer[buffer_index] = data[data_index]
-                    buffer_index = buffer_index + 1 & 1023
-                    chunk[0] = chunk[0] >> 1 | 128
-                    chunk.append(data[data_index])
-                    data_index += 1
-                    continue
-                test_buffer = buffer.copy()
-                test_buffer[buffer_index] = data[data_index]
-                for i in reference_indices.copy():
-                    if data[data_index + 1] != test_buffer[i - 1023]:
-                        reference_indices.remove(i)
-                if not reference_indices:
-                    buffer[buffer_index] = data[data_index]
-                    buffer_index = buffer_index + 1 & 1023
-                    chunk[0] = chunk[0] >> 1 | 128
-                    chunk.append(data[data_index])
-                    data_index += 1
-                    continue
-                test_buffer[buffer_index - 1023] = data[data_index + 1]
-                for i in reference_indices.copy():
-                    if data[data_index + 2] != test_buffer[i - 1022]:
-                        reference_indices.remove(i)
-                if not reference_indices:
-                    buffer[buffer_index] = data[data_index]
-                    buffer_index = buffer_index + 1 & 1023
-                    chunk[0] = chunk[0] >> 1 | 128
-                    chunk.append(data[data_index])
-                    data_index += 1
-                    continue
-                test_length = 4
-                test_reference_indicies = reference_indices.copy()
-                while test_length <= min(66, len(data) - data_index):
-                    test_buffer[buffer_index + test_length - 1026] = data[
-                        data_index + test_length - 2
-                    ]
-                    for i in test_reference_indicies.copy():
-                        if (
-                            data[data_index + test_length - 1]
-                            != test_buffer[i + test_length - 1025]
-                        ):
-                            test_reference_indicies.remove(i)
-                    if test_reference_indicies:
-                        reference_indices = test_reference_indicies.copy()
-                    else:
-                        break
-                    test_length += 1
-                chunk[0] >>= 1
-                test_length -= 1
-                if buffer_index + test_length >= 1024:
-                    buffer[buffer_index:] = data[
-                        data_index : data_index + 1024 - buffer_index
-                    ]
-                    buffer[: buffer_index + test_length - 1024] = data[
-                        data_index + 1024 - buffer_index : data_index + test_length
-                    ]
-                else:
-                    buffer[buffer_index : buffer_index + test_length] = data[
-                        data_index : data_index + test_length
-                    ]
-                buffer_index = buffer_index + test_length & 1023
-                chunk.extend(
-                    (
-                        reference_indices[0] & 255,
-                        reference_indices[0] >> 2 & 192 | test_length - 3,
-                    )
-                )
-                data_index += test_length
-            output.extend(chunk)
-        return bytes(output)
-
-    @staticmethod
-    def decompress(data: bytes, /) -> bytes:
-        buffer: Final[bytearray] = bytearray(1024)
-        buffer_index: int = 958
-        handle: int | bytearray
-        flags: int
-        offset: int
-        raw: Final[bytearray] = bytearray(data[:15:-1])
-        ref: bytes
-        result: Final[bytearray] = bytearray()
-        result_size: Final[int] = int.from_bytes(data[8:12], byteorder="big")
-        while len(result) < result_size:
-            flags = raw.pop()
-            for _ in range(8):
-                if flags & 1:
-                    handle = raw.pop()
-                    buffer[buffer_index] = handle
-                    buffer_index = buffer_index + 1 & 1023
-                    result.append(handle)
-                else:
-                    if len(raw) < 2:
-                        return result
-                    ref = bytes((raw.pop() for _ in range(2)))
-                    offset = (ref[1] << 2 & 768) + ref[0]
-                    handle = bytearray()
-                    for i in range((ref[1] & 63) + 3):
-                        handle.append(buffer[offset + i - 1024])
-                        buffer[buffer_index] = handle[-1]
-                        buffer_index = buffer_index + 1 & 1023
-                    result.extend(handle)
-                flags >>= 1
-        return bytes(result)
-
-    @staticmethod
-    def deserialize(data: bytes, /) -> Stage:
-        return XmlSlot.deserialize(BinSlot.decompress(data))
-
-    @staticmethod
-    def serialize(level: Stage, /) -> bytes:
-        return BinSlot.compress(XmlSlot.serialize(level))
+from itertools import chain
+from typing import Final
+
+from ..stage import Stage
+from .file import FileSlot
+from .xml import XmlSlot
+
+
+__all__ = ["BinSlot"]
+
+
+class BinSlot(FileSlot):
+    __slots__ = ()
+
+    @staticmethod
+    def compress(data: bytes, /) -> bytes:
+        buffer: bytearray = bytearray(1024)
+        buffer_index: int = 958
+        chunk: bytearray
+        data_index: int = 0
+        output: Final[bytearray] = bytearray(
+            b"\x00\x00\x00\x01\x00\x00\x00\x08"
+            + len(data).to_bytes(4, byteorder="big")
+            + b"\x00\x00\x00\x01"
+        )
+        reference_indices: list[int]
+        test_buffer: bytearray
+        test_length: int
+        test_reference_indicies: list[int]
+        while data_index < len(data):
+            chunk = bytearray(b"\x00")
+            for bit in range(8):
+                if data_index >= len(data):
+                    chunk[0] >>= 8 - bit
+                    output.extend(chunk)
+                    return output + b"\x00" * (len(output) & 1)
+                if len(data) - data_index <= 2:
+                    buffer[buffer_index] = data[data_index]
+                    buffer_index = buffer_index + 1 & 1023
+                    chunk[0] = chunk[0] >> 1 | 128
+                    chunk.append(data[data_index])
+                    data_index += 1
+                    continue
+                reference_indices = []
+                for i in chain(range(buffer_index, 1024), range(buffer_index)):
+                    if data[data_index] == buffer[i]:
+                        reference_indices.append(i)
+                if not reference_indices:
+                    buffer[buffer_index] = data[data_index]
+                    buffer_index = buffer_index + 1 & 1023
+                    chunk[0] = chunk[0] >> 1 | 128
+                    chunk.append(data[data_index])
+                    data_index += 1
+                    continue
+                test_buffer = buffer.copy()
+                test_buffer[buffer_index] = data[data_index]
+                for i in reference_indices.copy():
+                    if data[data_index + 1] != test_buffer[i - 1023]:
+                        reference_indices.remove(i)
+                if not reference_indices:
+                    buffer[buffer_index] = data[data_index]
+                    buffer_index = buffer_index + 1 & 1023
+                    chunk[0] = chunk[0] >> 1 | 128
+                    chunk.append(data[data_index])
+                    data_index += 1
+                    continue
+                test_buffer[buffer_index - 1023] = data[data_index + 1]
+                for i in reference_indices.copy():
+                    if data[data_index + 2] != test_buffer[i - 1022]:
+                        reference_indices.remove(i)
+                if not reference_indices:
+                    buffer[buffer_index] = data[data_index]
+                    buffer_index = buffer_index + 1 & 1023
+                    chunk[0] = chunk[0] >> 1 | 128
+                    chunk.append(data[data_index])
+                    data_index += 1
+                    continue
+                test_length = 4
+                test_reference_indicies = reference_indices.copy()
+                while test_length <= min(66, len(data) - data_index):
+                    test_buffer[buffer_index + test_length - 1026] = data[
+                        data_index + test_length - 2
+                    ]
+                    for i in test_reference_indicies.copy():
+                        if (
+                            data[data_index + test_length - 1]
+                            != test_buffer[i + test_length - 1025]
+                        ):
+                            test_reference_indicies.remove(i)
+                    if test_reference_indicies:
+                        reference_indices = test_reference_indicies.copy()
+                    else:
+                        break
+                    test_length += 1
+                chunk[0] >>= 1
+                test_length -= 1
+                if buffer_index + test_length >= 1024:
+                    buffer[buffer_index:] = data[
+                        data_index : data_index + 1024 - buffer_index
+                    ]
+                    buffer[: buffer_index + test_length - 1024] = data[
+                        data_index + 1024 - buffer_index : data_index + test_length
+                    ]
+                else:
+                    buffer[buffer_index : buffer_index + test_length] = data[
+                        data_index : data_index + test_length
+                    ]
+                buffer_index = buffer_index + test_length & 1023
+                chunk.extend(
+                    (
+                        reference_indices[0] & 255,
+                        reference_indices[0] >> 2 & 192 | test_length - 3,
+                    )
+                )
+                data_index += test_length
+            output.extend(chunk)
+        return bytes(output)
+
+    @staticmethod
+    def decompress(data: bytes, /) -> bytes:
+        buffer: Final[bytearray] = bytearray(1024)
+        buffer_index: int = 958
+        handle: int | bytearray
+        flags: int
+        offset: int
+        raw: Final[bytearray] = bytearray(data[:15:-1])
+        ref: bytes
+        result: Final[bytearray] = bytearray()
+        result_size: Final[int] = int.from_bytes(data[8:12], byteorder="big")
+        while len(result) < result_size:
+            flags = raw.pop()
+            for _ in range(8):
+                if flags & 1:
+                    handle = raw.pop()
+                    buffer[buffer_index] = handle
+                    buffer_index = buffer_index + 1 & 1023
+                    result.append(handle)
+                else:
+                    if len(raw) < 2:
+                        return result
+                    ref = bytes((raw.pop() for _ in range(2)))
+                    offset = (ref[1] << 2 & 768) + ref[0]
+                    handle = bytearray()
+                    for i in range((ref[1] & 63) + 3):
+                        handle.append(buffer[offset + i - 1024])
+                        buffer[buffer_index] = handle[-1]
+                        buffer_index = buffer_index + 1 & 1023
+                    result.extend(handle)
+                flags >>= 1
+        return bytes(result)
+
+    @staticmethod
+    def deserialize(data: bytes, /) -> Stage:
+        return XmlSlot.deserialize(BinSlot.decompress(data))
+
+    @staticmethod
+    def serialize(stage: Stage, /) -> bytes:
+        return BinSlot.compress(XmlSlot.serialize(stage))