tree.class.php 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272
  1. <?php
  2. /**
  3. * 通用的树型类,可以生成任何树型结构
  4. */
  5. class tree {
  6. /**
  7. * 生成树型结构所需要的2维数组
  8. * @var array
  9. */
  10. public $arr = array();
  11. /**
  12. * 生成树型结构所需修饰符号,可以换成图片
  13. * @var array
  14. */
  15. public $icon = array('│','├','└');
  16. public $nbsp = "&nbsp;";
  17. /**
  18. * @access private
  19. */
  20. public $ret = '';
  21. /**
  22. * 构造函数,初始化类
  23. * @param array 2维数组,例如:
  24. * array(
  25. * 1 => array('id'=>'1','parentid'=>0,'name'=>'一级栏目一'),
  26. * 2 => array('id'=>'2','parentid'=>0,'name'=>'一级栏目二'),
  27. * 3 => array('id'=>'3','parentid'=>1,'name'=>'二级栏目一'),
  28. * 4 => array('id'=>'4','parentid'=>1,'name'=>'二级栏目二'),
  29. * 5 => array('id'=>'5','parentid'=>2,'name'=>'二级栏目三'),
  30. * 6 => array('id'=>'6','parentid'=>3,'name'=>'三级栏目一'),
  31. * 7 => array('id'=>'7','parentid'=>3,'name'=>'三级栏目二')
  32. * )
  33. */
  34. public function init($arr=array()){
  35. $this->arr = $arr;
  36. $this->ret = '';
  37. return is_array($arr);
  38. }
  39. /**
  40. * 得到父级数组
  41. * @param int
  42. * @return array
  43. */
  44. public function get_parent($myid){
  45. $newarr = array();
  46. if(!isset($this->arr[$myid])) return false;
  47. $pid = $this->arr[$myid]['parentid'];
  48. $pid = $this->arr[$pid]['parentid'];
  49. if(is_array($this->arr)){
  50. foreach($this->arr as $id => $a){
  51. if($a['parentid'] == $pid) $newarr[$id] = $a;
  52. }
  53. }
  54. return $newarr;
  55. }
  56. /**
  57. * 得到子级数组
  58. * @param int
  59. * @return array
  60. */
  61. public function get_child($myid){
  62. $a = $newarr = array();
  63. if(is_array($this->arr)){
  64. foreach($this->arr as $id => $a){
  65. if($a['parentid'] == $myid) $newarr[$id] = $a;
  66. }
  67. }
  68. return $newarr ? $newarr : false;
  69. }
  70. /**
  71. * 得到当前位置数组
  72. * @param int
  73. * @return array
  74. */
  75. public function get_pos($myid,&$newarr){
  76. $a = array();
  77. if(!isset($this->arr[$myid])) return false;
  78. $newarr[] = $this->arr[$myid];
  79. $pid = $this->arr[$myid]['parentid'];
  80. if(isset($this->arr[$pid])){
  81. $this->get_pos($pid,$newarr);
  82. }
  83. if(is_array($newarr)){
  84. krsort($newarr);
  85. foreach($newarr as $v){
  86. $a[$v['id']] = $v;
  87. }
  88. }
  89. return $a;
  90. }
  91. /**
  92. * 得到树型结构
  93. * @param int ID,表示获得这个ID下的所有子级
  94. * @param string 生成树型结构的基本代码,例如:"<option value=\$id \$selected>\$spacer\$name</option>"
  95. * @param int 被选中的ID,比如在做树型下拉框的时候需要用到
  96. * @return string
  97. */
  98. public function get_tree($myid, $str, $sid = 0, $adds = '', $str_group = ''){
  99. $number=1;
  100. $child = $this->get_child($myid);
  101. if(is_array($child)){
  102. $total = count($child);
  103. foreach($child as $id=>$value){
  104. $j=$k='';
  105. if($number==$total){
  106. $j .= $this->icon[2];
  107. }else{
  108. $j .= $this->icon[1];
  109. $k = $adds ? $this->icon[0] : '';
  110. }
  111. $spacer = $adds ? $adds.$j : '';
  112. $selected = $id==$sid ? 'selected' : '';
  113. @extract($value);
  114. $parentid == 0 && $str_group ? eval("\$nstr = \"$str_group\";") : eval("\$nstr = \"$str\";");
  115. $this->ret .= $nstr;
  116. $nbsp = $this->nbsp;
  117. $this->get_tree($id, $str, $sid, $adds.$k.$nbsp,$str_group);
  118. $number++;
  119. }
  120. }
  121. return $this->ret;
  122. }
  123. /**
  124. * 同上一方法类似,但允许多选
  125. */
  126. public function get_tree_multi($myid, $str, $sid = 0, $adds = ''){
  127. $number=1;
  128. $child = $this->get_child($myid);
  129. if(is_array($child)){
  130. $total = count($child);
  131. foreach($child as $id=>$a){
  132. $j=$k='';
  133. if($number==$total){
  134. $j .= $this->icon[2];
  135. }else{
  136. $j .= $this->icon[1];
  137. $k = $adds ? $this->icon[0] : '';
  138. }
  139. $spacer = $adds ? $adds.$j : '';
  140. $selected = $this->have($sid,$id) ? 'selected' : '';
  141. @extract($a);
  142. eval("\$nstr = \"$str\";");
  143. $this->ret .= $nstr;
  144. $this->get_tree_multi($id, $str, $sid, $adds.$k.'&nbsp;');
  145. $number++;
  146. }
  147. }
  148. return $this->ret;
  149. }
  150. /**
  151. * @param integer $myid 要查询的ID
  152. * @param string $str 第一种HTML代码方式
  153. * @param string $str2 第二种HTML代码方式
  154. * @param integer $sid 默认选中
  155. * @param integer $adds 前缀
  156. */
  157. public function get_tree_category($myid, $str, $str2, $sid = 0, $adds = ''){
  158. $number=1;
  159. $child = $this->get_child($myid);
  160. if(is_array($child)){
  161. $total = count($child);
  162. foreach($child as $id=>$a){
  163. $j=$k='';
  164. if($number==$total){
  165. $j .= $this->icon[2];
  166. }else{
  167. $j .= $this->icon[1];
  168. $k = $adds ? $this->icon[0] : '';
  169. }
  170. $spacer = $adds ? $adds.$j : '';
  171. $selected = $this->have($sid,$id) ? 'selected' : '';
  172. @extract($a);
  173. if (empty($html_disabled)) {
  174. eval("\$nstr = \"$str\";");
  175. } else {
  176. eval("\$nstr = \"$str2\";");
  177. }
  178. $this->ret .= $nstr;
  179. $this->get_tree_category($id, $str, $str2, $sid, $adds.$k.'&nbsp;');
  180. $number++;
  181. }
  182. }
  183. return $this->ret;
  184. }
  185. /**
  186. * 同上一类方法,jquery treeview 风格,可伸缩样式(需要treeview插件支持)
  187. * @param $myid 表示获得这个ID下的所有子级
  188. * @param $effected_id 需要生成treeview目录数的id
  189. * @param $str 末级样式
  190. * @param $str2 目录级别样式
  191. * @param $showlevel 直接显示层级数,其余为异步显示,0为全部限制
  192. * @param $style 目录样式 默认 filetree 可增加其他样式如'filetree treeview-famfamfam'
  193. * @param $currentlevel 计算当前层级,递归使用 适用改函数时不需要用该参数
  194. * @param $recursion 递归使用 外部调用时为FALSE
  195. */
  196. function get_treeview($myid,$effected_id='example',$str="<span class='file'>\$name</span>", $str2="<span class='folder'>\$name</span>" ,$showlevel = 0 ,$style='filetree ' , $currentlevel = 1,$recursion=FALSE) {
  197. $child = $this->get_child($myid);
  198. if(!defined('EFFECTED_INIT')){
  199. $effected = ' id="'.$effected_id.'"';
  200. define('EFFECTED_INIT', 1);
  201. } else {
  202. $effected = '';
  203. }
  204. $placeholder = '<ul><li><span class="placeholder"></span></li></ul>';
  205. if(!$recursion) $this->str .='<ul'.$effected.' class="'.$style.'">';
  206. foreach($child as $id=>$a) {
  207. @extract($a);
  208. if($showlevel > 0 && $showlevel == $currentlevel && $this->get_child($id)) $folder = 'hasChildren'; //如设置显示层级模式@2011.07.01
  209. $floder_status = isset($folder) ? ' class="'.$folder.'"' : '';
  210. $this->str .= $recursion ? '<ul><li'.$floder_status.' id=\''.$id.'\'>' : '<li'.$floder_status.' id=\''.$id.'\'>';
  211. $recursion = FALSE;
  212. if($this->get_child($id)){
  213. eval("\$nstr = \"$str2\";");
  214. $this->str .= $nstr;
  215. if($showlevel == 0 || ($showlevel > 0 && $showlevel > $currentlevel)) {
  216. $this->get_treeview($id, $effected_id, $str, $str2, $showlevel, $style, $currentlevel+1, TRUE);
  217. } elseif($showlevel > 0 && $showlevel == $currentlevel) {
  218. $this->str .= $placeholder;
  219. }
  220. } else {
  221. eval("\$nstr = \"$str\";");
  222. $this->str .= $nstr;
  223. }
  224. $this->str .=$recursion ? '</li></ul>': '</li>';
  225. }
  226. if(!$recursion) $this->str .='</ul>';
  227. return $this->str;
  228. }
  229. /**
  230. * 获取子栏目json
  231. * Enter description here ...
  232. * @param unknown_type $myid
  233. */
  234. public function creat_sub_json($myid, $str='') {
  235. $sub_cats = $this->get_child($myid);
  236. $n = 0;
  237. if(is_array($sub_cats)) foreach($sub_cats as $c) {
  238. $data[$n]['id'] = iconv(CHARSET,'utf-8',$c['catid']);
  239. if($this->get_child($c['catid'])) {
  240. $data[$n]['liclass'] = 'hasChildren';
  241. $data[$n]['children'] = array(array('text'=>'&nbsp;','classes'=>'placeholder'));
  242. $data[$n]['classes'] = 'folder';
  243. $data[$n]['text'] = iconv(CHARSET,'utf-8',$c['catname']);
  244. } else {
  245. if($str) {
  246. @extract(array_iconv($c,CHARSET,'utf-8'));
  247. eval("\$data[$n]['text'] = \"$str\";");
  248. } else {
  249. $data[$n]['text'] = iconv(CHARSET,'utf-8',$c['catname']);
  250. }
  251. }
  252. $n++;
  253. }
  254. return json_encode($data);
  255. }
  256. private function have($list,$item){
  257. return(strpos(',,'.$list.',',','.$item.','));
  258. }
  259. }
  260. ?>