首页
关于
留言
友链
电台
壁纸
我的足迹
推荐
知易而行MCP
Search
1
乐橙CMS影视管理系统最全版本
109,325 阅读
2
VIP视频解析破解电影解析模拟破解影视解析
77,802 阅读
3
乐橙CMS影视管理系统4.0.18版本
16,941 阅读
4
新浪图片链接修复教程集合
15,129 阅读
5
反调试代码调试死机代码禁止F12代码
12,103 阅读
语言
PHP
Java
Go
JavaScript
CSS
Vue
资源教程
网络杂谈
技术文章
影视交流
软件工具
Mac
知易而行
登录
Search
标签搜索
PHP
AI
LINUX
微信
MYSQL
树莓派
OpenClaw
ESP32S3
小智AI
P2P
JS
破解
乐橙cms
支付
uniapp
人工智能
技术趋势
智能玩具
ESP32
DIY
子沐~
累计撰写
128
篇文章
累计收到
372
条评论
首页
栏目
语言
PHP
Java
Go
JavaScript
CSS
Vue
资源教程
网络杂谈
技术文章
影视交流
软件工具
Mac
知易而行
页面
关于
留言
友链
电台
壁纸
我的足迹
推荐
知易而行MCP
搜索到
128
篇与
的结果
2019-03-31
比悲伤更悲伤的故事
-唱片制作人张哲凯(刘以豪 饰)和王牌作词人宋媛媛(陈意涵 饰)相依为命,两人自幼身世坎坷只有彼此为伴,他们是亲人、是朋友,也彷佛是命中注定的另一半。父亲罹患遗传重症而被母亲抛弃的哲凯,深怕自己随时会发病不久人世,始终没有跨出友谊的界线对媛媛展露爱意。眼见哲凯的病情加重,他暗自决定用剩余的生命完成他们之间的终曲,再为媛媛找个可以托付一生的好男人。这时,事业有成温柔体贴的医生(张书豪 饰)适时的出现让他成为照顾媛媛的最佳人选,二人按部就班发展着关系。一切看似都在哲凯的计划下进行。然而,故事远比这里所写更要悲伤......[dplayer url="https://605ziyuan.com/20180428/hp7INOEc/index.m3u8",pic="http://p9.qhimg.com/t01c6f0fb2507ea6b8d.jpg"/]
2019年03月31日
1,775 阅读
0 评论
1 点赞
2019-03-31
Windows VPS一键重装为Linux系统
说明:之前萌咔大佬做的Linux to Windows和Linux to Linux脚本方便了很多人,近期又做出了Windows to Linux脚本,基本上已经全了,这里就分享下。前言有些厂商的机器因策略问题,不支持Windows重装为Linux。例如:腾讯云非大陆区域。有些厂商Windows系统盘会比Linux系统盘大,想要大一点系统盘。例如: AZURE、AWS等。有些厂商不支持VNC,这对于转换系统实在不方便。这篇文章可以解决以上问题。使用下载文件:萌咔来源、本站来源。双击打开此文件。自行选择选项。按回车重启,并等待安装完成。注意事项1、如果对提供安装的发行版不满意,请参考此文章→传送门。默认提供的是Debian8(Jessie),添加了firmware包,提供了更多的驱动支持,DHCP模式一键。非DHCP模式,如果要一键,则需要自己定制镜像。定制Debian系镜像应该没问题,其他未作测试。默认root账户密码Vicer。2、如果厂商不支持VNC,则需要自己定制镜像。定制方法请参考此文章→传送门。主要在镜像中添加机器的网络参数,以便支持一键安装。命令示例:#定制带网络参数的initrd.img bash InstallNET.sh -d 8 -v 64 -a --ip-addr <IP> --ip-mask <NetMask> --ip-gate <GATE> --loader #需要dd安装其他系统(例如 Windows to Windows),定制命令.(网络参数有DHCP的,无需添加.) bash InstallNET.sh -dd <IMAGE_URL.tar> --ip-addr <IP> --ip-mask <NetMask> --ip-gate <GATE> --loader完成后将initrd.img和vmlinuz存放到能直链下载的位置。3、如果厂商支持VNC,则可以直接全部选1。安装的时候,自己填IP地址,子网掩码,网关,DNS服务器。DNS服务器推荐填:8.8.8.8。4、区分是否为DHCP模式非DHCP模式:如上图,显示了详细的IP地址。(选中:使用下面的IP地址)DHCP模式:参考上图。(选中:自动获得IP地址)相关教程Linux VPS纯净版CentOS系统一键安装脚本Linux VPS无限制一键全自动DD安装Windows脚本Linux VPS纯净版Debian/Ubuntu系统一键安装脚本文章来源:https://moeclub.org/2018/10/31/670/
2019年03月31日
1,818 阅读
0 评论
0 点赞
2019-03-31
Bandwagon Host(搬瓦工)利用API自动切换机房脚本
简介搬瓦工大家估计都了解,一家很火的主机商→介绍页面,很多套餐都可以在后台自由切换很多机房,有时候切到很火的机房会提示爆满切不过去,而有的人也不愿守在电脑前不停的手动,这时候就们可以通过API进行自动切换,这里分享个萌咖大佬写的自动切换机房的脚本,很方便。提示最近搬瓦工出了一个特别火的双十一特价CN2套餐,2核/2G内存/40G硬盘/1T流量,配置大概和常规的100美元差不多,现在只需要不到30美元就可以拥有,而且三网CN2线路,能够自由的切换机房,切换IP地址,性价比超高。该套餐优惠码BWH26FXH3HIQ即可享受-6.25%的循环优惠→点击购买,数量有限。使用先登录搬瓦工后台,找到左侧API,记下你的VEID,并点击Show API Key获取你的API Key。说明:任何服务器都可以进行操作,而且请勿滥用API,能够手动切换的请尽量手动。1、下载脚本wget --no-check-certificate -qO BWH.sh 'https://moeclub.org/attachment/LinuxShell/BWH.sh' && chmod a+x BWH.sh脚本备份https://www.moerats.com/usr/shell/BWH.sh2、设置脚本veid='1234560'; #VEID api_key='private_xxxxxxxxxxxxxxxxx'; #API KEY ToLocation='USCA_2'; #目标机房代码,切换机房的时候,机房后面括号里就是代码,默认DC2 Timeout='150'; #API频率有限制,单位秒,每150秒运行一次。(不建议过低,否则面板报错)3、运行脚本前台运行bash BWH.sh后台运行nohup bash BWH.sh >/dev/null 2>&1 &然后差不多很快我们就可以收到切换成功的邮件了。脚本来源:萌咖博客
2019年03月31日
2,100 阅读
1 评论
0 点赞
2019-03-31
Linux VPS定时备份服务器/网站数据到Github私人仓库
说明:现在Github被微软收购后,私人仓库已经开始免费了,只能说微软很良心。然后就可以拿来折腾下了,让其充分发挥下作用,这里我们可以用来备份下网站或者服务器一些数据,方法就大概说下。教程首先你肯定需要一个Github账号,没有的可以去注册一个,地址:https://github.com。有了账号就继续看。1、配置Git SSH密钥由于本地Git仓库和GitHub仓库之间的传输是通过SSH加密的,所以必须要让github仓库认证你SSH key,在操作之前,需要先在服务器上生成SSH key。我们先去根目录下使用命令:cd ~ssh-keygen -t rsa这里会要你命名密匙名称(这里建议使用默认名称),然后连续按几次Enter,这时候会在/root/.ssh文件夹生成2个ssh密钥,然后我们查看公钥id_rsa.pub。cat ~/.ssh/id_rsa.pub查看后,再复制下公钥,然后打开Github官网,进入https://github.com/settings/ssh/new,Title随便填,然后Key填入刚刚复制的密匙,最后点击Add SSH Key添加即可。请输入图片描述2、建立私人仓库我们需要先访问https://github.com/new,新建一个仓库用来存放备份文件,名称自己随意,记得下面一定要勾选Private,也就是私人仓库。不然你辛辛苦苦备份的小姐姐就要被别人偷走了。请输入图片描述3、配置本地仓库由于博主是用来备份网站,所以需要备份文件夹为/home/www.moerats.com,也就是把该文件夹定为本地仓库,使用命令:进入需要备份的文件夹cd /home/www.moerats.com初始化你的github仓库git init关联到远程github仓库git remote add origin git@github.com:iiiiiii1/MOERATS.git关联仓库的时候,后面可以用HTTPS链接也可以用SSH,这里强烈建议选择SSH,安全性很高。请输入图片描述4、初次备份进入备份的文件夹cd /home/www.moerats.com把目录下所有文件更改状况提交到暂存区,包括增,删,改。git add -A提交更改的说明,说明随意了,这里为backsitegit commit -m "backsite"开始推送到Githubgit push -u origin master推送的时候可能会提示The authenticity of host 'github.com' can't be established.信息,直进yes即可。然后可以看到仓库的备份文件了。请输入图片描述5、设置定时备份在根目录先新建一个bash脚本:nano ~/gitback.sh代码如下:!/bin/bash进入到网站根目录,记得修改为自己的站点cd /home/xxx.com将数据库导入到该目录,这里以mysql为例,passwd为数据库密码,typecho为数据库名称,typecho.sql为备份的数据库文件mysqldump -uroot -ppasswd typecho > typecho.sqlgit add -Agit commit -m "backsite"git push -u origin master然后编辑好了后,使用ctrl+x,y保存退出。再测试下脚本,使用命令:bash ~/gitback.sh脚本没问题的话,再设置为每天05:15执行一次:并将运行日志输出到根目录的siteback.log文件echo "15 05 * bash ~/gitback.sh > ~/siteback.log 2>&1 &" > bt.croncrontab bt.cronrm -rf bt.cron最后使用crontab -l命令查看添加成功没。成功的话,就基本上算完成了。推送失败如果你将本地文件夹推送到Github失败的话,常见原因有2种,具体如下。1、邮件问题报错提示:Your push would publish a private email address.这里可能是你将你的邮件地址私密了,解决方法如下:方法一,如果你想一直保持私密,可以选择方法二访问https://github.com/settings/emails,将Keep my email address private的勾去掉。方法二1、访问https://github.com/settings/emails,将Block command line pushes that expose my email的勾去掉。2、设置你的github邮箱,修改成自己的再运行命令:git config --global user.email "admin@moerats.com"2、密匙问题报错提示:Permission denied (publickey).大概的原因就是,你设置密匙的时候改成了其它名称,而ssh默认只读取id_rsa,所以会显示没权限。解决方法如下:方法一进入根目录的.ssh文件夹,将你的github密匙文件,重新更名为id_rsa。方法二将github密匙添加到ssh agent,比如密匙名称为github,使用命令:ssh-agent bashssh-add ~/.ssh/github总结使用该方法备份网站是个不错的选择,不过别用来备份大文件东西,比如电影什么的,听说有限制,具体多少暂时还没测试。
2019年03月31日
1,623 阅读
0 评论
0 点赞
2019-03-31
流浪地球 (2019)
导演: 郭帆编剧: 龚格尔 / 严东旭 / 郭帆 / 叶俊策 / 杨治学 / 吴荑 / 叶濡畅 / 沈晶晶 / 刘慈欣主演: 屈楚萧 / 吴京 / 李光洁 / 吴孟达 / 赵今麦 / 更多...类型: 科幻 / 灾难制片国家/地区: 中国大陆语言: 汉语普通话 / 英语 / 俄语 / 法语 / 日语 / 韩语 / 印尼语上映日期: 2019-02-05(中国大陆)片长: 125分钟又名: The Wandering EarthIMDb链接: tt7605074**流浪地球的剧情简介 · · · · · · 近未来,科学家们发现太阳急速衰老膨胀,短时间内包括地球在内的整个太阳系都将被太阳所吞没。为了自救,人类提出一个名为“流浪地球”的大胆计划,即倾全球之力在地球表面建造上万座发动机和转向发动机,推动地球离开太阳系,用2500年的时间奔往另外一个栖息之地。中国航天员刘培强(吴京 饰)在儿子刘启四岁那年前往国际空间站,和国际同侪肩负起领航者的重任。转眼刘启(屈楚萧 饰)长大,他带着妹妹朵朵(赵今麦 饰)偷偷跑到地表,偷开外公韩子昂(吴孟达 饰)的运输车,结果不仅遭到逮捕,还遭遇了全球发动机停摆的事件。为了修好发动机,阻止地球坠入木星,全球开始展开饱和式营救,连刘启他们的车也被强征加入。在与时间赛跑的过程中,无数的人前仆后继,奋不顾身,只为延续百代子孙生存的希望…… 本片根据刘慈欣的同名小说改编。** ©豆瓣[dplayer url="http://csdnm.cn/?url=https://zk.wb699.com/2019/02/07/ar7U7LW69WOfokCb/playlist.m3u8" pic="http://p9.qhimg.com/t01c6f0fb2507ea6b8d.jpg"/]
2019年03月31日
1,655 阅读
0 评论
0 点赞
2019-03-31
页面鼠标点击之处出现美丽小心心
山也不说了直接上代码 (function(window,document,undefined){ var hearts = []; window.requestAnimationFrame = (function(){ return window.requestAnimationFrame || window.webkitRequestAnimationFrame || window.mozRequestAnimationFrame || window.oRequestAnimationFrame || window.msRequestAnimationFrame || function (callback){ setTimeout(callback,1000/60); } })(); init(); function init(){ css(".heart{width: 10px;height: 10px;position: fixed;background: #f00;transform: rotate(45deg);-webkit-transform: rotate(45deg);-moz-transform: rotate(45deg);}.heart:after,.heart:before{content: '';width: inherit;height: inherit;background: inherit;border-radius: 50%;-webkit-border-radius: 50%;-moz-border-radius: 50%;position: absolute;}.heart:after{top: -5px;}.heart:before{left: -5px;}"); attachEvent(); gameloop(); } function gameloop(){ for(var i=0;i<hearts.length;i++){ if(hearts[i].alpha <=0){ document.body.removeChild(hearts[i].el); hearts.splice(i,1); continue; } hearts[i].y--; hearts[i].scale += 0.004; hearts[i].alpha -= 0.013; hearts[i].el.style.cssText = "left:"+hearts[i].x+"px;top:"+hearts[i].y+"px;opacity:"+hearts[i].alpha+";transform:scale("+hearts[i].scale+","+hearts[i].scale+") rotate(45deg);background:"+hearts[i].color; } requestAnimationFrame(gameloop); } function attachEvent(){ var old = typeof window.onclick==="function" && window.onclick; window.onclick = function(event){ old && old(); createHeart(event); } } function createHeart(event){ var d = document.createElement("div"); d.className = "heart"; hearts.push({ el : d, x : event.clientX - 5, y : event.clientY - 5, scale : 1, alpha : 1, color : randomColor() }); document.body.appendChild(d); } function css(css){ var style = document.createElement("style"); style.type="text/css"; try{ style.appendChild(document.createTextNode(css)); }catch(ex){ style.styleSheet.cssText = css; } document.getElementsByTagName('head')[0].appendChild(style); } function randomColor(){ return "rgb("+(~~(Math.random()*255))+","+(~~(Math.random()*255))+","+(~~(Math.random()*255))+")"; } })(window,document);
2019年03月31日
2,233 阅读
0 评论
0 点赞
2019-03-31
Linux网络优化加速一键脚本
在之前的文章里我说过:对于出口带宽,我们常常采用BBR,锐速等TCP加速软件来争夺带宽提高自己的速度。但是原版的BBR并没有太多侵略性,在这个人人都用TCP加速的大环境下,BBR的加速功效就略显不足了。loc的大佬专门改进了下这个BBR,使BBR具有了侵略性。最近我也连续购买了几个服务器,每次都手动搭建,感觉到十分麻烦,干脆写个脚本吧。由于是第一次接触shell脚本这一方面的内容,写起来感觉十分吃力,且与一般的高级语言语法差别有些大。所有有些不足的地方欢迎在下方评论反馈。同时也加入了锐速一键换内核,锐速一键安装,自动根据vps情况优化锐速参数,一键优化内核参数。也可以在锐速,BBR,BBR魔改版中自由切换。 wget -N --no-check-certificate "https://raw.githubusercontent.com/chiakge/Linux-NetSpeed/master/tcp.sh" chmod +x tcp.sh ./tcp.sh脚本说明[scode type="green"]支持系统Centos 6+ / Debian 7+ / Ubuntu 14+BBR魔改版不支持Debian 8[/scode]如果在删除内核环节出现这样一张图注意选择NO根据自己需求操作,重启后再使用./tcp.sh命令接着操作脚本会自动检测安装的情况,请注意脚本菜单下的状态检测即可。
2019年03月31日
2,380 阅读
0 评论
0 点赞
2019-03-31
[腾讯版] -Tencent Ckey v8.1 JavaScript
var ckey = function() { function a(a) { return b.call(this, ia + 2097 + 8214 - 15822, a) } function b(c) { for (var d = "", e = -8432 + ka + 12979; e < "ऊ".length; e++) d += String.fromCharCode(la + ma + na - 50 ^ "ऊ".charCodeAt(e)); for (var f = "", g = 0; g < "ޭ".length; g++) f += String.fromCharCode(I + 3326 + 4681 ^ "ޭ".charCodeAt(g)); for (var k = "", l = 0; l < "Ҡ".length; l++) k += String.fromCharCode(oa + Q + m + 8449 ^ "Ҡ".charCodeAt(l)); for (var n = "", p = 0; p < "ഇ".length; p++) n += String.fromCharCode(G + -5316 + 8904 ^ "ഇ".charCodeAt(p)); for (var r = "", A = pa + 3628 + qa - 16465; A < "".length; A++) r += String.fromCharCode(146 + na + -1434 - 5788 ^ "".charCodeAt(A)); for (var C = "", D = -1434 + ra + 11308; D < "ࢨ".length; D++) C += String.fromCharCode(2260 ^ "ࢨ".charCodeAt(D)); for (var N = "", O = 0; O < "ଶ".length; O++) N += String.fromCharCode(2890 ^ "ଶ".charCodeAt(O)); for (var P = "", T = sa + 6246; T < "ƨƢǶƦǶƧǵDZƧƤ".length; T++) P += String.fromCharCode(-5316 + da + ta + 358 ^ "ƨƢǶƦǶƧǵDZƧƤ".charCodeAt(T)); for (var U = "", V = ua + 146 + 4448 - 6833; V < "".length; V++) U += String.fromCharCode(2564 ^ "".charCodeAt(V)); for (var W = "", ia = va + 4448 + 4019; ia < "ࡌ".length; ia++) W += String.fromCharCode(2096 ^ "ࡌ".charCodeAt(ia)); for (var gb = "", hb = wa + -3155 + -9555 + 13665; hb < "ٶ".length; hb++) gb += String.fromCharCode(E + -3155 + 6442 ^ "ٶ".charCodeAt(hb)); for (var ib = "", jb = xa + 2579; jb < "ઈ".length; jb++) ib += String.fromCharCode(K + 9851 - 9876 ^ "ઈ".charCodeAt(jb)); for (var kb = "", lb = 0; lb < "ȧ".length; lb++) kb += String.fromCharCode(da + 4223 ^ "ȧ".charCodeAt(lb)); for (var mb = "", nb = 0; nb < "о".length; nb++) mb += String.fromCharCode(ya + E + 9851 - 4347 ^ "о".charCodeAt(nb)); for (var ob = "", pb = 0; pb < "ߡ".length; pb++) ob += String.fromCharCode(za + S + fa - 4523 ^ "ߡ".charCodeAt(pb)); for (var qb = "", rb = -215 + L + F + 6127; rb < "̅".length; rb++) qb += String.fromCharCode(889 ^ "̅".charCodeAt(rb)); for (var sb = "", tb = Aa + -6842 + 7201; tb < "".length; tb++) sb += String.fromCharCode(z + Ba + 3363 ^ "".charCodeAt(tb)); for (var ub = "", vb = ba + Ca + Da - 4446; vb < "".length; vb++) ub += String.fromCharCode(aa + y + 4989 ^ "".charCodeAt(vb)); for (var wb = "", xb = -7878 + $ + y + 16828; xb < "".length; xb++) wb += String.fromCharCode(3628 + Ea + 2321 ^ "".charCodeAt(xb)); for (var yb = "", zb = Fa + Ga + Ha - 10082; zb < "´¹²¯".length; zb++) yb += String.fromCharCode(Ia + 5817 - 5364 ^ "´¹²¯".charCodeAt(zb)); for (var Ab = "", Bb = Z + u + -1665 - 4436; Bb < "ۘە۞ۃ".length; Bb++) Ab += String.fromCharCode(Ja + 146 + -4109 + 529 ^ "ۘە۞ۃ".charCodeAt(Bb)); for (var Cb = "", Db = Ka + 9456 - 19159; Db < "٨٩٨٣".length; Db++) Cb += String.fromCharCode(1542 ^ "٨٩٨٣".charCodeAt(Db)); for (var Eb = "", Fb = ea + ha + X + 3846; Fb < "ÁÌ".length; Fb++) Eb += String.fromCharCode(168 ^ "ÁÌ".charCodeAt(Fb)); for (var Gb = "", Hb = ga + 7940; Hb < "ۆۋ۔".length; Hb++) Gb += String.fromCharCode(1698 ^ "ۆۋ۔".charCodeAt(Hb)); for (var Ib = "", Jb = 0, Kb = "ଶଋଈଶ"; Jb < Kb.length; Jb++) Ib += String.fromCharCode(9964 + La + -1265 - 7812 ^ Kb.charCodeAt(Jb)); for (var Lb = "", Mb = 0; Mb < "יׇ׀ׁי".length; Mb++) Lb += String.fromCharCode(1454 ^ "יׇ׀ׁי".charCodeAt(Mb)); switch (c) { case 0: var Nb = []; window[Lb] === window ? Nb.push(o + M + Ma - 12906) : Nb.push(Na + 5538); try { var Ob = Ib + Math.floor(1e7 * Math.random()), Pb = document.createElement(Gb); Pb.setAttribute(Eb, Ob), Pb.style.La = Cb, (document.body || document.getElementsByTagName(Ab)[0]).appendChild(Pb), document.getElementById(Ob) ? Nb.push(0) : Nb.push(1), (document.body || document.getElementsByTagName(yb)[Oa + h + Pa - 8151]).removeChild(Pb) } catch (Qb) { Nb.push(-1361 + Qa + 1879) } return Nb.join(wb); case 1: var Rb = arguments[x + 5347], Sb = new fb.a.f.init([1332468387, -1641050960, Ra + R + 2136881301, -1629555948], ya + 2689), Tb = new fb.a.f.init([Sa + w + 22041281, Y + Ta + 1457907509, 776125350, -(-7878 + _ + -5975 + 1942018983)], Ua + 4647); return fb.Ga.$(Rb, Sb, { ra: Tb, ba: fb.ba.la, qa: fb.na.ma }).xa.toString().toUpperCase(); case Va + Wa - 5967: return (_b = arguments[Xa + -1708 + Ya + 5932]) ? _b.length > 8011 + H - 16329 ? _b.substr(6968 + Za - 7677, 48) : _b : ub; case 3: var Ub = window.document.URL, Vb = window.navigator.userAgent.toLowerCase(), Wb = sb; window.document.referrer.length > -11220 + $a + 18473 && (Wb = window.document.referrer); try { Wb.length == _a - 8815 && opener.location.href.length > 0 && (Wb = opener.location.href) } catch (Xb) {} var Yb = window.navigator.appCodeName, Zb = window.navigator.appName, $b = window.navigator.platform; return Ub = a(Ub), Wb = a(Wb), Ub + qb + (Vb = a(Vb)) + ob + Wb + mb + Yb + kb + Zb + ib + $b; case ab + J + ca - 11490: var _b = arguments[1], ac = bb + -1434 - 689; if (_b.length == s + ca + cb - 13491) return ac; for (i = db + 1003 + 4059 - 782; i < _b.length; i++) char = _b.charCodeAt(i), ac = (ac << 8276 + j - 10445) - ac + char, ac &= ac; return ac; case eb + 8945: var bc = gb + arguments[B + i + 8787] + W + arguments[2] + U + P + N + arguments[3] + C + arguments[t + z + q - 3244] + r + arguments[y + Na + -1658 + 11280] + n + function() { return b.call(this, ja - 5974) }() + k + function() { return b.call(this, 0) }() + f; return function(a) { return b.call(this, 1, a) }(d + (ac = function(a) { return b.call(this, v + 1735, a) }(bc)) + bc) } } var c, d, e, f, g, h = 1836, i = -8290, j = 2174, k = -957, l = -2285, m = 3198, n = -9220, o = 5906, p = 8126, q = -3571, r = -213, s = 2249, t = -693, u = -327, v = -1731, w = 1765, x = -5346, y = -4080, z = 7512, A = 4359, B = -496, C = -4191, D = 2007, E = -1741, F = 700, G = -137, H = 8366, I = -6006, J = 9095, K = 2829, L = -6612, M = 2907, N = -450, O = -4002, P = 9852, Q = -3683, R = 8972, S = 5031, T = -1124, U = 847, V = -2667, W = -1169, X = 3738, Y = 4510, Z = 6428, $ = -4870, _ = -5763, aa = -132, ba = 9425, ca = 9587, da = -3620, ea = -955, fa = 9508, ga = -7940, ha = -6629, ia = 5513, ja = 5977, ka = -4547, la = -3840, ma = -2175, na = 8487, oa = -6720, pa = 6747, qa = 6090, ra = -9874, sa = -6246, ta = 9031, ua = 2239, va = -8467, wa = -955, xa = -2579, ya = -2673, za = -8067, Aa = -359, Ba = -7307, Ca = 291, Da = -5270, Ea = -3336, Fa = -1623, Ga = 7936, Ha = 3769, Ia = -239, Ja = 5156, Ka = 9703, La = 2034, Ma = 4093, Na = -5537, Oa = -657, Pa = 6972, Qa = -517, Ra = 5772, Sa = -3763, Ta = 8444, Ua = -4631, Va = -1401, Wa = 7370, Xa = -1755, Ya = -2468, Za = 709, $a = -7253, _a = 8815, ab = -7188, bb = 2123, cb = 1655, db = -4280, eb = -8940, fb = fb || function(a, b) { var c = {}, d = c.a = {}, e = function() {}, f = d.b = { c: function(a) { for (var b = "", c = 0; c < "ॅूॅक़".length; c++) b += String.fromCharCode(h + 9807 - 9295 ^ "ॅूॅक़".charCodeAt(c)); e.prototype = this; var d = new e; return a && d.d(a), d.hasOwnProperty(b) || (d.init = function() { d.$super.init.apply(this, arguments) }), d.init.prototype = d, d.$super = this, d }, create: function() { var a = this.c(); return a.init.apply(a, arguments), a }, init: function() {}, d: function(a) { for (var b = "", c = 0; c < ";͙ͥ;ͣͤͭ".length; c++) b += String.fromCharCode(778 ^ ";͙ͥ;ͣͤͭ".charCodeAt(c)); for (var d in a) a.hasOwnProperty(d) && (this[d] = a[d]); a.hasOwnProperty(b) && (this.toString = a.toString) }, e: function() { return this.init.prototype.c(this) } }, g = d.f = f.c({ init: function(a, b) { a = this.g = a || [], this.h = void 0 != b ? b : (-2630 + i + 10924) * a.length }, toString: function(a) { return (a || q).i(this) }, concat: function(a) { var b = this.g, c = a.g, d = this.h; if (a = a.h, this.j(), d % (j + -269 + -4213 + 2312)) for (var e = 0; e < a; e++) b[d + e >>> 2] |= (c[e >>> 2] >>> 24 - e % 4 * 8 & 255) << 24 - (d + e) % (-9975 + j + -4490 + 12295) * 8; else if (65535 < c.length) for (e = 0; e < a; e += 4) b[d + e >>> 2] = c[e >>> k + 959]; else b.push.apply(b, c); return this.h += a, this }, j: function() { var b = this.g, c = this.h; b[c >>> 8517 + h + -2630 - 7721] &= h + 8309 + -4849 + 4294961999 << 32 - (h + -8270 + 6442) * (c % 4), b.length = a.ceil(c / 4) }, e: function() { var a = f.e.call(this); return a.g = this.g.slice(0), a }, random: function(b) { for (var c = [], d = 0; d < b; d += 4) c.push(4294967296 * a.random() | -8555 + l + 376 + 10464); return new g.init(c, b) } }), p = c.k = {}, q = p.l = { i: function(a) { for (var b = "", c = 0; c < "".length; c++) b += String.fromCharCode(368 ^ "".charCodeAt(c)); var d = a.g; a = a.h; for (var e = [], f = 0; f < a; f++) { var g = d[f >>> 2] >>> 24 - f % (m + 5624 - 8818) * 8 & 255; e.push((g >>> 4).toString(16)), e.push((15 & g).toString(16)) } return e.join(b) }, parse: function(a) { for (var b = a.length, c = [], d = 0; d < b; d += 2) c[d >>> n + 9223] |= parseInt(a.substr(d, 2), 16) << 24 - d % 8 * 4; return new g.init(c, b / 2) } }, r = p.m = { i: function(a) { for (var b = "", c = 0; c < "".length; c++) b += String.fromCharCode(2238 ^ "".charCodeAt(c)); var d = a.g; a = a.h; for (var e = [], f = 0; f < a; f++) e.push(String.fromCharCode(d[f >>> 2] >>> 8383 + k - 7402 - f % 4 * 8 & 255)); return e.join(b) }, parse: function(a) { for (var b = a.length, c = [], d = o - 5906; d < b; d++) c[d >>> 2] |= (255 & a.charCodeAt(d)) << 24 - d % 4 * 8; return new g.init(c, b) } }, s = p.n = { i: function(a) { for (var b = "", c = 0, d = "ØôùóúçøðñµÀÁÓ¸µñôáô"; c < d.length; c++) b += String.fromCharCode(149 ^ d.charCodeAt(c)); try { return decodeURIComponent(escape(r.i(a))) } catch (e) { throw Error(b) } }, parse: function(a) { return r.parse(unescape(encodeURIComponent(a))) } }, t = d.o = f.c({ p: function() { this.q = new g.init, this.r = h - 1836 }, s: function(a) { for (var b = "", c = 0; c < "ྦྷྠྦྺླ".length; c++) b += String.fromCharCode(4052 ^ "ྦྷྠྦྺླ".charCodeAt(c)); b == typeof a && (a = s.parse(a)), this.q.concat(a), this.r += a.h }, t: function(b) { var c = this.q, d = c.g, e = c.h, f = this.u, h = e / (4 * f); if (b = (h = b ? a.ceil(h) : a.max((0 | h) - this.v, 0)) * f, e = a.min(4 * b, e), b) { for (var i = 0; i < b; i += f) this.w(d, i); i = d.splice(0, b), c.h -= e } return new g.init(i, e) }, e: function() { var a = f.e.call(this); return a.q = this.q.e(), a }, v: 0 }); d.x = t.c({ y: f.c(), init: function(a) { this.y = this.y.c(a), this.p() }, p: function() { t.p.call(this), this.z() }, A: function(a) { return this.s(a), this.t(), this }, B: function(a) { return a && this.s(a), this.C() }, u: 16, D: function(a) { return function(b, c) { return new a.init(c).B(b) } }, F: function(a) { return function(b, c) { return new u.HMAC.init(a, c).B(b) } } }); var u = c.G = {}; return c }(Math); return function() { for (var a = "", b = 0, c = " ±²³´µ¶·¸¹º»¼½¾¿ ¡¢£¤¥¦§¨©ªàáâãäåæçèéûÿí"; b < c.length; b++) a += String.fromCharCode(208 ^ c.charCodeAt(b)); var d = fb, e = d.a.f; d.k.H = { i: function(a) { for (var b = "", c = 0; c < "".length; c++) b += String.fromCharCode(4077 ^ "".charCodeAt(c)); var d = a.g, e = a.h, f = this.I; a.j(), a = []; for (var g = 0; g < e; g += 3) for (var h = (d[g >>> 2] >>> 24 - g % 4 * 8 & 255) << p + -9200 + 1090 | (d[g + (l + 7275 - 4989) >>> 2] >>> 24 - (g + 1) % 4 * 8 & 255) << 8 | d[g + 2 >>> 2] >>> q + 3595 - (g + 2) % 4 * 8 & 255, i = 0; 4 > i && g + .75 * i < e; i++) a.push(f.charAt(h >>> 6 * (3 - i) & 63)); if (d = f.charAt(64)) for (; a.length % 4;) a.push(d); return a.join(b) }, parse: function(a) { var b = a.length, c = this.I; (d = c.charAt(64)) && -1 != (d = a.indexOf(d)) && (b = d); for (var d = [], f = 0, g = 0; g < b; g++) if (g % 4) { var h = c.indexOf(a.charAt(g - 1)) << g % (r + 1860 + 5724 - 7367) * 2, i = c.indexOf(a.charAt(g)) >>> 6 - g % 4 * 2; d[f >>> p + -6116 + 4162 - 6170] |= (h | i) << 24 - f % 4 * 8, f++ } return e.create(d, f) }, I: a } }(), function(a) { function b(a, b, c, d, e, h, i) { return f.call(this, 2727 + g + 2727 - 7318, a, b, c, d, e, h, i) } function c(a, b, c, d, e, h, i) { return f.call(this, g + -3418 + 1555, a, b, c, d, e, h, i) } function d(a, b, c, d, e, h, j) { return f.call(this, g + i + -406 + 4647, a, b, c, d, e, h, j) } function e(a, b, c, d, e, g, h) { return f.call(this, k + 1320 + 1320 - 1680, a, b, c, d, e, g, h) } function f(a) { switch (a) { case 0: var b = arguments[1], c = arguments[ea + 7592 + 7592 - 20100], d = arguments[ga + ha - 7012], e = arguments[fa + ia + 1567], f = arguments[-1789 + ja - 503], g = arguments[ka + la + l + 20776]; return ((b = b + (c & d | ~c & e) + f + arguments[7]) << g | b >>> 32 - g) + c; case ma + Y + 11708: return b = arguments[na + 7051], c = arguments[A + 4673 + P - 18882], d = arguments[ca + J + n - 6198], e = arguments[Q + R + S - 10316], f = arguments[T + C + Z + 12875], g = arguments[6], ((b = b + (c & e | d & ~e) + f + arguments[7]) << g | b >>> -9475 + oa + J + 1645 - g) + c; case $ + 460: return b = arguments[D + v - 275], c = arguments[O + U + 3157], d = arguments[pa + -6801 + 14678], e = arguments[ca + _ - 7393], f = arguments[ba + qa + 36 - 3310], g = arguments[p + K - 10949], ((b = b + (c ^ d ^ e) + f + arguments[7]) << g | b >>> 32 - g) + c; case ra + sa + V + 2160: return b = arguments[1], c = arguments[7592 + W + 4673 - 11094], d = arguments[D + aa - 2931], e = arguments[5298 + N + -4862 + 18], f = arguments[ta - 4630], g = arguments[K + -6978 + 4155], ((b = b + (d ^ (c | ~e)) + f + arguments[r + 220]) << g | b >>> -8328 + da + -2734 + 15298 - g) + c } } for (var g = 1864, i = -6103, X = -5750, Y = -5616, Z = -7555, $ = -458, _ = 1071, aa = 927, ba = -2568, ca = 6326, da = -4204, ea = 4918, fa = 7574, ga = 6160, ha = 855, ia = -9137, ja = 2297, ka = -9619, la = -8866, ma = -6091, na = -7050, oa = -1233, pa = -7874, qa = 5847, ra = 5062, sa = -4552, ta = 4635, ua = fb, va = (xa = ua.a).f, wa = xa.x, xa = ua.G, ya = [], za = g - 1864; - 12185 + l + 14534 > za; za++) ya[za] = (i + -7357 + X + 4294986506) * a.abs(a.sin(za + (-7343 + l + X + 15379))) | 0; xa = xa.J = wa.c({ z: function() { this.K = new va.init([1732584193, 4023233417, 2562383102, 9348 + q + 7556 + 271720545]) }, w: function(a, f) { for (var l = 4921 + i + 1182; 16 > l; l++) { var n = a[P = f + l]; a[P] = 16711935 & (n << 5017 + g + 4620 - 11493 | n >>> Y + 5640) | 4278255360 & (n << 24 | n >>> 8) } l = this.K.g; var q, O, P = a[f + 0], Q = (n = a[f + 1], a[f + (s - 2247)]), R = a[f + 3], S = a[f + 4], T = a[f + 5], U = a[f + (Y + s + 5624 - 2251)], V = a[f + 7], W = a[f + 8], ea = a[f + 9], fa = a[f + 10], ga = a[f + 11], ha = a[f + 12], ia = a[f + (i + j + 3942)], ja = a[f + 14], ka = a[f + (14808 + i - 8690)], la = l[-1465 + h - 371], ma = e(ma = e(ma = e(ma = e(ma = d(ma = d(ma = d(ma = d(ma = c(ma = c(ma = c(ma = c(ma = b(ma = b(ma = b(ma = b(ma = l[1], O = b(O = l[2], q = b(q = l[3], la = b(la, ma, O, q, P, 7, ya[-2964 + p - 5162]), ma, O, n, 12, ya[1]), la, ma, Q, 5903 + Y - 270, ya[2]), q, la, R, 22, ya[3]), O = b(O, q = b(q, la = b(la, ma, O, q, S, 7, ya[4]), ma, O, T, 12, ya[5]), la, ma, U, 17, ya[6]), q, la, V, 22, ya[7]), O = b(O, q = b(q, la = b(la, ma, O, q, W, 7, ya[8]), ma, O, ea, 12, ya[9]), la, ma, fa, 4264 + Y + 1369, ya[-3423 + t + 4126]), q, la, ga, 22, ya[11]), O = b(O, q = b(q, la = b(la, ma, O, q, ha, o - 5899, ya[12]), ma, O, ia, 12, ya[t + -2344 + 3050]), la, ma, ja, 17, ya[1227 + Z + 6342]), q, la, ka, -8569 + r + 8804, ya[$ + -1821 + 806 + 1488]), O = c(O, q = c(q, la = c(la, ma, O, q, n, i + -1310 + Y + 13034, ya[16]), ma, O, U, 9, ya[g + u + -7697 + 6177]), la, ma, ga, v + -5305 + 7539 - 489, ya[18]), q, la, P, w + -571 + 6443 - 7617, ya[19]), O = c(O, q = c(q, la = c(la, ma, O, q, T, 5, ya[_ - 1051]), ma, O, fa, 9, ya[21]), la, ma, ka, 14, ya[x + X + -8178 + 19296]), q, la, S, 20, ya[-11385 + y + 15488]), O = c(O, q = c(q, la = c(la, ma, O, q, ea, 5, ya[24]), ma, O, ja, 9, ya[25]), la, ma, R, -912 + z + A - 10945, ya[aa - 901]), q, la, W, 12598 + ba - 10010, ya[27]), O = c(O, q = c(q, la = c(la, ma, O, q, ia, 5, ya[-4202 + ca - 2096]), ma, O, Q, 9, ya[29]), la, ma, V, B + Y + ca - 200, ya[30]), q, la, ha, ba + 9955 - 7367, ya[7539 + p + 42 - 15676]), O = d(O, q = d(q, la = d(la, ma, O, q, T, 4, ya[32]), ma, O, W, g - 1853, ya[33]), la, ma, ga, B + 9362 - 8850, ya[34]), q, la, ja, t + 716, ya[35]), O = d(O, q = d(q, la = d(la, ma, O, q, n, -5345 + C + 9540, ya[36]), ma, O, S, 11, ya[37]), la, ma, V, 16, ya[38]), q, la, fa, 23, ya[39]), O = d(O, q = d(q, la = d(la, ma, O, q, ia, Y + $ + D + 4071, ya[40]), ma, O, P, E + 1752, ya[41]), la, ma, R, 16, ya[42]), q, la, U, 23, ya[43]), O = d(O, q = d(q, la = d(la, ma, O, q, ea, 4, ya[44]), ma, O, ha, 11, ya[45]), la, ma, ka, y + 4096, ya[46]), q, la, Q, k + 8387 + -9793 + 2386, ya[47]), O = e(O, q = e(q, la = e(la, ma, O, q, P, X + F + 5056, ya[G + 185]), ma, O, V, z - 7502, ya[49]), la, ma, ja, 4376 + H + 3667 - 16394, ya[50]), q, la, T, I + -983 + 7010, ya[51]), O = e(O, q = e(q, la = e(la, ma, O, q, ha, 42 + s + 656 - 2941, ya[52]), ma, O, R, 10, ya[53]), la, ma, fa, 2553 + J + -8569 - 3064, ya[54]), q, la, n, 21, ya[3412 + x + 1989]), O = e(O, q = e(q, la = e(la, ma, O, q, W, 6, ya[56]), ma, O, ka, 2260 + $ - 1792, ya[-6071 + K + 3299]), la, ma, U, 15, ya[-990 + da + 5252]), q, la, ia, 4121 + m - 7298, ya[59]), O = e(O, q = e(q, la = e(la, ma, O, q, S, 6, ya[L + 6672]), ma, O, ga, 10, ya[61]), la, ma, Q, 15, ya[62]), q, la, ea, 21, ya[63]); l[M - 2907] = l[0] + la | 0, l[1] = l[1] + ma | 0, l[2] = l[2] + O | 0, l[3] = l[3] + q | -11860 + N + 12310 }, C: function() { var b = this.q, c = b.g, d = (6876 + $ + -335 - 6075) * this.r, e = 8 * b.h; c[e >>> 8761 + ea + 1268 - 14942] |= 128 << C + 4215 - e % 32; var f = a.floor(d / 4294967296); for (c[15 + (e + 64 >>> 9 << O + 4006)] = 16711935 & (f << 8 | f >>> 24) | 4278255360 & (f << 24 | f >>> 8), c[14 + (e + (D + -6251 + 4308) >>> 9 << 4)] = 16711935 & (d << 8 | d >>> 24) | 4278255360 & (d << 24 | d >>> 8), b.h = 4 * (c.length + 1), this.t(), c = (b = this.K).g, d = 0; 4 > d; d++) e = c[d], c[d] = 16711935 & (e << 8 | e >>> 24) | 4278255360 & (e << 24 | e >>> 2244 + fa + 2814 - 12624); return b }, e: function() { var a = wa.e.call(this); return a.K = this.K.e(), a } }), ua.J = wa.D(xa), ua.L = wa.F(xa) }(Math), e = (c = (d = fb).a).b, f = c.f, g = (c = d.G).M = e.c({ y: e.c({ N: 4, O: c.J, P: 1 }), init: function(a) { this.y = this.y.c(a) }, Q: function(a, b) { for (var c = (h = this.y).O.create(), d = f.create(), e = d.g, g = h.N, h = h.P; e.length < g;) { i && c.A(i); var i = c.A(a).B(b); c.p(); for (var j = 1; j < h; j++) i = c.B(i), c.p(); d.concat(i) } return d.h = 4 * g, d } }), d.M = function(a, b, c) { return g.create(c).Q(a, b) }, fb.a.R || function(a) { var b = (o = fb).a, c = b.b, d = b.f, e = b.o, f = o.k.H, g = o.G.M, h = b.R = e.c({ y: c.c(), S: function(a, b) { return this.create(this.T, a, b) }, U: function(a, b) { return this.create(this.V, a, b) }, init: function(a, b, c) { this.y = this.y.c(c), this.W = a, this.X = b, this.p() }, p: function() { e.p.call(this), this.z() }, Y: function(a) { return this.s(a), this.t() }, B: function(a) { return a && this.s(a), this.C() }, N: w - 1761, Z: 4, T: 1, V: 2, D: function(a) { return { $: function(b, c, d) { for (var e = "", f = 0; f < "ǠǧǡǺǽǴ".length; f++) e += String.fromCharCode(403 ^ "ǠǧǡǺǽǴ".charCodeAt(f)); return (e == typeof c ? p : n).$(a, b, c, d) }, _: function(b, c, d) { for (var e = "", f = 0; f < "ࣘࣟࣙࣂࣅ࣌".length; f++) e += String.fromCharCode(2219 ^ "ࣘࣟࣙࣂࣅ࣌".charCodeAt(f)); return (e == typeof c ? p : n)._(a, b, c, d) } } } }); b.aa = h.c({ C: function() { return this.t(!0) }, u: 1 }); var i = o.ba = {}, j = function(a, b, c) { var d = this.ca; d ? this.ca = void 0 : d = this.da; for (var e = 0; e < c; e++) a[b + e] ^= d[e] }, l = (b.ea = c.c({ S: function(a, b) { return this.fa.create(a, b) }, U: function(a, b) { return this.ga.create(a, b) }, init: function(a, b) { this.ha = a, this.ca = b } })).c(); l.fa = l.c({ ia: function(a, b) { var c = this.ha, d = c.u; j.call(this, a, b, d), c.ja(a, b), this.da = a.slice(b, b + d) } }), l.ga = l.c({ ia: function(a, b) { var c = this.ha, d = c.u, e = a.slice(b, b + d); c.ka(a, b), j.call(this, a, b, d), this.da = e } }), i = i.la = l, l = (o.na = {}).ma = { na: function(a, b) { for (var c, e = (c = (c = 4 * b) - a.h % c) << 24 | c << 16 | c << 8 | c, f = [], g = 6180 + K + -1259 - 7750; g < c; g += X + 6428 - 10162) f.push(e); c = d.create(f, c), a.concat(c) }, oa: function(a) { a.h -= 255 & a.g[a.h - 1 >>> 2] } }, b.pa = h.c({ y: h.y.c({ ba: i, qa: l }), p: function() { h.p.call(this); var a = (b = this.y).ra, b = b.ba; if (this.W == this.T) var c = b.S; else c = b.U, this.v = 1; this.sa = c.call(b, this, a && a.g) }, w: function(a, b) { this.sa.ia(a, b) }, C: function() { var a = this.y.qa; if (this.W == this.T) { a.na(this.q, this.u); var b = this.t(!0) } else b = this.t(!0), a.oa(b); return b }, u: V + -6989 + -3440 + 13100 }); var m = b.ta = c.c({ init: function(a) { this.d(a) }, toString: function(a) { return (a || this.ua).i(this) } }), n = (i = (o.wa = {}).va = { i: function(a) { var b = a.xa; return ((a = a.ya) ? d.create([1398893684, 6475 + D + 1701068349]).concat(a).concat(b) : b).toString(f) }, parse: function(a) { var b = (a = f.parse(a)).g; if (1398893684 == b[0] && 1701076831 == b[1]) { var c = d.create(b.slice(2, 4)); b.splice(0, 4), a.h -= 16 } return m.create({ xa: a, ya: c }) } }, b.za = c.c({ y: c.c({ wa: i }), $: function(a, b, c, d) { d = this.y.c(d); var e = a.S(c, d); return b = e.B(b), e = e.y, m.create({ xa: b, Aa: c, ra: e.ra, Ba: a, ba: e.ba, qa: e.qa, u: a.u, ua: d.wa }) }, _: function(a, b, c, d) { return d = this.y.c(d), b = this.Ca(b, d.wa), a.U(c, d).B(b.xa) }, Ca: function(a, b) { for (var c = "", d = -8390 + Y + 3880; d < "ࠕࠒࠔࠏࠈࠁ".length; d++) c += String.fromCharCode(2150 ^ "ࠕࠒࠔࠏࠈࠁ".charCodeAt(d)); return c == typeof a ? b.parse(a, this) : a } })), o = (o.Da = {}).va = { Ea: function(a, b, c, e) { return e || (e = d.random(k + 4678 + -4737 + 1024)), a = g.create({ N: b + c }).Q(a, e), c = d.create(a.g.slice(b), 4 * c), a.h = 4 * b, m.create({ Aa: a, ra: c, ya: e }) } }, p = b.Fa = n.c({ y: n.y.c({ Da: o }), $: function(a, b, c, d) { return c = (d = this.y.c(d)).Da.Ea(c, a.N, a.Z), d.ra = c.ra, (a = n.$.call(this, a, b, c.Aa, d)).d(c), a }, _: function(a, b, c, d) { return d = this.y.c(d), b = this.Ca(b, d.wa), c = d.Da.Ea(c, a.N, a.Z, b.ya), d.ra = c.ra, n._.call(this, a, b, c.Aa, d) } }) }(), function() { for (var a = fb, b = a.a.pa, c = a.G, d = [], e = [], f = [], g = [], i = [], j = [], k = [], l = [], m = [], n = [], o = [], q = U + 2043 + -9216 + 6326; 256 > q; q++) o[q] = 128 > q ? q << 1 : q << Z + 4353 - 10780 ^ -4619 + $ + 9772; var t = 0, u = 13770 + V - 11103; for (q = 8146 + s + s - 12644; 256 > q; q++) { var v = (v = u ^ u << 1 ^ u << h + 7286 + 7286 - 16406 ^ u << 3 ^ u << X + 2744 - 6478) >>> 8 ^ 255 & v ^ 7286 + _ + -803 - 621; d[t] = v, e[v] = t; var x = o[t], y = o[x], z = o[y], A = 257 * o[v] ^ 16843008 * v; f[t] = A << 24 | A >>> 8, g[t] = A << 8146 + L - 1518 | A >>> 16, i[t] = A << -7226 + B + -8993 + 16723 | A >>> 24, j[t] = A, A = 16843009 * z ^ 65537 * y ^ (12950 + aa - 12561) * x ^ (ba + 6038 + ca + 16817958) * t, k[v] = A << 24 | A >>> W + 1177, l[v] = A << 16 | A >>> 16, m[v] = A << H + da - 4738 | A >>> 24, n[v] = A, t ? (t = x ^ o[o[o[z ^ x]]], u ^= o[o[u]]) : t = u = 1 } var C = [0, 1, da + 1538 + -9246 + 11330, ea + -8064 + -6326 + 15349, 8, -7197 + fa - 2295, 32, 64, 128, 27, 54]; c = c.Ga = b.c({ z: function() { for (var a = (c = this.X).g, b = c.h / 4, c = 4 * ((this.Ha = b + 6) + 1), e = this.Ia = [], f = 0; f < c; f++) if (f < b) e[f] = a[f]; else { var g = e[f - 1]; f % b ? 6 < b && 4 == f % b && (g = d[g >>> 24] << 24 | d[g >>> 16 & 255] << 16 | d[g >>> 8 & 255] << 8 | d[255 & g]) : (g = d[(g = g << 8 | g >>> 24) >>> 24] << 24 | d[g >>> 16 & 255] << 16 | d[g >>> 8 & ga + 8195] << 8 | d[255 & g], g ^= C[f / b | 0] << 24), e[f] = e[f - b] ^ g } for (a = this.Ja = [], b = 0; b < c; b++) f = c - b, g = b % 4 ? e[f] : e[f - 4], a[b] = 4 > b || 4 >= f ? g : k[d[g >>> 24]] ^ l[d[g >>> 16 & 255]] ^ m[d[g >>> 8 & 255]] ^ n[d[255 & g]] }, ja: function(a, b) { this.Ka(a, b, this.Ia, f, g, i, j, d) }, ka: function(a, b) { var c = a[b + 1]; a[b + 1] = a[b + 3], a[b + 3] = c, this.Ka(a, b, this.Ja, k, l, m, n, e), c = a[b + 1], a[b + 1] = a[b + 3], a[b + 3] = c }, Ka: function(a, b, c, d, e, f, g, h) { for (var i = this.Ha, j = a[b] ^ c[0], k = a[b + 1] ^ c[1], l = a[b + 2] ^ c[6782 + r + 2889 - 9456], m = a[b + 3] ^ c[3], n = 4, o = 1; o < i; o++) { var q = d[j >>> 24] ^ e[k >>> 16 & 255] ^ f[l >>> 8 & 255] ^ g[255 & m] ^ c[n++], s = d[k >>> 24] ^ e[l >>> 16 & 255] ^ f[m >>> 8 & 255] ^ g[255 & j] ^ c[n++], t = d[l >>> 24] ^ e[m >>> 16 & 255] ^ f[j >>> 8 & w - 1510] ^ g[255 & k] ^ c[n++]; m = d[m >>> 24] ^ e[j >>> 16 & 255] ^ f[k >>> -3930 + Q + 7621 & 255] ^ g[255 & l] ^ c[n++], j = q, k = s, l = t } q = (h[j >>> 24] << 24 | h[k >>> 16 & 255] << 16 | h[l >>> 8 & 255] << 8 | h[255 & m]) ^ c[n++], s = (h[k >>> 24] << 24 | h[l >>> 16 & 255] << 16 | h[m >>> 8 & 255] << 8 | h[255 & j]) ^ c[n++], t = (h[l >>> 24] << 24 | h[m >>> 16 & 255] << 16 | h[j >>> 8 & 255] << 8 | h[255 & k]) ^ c[n++], m = (h[m >>> 24] << 9424 + ha + -1219 - 1552 | h[j >>> 16 & 255] << 16 | h[k >>> 8 & 255] << 8 | h[255 & l]) ^ c[n++], a[b] = q, a[b + 1] = s, a[b + (-5365 + p - 2759)] = t, a[b + 3] = m }, N: 8 }), a.Ga = b.D(c) }(), function(a, c, d, e, f) { return b.call(this, 5, a, c, d, e, f) } }();
2019年03月31日
3,299 阅读
0 评论
0 点赞
2019-03-31
P2P云点播
P2P对等网络,即对等计算机网络,是一种在对等者(Peer)之间分配任务和工作负载的分布式应用架构,是对等计算模型在应用层形成的一种组网或网络形式。“Peer”在英语里有“对等者、伙伴、对端”的意义。因此,从字面上,P2P可以理解为对等计算或对等网络。国内一些媒体将P2P翻译成“点对点”或者“端对端”,学术界则统一称为对等网络(Peer-to-peer networking)或对等计算(Peer-to-peer computing),其可以定义为:网络的参与者共享他们所拥有的一部分硬件资源(处理能力、存储能力、网络连接能力、打印机等),这些共享资源通过网络提供服务和内容,能被其它对等节点(Peer)直接访问而无需经过中间实体。在此网络中的参与者既是资源、服务和内容的提供者(Server),又是资源、服务和内容的获取者(Client)。在P2P网络环境中,彼此连接的多台计算机之间都处于对等的地位,各台计算机有相同的功能,无主从之分,一台计算机既可作为服务器,设定共享资源供网络中其他计算机所使用,又可以作为工作站,整个网络一般来说不依赖专用的集中服务器,也没有专用的工作站。网络中的每一台计算机既能充当网络服务的请求者,又对其它计算机的请求做出响应,提供资源、服务和内容。通常这些资源和服务包括:信息的共享和交换、计算资源(如CPU计算能力共享)、存储共享(如缓存和磁盘空间的使用)、网络共享、打印机共享等。简单的说,P2P就是直接将人们联系起来,让人们通过互联网直接交互。P2P使得网络上的沟通变得容易、更直接共享和交互,真正地消除中间商。目前P2P点播的P2P环境将由WebTorrent实现,尽可能的通过WebRTC进行对等传输,H5的对等网络P2P环境诞生。<?php echo 111;?>
2019年03月31日
1,983 阅读
0 评论
0 点赞
2019-03-30
人生风景
[album][/album]
2019年03月30日
613 阅读
0 评论
0 点赞
1
...
11
12
13