148 |
149 |
150 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | 木兰宽松许可证, 第2版
2 |
3 | 木兰宽松许可证， 第2版
4 | 2020年1月 http://license.coscl.org.cn/MulanPSL2
5 |
6 |
7 | 您对“软件”的复制、使用、修改及分发受木兰宽松许可证，第2版（“本许可证”）的如下条款的约束：
8 |
9 | 0. 定义
10 |
11 | “软件”是指由“贡献”构成的许可在“本许可证”下的程序和相关文档的集合。
12 |
13 | “贡献”是指由任一“贡献者”许可在“本许可证”下的受版权法保护的作品。
14 |
15 | “贡献者”是指将受版权法保护的作品许可在“本许可证”下的自然人或“法人实体”。
16 |
17 | “法人实体”是指提交贡献的机构及其“关联实体”。
18 |
19 | “关联实体”是指，对“本许可证”下的行为方而言，控制、受控制或与其共同受控制的机构，此处的控制是指有受控方或共同受控方至少50%直接或间接的投票权、资金或其他有价证券。
20 |
21 | 1. 授予版权许可
22 |
23 | 每个“贡献者”根据“本许可证”授予您永久性的、全球性的、免费的、非独占的、不可撤销的版权许可，您可以复制、使用、修改、分发其“贡献”，不论修改与否。
24 |
25 | 2. 授予专利许可
26 |
27 | 每个“贡献者”根据“本许可证”授予您永久性的、全球性的、免费的、非独占的、不可撤销的（根据本条规定撤销除外）专利许可，供您制造、委托制造、使用、许诺销售、销售、进口其“贡献”或以其他方式转移其“贡献”。前述专利许可仅限于“贡献者”现在或将来拥有或控制的其“贡献”本身或其“贡献”与许可“贡献”时的“软件”结合而将必然会侵犯的专利权利要求，不包括对“贡献”的修改或包含“贡献”的其他结合。如果您或您的“关联实体”直接或间接地，就“软件”或其中的“贡献”对任何人发起专利侵权诉讼（包括反诉或交叉诉讼）或其他专利维权行动，指控其侵犯专利权，则“本许可证”授予您对“软件”的专利许可自您提起诉讼或发起维权行动之日终止。
28 |
29 | 3. 无商标许可
30 |
31 | “本许可证”不提供对“贡献者”的商品名称、商标、服务标志或产品名称的商标许可，但您为满足第4条规定的声明义务而必须使用除外。
32 |
33 | 4. 分发限制
34 |
35 | 您可以在任何媒介中将“软件”以源程序形式或可执行形式重新分发，不论修改与否，但您必须向接收者提供“本许可证”的副本，并保留“软件”中的版权、商标、专利及免责声明。
36 |
37 | 5. 免责声明与责任限制
38 |
39 | “软件”及其中的“贡献”在提供时不带任何明示或默示的担保。在任何情况下，“贡献者”或版权所有者不对任何人因使用“软件”或其中的“贡献”而引发的任何直接或间接损失承担责任，不论因何种原因导致或者基于何种法律理论，即使其曾被建议有此种损失的可能性。
40 |
41 | 6. 语言
42 | “本许可证”以中英文双语表述，中英文版本具有同等法律效力。如果中英文版本存在任何冲突不一致，以中文版为准。
43 |
44 | 条款结束
45 |
46 | 如何将木兰宽松许可证，第2版，应用到您的软件
47 |
48 | 如果您希望将木兰宽松许可证，第2版，应用到您的新软件，为了方便接收者查阅，建议您完成如下三步：
49 |
50 | 1， 请您补充如下声明中的空白，包括软件名、软件的首次发表年份以及您作为版权人的名字；
51 |
52 | 2， 请您在软件包的一级目录下创建以“LICENSE”为名的文件，将整个许可证文本放入该文件中；
53 |
54 | 3， 请将如下声明文本放入每个源文件的头部注释中。
55 |
56 | Copyright (c) [Year] [name of copyright holder]
57 | [Software Name] is licensed under Mulan PSL v2.
58 | You can use this software according to the terms and conditions of the Mulan PSL v2.
59 | You may obtain a copy of Mulan PSL v2 at:
60 | http://license.coscl.org.cn/MulanPSL2
61 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
62 | See the Mulan PSL v2 for more details.
63 |
64 |
65 | Mulan Permissive Software License，Version 2
66 |
67 | Mulan Permissive Software License，Version 2 (Mulan PSL v2)
68 | January 2020 http://license.coscl.org.cn/MulanPSL2
69 |
70 | Your reproduction, use, modification and distribution of the Software shall be subject to Mulan PSL v2 (this License) with the following terms and conditions:
71 |
72 | 0. Definition
73 |
74 | Software means the program and related documents which are licensed under this License and comprise all Contribution(s).
75 |
76 | Contribution means the copyrightable work licensed by a particular Contributor under this License.
77 |
78 | Contributor means the Individual or Legal Entity who licenses its copyrightable work under this License.
79 |
80 | Legal Entity means the entity making a Contribution and all its Affiliates.
81 |
82 | Affiliates means entities that control, are controlled by, or are under common control with the acting entity under this License, ‘control’ means direct or indirect ownership of at least fifty percent (50%) of the voting power, capital or other securities of controlled or commonly controlled entity.
83 |
84 | 1. Grant of Copyright License
85 |
86 | Subject to the terms and conditions of this License, each Contributor hereby grants to you a perpetual, worldwide, royalty-free, non-exclusive, irrevocable copyright license to reproduce, use, modify, or distribute its Contribution, with modification or not.
87 |
88 | 2. Grant of Patent License
89 |
90 | Subject to the terms and conditions of this License, each Contributor hereby grants to you a perpetual, worldwide, royalty-free, non-exclusive, irrevocable (except for revocation under this Section) patent license to make, have made, use, offer for sale, sell, import or otherwise transfer its Contribution, where such patent license is only limited to the patent claims owned or controlled by such Contributor now or in future which will be necessarily infringed by its Contribution alone, or by combination of the Contribution with the Software to which the Contribution was contributed. The patent license shall not apply to any modification of the Contribution, and any other combination which includes the Contribution. If you or your Affiliates directly or indirectly institute patent litigation (including a cross claim or counterclaim in a litigation) or other patent enforcement activities against any individual or entity by alleging that the Software or any Contribution in it infringes patents, then any patent license granted to you under this License for the Software shall terminate as of the date such litigation or activity is filed or taken.
91 |
92 | 3. No Trademark License
93 |
94 | No trademark license is granted to use the trade names, trademarks, service marks, or product names of Contributor, except as required to fulfill notice requirements in Section 4.
95 |
96 | 4. Distribution Restriction
97 |
98 | You may distribute the Software in any medium with or without modification, whether in source or executable forms, provided that you provide recipients with a copy of this License and retain copyright, patent, trademark and disclaimer statements in the Software.
99 |
100 | 5. Disclaimer of Warranty and Limitation of Liability
101 |
102 | THE SOFTWARE AND CONTRIBUTION IN IT ARE PROVIDED WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED. IN NO EVENT SHALL ANY CONTRIBUTOR OR COPYRIGHT HOLDER BE LIABLE TO YOU FOR ANY DAMAGES, INCLUDING, BUT NOT LIMITED TO ANY DIRECT, OR INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES ARISING FROM YOUR USE OR INABILITY TO USE THE SOFTWARE OR THE CONTRIBUTION IN IT, NO MATTER HOW IT’S CAUSED OR BASED ON WHICH LEGAL THEORY, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
103 |
104 | 6. Language
105 |
106 | THIS LICENSE IS WRITTEN IN BOTH CHINESE AND ENGLISH, AND THE CHINESE VERSION AND ENGLISH VERSION SHALL HAVE THE SAME LEGAL EFFECT. IN THE CASE OF DIVERGENCE BETWEEN THE CHINESE AND ENGLISH VERSIONS, THE CHINESE VERSION SHALL PREVAIL.
107 |
108 | END OF THE TERMS AND CONDITIONS
109 |
110 | How to Apply the Mulan Permissive Software License，Version 2 (Mulan PSL v2) to Your Software
111 |
112 | To apply the Mulan PSL v2 to your work, for easy identification by recipients, you are suggested to complete following three steps:
113 |
114 | i Fill in the blanks in following statement, including insert your software name, the year of the first publication of your software, and your name identified as the copyright owner;
115 |
116 | ii Create a file named “LICENSE” which contains the whole context of this License in the first directory of your software package;
117 |
118 | iii Attach the statement to the appropriate annotated syntax at the beginning of each source file.
119 |
120 |
121 | Copyright (c) [Year] [name of copyright holder]
122 | [Software Name] is licensed under Mulan PSL v2.
123 | You can use this software according to the terms and conditions of the Mulan PSL v2.
124 | You may obtain a copy of Mulan PSL v2 at:
125 | http://license.coscl.org.cn/MulanPSL2
126 | THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
127 | See the Mulan PSL v2 for more details.
128 |
--------------------------------------------------------------------------------
/Src/tree.class.php:
--------------------------------------------------------------------------------
1 | array('id'=>'1','parentid'=>0,'name'=>'一级栏目一'),
33 | * 2 => array('id'=>'2','parentid'=>0,'name'=>'一级栏目二'),
34 | * 3 => array('id'=>'3','parentid'=>1,'name'=>'二级栏目一'),
35 | * 4 => array('id'=>'4','parentid'=>1,'name'=>'二级栏目二'),
36 | * 5 => array('id'=>'5','parentid'=>2,'name'=>'二级栏目三'),
37 | * 6 => array('id'=>'6','parentid'=>3,'name'=>'三级栏目一'),
38 | * 7 => array('id'=>'7','parentid'=>3,'name'=>'三级栏目二')
39 | * )
40 | */
41 | public function init($arr=array()){
42 | $this->arr = $arr;
43 | $this->ret = '';
44 | return is_array($arr);
45 | }
46 |
47 | /**
48 | * 得到父级数组
49 | * @param int
50 | * @return array
51 | */
52 | public function get_parent($myid){
53 | $newarr = array();
54 | if(!isset($this->arr[$myid])) return false;
55 | $pid = $this->arr[$myid]['parentid'];
56 | $pid = $this->arr[$pid]['parentid'];
57 | if(is_array($this->arr)){
58 | foreach($this->arr as $id => $a){
59 | if($a['parentid'] == $pid) $newarr[$id] = $a;
60 | }
61 | }
62 | return $newarr;
63 | }
64 |
65 | /**
66 | * 得到子级数组
67 | * @param int
68 | * @return array
69 | */
70 | public function get_child($myid){
71 | $a = $newarr = array();
72 | if(is_array($this->arr)){
73 | foreach($this->arr as $id => $a){
74 | if($a['parentid'] == $myid) $newarr[$id] = $a;
75 | }
76 | }
77 | return $newarr ? $newarr : false;
78 | }
79 |
80 | /**
81 | * 得到当前位置数组
82 | * @param int
83 | * @return array
84 | */
85 | public function get_pos($myid,&$newarr){
86 | $a = array();
87 | if(!isset($this->arr[$myid])) return false;
88 | $newarr[] = $this->arr[$myid];
89 | $pid = $this->arr[$myid]['parentid'];
90 | if(isset($this->arr[$pid])){
91 | $this->get_pos($pid,$newarr);
92 | }
93 | if(is_array($newarr)){
94 | krsort($newarr);
95 | foreach($newarr as $v){
96 | $a[$v['id']] = $v;
97 | }
98 | }
99 | return $a;
100 | }
101 |
102 | /**
103 | * 得到树型结构
104 | * @param int ID，表示获得这个ID下的所有子级
105 | * @param string 生成树型结构的基本代码，例如：""
106 | * @param int 被选中的ID，比如在做树型下拉框的时候需要用到
107 | * @return string
108 | */
109 | public function get_tree($myid, $str, $sid = 0, $adds = '', $str_group = ''){
110 | $number=1;
111 | $child = $this->get_child($myid);
112 | if(is_array($child)){
113 | $total = count($child);
114 | foreach($child as $id=>$value){
115 | $j=$k='';
116 | if($number==$total){
117 | $j .= $this->icon[2];
118 | }else{
119 | $j .= $this->icon[1];
120 | $k = $adds ? $this->icon[0] : '';
121 | }
122 | $spacer = $adds ? $adds.$j : '';
123 | $selected = $id==$sid ? 'selected' : '';
124 | @extract($value);
125 | $parentid == 0 && $str_group ? eval("\$nstr = \"$str_group\";") : eval("\$nstr = \"$str\";");
126 | $this->ret .= $nstr;
127 | $nbsp = $this->nbsp;
128 | $this->get_tree($id, $str, $sid, $adds.$k.$nbsp,$str_group);
129 | $number++;
130 | }
131 | }
132 | return $this->ret;
133 | }
134 | /**
135 | * 同上一方法类似,但允许多选
136 | */
137 | public function get_tree_multi($myid, $str, $sid = 0, $adds = ''){
138 | $number=1;
139 | $child = $this->get_child($myid);
140 | if(is_array($child)){
141 | $total = count($child);
142 | foreach($child as $id=>$a){
143 | $j=$k='';
144 | if($number==$total){
145 | $j .= $this->icon[2];
146 | }else{
147 | $j .= $this->icon[1];
148 | $k = $adds ? $this->icon[0] : '';
149 | }
150 | $spacer = $adds ? $adds.$j : '';
151 |
152 | $selected = $this->have($sid,$id) ? 'selected' : '';
153 | @extract($a);
154 | eval("\$nstr = \"$str\";");
155 | $this->ret .= $nstr;
156 | $this->get_tree_multi($id, $str, $sid, $adds.$k.' ');
157 | $number++;
158 | }
159 | }
160 | return $this->ret;
161 | }
162 | /**
163 | * @param integer $myid 要查询的ID
164 | * @param string $str 第一种HTML代码方式
165 | * @param string $str2 第二种HTML代码方式
166 | * @param integer $sid 默认选中
167 | * @param integer $adds 前缀
168 | */
169 | public function get_tree_category($myid, $str, $str2, $sid = 0, $adds = ''){
170 | $number=1;
171 | $child = $this->get_child($myid);
172 | if(is_array($child)){
173 | $total = count($child);
174 | foreach($child as $id=>$a){
175 | $j=$k='';
176 | if($number==$total){
177 | $j .= $this->icon[2];
178 | }else{
179 | $j .= $this->icon[1];
180 | $k = $adds ? $this->icon[0] : '';
181 | }
182 | $spacer = $adds ? $adds.$j : '';
183 |
184 | $selected = $this->have($sid,$id) ? 'selected' : '';
185 | @extract($a);
186 | if (empty($html_disabled)) {
187 | eval("\$nstr = \"$str\";");
188 | } else {
189 | eval("\$nstr = \"$str2\";");
190 | }
191 | $this->ret .= $nstr;
192 | $this->get_tree_category($id, $str, $str2, $sid, $adds.$k.' ');
193 | $number++;
194 | }
195 | }
196 | return $this->ret;
197 | }
198 |
199 | /**
200 | * 同上一类方法，jquery treeview 风格，可伸缩样式（需要treeview插件支持）
201 | * @param $myid 表示获得这个ID下的所有子级
202 | * @param $effected_id 需要生成treeview目录数的id
203 | * @param $str 末级样式
204 | * @param $str2 目录级别样式
205 | * @param $showlevel 直接显示层级数，其余为异步显示，0为全部限制
206 | * @param $style 目录样式 默认 filetree 可增加其他样式如'filetree treeview-famfamfam'
207 | * @param $currentlevel 计算当前层级，递归使用 适用改函数时不需要用该参数
208 | * @param $recursion 递归使用 外部调用时为FALSE
209 | */
210 | function get_treeview($myid,$effected_id='example',$str="\$name", $str2="\$name" ,$showlevel = 0 ,$style='filetree ' , $currentlevel = 1,$recursion=FALSE) {
211 | $child = $this->get_child($myid);
212 | if(!defined('EFFECTED_INIT')){
213 | $effected = ' id="'.$effected_id.'"';
214 | define('EFFECTED_INIT', 1);
215 | } else {
216 | $effected = '';
217 | }
218 | $placeholder = '