github/siyuan
4
0
Fork 0
mirror of https://github.com/siyuan-note/siyuan.git synced 2025-05-20 11:00:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

⚡ Improve performance for backmentions

Browse Source
This commit is contained in:
Daniel 2024-10-19 17:20:43 +08:00
parent 9e48a23a93
commit f9a38c41a2
No known key found for this signature in database
GPG Key ID: 86211BA83DF03017
1 changed files with 11 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
kernel/model/backlink.go
View File

@ -30,6 +30,7 @@ import (
"github.com/88250/lute/parse" "github.com/88250/lute/parse"
"github.com/emirpasic/gods/sets/hashset" "github.com/emirpasic/gods/sets/hashset"
"github.com/siyuan-note/logging" "github.com/siyuan-note/logging"
"github.com/siyuan-note/siyuan/kernel/filesys"
"github.com/siyuan-note/siyuan/kernel/search" "github.com/siyuan-note/siyuan/kernel/search"
"github.com/siyuan-note/siyuan/kernel/sql" "github.com/siyuan-note/siyuan/kernel/sql"
"github.com/siyuan-note/siyuan/kernel/treenode" "github.com/siyuan-note/siyuan/kernel/treenode"
@ -82,32 +83,27 @@ func GetBackmentionDoc(defID, refTreeID, keyword string, containChildren bool) (
linkRefs, _, excludeBacklinkIDs := buildLinkRefs(rootID, refs, keyword) linkRefs, _, excludeBacklinkIDs := buildLinkRefs(rootID, refs, keyword)
tmpMentions, mentionKeywords := buildTreeBackmention(sqlBlock, linkRefs, keyword, excludeBacklinkIDs, beforeLen) tmpMentions, mentionKeywords := buildTreeBackmention(sqlBlock, linkRefs, keyword, excludeBacklinkIDs, beforeLen)
luteEngine := NewLute() luteEngine := util.NewLute()
treeCache := map[string]*parse.Tree{}
var mentions []*Block var mentions []*Block
for _, mention := range tmpMentions { for _, mention := range tmpMentions {
if mention.RootID == refTreeID { if mention.RootID == refTreeID {
mentions = append(mentions, mention) mentions = append(mentions, mention)
} }
} }
var mentionBlockIDs []string
for _, mention := range mentions {
mentionBlockIDs = append(mentionBlockIDs, mention.ID)
}
mentionBlockIDs = gulu.Str.RemoveDuplicatedElem(mentionBlockIDs)
if "" != keyword { if "" != keyword {
mentionKeywords = append(mentionKeywords, keyword) mentionKeywords = append(mentionKeywords, keyword)
} }
mentionKeywords = gulu.Str.RemoveDuplicatedElem(mentionKeywords) mentionKeywords = gulu.Str.RemoveDuplicatedElem(mentionKeywords)
for _, mention := range mentions {
refTree := treeCache[mention.RootID]
if nil == refTree {
var loadErr error
refTree, loadErr = LoadTreeByBlockID(mention.ID)
if nil != loadErr {
logging.LogWarnf("load ref tree [%s] failed: %s", mention.ID, loadErr)
continue
}
treeCache[mention.RootID] = refTree
}
backlink := buildBacklink(mention.ID, refTree, mentionKeywords, luteEngine) trees := filesys.LoadTrees(mentionBlockIDs)
for id, tree := range trees {
backlink := buildBacklink(id, tree, mentionKeywords, luteEngine)
ret = append(ret, backlink) ret = append(ret, backlink)
} }
return return
@ -138,7 +134,7 @@ func GetBacklinkDoc(defID, refTreeID, keyword string, containChildren bool) (ret
return return
} }
luteEngine := NewLute() luteEngine := util.NewLute()
for _, linkRef := range linkRefs { for _, linkRef := range linkRefs {
var keywords []string var keywords []string
if "" != keyword { if "" != keyword {