Andreas/siyuan
1
0
Fork 0
mirror of https://github.com/siyuan-note/siyuan.git synced 2025-12-16 22:50:13 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

✨ 编辑器式反链面板 https://github.com/siyuan-note/siyuan/issues/3565

Browse source
This commit is contained in:
Liang Ding 2022-09-30 17:17:34 +08:00
parent 1fcf79b859
commit c2cf157daa
No known key found for this signature in database
GPG key ID: 136F30F901A2231D
1 changed files with 5 additions and 32 deletions
Download patch file Download diff file Expand all files Collapse all files

37
kernel/model/backlink.go
View file

@ -26,6 +26,7 @@ import (
"strings" "strings"
"github.com/88250/gulu" "github.com/88250/gulu"
"github.com/88250/lute"
"github.com/88250/lute/ast" "github.com/88250/lute/ast"
"github.com/88250/lute/parse" "github.com/88250/lute/parse"
"github.com/emirpasic/gods/sets/hashset" "github.com/emirpasic/gods/sets/hashset"
@ -160,6 +161,7 @@ OK:
type Backlink struct { type Backlink struct {
DOM string `json:"dom"` DOM string `json:"dom"`
BlockPaths []*BlockPath `json:"blockPaths"` BlockPaths []*BlockPath `json:"blockPaths"`
Expand bool `json:"expand"`
} }
func GetBacklinkDoc(defID, refTreeID string) (ret []*Backlink) { func GetBacklinkDoc(defID, refTreeID string) (ret []*Backlink) {
@ -285,7 +287,7 @@ func GetBacklinkDoc(defID, refTreeID string) (ret []*Backlink) {
continue continue
} }
var renderNodes []*ast.Node expand := true
if ast.NodeListItem == n.Type { if ast.NodeListItem == n.Type {
if nil == n.FirstChild { if nil == n.FirstChild {
continue continue
@ -296,7 +298,6 @@ func GetBacklinkDoc(defID, refTreeID string) (ret []*Backlink) {
c = n.FirstChild.Next c = n.FirstChild.Next
} }
expand := true
for liFirstBlockSpan := c.FirstChild; nil != liFirstBlockSpan; liFirstBlockSpan = liFirstBlockSpan.Next { for liFirstBlockSpan := c.FirstChild; nil != liFirstBlockSpan; liFirstBlockSpan = liFirstBlockSpan.Next {
if treenode.IsBlockRef(liFirstBlockSpan) { if treenode.IsBlockRef(liFirstBlockSpan) {
continue continue
@ -306,24 +307,12 @@ func GetBacklinkDoc(defID, refTreeID string) (ret []*Backlink) {
break break
} }
} }
renderNodes = append(renderNodes, n)
if !expand {
var unlinks []*ast.Node
for cc := c.Next; nil != cc; cc = cc.Next {
unlinks = append(unlinks, cc)
}
for _, unlink := range unlinks {
unlink.Unlink()
}
}
} else if ast.NodeHeading == n.Type { } else if ast.NodeHeading == n.Type {
c := n.FirstChild c := n.FirstChild
if nil == c { if nil == c {
continue continue
} }
expand := true
for headingFirstSpan := c; nil != headingFirstSpan; headingFirstSpan = headingFirstSpan.Next { for headingFirstSpan := c; nil != headingFirstSpan; headingFirstSpan = headingFirstSpan.Next {
if treenode.IsBlockRef(headingFirstSpan) { if treenode.IsBlockRef(headingFirstSpan) {
continue continue
@ -333,29 +322,13 @@ func GetBacklinkDoc(defID, refTreeID string) (ret []*Backlink) {
break break
} }
} }
renderNodes = append(renderNodes, n)
if !expand {
var unlinks []*ast.Node
for cc := n.Next; nil != cc; cc = cc.Next {
unlinks = append(unlinks, cc)
}
for _, unlink := range unlinks {
unlink.Unlink()
}
} else {
cc := treenode.HeadingChildren(n)
renderNodes = append(renderNodes, cc...)
}
} else {
renderNodes = append(renderNodes, n)
} }
dom := renderBlockDOMByNodes(renderNodes, luteEngine) dom := lute.RenderNodeBlockDOM(n, luteEngine.ParseOptions, luteEngine.RenderOptions)
ret = append(ret, &Backlink{ ret = append(ret, &Backlink{
DOM: dom, DOM: dom,
BlockPaths: buildBlockBreadcrumb(n), BlockPaths: buildBlockBreadcrumb(n),
Expand: expand,
}) })
} }