* i18n

* version

* copy node
This commit is contained in:
Archer
2025-05-13 18:58:57 +08:00
committed by GitHub
parent 12acaf491c
commit 2063cb6314
5 changed files with 10 additions and 6 deletions

View File

@@ -29,7 +29,7 @@
"FAQ.ai_point_q": "What are AI points?",
"FAQ.check_subscription_a": "Go to Account - Personal Information - Package Details - Usage. You can view the effective and expiration dates of your subscribed packages. After the paid package expires, it will automatically switch to the free version.",
"FAQ.check_subscription_q": "Where can I view my subscribed packages?",
"FAQ.dataset_compute_a": "1 Dataset storage equals 1 Dataset index. A piece of Dataset data can contain one or more Dataset indexes. In enhanced training, 1 piece of data generates 5 indexes.",
"FAQ.dataset_compute_a": "1 knowledge base storage is equal to 1 knowledge base index. \nA single chunked data usually corresponds to multiple indexes. You can see \"n group indexes\" in a single knowledge base collection.",
"FAQ.dataset_compute_q": "How is Dataset storage calculated?",
"FAQ.dataset_index_a": "No, but if the Dataset index exceeds the limit, you cannot insert or update Dataset content.",
"FAQ.dataset_index_q": "Will the Dataset index be deleted if it exceeds the limit?",

View File

@@ -29,7 +29,7 @@
"FAQ.ai_point_q": "什么是AI积分",
"FAQ.check_subscription_a": "账号-个人信息-套餐详情-使用情况。您可以查看所拥有套餐的生效和到期时间。当付费套餐到期后将自动切换免费版。",
"FAQ.check_subscription_q": "在哪里查看已订阅的套餐?",
"FAQ.dataset_compute_a": "1条知识库存储等于1条知识库索引。一条知识库数据可以包含1条或多条知识库索引。增强训练中1条数据会生成5条索引。",
"FAQ.dataset_compute_a": "1条知识库存储等于1条知识库索引。一条分块数据,通常对应多条索引,可以在单个知识库集合中看到\"n组索引\"",
"FAQ.dataset_compute_q": "知识库存储怎么计算?",
"FAQ.dataset_index_a": "不会。但知识库索引超出时,无法插入和更新知识库内容。",
"FAQ.dataset_index_q": "知识库索引超出会删除么?",

View File

@@ -29,7 +29,7 @@
"FAQ.ai_point_q": "什麼是 AI 點數?",
"FAQ.check_subscription_a": "帳號 - 個人資訊 - 方案詳細資訊 - 使用狀況。您可以檢視已訂閱方案的生效和到期時間。當付費方案到期後,將自動切換為免費版。",
"FAQ.check_subscription_q": "在哪裡可以檢視已訂閱的方案?",
"FAQ.dataset_compute_a": "1知識庫儲存等於 1 筆知識庫索引。一筆知識庫資料可以包含 1 筆或多筆知識庫索引。在增強訓練中1 筆資料會產生 5 筆索引。",
"FAQ.dataset_compute_a": "1知識庫存儲等於1條知識庫索引。\n一條分塊數據通常對應多條索引可以在單個知識庫集合中看到\"n組索引\"",
"FAQ.dataset_compute_q": "知識庫儲存如何計算?",
"FAQ.dataset_index_a": "不會,但知識庫索引超出限制時,將無法插入和更新知識庫內容。",
"FAQ.dataset_index_q": "知識庫索引超出是否會被刪除?",

View File

@@ -1,6 +1,6 @@
{
"name": "app",
"version": "4.9.7",
"version": "4.9.8",
"private": false,
"scripts": {
"dev": "next dev",

View File

@@ -403,7 +403,9 @@ const MenuRender = React.memo(function MenuRender({
outputs: node.data.outputs,
showStatus: node.data.showStatus,
pluginId: node.data.pluginId,
version: node.data.version
version: node.data.version,
versionLabel: node.data.versionLabel,
isLatestVersion: node.data.isLatestVersion
};
return [
@@ -423,7 +425,9 @@ const MenuRender = React.memo(function MenuRender({
pluginId: template.pluginId,
inputs: template.inputs,
outputs: template.outputs,
version: template.version
version: template.version,
versionLabel: template.versionLabel,
isLatestVersion: template.isLatestVersion
},
selected: true,
parentNodeId: undefined,