亚洲乱码中文字幕综合,中国熟女仑乱hd,亚洲精品乱拍国产一区二区三区,一本大道卡一卡二卡三乱码全集资源,又粗又黄又硬又爽的免费视频

微信小程序 MD5加密登錄密碼詳解及實(shí)例代碼

 更新時(shí)間:2017年01月12日 17:24:49   投稿:lqh  
這篇文章主要介紹了微信小程序 MD5加密登錄密碼詳解及實(shí)例代碼的相關(guān)資料,這里附有實(shí)例代碼,需要的朋友可以參考下

微信小程序 MD5加密

     在小程序中,頁(yè)面的腳本邏輯是在JsCore中運(yùn)行,JsCore是一個(gè)沒有窗口對(duì)象的環(huán)境,所以不能在腳本中使用window,也無(wú)法在腳本中操作組件。zepto/jquery 也無(wú)法使用,因?yàn)閦epto/jquery 會(huì)使用到window對(duì)象和document對(duì)象。所以在微信小程序中不能使用jquery.md5.js對(duì)密碼進(jìn)行加密。下面我提供一種MD5.js加密實(shí)例,本實(shí)例先靜態(tài)演示,后面再到小程序中演示。

    md5.js程序如下:

/* 
 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message 
 * Digest Algorithm, as defined in RFC 1321. 
 * Version 1.1 Copyright (C) Paul Johnston 1999 - 2002. 
 * Code also contributed by Greg Holt 
 * See http://pajhome.org.uk/site/legal.html for details. 
 */ 
 
/* 
 * Add integers, wrapping at 2^32. This uses 16-bit operations internally 
 * to work around bugs in some JS interpreters. 
 */ 
function safe_add(x, y) 
{ 
 var lsw = (x & 0xFFFF) + (y & 0xFFFF) 
 var msw = (x >> 16) + (y >> 16) + (lsw >> 16) 
 return (msw << 16) | (lsw & 0xFFFF) 
} 
 
/* 
 * Bitwise rotate a 32-bit number to the left. 
 */ 
function rol(num, cnt) 
{ 
 return (num << cnt) | (num >>> (32 - cnt)) 
} 
 
/* 
 * These functions implement the four basic operations the algorithm uses. 
 */ 
function cmn(q, a, b, x, s, t) 
{ 
 return safe_add(rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b) 
} 
function ff(a, b, c, d, x, s, t) 
{ 
 return cmn((b & c) | ((~b) & d), a, b, x, s, t) 
} 
function gg(a, b, c, d, x, s, t) 
{ 
 return cmn((b & d) | (c & (~d)), a, b, x, s, t) 
} 
function hh(a, b, c, d, x, s, t) 
{ 
 return cmn(b ^ c ^ d, a, b, x, s, t) 
} 
function ii(a, b, c, d, x, s, t) 
{ 
 return cmn(c ^ (b | (~d)), a, b, x, s, t) 
} 
 
/* 
 * Calculate the MD5 of an array of little-endian words, producing an array 
 * of little-endian words. 
 */ 
function coreMD5(x) 
{ 
 var a = 1732584193 
 var b = -271733879 
 var c = -1732584194 
 var d = 271733878 
 
 for(i = 0; i < x.length; i += 16) 
 { 
  var olda = a 
  var oldb = b 
  var oldc = c 
  var oldd = d 
  a = ff(a, b, c, d, x[i+ 0], 7 , -680876936) 
  d = ff(d, a, b, c, x[i+ 1], 12, -389564586) 
  c = ff(c, d, a, b, x[i+ 2], 17, 606105819) 
  b = ff(b, c, d, a, x[i+ 3], 22, -1044525330) 
  a = ff(a, b, c, d, x[i+ 4], 7 , -176418897) 
  d = ff(d, a, b, c, x[i+ 5], 12, 1200080426) 
  c = ff(c, d, a, b, x[i+ 6], 17, -1473231341) 
  b = ff(b, c, d, a, x[i+ 7], 22, -45705983) 
  a = ff(a, b, c, d, x[i+ 8], 7 , 1770035416) 
  d = ff(d, a, b, c, x[i+ 9], 12, -1958414417) 
  c = ff(c, d, a, b, x[i+10], 17, -42063) 
  b = ff(b, c, d, a, x[i+11], 22, -1990404162) 
  a = ff(a, b, c, d, x[i+12], 7 , 1804603682) 
  d = ff(d, a, b, c, x[i+13], 12, -40341101) 
  c = ff(c, d, a, b, x[i+14], 17, -1502002290) 
  b = ff(b, c, d, a, x[i+15], 22, 1236535329) 
  a = gg(a, b, c, d, x[i+ 1], 5 , -165796510) 
  d = gg(d, a, b, c, x[i+ 6], 9 , -1069501632) 
  c = gg(c, d, a, b, x[i+11], 14, 643717713) 
  b = gg(b, c, d, a, x[i+ 0], 20, -373897302) 
  a = gg(a, b, c, d, x[i+ 5], 5 , -701558691) 
  d = gg(d, a, b, c, x[i+10], 9 , 38016083) 
  c = gg(c, d, a, b, x[i+15], 14, -660478335) 
  b = gg(b, c, d, a, x[i+ 4], 20, -405537848) 
  a = gg(a, b, c, d, x[i+ 9], 5 , 568446438) 
  d = gg(d, a, b, c, x[i+14], 9 , -1019803690) 
  c = gg(c, d, a, b, x[i+ 3], 14, -187363961) 
  b = gg(b, c, d, a, x[i+ 8], 20, 1163531501) 
  a = gg(a, b, c, d, x[i+13], 5 , -1444681467) 
  d = gg(d, a, b, c, x[i+ 2], 9 , -51403784) 
  c = gg(c, d, a, b, x[i+ 7], 14, 1735328473) 
  b = gg(b, c, d, a, x[i+12], 20, -1926607734) 
  a = hh(a, b, c, d, x[i+ 5], 4 , -378558) 
  d = hh(d, a, b, c, x[i+ 8], 11, -2022574463) 
  c = hh(c, d, a, b, x[i+11], 16, 1839030562) 
  b = hh(b, c, d, a, x[i+14], 23, -35309556) 
  a = hh(a, b, c, d, x[i+ 1], 4 , -1530992060) 
  d = hh(d, a, b, c, x[i+ 4], 11, 1272893353) 
  c = hh(c, d, a, b, x[i+ 7], 16, -155497632) 
  b = hh(b, c, d, a, x[i+10], 23, -1094730640) 
  a = hh(a, b, c, d, x[i+13], 4 , 681279174) 
  d = hh(d, a, b, c, x[i+ 0], 11, -358537222) 
  c = hh(c, d, a, b, x[i+ 3], 16, -722521979) 
  b = hh(b, c, d, a, x[i+ 6], 23, 76029189) 
  a = hh(a, b, c, d, x[i+ 9], 4 , -640364487) 
  d = hh(d, a, b, c, x[i+12], 11, -421815835) 
  c = hh(c, d, a, b, x[i+15], 16, 530742520) 
  b = hh(b, c, d, a, x[i+ 2], 23, -995338651) 
  a = ii(a, b, c, d, x[i+ 0], 6 , -198630844) 
  d = ii(d, a, b, c, x[i+ 7], 10, 1126891415) 
  c = ii(c, d, a, b, x[i+14], 15, -1416354905) 
  b = ii(b, c, d, a, x[i+ 5], 21, -57434055) 
  a = ii(a, b, c, d, x[i+12], 6 , 1700485571) 
  d = ii(d, a, b, c, x[i+ 3], 10, -1894986606) 
  c = ii(c, d, a, b, x[i+10], 15, -1051523) 
  b = ii(b, c, d, a, x[i+ 1], 21, -2054922799) 
  a = ii(a, b, c, d, x[i+ 8], 6 , 1873313359) 
  d = ii(d, a, b, c, x[i+15], 10, -30611744) 
  c = ii(c, d, a, b, x[i+ 6], 15, -1560198380) 
  b = ii(b, c, d, a, x[i+13], 21, 1309151649) 
  a = ii(a, b, c, d, x[i+ 4], 6 , -145523070) 
  d = ii(d, a, b, c, x[i+11], 10, -1120210379) 
  c = ii(c, d, a, b, x[i+ 2], 15, 718787259) 
  b = ii(b, c, d, a, x[i+ 9], 21, -343485551) 
  a = safe_add(a, olda) 
  b = safe_add(b, oldb) 
  c = safe_add(c, oldc) 
  d = safe_add(d, oldd) 
 } 
 return [a, b, c, d] 
} 
 
/* 
 * Convert an array of little-endian words to a hex string. 
 */ 
function binl2hex(binarray) 
{ 
 var hex_tab = "0123456789abcdef" 
 var str = "" 
 for(var i = 0; i < binarray.length * 4; i++) 
 { 
  str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) + 
      hex_tab.charAt((binarray[i>>2] >> ((i%4)*8)) & 0xF) 
 } 
 return str 
} 
 
/* 
 * Convert an array of little-endian words to a base64 encoded string. 
 */ 
function binl2b64(binarray) 
{ 
 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" 
 var str = "" 
 for(var i = 0; i < binarray.length * 32; i += 6) 
 { 
  str += tab.charAt(((binarray[i>>5] << (i%32)) & 0x3F) | 
           ((binarray[i>>5+1] >> (32-i%32)) & 0x3F)) 
 } 
 return str 
} 
 
/* 
 * Convert an 8-bit character string to a sequence of 16-word blocks, stored 
 * as an array, and append appropriate padding for MD4/5 calculation. 
 * If any of the characters are >255, the high byte is silently ignored. 
 */ 
function str2binl(str) 
{ 
 var nblk = ((str.length + 8) >> 6) + 1 // number of 16-word blocks 
 var 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) & 0xFF) << ((i%4) * 8) 
 blks[i>>2] |= 0x80 << ((i%4) * 8) 
 blks[nblk*16-2] = str.length * 8 
 return blks 
} 
 
/* 
 * Convert a wide-character string to a sequence of 16-word blocks, stored as 
 * an array, and append appropriate padding for MD4/5 calculation. 
 */ 
function strw2binl(str) 
{ 
 var nblk = ((str.length + 4) >> 5) + 1 // number of 16-word blocks 
 var 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>>1] |= str.charCodeAt(i) << ((i%2) * 16) 
 blks[i>>1] |= 0x80 << ((i%2) * 16) 
 blks[nblk*16-2] = str.length * 16 
 return blks 
} 
 
/* 
 * External interface 
 */ 
function hexMD5 (str) { return binl2hex(coreMD5( str2binl(str))) } 
function hexMD5w(str) { return binl2hex(coreMD5(strw2binl(str))) } 
function b64MD5 (str) { return binl2b64(coreMD5( str2binl(str))) } 
function b64MD5w(str) { return binl2b64(coreMD5(strw2binl(str))) } 
/* Backward compatibility */ 
function calcMD5(str) { return binl2hex(coreMD5( str2binl(str))) } 

md5.html頁(yè)面程序如下:

<html>
<head>
<script language='javascript' src='md5.js'></script><!--引入MD5加密-->
<script language="javascript">
<!--
function my_do()
//通過js對(duì)數(shù)據(jù)進(jìn)行加密
 {
 //var URL="http://127.0.0.1/index.jsp?";
 //var dqz_out="";
 var dqz_in=document.my_form1.my_in_1.value;
 document.my_form1.my_out_1.value=hexMD5(dqz_in);
 document.my_form1.my_out_2.value=hexMD5w(dqz_in);
 document.my_form1.my_out_3.value=b64MD5(dqz_in);
 document.my_form1.my_out_4.value=b64MD5w(dqz_in);
 //URL=URL+"in="+dqz_in+"&out="+dqz_out;
 //my_form1.action = URL;
 //window.open(URL,'','');
 //my_form1.submit();
 }
//-->
</script>
</head>
<body>
<form name="my_form1" method="get" action="">
 <p>計(jì)算MD5加密結(jié)果的例子<br>
  請(qǐng)輸入加密內(nèi)容:
   <textarea name="my_in_1" cols="70" rows="10">1234567890</textarea>
  <br>
  點(diǎn)擊右邊的文本框顯示結(jié)果:<br><!--mouseup某個(gè)鼠標(biāo)按鍵被松開,mouseout鼠標(biāo)從某個(gè)元素移開-->
hexMD5()= <input name="my_out_1" type="text" onChange="my_do()" onMouseUp="my_do()" onMouseOut="my_do()" size="50" maxlength="50"><br> 
hexMD5w()=<input name="my_out_2" type="text" onChange="my_do()" onMouseUp="my_do()" onMouseOut="my_do()" size="50" maxlength="50"><br>
b64MD5()= <input name="my_out_3" type="text" onChange="my_do()" onMouseUp="my_do()" onMouseOut="my_do()" size="50" maxlength="50"><br>
b64MD5w()=<input name="my_out_4" type="text" onChange="my_do()" onMouseUp="my_do()" onMouseOut="my_do()" size="50" maxlength="50"><br>
  <br>
 </p>
</form>
</body>
</html>

md5.js加密效果如圖:


下面介紹微信小程序如何加密——模塊化

     我們可以將一些公共的代碼抽離成為一個(gè)單獨(dú)的 js 文件,作為一個(gè)模塊。模塊只有通過 module.exports 或者 exports 才能對(duì)外暴露接口。需要注意的是:

    (1)、 exports 是 module.exports 的一個(gè)引用,因此在模塊里邊隨意更改 exports 的指向會(huì)造成未知的錯(cuò)誤。所以我們更推薦開發(fā)者采用 module.exports 來(lái)暴露模塊接口,除非你已經(jīng)清晰知道這兩者的關(guān)系。

     (2)、小程序目前不支持直接引入 node_modules , 開發(fā)者需要使用到 node_modules 時(shí)候建議拷貝出相關(guān)的代碼到小程序的目錄中。

// common.js 
function sayHello(name) { 
 console.log(`Hello ${name} !`) 
} 
function sayGoodbye(name) { 
 console.log(`Goodbye ${name} !`) 
} 
module.exports.sayHello = sayHello 
exports.sayGoodbye = sayGoodbye 

​在需要使用這些模塊的文件中,使用 require(path) 將公共代碼引入

var common = require('common.js') 
Page({ 
 helloMINA: function() { 
  common.sayHello('MINA') 
 }, 
 goodbyeMINA: function() { 
  common.sayGoodbye('MINA') 
 } 
}) 

 仿照模塊化方法我們可以加入MD5.js加密:

md5.js程序如下:

/* 
 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message 
 * Digest Algorithm, as defined in RFC 1321. 
 * Version 1.1 Copyright (C) Paul Johnston 1999 - 2002. 
 * Code also contributed by Greg Holt 
 * See http://pajhome.org.uk/site/legal.html for details. 
 */ 
 
/* 
 * Add integers, wrapping at 2^32. This uses 16-bit operations internally 
 * to work around bugs in some JS interpreters. 
 */ 
function safe_add(x, y) 
{ 
 var lsw = (x & 0xFFFF) + (y & 0xFFFF) 
 var msw = (x >> 16) + (y >> 16) + (lsw >> 16) 
 return (msw << 16) | (lsw & 0xFFFF) 
} 
 
/* 
 * Bitwise rotate a 32-bit number to the left. 
 */ 
function rol(num, cnt) 
{ 
 return (num << cnt) | (num >>> (32 - cnt)) 
} 
 
/* 
 * These functions implement the four basic operations the algorithm uses. 
 */ 
function cmn(q, a, b, x, s, t) 
{ 
 return safe_add(rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b) 
} 
function ff(a, b, c, d, x, s, t) 
{ 
 return cmn((b & c) | ((~b) & d), a, b, x, s, t) 
} 
function gg(a, b, c, d, x, s, t) 
{ 
 return cmn((b & d) | (c & (~d)), a, b, x, s, t) 
} 
function hh(a, b, c, d, x, s, t) 
{ 
 return cmn(b ^ c ^ d, a, b, x, s, t) 
} 
function ii(a, b, c, d, x, s, t) 
{ 
 return cmn(c ^ (b | (~d)), a, b, x, s, t) 
} 
 
/* 
 * Calculate the MD5 of an array of little-endian words, producing an array 
 * of little-endian words. 
 */ 
function coreMD5(x) 
{ 
 var a = 1732584193 
 var b = -271733879 
 var c = -1732584194 
 var d = 271733878 
 
 for(var i = 0; i < x.length; i += 16) 
 { 
  var olda = a 
  var oldb = b 
  var oldc = c 
  var oldd = d 
 
  a = ff(a, b, c, d, x[i+ 0], 7 , -680876936) 
  d = ff(d, a, b, c, x[i+ 1], 12, -389564586) 
  c = ff(c, d, a, b, x[i+ 2], 17, 606105819) 
  b = ff(b, c, d, a, x[i+ 3], 22, -1044525330) 
  a = ff(a, b, c, d, x[i+ 4], 7 , -176418897) 
  d = ff(d, a, b, c, x[i+ 5], 12, 1200080426) 
  c = ff(c, d, a, b, x[i+ 6], 17, -1473231341) 
  b = ff(b, c, d, a, x[i+ 7], 22, -45705983) 
  a = ff(a, b, c, d, x[i+ 8], 7 , 1770035416) 
  d = ff(d, a, b, c, x[i+ 9], 12, -1958414417) 
  c = ff(c, d, a, b, x[i+10], 17, -42063) 
  b = ff(b, c, d, a, x[i+11], 22, -1990404162) 
  a = ff(a, b, c, d, x[i+12], 7 , 1804603682) 
  d = ff(d, a, b, c, x[i+13], 12, -40341101) 
  c = ff(c, d, a, b, x[i+14], 17, -1502002290) 
  b = ff(b, c, d, a, x[i+15], 22, 1236535329) 
 
  a = gg(a, b, c, d, x[i+ 1], 5 , -165796510) 
  d = gg(d, a, b, c, x[i+ 6], 9 , -1069501632) 
  c = gg(c, d, a, b, x[i+11], 14, 643717713) 
  b = gg(b, c, d, a, x[i+ 0], 20, -373897302) 
  a = gg(a, b, c, d, x[i+ 5], 5 , -701558691) 
  d = gg(d, a, b, c, x[i+10], 9 , 38016083) 
  c = gg(c, d, a, b, x[i+15], 14, -660478335) 
  b = gg(b, c, d, a, x[i+ 4], 20, -405537848) 
  a = gg(a, b, c, d, x[i+ 9], 5 , 568446438) 
  d = gg(d, a, b, c, x[i+14], 9 , -1019803690) 
  c = gg(c, d, a, b, x[i+ 3], 14, -187363961) 
  b = gg(b, c, d, a, x[i+ 8], 20, 1163531501) 
  a = gg(a, b, c, d, x[i+13], 5 , -1444681467) 
  d = gg(d, a, b, c, x[i+ 2], 9 , -51403784) 
  c = gg(c, d, a, b, x[i+ 7], 14, 1735328473) 
  b = gg(b, c, d, a, x[i+12], 20, -1926607734) 
 
  a = hh(a, b, c, d, x[i+ 5], 4 , -378558) 
  d = hh(d, a, b, c, x[i+ 8], 11, -2022574463) 
  c = hh(c, d, a, b, x[i+11], 16, 1839030562) 
  b = hh(b, c, d, a, x[i+14], 23, -35309556) 
  a = hh(a, b, c, d, x[i+ 1], 4 , -1530992060) 
  d = hh(d, a, b, c, x[i+ 4], 11, 1272893353) 
  c = hh(c, d, a, b, x[i+ 7], 16, -155497632) 
  b = hh(b, c, d, a, x[i+10], 23, -1094730640) 
  a = hh(a, b, c, d, x[i+13], 4 , 681279174) 
  d = hh(d, a, b, c, x[i+ 0], 11, -358537222) 
  c = hh(c, d, a, b, x[i+ 3], 16, -722521979) 
  b = hh(b, c, d, a, x[i+ 6], 23, 76029189) 
  a = hh(a, b, c, d, x[i+ 9], 4 , -640364487) 
  d = hh(d, a, b, c, x[i+12], 11, -421815835) 
  c = hh(c, d, a, b, x[i+15], 16, 530742520) 
  b = hh(b, c, d, a, x[i+ 2], 23, -995338651) 
 
  a = ii(a, b, c, d, x[i+ 0], 6 , -198630844) 
  d = ii(d, a, b, c, x[i+ 7], 10, 1126891415) 
  c = ii(c, d, a, b, x[i+14], 15, -1416354905) 
  b = ii(b, c, d, a, x[i+ 5], 21, -57434055) 
  a = ii(a, b, c, d, x[i+12], 6 , 1700485571) 
  d = ii(d, a, b, c, x[i+ 3], 10, -1894986606) 
  c = ii(c, d, a, b, x[i+10], 15, -1051523) 
  b = ii(b, c, d, a, x[i+ 1], 21, -2054922799) 
  a = ii(a, b, c, d, x[i+ 8], 6 , 1873313359) 
  d = ii(d, a, b, c, x[i+15], 10, -30611744) 
  c = ii(c, d, a, b, x[i+ 6], 15, -1560198380) 
  b = ii(b, c, d, a, x[i+13], 21, 1309151649) 
  a = ii(a, b, c, d, x[i+ 4], 6 , -145523070) 
  d = ii(d, a, b, c, x[i+11], 10, -1120210379) 
  c = ii(c, d, a, b, x[i+ 2], 15, 718787259) 
  b = ii(b, c, d, a, x[i+ 9], 21, -343485551) 
 
  a = safe_add(a, olda) 
  b = safe_add(b, oldb) 
  c = safe_add(c, oldc) 
  d = safe_add(d, oldd) 
 } 
 return [a, b, c, d] 
} 
 
/* 
 * Convert an array of little-endian words to a hex string. 
 */ 
function binl2hex(binarray) 
{ 
 var hex_tab = "0123456789abcdef" 
 var str = "" 
 for(var i = 0; i < binarray.length * 4; i++) 
 { 
  str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) + 
      hex_tab.charAt((binarray[i>>2] >> ((i%4)*8)) & 0xF) 
 } 
 return str 
} 
 
/* 
 * Convert an array of little-endian words to a base64 encoded string. 
 */ 
function binl2b64(binarray) 
{ 
 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" 
 var str = "" 
 for(var i = 0; i < binarray.length * 32; i += 6) 
 { 
  str += tab.charAt(((binarray[i>>5] << (i%32)) & 0x3F) | 
           ((binarray[i>>5+1] >> (32-i%32)) & 0x3F)) 
 } 
 return str 
} 
 
/* 
 * Convert an 8-bit character string to a sequence of 16-word blocks, stored 
 * as an array, and append appropriate padding for MD4/5 calculation. 
 * If any of the characters are >255, the high byte is silently ignored. 
 */ 
function str2binl(str) 
{ 
 var nblk = ((str.length + 8) >> 6) + 1 // number of 16-word blocks 
 var 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) & 0xFF) << ((i%4) * 8) 
 blks[i>>2] |= 0x80 << ((i%4) * 8) 
 blks[nblk*16-2] = str.length * 8 
 return blks 
} 
 
/* 
 * Convert a wide-character string to a sequence of 16-word blocks, stored as 
 * an array, and append appropriate padding for MD4/5 calculation. 
 */ 
function strw2binl(str) 
{ 
 var nblk = ((str.length + 4) >> 5) + 1 // number of 16-word blocks 
 var 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>>1] |= str.charCodeAt(i) << ((i%2) * 16) 
 blks[i>>1] |= 0x80 << ((i%2) * 16) 
 blks[nblk*16-2] = str.length * 16 
 return blks 
} 
 
/* 
 * External interface 
 */ 
function hexMD5 (str) { return binl2hex(coreMD5( str2binl(str))) } 
function hexMD5w(str) { return binl2hex(coreMD5(strw2binl(str))) } 
function b64MD5 (str) { return binl2b64(coreMD5( str2binl(str))) } 
function b64MD5w(str) { return binl2b64(coreMD5(strw2binl(str))) } 
/* Backward compatibility */ 
function calcMD5(str) { return binl2hex(coreMD5( str2binl(str))) } 
module.exports = { 
 hexMD5: hexMD5 
} 

使用程序如下:

//index.js 
var util = require('../../utils/md5.js') 
//獲取應(yīng)用實(shí)例 
var app = getApp() 
Page({ 
 data: { 
  page:'1', 
 }, 
  var password=value.password; 
  if(password===""||password===null){ 
    wx.showModal({ 
      title:'提示', 
      content: '密碼不能為空', 
      confirmColor:'#118EDE', 
      showCancel: false, 
      success: function (res) { 
        if (res.confirm) { 
          //console.log('用戶點(diǎn)擊確定') 
        } 
      } 
    }); 
    return false; 
  }else{ 
    password=util.hexMD5(password); 
  } 
}) 

感謝閱讀,希望能幫助到大家,謝謝大家對(duì)本站的支持!

相關(guān)文章

  • 關(guān)于Javascript閉包與應(yīng)用的詳解

    關(guān)于Javascript閉包與應(yīng)用的詳解

    這篇文章主要介紹了關(guān)于Javascript閉包與應(yīng)用的詳解,文中有非常詳細(xì)的代碼示例.對(duì)正在學(xué)習(xí)js的伙伴們有很好的幫助,需要的朋友可以參考下
    2021-04-04
  • 微信小程序(十四)button組件詳細(xì)介紹

    微信小程序(十四)button組件詳細(xì)介紹

    這篇文章主要介紹了 微信小程序button組件詳細(xì)介紹的相關(guān)資料,需要的朋友可以參考下
    2016-09-09
  • 詳解lodash中的cloneDeep使用細(xì)節(jié)

    詳解lodash中的cloneDeep使用細(xì)節(jié)

    這篇文章主要為大家介紹了詳解lodash中的cloneDeep使用細(xì)節(jié),有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進(jìn)步,早日升職加薪
    2023-01-01
  • JavaScript函數(shù)柯里化

    JavaScript函數(shù)柯里化

    這篇文章主要介紹了JavaScript函數(shù)柯里化,柯里化即Currying是把接受多個(gè)參數(shù)的函數(shù)變換成接受一個(gè)單一參數(shù)函數(shù),并且返回接受余下的參數(shù)且返回結(jié)果的新函數(shù)的技術(shù),下面文章詳細(xì)內(nèi)容,需要的朋友可以參考一下
    2021-11-11
  • js簡(jiǎn)單封裝監(jiān)聽快捷鍵對(duì)象示例及使用

    js簡(jiǎn)單封裝監(jiān)聽快捷鍵對(duì)象示例及使用

    這篇文章主要為大家介紹了js簡(jiǎn)單封裝監(jiān)聽快捷鍵對(duì)象及使用示例,有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進(jìn)步,早日升職加薪
    2023-08-08
  • JS的深淺復(fù)制詳細(xì)

    JS的深淺復(fù)制詳細(xì)

    這篇文章主要介紹JS的深淺復(fù)制,之所以會(huì)出現(xiàn)深淺拷貝的問題,實(shí)質(zhì)上是由于JS對(duì)基本類型和引用類型的處理不同。下面感興趣的小伙伴請(qǐng)跟小編一起來(lái)學(xué)習(xí)吧
    2021-10-10
  • 微信小程序 開發(fā)指南詳解

    微信小程序 開發(fā)指南詳解

    這篇文章主要介紹了微信小程序 開發(fā)指南詳解的相關(guān)資料,需要的朋友可以參考下
    2016-09-09
  • JS前端使用canvas動(dòng)態(tài)繪制函數(shù)曲線示例詳解

    JS前端使用canvas動(dòng)態(tài)繪制函數(shù)曲線示例詳解

    這篇文章主要為大家介紹了JS前端使用canvas畫函數(shù)曲線的示例詳解,有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進(jìn)步,早日升職加薪
    2022-08-08
  • 微信小程序 ecshop地址三級(jí)聯(lián)動(dòng)實(shí)現(xiàn)實(shí)例代碼

    微信小程序 ecshop地址三級(jí)聯(lián)動(dòng)實(shí)現(xiàn)實(shí)例代碼

    這篇文章主要介紹了微信小程序 ecshop地址3級(jí)聯(lián)動(dòng)實(shí)現(xiàn)實(shí)例代碼的相關(guān)資料,需要的朋友可以參考下
    2017-02-02
  • 使用async?await處理錯(cuò)誤方法示例

    使用async?await處理錯(cuò)誤方法示例

    這篇文章主要為大家介紹了使用async?await處理錯(cuò)誤的方法示例詳解,有需要的朋友可以借鑒參考下,希望能夠有所幫助,祝大家多多進(jìn)步,早日升職加薪
    2022-07-07

最新評(píng)論