海枫

海枫 VIP3

875飞吻 2015-12-10 加入 来自西安

(充满希望的旅途,胜过终点的到达。)

海枫 最近的回答

  • 2018-4-3 9:57:2layui 2.2.6 发布,发个版本压压惊中回答:

    赞一个!!!!!
  • 2017-12-28 10:30:21Admin有点小贵啊!!!中回答:

    @toforever 个人觉得买卖是双方的事情,无须指责产品的价格高低。觉得产品价值与价格匹配,自己也需要,买即可,反之不理即可,何必费这么多的口舌。说到价格这个东西,可能你觉得产品不值其标注的价格,但在其作者或者急切需要的人而言,是无价的或者价有所值;而你个人觉得价值不菲的产品,可能在别人眼里或许一文不值,因为他不需要。说这么多没别的意思,只是觉得国内真正做开源的没有几个,而且还是个人,不希望死在无刃的钢刀之下。
  • 2017-12-21 16:13:13layui支持md5嘛?如何使用中回答:

    使用方式
    md5.calcMD5('要加密的字符串');
  • 2017-12-21 16:11:48layui支持md5嘛?如何使用中回答:

    我个人基于layui封装了一个MD5加密的模块,希望能帮到你
    /**
    * Des: MD5加密
    * User: Yanbo
    * Date: 2017-09-01
    * Time: 10:50
    * Mail: <a href="yanbo@hyphoneit.com">Yanbo</a>.
    */
    ;!function (win) {
    'use strict';
    layui.define(function (exports) {
    var md5 = {
    config: {
    MOD_NAME: 'md5'
    }
    /**
    * 对字符串进行MD5加密
    * @param str 要加密的字符串
    */
    , calcMD5: function (str) {
    var self = this
    , x = self.str2blksMD5(str)
    , a = 0x67452301
    , b = 0xEFCDAB89
    , c = 0x98BADCFE
    , d = 0x10325476;
    for (var i = 0; i < x.length; i += 16) {
    var olda = a
    , oldb = b
    , oldd = d
    , oldc = c;
    a = self.ff(a, b, c, d, x[i + 0], 7, 0xD76AA478);
    d = self.ff(d, a, b, c, x[i + 1], 12, 0xE8C7B756);
    c = self.ff(c, d, a, b, x[i + 2], 17, 0x242070DB);
    b = self.ff(b, c, d, a, x[i + 3], 22, 0xC1BDCEEE);
    a = self.ff(a, b, c, d, x[i + 4], 7, 0xF57C0FAF);
    d = self.ff(d, a, b, c, x[i + 5], 12, 0x4787C62A);
    c = self.ff(c, d, a, b, x[i + 6], 17, 0xA8304613);
    b = self.ff(b, c, d, a, x[i + 7], 22, 0xFD469501);
    a = self.ff(a, b, c, d, x[i + 8], 7, 0x698098D8);
    d = self.ff(d, a, b, c, x[i + 9], 12, 0x8B44F7AF);
    c = self.ff(c, d, a, b, x[i + 10], 17, 0xFFFF5BB1);
    b = self.ff(b, c, d, a, x[i + 11], 22, 0x895CD7BE);
    a = self.ff(a, b, c, d, x[i + 12], 7, 0x6B901122);
    d = self.ff(d, a, b, c, x[i + 13], 12, 0xFD987193);
    c = self.ff(c, d, a, b, x[i + 14], 17, 0xA679438E);
    b = self.ff(b, c, d, a, x[i + 15], 22, 0x49B40821);

    a = self.gg(a, b, c, d, x[i + 1], 5, 0xF61E2562);
    d = self.gg(d, a, b, c, x[i + 6], 9, 0xC040B340);
    c = self.gg(c, d, a, b, x[i + 11], 14, 0x265E5A51);
    b = self.gg(b, c, d, a, x[i + 0], 20, 0xE9B6C7AA);
    a = self.gg(a, b, c, d, x[i + 5], 5, 0xD62F105D);
    d = self.gg(d, a, b, c, x[i + 10], 9, 0x02441453);
    c = self.gg(c, d, a, b, x[i + 15], 14, 0xD8A1E681);
    b = self.gg(b, c, d, a, x[i + 4], 20, 0xE7D3FBC8);
    a = self.gg(a, b, c, d, x[i + 9], 5, 0x21E1CDE6);
    d = self.gg(d, a, b, c, x[i + 14], 9, 0xC33707D6);
    c = self.gg(c, d, a, b, x[i + 3], 14, 0xF4D50D87);
    b = self.gg(b, c, d, a, x[i + 8], 20, 0x455A14ED);
    a = self.gg(a, b, c, d, x[i + 13], 5, 0xA9E3E905);
    d = self.gg(d, a, b, c, x[i + 2], 9, 0xFCEFA3F8);
    c = self.gg(c, d, a, b, x[i + 7], 14, 0x676F02D9);
    b = self.gg(b, c, d, a, x[i + 12], 20, 0x8D2A4C8A);

    a = self.hh(a, b, c, d, x[i + 5], 4, 0xFFFA3942);
    d = self.hh(d, a, b, c, x[i + 8], 11, 0x8771F681);
    c = self.hh(c, d, a, b, x[i + 11], 16, 0x6D9D6122);
    b = self.hh(b, c, d, a, x[i + 14], 23, 0xFDE5380C);
    a = self.hh(a, b, c, d, x[i + 1], 4, 0xA4BEEA44);
    d = self.hh(d, a, b, c, x[i + 4], 11, 0x4BDECFA9);
    c = self.hh(c, d, a, b, x[i + 7], 16, 0xF6BB4B60);
    b = self.hh(b, c, d, a, x[i + 10], 23, 0xBEBFBC70);
    a = self.hh(a, b, c, d, x[i + 13], 4, 0x289B7EC6);
    d = self.hh(d, a, b, c, x[i + 0], 11, 0xEAA127FA);
    c = self.hh(c, d, a, b, x[i + 3], 16, 0xD4EF3085);
    b = self.hh(b, c, d, a, x[i + 6], 23, 0x04881D05);
    a = self.hh(a, b, c, d, x[i + 9], 4, 0xD9D4D039);
    d = self.hh(d, a, b, c, x[i + 12], 11, 0xE6DB99E5);
    c = self.hh(c, d, a, b, x[i + 15], 16, 0x1FA27CF8);
    b = self.hh(b, c, d, a, x[i + 2], 23, 0xC4AC5665);

    a = self.ii(a, b, c, d, x[i + 0], 6, 0xF4292244);
    d = self.ii(d, a, b, c, x[i + 7], 10, 0x432AFF97);
    c = self.ii(c, d, a, b, x[i + 14], 15, 0xAB9423A7);
    b = self.ii(b, c, d, a, x[i + 5], 21, 0xFC93A039);
    a = self.ii(a, b, c, d, x[i + 12], 6, 0x655B59C3);
    d = self.ii(d, a, b, c, x[i + 3], 10, 0x8F0CCC92);
    c = self.ii(c, d, a, b, x[i + 10], 15, 0xFFEFF47D);
    b = self.ii(b, c, d, a, x[i + 1], 21, 0x85845DD1);
    a = self.ii(a, b, c, d, x[i + 8], 6, 0x6FA87E4F);
    d = self.ii(d, a, b, c, x[i + 15], 10, 0xFE2CE6E0);
    c = self.ii(c, d, a, b, x[i + 6], 15, 0xA3014314);
    b = self.ii(b, c, d, a, x[i + 13], 21, 0x4E0811A1);
    a = self.ii(a, b, c, d, x[i + 4], 6, 0xF7537E82);
    d = self.ii(d, a, b, c, x[i + 11], 10, 0xBD3AF235);
    c = self.ii(c, d, a, b, x[i + 2], 15, 0x2AD7D2BB);
    b = self.ii(b, c, d, a, x[i + 9], 21, 0xEB86D391);

    a = self.add(a, olda);
    b = self.add(b, oldb);
    c = self.add(c, oldc);
    d = self.add(d, oldd);
    }
    return self.rhex(a) + self.rhex(b) + self.rhex(c) + self.rhex(d);
    }
    /*
    * Convert a string to a sequence of 16-word blocks, stored as an array.
    * Append padding bits and the length, as described in the MD5 standard.
    */
    , str2blksMD5: function (str) {
    var nblk = ((str.length + 8) >> 6) + 1
    , blks = new Array(nblk * 16);
    for (var i = 0; i < nblk * 16; i++) blks[i] = 0;
    for (var i = 0; i < str.length; i++)
    blks[i >> 2] |= str.charCodeAt(i) << ((i % 4) * 8);
    blks[i >> 2] |= 0x80 << ((i % 4) * 8);
    blks[nblk * 16 - 2] = str.length * 8;
    return blks;
    }
    /*
    * Add integers, wrapping at 2^32
    */
    , add: function (x, y) {
    return ((x & 0x7FFFFFFF) + (y & 0x7FFFFFFF)) ^ (x & 0x80000000) ^ (y & 0x80000000);
    }
    /*
    * Bitwise rotate a 32-bit number to the left
    */
    , rol: function (num, cnt) {
    return (num << cnt) | (num >>> (32 - cnt));
    }
    /*
    * These functions implement the basic operation for each round of the
    * algorithm.
    */
    , cmn: function (q, a, b, x, s, t) {
    var self = this;
    return self.add(self.rol(self.add(self.add(a, q), self.add(x, t)), s), b);
    }
    , ff: function (a, b, c, d, x, s, t) {
    var self = this;
    return self.cmn((b & c) | ((~b) & d), a, b, x, s, t);
    }
    , gg: function (a, b, c, d, x, s, t) {
    var self = this;
    return self.cmn((b & d) | (c & (~d)), a, b, x, s, t);
    }
    , hh: function (a, b, c, d, x, s, t) {
    var self = this;
    return self.cmn(b ^ c ^ d, a, b, x, s, t);
    }
    , ii: function (a, b, c, d, x, s, t) {
    var self = this;
    return self.cmn(c ^ (b | (~d)), a, b, x, s, t);
    }
    , rhex: function (num) {
    var hex_chr = '0123456789abcdef'
    , str = '';
    for (var j = 0; j <= 3; j++)
    str += hex_chr.charAt((num >> (j * 8 + 4)) & 0x0F) + hex_chr.charAt((num >> (j * 8)) & 0x0F);
    return str;
    }
    }
    , _config = md5.config;
    exports(_config.MOD_NAME, md5);
    });
    }(window);
  • 2017-12-21 14:58:7table中使用templet模板渲染单列出现省略号事件监听问题的处理中回答:

    @Mistyss 未明白你想表达何意
  • 2017-12-7 17:46:32layui 2.2.4 与 2.2.45 发布,优化了较多问题中回答:

    赞!赞!赞!赞!赞!赞!
  • 2017-12-1 10:42:19Fly Template v3.0 发布,基于 layui 的极简社区模板中回答:

    赞!赞!赞!赞!赞!
  • 2017-11-30 19:1:1《layui从鱼到渔》系列教程中回答:

    赞!赞!赞!
  • 2017-11-16 11:44:43预测下 layuiAdmin 的最低售价。猜对者奖励社区 200 飞吻中回答:

    毫无疑问,1200
  • 2017-11-16 11:35:36layui 2.2.1 发布,良心之更 +1中回答:

    赞!赞!赞!
  • 2017-11-15 12:3:9layui 2.2.0 发布,良心之更中回答:

    赞!赞!赞!
  • 2017-11-9 11:53:8【已结束】社区 VIP3 半价巨惠强势开启,三大礼包相赠中回答:

    已下单,支持心姐!!!
  • 2017-11-1 17:12:22[求助]在layui中使用echarts的地图时出现异常中回答:

    这个问题我也遇到了,你解决了么?
  • 2017-11-1 11:1:9layui 2.1.6 发布,多处小细节改善中回答:

    这个版本更新很及时,* 新增用于替代 element.init 的 element.render() 方法(为了整体编码统一),并增加了两个参数:type、filter,以便对元素进行局部初始化。但 init 方法仍会兼容。这个东东正是我想要的!感谢心姐!
  • 2017-9-21 12:46:18@贤心 看一看我为数据表格提的一些小建议吧中回答:

    1的点适用场景太少,个人觉得没必要,毕竟心姐还要把更多的经历投入到大众所需里