• 欢迎访问搞代码网站,推荐使用最新版火狐浏览器和Chrome浏览器访问本网站!
  • 如果您觉得本站非常有看点,那么赶紧使用Ctrl+D 收藏搞代码吧

PHP无限分类的类_php技巧

php 搞代码 4年前 (2022-01-26) 28次浏览 已收录 0个评论
<?php <BR>/** <BR><span>!本文来源gaodai#ma#com搞*!代#%^码网5</span><pre>搞gaodaima代码

* @author YangHuan
* @datetime
* @version 1.0.0
*/

/**
* Short description.
*
* Detail description
* @author
* @version 1.0
* @copyright
* @access public
*/
class Tree
{
/**
* Description
* @var
* @since 1.0
* @access private
*/
var $data = array();

/**
* Description
* @var
* @since 1.0
* @access private
*/
var $child = array(-1=>array());

/**
* Description
* @var
* @since 1.0
* @access private
*/
var $layer = array(-1=>-1);

/**
* Description
* @var
* @since 1.0
* @access private
*/
var $parent = array();

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function Tree ($value)
{
$this->setNode(0, -1, $value);
} // end func

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function setNode ($id, $parent, $value)
{
$parent = $parent?$parent:0;

$this->data[$id] = $value;
$this->child[$id] = array();
$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;
}
} // end func

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getList (&$tree, $root= 0)
{
foreach ($this->child[$root] as $key=>$id)
{
$tree[] = $id;

if ($this->child[$id]) $this->getList($tree, $id);
}
} // end func

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getValue ($id)
{
return $this->data[$id];
} // end func

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getLayer ($id, $space = false)
{
return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id];
} // end func

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getParent ($id)
{
return $this->parent[$id];
} // end func

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getParents ($id)
{
while ($this->parent[$id] != -1)
{
$id = $parent[$this->layer[$id]] = $this->parent[$id];
}

ksort($parent);
reset($parent);

return $parent;
} // end func

/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getChild ($id)
{
return $this->child[$id];
} // end func


/**
* Short description.
*
* Detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getChilds ($id = 0)
{
$child = array($id);
$this->getList($child, $id);

return $child;
} // end func
} // end class

?>

使用方法

PHP代码:

<?php<BR>//new Tree(根目录的名字); <BR>//根目录的ID自动分配为0 <BR>$Tree = new Tree('根目录'); </P><P>//setNode(目录ID,上级ID,目录名字); <BR>$Tree->setNode(1, 0, '目录1'); <BR>$Tree->setNode(2, 0, '目录2'); <BR>$Tree->setNode(3, 0, '目录3'); <BR>$Tree->setNode(4, 3, '目录3.1'); <BR>$Tree->setNode(5, 3, '目录3.2'); <BR>$Tree->setNode(6, 3, '目录3.3'); <BR>$Tree->setNode(7, 2, '目录2.1'); <BR>$Tree->setNode(8, 2, '目录2.2'); <BR>$Tree->setNode(9, 2, '目录2.3'); <BR>$Tree->setNode(10, 6, '目录3.3.1'); <BR>$Tree->setNode(11, 6, '目录3.3.2'); <BR>$Tree->setNode(12, 6, '目录3.3.3'); </P><P>//getChilds(指定目录ID); <BR>//取得指定目录下级目录.如果没有指定目录就由根目录开始 <BR>$category = $Tree->getChilds(); </P><P>//遍历输出 <BR>foreach ($category as $key=>$id) <BR>{ <BR>    echo $Tree->getLayer($id, '|-').$Tree->getValue($id)."<br>\n"; <BR>} <BR>

PHP无限分类-PHP100代码

<?php <BR>//无限分类,从子类找所有父类<BR>//$id 子类ID<BR> function php100_xd($id){<BR>   $sql="select * from fl where id='$id'";<BR>   $q=mysql_query($sql);<BR>   $rs=mysql_fetch_array($q);<BR>   $rs['fid']==0 ? "" : fl($rs['fid']);<BR>   echo $rs['name']."-";<BR>   }<br><br>//读取所有父类下面的子类<BR>//$f顶级分类从什么开始,$s样式<BR> function php100_dx($f=0,$s=""){<BR>   $sql="select * from fl where fid=$f";<BR>   $q=mysql_query($sql);<BR>   $s=$s."-";<BR>   while($rs=mysql_fetch_array($q)){<BR>     echo "<br>$s".$rs['name'];<BR>  flt($rs['id'],$s);<BR>     } <BR>   }<BR>

搞代码网(gaodaima.com)提供的所有资源部分来自互联网,如果有侵犯您的版权或其他权益,请说明详细缘由并提供版权或权益证明然后发送到邮箱[email protected],我们会在看到邮件的第一时间内为您处理,或直接联系QQ:872152909。本网站采用BY-NC-SA协议进行授权
转载请注明原文链接:PHP无限分类的类_php技巧

喜欢 (0)
[搞代码]
分享 (0)
发表我的评论
取消评论

表情 贴图 加粗 删除线 居中 斜体 签到

Hi,您需要填写昵称和邮箱!

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址