87 lines
2.6 KiB
JavaScript
87 lines
2.6 KiB
JavaScript
/** 使用方法
|
||
*
|
||
* 在页面引入该js
|
||
* import ev from @/jsFile/check-tool/check-tool.js;
|
||
*
|
||
* 使用：
|
||
* console.log(ev.isPhone('1736692108'));//false
|
||
*/
|
||
|
||
// 大陆手机号判断
|
||
const isPhone = (val)=>{
|
||
return /^1[3456789]\d{9}$/.test(val);
|
||
};
|
||
|
||
/*
|
||
* 全中文校验
|
||
* */
|
||
function ChineseWordValid (val) {
|
||
return /^[\u4E00-\u9FA5]+$/.test(val);
|
||
}
|
||
|
||
// 英文和数字校验
|
||
function wordNumValid(val) {
|
||
return /^[0-9A-Za-z]+$/.test(val);
|
||
}
|
||
|
||
// emoji表情校验
|
||
function emojiValid(val) {
|
||
const regStr = /[\uD83C|\uD83D|\uD83E][\uDC00-\uDFFF][\u200D|\uFE0F]|[\uD83C|\uD83D|\uD83E][\uDC00-\uDFFF]|[0-9|*|#]\uFE0F\u20E3|[0-9|#]\u20E3|[\u203C-\u3299]\uFE0F\u200D|[\u203C-\u3299]\uFE0F|[\u2122-\u2B55]|\u303D|[\A9|\AE]\u3030|\uA9|\uAE|\u3030/ig;
|
||
return (regStr.test(val))
|
||
}
|
||
|
||
// 邮箱校验
|
||
function emailValid (val) {
|
||
return /^\w+([-+.]\w+)*@\w+([-.]\w+)*\.\w+([-.]\w+)*$/.test(val);
|
||
}
|
||
|
||
/*
|
||
* 大陆身份证校验
|
||
* */
|
||
const IdentityCodeValid = function (code) {
|
||
let city = {
|
||
11:"北京",12:"天津",13:"河北",14:"山西",15:"内蒙古",21:"辽宁",22:"吉林",23:"黑龙江 ",31:"上海",32:"江苏",
|
||
33:"浙江",34:"安徽",35:"福建",36:"江西",37:"山东",41:"河南",42:"湖北 ",43:"湖南",44:"广东",45:"广西",46:"海南",
|
||
50:"重庆",51:"四川",52:"贵州",53:"云南",54:"西藏 ",61:"陕西",62:"甘肃",63:"青海",64:"宁夏",65:"新疆",
|
||
71:"台湾",81:"香港",82:"澳门",91:"国外 "
|
||
};
|
||
let tip = '';
|
||
let pass = true;
|
||
|
||
if(!code || !/^\d{6}(18|19|20)?\d{2}(0[1-9]|1[012])(0[1-9]|[12]\d|3[01])\d{3}(\d|X)$/i.test(code)){
|
||
tip = "身份证号格式错误";
|
||
pass = false
|
||
} else if(!city[code.substr(0,2)]){
|
||
tip = "地址编码错误";
|
||
pass = false
|
||
} else{
|
||
// 18位身份证需要验证最后一位校验位
|
||
if(code.length == 18){
|
||
code = code.split('')
|
||
// ∑(ai×Wi)(mod 11)
|
||
// 加权因子
|
||
let factor = [ 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2 ]
|
||
// 校验位
|
||
let parity = [ 1, 0, 'X', 9, 8, 7, 6, 5, 4, 3, 2 ]
|
||
let sum = 0
|
||
let ai = 0
|
||
let wi = 0
|
||
for (let i = 0; i < 17; i++)
|
||
{
|
||
ai = code[i]
|
||
wi = factor[i]
|
||
sum += ai * wi
|
||
}
|
||
let last = parity[sum % 11];
|
||
if(parity[sum % 11] != code[17]){
|
||
tip = "校验位错误"
|
||
pass = false;
|
||
}
|
||
}
|
||
}
|
||
return pass;
|
||
};
|
||
|
||
export default {
|
||
isPhone, ChineseWordValid, wordNumValid, emojiValid, emailValid, IdentityCodeValid
|
||
} |