• PageUtil.java分页工具类


    package com.chabansheng.util;
    
    /**
     * 分页工具类
     * @author Administrator
     *
     */
    public class PageUtil {
    
        /**
         * 生成分页代码
         * @param targetUrl 目标地址
         * @param totalNum 总记录数
         * @param currentPage 当前页
         * @param pageSize 每页大小
         * @return
         */
        public static String genPagination(String targetUrl,long totalNum,int currentPage,int pageSize,String param){
            long totalPage=totalNum%pageSize==0?totalNum/pageSize:totalNum/pageSize+1;
            if(totalPage==0){
                return "未查询到数据";
            }else{
                StringBuffer pageCode=new StringBuffer();
                pageCode.append("<li><a href='"+targetUrl+"?page=1&"+param+"'>首页</a></li>");
                if(currentPage>1){
                    pageCode.append("<li><a href='"+targetUrl+"?page="+(currentPage-1)+"&"+param+"'>上一页</a></li>");            
                }else{
                    pageCode.append("<li class='disabled'><a href='"+targetUrl+"?page="+(currentPage-1)+"&"+param+"'>上一页</a></li>");        
                }
                for(int i=currentPage-2;i<=currentPage+2;i++){
                    if(i<1||i>totalPage){
                        continue;
                    }
                    if(i==currentPage){
                        pageCode.append("<li class='active'><a href='"+targetUrl+"?page="+i+"&"+param+"'>"+i+"</a></li>");    
                    }else{
                        pageCode.append("<li><a href='"+targetUrl+"?page="+i+"&"+param+"'>"+i+"</a></li>");    
                    }
                }
                if(currentPage<totalPage){
                    pageCode.append("<li><a href='"+targetUrl+"?page="+(currentPage+1)+"&"+param+"'>下一页</a></li>");        
                }else{
                    pageCode.append("<li class='disabled'><a href='"+targetUrl+"?page="+(currentPage+1)+"&"+param+"'>下一页</a></li>");    
                }
                pageCode.append("<li><a href='"+targetUrl+"?page="+totalPage+"&"+param+"'>尾页</a></li>");
                return pageCode.toString();
            }
        }
        
    
        
        
    }
  • 相关阅读:
    剑指offer题解(python版)(更新到第16题)
    Java基础知识详解:值传递
    [LeetCode] 583. Delete Operation for Two Strings
    [LeetCode] 856. Score of Parentheses
    [LeetCode] 1129. Shortest Path with Alternating Colors
    [LeetCode] 1561. Maximum Number of Coins You Can Get
    [LeetCode] 1052. Grumpy Bookstore Owner
    [LeetCode] 991. Broken Calculator
    [LeetCode] 1054. Distant Barcodes
    [LeetCode] 1245. Tree Diameter
  • 原文地址:https://www.cnblogs.com/375163374lsb/p/10535774.html
Copyright © 2020-2023  润新知