package models import ( "bytes" "fmt" "html/template" "math" "github.com/beego/beego/v2/client/orm" "github.com/mindoc-org/mindoc/conf" ) type DocumentTree struct { DocumentId int `json:"id"` DocumentName string `json:"text"` ParentId interface{} `json:"parent"` Identify string `json:"identify"` BookIdentify string `json:"-"` Version int64 `json:"version"` State *DocumentSelected `json:"-"` AAttrs map[string]interface{} `json:"a_attr"` } type DocumentSelected struct { Selected bool `json:"selected"` Opened bool `json:"opened"` Disabled bool `json:"disabled"` } //获取项目的文档树状结构 func (item *Document) FindDocumentTree(bookId int) ([]*DocumentTree, error) { o := orm.NewOrm() trees := make([]*DocumentTree, 0) var docs []*Document count, err := o.QueryTable(item).Filter("book_id", bookId). OrderBy("order_sort", "document_id"). Limit(math.MaxInt32). All(&docs, "document_id", "version", "document_name", "parent_id", "identify", "is_open") if err != nil { return trees, err } book, _ := NewBook().Find(bookId) trees = make([]*DocumentTree, count) for index, item := range docs { tree := &DocumentTree{ AAttrs: map[string]interface{}{"is_open": false, "opened": 0}, } if index == 0 { tree.State = &DocumentSelected{Selected: true, Opened: true} tree.AAttrs = map[string]interface{}{"is_open": true, "opened": 1} } else if item.IsOpen == 1 { tree.State = &DocumentSelected{Selected: false, Opened: true} tree.AAttrs = map[string]interface{}{"is_open": true, "opened": 1} } if item.IsOpen == 2 { tree.State = &DocumentSelected{Selected: false, Opened: false, Disabled: true} tree.AAttrs = map[string]interface{}{"disabled": true, "opened": 2} } tree.DocumentId = item.DocumentId tree.Identify = item.Identify tree.Version = item.Version tree.BookIdentify = book.Identify if item.ParentId > 0 { tree.ParentId = item.ParentId } else { tree.ParentId = "#" } tree.DocumentName = item.DocumentName trees[index] = tree } return trees, nil } func (item *Document) CreateDocumentTreeForHtml(bookId, selectedId int) (string, error) { trees, err := item.FindDocumentTree(bookId) if err != nil { return "", err } parentId := getSelectedNode(trees, selectedId) buf := bytes.NewBufferString("") getDocumentTree(trees, 0, selectedId, parentId, buf) return buf.String(), nil } //使用递归的方式获取指定ID的顶级ID func getSelectedNode(array []*DocumentTree, parent_id int) int { for _, item := range array { if _, ok := item.ParentId.(string); ok && item.DocumentId == parent_id { return item.DocumentId } else if pid, ok := item.ParentId.(int); ok && item.DocumentId == parent_id { return getSelectedNode(array, pid) } } return 0 } func getDocumentTree(array []*DocumentTree, parentId int, selectedId int, selectedParentId int, buf *bytes.Buffer) { buf.WriteString("") }