/** * Created by kikop on 2018/1/21. */ var generateHashcodeMManager = { /** * 根据形参生成 hashCode,[该方法效率太慢了] * @param str * @returns {number} */ generateHashCode: function (str) { var h = 0, off = 0; var len = str.length; for (var i = 0; i < len; i++) { h = 31 * h + str.charCodeAt(off++); } var t = -2147483648 * 2; while (h > 2147483647) { h += t } return h; } } $(function () { var objid = 123456; var begin_time = '2018-04-08 12:00:00'; var end_time = '2018-04-09 12:00:00'; var end_time2 = '2018-04-19 12:00:00'; var generateStr = '', generateStr2 = ''; generateStr += objid + '_' + begin_time + '_' + end_time; generateStr2 += objid + '_' + begin_time + '_' + end_time2; //var generatehashcode=generateHashcodeMManager.generateHashCode(generateStr); console.log(generateStr); console.log(generateStr2); //if (generateStr === generateStr2) { //恒等比较(类型+内容) if (generateStr === generateStr2) { //比较(内容) console.log('equal'); } else { console.log('not equal'); } } )
generateHashcodeMManager
最新推荐文章于 2020-05-16 21:25:08 发布