|
@@ -919,21 +919,16 @@ func writeTreeUpsertQueue(tree *parse.Tree) (err error) {
|
|
return
|
|
return
|
|
}
|
|
}
|
|
|
|
|
|
-func writeTreeIndexQueue(tree *parse.Tree) (err error) {
|
|
|
|
- size, err := filesys.WriteTree(tree)
|
|
|
|
|
|
+func indexWriteTreeIndexQueue(tree *parse.Tree) (err error) {
|
|
|
|
+ treenode.IndexBlockTree(tree)
|
|
|
|
+ _, err = filesys.WriteTree(tree)
|
|
if err != nil {
|
|
if err != nil {
|
|
return
|
|
return
|
|
}
|
|
}
|
|
sql.IndexTreeQueue(tree)
|
|
sql.IndexTreeQueue(tree)
|
|
- refreshDocInfo(tree, size)
|
|
|
|
return
|
|
return
|
|
}
|
|
}
|
|
|
|
|
|
-func indexWriteTreeIndexQueue(tree *parse.Tree) (err error) {
|
|
|
|
- treenode.IndexBlockTree(tree)
|
|
|
|
- return writeTreeIndexQueue(tree)
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
func indexWriteTreeUpsertQueue(tree *parse.Tree) (err error) {
|
|
func indexWriteTreeUpsertQueue(tree *parse.Tree) (err error) {
|
|
treenode.UpsertBlockTree(tree)
|
|
treenode.UpsertBlockTree(tree)
|
|
return writeTreeUpsertQueue(tree)
|
|
return writeTreeUpsertQueue(tree)
|