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/7028

Browse source
This commit is contained in:
Liang Ding 2023-01-10 23:33:59 +08:00
parent 1f0ba57727
commit 6d79c35452
No known key found for this signature in database
GPG key ID: 136F30F901A2231D
1 changed files with 14 additions and 24 deletions
Download patch file Download diff file Expand all files Collapse all files

38
kernel/model/backlink.go
View file

@ -27,7 +27,6 @@ import (
"github.com/88250/gulu" "github.com/88250/gulu"
"github.com/88250/lute" "github.com/88250/lute"
"github.com/88250/lute/ast" "github.com/88250/lute/ast"
"github.com/88250/lute/lex"
"github.com/88250/lute/parse" "github.com/88250/lute/parse"
"github.com/emirpasic/gods/sets/hashset" "github.com/emirpasic/gods/sets/hashset"
"github.com/facette/natsort" "github.com/facette/natsort"
@ -110,6 +109,7 @@ func GetBackmentionDoc(defID, refTreeID, keyword string) (ret []*Backlink) {
} }
func GetBacklinkDoc(defID, refTreeID, keyword string) (ret []*Backlink) { func GetBacklinkDoc(defID, refTreeID, keyword string) (ret []*Backlink) {
keyword = strings.TrimSpace(keyword)
ret = []*Backlink{} ret = []*Backlink{}
sqlBlock := sql.GetBlock(defID) sqlBlock := sql.GetBlock(defID)
if nil == sqlBlock { if nil == sqlBlock {
@ -135,13 +135,17 @@ func GetBacklinkDoc(defID, refTreeID, keyword string) (ret []*Backlink) {
luteEngine := NewLute() luteEngine := NewLute()
for _, linkRef := range linkRefs { for _, linkRef := range linkRefs {
backlink := buildBacklink(linkRef.ID, refTree, nil, luteEngine) var keywords []string
if "" != keyword {
keywords = append(keywords, keyword)
}
backlink := buildBacklink(linkRef.ID, refTree, keywords, luteEngine)
ret = append(ret, backlink) ret = append(ret, backlink)
} }
return return
} }
func buildBacklink(refID string, refTree *parse.Tree, mentionKeywords []string, luteEngine *lute.Lute) (ret *Backlink) { func buildBacklink(refID string, refTree *parse.Tree, keywords []string, luteEngine *lute.Lute) (ret *Backlink) {
n := treenode.GetNodeInTree(refTree, refID) n := treenode.GetNodeInTree(refTree, refID)
if nil == n { if nil == n {
return return
@ -149,37 +153,23 @@ func buildBacklink(refID string, refTree *parse.Tree, mentionKeywords []string,
renderNodes, expand := getBacklinkRenderNodes(n) renderNodes, expand := getBacklinkRenderNodes(n)
if 0 < len(mentionKeywords) { if 0 < len(keywords) {
for _, renderNode := range renderNodes { for _, renderNode := range renderNodes {
var unlinks []*ast.Node var unlinks []*ast.Node
ast.Walk(renderNode, func(n *ast.Node, entering bool) ast.WalkStatus { ast.Walk(renderNode, func(n *ast.Node, entering bool) ast.WalkStatus {
if !entering { if !entering {
return ast.WalkContinue return ast.WalkContinue
} }
if ast.NodeText == n.Type {
text := string(n.Tokens)
newText := markReplaceSpanWithSplit(text, mentionKeywords, getMarkSpanStart(searchMarkDataType), getMarkSpanEnd())
if text == newText {
return ast.WalkContinue
}
n.Tokens = gulu.Str.ToBytes(newText) if n.IsBlock() {
if bytes.Contains(n.Tokens, []byte("search-mark")) { return ast.WalkContinue
n.Tokens = lex.EscapeMarkers(n.Tokens)
linkTree := parse.Inline("", n.Tokens, luteEngine.ParseOptions)
var children []*ast.Node
for c := linkTree.Root.FirstChild.FirstChild; nil != c; c = c.Next {
children = append(children, c)
}
for _, c := range children {
n.InsertBefore(c)
}
unlinks = append(unlinks, n)
return ast.WalkContinue
}
} }
markReplaceSpan(n, &unlinks, keywords, searchMarkDataType, luteEngine)
return ast.WalkContinue return ast.WalkContinue
}) })
for _, unlink := range unlinks { for _, unlink := range unlinks {
unlink.Unlink() unlink.Unlink()
} }