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

🎨 支持基于文档复习闪卡 https://github.com/siyuan-note/siyuan/issues/7057

Browse source
This commit is contained in:
Liang Ding 2023-02-19 09:47:03 +08:00
parent 021cdc327f
commit 9fd9ccd038
No known key found for this signature in database
GPG key ID: 136F30F901A2231D
1 changed files with 41 additions and 50 deletions
Download patch file Download diff file Expand all files Collapse all files

91
kernel/model/flashcard.go
View file

@ -45,40 +45,7 @@ var deckLock = sync.Mutex{}
func GetTreeFlashcards(rootID string, page int) (blocks []*Block, total, pageCount int) {
blocks = []*Block{}
tree, err := loadTreeByBlockID(rootID)
if nil != err {
return
}
trees := []*parse.Tree{tree}
box := Conf.Box(tree.Box)
luteEngine := util.NewLute()
files := box.ListFiles(tree.Path)
for _, subFile := range files {
if !strings.HasSuffix(subFile.path, ".sy") {
continue
}
subTree, loadErr := filesys.LoadTree(box.ID, subFile.path, luteEngine)
if nil != loadErr {
continue
}
trees = append(trees, subTree)
}
treeBlockIDs := map[string]bool{}
for _, t := range trees {
ast.Walk(t.Root, func(n *ast.Node, entering bool) ast.WalkStatus {
if !entering || !n.IsBlock() || ast.NodeDocument == n.Type {
return ast.WalkContinue
}
treeBlockIDs[n.ID] = true
return ast.WalkContinue
})
}
treeBlockIDs := getTreeSubTreeChildBlocks(rootID)
var allBlockIDs []string
const pageSize = 20
deck := Decks[builtinDeckID]
@ -229,26 +196,12 @@ func GetTreeDueFlashcards(rootID string) (ret []*Flashcard, err error) {
return
}
tree, err := loadTreeByBlockID(rootID)
if nil != err {
return
}
blockIDs := map[string]bool{}
ast.Walk(tree.Root, func(n *ast.Node, entering bool) ast.WalkStatus {
if !entering || !n.IsBlock() {
return ast.WalkContinue
}
blockIDs[n.ID] = true
return ast.WalkContinue
})
treeBlockIDs := getTreeSubTreeChildBlocks(rootID)
cards := deck.Dues()
now := time.Now()
for _, card := range cards {
blockID := card.BlockID()
if !blockIDs[blockID] {
if !treeBlockIDs[blockID] {
continue
}
@ -269,6 +222,44 @@ func GetTreeDueFlashcards(rootID string) (ret []*Flashcard, err error) {
return
}
func getTreeSubTreeChildBlocks(rootID string) (treeBlockIDs map[string]bool) {
treeBlockIDs = map[string]bool{}
tree, err := loadTreeByBlockID(rootID)
if nil != err {
return
}
trees := []*parse.Tree{tree}
box := Conf.Box(tree.Box)
luteEngine := util.NewLute()
files := box.ListFiles(tree.Path)
for _, subFile := range files {
if !strings.HasSuffix(subFile.path, ".sy") {
continue
}
subTree, loadErr := filesys.LoadTree(box.ID, subFile.path, luteEngine)
if nil != loadErr {
continue
}
trees = append(trees, subTree)
}
for _, t := range trees {
ast.Walk(t.Root, func(n *ast.Node, entering bool) ast.WalkStatus {
if !entering || !n.IsBlock() || ast.NodeDocument == n.Type {
return ast.WalkContinue
}
treeBlockIDs[n.ID] = true
return ast.WalkContinue
})
}
return
}
func GetDueFlashcards(deckID string) (ret []*Flashcard, err error) {
deckLock.Lock()
defer deckLock.Unlock()