siyuan/kernel/model/ai.go

112 lines
2.5 KiB
Go

// SiYuan - Build Your Eternal Digital Garden
// Copyright (c) 2020-present, b3log.org
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
package model
import (
"bytes"
"github.com/88250/lute/ast"
"github.com/88250/lute/parse"
"github.com/siyuan-note/siyuan/kernel/treenode"
"github.com/siyuan-note/siyuan/kernel/util"
)
func ChatGPTSummary(ids []string) (ret string) {
if !isOpenAIAPIEnabled() {
return
}
msg := getBlocksContent(ids)
ret = util.ChatGPTSummary(msg, Conf.Lang)
return
}
func ChatGPTTranslate(ids []string, lang string) (ret string) {
if !isOpenAIAPIEnabled() {
return
}
msg := getBlocksContent(ids)
ret = util.ChatGPTTranslate(msg, lang)
return
}
func ChatGPTContinueWriteBlocks(ids []string) (ret string) {
if !isOpenAIAPIEnabled() {
return
}
msg := getBlocksContent(ids)
ret, _ = util.ChatGPTContinueWrite(msg, nil)
return
}
func ChatGPT(msg string) (ret string) {
if !isOpenAIAPIEnabled() {
return
}
return util.ChatGPT(msg)
}
func isOpenAIAPIEnabled() bool {
if "" == util.OpenAIAPIKey {
util.PushMsg(Conf.Language(193), 5000)
return false
}
return true
}
func getBlocksContent(ids []string) string {
var nodes []*ast.Node
trees := map[string]*parse.Tree{}
for _, id := range ids {
bt := treenode.GetBlockTree(id)
if nil == bt {
continue
}
var tree *parse.Tree
if tree = trees[bt.RootID]; nil == tree {
tree, _ = loadTreeByBlockID(bt.RootID)
if nil == tree {
continue
}
trees[bt.RootID] = tree
}
if node := treenode.GetNodeInTree(tree, id); nil != node {
if ast.NodeDocument == node.Type {
for child := node.FirstChild; nil != child; child = child.Next {
nodes = append(nodes, child)
}
} else {
nodes = append(nodes, node)
}
}
}
buf := bytes.Buffer{}
for _, node := range nodes {
content := treenode.NodeStaticContent(node, nil, true)
buf.WriteString(content)
buf.WriteString("\n\n")
}
return buf.String()
}