chenjun 3 年之前
父节点
当前提交
35ce50b2ca
共有 2 个文件被更改,包括 36 次插入1 次删除
  1. 33 1
      src/utils/validate.js
  2. 3 0
      src/views/systemManagement/index.vue

+ 33 - 1
src/utils/validate.js

@@ -117,7 +117,8 @@ export function pwdProduce(minLen, maxLen, struc) {
   //数字
   const numbers = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9"]
   // 密码随机长度
-  const pwdLen = randomNum(minLen, maxLen)
+  // const pwdLen = randomNum(minLen, maxLen)
+  const pwdLen = maxLen
   const datas = []
 
   if (pwdStruc.length) {
@@ -152,6 +153,37 @@ export function pwdProduce(minLen, maxLen, struc) {
         dis += v[i]
       }
     }
+    let strlong = pwdLen- (passLong * typeLong);
+    if(strlong>0){
+      if (pwdStruc[0] == 1) {
+        let arr = alphabet.toLocaleUpperCase().split('');
+        let v = randomAlp(arr, strlong);
+        for (let i = 0; i < strlong; i++) {
+          dis += v[i]
+        }
+      }
+      else if (pwdStruc[1] == 1) {
+        let arr = alphabet.split('');
+        let v = randomAlp(arr, strlong);
+        for (let i = 0; i < strlong; i++) {
+          dis += v[i]
+        }
+      }
+      else if (pwdStruc[2] == 1) {
+        let arr = special
+        let v = randomAlp(arr, strlong);
+        for (let i = 0; i < strlong; i++) {
+          dis += v[i]
+        }
+      }
+      else if (pwdStruc[3] == 1) {
+        let arr = numbers
+        let v = randomAlp(arr, strlong);
+        for (let i = 0; i < strlong; i++) {
+          dis += v[i]
+        }
+      }
+    }
     return dis
     //缓存当前的密码规则
     // pwdStruc.forEach((item, index) => {

+ 3 - 0
src/views/systemManagement/index.vue

@@ -286,6 +286,9 @@ export default {
       else if (this.FormData.PwdStruc == 101) {
         this.FormData.PwdStruc = "0101"
       }
+      else if (this.FormData.PwdStruc == 111) {
+        this.FormData.PwdStruc = "0111"
+      }
       else if (this.FormData.PwdStruc == 1) {
         this.FormData.PwdStruc = "0001"
       }