//$data 数组数据 $arr 静态数组 ,树形结构
p
i
d
父
级
i
d
p
u
b
l
i
c
f
u
n
c
t
i
o
n
t
r
e
e
(
pid父级id public function _tree(
pid父级idpublicfunctiont?ree(data,
p
i
d
=
0
,
pid=0,
pid=0,level=1){
static
a
r
r
=
[
]
;
f
o
r
e
a
c
h
(
arr=[]; foreach(
arr=[];foreach(data as KaTeX parse error: Expected '}', got 'EOF' at end of input: v){ if(v[‘p_id’]$pid）{
v
[
′
l
e
v
e
l
]
=
v['level]=
v[′level]=level;
a
r
r
[
]
=
arr[]=
arr[]=v;
_tree(
d
a
t
a
,
data,
data,v[‘id’],$level+1);
}
return $arr;
}
//无限分类
d
a
t
a
数
组
数
据
p
u
b
l
i
c
f
u
n
c
t
i
o
n
g
e
t
T
r
e
e
(
data 数组数据 public function getTree(
data数组数据publicfunctiongetTree(data,$pid=0,){
a
r
r
=
[
]
;
f
o
r
e
a
c
h
(
arr=[]; foreach(
arr=[];foreach(data as KaTeX parse error: Expected '}', got 'EOF' at end of input: v){ if(v[‘pid’]$pid){
v
[
v[
v[key]=$v;
v
[
v[
v[key][‘son’]=getTree(
d
a
t
a
,
data,
data,v[‘id’]);
}
return $array;
}
//无限分类 取他的下级id及当期id
private function get_category_id(
d
a
t
a
,
data,
data,parent_id){
$arr=array();
foreach ($data as $k=>$v ){
if ($v['pid']==$parent_id){
$arr[]=$v['id'];
$arr=array_merge($arr,$this->get_category_id($data,$v['id']));
}
}
return $arr;
}
str_repeat() 函数把字符串重复指定的次数。
列子str_repeat("Shanghai ",5);
Shanghai Shanghai Shanghai Shanghai Shanghai
in_array函数搜索数组中是否存在指定的值。
列子
$people = array(“Bill”, “Steve”, “Mark”, “David”);
if (in_array(“Mark”, $people))
{
echo “匹配已找到”;
}
else
{
echo “匹配未找到”;
}
continue跳出当前循环
break ;跳出整个循环
window.location.href="{:U(‘Bms/Menus/lists’)}";调转页面链接
下一页上一页
php
$data = M(‘Investment’)->field(‘id,en_title as title,image,en_content as content,add_time,sort’)->where(“id=” . $Article_ID)->find(); //上一篇文章查出来
$front = M(‘Investment’)->field(‘id,en_title as title,image,en_content as content,add_time,sort’)->where(“sort<” . $data[‘sort’])->order(‘sort desc’)->limit(‘1’)->find(); //上一篇文章查出来
if ($front) {
$furl = __CONTROLLER__ . '/desc/id/' . $front['id']; //输入上一篇文章的访问路径
} else {
$furl = "javascript:void(0);";
}
//下一页
$after = M('Investment')->field('id,en_title as title,image,en_content as content,add_time,sort')->where("sort>" . $data['sort'])->order('sort asc')->limit('1')->find(); //下一篇文章查出来
//echo M()->getLastSql();
if ($after) {
$aurl = __CONTROLLER__ . '/desc/id/' . $after['id']; //输出下一篇文章的访问路径
} else {
$aurl = "javascript:void(0);";
}
页面
<a href="{$shang}">{$previous_shang}：{$front['title']?$front['title']:$Without}</a>
<a href="{$xia}">{$previous_xia}：{$after['title']?$after['title']:$Without}</a>
TP
模板首尾分离
