array('id'=>'1','parent_id'=>0,'name'=>'一级栏目一'), * 2 => array('id'=>'2','parent_id'=>0,'name'=>'一级栏目二'), * 3 => array('id'=>'3','parent_id'=>1,'name'=>'二级栏目一'), * 4 => array('id'=>'4','parent_id'=>1,'name'=>'二级栏目二'), * 5 => array('id'=>'5','parent_id'=>2,'name'=>'二级栏目三'), * 6 => array('id'=>'6','parent_id'=>3,'name'=>'三级栏目一'), * 7 => array('id'=>'7','parent_id'=>3,'name'=>'三级栏目二') * ) * @return array */ public function init($arr = []) { $this->arr = $arr; $this->ret = ''; return is_array($arr); } /** * 得到父级数组 * @param int * @return array */ public function getParent($myId) { $newArr = []; if (!isset($this->arr[$myId])) return false; $pid = $this->arr[$myId]['parent_id']; $pid = $this->arr[$pid]['parent_id']; if (is_array($this->arr)) { foreach ($this->arr as $id => $a) { if ($a['parent_id'] == $pid) $newArr[$id] = $a; } } return $newArr; } /** * 得到子级数组 * @param int * @return array */ public function getChild($myId) { $newArr = []; if (is_array($this->arr)) { foreach ($this->arr as $id => $a) { if ($a['parent_id'] == $myId) { $newArr[$id] = $a; } } } return $newArr ? $newArr : false; } /** * 得到当前位置数组 * @param int * @return array */ public function getPosition($myId, &$newArr) { $a = []; if (!isset($this->arr[$myId])) return false; $newArr[] = $this->arr[$myId]; $pid = $this->arr[$myId]['parent_id']; if (isset($this->arr[$pid])) { $this->getPosition($pid, $newArr); } if (is_array($newArr)) { krsort($newArr); foreach ($newArr as $v) { $a[$v['id']] = $v; } } return $a; } /** * 得到树型结构 * @param int ID,表示获得这个ID下的所有子级 * @param string 生成树型结构的基本代码,例如:"" * @param int 被选中的ID,比如在做树型下拉框的时候需要用到 * @return string */ public function getTree($myId, $str, $sid = 0, $adds = '', $str_group = '') { $number = 1; //一级栏目 $child = $this->getChild($myId); if (is_array($child)) { $total = count($child); foreach ($child as $key => $value) { $j = $k = ''; if ($number == $total) { $j .= $this->icon[2]; } else { $j .= $this->icon[1]; $k = $adds ? $this->icon[0] : ''; } $spacer = $adds ? $adds . $j : ''; $selected = $value['id'] == $sid ? 'selected' : ''; $id = 0; $nstr = ''; $parentId = $value['parent_id']; @extract($value); $parentId == 0 && $str_group ? eval("\$nstr = \"$str_group\";") : eval("\$nstr = \"$str\";"); $this->ret .= $nstr; $nbsp = $this->nbsp; $this->getTree($id, $str, $sid, $adds . $k . $nbsp, $str_group); $number++; } } return $this->ret; } /** * 生成树型结构数组 * @param int myID,表示获得这个ID下的所有子级 * @param int $maxLevel 最大获取层级,默认不限制 * @param int $level 当前层级,只在递归调用时使用,真实使用时不传入此参数 * @return array */ public function getTreeArray($myId, $maxLevel = 0, $level = 1) { $returnArray = []; //一级数组 $children = $this->getChild($myId); if (is_array($children)) { foreach ($children as $child) { $child['_level'] = $level; $returnArray[$child['id']] = $child; if ($maxLevel === 0 || ($maxLevel !== 0 && $maxLevel > $level)) { $mLevel = $level + 1; $returnArray[$child['id']]["children"] = $this->getTreeArray($child['id'], $maxLevel, $mLevel); } } } return $returnArray; } /** * 同上一方法类似,但允许多选 */ public function getTreeMulti($myId, $str, $sid = 0, $adds = '') { $number = 1; $child = $this->getChild($myId); if (is_array($child)) { $total = count($child); foreach ($child as $id => $a) { $j = $k = ''; if ($number == $total) { $j .= $this->icon[2]; } else { $j .= $this->icon[1]; $k = $adds ? $this->icon[0] : ''; } $spacer = $adds ? $adds . $j : ''; $selected = $this->have($sid, $id) ? 'selected' : ''; @extract($a); eval("\$nstr = \"$str\";"); $this->ret .= $nstr; $this->getTreeMulti($id, $str, $sid, $adds . $k . ' '); $number++; } } return $this->ret; } /** * @param integer $myId 要查询的ID * @param string $str 第一种HTML代码方式 * @param string $str2 第二种HTML代码方式 * @param integer $sid 默认选中 * @param integer $adds 前缀 */ public function getTreeCategory($myId, $str, $str2, $sid = 0, $adds = '') { $number = 1; $child = $this->getChild($myId); if (is_array($child)) { $total = count($child); foreach ($child as $id => $a) { $j = $k = ''; if ($number == $total) { $j .= $this->icon[2]; } else { $j .= $this->icon[1]; $k = $adds ? $this->icon[0] : ''; } $spacer = $adds ? $adds . $j : ''; $selected = $this->have($sid, $id) ? 'selected' : ''; @extract($a); if (empty($html_disabled)) { eval("\$nstr = \"$str\";"); } else { eval("\$nstr = \"$str2\";"); } $this->ret .= $nstr; $this->getTreeCategory($id, $str, $str2, $sid, $adds . $k . ' '); $number++; } } return $this->ret; } /** * 同上一类方法,jquery treeview 风格,可伸缩样式(需要treeview插件支持) * @param $myId 表示获得这个ID下的所有子级 * @param $effected_id 需要生成treeview目录数的id * @param $str 末级样式 * @param $str2 目录级别样式 * @param $showlevel 直接显示层级数,其余为异步显示,0为全部限制 * @param $style 目录样式 默认 filetree 可增加其他样式如'filetree treeview-famfamfam' * @param $currentlevel 计算当前层级,递归使用 适用改函数时不需要用该参数 * @param $recursion 递归使用 外部调用时为FALSE * @return string */ function getTreeView($myId, $effected_id = 'example', $str = "\$name", $str2 = "\$name", $showlevel = 0, $style = 'filetree ', $currentlevel = 1, $recursion = FALSE) { $child = $this->getChild($myId); if (!defined('EFFECTED_INIT')) { $effected = ' id="' . $effected_id . '"'; define('EFFECTED_INIT', 1); } else { $effected = ''; } $placeholder = '