当前位置: 首页 > news >正文

前端开发常用的方法封装(二)

1.将阿拉伯数字翻译成中文的大写数字

export const numberToChinese = (num) => {let AA = new Array("零","一","二","三","四","五","六","七","八","九","十");let BB = new Array("", "十", "百", "仟", "萬", "億", "点", "");let a = ("" + num).replace(/(^0*)/g, "").split("."),k = 0,re = "";for (let i = a[0].length - 1; i >= 0; i--) {switch (k) {case 0:re = BB[7] + re;break;case 4:if (!new RegExp("0{4}//d{" + (a[0].length - i - 1) + "}$").test(a[0]))re = BB[4] + re;break;case 8:re = BB[5] + re;BB[7] = BB[5];k = 0;break;}if (k % 4 == 2 && a[0].charAt(i + 2) != 0 && a[0].charAt(i + 1) == 0)re = AA[0] + re;if (a[0].charAt(i) != 0) re = AA[a[0].charAt(i)] + BB[k % 4] + re;k++;}if (a.length > 1) {// 加上小数部分(如果有小数部分)re += BB[6];for (let i = 0; i < a[1].length; i++) re += AA[a[1].charAt(i)];}if (re == "一十") re = "十";if (re.match(/^一/) && re.length == 3) re = re.replace("一", "");return re;
};

2.将数字转换为大写金额

export const changeToChinese = (Num) => {//判断如果传递进来的不是字符的话转换为字符if (typeof Num == "number") {Num = new String(Num);}Num = Num.replace(/,/g, ""); //替换tomoney()中的“,”Num = Num.replace(/ /g, ""); //替换tomoney()中的空格Num = Num.replace(//g, ""); //替换掉可能出现的¥字符if (isNaN(Num)) {//验证输入的字符是否为数字//alert("请检查小写金额是否正确");return "";}//字符处理完毕后开始转换,采用前后两部分分别转换let part = String(Num).split(".");let newchar = "";//小数点前进行转化for (let i = part[0].length - 1; i >= 0; i--) {if (part[0].length > 10) {return "";//若数量超过拾亿单位,提示}let tmpnewchar = "";let perchar = part[0].charAt(i);switch (perchar) {case "0":tmpnewchar = "零" + tmpnewchar;break;case "1":tmpnewchar = "壹" + tmpnewchar;break;case "2":tmpnewchar = "贰" + tmpnewchar;break;case "3":tmpnewchar = "叁" + tmpnewchar;break;case "4":tmpnewchar = "肆" + tmpnewchar;break;case "5":tmpnewchar = "伍" + tmpnewchar;break;case "6":tmpnewchar = "陆" + tmpnewchar;break;case "7":tmpnewchar = "柒" + tmpnewchar;break;case "8":tmpnewchar = "捌" + tmpnewchar;break;case "9":tmpnewchar = "玖" + tmpnewchar;break;}switch (part[0].length - i - 1) {case 0:tmpnewchar = tmpnewchar + "元";break;case 1:if (perchar != 0) tmpnewchar = tmpnewchar + "拾";break;case 2:if (perchar != 0) tmpnewchar = tmpnewchar + "佰";break;case 3:if (perchar != 0) tmpnewchar = tmpnewchar + "仟";break;case 4:tmpnewchar = tmpnewchar + "万";break;case 5:if (perchar != 0) tmpnewchar = tmpnewchar + "拾";break;case 6:if (perchar != 0) tmpnewchar = tmpnewchar + "佰";break;case 7:if (perchar != 0) tmpnewchar = tmpnewchar + "仟";break;case 8:tmpnewchar = tmpnewchar + "亿";break;case 9:tmpnewchar = tmpnewchar + "拾";break;}let newchar = tmpnewchar + newchar;}//小数点之后进行转化if (Num.indexOf(".") != -1) {if (part[1].length > 2) {// alert("小数点之后只能保留两位,系统将自动截断");part[1] = part[1].substr(0, 2);}for (i = 0; i < part[1].length; i++) {tmpnewchar = "";perchar = part[1].charAt(i);switch (perchar) {case "0":tmpnewchar = "零" + tmpnewchar;break;case "1":tmpnewchar = "壹" + tmpnewchar;break;case "2":tmpnewchar = "贰" + tmpnewchar;break;case "3":tmpnewchar = "叁" + tmpnewchar;break;case "4":tmpnewchar = "肆" + tmpnewchar;break;case "5":tmpnewchar = "伍" + tmpnewchar;break;case "6":tmpnewchar = "陆" + tmpnewchar;break;case "7":tmpnewchar = "柒" + tmpnewchar;break;case "8":tmpnewchar = "捌" + tmpnewchar;break;case "9":tmpnewchar = "玖" + tmpnewchar;break;}if (i == 0) tmpnewchar = tmpnewchar + "角";if (i == 1) tmpnewchar = tmpnewchar + "分";newchar = newchar + tmpnewchar;}}//替换所有无用汉字while (newchar.search("零零") != -1) newchar = newchar.replace("零零", "零");newchar = newchar.replace("零亿", "亿");newchar = newchar.replace("亿万", "亿");newchar = newchar.replace("零万", "万");newchar = newchar.replace("零元", "元");newchar = newchar.replace("零角", "");newchar = newchar.replace("零分", "");if (newchar.charAt(newchar.length - 1) == "元") {newchar = newchar + "整";}return newchar;
};

3. 判断一个元素是否在数组中和数组排序

export const contains = (arr, val) => {return arr.indexOf(val) != -1 ? true : false;
};
// 数组排序
// {type} 1:从小到大 2:从大到小 3:随机
export const sort = (arr, type = 1) => {return arr.sort((a, b) => {switch (type) {case 1:return a - b;case 2:return b - a;case 3:return Math.random() - 0.5;default:return arr;}});
};

4.数组去重

export const unique = (arr) => {if (Array.hasOwnProperty("from")) {return Array.from(new Set(arr));} else {let n = {},r = [];for (let i = 0; i < arr.length; i++) {if (!n[arr[i]]) {n[arr[i]] = true;r.push(arr[i]);}}return r;}
};

5.求两个集合的并集和求两个集合的交集

// 求两个集合的并集
export const union = (a, b) => {let newArr = a.concat(b);return this.unique(newArr);
};// 求两个集合的交集
export const intersect = (a, b) => {let _this = this;a = this.unique(a);return this.map(a, function (o) {return _this.contains(b, o) ? o : null;});
};

6.删除其中一个元素、将类数组转换为数组、最大值、最小值、求和、平均值

// 删除其中一个元素
export const remove = (arr, ele) => {let index = arr.indexOf(ele);if (index > -1) {arr.splice(index, 1);}return arr;
};
// 将类数组转换为数组
export const formArray = (ary) => {let arr = [];if (Array.isArray(ary)) {arr = ary;} else {arr = Array.prototype.slice.call(ary);}return arr;
};
// 最大值
export const max = (arr) => {return Math.max.apply(null, arr);
};
// 最小值
export const min = (arr) => {return Math.min.apply(null, arr);
};
//求和
export const sum = (arr) => {return arr.reduce((pre, cur) => {return pre + cur;});
};
//平均值
export const average = (arr) => {return this.sum(arr) / arr.length;
};

7.去除空格

// type: 1-所有空格 2-前后空格 3-前空格 4-后空格
export const trim = (str, type) => {type = type || 1;switch (type) {case 1:return str.replace(/\s+/g, "");case 2:return str.replace(/(^\s*)|(\s*$)/g, "");case 3:return str.replace(/(^\s*)/g, "");case 4:return str.replace(/(\s*$)/g, "");default:return str;}
};

8.字符替换

// type: 1:首字母大写 2:首字母小写 3:大小写转换 4:全部大写 5:全部小写
export const changeCase = (str, type) => {type = type || 4;switch (type) {case 1:return str.replace(/\b\w+\b/g, function (word) {return (word.substring(0, 1).toUpperCase() + word.substring(1).toLowerCase());});case 2:return str.replace(/\b\w+\b/g, function (word) {return (word.substring(0, 1).toLowerCase() + word.substring(1).toUpperCase());});case 3:return str.split("").map(function (word) {if (/[a-z]/.test(word)) {return word.toUpperCase();} else {return word.toLowerCase();}}).join("");case 4:return str.toUpperCase();case 5:return str.toLowerCase();default:return str;}
};

9.检测密码强度

export const checkPwd = (str) => {let Lv = 0;if (str.length < 6) {return Lv;}if (/[0-9]/.test(str)) {Lv++;}if (/[a-z]/.test(str)) {Lv++;}if (/[A-Z]/.test(str)) {Lv++;}if (/[\.|-|_]/.test(str)) {Lv++;}return Lv;
};

10. 函数节流器

export const debouncer = (fn, time, interval = 200) => {if (time - (window.debounceTimestamp || 0) > interval) {fn && fn();window.debounceTimestamp = time;}
};

11.在字符串中插入新字符串

export const insertStr = (soure, index, newStr) => {let str = soure.slice(0, index) + newStr + soure.slice(index);return str;
};

12.判断两个对象是否键值相同

export const isObjectEqual = (a, b) => {let aProps = Object.getOwnPropertyNames(a);let bProps = Object.getOwnPropertyNames(b);if (aProps.length !== bProps.length) {return false;}for (let i = 0; i < aProps.length; i++) {let propName = aProps[i];if (a[propName] !== b[propName]) {return false;}}return true;
};

13.16进制颜色转RGBRGBA字符串

export const colorToRGB = (val, opa) => {let pattern = /^(#?)[a-fA-F0-9]{6}$/; //16进制颜色值校验规则let isOpa = typeof opa == "number"; //判断是否有设置不透明度if (!pattern.test(val)) {//如果值不符合规则返回空字符return "";}let v = val.replace(/#/, ""); //如果有#号先去除#号let rgbArr = [];let rgbStr = "";for (let i = 0; i < 3; i++) {let item = v.substring(i * 2, i * 2 + 2);let num = parseInt(item, 16);rgbArr.push(num);}rgbStr = rgbArr.join();rgbStr ="rgb" + (isOpa ? "a" : "") + "(" + rgbStr + (isOpa ? "," + opa : "") + ")";return rgbStr;
};

14.追加url参数

export const appendQuery = (url, key, value) => {let options = key;if (typeof options == "string") {options = {};options[key] = value;}options = $.param(options);if (url.includes("?")) {url += "&" + options;} else {url += "?" + options;}return url;
};
http://www.lryc.cn/news/107133.html

相关文章:

  • 【Java】Springboot脚手架生成初始化项目代码
  • LLaMA系列 | LLaMA和LLaMA-2精简总结
  • 运动蓝牙耳机什么款式好、适合运动的蓝牙耳机推荐
  • 在敏捷项目中如何做好资源规划?
  • mybatis-plus 用法
  • 重测序数据分析流程丨操作步骤与代码与代码脚本
  • npm -v无法显示版本号
  • 【Vue】父子组件值及方法传递使用
  • 医药化工企业洁净厂房改造消防防爆安全的重要性
  • Web开发中防止SQL注入
  • 【LeetCode-中等】剑指 Offer 35. 复杂链表的复制(详解)
  • QT图形视图系统 - 使用一个项目来学习QT的图形视图框架 -第一篇
  • Cat.1如何成为物联网业务加速器?
  • Qt应用开发(基础篇)——布局管理 Layout Management
  • Python web实战之 Django 的 ORM 框架详解
  • pycharm制作柱状图
  • 静态资源导入探究
  • 安全狗V3.512048版本绕过
  • prometheus监控k8s kube-proxy target down
  • SPSS数据分析--假设检验的两种原假设取舍决定方式
  • Python实现猫狗分类
  • pjsip、pjsua2+bcg729 windows下编译java版本
  • 尝试多数据表 sqlite
  • Keil出现Flash Timeout.Reset the Target and try it again.我有一种解决方法
  • 纯粹即刻,畅享音乐搜索的轻松体验
  • 动态规划之树形DP
  • 嵌入式_GD32使用宏开关进行Debug串口打印调试
  • 使用 GitHub Copilot 进行 Prompt Engineering 的初学者指南(译)
  • c++开发模式,享元模式
  • LLM大模型——langchain相关知识总结