zoukankan      html  css  js  c++  java
  • JavaScript之淡入淡出

    //正常输出
    window.onload=function(){
        var div=document.getElementById('div');
        var timer=null;
        div.style.display='none';
        div.style.opacity='0';
        function fadein(elem, speed, opacity){
            elem.style.display = 'block';
            elem.style.opacity = val / 100;
            var val = 0;
            (function(){
                elem.style.opacity = val / 100;
                val += 10;
                console.log(val);
                if (val <= opacity+500) {
                    setTimeout(arguments.callee, speed);
                }
            })();
        }
        document.getElementById('btn').onclick=function(){
            fadein(div,1000,100);
        }
    }
    //不正常,无法读取elem
    window.onload=function(){
        var div=document.getElementById('div');
        var timer=null;
        div.style.display='none';
        div.style.opacity='0';
        function fadein(elem, speed, opacity){
            elem.style.display = 'block';
            elem.style.opacity = val / 100;
            var val = 0;
            elem.style.opacity = val / 100;
            val += 10;
            console.log(val);
            if (val <= opacity+500) {
                setTimeout(arguments.callee, speed);
            }
        }
        document.getElementById('btn').onclick=function(){
            fadein(div,1000,100);
        }
    }
    //不正常,一直输出10
    window.onload=function(){
        var div=document.getElementById('div');
        var timer=null;
        div.style.display='none';
        div.style.opacity='0';
        function fadein(elem, speed, opacity){
            elem.style.display = 'block';
            elem.style.opacity = val / 100;
            var val = 0;
            elem.style.opacity = val / 100;
            val += 10;
            console.log(val);
            if (val <= opacity+500) {
                setTimeout(function(){
                    fadein(elem, speed, opacity);
                },speed);
            }
        }
        document.getElementById('btn').onclick=function(){
            fadein(div,1000,100);
        }
    }
    //正常输出
    window.onload=function(){
        var div=document.getElementById('div');
        var timer=null;
        div.style.display='none';
        div.style.opacity='0';
        var val = 0;
        function fadein(elem, speed, opacity){
            elem.style.display = 'block';
            elem.style.opacity = val / 100;
            console.log(val);
            if (val <= opacity+500) {
                val += 10;
                elem.style.opacity = val / 100;
                setTimeout(function(){
                    fadein(elem, speed, opacity);
                },speed);
            }
        }
        document.getElementById('btn').onclick=function(){
            fadein(div,1000,100);
        }
    }
  • 相关阅读:
    (中等) HDU 1495 非常可乐,BFS。
    (简单) POJ 1562 Oil Deposits,BFS。
    (简单) POJ 3984 迷宫问题,BFS。
    动态规划(斐波那契系列)---爬楼梯
    回溯---N皇后
    回溯---数独
    回溯---分割字符串使得每个部分都是回文数
    回溯---含有相同元素求子集
    回溯---子集
    回溯---组合求和
  • 原文地址:https://www.cnblogs.com/chenyongyang/p/7747156.html
Copyright © 2011-2022 走看看