Skip to content

Commit

Permalink
Merge remote-tracking branch 'origin/dev' into dev
Browse files Browse the repository at this point in the history
  • Loading branch information
Vanessa219 committed Jan 5, 2025
2 parents b9eeaa1 + e3cce8b commit 7b9a74e
Show file tree
Hide file tree
Showing 5 changed files with 20 additions and 16 deletions.
4 changes: 4 additions & 0 deletions kernel/av/value.go
Original file line number Diff line number Diff line change
Expand Up @@ -221,6 +221,10 @@ func (value *Value) IsEdited() bool {
}

func (value *Value) IsEmpty() bool {
if nil == value {
return true
}

switch value.Type {
case KeyTypeBlock:
if nil == value.Block {
Expand Down
24 changes: 12 additions & 12 deletions kernel/filesys/tree.go
Original file line number Diff line number Diff line change
Expand Up @@ -72,18 +72,6 @@ func LoadTrees(ids []string) (ret map[string]*parse.Tree) {
return
}

func LoadTree(boxID, p string, luteEngine *lute.Lute) (ret *parse.Tree, err error) {
filePath := filepath.Join(util.DataDir, boxID, p)
data, err := filelock.ReadFile(filePath)
if err != nil {
logging.LogErrorf("load tree [%s] failed: %s", p, err)
return
}

ret, err = LoadTreeByData(data, boxID, p, luteEngine)
return
}

func batchLoadTrees(boxIDs, paths []string, luteEngine *lute.Lute) (ret []*parse.Tree, errs []error) {
waitGroup := sync.WaitGroup{}
lock := sync.Mutex{}
Expand Down Expand Up @@ -119,6 +107,18 @@ func batchLoadTrees(boxIDs, paths []string, luteEngine *lute.Lute) (ret []*parse
return
}

func LoadTree(boxID, p string, luteEngine *lute.Lute) (ret *parse.Tree, err error) {
filePath := filepath.Join(util.DataDir, boxID, p)
data, err := filelock.ReadFile(filePath)
if err != nil {
logging.LogErrorf("load tree [%s] failed: %s", p, err)
return
}

ret, err = LoadTreeByData(data, boxID, p, luteEngine)
return
}

func LoadTreeByData(data []byte, boxID, p string, luteEngine *lute.Lute) (ret *parse.Tree, err error) {
ret = parseJSON2Tree(boxID, p, data, luteEngine)
if nil == ret {
Expand Down
2 changes: 1 addition & 1 deletion kernel/model/backlink.go
Original file line number Diff line number Diff line change
Expand Up @@ -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
fillBlockRefCount(renderNodes, 1)
fillBlockRefCount(renderNodes)

dom := renderBlockDOMByNodes(renderNodes, luteEngine)
var blockPaths []*BlockPath
Expand Down
2 changes: 1 addition & 1 deletion kernel/model/block.go
Original file line number Diff line number Diff line change
Expand Up @@ -900,7 +900,7 @@ func getEmbeddedBlock(trees map[string]*parse.Tree, sqlBlock *sql.Block, heading
}

// 嵌入块查询结果中显示块引用计数 https://github.com/siyuan-note/siyuan/issues/7191
fillBlockRefCount(nodes, 0)
fillBlockRefCount(nodes)

luteEngine := NewLute()
luteEngine.RenderOptions.ProtyleContenteditable = false // 不可编辑
Expand Down
4 changes: 2 additions & 2 deletions kernel/model/render.go
Original file line number Diff line number Diff line change
Expand Up @@ -144,7 +144,7 @@ func renderBlockText(node *ast.Node, excludeTypes []string, removeLineBreak bool
return
}

func fillBlockRefCount(nodes []*ast.Node, minRefCount int) {
func fillBlockRefCount(nodes []*ast.Node) {
var defIDs []string
for _, n := range nodes {
ast.Walk(n, func(n *ast.Node, entering bool) ast.WalkStatus {
Expand All @@ -166,7 +166,7 @@ func fillBlockRefCount(nodes []*ast.Node, minRefCount int) {
return ast.WalkContinue
}

if cnt := refCount[n.ID]; minRefCount < cnt {
if cnt := refCount[n.ID]; 0 < cnt {
n.SetIALAttr("refcount", strconv.Itoa(cnt))
}
return ast.WalkContinue
Expand Down

0 comments on commit 7b9a74e

Please sign in to comment.