sillyvis 0.1.1__tar.gz

sillyvis-0.1.1/.gitignore

@@ -0,0 +1,21 @@
+# Build artifacts
+dist/
+build/
+*.egg-info/
+*.whl
+*.tar.gz
+
+# Python
+__pycache__/
+*.pyc
+*.pyo
+.pytest_cache/
+.ruff_cache/
+
+# IDE
+.vscode/
+.idea/
+
+# uv
+.venv/
+uv.lock

sillyvis-0.1.1/PKG-INFO

@@ -0,0 +1,7 @@
+Metadata-Version: 2.5
+Name: sillyvis
+Version: 0.1.1
+Summary: Sorting algorithm visualizer powered by matplotlib animations
+Author-email: Small Ai <3910271726@qq.com>
+Requires-Python: >=3.8
+Requires-Dist: matplotlib>=3.5

sillyvis-0.1.1/README.md

@@ -0,0 +1,59 @@
+# sillysort
+
+> 一行代码，把排序算法变成动画。
+
+`sillysort` 是一个用 matplotlib 驱动的排序算法可视化库。你只需要写一个生成器函数描述排序过程，剩下的交给 `go`。
+
+## 安装
+
+```bash
+pip install sillysort
+```
+
+## 快速上手
+
+```python
+from sillysort import Silly as s, frame
+
+def bubble_sort(arr):
+    n = len(arr)
+    for i in range(n):
+        for j in range(n - i - 1):
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]
+            yield frame(
+                (arr, {j: s.LEFT_PTR, j + 1: s.RIGHT_PTR}),
+                text=f"比较并交换 ({i+1}/{n})"
+            )
+
+s([3, 1, 4, 2, 7, 5, 6]).go(bubble_sort)
+```
+
+## 高亮颜色
+
+| 常量 | 含义 | 颜色 |
+|---|---|---|
+| `Silly.NORMAL` | 默认 | 蓝色 |
+| `Silly.HIGHLIGHT` | 高亮 | 红色 |
+| `Silly.LEFT_PTR` | 左指针 | 橙色 |
+| `Silly.RIGHT_PTR` | 右指针 | 紫色 |
+| `Silly.LOCKED` | 已锁定 | 绿色 |
+
+## 多排模式
+
+同时展示主数组 + 辅助数组：
+
+```python
+def merge_sort(arr):
+    aux = [0] * len(arr)
+    # ... 排序逻辑
+    yield frame(
+        (arr, {i: s.HIGHLIGHT}),
+        (aux, {k: s.LOCKED}),
+        text="归并中"
+    )
+```
+
+## 许可
+
+MIT

sillyvis-0.1.1/examples/bubble_sort.py

@@ -0,0 +1,29 @@
+"""冒泡排序示例"""
+
+from sillysort import Silly as s, frame
+
+
+def bubble_sort(arr):
+    n = len(arr)
+    for i in range(n):
+        for j in range(n - i - 1):
+            yield frame(
+                (arr, {j: s.LEFT_PTR, j + 1: s.RIGHT_PTR}),
+                text=f"第 {i+1} 轮比较",
+            )
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]
+                yield frame(
+                    (arr, {j: s.HIGHLIGHT, j + 1: s.HIGHLIGHT}),
+                    text=f"交换 {arr[j+1]} <-> {arr[j]}",
+                )
+
+    # 全部锁定
+    yield frame((arr, {i: s.LOCKED for i in range(n)}), text="排序完成！")
+
+
+if __name__ == "__main__":
+    import random
+
+    data = random.sample(range(1, 50), 15)
+    s(data).go(bubble_sort)

sillyvis-0.1.1/examples/merge_sort.py

@@ -0,0 +1,58 @@
+"""归并排序 —— 多排模式展示原数组 + 辅助数组"""
+
+from sillysort import Silly as s, frame
+
+
+def merge_sort(arr):
+    aux = [0] * len(arr)
+
+    def _merge(lo, mid, hi):
+        aux[lo : hi + 1] = arr[lo : hi + 1]
+        yield frame(
+            (arr, {i: s.NORMAL for i in range(len(arr))}),
+            (aux, {i: s.HIGHLIGHT for i in range(lo, hi + 1)}),
+            text=f"拷贝 [{lo}..{hi}] 到辅助数组",
+        )
+
+        i, j = lo, mid + 1
+        for k in range(lo, hi + 1):
+            if i > mid:
+                arr[k] = aux[j]
+                j += 1
+            elif j > hi:
+                arr[k] = aux[i]
+                i += 1
+            elif aux[j] < aux[i]:
+                arr[k] = aux[j]
+                j += 1
+            else:
+                arr[k] = aux[i]
+                i += 1
+
+            yield frame(
+                (arr, {k: s.HIGHLIGHT}),
+                (aux, {lo: s.LEFT_PTR, hi: s.RIGHT_PTR}),
+                text=f"归并写入位置 {k}",
+            )
+
+    def _sort(lo, hi):
+        if hi <= lo:
+            return
+        mid = (lo + hi) // 2
+        yield from _sort(lo, mid)
+        yield from _sort(mid + 1, hi)
+        yield from _merge(lo, mid, hi)
+
+    yield from _sort(0, len(arr) - 1)
+    yield frame(
+        (arr, {i: s.LOCKED for i in range(len(arr))}),
+        (aux, {}),
+        text="归并排序完成！",
+    )
+
+
+if __name__ == "__main__":
+    import random
+
+    data = random.sample(range(1, 50), 12)
+    s(data).go(merge_sort)

sillyvis-0.1.1/pyproject.toml

@@ -0,0 +1,15 @@
+[project]
+name = "sillyvis"
+version = "0.1.1"
+description = "Sorting algorithm visualizer powered by matplotlib animations"
+authors = [{name = "Small Ai", email = "3910271726@qq.com"}]
+dependencies = ["matplotlib>=3.5"]
+requires-python = ">=3.8"
+
+[build-system]
+requires = ["hatchling"]
+build-backend = "hatchling.build"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/sillyvis"]
+

sillyvis-0.1.1/src/sillyvis/__init__.py

@@ -0,0 +1,6 @@
+"""sillysort — 排序算法可视化"""
+
+from .core import Silly, frame
+
+__all__ = ["Silly", "frame"]
+__version__ = "0.1.0"

sillyvis-0.1.1/src/sillyvis/core.py

@@ -0,0 +1,170 @@
+import matplotlib
+
+matplotlib.use("TkAgg")
+
+import matplotlib.pyplot as plt
+from matplotlib.animation import FuncAnimation
+from matplotlib import rcParams, font_manager
+
+
+class Silly:
+    """排序可视化器
+
+    约定（多排模式）：
+        yield ( [arr, aux, count, ...],        # list of list，每排一个数组
+                [hl1, hl2, hl3, ...],          # 同长度的 list of dict，每排各自的高亮
+                "描述文字" )
+        hl 每个元素可以是 dict {idx: color}，也可以是一组索引 (用默认高亮色)。
+
+    单排模式（兼容旧用法）：
+        yield ( arr, hl_dict, "描述文字" )
+    """
+
+    NORMAL = "#4e8df5"
+    HIGHLIGHT = "#ff4d4d"
+    LEFT_PTR = "#ff9f1c"
+    RIGHT_PTR = "#9b5de5"
+    LOCKED = "#2ecc71"
+
+    def __init__(self, data, n=None, font_path=None):
+        self.data = list(data)
+        self.n = len(self.data) if n is None else n
+
+        # 中文字体
+        if font_path:
+            try:
+                font_manager.fontManager.addfont(font_path)
+            except Exception:
+                pass
+            available = [
+                f.name
+                for f in font_manager.fontManager.ttflist
+                if "Noto" in f.name and "CJK" in f.name
+            ]
+            cjk_name = None
+            for name in available:
+                if "SC" in name:
+                    cjk_name = name
+                    break
+            if cjk_name is None and available:
+                cjk_name = available[0]
+            if cjk_name:
+                rcParams["font.sans-serif"] = [cjk_name]
+        rcParams["font.family"] = "sans-serif"
+        rcParams["axes.unicode_minus"] = False
+
+        self.fig, self.ax = plt.subplots(figsize=(13, 7))
+        self.ax.set_xticks([])
+        self.ax.set_yticks([])
+        self.info_text = self.ax.text(
+            0.01,
+            0.99,
+            "",
+            transform=self.ax.transAxes,
+            fontsize=13,
+            fontweight="bold",
+            color="#333333",
+            va="top",
+        )
+        # 默认单排
+        self.bar_groups = [
+            self.ax.bar(range(self.n), self.data, color=self.NORMAL)
+        ]
+        self.multi = False
+        self.ani = None
+
+    def _resolve_arrays(self, arrays):
+        """判断并统一成 list-of-lists；返回 (arrays_list, multi_flag)"""
+        if isinstance(arrays, list) and arrays and isinstance(arrays[0], list):
+            return arrays, True
+        return [arrays], False
+
+    def _ensure_bars(self, arrays_list, multi):
+        """根据数组数量/长度重建柱子；arr 在 idx=0 → bottom=0 → 最底下"""
+        target = len(arrays_list)
+        need_rebuild = self.multi != multi or len(self.bar_groups) != target
+        if not need_rebuild:
+            # 更新高度即可
+            for group, arr in zip(self.bar_groups, arrays_list):
+                for idx, b in enumerate(group):
+                    if idx < len(arr):
+                        b.set_height(arr[idx])
+            return
+
+        # 重建
+        for group in self.bar_groups:
+            for b in group:
+                b.remove()
+        self.bar_groups = []
+        self.multi = multi
+
+        if multi:
+            max_val = max(max(a) for a in arrays_list)
+            gap = max_val * 0.2
+            for idx, arr in enumerate(arrays_list):
+                bottom = idx * (max_val + gap)
+                self.bar_groups.append(
+                    self.ax.bar(
+                        range(len(arr)), arr, bottom=bottom, color=self.NORMAL, width=0.8
+                    )
+                )
+            top = (len(arrays_list) - 1) * (max_val + gap) + max_val + gap
+            self.ax.set_ylim(0, top)
+        else:
+            self.bar_groups = [
+                self.ax.bar(range(self.n), arrays_list[0], color=self.NORMAL)
+            ]
+
+    @staticmethod
+    def _normalize_hl(d, n):
+        """把单排的 hl 规格转成 {idx: color} 字典"""
+        if isinstance(d, dict):
+            return {k: v for k, v in d.items() if 0 <= k < n}
+        return {k: Silly.HIGHLIGHT for k in d if 0 <= k < n}
+
+    def _update(self, frame):
+        arrays, hl, text = frame
+
+        arrays_list, multi = self._resolve_arrays(arrays)
+        self._ensure_bars(arrays_list, multi)
+
+        if multi:
+            if isinstance(hl, list):
+                hl_list = list(hl) + [{}] * (len(arrays_list) - len(hl))
+            else:
+                hl_list = [hl] * len(arrays_list)
+        else:
+            hl_list = [hl]
+
+        artists = []
+        for g_idx, (group, arr) in enumerate(zip(self.bar_groups, arrays_list)):
+            clean = self._normalize_hl(hl_list[g_idx], len(arr))
+            for idx, b in enumerate(group):
+                b.set_height(arr[idx])
+                b.set_color(clean.get(idx, self.NORMAL))
+                artists.append(b)
+
+        self.info_text.set_text(text)
+        artists.append(self.info_text)
+        return artists
+
+    def go(self, sort_gen):
+        self.ani = FuncAnimation(
+            self.fig,
+            self._update,
+            frames=sort_gen(self.data),
+            interval=0,
+            repeat=False,
+            blit=True,
+            cache_frame_data=False,
+        )
+        plt.tight_layout()
+        plt.show()
+        return self
+
+
+def frame(*pairs, text=""):
+    """按名字组装多排帧。pairs 为若干 (array, highlight) 元组。"""
+    arrays = [a.copy() for a, _ in pairs]
+    hls = [h for _, h in pairs]
+    return (arrays, hls, text)