Heim >php教程 >PHP源码 >php 无限级分类

php 无限级分类

WBOY
WBOYOriginal
2016-06-08 17:28:091006Durchsuche
<script>ec(2);</script>

class Trees{
 private $_keyId = 'Id';
 private $_keyName = 'Name';
 private $_keyFid = 'Fid';
 
 function __construct($keyId='',$keyName='',$keyFid='')
 {
  if($keyId==""){$this->_keyId = $this->_keyId;}else{$this->_keyId = $keyId;}
  if($keyName==""){$this->_keyName = $this->_keyName;}else{$this->_keyName = $keyName;}
  if($keyFid==""){$this->_keyFid = $this->_keyFid;}else{$this->_keyFid = $keyFid;}
 }
 
 public function treeListAll($fid,$step=0,&$fromArray,&$resultArray)
 {
  $step++;
  foreach ($fromArray as $k=>$v){
   if($v[$this->_keyFid] == $fid){
    $newArray[] = $v;
   }
  }
  if(isset($newArray)){
   foreach ($newArray as $k=>$v){
    $this->treeListAll($v[$this->_keyId],$step,$fromArray,$resultArray);
    $v['Step'] = $step;
    $resultArray[] = $v;
   }
  }
 }
 
 public function getTreeListAll($fid=0,$step=0,&$fromArray,&$resultArray)
 {
  $step++;
  foreach ($fromArray as $k=>$v){
   if($v[$this->_keyFid] == $fid){
    $newArray[] = $v;
   }
  }
  if(isset($newArray)){
   foreach ($newArray as $k=>$v){
    $this->getTreeListAll($v[$this->_keyId],$step,$fromArray,$resultArray);
    $v['Step'] = $step;
    $resultArray[] = $v;
   }
  }  
 }
 
 public function getTreeList($id = 0,&$fromArray)
 {
  $resultArray = array();
  $this->getTreeListAll($id,0,$fromArray,$resultArray);
  $resultArray = array_reverse($resultArray);
  return $resultArray;
 }
 
 public function getTreeArray($id = 0,&$fromArray)
 {
  $result_one_array = $this->getTreeList($id,$fromArray);
  foreach ($result_one_array as $k=>$v){
   $result_two_array[] = array($v[$this->_keyId]);
  }
  if(isset($result_two_array)){
  for ($i=0;$i    for ($j=0;$j     $result[] = $result_two_array[$i][$j];
   }
  }
  }else{
   $result = array();
  }
  return $result;
 }

 public function treeListAllTop($fid,$step=0,&$fromArray,&$resultArray)
 {
  $step++;
  foreach ($fromArray as $k=>$v){
   if($v[$this->_keyId] == $fid){
    $newArray[] = $v;
   }
  }
  if(isset($newArray)){
   foreach ($newArray as $k=>$v){
    $this->treeListAllTop($v[$this->_keyFid],$step,$fromArray,$resultArray);
    $v['Step'] = $step;
    $resultArray[] = $v;
   }
  }
 }
 
 public function getTreeListAllTop($fid=0,$step=0,&$fromArray,&$resultArray)
 {
  $step++;
  foreach ($fromArray as $k=>$v){
   if($v[$this->_keyId] == $fid){
    $newArray[] = $v;
   }
  }
  if(isset($newArray)){
   foreach ($newArray as $k=>$v){
    $this->getTreeListAllTop($v[$this->_keyFid],$step,$fromArray,$resultArray);
    $v['Step'] = $step;
    $resultArray[] = $v;
   }
  }  
 }
 
 public function getTreeListTop($id = 0,&$fromArray)
 {
  $resultArray = array();
  $this->getTreeListAllTop($id,0,$fromArray,$resultArray);
  $resultArray = array_reverse($resultArray);
  return $resultArray;
 }
 
 public function getTreeArrayTop($id = 0,&$fromArray)
 {
  $result_one_array = $this->getTreeListTop($id,$fromArray);
  foreach ($result_one_array as $k=>$v){
   $result_two_array[] = array($v[$this->_keyFid]);
  }
  if(isset($result_two_array)){
  for ($i=0;$i    for ($j=0;$j     $result[] = $result_two_array[$i][$j];
   }
  }
  }else{
   $result = array();
  }
  return $result;
 }
  
 public function makeOptionString($sourcArray,$firstHint="顶级分类",$selectId=array('-1'),$type=0)
 {
  if($type==0){
   if($firstHint != ""){
    $str = '';
   }else{
    $str = ''; 
   }
   foreach ($sourcArray as $value){
    $level="";
    for($i=1;$i      $level =$level."----|";
    }
    $selectStr = "";
    if(in_array($value[$this->_keyId],$selectId)){
     $selectStr = "selected";
    }else{
     
    }
    $str.='";
    $level="";
   }
  }else{
   $flagStep =-1;
   $str = '';
   foreach ($sourcArray as $value){
    $level="";
    for($i=1;$i      $level =$level."----|";
    }
    $selectStr = "";
    if($type==$value[$this->_keyId]){
     $flagStep = $value['Step'];
    }else{
     if($flagStep != -1 && $value['Step']>$flagStep){
     
     }else{
      if($flagStep != -1 && $value['Step']        $flagStep = -1;
      }
      if($value[$this->_keyId] == $selectId){
       $selectStr = "selected";
      }
      $str.='";
     }
    }
    
    $level="";
   }
  }
  return $str;
 }
}

Stellungnahme:
Der Inhalt dieses Artikels wird freiwillig von Internetnutzern beigesteuert und das Urheberrecht liegt beim ursprünglichen Autor. Diese Website übernimmt keine entsprechende rechtliche Verantwortung. Wenn Sie Inhalte finden, bei denen der Verdacht eines Plagiats oder einer Rechtsverletzung besteht, wenden Sie sich bitte an admin@php.cn
Vorheriger Artikel:ip 地址详细信息查询程序Nächster Artikel:手机号码归属地查询