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

    <?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;
    }

    // //拦截器
    // private 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 = '';
    $_page = '';
    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;
    }
    }
    ?>

  • 相关阅读:
    angular流程引擎集成
    angular打印功能实现方式
    文件hash、上传,实现文件上传重复验证
    HDU 6096 String(AC自动机+树状数组)
    HDU 5069 Harry And Biological Teacher(AC自动机+线段树)
    BZOJ 3172 单词(AC自动机)
    LightOJ 1268 Unlucky Strings(KMP+矩阵乘法+DP)
    Codeforces 808G Anthem of Berland(KMP+DP)
    LightOJ 1258 Making Huge Palindromes(KMP)
    UVA 11019 Matrix Matcher(哈希)
  • 原文地址:https://www.cnblogs.com/lijiageng/p/6031227.html
Copyright © 2011-2022 走看看