代码运行 Web Log|…不要怀疑你的网速

代码运行

测试HTML代码专页：

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" dir="ltr" lang="zh-CN"> <head profile="http://gmpg.org/xfn/11"> <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /> <title> Web Log</title> <meta name="generator" content="WP 2.5" /> <link rel="stylesheet" href="http://www.fucklenovo.com/wxp/wp-content/themes/fucklenovo/style.css" type="text/css" media="screen" /> <link rel="alternate" type="application/rss+xml" title="Web Log RSS Feed" href="http://www.fucklenovo.com/wxp/feed/" /> <link rel="pingback" href="http://www.fucklenovo.com/wxp/xmlrpc.php" /> <link rel="EditURI" type="application/rsd+xml" title="RSD" href="http://www.fucklenovo.com/wxp/xmlrpc.php?rsd" /> <link rel="wlwmanifest" type="application/wlwmanifest+xml" href="http://www.fucklenovo.com/wxp/wp-includes/wlwmanifest.xml" /> <meta name="keywords" content="CSS, Google, 代码, js, 表单, 标签, 搜索, 正计时, xthml" /> <style type="text/css">.recentcomments a{display:inline !important;padding: 0 !important;margin: 0 !important;}</style> </head> <body> test html<br /> test html<br /> test html<br /> test html<br /> test html<br /> test html<br /> test html<br /> test html<br /> <script src="http://www.google-analytics.com/urchin.js" type="text/javascript"> </script> <script type="text/javascript"> _uacct = "UA-100548-4"; urchinTracker(); </script> test html<br /> test html<br /> test html<br /> test html<br /> </body> </html>

提示：你可以先修改部分代码再运行。

国旗：

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html> <head> <title>Html版国旗</title> <style> *{ margin: 0px; } #con{ width:500px; height:800px; margin:0 auto; padding-top:50px;} #con #cont{ width: 300px; height: 200px; background-color: red; position:absolute; left:350px; } #con #cont .big{ color: Yellow; position: absolute; left: 20px; top: 18px; } #con #cont .sm1{ color: Yellow; position: absolute; left: 85px; top: 8px; filter:progid:DXImageTransform.Microsoft.BasicImage(Rotation=2) } #con #cont .sm2{ color: Yellow; position: absolute; left: 107px; top: 32px; filter:progid:DXImageTransform.Microsoft.BasicImage(Rotation=3) } #con #cont .sm3{ color: Yellow; position: absolute; left: 107px; top: 62px; filter:progid:DXImageTransform.Microsoft.BasicImage(Rotation=1) } #con #cont .sm4{ color: Yellow; position: absolute; left: 85px; top:80px; filter:progid:DXImageTransform.Microsoft.BasicImage(Rotation=2) } #con #cont .gan{ color:#CCCCCC; position:absolute; left:-130px; } </style> </head> <body> <div id="con"> <div id="cont"> <div><span class="big"><font style="font-size:60px;">★</font></span></div> <div><span class="sm1"><font style="font-size:20px;">★</font></span></div> <div><span class="sm2"><font style="font-size:20px;">★</font></span></div> <div><span class="sm3"><font style="font-size:20px;">★</font></span></div> <div><span class="sm4"><font style="font-size:20px;">★</font></span></div> </div> </div> </body> </html>

提示：你可以先修改部分代码再运行。

SHA-1加密：

<html> <head> <script language="JavaScript"> /* * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined in FIPS PUB 180-1 * By lizq * 2006-11-11 */ /* * Configurable variables. */ var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */ var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */ /* * The main function to calculate message digest */ function hex_sha1(s) { return binb2hex(core_sha1(AlignSHA1(s))); } /* * Perform a simple self-test to see if the VM is working */ function sha1_vm_test() { return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d"; } /* * Calculate the SHA-1 of an array of big-endian words, and a bit length */ function core_sha1(blockArray) { var x = blockArray; //append padding var w = Array(80); var a = 1732584193; var b = -271733879; var c = -1732584194; var d = 271733878; var e = -1009589776; for(var i = 0; i < x.length; i += 16) //每次处理512位 16*32 { var olda = a; var oldb = b; var oldc = c; var oldd = d; var olde = e; for(var j = 0; j < 80; j++) //对每个512位进行80步操作 { if(j < 16) w[j] = x[i + j]; else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1); var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), sha1_kt(j))); e = d; d = c; c = rol(b, 30); b = a; a = t; } a = safe_add(a, olda); b = safe_add(b, oldb); c = safe_add(c, oldc); d = safe_add(d, oldd); e = safe_add(e, olde); } return new Array(a, b, c, d, e); } /* * Perform the appropriate triplet combination function for the current iteration * 返回对应F函数的值 */ function sha1_ft(t, b, c, d) { if(t < 20) return (b & c) | ((~b) & d); if(t < 40) return b ^ c ^ d; if(t < 60) return (b & c) | (b & d) | (c & d); return b ^ c ^ d; //t<80 } /* * Determine the appropriate additive constant for the current iteration * 返回对应的Kt值 */ function sha1_kt(t) { return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514; } /* * Add integers, wrapping at 2^32. This uses 16-bit operations internally * to work around bugs in some JS interpreters. * 将32位数拆成高16位和低16位分别进行相加，从而实现 MOD 2^32 的加法 */ 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. * 32位二进制数循环左移 */ function rol(num, cnt) { return (num << cnt) | (num >>> (32 - cnt)); } /* * The standard SHA1 needs the input string to fit into a block * This function align the input string to meet the requirement */ function AlignSHA1(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(i=0;i<str.length;i++) blks[i>>2]|=str.charCodeAt(i)<<(24-(i&3)*8); blks[i>>2]|=0x80<<(24-(i&3)*8); blks[nblk*16-1]=str.length*8; return blks; } /* * Convert an array of big-endian words to a hex string. */ function binb2hex(binarray) { var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) + hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF); } return str; } /* * calculate MessageDigest accord to source message that inputted */ function calcDigest() { var digestM = hex_sha1(document.SHAForm.SourceMessage.value); document.SHAForm.MessageDigest.value = digestM; } </script> <title>SHA-1算法JavaScript实现</title> </head> <body> <center> <BR/> <BR/> <H2>SHA-1算法JavaScript实现</H2> <BR/> <form name="SHAForm"> 　源消息：<input type="text" name="SourceMessage" size=40><BR> 消息摘要：<input type="text" name="MessageDigest" size=40> <P> <input type="button" value="计算消息摘要" onclick="calcDigest()"> </form> </body> </html>

提示：你可以先修改部分代码再运行。

Web Log|…不要怀疑你的网速—本站存放在U·S·A地区

老子是80后的强人，保持着70后的优秀思想，却拥有90后脑残般的头脑，贱踏完00后艰苦奋斗的道路，活在10后这个人贱人爱的中国社会主义社会……

换其它皮肤

使用Chrome浏览本站取得最佳效果

Google搜索

黄金价格

本站信息：

近期文章

近期评论

百度新闻

GOOGLE资讯

代码运行

生存论

分类目录

点击支持：

文章归档