From a4b3ee325c7354579d495bc74a777e494e5ec38c Mon Sep 17 00:00:00 2001
From: quanwei <419654421@qq.com>
Date: Fri, 06 Feb 2026 18:18:44 +0800
Subject: [PATCH] 商品可以价格面议 选择走访时显示输入走访企业名 分会添加活动时要总会审核 分类添加人数限制,添加活动选择了填写人数限制的分类时活动名额下显示该分类人数限制为15 同一个企业30天内只能走访一次,在30天内走访同一个企业时提示该企业已被走访xx天后才可以从新走访

---
 shop_vue/src/views/plus/operations/auth/role/add.vue |   18 +++++++++---------
 1 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/shop_vue/src/views/plus/operations/auth/role/add.vue b/shop_vue/src/views/plus/operations/auth/role/add.vue
index 1b6504f..19a1dd6 100644
--- a/shop_vue/src/views/plus/operations/auth/role/add.vue
+++ b/shop_vue/src/views/plus/operations/auth/role/add.vue
@@ -30,7 +30,7 @@
 </template>
 
 <script>
-import PlusApi from '@/api/plus/region.js';
+import PlusApi from '@/api/plus/operations.js';
 
 export default {
   data() {
@@ -80,7 +80,7 @@
       self.$refs.form.validate(valid => {
         if (valid) {
           self.loading = true;
-          PlusApi.regionRoleAdd({
+          PlusApi.operationsRoleAdd({
             params: JSON.stringify(form)
           }, true)
             .then(data => {
@@ -89,7 +89,7 @@
                 message: '添加成功',
                 type: 'success'
               });
-              self.$router.push('/plus/region/auth/role/index');
+              self.$router.push('/plus/operations/auth/role/index');
             })
             .catch(error => {
               self.loading = false;
@@ -101,7 +101,7 @@
     /*获取数据*/
     getData() {
       let self = this;
-      PlusApi.regionRoleAddInfo()
+      PlusApi.operationsRoleAddInfo()
         .then(data => {
           self.data = data.data.menu;
           self.treeData = self.buildTree(self.data); // 构建树形结构
@@ -118,18 +118,18 @@
       if (!data || !Array.isArray(data)) {
         return [];
       }
-      
+
       // 创建映射表
       const map = {};
       const roots = [];
-      
+
       // 首先创建映射
       for (let i = 0; i < data.length; i++) {
         map[data[i].access_id] = i;
         // 初始化children数组
         data[i].children = [];
       }
-      
+
       // 然后建立父子关系
       for (let i = 0; i < data.length; i++) {
         const node = data[i];
@@ -148,7 +148,7 @@
           }
         }
       }
-      
+
       return roots;
     },
 
@@ -176,4 +176,4 @@
 .img {
   margin-top: 10px;
 }
-</style>
\ No newline at end of file
+</style>

--
Gitblit v1.9.2