zoukankan      html  css  js  c++  java
  • js逻辑中部分公共方法分享

    module.exports = {
        //生成从minNum到maxNum的随机数
        randomNum(minNum, maxNum) {
            switch (arguments.length) {
                case 1:
                    return parseInt(Math.random() * minNum + 1, 10);
                    break;
                case 2:
                    return parseInt(Math.random() * (maxNum - minNum + 1) + minNum, 10);
                    break;
                default:
                    return 0;
                    break;
            }
        },
        //获取当前日期的字符串,如20200312
        getTodayString() {
            var time = new Date();
            var year = time.getFullYear();
            var month = this.prefixZero(time.getMonth() + 1, 2);
            var day = this.prefixZero(time.getUTCDate(), 2);
            return year + month + day;
        },
        // 时间戳转换成字符串
        formatTime(time, type = "y-m-d h:i:s") {
            type = type.toLowerCase();
            var time = new Date(time)
            var y = time.getFullYear()
            var m = time.getMonth() + 1;
            var d = time.getDate()
            var h = time.getHours()
            var i = time.getMinutes()
            var s = time.getSeconds()
            var res = ''
            for (var z = 0; z < type.length; z++) {
                if ('ymdhis'.search(type[z]) < 0) {
                    res += type[z]
                } else {
                    var x = eval(type[z]) < 10 ? '0' + eval(type[z]) : eval(type[z])
                    res += x
                }
            }
            return res;
        },
        // 数字自动补零
        prefixZero(num, n) {
            return (Array(n).join(0) + num).slice(-n);
        },
        // 设置数字格式
        setNumFormat(num) {
            // K、M、G、T
            if (num / 1000000000000 >= 1) {
                return (num / 1000000000000).toFixed(1) + 'T';
            } else if (num / 1000000000 >= 1) {
                return (num / 1000000000).toFixed(1) + 'G';
            } else if (num / 1000000 >= 1) {
                return (num / 1000000).toFixed(1) + 'M';
            } else if (num / 1000 >= 1) {
                return (num / 1000).toFixed(1) + 'K';
            } else {
                return num;
            }
        },
        //复制内容到剪贴板
        copyContent(type, content, show) {
            if ("undefined" !== typeof dogandroid) {
                dogandroid.copyContent(type, content, show);
            } else {
                try {
                    var textArea = document.getElementById("clipBoard");
                    if (textArea === null) {
                        textArea = document.createElement("textarea");
                        textArea.id = "clipBoard";
                        textArea.textContent = content;
                        document.body.appendChild(textArea);
                    }
                    textArea.select();
                    const msg = document.execCommand('copy') ? 'successful' : 'unsuccessful';
                    document.body.removeChild(textArea);
                    alert(show);
                } catch (err) {}
            }
        },
        // 邮箱格式校验
        chkEmail(strEmail) {
            if (!/^w+([-+.]w+)*@w+([-.]w+)*.w+([-.]w+)*$/.test(strEmail)) {
                return false;
            } else {
                return true;
            }
        },
        // 数字格式加逗号分隔
        numFormat(num) {
            var c = (num.toString().indexOf('.') !== -1) ? num.toLocaleString() : num.toString().replace(/(d)(?=(?:d{3})+$)/g, '$1,');
            return c;
        },
     // 获取地址栏url参数
        getQueryString(name) {
            var reg = new RegExp("(^|&)" + name + "=([^&]*)(&|$)", "i");
            var search = decodeURIComponent(window.location.search);
            var r = search.substr(1).match(reg);
            if (r != null) return unescape(r[2]);
            return null;
        },
    
    }
    

      

  • 相关阅读:
    Digital Square(hdu4394)搜索
    Substrings(hdu1238)字符串匹配
    Graveyard(poj3154)
    数据库的范式理论
    模和除
    You can Solve a Geometry Problem too (hdu1086)几何,判断两线段相交
    对vector等STL标准容器进行排序操作(转!)
    0 or 1(hdu2608)数学题
    LintCode 4.丑数
    LintCode 9.Fizz Buzz问题
  • 原文地址:https://www.cnblogs.com/bigkuan/p/14536521.html
Copyright © 2011-2022 走看看