|
@@ -93,17 +93,17 @@ function randomAlp(arr, count) {
|
|
|
|
|
|
let shuffled = arr.slice(0)
|
|
let shuffled = arr.slice(0)
|
|
let i = arr.length
|
|
let i = arr.length
|
|
- if(count>i){
|
|
|
|
|
|
+ if (count > i) {
|
|
i = count
|
|
i = count
|
|
}
|
|
}
|
|
let min = i - count, temp, index;
|
|
let min = i - count, temp, index;
|
|
while (i-- > min) {
|
|
while (i-- > min) {
|
|
index = Math.floor((arr.length) * Math.random());
|
|
index = Math.floor((arr.length) * Math.random());
|
|
temp = shuffled[index];
|
|
temp = shuffled[index];
|
|
- if( shuffled[i]){
|
|
|
|
|
|
+ if (shuffled[i]) {
|
|
shuffled[index] = shuffled[i];
|
|
shuffled[index] = shuffled[i];
|
|
}
|
|
}
|
|
- else{
|
|
|
|
|
|
+ else {
|
|
shuffled[index] = shuffled[index]
|
|
shuffled[index] = shuffled[index]
|
|
}
|
|
}
|
|
shuffled[i] = temp;
|
|
shuffled[i] = temp;
|
|
@@ -166,8 +166,8 @@ export function pwdProduce(minLen, maxLen, struc) {
|
|
dis += v[i]
|
|
dis += v[i]
|
|
}
|
|
}
|
|
}
|
|
}
|
|
- let strlong = pwdLen- (passLong * typeLong);
|
|
|
|
- if(strlong>0){
|
|
|
|
|
|
+ let strlong = pwdLen - (passLong * typeLong);
|
|
|
|
+ if (strlong > 0) {
|
|
if (pwdStruc[0] == 1) {
|
|
if (pwdStruc[0] == 1) {
|
|
let arr = alphabet.toLocaleUpperCase().split('');
|
|
let arr = alphabet.toLocaleUpperCase().split('');
|
|
let v = randomAlp(arr, strlong);
|
|
let v = randomAlp(arr, strlong);
|
|
@@ -224,3 +224,50 @@ export function pwdProduce(minLen, maxLen, struc) {
|
|
return new Error('密码规则转换失败')
|
|
return new Error('密码规则转换失败')
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
+
|
|
|
|
+//模糊查询
|
|
|
|
+export function findarrays(ar, feature, v) {
|
|
|
|
+ var arr = [];
|
|
|
|
+ for (var i = 0; i < ar.length; i++) {
|
|
|
|
+ var atxt = ar[i][feature];
|
|
|
|
+ var btxt = v;
|
|
|
|
+ var type = 0;
|
|
|
|
+ if (atxt.match(btxt) == btxt) {
|
|
|
|
+ type = 1;
|
|
|
|
+ }
|
|
|
|
+ if (type == 1) {
|
|
|
|
+ arr.push(ar[i]);
|
|
|
|
+ }
|
|
|
|
+ }
|
|
|
|
+ // var arr = [];
|
|
|
|
+ // for (var i = 0; i < ar.length; i++) {
|
|
|
|
+ // var atxt = ar[i][feature];
|
|
|
|
+ // var btxt = v;
|
|
|
|
+ // // 将字符串按某个字符切割成若干个字符串,并以数组形式返回
|
|
|
|
+ // var atxtarr = atxt;
|
|
|
|
+ // var btxtarr = btxt;
|
|
|
|
+ // var type = 0;
|
|
|
|
+ // // for (var k = 0; k < atxtarr.length; k++) {
|
|
|
|
+ // // if (btxtarr[0].length >= atxtarr[k].length) {
|
|
|
|
+ // // if (atxtarr[k] == btxtarr[0]) {
|
|
|
|
+ // // type = 1;
|
|
|
|
+ // // }
|
|
|
|
+ // // }
|
|
|
|
+ // // }
|
|
|
|
+ // if (atxtarr == btxtarr) {
|
|
|
|
+ // type = 1;
|
|
|
|
+ // } else if (atxtarr.length > btxtarr.length) {
|
|
|
|
+ // for (var k = 0; k < atxtarr.length; k++) {
|
|
|
|
+ // if (btxtarr[0].length >= atxtarr[k].length) {
|
|
|
|
+ // if (atxtarr[k] == btxtarr) {
|
|
|
|
+ // type = 1;
|
|
|
|
+ // }
|
|
|
|
+ // }
|
|
|
|
+ // }
|
|
|
|
+ // }
|
|
|
|
+ // if (type == 1) {
|
|
|
|
+ // arr.push(ar[i]);
|
|
|
|
+ // }
|
|
|
|
+ // }
|
|
|
|
+ return arr;
|
|
|
|
+}
|