Home > php教程 > php手册 > 无限级分类,级分类

无限级分类,级分类

WBOY
Release: 2016-06-13 08:40:43
Original
1015 people have browsed it

无限级分类,级分类

public function getlist($pid = 0, &$result=array(), $spac = 0){<br>    $spac += 2;<br>    $list = M('liuyan')->where('pid='.$pid)->select();<br>    foreach($list as $val){<br>        $val['content'] = str_repeat('',$spac).$val['content'];<br>        $result[] = $val;<br>        $this->getlist($val['id'], $result, $spac);<br>    }<br>    return $result;<br>}
Copy after login
  function genTree($items,$id='id',$pid='pid',$son = 'children'){     $tree = array(); //格式化的树     $tmpMap = array();  //临时扁平数据           foreach ($items as $item) {         $tmpMap[$item[$id]] = $item;     }           foreach ($items as $item) {         if (isset($tmpMap[$item[$pid]])) {             $tmpMap[$item[$pid]][$son][] = &amp;$tmpMap[$item[$id]];         } else {             $tree[] = &$tmpMap[$item[$id]];         }     }     unset($tmpMap);     return $tree; }   $items1 = array(         array('id' => 1, 'pid' => 0, 'name' => '一级11' ),         array('id' => 11, 'pid' => 0, 'name' => '一级12' ),         array('id' => 2, 'pid' => 1, 'name' => '二级21' ),         array('id' => 10, 'pid' => 11, 'name' => '二级22' ),         array('id' => 3, 'pid' => 1, 'name' => '二级23' ),         array('id' => 12, 'pid' => 11, 'name' => '二级24' ),         array('id' => 9, 'pid' => 1, 'name' => '二级25' ),         array('id' => 14, 'pid' => 1, 'name' => '二级26' ),         array('id' => 4, 'pid' => 9, 'name' => '三级31' ),         array('id' => 6, 'pid' => 9, 'name' => '三级32' ),         array('id' => 7, 'pid' => 4, 'name' => '四级41' ),         array('id' => 8, 'pid' => 4, 'name' => '四级42' ),         array('id' => 5, 'pid' => 4, 'name' => '四级43' ),         array('id' => 13, 'pid' => 4, 'name' => '四级44' ),         array('id' => 15, 'pid' => 8, 'name' => '五级51' ),         array('id' => 16, 'pid' => 8, 'name' => '五级52' ),         array('id' => 17, 'pid' => 8, 'name' => '五级53' ),         array('id' => 18, 'pid' => 16, 'name' => '六级64' ), ); var_dump(genTree($items1));
source:php.cn
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Popular Recommendations
Popular Tutorials
More>
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template