From b55024ee2f42aa93e0ecaa3113bdeb286f6e59ac Mon Sep 17 00:00:00 2001
From: QYF-GitLab1 <1940665526@qq.com>
Date: 星期二, 29 七月 2025 18:01:55 +0800
Subject: [PATCH] 优化按钮显示，教学互动
---
packageBookService/pages/bookServices/detail/components/tree/index.js | 6 +++++-
1 files changed, 5 insertions(+), 1 deletions(-)
diff --git a/packageBookService/pages/bookServices/detail/components/tree/index.js b/packageBookService/pages/bookServices/detail/components/tree/index.js
index 3d90c78..509c3a9 100644
--- a/packageBookService/pages/bookServices/detail/components/tree/index.js
+++ b/packageBookService/pages/bookServices/detail/components/tree/index.js
@@ -109,6 +109,7 @@
}
});
const flag = list.findIndex((item) => item.checked == true);
+ console.log(this.properties.treeList)
},
},
methods: {
@@ -221,6 +222,7 @@
// 璺宠浆闊宠棰戞挱鏀惧櫒
goPlayer(e) {
// 妫�鏌ョ櫥褰曠姸鎬�
+ // if (this.properties.bookInfo.IsTextbook) return
const goPlayerFun = async () => {
const item = e.currentTarget.dataset.item;
const parent = e.currentTarget.dataset.parent;
@@ -316,7 +318,7 @@
}
wx.navigateTo({
url: `${url}?productLinkPath=${item.productLinkPath}&parentProductLinkPath=${parentProductLinkPath}&parentName=${parentName}&activeId=${item.id}&bookId=${this.properties.bookInfo.id}&bookName=${this.properties.bookInfo.name}&cmsId=${this.properties.bookInfo.rootCmsItemId}&formPath=${this.properties.tab}&applyState=${this.properties.applyState}&deadline=${this.properties.deadline}`,
- // url: '/packageDomain/pages/resourceDetails/myVideo/index?formPath=jsek_cloudLearning&parentName=gggg&cmsId=137103&productLinkPath=137103\\137105\\159492&activeId=159492&parentProductLinkPath=137105&source=qrcode&bookName=fffff&bookId=6745'
+ // url: '/packageDomain/pages/resourceDetails/myVideo/index?formPath=jsek_cloudLearning&parentName=YDHYD&cmsId=161974&productLinkPath=161974\\161976\\162006&activeId=162006&parentProductLinkPath=161976&source=qrcode&bookName=fffff&bookId=7136'
});
}
const token = wx.getStorageSync(app.config.tokenKey);
@@ -358,8 +360,10 @@
// 鎷垮埌褰撳墠椤瑰瓙椤�
flattenTree(tree) {
let result = [];
+ let that = this
function flatten(node) {
+
result.push(node);
if (node.children && node.children.length > 0) {
node.children.forEach((child) => {
--
Gitblit v1.9.1