zoukankan      html  css  js  c++  java
  • php分页类

    <?php
    class Page {
    private $total; //总记录
    private $pagesize; //每页显示多少条
    private $limit; //limit
    private $page; //当前页码
    private $pagenum; //总页码
    private $url; //地址
    private $bothnum; //两边保持数字分页的量

    //构造方法初始化
    public function __construct($_total, $_pagesize) {
    $this->total = $_total ? $_total : 1;
    $this->pagesize = $_pagesize;
    $this->pagenum = ceil($this->total / $this->pagesize);
    $this->page = $this->setPage();
    $this->limit = "LIMIT ".($this->page-1)*$this->pagesize.",$this->pagesize";
    $this->url = $this->setUrl();
    $this->bothnum = 2;
    }

    //拦截器
    public function __get($_key) {
    return $this->$_key;
    }

    //获取当前页码
    private function setPage() {
    if (!empty($_GET['page'])) {
    if ($_GET['page'] > 0) {
    if ($_GET['page'] > $this->pagenum) {
    return $this->pagenum;
    } else {
    return $_GET['page'];
    }
    } else {
    return 1;
    }
    } else {
    return 1;
    }
    }

    //获取地址
    private function setUrl() {
    $_url = $_SERVER["REQUEST_URI"];
    $_par = parse_url($_url);
    if (isset($_par['query'])) {
    parse_str($_par['query'],$_query);
    unset($_query['page']);
    $_url = $_par['path'].'?'.http_build_query($_query);
    }
    return $_url;
    } //数字目录
    private function pageList() {
    $_pagelist="";
    for ($i=$this->bothnum;$i>=1;$i--) {
    $_page = $this->page-$i;
    if ($_page < 1) continue;
    $_pagelist .= ' <a href="'.$this->url.'&page='.$_page.'">'.$_page.'</a> ';
    }
    $_pagelist .= ' <span class="me">'.$this->page.'</span> ';
    for ($i=1;$i<=$this->bothnum;$i++) {
    $_page = $this->page+$i;
    if ($_page > $this->pagenum) break;
    $_pagelist .= ' <a href="'.$this->url.'&page='.$_page.'">'.$_page.'</a> ';
    }
    return $_pagelist;
    }

    //首页
    private function first() {
    if ($this->page > $this->bothnum+1) {
    return ' <a href="'.$this->url.'">1</a> ...';
    }
    }

    //上一页
    private function prev() {
    if ($this->page == 1) {
    return '<span class="disabled">上一页</span>';
    }
    return ' <a href="'.$this->url.'&page='.($this->page-1).'">上一页</a> ';
    }

    //下一页
    private function next() {
    if ($this->page == $this->pagenum) {
    return '<span class="disabled">下一页</span>';
    }
    return ' <a href="'.$this->url.'?page='.($this->page+1).'">下一页</a> ';
    }

    //尾页
    private function last() {
    if ($this->pagenum - $this->page > $this->bothnum) {
    return ' ...<a href="'.$this->url.'&page='.$this->pagenum.'">'.$this->pagenum.'</a> ';
    }
    }

    //分页信息
    public function showpage() {
    $_page="";
    $_page .= $this->first();
    $_page .= $this->pageList();
    $_page .= $this->last();
    $_page .= $this->prev();
    $_page .= $this->next();
    return $_page;
    }
    }
    ?>
    <?php
    $_page = new Page(23,4); //其中 $_total 是数据集的总条数,$_pagesize 是每页显示的数量.
    echo $_page->showpage();
    ?>

  • 相关阅读:
    java.lang.OutOfMemoryError: GC overhead limit exceeded
    Ural 1146 Maximum Sum(DP)
    [算法系列之四]优先级队列
    Python源代码--整数对象(PyIntObject)的内存池
    3星|何帆《猜测与偏见》:社科书评集
    4星|《认识经济》:全面系统的经济学普及读物,鸿篇巨制,价格超贵
    3星|《东方启动点》:民营企业家们的故事,故事多分析概括少
    2星|《大师的管理课》:畅销书作家们的35篇励志散文
    3.5星|《蓝海战略2》:实施蓝海战略的具体工具与方法。案例牵强且偏老旧
    2星|《读懂华为30年》:基于公开资料的整理和肤浅的发挥
  • 原文地址:https://www.cnblogs.com/shenming/p/4213231.html
Copyright © 2011-2022 走看看