zoukankan      html  css  js  c++  java
  • 开源中国愚人节网页变模糊的js blur代码

    Js代码  收藏代码
    1. <![if !IE]>  
    2. <script>      
    3. /* 
    4. * by moli 
    5. */  
    6. $(document).ready(function(){  
    7.   if(document.cookie.indexOf("lu=") == -1 ){  
    8.     // 延时2秒  
    9.     setTimeout("jQuery.mxblur.interID = setInterval('jQuery.mxblur.begin()', 5)", 1500);  
    10.   }  
    11. });  
    12.   
    13. $.mxblur = {  
    14.     interID : null,  
    15.     num: 0.01,  
    16.     begin : function() {  
    17.         jQuery.mxblur.blur( jQuery.mxblur.num );  
    18.         if(jQuery.mxblur.num > 3) {  
    19.             jQuery.mxblur.num = 0;  
    20.           if(confirm("少年!是不是代码写多了?眼睛模糊了?")) {  
    21.              alert("太累啦,就该歇歇啦,愚人节快乐:)");  
    22.              clearInterval(jQuery.mxblur.interID );  
    23.              jQuery.mxblur.blur(0);  
    24.              document.cookie = "lu=lu";  
    25.           }  
    26.         }  
    27.         jQuery.mxblur.num = jQuery.mxblur.num  + 1 /100;  
    28.     },  
    29.     blur : function() {  
    30.         $("body").css("-webkit-filter","blur("+$.mxblur.num+"px)");  
    31.         $("body").css("-moz-filter","blur("+$.mxblur.num+"px)");  
    32.         $("body").css("-o-filter","blur("+$.mxblur.num+"px)");  
    33.         $("body").css("-ms-filter","blur("+$.mxblur.num+"px)");  
    34.         $("body").css("filter","blur("+$.mxblur.num+"px)");  
    35.         $("body").css("filter","url(blur.svg#"+ $.mxblur.num.toFixed(1) +")");  
    36.     }  
    37. }  
    38. </script>  
    39. <![endif]>  

     14年愚人节打开OSCHINA,然后等了2秒钟,你会发现网页全变模糊了,刚以为是浏览器问题,然后看了网页源码。就是加了一段代码就能实现。呵呵  分享给大家

  • 相关阅读:
    LeetCode 252. Meeting Rooms
    LeetCode 161. One Edit Distance
    LeetCode 156. Binary Tree Upside Down
    LeetCode 173. Binary Search Tree Iterator
    LeetCode 285. Inorder Successor in BST
    LeetCode 305. Number of Islands II
    LeetCode 272. Closest Binary Search Tree Value II
    LeetCode 270. Closest Binary Search Tree Value
    LeetCode 329. Longest Increasing Path in a Matrix
    LintCode Subtree
  • 原文地址:https://www.cnblogs.com/ranran/p/3638542.html
Copyright © 2011-2022 走看看