• php+jquery 上拉加载


    <script type="text/javascript">
    var resflow = true,pages =2;
    var ps=$("#ids").text();
    order_code=$("#order_code").html();
    $(function(){
    /*滚动条追加数据*/
    $(window).bind('scroll',function(){
    requirementH = 0,docH = 0;
    requirementH = ($(window).innerHeight() - 49) + $(window).scrollTop();
    docH = ($('.menuOfListRight ul li').size()) * ($('.menuOfListRight ul li').height()+5);
    // console.log('requirementH='+requirementH);
    // console.log('docH=='+docH);
    // console.log('scrolltop=='+$(window).scrollTop());
    if( docH<requirementH){
    if(pages <=ps){
    console.log(pages);
    getDate();
    $('.menuLoad').show();
    } else{
    $('.menuLoad').hide();
    }
    console.log('ssssssss');
    }
    });
    });
    /*ajax获取数据**/
    function getDate(){
    if(resflow){
    resflow = false;
    if(pages <= ps){
    str = '';
    $.ajax({
    type: "POST",
    url: ".././../up_load",
    data:{page:pages,id:order_code},
    success: function(data) {
    for (var i = 0; i < data.length; i++) {
    str += '<li style="margin-bottom: 0.54444rem" >' +
    '<div class="dkjl-li">' +
    '<div class="dkjl-tit fl ddhao">订单号:'+data[i].virtual_code+'</div>' +
    '<div class="dkjl-con fr"><span>'+data[i].add_time+'</span></div>' +
    '</div>' +
    '<div class="dkjl-li">';
    if(data[i].zhuangxiu==null) {
    str+= '<div class="dkjl-tit fl ddhao">暂无数据 </div>' +
    '<div class="dkjl-con fr"><span class="dkjl-red">¥' + data[i].jiaofei + '</></div>' +
    '</div>' +
    '<div class="dkjl-li">'
    }else{
    str+= '<div class="dkjl-tit fl ddhao">'+data[i].zhuangxiu.company+' </div>' +
    '<div class="dkjl-con fr"><span class="dkjl-red">¥' + data[i].jiaofei + '</></div>' +
    '</div>' +
    '<div class="dkjl-li">'
    }

    <!--- 业务逻辑
    if(data[i].status==0){
    str+='<div class="dkjl-tit fl dkwc" >1111</div>'+
    '</div>'+
    '</li>'
    }else if(data[i].status==1) {
    str+='<div class="dkjl-tit fl dkwc" ></div>'+
    '</div>'+
    '</li>'

    --->
    }else{
    str += '<div class="dkjl-tit fl dkwc">33333</div>' +
    '<div class="dkjl-con fr"><a class="js-moneypz" data='+data[i].cert_img+'>2222</a></div>' +
    '<div class="dkpzheng"><img src=' + data[i].cert_img + ' width="100%"></div>' +
    '</div>' +
    '</li>'
    }
    }
    $('.menuOfListRight ul').after(str);
    }
    });
    pages ++ ;
    resflow = true;
    }
    }
    }
    </script>

  • 相关阅读:
    C# 中的委托和事件
    POJ题目分类
    A*算法
    Poj 1077 eight(BFS+全序列Hash解八数码问题)
    Poj 2304 Combination Lock(模拟顺、逆时钟开组合锁)
    Poj 2247 Humble Numbers(求只能被2,3,5, 7 整除的数)
    Poj 2328 Guessing Game(猜数字游戏)
    Poj 2403 Hay Points(Map)
    Poj 1338 Ugly Numbers(数学推导)
    Poj 1504 Adding Reversed Numbers(用字符串反转数字)
  • 原文地址:https://www.cnblogs.com/wxc1/p/6114369.html
Copyright © 2020-2023  润新知