update pay function

This commit is contained in:
2025-11-20 13:25:50 +08:00
parent 80676dd622
commit 8eff6b1a95
4 changed files with 733 additions and 69 deletions

View File

@@ -30,8 +30,8 @@
"tags": [
"分类树"
],
"summary": "获取完整分类树",
"description": "获取指定数据源的完整分类树状结构。\n\n## 使用场景\n- 前端树形组件初始化\n- 构建完整的分类导航\n- 级联选择器数据源\n\n## 注意事项\n- SMM树约53MB,Mysteel约152MB\n- 建议前端实现懒加载或缓存策略\n- 响应时间取决于网络带宽\n",
"summary": "获取分类树(支持深度控制)",
"description": "获取指定数据源的分类树状结构,支持深度控制。\n\n## 使用场景\n- 前端树形组件初始化(默认只加载第一层)\n- 懒加载:用户展开时再加载下一层\n- 级联选择器数据源\n\n## 默认行为\n- **默认只返回第一层** (max_depth=1),大幅减少数据传输量\n- SMM第一层约43个节点,Mysteel第一层约2个节点\n- 完整树数据量: SMM约53MB, Mysteel约152MB\n\n## 推荐用法\n1. 首次加载:不传max_depth(默认1层)\n2. 用户点击节点:调用 /api/category-tree/node 获取子节点\n",
"operationId": "getCategoryTree",
"parameters": [
{
@@ -47,6 +47,19 @@
]
},
"example": "SMM"
},
{
"name": "max_depth",
"in": "query",
"description": "返回的最大层级深度\n- 1: 只返回第一层(默认,推荐)\n- 2: 返回前两层\n- 999: 返回完整树(不推荐,数据量大)\n",
"required": false,
"schema": {
"type": "integer",
"minimum": 1,
"maximum": 20,
"default": 1
},
"example": 1
}
],
"responses": {
@@ -268,7 +281,8 @@
"required": [
"name",
"path",
"level"
"level",
"has_children"
],
"properties": {
"name": {
@@ -287,9 +301,14 @@
"minimum": 1,
"example": 3
},
"has_children": {
"type": "boolean",
"description": "是否有子节点(用于前端判断是否可展开)",
"example": true
},
"children": {
"type": "array",
"description": "子节点列表",
"description": "子节点列表(根据max_depth可能为空数组)",
"items": {
"$ref": "#/components/schemas/TreeNode"
}