PHP无限级递归及非无限级递归方法
2017-02-16 14:20:03
/* * ************** 无限级分类递归方法 ********************* */
function findChild(&$arr, $id)
{
$childs = array();
foreach ($arr as $k => $v) {
if ($v['parentid'] == $id) {
$childs[] = $v;
}
}
return $childs;
}
function buildTree($root_id)
{
global $rows;
$childs = findChild($rows, $root_id);
if (empty($childs)) {
return null;
}
foreach ($childs as $k => $v) {
$rescurTree = buildTree($v[id]);
if (null != $rescurTree) {
$childs[$k]['childs'] = $rescurTree;
}
}
return $childs;
}
/* * ************** 无限级分类递归方法 ********************* */
/* * ************** 无限级分类非递归方法 ********************* */
/**
* $list = array(
* array('id'=>1, 'fid'=>0, 'title' => '中国'),
* array('id'=>2, 'fid'=>1, 'title' => '江苏'),
* array('id'=>3, 'fid'=>1, 'title' => '安徽'),
* array('id'=>4, 'fid'=>8, 'title' => '江阴'),
* array('id'=>5, 'fid'=>3, 'title' => '芜湖'),
* array('id'=>6, 'fid'=>3, 'title' => '合肥'),
* array('id'=>7, 'fid'=>3, 'title' => '蚌埠'),
* array('id'=>8, 'fid'=>8, 'title' => '无锡')
* );
* 查找某一分类的所有子类
*
* $children = getTreeChild($list, 0);
* echo implode(',', $children); // 输出：1,3,2,7,6,5,8,4
*
* 查找某一分类的所有父类
* $children = getTreeParent($list, 4);
* echo implode(',', $children); //8, 2, 10
* 输出option列表形式
*
*
*
*
*
*
*
*
*
* $options = getTreeOption($list, 1);
* foreach($options as $op) {
* echo '
* }
*
* 输出ul列表形式
*
*
*
江苏
*
*
*
无锡
*
*
*
江阴
*
*
*
*
*
*
*
安徽
*
*
芜湖
*
合肥
*
蚌埠
*
*
*
*
* @param type $data
* @param type $fid
* @param type $fidField 父级的字段名 默认为 fid
* @param type $idField 当前要递归的ID字段名 默认为 id
* @param type $titleField 名称字段名 默认为 title
* @return type
*/
function getTreeChild($data, $fid, $fidField = 'fid', $idField = 'id')
{
$result = array();
$fids = array($fid);
do {
$cids = array();
$flag = false;
foreach ($fids as $fid) {
for ($i = count($data) - 1; $i >= 0; $i--) {
$node = $data[$i];
if ($node[$fidField] == $fid) {
array_splice($data, $i, 1);
$result[] = $node[$idField];
$cids[] = $node[$idField];
$flag = true;
}
}
}
$fids = $cids;
} while ($flag === true);
return $result;
}
function getTreeParent($data, $id, $fidField = 'fid', $idField = 'id')
{
$result = array();
$obj = array();
foreach ($data as $node) {
$obj[$node[$idField]] = $node;
}
$value = isset($obj[$id]) ? $obj[$id] : null;
while ($value) {
$id = null;
foreach ($data as $node) {
if ($node[$idField] == $value[$fidField]) {
$id = $node[$idField];
$result[] = $node[$idField];
break;
}
}
if ($id === null) {
$result[] = $value[$fidField];
}
$value = isset($obj[$id]) ? $obj[$id] : null;
}
unset($obj);
return $result;
}
function getTreeUl($data, $fid, $fidField = 'fid', $idField = 'id', $titleField = 'title')
{
$stack = array($fid);
$child = array();
$added_left = array();
$added_right = array();
$html_left = array();
$html_right = array();
$obj = array();
$loop = 0;
foreach ($data as $node) {
$pid = $node[$fidField];
if (!isset($child[$pid])) {
$child[$pid] = array();
}
array_push($child[$pid], $node[$idField]);
$obj[$node[$idField]] = $node;
}
while (count($stack) > 0) {
$id = $stack[0];
$flag = false;
$node = isset($obj[$id]) ? $obj[$id] : null;
if (isset($child[$id])) {
$cids = $child[$id];
$length = count($cids);
for ($i = $length - 1; $i >= 0; $i--) {
array_unshift($stack, $cids[$i]);
}
$obj[$cids[$length - 1]]['isLastChild'] = true;
$obj[$cids[0]]['isFirstChild'] = true;
$flag = true;
}
if ($id != $fid && $node && !isset($added_left[$id])) {
if (isset($node['isFirstChild']) && isset($node['isLastChild'])) {
$html_left[] = '';
} else if (isset($node['isFirstChild'])) {
$html_left[] = '';
} else if (isset($node['isLastChild'])) {
$html_left[] = '';
} else {
$html_left[] = '';
}
$html_left[] = ($flag === true) ? "
{$node[$titleField]}
- " : "
{$node[$titleField]}
";$added_left[$id] = true;
}
if ($id != $fid && $node && !isset($added_right[$id])) {
$html_right[] = ($flag === true) ? '' : '';
$added_right[$id] = true;
}
if ($flag == false) {
if ($node) {
$cids = $child[$node[$fidField]];
for ($i = count($cids) - 1; $i >= 0; $i--) {
if ($cids[$i] == $id) {
array_splice($child[$node[$fidField]], $i, 1);
break;
}
}
if (count($child[$node[$fidField]]) == 0) {
$child[$node[$fidField]] = null;
}
}
array_push($html_left, array_pop($html_right));
array_shift($stack);
}
$loop++;
if ($loop > 5000) {
return $html_left;
}
}
unset($child);
unset($obj);
return implode('', $html_left);
}
function getTreeOption($data, $fid, $fidField = 'fid', $idField = 'id')
{
$stack = array($fid);
$child = array();
$added = array();
$options = array();
$obj = array();
$loop = 0;
$depth = -1;
foreach ($data as $node) {
$pid = $node[$fidField];
if (!isset($child[$pid])) {
$child[$pid] = array();
}
array_push($child[$pid], $node[$idField]);
$obj[$node[$idField]] = $node;
}
while (count($stack) > 0) {
$id = $stack[0];
$flag = false;
$node = isset($obj[$id]) ? $obj[$id] : null;
if (isset($child[$id])) {
for ($i = count($child[$id]) - 1; $i >= 0; $i--) {
array_unshift($stack, $child[$id][$i]);
}
$flag = true;
}
if ($id != $fid && $node && !isset($added[$id])) {
$node['depth'] = $depth;
$options[] = $node;
$added[$id] = true;
}
if ($flag == true) {
$depth++;
} else {
if ($node) {
for ($i = count($child[$node[$fidField]]) - 1; $i >= 0; $i--) {
if ($child[$node[$fidField]][$i] == $id) {
array_splice($child[$node[$fidField]], $i, 1);
break;
}
}
if (count($child[$node[$fidField]]) == 0) {
$child[$node[$fidField]] = null;
$depth--;
}
}
array_shift($stack);
}
$loop++;
if ($loop > 5000) {
return $options;
}
}
unset($child);
unset($obj);
return $options;
}
/* * ************** 无限级分类非递归方法 ********************* */
发表评论：