minimindslab-toml-inline-table-sort 0.1.0__py3-none-any.whl

minimindslab_toml_inline_table_sort/__init__.py

@@ -0,0 +1,167 @@
+"""MiniMindsLab TOML Inline Table Sort."""
+
+from __future__ import annotations
+
+__all__ = ["sort_toml_inline_tables"]
+
+
+def sort_toml_inline_tables(text: str) -> str:
+    """Return *text* with keys sorted in each TOML inline table.
+
+    The function preserves all bytes outside inline-table/inline-array structures.
+    Inside each inline table, keys are sorted ascending by key name.
+    """
+    if not isinstance(text, str):
+        raise TypeError("text must be a str")
+    parser = _Parser(text)
+    return parser.transform()
+
+
+class _Parser:
+    def __init__(self, s: str) -> None:
+        self.s = s
+        self.n = len(s)
+
+    def transform(self) -> str:
+        out: list[str] = []
+        i = 0
+        while i < self.n:
+            c = self.s[i]
+            if c in ('"', "'"):
+                j = self._read_string(i)
+                out.append(self.s[i:j])
+                i = j
+                continue
+            if c == "{":
+                table, j = self._parse_inline_table(i)
+                out.append(self._render_table(table))
+                i = j
+                continue
+            if c == "[":
+                arr, j = self._parse_array(i)
+                out.append(self._render_array(arr))
+                i = j
+                continue
+            out.append(c)
+            i += 1
+        return "".join(out)
+
+    def _skip_ws(self, i: int) -> int:
+        while i < self.n and self.s[i] in " \t\r\n":
+            i += 1
+        return i
+
+    def _read_string(self, i: int) -> int:
+        q = self.s[i]
+        i += 1
+        while i < self.n:
+            c = self.s[i]
+            if q == '"' and c == "\\":
+                i += 2
+                continue
+            if c == q:
+                return i + 1
+            i += 1
+        raise ValueError("Unterminated string")
+
+    def _parse_array(self, i: int):
+        assert self.s[i] == "["
+        i += 1
+        items = []
+        while True:
+            i = self._skip_ws(i)
+            if i >= self.n:
+                raise ValueError("Malformed array")
+            if self.s[i] == "]":
+                return items, i + 1
+            val, i = self._parse_value(i)
+            items.append(val)
+            i = self._skip_ws(i)
+            if i >= self.n:
+                raise ValueError("Malformed array")
+            if self.s[i] == ",":
+                i += 1
+                continue
+            if self.s[i] == "]":
+                return items, i + 1
+            raise ValueError("Malformed array")
+
+    def _parse_inline_table(self, i: int):
+        assert self.s[i] == "{"
+        i += 1
+        pairs = []
+        while True:
+            i = self._skip_ws(i)
+            if i >= self.n:
+                raise ValueError("Malformed inline table")
+            if self.s[i] == "}":
+                return pairs, i + 1
+            key, i = self._parse_key(i)
+            i = self._skip_ws(i)
+            if i >= self.n or self.s[i] != "=":
+                raise ValueError("Malformed inline table")
+            i += 1
+            i = self._skip_ws(i)
+            val, i = self._parse_value(i)
+            pairs.append((key, val))
+            i = self._skip_ws(i)
+            if i >= self.n:
+                raise ValueError("Malformed inline table")
+            if self.s[i] == ",":
+                i += 1
+                continue
+            if self.s[i] == "}":
+                return pairs, i + 1
+            raise ValueError("Malformed inline table")
+
+    def _parse_key(self, i: int):
+        if i >= self.n:
+            raise ValueError("Malformed key")
+        c = self.s[i]
+        if c in ('"', "'"):
+            j = self._read_string(i)
+            return self.s[i:j], j
+        start = i
+        while i < self.n and (self.s[i].isalnum() or self.s[i] in "_-"):
+            i += 1
+        if i == start:
+            raise ValueError("Malformed key")
+        return self.s[start:i], i
+
+    def _parse_value(self, i: int):
+        if i >= self.n:
+            raise ValueError("Malformed value")
+        c = self.s[i]
+        if c == "{":
+            return self._parse_inline_table(i)
+        if c == "[":
+            return self._parse_array(i)
+        if c in ('"', "'"):
+            j = self._read_string(i)
+            return self.s[i:j], j
+        start = i
+        while i < self.n and self.s[i] not in ",}]":
+            if self.s[i] in ('"', "'"):
+                j = self._read_string(i)
+                i = j
+                continue
+            i += 1
+        raw = self.s[start:i].strip()
+        if raw == "":
+            raise ValueError("Malformed value")
+        return raw, i
+
+    def _render_value(self, v):
+        if isinstance(v, list):
+            if v and isinstance(v[0], tuple):
+                return self._render_table(v)
+            return self._render_array(v)
+        return v
+
+    def _render_table(self, pairs):
+        sorted_pairs = sorted(pairs, key=lambda kv: kv[0])
+        inner = ", ".join(f"{k} = {self._render_value(v)}" for k, v in sorted_pairs)
+        return "{" + inner + "}"
+
+    def _render_array(self, items):
+        return "[" + ", ".join(self._render_value(v) for v in items) + "]"

minimindslab_toml_inline_table_sort-0.1.0.dist-info/METADATA

@@ -0,0 +1,32 @@
+Metadata-Version: 2.4
+Name: minimindslab-toml-inline-table-sort
+Version: 0.1.0
+Summary: Deterministically reorder keys inside TOML inline tables and inline array-of-tables fragments while preserving all scalar values and whitespace outside the targeted structures.
+Author: MiniMindsLab
+License: MIT
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+# MiniMindsLab TOML Inline Table Sort
+
+Deterministically reorder keys inside TOML inline tables while keeping document text outside those inline tables unchanged.
+
+## What it does
+
+- Sorts keys within TOML inline tables, e.g. `{b = 2, a = 1}` -> `{a = 1, b = 2}`.
+- Recursively sorts nested inline tables.
+- Handles inline array-of-tables fragments, e.g. `[{b=2,a=1}, {d=4,c=3}]`.
+- Leaves non-targeted text and whitespace outside targeted inline structures unchanged.
+- Raises `ValueError` for malformed inline-table syntax.
+
+## Usage
+
+```python
+from minimindslab_toml_inline_table_sort import sort_toml_inline_tables
+
+text = "a = {b = 2, a = 1}\n"
+print(sort_toml_inline_tables(text))
+# a = {a = 1, b = 2}
+```

minimindslab_toml_inline_table_sort-0.1.0.dist-info/RECORD

@@ -0,0 +1,6 @@
+minimindslab_toml_inline_table_sort/__init__.py,sha256=wpm44Yd15CS0M7rl1dMrHivC9WNNsPjFSmk9mDJyUe4,5138
+minimindslab_toml_inline_table_sort-0.1.0.dist-info/licenses/LICENSE,sha256=9SsHAp-rmsco8evLbp-_802okWchTYdG-RZx5d3yddM,1069
+minimindslab_toml_inline_table_sort-0.1.0.dist-info/METADATA,sha256=C2ERbYEbHvjaracY9Pc2wN04quHbN41pd1f2D6nOS1w,1120
+minimindslab_toml_inline_table_sort-0.1.0.dist-info/WHEEL,sha256=mOdXR9C3wMVov7cSY8PY-XCzo3SmmWCHvGQr5csJoao,91
+minimindslab_toml_inline_table_sort-0.1.0.dist-info/top_level.txt,sha256=yOUd8MOjA2ukBt1jXcy0dfBFnw8iJmMsCqB7FXSKu8U,36
+minimindslab_toml_inline_table_sort-0.1.0.dist-info/RECORD,,

minimindslab_toml_inline_table_sort-0.1.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (84.2.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

minimindslab_toml_inline_table_sort-0.1.0.dist-info/licenses/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 MiniMindsLab
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+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 OR COPYRIGHT HOLDERS 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.

minimindslab_toml_inline_table_sort-0.1.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+minimindslab_toml_inline_table_sort