mirror of
https://github.com/siyuan-note/siyuan.git
synced 2026-02-23 07:24:07 +01:00
🎨 Clean code
This commit is contained in:
parent
7c0a0ced9f
commit
c3d2a7b542
1 changed files with 0 additions and 11 deletions
|
|
@ -33,17 +33,6 @@ import (
|
||||||
"github.com/siyuan-note/siyuan/kernel/util"
|
"github.com/siyuan-note/siyuan/kernel/util"
|
||||||
)
|
)
|
||||||
|
|
||||||
func StatTree(tree *parse.Tree) (ret *util.BlockStatResult) {
|
|
||||||
runeCnt, wordCnt, linkCnt, imgCnt, refCnt := tree.Root.Stat()
|
|
||||||
return &util.BlockStatResult{
|
|
||||||
RuneCount: runeCnt,
|
|
||||||
WordCount: wordCnt,
|
|
||||||
LinkCount: linkCnt,
|
|
||||||
ImageCount: imgCnt,
|
|
||||||
RefCount: refCnt,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
func NodeHash(node *ast.Node, tree *parse.Tree, luteEngine *lute.Lute) string {
|
func NodeHash(node *ast.Node, tree *parse.Tree, luteEngine *lute.Lute) string {
|
||||||
ialArray := node.KramdownIAL
|
ialArray := node.KramdownIAL
|
||||||
sort.Slice(ialArray, func(i, j int) bool {
|
sort.Slice(ialArray, func(i, j int) bool {
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue