PHP实现对数组分页处理实例详解

<?php

classPaginationArray{

 public$pageArray=array();//数组

 public$pageSize=10;//每页显示记录数

 public$current= 1;//当前页

 private$total=0;//总页数

 private$prev=0;//上一页

 private$next=0;//下一页

 public$argumetsOther='';//设置参数

 function__construct($array=array(),$pageSize=10,$current=1){

 $this->pageArray=$array;

 $this->pageSize=$pageSize;

 $this->current=$current;

 }

 /*通过数组进行初始化

 *

 * 数组为关联数组,参数索引为pageArray,pageSize,current

 *

 */

 functionsetArguments($arr){

 if(is_array($arr)){

  $this->pageArray=$arr['pageArray'];

  $this->pageSize=$arr['pageSize'];

  $this->current=$arr['current'];

 }else{

  return;

 }

 }

 //返回链接

 functionpage(){

 $_return=array();

 /*calculator*/

 $this->total=ceil(Count($this->pageArray)/$this->pageSize);

 $this->prev=(($this->current-1)<= 0="" this-="">current-1));

 $this->next=(($this->current+1)>=$this->total ?$this->total:$this->current+1);

 $current=($this->current>($this->total)?($this->total):$this->current);

 $start=($this->current-1)*$this->pageSize;

 $arrleng=count($this->pageArray);

 for($i=$start;$i<($start+$this->pageSize);$i++){

  if($i>=$arrleng)break;

  array_push($_return,$this->pageArray[$i]);

 }

 $pagearray["source"]=$_return;

 $pagearray["links"]=$this->linkStyle(2);

 return$pagearray;

 }

 //链接的样式

 privatefunctionlinkStyle($number=1){

 $linkStyle='';

 switch($number){

  case1:

  $linkStyle="first prev next end";

  break;

  case2:

  $linkStyle="首页 上一页  下一页  尾页";

  break;

 }

 return$linkStyle;

 }

}

//调用的实例

/*

header('Content-Type: text/html;charset=utf-8');

$array=array("1","2","3","4","5","6","7","8","9","10","11","12","13","14","15","16","17","18","19","20");

$page= isset($_GET['page'])? $_GET['page'] : 1 ;

$arrayPage = new PaginationArray($array,"5",$page);

$r = $arrayPage->page();

foreach($r["source"] as $s){

 echo $s.'
';

}

echo $r["links"];

*/

?>

functionread_csv($cvs) {

  $shuang= false;

  $str=file_get_contents($cvs);

  for($i=0;$i<strlen($str);$i++) {

    if($str{$i}=='"') {

      if($shuang) {

        if($str{$i+1}=='"') {

          $str{$i} ='*';

          $str{$i+1} ='*';

        }else{

          $shuang= false;

        }

      }else{

        $shuang= true;

      }

    }

    if($str{$i}==',') {

      if($shuang) {

      }else{

        $str{$i} ='|';

      }

    }

    if($str{$i}=="\n") {

      if($shuang) {

        $str{$i} ='^';

      }else{

      }

    }

  }

  $str=str_replace(array('"','*'),array('','"'),$str);

  $a1=explode("\n",$str);

  $array=array();

  foreach($a1as$k=>$value) {

    if($value) {

      $value=str_replace("^","\n",$value);

      $array[$k] =explode("|",$value);

    }

  }

  return$array;

}

$sql="XXXXXXXXXX";  //sql语句

$res=$db->Select($sql); //执行sql

$list=array();

treeList(treeGet($res),$list);  /生成树

print_r($res); //打印出来看看！

/**

* 选择SQL涵数

*

* @access public

* @param Array  $field  字段信息，支持涵数

* @param Array  $table  数据库表

* @param Array  $where  条件

* @return SQL SQL语句

*/

functiontreeGet($data)

{

  $tmptree=null;

  $tree=$data;

  returntreeAddNodeToTree($tmptree,treegetbyuid($tree,0,@$field),$tree);

}

/**

*插入SQL涵数

*

* @access public

* @param Array  $fieldResult  字段信息，支持涵数

* @param Array  $table  数据库表

* @return SQL SQL语句

*/

functiontreeAddNodeToTree($Node,$miniTree,&$source)

{

  if(is_array($miniTree)) {

    foreach($miniTreeas$k=>$v)

    {

      if(!count($miniTree[$k]['child']=treeAddNodeToTree($miniTree[$k],treegetbyuid($source,@$v['id']),$source)))

      {

        unset($miniTree[$k]['child']);

        $miniTree[$k]['leaf']=true;//设置叶结点

      }

    }

    return$Node['child']=$miniTree;

  }

}

functiontreegetbyuid(&$stree,$uid)

{

  $dtree=array();

  if(is_array($stree)){

    foreach($streeas$k=>$v)

    {

      if($v['fid']==$uid)

      {

        $mytmp=array();

        $mytmp=$v;

        unset($stree[$k]);

        array_push($dtree,$mytmp);

        $mytmp=null;

      }

    }

  }

  return$dtree;

}

/**

*更新SQL涵数

*

* @access public

* @param Array  $fieldResult  字段信息，支持涵数

* @param Array  $table  数据库表

* @param Array  $where  条件

* @return SQL SQL语句

*/

functiontreeMakeDeep($deep)

{

  $returnValue="";

  for(;$deep;$deep--)

  {

    $returnValue.="┃";

  }

  return$returnValue."┣";

}

functiontreeList($treeData,&$List)

{

  static$deep=0;

  if(is_array($treeData))

  {

    foreach($treeDataas$k=>$v)

    {

      $v['deepValue']=treeMakeDeep($deep);

      $v['deep']=$deep;

      $t=$v;

      unset($t['child']);

      array_push($List,$t);

      if($v['child'])

      {

        ++$deep;

        $optionsNode.=treeList($v['child'],$List);

        $deep--;

      }

    }

    if($lastV=array_pop($List))

    {

      $lastV['deepValue']=str_replace('┣','┗',$lastV['deepValue']);

      array_push($List,$lastV);

    }

  }

}

functiontreeSelect($tree,$id,$options="child")

{

  switch(strtolower($options))

  {

    case"child":

    $tmpTree=array();

    $deep=-1;

    foreach($treeas$k=>$v)

    {

      if($id==$v['id'])

      {

        array_push($tmpTree,$v);

        $deep=$v['deep'];

      }elseif($deep!=-1)

      {

        if($v['deep']<=$deep)

        {

          break;

        }else

        {

          array_push($tmpTree,$v);

        }

      }

    }

    break;

    case"remove":

    default:

    $tmpTree=array();

    $deep=-1;

    foreach($treeas$k=>$v)

    {

      if($id==$v['id'])

      {

        $deep=$v['deep'];

        continue;

      }elseif($deep!=-1)

      {

        if($v['deep']<=$deep)

        {

          array_push($tmpTree,$v);

          $deep=-1;

        }

        continue;

      }

      array_push($tmpTree,$v);

    }

  }

  return$tmpTree;

}

classbevin{

public$public='public'

private$private='private'

protected$protected='protected'

//final $final = 'final'

static$static='static'

function__construct(){

 $this->protected='change private'

}

publicfunctionsetValue($a){

 self::$static=$a;

}

publicfunctiongetValue(){

 echo$this->private;

}

function__destruct(){

 echo'asdfsadf'

}

}

classpaixu {

// 基本排序

publicfunctiont_sortArray($array) {

 if(is_array($array) &&count($array)>1) {

 for($i=0;$i<count($array);$i++) {

  for($j=($i+1);$j<count($array);$j++) {

  $temp=$array[$i];

  if($array[$j]<$array[$i]) {

  $array[$i] =$array[$j];

  $array[$j] =$temp;

  }

  }

 }

 return$array;

 }else{

 return$array;

 }

}

// 冒泡排序

publicfunctionc_sortArray($array) {

 if(!is_array($array) ||count($array)<=1){return$array; }

 $status= false;

 foreach($arrayas$key=>$v) {

 if($key>0) {

  if($array[$key-1]>$array[$key]) {

  $array[$key] =$array[$key-1];

  $array[$key-1] =$v;

  $status= true;

  }

 }

 }

 if($status) {

 return$this->c_sortArray($array);

 }else{

 return$array;

 }

}

// 快速排序

publicfunctionv_sortArray($array) {

 if(!is_array($array) ||count($array)<=1){return$array; }

 if(count($array)>2) {

 $m=$array[floor(count($array)/2)+1];

 }else{

 if($array[0]>$array[1]) {

  $temp=$array[0];

  $array[0] =$array[1];

  $array[1] =$temp;

 }

 return$array;

 }

 $leftarray=array();

 $rightarray=array();

 foreach($arrayas$key=>$v) {

 if($v>$m) {

  $rightarray[] =$v;

 }

 if($v<$m) {

  $leftarray[] =$v;

 }

 if($v==$m) {

  $mid[] =$v;

 }

 }

 $nleftarray=$this->v_sortArray($leftarray);

 $nrightarray=$this->v_sortArray($rightarray);

 returnarray_merge($nleftarray,$mid,$nrightarray);

}

// 直接插入排序

publicfunctioni_sortArray($array) {

 if(!is_array($array) ||count($array)<=1){return$array; }

 $newarray=array($array[0]);

 $temp= 0;

 foreach($arrayas$k=>$v) {

 if($k>0) {

  if($v>=$newarray[count($newarray)-1]) {

  $newarray[] =$v;

  }else{

  foreach($newarrayas$nk=>$nv) {

  if($v<$nv) {

  $temparray=array();

  foreach($newarrayas$ck=>$cv) {

   if($ck<$nk) {

   $temparray[$ck] =$cv;

   }elseif($ck==$nk) {

   $temparray[$ck] =$v;

   $temparray[($ck+1)] =$cv;

   }else{

   $temparray[($ck+1)] =$cv;

   }

  }

  $newarray=$temparray;

  break;

  }

  }

  }

 }

 }

 return$newarray;

}

}

$bevin=newpaixu;

$array=array(5,4,5,4,4,5,5,5,5,5);

$v=$bevin->t_sortArray($array);

print_r($v);

$v=$bevin->c_sortArray($array);

print_r($v);

$v=$bevin->v_sortArray($array);

print_r($v);

$v=$bevin->i_sortArray($array);

print_r($v);

Array

(

  [0] => 4

  [1] => 4

  [2] => 4

  [3] => 5

  [4] => 5

  [5] => 5

  [6] => 5

  [7] => 5

  [8] => 5

  [9] => 5

)

Array

(

  [0] => 4

  [1] => 4

  [2] => 4

  [3] => 5

  [4] => 5

  [5] => 5

  [6] => 5

  [7] => 5

  [8] => 5

  [9] => 5

)

Array

(

  [0] => 4

  [1] => 4

  [2] => 4

  [3] => 5

  [4] => 5

  [5] => 5

  [6] => 5

  [7] => 5

  [8] => 5

  [9] => 5

)

Array

(

  [0] => 4

  [1] => 4

  [2] => 4

  [3] => 5

  [4] => 5

  [5] => 5

  [6] => 5

  [7] => 5

  [8] => 5

  [9] => 5

)