skel-mesh-parser 0.3.0__py3-none-any.whl

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,39 @@
1
+ """Public API for the .skel binary parser -- port of
2
+ www/js/vendor/spine-skeleton-binary/index.js's parseSkeleton. Lives directly
3
+ in this package's __init__.py (the spec's §1 tree names no separate file for
4
+ it) since it's this package's one entry point, mirroring index.js's own role
5
+ in the vendored JS package.
6
+
7
+ Real source's own comment on the re-read below: "Once the version is known,
8
+ the header shape is no longer ambiguous -- redo exactly the right skip (not
9
+ a 'replay' of a single assumed shape, per the bug this task found)." --
10
+ detect_version() consumes its OWN throwaway BinaryReader internally and
11
+ never advances the one this function passes to read_skeleton_38/42, so the
12
+ header must be walked again here, deliberately, once the version is known."""
13
+ from __future__ import annotations
14
+
15
+ from typing import Any
16
+
17
+ from skel_mesh_parser.binary_reader import BinaryReader
18
+ from skel_mesh_parser.detect_version import UnsupportedVersionError, detect_version
19
+ from skel_mesh_parser.read_skeleton_38 import read_skeleton_38
20
+ from skel_mesh_parser.read_skeleton_42 import read_skeleton_42
21
+
22
+ __version__ = "0.3.0"
23
+ __all__ = ["parse_skeleton", "UnsupportedVersionError"]
24
+
25
+
26
+ def parse_skeleton(data: bytes) -> dict[str, Any]:
27
+ version = detect_version(data)
28
+ r = BinaryReader(data)
29
+ is_42 = version["major"] == 4 and version["minor"] == 2
30
+ if is_42:
31
+ r.read_int32()
32
+ r.read_int32()
33
+ else:
34
+ r.read_string()
35
+ r.read_string() # version string -- same position in both shapes
36
+
37
+ attachments = read_skeleton_42(r) if is_42 else read_skeleton_38(r)
38
+
39
+ return {"version": version, "attachments": attachments}
@@ -0,0 +1,152 @@
1
+ """Low-level big-endian byte reader for the Spine skeleton binary format --
2
+ port of www/js/vendor/spine-skeleton-binary/binary-reader.js's BinaryReader.
3
+ Field encodings match the vendored JS exactly; this is a mechanical port,
4
+ not a redesign (spec §6)."""
5
+ from __future__ import annotations
6
+
7
+ import struct
8
+
9
+
10
+ class BufferUnderrunError(Exception):
11
+ """Python's equivalent of DataView throwing a RangeError when a read
12
+ runs past the buffer's end. detect_version.py (Task 4) catches this
13
+ exact type to implement the same try-4.2-then-fall-back-to-3.8 probe
14
+ the real JS does via its own RangeError guard -- this type is load
15
+ -bearing there, not incidental here."""
16
+
17
+
18
+ class BinaryReader:
19
+ def __init__(self, data: bytes) -> None:
20
+ self._data = data
21
+ self._pos = 0
22
+
23
+ @property
24
+ def position(self) -> int:
25
+ return self._pos
26
+
27
+ def _require(self, n: int) -> None:
28
+ if self._pos + n > len(self._data):
29
+ raise BufferUnderrunError(
30
+ f"read of {n} bytes at offset {self._pos} exceeds buffer "
31
+ f"length {len(self._data)}"
32
+ )
33
+
34
+ def read_byte(self) -> int:
35
+ self._require(1)
36
+ v = struct.unpack_from(">b", self._data, self._pos)[0]
37
+ self._pos += 1
38
+ return v
39
+
40
+ def read_ubyte(self) -> int:
41
+ self._require(1)
42
+ v = struct.unpack_from(">B", self._data, self._pos)[0]
43
+ self._pos += 1
44
+ return v
45
+
46
+ def read_short(self) -> int:
47
+ self._require(2)
48
+ v = struct.unpack_from(">h", self._data, self._pos)[0]
49
+ self._pos += 2
50
+ return v
51
+
52
+ def read_int32(self) -> int:
53
+ self._require(4)
54
+ v = struct.unpack_from(">i", self._data, self._pos)[0]
55
+ self._pos += 4
56
+ return v
57
+
58
+ def read_float(self) -> float:
59
+ self._require(4)
60
+ v = struct.unpack_from(">f", self._data, self._pos)[0]
61
+ self._pos += 4
62
+ return v
63
+
64
+ def read_boolean(self) -> bool:
65
+ return self.read_byte() != 0
66
+
67
+ def read_varint(self, optimize_positive: bool) -> int:
68
+ # JS's bitwise ops truncate `result` to a signed 32-bit int at every
69
+ # `|=` -- replicated here explicitly (`_to_int32`) rather than
70
+ # relying on Python's arbitrary-precision ints, so a 5-byte varint
71
+ # whose top contributed bits would overflow 32 bits in JS produces
72
+ # the identical (wrapped) result in Python. Unreachable via any
73
+ # real skeleton file (hullLength/vertexCount/triangleCount never
74
+ # approach 2**28) -- ported for fidelity, not because real input
75
+ # exercises it, same class of ruling as Stage 1's _parse_int NaN
76
+ # divergence note.
77
+ def to_int32(x: int) -> int:
78
+ x &= 0xFFFFFFFF
79
+ return x - 0x100000000 if x & 0x80000000 else x
80
+
81
+ b = self.read_ubyte()
82
+ result = b & 0x7F
83
+ if b & 0x80:
84
+ b = self.read_ubyte()
85
+ result = to_int32(result | ((b & 0x7F) << 7))
86
+ if b & 0x80:
87
+ b = self.read_ubyte()
88
+ result = to_int32(result | ((b & 0x7F) << 14))
89
+ if b & 0x80:
90
+ b = self.read_ubyte()
91
+ result = to_int32(result | ((b & 0x7F) << 21))
92
+ if b & 0x80:
93
+ b = self.read_ubyte()
94
+ result = to_int32(result | ((b & 0x7F) << 28))
95
+ if optimize_positive:
96
+ return result & 0xFFFFFFFF
97
+ return ((result & 0xFFFFFFFF) >> 1) ^ (-(result & 1))
98
+
99
+ def read_string(self) -> str | None:
100
+ byte_count = self.read_varint(True)
101
+ if byte_count == 0:
102
+ return None
103
+ if byte_count == 1:
104
+ return ""
105
+ length = byte_count - 1
106
+ self._require(length)
107
+ raw = self._data[self._pos : self._pos + length]
108
+ self._pos += length
109
+ # JS's manual utf8Decode() never throws -- malformed bytes just
110
+ # produce garbled String.fromCharCode output, not an exception.
111
+ # Strict decode("utf-8") raises UnicodeDecodeError instead, a real
112
+ # divergence found by Stage 2's Task 4 scrutinize review: reachable
113
+ # not just adversarially but on ANY real 3.8 file, since
114
+ # detect_version() always speculatively tries the 4.2 header shape
115
+ # first, which routinely walks misaligned bytes (arbitrary skeleton
116
+ # data, not string data) as if they were a length-prefixed string.
117
+ # errors="replace" avoids the crash without chasing byte-for-byte
118
+ # parity with JS's specific garbled output. This guarantee is
119
+ # crash-safety, not full observable-behavior parity: on any
120
+ # non-crafted input, the version-detection outcome matches JS,
121
+ # since the only real consumer today (detect_version's regex match
122
+ # against `^\d+\.\d+\.\d+`) treats ordinary garbage the same way --
123
+ # as "no match". A scrutinize re-review found this DOES have a real
124
+ # (adversarial-only) counterexample -- a hand-crafted overlong
125
+ # 2-byte UTF-8 sequence (e.g. bytes C0 B4 C0 AE C0 B2 C0 AE C0 B0)
126
+ # decodes in JS's utf8Decode() to the literal string "4.2.0"
127
+ # (overlong encodings drop their high bits, `(0xC0 & 0x1f) << 6 |
128
+ # (b1 & 0x3f)` collapses to `b1 & 0x3f`, i.e. plain ASCII), which
129
+ # WOULD match the version regex -- while Python's errors="replace"
130
+ # produces U+FFFD characters that don't. No real skeleton file's
131
+ # misaligned-byte walk produces this pattern; only a deliberately
132
+ # crafted payload would. This claim is scoped to today's two call
133
+ # sites (both in detect_version.py) -- Tasks 5-7 add consumers
134
+ # (attachment/skin/event names) that don't route through a regex,
135
+ # so re-examine this note once those land.
136
+ return raw.decode("utf-8", errors="replace")
137
+
138
+ def read_string_ref(self, strings: list[str | None]) -> str | None:
139
+ # JS: `return index === 0 ? null : strings[index - 1];` -- an
140
+ # out-of-range index returns `undefined` in JS (no exception),
141
+ # which typically flows into a `?? name`-style coalesce elsewhere
142
+ # and recovers silently. A bare `strings[index - 1]` here would
143
+ # raise IndexError instead, an uncaught-exception behavior change
144
+ # from the oracle on malformed/adversarial input (unreachable via
145
+ # any real skeleton file, same class of ruling as read_varint's
146
+ # 32-bit-truncation note above) -- bounds-checked explicitly so
147
+ # this stays a silent None like the real JS, not a crash.
148
+ index = self.read_varint(True)
149
+ if index == 0:
150
+ return None
151
+ pos = index - 1
152
+ return strings[pos] if 0 <= pos < len(strings) else None
@@ -0,0 +1,51 @@
1
+ """Reads just the header and classifies the skeleton binary version -- port
2
+ of www/js/vendor/spine-skeleton-binary/detect-version.js's detectVersion.
3
+
4
+ Tries the 4.2 shape first (8-byte/2xint32 hash, then version string), then
5
+ falls back to the 3.8 shape (string hash, then version string) on a fresh
6
+ reader. A buffer too small for a given shape raises BufferUnderrunError --
7
+ Python's equivalent of DataView's RangeError -- which is the signal to fall
8
+ through, not a real error (same as the real JS's RangeError guard)."""
9
+ from __future__ import annotations
10
+
11
+ import re
12
+ from typing import Any
13
+
14
+ from skel_mesh_parser.binary_reader import BinaryReader, BufferUnderrunError
15
+
16
+ _VERSION_RE = re.compile(r"^(\d+)\.(\d+)\.(\d+)")
17
+
18
+
19
+ class UnsupportedVersionError(Exception):
20
+ def __init__(self, raw: str | None) -> None:
21
+ super().__init__(f"Unsupported Spine skeleton version: {raw}")
22
+ self.version = raw
23
+
24
+
25
+ def detect_version(data: bytes) -> dict[str, Any]:
26
+ raw42: str | None = None
27
+ try:
28
+ r42 = BinaryReader(data)
29
+ r42.read_int32()
30
+ r42.read_int32()
31
+ raw42 = r42.read_string()
32
+ except BufferUnderrunError:
33
+ pass
34
+
35
+ m42 = _VERSION_RE.match(raw42 or "")
36
+ if m42 and int(m42.group(1)) == 4 and int(m42.group(2)) == 2:
37
+ return {"major": 4, "minor": 2, "patch": int(m42.group(3)), "raw": raw42}
38
+
39
+ raw38: str | None = None
40
+ try:
41
+ r38 = BinaryReader(data)
42
+ r38.read_string() # hash
43
+ raw38 = r38.read_string()
44
+ except BufferUnderrunError:
45
+ pass
46
+
47
+ m38 = _VERSION_RE.match(raw38 or "")
48
+ if m38 and int(m38.group(1)) == 3 and int(m38.group(2)) == 8:
49
+ return {"major": 3, "minor": 8, "patch": int(m38.group(3)), "raw": raw38}
50
+
51
+ raise UnsupportedVersionError(raw42 or raw38 or None)
@@ -0,0 +1,245 @@
1
+ """3.8.x skeleton binary walker -- port of
2
+ www/js/vendor/spine-skeleton-binary/read-skeleton-38.js. Field order matches
3
+ the vendored JS exactly (spec §6: mechanical port, no redesign). 3.8 has no
4
+ per-record flag byte anywhere: every field is read unconditionally except
5
+ where marked nonessential-gated."""
6
+ from __future__ import annotations
7
+
8
+ from typing import Any
9
+
10
+ from skel_mesh_parser.binary_reader import BinaryReader
11
+
12
+ _ATTACHMENT_TYPES = ["Region", "BoundingBox", "Mesh", "LinkedMesh", "Path", "Point", "Clipping"]
13
+
14
+
15
+ def walk_header_and_constraints_38(r: BinaryReader) -> tuple[list[str | None], bool]:
16
+ r.read_float(); r.read_float(); r.read_float(); r.read_float() # x, y, width, height
17
+ nonessential = r.read_boolean()
18
+ if nonessential:
19
+ r.read_float() # fps
20
+ r.read_string() # imagesPath
21
+ r.read_string() # audioPath
22
+
23
+ num_strings = r.read_varint(True)
24
+ strings: list[str | None] = [r.read_string() for _ in range(num_strings)]
25
+
26
+ num_bones = r.read_varint(True)
27
+ for i in range(num_bones):
28
+ r.read_string() # name
29
+ if i != 0:
30
+ r.read_varint(True) # parent index
31
+ r.read_float(); r.read_float(); r.read_float() # rotation, x, y
32
+ r.read_float(); r.read_float() # scaleX, scaleY
33
+ r.read_float(); r.read_float() # shearX, shearY
34
+ r.read_float() # length
35
+ r.read_varint(True) # transformMode
36
+ r.read_boolean() # skinRequired
37
+ if nonessential:
38
+ r.read_int32() # color
39
+
40
+ num_slots = r.read_varint(True)
41
+ for _ in range(num_slots):
42
+ r.read_string() # name
43
+ r.read_varint(True) # boneIndex
44
+ r.read_int32() # color
45
+ r.read_int32() # darkColor
46
+ r.read_string_ref(strings) # attachmentName
47
+ r.read_varint(True) # blendMode
48
+
49
+ _skip_ik_constraints_38(r)
50
+ _skip_transform_constraints_38(r)
51
+ _skip_path_constraints_38(r)
52
+
53
+ return strings, nonessential
54
+
55
+
56
+ def _skip_ik_constraints_38(r: BinaryReader) -> None:
57
+ n = r.read_varint(True)
58
+ for _ in range(n):
59
+ r.read_string(); r.read_varint(True); r.read_boolean()
60
+ nn = r.read_varint(True)
61
+ for _ in range(nn):
62
+ r.read_varint(True)
63
+ r.read_varint(True)
64
+ r.read_float(); r.read_float()
65
+ r.read_byte(); r.read_boolean(); r.read_boolean(); r.read_boolean()
66
+
67
+
68
+ def _skip_transform_constraints_38(r: BinaryReader) -> None:
69
+ n = r.read_varint(True)
70
+ for _ in range(n):
71
+ r.read_string(); r.read_varint(True); r.read_boolean()
72
+ nn = r.read_varint(True)
73
+ for _ in range(nn):
74
+ r.read_varint(True)
75
+ r.read_varint(True)
76
+ r.read_boolean(); r.read_boolean()
77
+ for _ in range(10):
78
+ r.read_float()
79
+
80
+
81
+ def _skip_path_constraints_38(r: BinaryReader) -> None:
82
+ n = r.read_varint(True)
83
+ for _ in range(n):
84
+ r.read_string(); r.read_varint(True); r.read_boolean()
85
+ nn = r.read_varint(True)
86
+ for _ in range(nn):
87
+ r.read_varint(True)
88
+ r.read_varint(True); r.read_varint(True); r.read_varint(True); r.read_varint(True)
89
+ for _ in range(5):
90
+ r.read_float()
91
+
92
+
93
+ def read_skeleton_38(r: BinaryReader) -> dict[str, dict[str, Any]]:
94
+ strings, nonessential = walk_header_and_constraints_38(r)
95
+ result: dict[str, dict[str, Any]] = {}
96
+ _read_skin_38(r, strings, nonessential, result)
97
+ other_skin_count = r.read_varint(True)
98
+ for _ in range(other_skin_count):
99
+ r.read_string_ref(strings) # skin name (table-index ref in 3.8)
100
+ _skip_skin_bone_and_constraint_refs_38(r)
101
+ _read_skin_38(r, strings, nonessential, None)
102
+ return result
103
+
104
+
105
+ def _read_skin_38(
106
+ r: BinaryReader,
107
+ strings: list[str | None],
108
+ nonessential: bool,
109
+ out_map: dict[str, dict[str, Any]] | None,
110
+ ) -> None:
111
+ slot_count = r.read_varint(True)
112
+ for _ in range(slot_count):
113
+ r.read_varint(True) # slotIndex
114
+ attachment_count = r.read_varint(True)
115
+ for _ in range(attachment_count):
116
+ attachment_name = r.read_string_ref(strings)
117
+ info = _read_attachment_38(r, strings, attachment_name, nonessential)
118
+ if out_map is not None and info is not None:
119
+ existing = out_map.get(info["path"])
120
+ if existing is None or info["type"] == "Mesh" or existing["type"] != "Mesh":
121
+ out_map[info["path"]] = info
122
+
123
+
124
+ def _read_attachment_38(
125
+ r: BinaryReader,
126
+ strings: list[str | None],
127
+ attachment_name: str | None,
128
+ nonessential: bool,
129
+ ) -> dict[str, Any] | None:
130
+ name = r.read_string_ref(strings)
131
+ if name is None:
132
+ name = attachment_name
133
+ type_index = r.read_ubyte()
134
+ attachment_type = _ATTACHMENT_TYPES[type_index]
135
+
136
+ if attachment_type == "Region":
137
+ path = r.read_string_ref(strings)
138
+ r.read_float(); r.read_float(); r.read_float(); r.read_float()
139
+ r.read_float(); r.read_float(); r.read_float()
140
+ r.read_int32()
141
+ return {"type": "Region", "path": path if path is not None else name}
142
+
143
+ if attachment_type == "BoundingBox":
144
+ vertex_count = r.read_varint(True)
145
+ _read_vertices_38(r, vertex_count)
146
+ if nonessential:
147
+ r.read_int32()
148
+ return {"type": "BoundingBox", "path": name}
149
+
150
+ if attachment_type == "Mesh":
151
+ path = r.read_string_ref(strings)
152
+ r.read_int32() # color
153
+ vertex_count = r.read_varint(True)
154
+ uvs = _read_float_array_38(r, vertex_count * 2)
155
+ triangle_count = r.read_varint(True)
156
+ triangles = [r.read_short() for _ in range(triangle_count)]
157
+ _read_vertices_38(r, vertex_count)
158
+ hull_length = r.read_varint(True) # vertex count; first hull_length UV pairs are the outline
159
+ if nonessential:
160
+ edge_count = r.read_varint(True)
161
+ for _ in range(edge_count):
162
+ r.read_short()
163
+ r.read_float(); r.read_float() # width, height
164
+ return {"type": "Mesh", "path": path if path is not None else name, "uvs": uvs, "triangles": triangles, "hull_length": hull_length}
165
+
166
+ if attachment_type == "LinkedMesh":
167
+ path = r.read_string_ref(strings)
168
+ r.read_int32() # color
169
+ r.read_string_ref(strings) # skinName
170
+ r.read_string_ref(strings) # parent
171
+ r.read_boolean() # inheritDeform
172
+ if nonessential:
173
+ r.read_float(); r.read_float()
174
+ return {"type": "LinkedMesh", "path": path if path is not None else name}
175
+
176
+ if attachment_type == "Path":
177
+ r.read_boolean() # closed
178
+ r.read_boolean() # constantSpeed
179
+ vertex_count = r.read_varint(True)
180
+ _read_vertices_38(r, vertex_count)
181
+ # Real JS: `const lengthCount = vertexCount / 3;` (float division)
182
+ # then `for (let i = 0; i < lengthCount; i++)` -- a `<` loop bound
183
+ # against a possibly-fractional value iterates ceil(vertexCount/3)
184
+ # times, NOT floor(vertexCount/3). Plain `//` here would silently
185
+ # under-read one float for any vertexCount not a multiple of 3 (a
186
+ # single open Bezier path segment is 4 control points, a real and
187
+ # plausible shape, not an edge case) -- desyncing every subsequent
188
+ # read in this skin with no exception raised. Found by Stage 2's
189
+ # own scrutinize review; `(vertex_count + 2) // 3` is the integer
190
+ # form of ceil(vertex_count / 3) for non-negative vertex_count.
191
+ length_count = (vertex_count + 2) // 3
192
+ for _ in range(length_count):
193
+ r.read_float()
194
+ if nonessential:
195
+ r.read_int32()
196
+ return {"type": "Path", "path": name}
197
+
198
+ if attachment_type == "Point":
199
+ r.read_float(); r.read_float(); r.read_float()
200
+ if nonessential:
201
+ r.read_int32()
202
+ return {"type": "Point", "path": name}
203
+
204
+ if attachment_type == "Clipping":
205
+ r.read_varint(True) # endSlotIndex
206
+ vertex_count = r.read_varint(True)
207
+ _read_vertices_38(r, vertex_count)
208
+ if nonessential:
209
+ r.read_int32()
210
+ return {"type": "Clipping", "path": name}
211
+
212
+ raise ValueError(f"Unknown attachment type index: {type_index}")
213
+
214
+
215
+ def _read_vertices_38(r: BinaryReader, vertex_count: int) -> None:
216
+ float_count = vertex_count * 2
217
+ weighted = r.read_boolean()
218
+ if not weighted:
219
+ for _ in range(float_count):
220
+ r.read_float()
221
+ return
222
+ for _ in range(vertex_count):
223
+ bone_count = r.read_varint(True)
224
+ for _ in range(bone_count):
225
+ r.read_varint(True) # bone index
226
+ r.read_float(); r.read_float(); r.read_float() # x, y, weight
227
+
228
+
229
+ def _read_float_array_38(r: BinaryReader, n: int) -> list[float]:
230
+ return [r.read_float() for _ in range(n)]
231
+
232
+
233
+ def _skip_skin_bone_and_constraint_refs_38(r: BinaryReader) -> None:
234
+ bone_count = r.read_varint(True)
235
+ for _ in range(bone_count):
236
+ r.read_varint(True)
237
+ ik_count = r.read_varint(True)
238
+ for _ in range(ik_count):
239
+ r.read_varint(True)
240
+ transform_count = r.read_varint(True)
241
+ for _ in range(transform_count):
242
+ r.read_varint(True)
243
+ path_count = r.read_varint(True)
244
+ for _ in range(path_count):
245
+ r.read_varint(True)
@@ -0,0 +1,289 @@
1
+ """4.2.x skeleton binary walker -- port of
2
+ www/js/vendor/spine-skeleton-binary/read-skeleton-42.js. Field order matches
3
+ the vendored JS exactly (spec §6: mechanical port, no redesign). Bone/slot/
4
+ constraint field values are read (to stay byte-aligned) but not retained --
5
+ only the skins/attachments that follow are needed."""
6
+ from __future__ import annotations
7
+
8
+ from typing import Any
9
+
10
+ from skel_mesh_parser.binary_reader import BinaryReader
11
+
12
+ _ATTACHMENT_TYPES = ["Region", "BoundingBox", "Mesh", "LinkedMesh", "Path", "Point", "Clipping"]
13
+
14
+
15
+ def walk_header_and_constraints_42(r: BinaryReader) -> tuple[list[str | None], bool]:
16
+ r.read_float(); r.read_float(); r.read_float(); r.read_float() # x, y, width, height
17
+ r.read_float() # referenceScale
18
+ nonessential = r.read_boolean()
19
+ if nonessential:
20
+ r.read_float(); r.read_string(); r.read_string() # fps, imagesPath, audioPath
21
+
22
+ num_strings = r.read_varint(True)
23
+ strings: list[str | None] = [r.read_string() for _ in range(num_strings)]
24
+
25
+ num_bones = r.read_varint(True)
26
+ for i in range(num_bones):
27
+ r.read_string() # name
28
+ if i != 0:
29
+ r.read_varint(True) # parent index
30
+ r.read_float(); r.read_float(); r.read_float() # rotation, x, y
31
+ r.read_float(); r.read_float() # scaleX, scaleY
32
+ r.read_float(); r.read_float() # shearX, shearY
33
+ r.read_float() # length
34
+ r.read_byte() # inherit
35
+ r.read_boolean() # skinRequired
36
+ if nonessential:
37
+ r.read_int32() # color
38
+ r.read_string() # icon
39
+ r.read_boolean() # visible
40
+
41
+ num_slots = r.read_varint(True)
42
+ for _ in range(num_slots):
43
+ r.read_string() # name
44
+ r.read_varint(True) # boneIndex
45
+ r.read_int32(); r.read_int32() # color, darkColor
46
+ r.read_string_ref(strings) # attachmentName
47
+ r.read_varint(True) # blendMode
48
+ if nonessential:
49
+ r.read_boolean() # visible
50
+
51
+ _skip_ik_constraints_42(r)
52
+ _skip_transform_constraints_42(r)
53
+ _skip_path_constraints_42(r)
54
+ _skip_physics_constraints_42(r)
55
+
56
+ return strings, nonessential
57
+
58
+
59
+ def _skip_ik_constraints_42(r: BinaryReader) -> None:
60
+ n = r.read_varint(True)
61
+ for _ in range(n):
62
+ r.read_string(); r.read_varint(True)
63
+ nn = r.read_varint(True)
64
+ for _ in range(nn):
65
+ r.read_varint(True)
66
+ r.read_varint(True)
67
+ flags = r.read_ubyte()
68
+ if (flags & 32) and (flags & 64):
69
+ r.read_float()
70
+ if flags & 128:
71
+ r.read_float()
72
+
73
+
74
+ def _skip_transform_constraints_42(r: BinaryReader) -> None:
75
+ n = r.read_varint(True)
76
+ for _ in range(n):
77
+ r.read_string(); r.read_varint(True)
78
+ nn = r.read_varint(True)
79
+ for _ in range(nn):
80
+ r.read_varint(True)
81
+ r.read_varint(True)
82
+ flags1 = r.read_ubyte()
83
+ if flags1 & 8: r.read_float()
84
+ if flags1 & 16: r.read_float()
85
+ if flags1 & 32: r.read_float()
86
+ if flags1 & 64: r.read_float()
87
+ if flags1 & 128: r.read_float()
88
+ flags2 = r.read_ubyte()
89
+ if flags2 & 1: r.read_float()
90
+ if flags2 & 2: r.read_float()
91
+ if flags2 & 4: r.read_float()
92
+ if flags2 & 8: r.read_float()
93
+ if flags2 & 16: r.read_float()
94
+ if flags2 & 32: r.read_float()
95
+ if flags2 & 64: r.read_float()
96
+
97
+
98
+ def _skip_path_constraints_42(r: BinaryReader) -> None:
99
+ n = r.read_varint(True)
100
+ for _ in range(n):
101
+ r.read_string(); r.read_varint(True); r.read_boolean()
102
+ nn = r.read_varint(True)
103
+ for _ in range(nn):
104
+ r.read_varint(True)
105
+ r.read_varint(True)
106
+ flags = r.read_ubyte()
107
+ if flags & 128:
108
+ r.read_float()
109
+ r.read_float(); r.read_float(); r.read_float(); r.read_float(); r.read_float()
110
+
111
+
112
+ def _skip_physics_constraints_42(r: BinaryReader) -> None:
113
+ n = r.read_varint(True)
114
+ for _ in range(n):
115
+ r.read_string(); r.read_varint(True); r.read_varint(True)
116
+ flags = r.read_ubyte()
117
+ if flags & 2: r.read_float()
118
+ if flags & 4: r.read_float()
119
+ if flags & 8: r.read_float()
120
+ if flags & 16: r.read_float()
121
+ if flags & 32: r.read_float()
122
+ if flags & 64: r.read_float() # limit
123
+ r.read_ubyte() # step
124
+ r.read_float(); r.read_float(); r.read_float() # inertia, strength, damping
125
+ if flags & 128:
126
+ r.read_float() # massInverse
127
+ r.read_float(); r.read_float() # wind, gravity
128
+ flags2 = r.read_ubyte()
129
+ if flags2 & 128:
130
+ r.read_float() # mix
131
+
132
+
133
+ def read_skeleton_42(r: BinaryReader) -> dict[str, dict[str, Any]]:
134
+ strings, nonessential = walk_header_and_constraints_42(r)
135
+ result: dict[str, dict[str, Any]] = {}
136
+ _read_skin_42(r, strings, nonessential, result)
137
+ other_skin_count = r.read_varint(True)
138
+ for _ in range(other_skin_count):
139
+ r.read_string() # skin name
140
+ if nonessential:
141
+ r.read_int32() # skin color (4.2 only)
142
+ _skip_skin_bone_and_constraint_refs_42(r)
143
+ _read_skin_42(r, strings, nonessential, None)
144
+ return result
145
+
146
+
147
+ def _read_skin_42(
148
+ r: BinaryReader,
149
+ strings: list[str | None],
150
+ nonessential: bool,
151
+ out_map: dict[str, dict[str, Any]] | None,
152
+ ) -> None:
153
+ slot_count = r.read_varint(True)
154
+ for _ in range(slot_count):
155
+ r.read_varint(True) # slotIndex, unused
156
+ attachment_count = r.read_varint(True)
157
+ for _ in range(attachment_count):
158
+ attachment_name = r.read_string_ref(strings)
159
+ info = _read_attachment_42(r, strings, attachment_name, nonessential)
160
+ if out_map is not None and info is not None:
161
+ existing = out_map.get(info["path"])
162
+ if existing is None or info["type"] == "Mesh" or existing["type"] != "Mesh":
163
+ out_map[info["path"]] = info
164
+
165
+
166
+ def _read_attachment_42(
167
+ r: BinaryReader,
168
+ strings: list[str | None],
169
+ attachment_name: str | None,
170
+ nonessential: bool,
171
+ ) -> dict[str, Any] | None:
172
+ flags = r.read_ubyte()
173
+ name = r.read_string_ref(strings) if (flags & 8) else attachment_name
174
+ type_index = flags & 0b111
175
+ attachment_type = _ATTACHMENT_TYPES[type_index]
176
+
177
+ if attachment_type == "Region":
178
+ path = r.read_string_ref(strings) if (flags & 16) else None
179
+ if flags & 32:
180
+ r.read_int32()
181
+ if flags & 64:
182
+ _skip_sequence_42(r)
183
+ if flags & 128:
184
+ r.read_float()
185
+ r.read_float(); r.read_float(); r.read_float(); r.read_float(); r.read_float(); r.read_float()
186
+ return {"type": "Region", "path": path if path is not None else name}
187
+
188
+ if attachment_type == "BoundingBox":
189
+ _read_vertices_42(r, bool(flags & 16))
190
+ if nonessential:
191
+ r.read_int32()
192
+ return {"type": "BoundingBox", "path": name}
193
+
194
+ if attachment_type == "Mesh":
195
+ path = r.read_string_ref(strings) if (flags & 16) else name
196
+ if flags & 32:
197
+ r.read_int32()
198
+ if flags & 64:
199
+ _skip_sequence_42(r)
200
+ hull_length = r.read_varint(True)
201
+ float_count = _read_vertices_42(r, bool(flags & 128))
202
+ uvs = _read_float_array_42(r, float_count)
203
+ triangle_count = (float_count - hull_length - 2) * 3
204
+ triangles = [r.read_varint(True) for _ in range(triangle_count)]
205
+ if nonessential:
206
+ edge_count = r.read_varint(True)
207
+ for _ in range(edge_count):
208
+ r.read_varint(True)
209
+ r.read_float(); r.read_float()
210
+ return {"type": "Mesh", "path": path if path is not None else name, "uvs": uvs, "triangles": triangles, "hull_length": hull_length}
211
+
212
+ if attachment_type == "LinkedMesh":
213
+ path = r.read_string_ref(strings) if (flags & 16) else name
214
+ if flags & 32:
215
+ r.read_int32()
216
+ if flags & 64:
217
+ _skip_sequence_42(r)
218
+ r.read_varint(True) # skinIndex
219
+ r.read_string_ref(strings) # parent
220
+ if nonessential:
221
+ r.read_float(); r.read_float()
222
+ return {"type": "LinkedMesh", "path": path if path is not None else name}
223
+
224
+ if attachment_type == "Path":
225
+ float_count = _read_vertices_42(r, bool(flags & 64))
226
+ length_count = float_count // 6
227
+ for _ in range(length_count):
228
+ r.read_float()
229
+ if nonessential:
230
+ r.read_int32()
231
+ return {"type": "Path", "path": name}
232
+
233
+ if attachment_type == "Point":
234
+ r.read_float(); r.read_float(); r.read_float()
235
+ if nonessential:
236
+ r.read_int32()
237
+ return {"type": "Point", "path": name}
238
+
239
+ if attachment_type == "Clipping":
240
+ r.read_varint(True) # endSlotIndex
241
+ _read_vertices_42(r, bool(flags & 16))
242
+ if nonessential:
243
+ r.read_int32()
244
+ return {"type": "Clipping", "path": name}
245
+
246
+ raise ValueError(f"Unknown attachment type flag: {type_index}")
247
+
248
+
249
+ def _read_vertices_42(r: BinaryReader, weighted: bool) -> int:
250
+ """Returns floatCount (the real JS returns { floatCount } -- Python
251
+ returns it bare since that's the only field callers ever read)."""
252
+ vertex_count = r.read_varint(True)
253
+ float_count = vertex_count * 2
254
+ if not weighted:
255
+ for _ in range(float_count):
256
+ r.read_float()
257
+ return float_count
258
+ for _ in range(vertex_count):
259
+ bone_count = r.read_varint(True)
260
+ for _ in range(bone_count):
261
+ r.read_varint(True) # boneIndex
262
+ r.read_float(); r.read_float(); r.read_float() # weightX, weightY, weightValue
263
+ return float_count
264
+
265
+
266
+ def _read_float_array_42(r: BinaryReader, n: int) -> list[float]:
267
+ return [r.read_float() for _ in range(n)]
268
+
269
+
270
+ def _skip_sequence_42(r: BinaryReader) -> None:
271
+ r.read_varint(True); r.read_varint(True); r.read_varint(True); r.read_varint(True)
272
+
273
+
274
+ def _skip_skin_bone_and_constraint_refs_42(r: BinaryReader) -> None:
275
+ bone_count = r.read_varint(True)
276
+ for _ in range(bone_count):
277
+ r.read_varint(True)
278
+ ik_count = r.read_varint(True)
279
+ for _ in range(ik_count):
280
+ r.read_varint(True)
281
+ transform_count = r.read_varint(True)
282
+ for _ in range(transform_count):
283
+ r.read_varint(True)
284
+ path_count = r.read_varint(True)
285
+ for _ in range(path_count):
286
+ r.read_varint(True)
287
+ physics_count = r.read_varint(True)
288
+ for _ in range(physics_count):
289
+ r.read_varint(True)
@@ -0,0 +1,99 @@
1
+ Metadata-Version: 2.5
2
+ Name: skel-mesh-parser
3
+ Version: 0.3.0
4
+ Summary: Minimal dependency-free parser for the skin/attachment section of Spine skeleton binary files (.skel, 3.8.x and 4.2.x). Python port of the js branch's spine-skeleton-binary-js.
5
+ License-Expression: Apache-2.0
6
+ License-File: LICENSE
7
+ License-File: THIRD_PARTY_NOTICES.md
8
+ Requires-Python: >=3.11
9
+ Description-Content-Type: text/markdown
10
+
11
+ # skel-mesh-parser (Python)
12
+
13
+ Python port of this repo's `js` branch (`spine-skeleton-binary-js`): a
14
+ minimal, dependency-free parser for the skin/attachment section of Spine
15
+ skeleton binary files (`.skel`) that returns, per attachment, its raw type
16
+ and — for `Mesh`-type attachments — the `uvs`/`triangles` needed to build a
17
+ texture-space silhouette. It is **not** a Spine runtime: no rendering, no
18
+ animation, no timelines, IK, physics, or constraint solving. Supports Spine
19
+ versions **3.8.x and 4.2.x only** (anything else raises
20
+ `UnsupportedVersionError`).
21
+
22
+ **Status:** implemented — `parse_skeleton` is wired up for both 3.8.x and
23
+ 4.2.x. It is a field-for-field port of the `js` branch's reader and has been
24
+ validated against the official Spine 3.8 `goblins-pro.skel` example (see
25
+ [Testing](#testing)).
26
+
27
+ ## Usage
28
+
29
+ ```python
30
+ from skel_mesh_parser import parse_skeleton
31
+
32
+ data = open("some.skel", "rb").read()
33
+ result = parse_skeleton(data)
34
+
35
+ # result["version"]: {"major": int, "minor": int, "patch": int, "raw": str}
36
+ # result["attachments"]: dict[str, AttachmentInfo], keyed by the
37
+ # attachment's resolved path (the atlas region name it draws from)
38
+
39
+ info = result["attachments"]["some_region_name"]
40
+ # info["type"]: "Region" | "BoundingBox" | "Mesh" | "LinkedMesh" | "Path" | "Point" | "Clipping"
41
+ # info["uvs"] / info["triangles"] / info["hull_length"]: present ONLY when
42
+ # info["type"] == "Mesh" (hull_length is the js branch's `hullLength`: the
43
+ # number of outline vertices, i.e. the first hull_length UV pairs)
44
+ ```
45
+
46
+ **Scope, by design (same as the `js` branch):**
47
+ - Default skin only. Non-default skins are walked (to keep the byte stream
48
+ aligned) but not returned.
49
+ - `Mesh`-type attachments only carry `uvs`/`triangles`/`hull_length`.
50
+ - `LinkedMesh` is reported as its own distinct type, never confused with
51
+ `Mesh`.
52
+ - On an attachment-path collision within the same skin, the `Mesh` entry
53
+ always wins, deterministically, regardless of wire order.
54
+
55
+ ## Versions and tags
56
+
57
+ The two branches are released independently, each with its own version
58
+ numbers and tag prefix:
59
+
60
+ - `py-vX.Y.Z` — this `python` branch (the version in `pyproject.toml`).
61
+ - `js-vX.Y.Z` — the `js` branch (`spine-skeleton-binary-js`).
62
+
63
+ Older unprefixed tags (`v1.0.0`, `v1.1.0`) belong to the `js` branch.
64
+ To depend on a fixed release, pin the tag rather than the branch, e.g.
65
+ `skel-mesh-parser @ git+https://github.com/com55/skel-mesh-parser.git@py-v0.3.0`.
66
+
67
+ ## Testing
68
+
69
+ ```sh
70
+ python -m pytest # all normal tests — offline, no Spine assets needed
71
+ python -m pytest -m integration # needs the official Spine 3.8 example asset (see below)
72
+ ```
73
+
74
+ (or `uv run pytest` / `uv run pytest -m integration`)
75
+
76
+ - **Normal tests** use only hand-built binary fixtures created for this repo (`tests/fixtures/`). They never touch the network or any Spine asset.
77
+ - **Integration test** (`tests/integration/`) validates the 3.8 reader against the official Spine example `goblins-pro.skel`, using the same oracle values as the `js` branch. **This repository does not distribute that file** — see [THIRD_PARTY_NOTICES.md](THIRD_PARTY_NOTICES.md). Instead, `tests/spine_fixture.py` resolves it as follows:
78
+ 1. If `SPINE_GOBLINS_SKEL=/path/to/goblins-pro.skel` is set, that file is used (and never downloaded).
79
+ 2. Otherwise `.cache/spine/goblins-pro.skel` (gitignored) is reused if present.
80
+ 3. Otherwise it is downloaded once from Esoteric Software's official `EsotericSoftware/spine-runtimes` repository, at a **pinned commit** (not a moving branch), and cached.
81
+ - **Checksum verification.** Every source is verified against a pinned SHA-256 (`GOBLINS_SKEL_SHA256`). A mismatch fails the test run; a cached file with the wrong checksum is discarded and re-downloaded. Nothing is written to the cache unless it verified.
82
+ - **Fixture unavailable** (offline, HTTP error): the integration tests are skipped with a message explaining how to supply the file. Set `SPINE_FIXTURE_REQUIRED=1` (as CI does) to fail instead of skip.
83
+
84
+ ## Provenance
85
+
86
+ This is a port of the `js` branch's implementation, which was written independently. The official Spine Runtime source was consulted only to verify binary-format behavior and field layout; its source code was not copied or translated into this project. The reference source (`spine-ts`) is licensed under the Spine Runtimes License, which is not a permissive license. This project is not a Spine runtime. See the `js` branch's README and source comments for the exact file/line/commit each field-layout fact was checked against. Pinned commits (branch HEAD at time of writing, 2026-08-28 — re-verify before relying on a moved branch ref):
87
+ - 4.2: `EsotericSoftware/spine-runtimes@b81e5a58ed38704aee4f866f0e0ac672623ce914`, `spine-ts/spine-core/src/SkeletonBinary.ts`
88
+ - 3.8: `EsotericSoftware/spine-runtimes@8b4844bd4b193ba9e54487ed397a777993cbad56`, `spine-ts/core/src/SkeletonBinary.ts`
89
+
90
+ ## Disclaimer
91
+
92
+ This project is **not affiliated with, endorsed by, or associated with
93
+ Esoteric Software** or the Spine runtime in any way. "Spine" is a trademark
94
+ of Esoteric Software.
95
+
96
+ Licensed under the [Apache License 2.0](LICENSE). That license applies to this
97
+ project's source code only, not to third-party assets or trademarks — see
98
+ [THIRD_PARTY_NOTICES.md](THIRD_PARTY_NOTICES.md). Provided **as-is, without
99
+ warranty of any kind** — see [LICENSE](LICENSE) for details.
@@ -0,0 +1,10 @@
1
+ skel_mesh_parser/__init__.py,sha256=zEyr1w2-WeDZV8xyWGwIGH50qnIGIgUDdnjebuQqf_8,1641
2
+ skel_mesh_parser/binary_reader.py,sha256=IJJPKu-w-Js_w-svBUNZUyUm7TYf4X-M8GdI3047x5Y,6756
3
+ skel_mesh_parser/detect_version.py,sha256=vT0xO4OUnjiIbTMLwbIOlhdYjda8gBL3Wq2DUzZfOgg,1788
4
+ skel_mesh_parser/read_skeleton_38.py,sha256=1LgtknH-ytNEi4n5FV8KvbAZsgZT7f5xH_QMbnIHe6g,9223
5
+ skel_mesh_parser/read_skeleton_42.py,sha256=jHe1NkMUHtLe5KM2vRI5cvidiE883i9KVzcZvKUrhVc,10447
6
+ skel_mesh_parser-0.3.0.dist-info/METADATA,sha256=zZkruGmJaumuri1LfVcDVBTgQfQxcs-xHnOT0gyqsJU,5796
7
+ skel_mesh_parser-0.3.0.dist-info/WHEEL,sha256=2iZrJkDIkeDh0k9SikKMqFuRP-ua6mb4Ir1AsER4BEw,87
8
+ skel_mesh_parser-0.3.0.dist-info/licenses/LICENSE,sha256=wDQHlzu5us_f4GoNVIVt_g3Y-wfM5kSoLvWPoENvM_w,11336
9
+ skel_mesh_parser-0.3.0.dist-info/licenses/THIRD_PARTY_NOTICES.md,sha256=9fnbfhYXfQwwSIvm0nyQL6JlfLIbXLsJprdUMEvO5IM,1733
10
+ skel_mesh_parser-0.3.0.dist-info/RECORD,,
@@ -0,0 +1,4 @@
1
+ Wheel-Version: 1.0
2
+ Generator: hatchling 1.33.0
3
+ Root-Is-Purelib: true
4
+ Tag: py3-none-any
@@ -0,0 +1,202 @@
1
+
2
+ Apache License
3
+ Version 2.0, January 2004
4
+ http://www.apache.org/licenses/
5
+
6
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
7
+
8
+ 1. Definitions.
9
+
10
+ "License" shall mean the terms and conditions for use, reproduction,
11
+ and distribution as defined by Sections 1 through 9 of this document.
12
+
13
+ "Licensor" shall mean the copyright owner or entity authorized by
14
+ the copyright owner that is granting the License.
15
+
16
+ "Legal Entity" shall mean the union of the acting entity and all
17
+ other entities that control, are controlled by, or are under common
18
+ control with that entity. For the purposes of this definition,
19
+ "control" means (i) the power, direct or indirect, to cause the
20
+ direction or management of such entity, whether by contract or
21
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
22
+ outstanding shares, or (iii) beneficial ownership of such entity.
23
+
24
+ "You" (or "Your") shall mean an individual or Legal Entity
25
+ exercising permissions granted by this License.
26
+
27
+ "Source" form shall mean the preferred form for making modifications,
28
+ including but not limited to software source code, documentation
29
+ source, and configuration files.
30
+
31
+ "Object" form shall mean any form resulting from mechanical
32
+ transformation or translation of a Source form, including but
33
+ not limited to compiled object code, generated documentation,
34
+ and conversions to other media types.
35
+
36
+ "Work" shall mean the work of authorship, whether in Source or
37
+ Object form, made available under the License, as indicated by a
38
+ copyright notice that is included in or attached to the work
39
+ (an example is provided in the Appendix below).
40
+
41
+ "Derivative Works" shall mean any work, whether in Source or Object
42
+ form, that is based on (or derived from) the Work and for which the
43
+ editorial revisions, annotations, elaborations, or other modifications
44
+ represent, as a whole, an original work of authorship. For the purposes
45
+ of this License, Derivative Works shall not include works that remain
46
+ separable from, or merely link (or bind by name) to the interfaces of,
47
+ the Work and Derivative Works thereof.
48
+
49
+ "Contribution" shall mean any work of authorship, including
50
+ the original version of the Work and any modifications or additions
51
+ to that Work or Derivative Works thereof, that is intentionally
52
+ submitted to Licensor for inclusion in the Work by the copyright owner
53
+ or by an individual or Legal Entity authorized to submit on behalf of
54
+ the copyright owner. For the purposes of this definition, "submitted"
55
+ means any form of electronic, verbal, or written communication sent
56
+ to the Licensor or its representatives, including but not limited to
57
+ communication on electronic mailing lists, source code control systems,
58
+ and issue tracking systems that are managed by, or on behalf of, the
59
+ Licensor for the purpose of discussing and improving the Work, but
60
+ excluding communication that is conspicuously marked or otherwise
61
+ designated in writing by the copyright owner as "Not a Contribution."
62
+
63
+ "Contributor" shall mean Licensor and any individual or Legal Entity
64
+ on behalf of whom a Contribution has been received by Licensor and
65
+ subsequently incorporated within the Work.
66
+
67
+ 2. Grant of Copyright License. Subject to the terms and conditions of
68
+ this License, each Contributor hereby grants to You a perpetual,
69
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
70
+ copyright license to reproduce, prepare Derivative Works of,
71
+ publicly display, publicly perform, sublicense, and distribute the
72
+ Work and such Derivative Works in Source or Object form.
73
+
74
+ 3. Grant of Patent License. Subject to the terms and conditions of
75
+ this License, each Contributor hereby grants to You a perpetual,
76
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
77
+ (except as stated in this section) patent license to make, have made,
78
+ use, offer to sell, sell, import, and otherwise transfer the Work,
79
+ where such license applies only to those patent claims licensable
80
+ by such Contributor that are necessarily infringed by their
81
+ Contribution(s) alone or by combination of their Contribution(s)
82
+ with the Work to which such Contribution(s) was submitted. If You
83
+ institute patent litigation against any entity (including a
84
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
85
+ or a Contribution incorporated within the Work constitutes direct
86
+ or contributory patent infringement, then any patent licenses
87
+ granted to You under this License for that Work shall terminate
88
+ as of the date such litigation is filed.
89
+
90
+ 4. Redistribution. You may reproduce and distribute copies of the
91
+ Work or Derivative Works thereof in any medium, with or without
92
+ modifications, and in Source or Object form, provided that You
93
+ meet the following conditions:
94
+
95
+ (a) You must give any other recipients of the Work or
96
+ Derivative Works a copy of this License; and
97
+
98
+ (b) You must cause any modified files to carry prominent notices
99
+ stating that You changed the files; and
100
+
101
+ (c) You must retain, in the Source form of any Derivative Works
102
+ that You distribute, all copyright, patent, trademark, and
103
+ attribution notices from the Source form of the Work,
104
+ excluding those notices that do not pertain to any part of
105
+ the Derivative Works; and
106
+
107
+ (d) If the Work includes a "NOTICE" text file as part of its
108
+ distribution, then any Derivative Works that You distribute must
109
+ include a readable copy of the attribution notices contained
110
+ within such NOTICE file, excluding those notices that do not
111
+ pertain to any part of the Derivative Works, in at least one
112
+ of the following places: within a NOTICE text file distributed
113
+ as part of the Derivative Works; within the Source form or
114
+ documentation, if provided along with the Derivative Works; or,
115
+ within a display generated by the Derivative Works, if and
116
+ wherever such third-party notices normally appear. The contents
117
+ of the NOTICE file are for informational purposes only and
118
+ do not modify the License. You may add Your own attribution
119
+ notices within Derivative Works that You distribute, alongside
120
+ or as an addendum to the NOTICE text from the Work, provided
121
+ that such additional attribution notices cannot be construed
122
+ as modifying the License.
123
+
124
+ You may add Your own copyright statement to Your modifications and
125
+ may provide additional or different license terms and conditions
126
+ for use, reproduction, or distribution of Your modifications, or
127
+ for any such Derivative Works as a whole, provided Your use,
128
+ reproduction, and distribution of the Work otherwise complies with
129
+ the conditions stated in this License.
130
+
131
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
132
+ any Contribution intentionally submitted for inclusion in the Work
133
+ by You to the Licensor shall be under the terms and conditions of
134
+ this License, without any additional terms or conditions.
135
+ Notwithstanding the above, nothing herein shall supersede or modify
136
+ the terms of any separate license agreement you may have executed
137
+ with Licensor regarding such Contributions.
138
+
139
+ 6. Trademarks. This License does not grant permission to use the trade
140
+ names, trademarks, service marks, or product names of the Licensor,
141
+ except as required for reasonable and customary use in describing the
142
+ origin of the Work and reproducing the content of the NOTICE file.
143
+
144
+ 7. Disclaimer of Warranty. Unless required by applicable law or
145
+ agreed to in writing, Licensor provides the Work (and each
146
+ Contributor provides its Contributions) on an "AS IS" BASIS,
147
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
148
+ implied, including, without limitation, any warranties or conditions
149
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
150
+ PARTICULAR PURPOSE. You are solely responsible for determining the
151
+ appropriateness of using or redistributing the Work and assume any
152
+ risks associated with Your exercise of permissions under this License.
153
+
154
+ 8. Limitation of Liability. In no event and under no legal theory,
155
+ whether in tort (including negligence), contract, or otherwise,
156
+ unless required by applicable law (such as deliberate and grossly
157
+ negligent acts) or agreed to in writing, shall any Contributor be
158
+ liable to You for damages, including any direct, indirect, special,
159
+ incidental, or consequential damages of any character arising as a
160
+ result of this License or out of the use or inability to use the
161
+ Work (including but not limited to damages for loss of goodwill,
162
+ work stoppage, computer failure or malfunction, or any and all
163
+ other commercial damages or losses), even if such Contributor
164
+ has been advised of the possibility of such damages.
165
+
166
+ 9. Accepting Warranty or Additional Liability. While redistributing
167
+ the Work or Derivative Works thereof, You may choose to offer,
168
+ and charge a fee for, acceptance of support, warranty, indemnity,
169
+ or other liability obligations and/or rights consistent with this
170
+ License. However, in accepting such obligations, You may act only
171
+ on Your own behalf and on Your sole responsibility, not on behalf
172
+ of any other Contributor, and only if You agree to indemnify,
173
+ defend, and hold each Contributor harmless for any liability
174
+ incurred by, or claims asserted against, such Contributor by reason
175
+ of your accepting any such warranty or additional liability.
176
+
177
+ END OF TERMS AND CONDITIONS
178
+
179
+ APPENDIX: How to apply the Apache License to your work.
180
+
181
+ To apply the Apache License to your work, attach the following
182
+ boilerplate notice, with the fields enclosed by brackets "[]"
183
+ replaced with your own identifying information. (Don't include
184
+ the brackets!) The text should be enclosed in the appropriate
185
+ comment syntax for the file format. We also recommend that a
186
+ file or class name and description of purpose be included on the
187
+ same "printed page" as the copyright notice for easier
188
+ identification within third-party archives.
189
+
190
+ Copyright 2026 com55
191
+
192
+ Licensed under the Apache License, Version 2.0 (the "License");
193
+ you may not use this file except in compliance with the License.
194
+ You may obtain a copy of the License at
195
+
196
+ http://www.apache.org/licenses/LICENSE-2.0
197
+
198
+ Unless required by applicable law or agreed to in writing, software
199
+ distributed under the License is distributed on an "AS IS" BASIS,
200
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
201
+ See the License for the specific language governing permissions and
202
+ limitations under the License.
@@ -0,0 +1,31 @@
1
+ # Third-party notices
2
+
3
+ This project's source code is licensed under the [Apache License 2.0](LICENSE).
4
+ That license applies **only to this project's own source code**. It does not
5
+ cover, and grants no rights in, any third-party asset or trademark.
6
+
7
+ ## Esoteric Software / Spine
8
+
9
+ - **Trademarks.** "Spine" is a trademark of Esoteric Software. This project is
10
+ not affiliated with, endorsed by, or associated with Esoteric Software, and the
11
+ Apache-2.0 license does not grant any right to use that trademark.
12
+ - **Spine Runtimes source.** The official Spine Runtimes (`spine-runtimes`) are
13
+ licensed under the Spine Runtimes License, which is not a permissive license.
14
+ No code from them is included in this repository; they were consulted only to
15
+ verify binary-format behavior and field layout (see "Provenance" in the
16
+ README).
17
+ - **Official example assets.** The optional integration test uses the official
18
+ Spine 3.8 `goblins-pro.skel` example export. **This repository does not
19
+ contain or distribute that file.** It is fetched on demand from Esoteric
20
+ Software's official `EsotericSoftware/spine-runtimes` repository (pinned
21
+ commit, SHA-256 verified; see the README "Testing" section), or supplied by
22
+ you via `SPINE_GOBLINS_SKEL`. The file remains subject to its original Esoteric
23
+ Software terms, including the license file that accompanies the examples in
24
+ that repository. If you fetch or use it, you are responsible for complying with
25
+ those terms. The Apache-2.0 license of this project does not apply to it.
26
+
27
+ ## Other
28
+
29
+ - The integration test's expected values were cross-checked against the
30
+ independent `spine_asset` Python package (MIT-licensed). It is not included in,
31
+ or required by, this repository.