package models import ( "bytes" "html/template" "math" "strconv" "github.com/astaxie/beego/orm" "github.com/lifei6671/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:"state,omitempty"` Type string `json:"type"` } type DocumentSelected struct { Selected bool `json:"selected"` Opened bool `json:"opened"` } //获取项目的文档树状结构 func (m *Document) FindDocumentTree(book_id int) ([]*DocumentTree, error) { o := orm.NewOrm() trees := make([]*DocumentTree, 0) var docs []*Document count, err := o.QueryTable(m).Filter("book_id", book_id).OrderBy("order_sort", "document_id").Limit(math.MaxInt32).All(&docs, "document_id", "version", "document_name", "parent_id", "identify","is_lock") if err != nil { return trees, err } book, _ := NewBook().Find(book_id) trees = make([]*DocumentTree, count) for index, item := range docs { tree := &DocumentTree{} if index == 0 { tree.State = &DocumentSelected{Selected: true, Opened: true} } tree.DocumentId = item.DocumentId tree.Identify = item.Identify tree.Version = item.Version tree.BookIdentify = book.Identify if item.IsLock == 1 { tree.Type = "lock" }else{ tree.Type = "unlock" } if item.ParentId > 0 { tree.ParentId = item.ParentId } else { tree.ParentId = "#" } tree.DocumentName = item.DocumentName trees[index] = tree } return trees, nil } func (m *Document) CreateDocumentTreeForHtml(book_id, selected_id int) (string, error) { trees, err := m.FindDocumentTree(book_id) if err != nil { return "", err } parentId := getSelectedNode(trees, selected_id) buf := bytes.NewBufferString("") getDocumentTree(trees, 0, selected_id, 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, parent_id int, selected_id int, selected_parent_id int, buf *bytes.Buffer) { buf.WriteString("") }