Go-实现无限分类基类

Dear 丶 2022-09-04 13:51 174阅读 0赞

代码片段如下：

package utils
    
    /*
     *                    .::::.
     *                  .::::::::.
     *                 :::::::::::
     *             ..:::::::::::'
     *           '::::::::::::'
     *             .::::::::::
     *        '::::::::::::::..
     *             ..::::::::::::.
     *           ``::::::::::::::::
     *            ::::``:::::::::'        .:::.
     *           ::::'   ':::::'       .::::::::.
     *         .::::'      ::::     .:::::::'::::.
     *        .:::'       :::::  .:::::::::' ':::::.
     *       .::'        :::::.:::::::::'      ':::::.
     *      .::'         ::::::::::::::'         ``::::.
     *  ...:::           ::::::::::::'              ``::.
     * ```` ':.          ':::::::::'                  ::::..
     *  		           '.:::::'          			':'````..
     */
    
    import (
    	"strconv"
    	"strings"
    
    	"./common"
    )
    
    // TreeModel 树结构模型
    type TreeModel struct {
    	Data    map[int]string
    	Child   map[int][]int
    	Layer   map[int]int
    	Parent  map[int]int
    	CountID int
    }
    
    // NewTree 实例化一个树结构
    func NewTree() TreeModel {
    	setMode := TreeModel{}
    	setMode.Data = map[int]string{-1: ""}
    	setMode.Child = map[int][]int{}
    	setMode.Layer = map[int]int{
    		-1: -1,
    	}
    	setMode.Parent = map[int]int{}
    	setMode.CountID = 0
    	return setMode
    }
    
    // SetNode 设置结点
    func (tree *TreeModel) SetNode(id int, parentID int, value string) {
    	// parentID = common.If(parentID > 0, parentID, 0)
    	tree.Data[id] = value
    	tree.Child[parentID] = append(tree.Child[parentID], id)
    	tree.Parent[id] = parentID
    	if _, ok := tree.Layer[parentID]; !ok {
    		tree.Layer[id] = 0
    	} else {
    		tree.Layer[id] = tree.Layer[parentID] + 1
    	}
    }
    
    // GetList 获取结点列表 &treeNode
    func (tree *TreeModel) GetList(treeNode *[]int, root int) {
    	if _, ok := tree.Child[root]; ok {
    		for _, id := range tree.Child[root] {
    			if !common.Empty(id) {
    				*treeNode = append(*treeNode, id)
    				if !common.Empty(tree.Child[id]) {
    					tree.GetList(treeNode, id)
    				}
    			}
    		}
    	}
    }
    
    // GetValue 获取ID值
    func (tree *TreeModel) GetValue(id int) string {
    	if !common.Empty(tree.Data[id]) {
    		return tree.Data[id]
    	}
    	return ""
    }
    
    // ReSetLayer 重置层
    func (tree *TreeModel) ReSetLayer(id int) {
    	if _, ok := tree.Parent[id]; ok {
    		tree.Layer[tree.CountID] = tree.Layer[tree.CountID] + 1
    		tree.ReSetLayer(tree.Parent[id])
    	}
    }
    
    //GetLayer 获取层
    func (tree *TreeModel) GetLayer(id int, space string) string {
    	//重新计算级数
    	tree.Layer[id] = 0
    	tree.CountID = id
    	tree.ReSetLayer(id)
    	if len(space) > 0 {
    		return strings.Repeat(space, tree.Layer[id])
    	}
    	return strconv.Itoa(tree.Layer[id])
    }
    
    // GetParent 获取父结点
    func (tree *TreeModel) GetParent(id int) int {
    	return tree.Parent[id]
    }
    
    // GetParents 获取所有父级关系
    func (tree *TreeModel) GetParents(id int) map[int]int {
    	if value, ok := tree.Parent[id]; ok && value != -1 {
    		tree.Parent[tree.Layer[id]] = tree.Parent[id]
    		id = tree.Parent[tree.Layer[id]]
    	}
    
    	return tree.Parent
    }
    
    // GetChild 获取子
    func (tree *TreeModel) GetChild(id int) []int {
    	return tree.Child[id]
    }
    
    // GetChilds 获取所有子 id =0
    func (tree *TreeModel) GetChilds(id int) []int {
    	child := []int{}
    	tree.GetList(&child, id)
    	return child
    }