From 3370b734a246ab4382b1dadae03b6b577558d143 Mon Sep 17 00:00:00 2001 From: jiang Date: Fri, 13 Sep 2024 16:36:46 +0800 Subject: [PATCH] =?UTF-8?q?=E7=94=A8=E6=88=B7=E7=99=BB=E5=BD=95=E9=97=AE?= =?UTF-8?q?=E9=A2=98=E4=BF=AE=E6=94=B9?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/utils/request.js | 1 - src/utils/validate.js | 28 ++++++++++++++-------------- 2 files changed, 14 insertions(+), 15 deletions(-) diff --git a/src/utils/request.js b/src/utils/request.js index d27fc556..9334666d 100644 --- a/src/utils/request.js +++ b/src/utils/request.js @@ -9,7 +9,6 @@ import { saveAs } from 'file-saver' import { encryptCBC, decryptCBC } from '@/utils/aescbc' import { CONFIG } from '@/utils/configure' import { hashWithSM3AndSalt } from '@/utils/sm' -import data from '@/views/system/dict/data.vue' //let token = localStorage.getItem("tokens"); diff --git a/src/utils/validate.js b/src/utils/validate.js index db60a7c9..659aad00 100644 --- a/src/utils/validate.js +++ b/src/utils/validate.js @@ -199,32 +199,32 @@ export function validateNewPassword(rule, value, callback) { } function containsConsecutiveCharacters(password, maxConsecutive) { - let count = 1; // 初始化计数器 - let previousChar = ""; // 保存上一个字符 - + let count = 1 // 初始化计数器 + let previousChar = '' // 保存上一个字符 + maxConsecutive = maxConsecutive + 1 for (let i = 0; i < password.length; i++) { // 检查当前字符与前一个字符是否相同 if (password[i] === previousChar) { - count++; // 计数器加1 + count++ // 计数器加1 } else { - count = 1; // 如果字符不同,重置计数器 + count = 1 // 如果字符不同,重置计数器 } // 检查是否超过最大连续字符数 if (count > maxConsecutive) { - return true; + return true } // 检查当前字符是否是数字 if (/\d/.test(password[i])) { // 检查是否有超过指定数量的连续数字 if (i > 0 && password[i] === password[i - 1]) { - count++; // 计数器加1 + count++ // 计数器加1 if (count > maxConsecutive) { - return true; + return true } } else { - count = 1; // 重置计数器 + count = 1 // 重置计数器 } } @@ -232,18 +232,18 @@ function containsConsecutiveCharacters(password, maxConsecutive) { if (/[a-zA-Z]/.test(password[i])) { // 检查是否有超过指定数量的连续字母 if (i > 0 && password[i] === password[i - 1]) { - count++; // 计数器加1 + count++ // 计数器加1 if (count > maxConsecutive) { - return true; + return true } } else { - count = 1; // 重置计数器 + count = 1 // 重置计数器 } } - previousChar = password[i]; // 更新上一个字符 + previousChar = password[i] // 更新上一个字符 } - return false; // 如果没有找到问题,则返回符合要求的提示 + return false // 如果没有找到问题,则返回符合要求的提示 }