class Tree { var $data = array(); var $child = array(-1 => array()); var $layer = array(-1 => -1); var $parent = array(); var $countid = 0; function Tree($value='') {} function setNode($id, $parent, $value) { $parent = $parent?$parent:0; $this->data[$id] = $value; $this->child[$parent][] = $id; $this->parent[$id] = $parent; if(!isset($this->layer[$parent])) { $this->layer[$id] = 0; } else { $this->layer[$id] = $this->layer[$parent] + 1; } } function getList(&$tree, $root= 0) { if(is_array($this->child[$root] )) { foreach($this->child[$root] as $key => $id) { $tree[] = $id; if($this->child[$id]) $this->getList($tree, $id); } }else{ } } function getValue($id) { return $this->data[$id]; } function reSetLayer($id) { if($this->parent[$id]) { $this->layer[$this->countid] = $this->layer[$this->countid] + 1; $this->reSetLayer($this->parent[$id]); } } function getLayer($id, $space = false) { $this->layer[$id] = 0; $this->countid = $id; $this->reSetLayer($id); return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id]; } function getParent($id) { return $this->parent[$id]; } function getParents($id) { while($this->parent[$id] != -1) { $id = $parent[$this->layer[$id]] = $this->parent[$id]; } ksort($parent); reset($parent); return $parent; } function getChild($id) { return $this->child[$id]; } function getChilds($id = 0) { $child = array(); $this->getList($child, $id); return $child; } }
php工具类之【tree类】
猜你喜欢
转载自student-lp.iteye.com/blog/2104020
今日推荐
周排行