Andreas/siyuan
1
0
Fork 0
mirror of https://github.com/siyuan-note/siyuan.git synced 2026-03-10 14:42:33 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

✨ 反链面板

Browse source
This commit is contained in:
Liang Ding 2022-09-29 12:38:48 +08:00
parent f6411dba9a
commit b238a5de41
No known key found for this signature in database
GPG key ID: 136F30F901A2231D
3 changed files with 12 additions and 23 deletions
Download patch file Download diff file Expand all files Collapse all files

16
kernel/model/backlink.go
View file

@ -158,7 +158,7 @@ OK:
return
}
func GetBacklinkDoc(defID, refTreeID string) (ret []*Block) {
func GetBacklinkDoc(defID, refTreeID string) (ret []string) {
keyword := ""
beforeLen := 12
sqlBlock := sql.GetBlock(defID)
@ -168,7 +168,13 @@ func GetBacklinkDoc(defID, refTreeID string) (ret []*Block) {
rootID := sqlBlock.RootID
var links []*Block
refs := sql.QueryRefsByDefIDRefRootID(defID, refTreeID)
tmpRefs := sql.QueryRefsByDefID(defID, true)
var refs []*sql.Ref
for _, ref := range tmpRefs {
if ref.RootID == refTreeID {
refs = append(refs, ref)
}
}
refs = removeDuplicatedRefs(refs) // 同一个块中引用多个相同块时反链去重 https://github.com/siyuan-note/siyuan/issues/3317
// 为了减少查询，组装好 IDs 后一次查出
@ -271,10 +277,8 @@ func GetBacklinkDoc(defID, refTreeID string) (ret []*Block) {
for _, link := range linkPaths {
for _, c := range link.Children {
n := treenode.GetNodeInTree(refTree, c.ID)
b := &Block{
Content: lute.RenderNodeBlockDOM(n, luteEngine.ParseOptions, luteEngine.RenderOptions),
}
ret = append(ret, b)
dom := lute.RenderNodeBlockDOM(n, luteEngine.ParseOptions, luteEngine.RenderOptions)
ret = append(ret, dom)
}
}
return