@@ -441,7 +441,7 @@ func ListDocTree(boxID, listPath string, sortMode int, flashcard, showHidden boo
441
441
return
442
442
}
443
443
444
- func GetDoc (startID , endID , id string , index int , query string , queryTypes map [string ]bool , queryMethod , mode int , size int , isBacklink , highlight bool ) (
444
+ func GetDoc (startID , endID , id string , index int , query string , queryTypes map [string ]bool , queryMethod , mode int , size int , isBacklink bool , originalRefBlockIDs map [ string ] string , highlight bool ) (
445
445
blockCount int , dom , parentID , parent2ID , rootID , typ string , eof , scroll bool , boxID , docPath string , isBacklinkExpand bool , keywords []string , err error ) {
446
446
//os.MkdirAll("pprof", 0755)
447
447
//cpuProfile, _ := os.Create("pprof/GetDoc")
@@ -603,8 +603,6 @@ func GetDoc(startID, endID, id string, index int, query string, queryTypes map[s
603
603
var nodes []* ast.Node
604
604
if isBacklink {
605
605
// 引用计数浮窗请求,需要按照反链逻辑组装 https://github.com/siyuan-note/siyuan/issues/6853
606
- originalRefBlockIDs := map [string ]string {}
607
- // TODO 需要增加参数,使用 getRefIDs 返回的 originalRefBlockIDs 增加这个参数后才能支持计数浮窗内计算折叠状态 https://github.com/siyuan-note/siyuan/issues/13776
608
606
nodes , isBacklinkExpand = getBacklinkRenderNodes (node , originalRefBlockIDs )
609
607
} else {
610
608
// 如果同时存在 startID 和 endID,并且是动态加载的情况,则只加载 startID 和 endID 之间的块 [startID, endID]
0 commit comments