图书列表、详情代码修改

闫增涛

2024-03-26 9e5a84a4e41d7ab2cb820c7f77122f69a9d036dd

 packageBookService/pages/bookServices/detail/index.js

@@ -402,7 +402,6 @@
            });
          }
        }
        console.log(this.data.fileInfo, 456)
        this.setData({
          selectedIds: this.data.bookDetail.defaultSaleMethodId,
          bookBuy: this.data.bookDetail.purchasedSaleMethodIdList.indexOf(this.data.bookDetail.defaultSaleMethodId) > -1
@@ -600,7 +599,7 @@
                loading: false,
                openTeachids: result
              })
              console.log('教学资源', this.data.teach);
              console.log('教学资源', this.data.teach, this.data.applyState);
            } else if (type.refCode == 'jsek_cloudLearning') {
              // res.datas.cmsDatas[0].datas.forEach(item => {
              //   item.checked = false
@@ -705,12 +704,12 @@
    for (let i = 0; i < data.length; i++) {
      if (index < 3) {
        const item = data[i]
        if (item.childrenFolderCount > 0) {
        if (item.children && item.children.length > 0) {
          result.push(item.id)
          for (let j = 0; j < item.children.length; j++) {
            if (index < 3) {
              const childrenItme = item.children[j]
              if (item.childrenCount > 0) {
              if (item.children && item.children.length > 0) {
                result.push(childrenItme.id)
                index += 1
              }
@@ -718,7 +717,7 @@
              break
            }
          }
        } else if (item.childrenCount > 0) {
        } else if (item.children && item.children.length > 0) {
          result.push(item.id)
          index += 1
        }
@@ -1723,5 +1722,29 @@
      url: "/packageDomain/pages/sampleBookList/applicationForm/index",
    });
  },

  handleTree() {
    // const child = this.selectComponent('#teach-tree')
    let tree
    // let openIds = child.data.openIds
    if (this.data.tabValue == 'jsek_teachingResources') {
      tree = this.data.teach
    } else {
      tree = this.data.learn
    }
    for (let index = 0; index < tree.length; index++) {
      const item = tree[index];
      if (item.children && item.children.length > 0) {
        const num = this.data.openTeachids.findIndex(citem => item.id == citem)
        if (num >= 0) {
          item.open = true
        } else {
          item.open = false
        }
        this.handleTree(item.children)
      }
    }
    this.setData({
      teach: tree
    })
  },
})