zoukankan      html  css  js  c++  java
  • 分页公共类参考

    package cn.com.mcd.util;

    import java.io.Serializable;
    import java.util.List;

    public class Pages<T> implements Serializable {

    private static final long serialVersionUID = -5583579662704307696L;

    private int curPage = 1; // 当前页
    private int pageSize = 10; // 每页多少行
    private int totalRow; // 共多少行
    private int start;// 当前页起始行
    private int end;// 结束行
    private int totalPage; // 共多少页
    private String sortColumn;//排序字段
    private boolean sortDirection;//排序方向()

    /**分页数据**/
    private List<T> pages;

    public List<T> getPages() {
    return pages;
    }

    public void setPages(List<T> pages) {
    this.pages = pages;
    }

    public int getCurPage() {
    return curPage;
    }

    public void setCurPage(int curPage) {
    if (curPage < 1) {
    curPage = 1;
    } else {
    start = pageSize * (curPage - 1);
    }
    end = start + pageSize > totalRow ? totalRow : start + pageSize;
    this.curPage = curPage;
    }

    public int getStart() {
    // start=curPage*pageSize;
    return start;
    }

    public int getEnd() {

    return end;
    }

    public int getPageSize() {
    return pageSize;
    }

    public void setPageSize(int pageSize) {
    this.pageSize = pageSize;
    }

    public int getTotalRow() {
    return totalRow;
    }

    public void setTotalRow(int totalRow) {
    totalPage = (totalRow + pageSize - 1) / pageSize;
    this.totalRow = totalRow;
    if (totalPage < curPage) {
    curPage = totalPage;
    start = pageSize * (curPage - 1);
    end = totalRow;
    }
    end = start + pageSize > totalRow ? totalRow : start + pageSize;
    }

    public int getTotalPage() {

    return this.totalPage;
    }

    public String getSortColumn() {
    return sortColumn;
    }

    public void setSortColumn(String sortColumn) {
    this.sortColumn = sortColumn;
    }

    public boolean isSortDirection() {
    return sortDirection;
    }

    public void setSortDirection(boolean sortDirection) {
    this.sortDirection = sortDirection;
    }

    }

  • 相关阅读:
    [FJOI2016] 建筑师
    AtCoder
    [Poetize6] IncDec Sequence
    CodeForces
    洛谷 P4551 最长异或路径
    WC 2018/CTSC 2018/APIO 2018 游记
    洛谷 P4538 收集邮票
    「PKUWC 2018」随机算法 (60分部分分做法)
    bzoj 3718: [PA2014]Parking
    bzoj 1023: [SHOI2008]cactus仙人掌图 2125: 最短路 4728: 挪威的森林 静态仙人掌上路径长度的维护系列
  • 原文地址:https://www.cnblogs.com/songyunxinQQ529616136/p/6268261.html
Copyright © 2011-2022 走看看