chore: 初始开源发布

iotlcm-app：小程序端 + 用户端服务。 - app/：uni-app 小程序前端（基于 unibest，MIT） - 微信 AppID → YOUR_WX_APPID，uni-app AppID → __UNI__YOURAPPID - 内网后端地址 → admin.iotlcm.example.com - 应用标题与 unibest 模板 README 重写（保留上游致谢与 MIT 声明） - server/：GoFrame 用户端服务（基于 XiuAdmin，Apache-2.0） - module xiuadmin → git.5iot.com/iotlcm-public/iotlcm-app（360 文件） - 支付回调地址 → app.iotlcm.example.com，商户名与应用名泛化 - 真实手机号 → 合法 11 位编造号（保留号段前 3 位 + 后 4 位） - 依赖号码尾部的断言同步更新 - 补 server/LICENSE（Apache-2.0） - 移除内部资产：CI 触发器 - 补根 README，LF 行尾 + .gitattributes 已知：TestSysDept_RefreshDeptAncestors 在源仓同一提交上同样失败，属既有缺陷。
2026-10-26 14:01:25 +08:00
commit 2ed5dfa6a1
1013 changed files with 138466 additions and 0 deletions
@@ -0,0 +1,109 @@
+// package tree
+// @Link  https://github.com/xiujiecn/xiu-admin
+// @Copyright  Copyright (c) 2025 LiXiujie
+// @Author  Lxj <li@xiujie.cn>
+// @License  https://github.com/xiujiecn/xiu-admin/blob/master/LICENSE
+package tree
+
+import (
+	"fmt"
+	"strings"
+
+	"github.com/gogf/gf/v2/util/gconv"
+)
+
+const (
+	treeDefaultId       = "id"       // 树ID
+	treeDefaultPid      = "pid"      // 上级树ID
+	treeDefaultChildren = "children" // 下级属性
+	treeBeginCut        = "tr_"      // 树标识开头
+	treeEndCut          = " "        // 树标识结尾
+)
+
+// GenOption 生成选项
+type GenOption struct {
+	IdField       string
+	PidField      string
+	ChildrenField string
+}
+
+// GenLabel 生成关系树标识
+func GenLabel(basic string, appendId int64) string {
+	return fmt.Sprintf("%v%v%v%v", basic, treeBeginCut, appendId, treeEndCut)
+}
+
+// GetIdLabel 获取指定Id的树标签
+func GetIdLabel(id int64) string {
+	return fmt.Sprintf("%v%v%v", treeBeginCut, id, treeEndCut)
+}
+
+// GetIds 获取上级ID集合
+func GetIds(tree string) (ids []int64) {
+	idsStr := strings.Split(tree, treeEndCut)
+	if len(idsStr) == 0 {
+		return
+	}
+
+	for _, v := range idsStr {
+		newId := gconv.Int64(strings.ReplaceAll(v, treeBeginCut, ""))
+		if newId > 0 {
+			ids = append(ids, newId)
+		}
+	}
+	return
+}
+
+// GenTree 生成关系树
+func GenTree(menus []map[string]interface{}) (realMenu []map[string]interface{}) {
+	return GenTreeWithField(menus, GenOption{
+		IdField:       treeDefaultId,
+		PidField:      treeDefaultPid,
+		ChildrenField: treeDefaultChildren,
+	})
+}
+
+// GenTreeWithField 生成关系树 自定义生成属性
+func GenTreeWithField(menus []map[string]interface{}, op GenOption) (realMenu []map[string]interface{}) {
+	if len(menus) < 1 {
+		return
+	}
+
+	minPid := GetMinPid(menus, op.PidField)
+	formatMenu := make(map[int]map[string]interface{})
+	for _, m := range menus {
+		formatMenu[gconv.Int(m[op.IdField])] = m
+		if gconv.Int(m[op.PidField]) == minPid {
+			realMenu = append(realMenu, m) // 需要返回的顶级菜单
+		}
+	}
+	// 得益于都是地址操作,可以直接往父级塞
+	for _, m := range formatMenu {
+		if formatMenu[gconv.Int(m[op.PidField])] == nil {
+			continue
+		}
+		if formatMenu[gconv.Int(m[op.PidField])][op.ChildrenField] == nil {
+			formatMenu[gconv.Int(m[op.PidField])][op.ChildrenField] = []map[string]interface{}{}
+		}
+
+		formatMenu[gconv.Int(m[op.PidField])][op.ChildrenField] = append(formatMenu[gconv.Int(m[op.PidField])][op.ChildrenField].([]map[string]interface{}), m)
+	}
+	return
+}
+
+func GetMinPid(menus []map[string]interface{}, pidField string) int {
+	index := -1
+	for _, m := range menus {
+		if index == -1 {
+			index = gconv.Int(m[pidField])
+			continue
+		}
+		if gconv.Int(m[pidField]) < index {
+			index = gconv.Int(m[pidField])
+		}
+	}
+
+	if index == -1 {
+		return 0
+	}
+	return index
+}
@@ -0,0 +1,43 @@
+// package tree
+// @Link  https://github.com/xiujiecn/xiu-admin
+// @Copyright  Copyright (c) 2025 LiXiujie
+// @Author  Lxj <li@xiujie.cn>
+// @License  https://github.com/xiujiecn/xiu-admin/blob/master/LICENSE
+package tree
+
+type Node interface {
+	ID() int64
+	PID() int64
+	SetChildren([]Node)
+}
+
+func ListToTree(rootPid int64, nodes []Node) []Node {
+	nodeMap := make(map[int64]Node, len(nodes))
+	childrenMap := make(map[int64][]Node)
+	for _, node := range nodes {
+		if node == nil {
+			continue
+		}
+		nodeMap[node.ID()] = node
+	}
+
+	treeList := make([]Node, 0)
+	for _, node := range nodes {
+		if node == nil {
+			continue
+		}
+		if node.PID() == rootPid {
+			treeList = append(treeList, node)
+			continue
+		}
+		if parent, ok := nodeMap[node.PID()]; ok {
+			childrenMap[parent.ID()] = append(childrenMap[parent.ID()], node)
+		}
+	}
+	for parentId, children := range childrenMap {
+		if parent, ok := nodeMap[parentId]; ok {
+			parent.SetChildren(children)
+		}
+	}
+	return treeList
+}