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

🎨 Improve display reference counts in the backlink panel https://github.com/siyuan-note/siyuan/issues/13678

Browse source
This commit is contained in:
Daniel 2025-01-01 12:24:58 +08:00
parent 6d7feb461f
commit 2d006a941b
No known key found for this signature in database
GPG key ID: 86211BA83DF03017
3 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

2
kernel/model/backlink.go
View file

@ -230,7 +230,7 @@ func buildBacklink(refID string, refTree *parse.Tree, keywords []string, highlig
} }
// 反链面板中显示块引用计数 Display reference counts in the backlink panel https://github.com/siyuan-note/siyuan/issues/13618 // 反链面板中显示块引用计数 Display reference counts in the backlink panel https://github.com/siyuan-note/siyuan/issues/13618
fillBlockRefCount(renderNodes) fillBlockRefCount(renderNodes, 1)
dom := renderBlockDOMByNodes(renderNodes, luteEngine) dom := renderBlockDOMByNodes(renderNodes, luteEngine)
var blockPaths []*BlockPath var blockPaths []*BlockPath

2
kernel/model/block.go
View file

@ -900,7 +900,7 @@ func getEmbeddedBlock(trees map[string]*parse.Tree, sqlBlock *sql.Block, heading
} }
// 嵌入块查询结果中显示块引用计数 https://github.com/siyuan-note/siyuan/issues/7191 // 嵌入块查询结果中显示块引用计数 https://github.com/siyuan-note/siyuan/issues/7191
fillBlockRefCount(nodes) fillBlockRefCount(nodes, 0)
luteEngine := NewLute() luteEngine := NewLute()
luteEngine.RenderOptions.ProtyleContenteditable = false // 不可编辑 luteEngine.RenderOptions.ProtyleContenteditable = false // 不可编辑

4
kernel/model/render.go
View file

@ -142,7 +142,7 @@ func renderBlockText(node *ast.Node, excludeTypes []string) (ret string) {
return return
} }
func fillBlockRefCount(nodes []*ast.Node) { func fillBlockRefCount(nodes []*ast.Node, minRefCount int) {
var defIDs []string var defIDs []string
for _, n := range nodes { for _, n := range nodes {
ast.Walk(n, func(n *ast.Node, entering bool) ast.WalkStatus { ast.Walk(n, func(n *ast.Node, entering bool) ast.WalkStatus {
@ -164,7 +164,7 @@ func fillBlockRefCount(nodes []*ast.Node) {
return ast.WalkContinue return ast.WalkContinue
} }
if cnt := refCount[n.ID]; 0 < cnt { if cnt := refCount[n.ID]; minRefCount < cnt {
n.SetIALAttr("refcount", strconv.Itoa(cnt)) n.SetIALAttr("refcount", strconv.Itoa(cnt))
} }
return ast.WalkContinue return ast.WalkContinue