|
|
性能消耗是非常大的，要么做遞歸，要么做多次查詢。故，對于分類的數據量很大的情況，我推薦使用左右值，以減少查詢上的麻煩。
復制代碼 代碼如下:
_id
/**
+----------------------------------------------------------
* 構造函數
* @access public
* @return void
+----------------------------------------------------------
*/
public function __construct($left,$right,$id){
parent::__construct();
$this->_left = $left;
$this->_right = $right;
$this->_id = $id;
}
/**
+----------------------------------------------------------
* 根據node$this->_id得到該node的所有值
* @access public
* @param $nodeId
* @return array
+----------------------------------------------------------
*/
public function getNodeById($nodeId)
{
if($nodeId>0)
{
return $this->getById($nodeId);
}
else
{
throw_exception('未知$this->_id');
return false;
}
}
/**
+----------------------------------------------------------
* 獲取父節點,含直屬父類（type=1），所有父類：type=0
* @access public
* @param $nodeId int 節點$this->_id
* @return $parentNode array()
+----------------------------------------------------------
*/
public function getParentNode($nodeId,$type = 0)
{
if($nodeId == 0) throw_exception('未知$this->_id');;
$currentNode = $this->getNodeById($nodeId);
if($currentNode)
{
$condition = " ".$this->_left.'<'.$currentNode[$this->_left].' and '.$this->_right.' >'.$currentNode[$this->_right]." ";
if($type ==1) //直屬父類
{
return $this->where($condition)->order($this->_left." DESC")->limit(1)->find();
// $sql = "SELECT * FROM ".TABLE_NAME." WHERE {$condition} ORDER BY ".$this->_left." DESC LIMIT 1";
// return mysql_query($sql) or die(mysql_error());
}
else if($type ==0)
{
return $this->where($condition)->findAll();
// $sql = "SELECT * FROM ".TABLE_NAME." WHERE {$condition} ";
// return mysql_query($sql) or die(mysql_error());
}
}
else
{
return false;
}
}
/**
+----------------------------------------------------------
* 當前節點下子孫節點總數.子孫總數＝（當前節點的右值 - 當前節點的左值-1）/2
* @access public
* @param $node_id int 節點$this->_id
* @return $amount int 該節點下的子孫總數 *
+----------------------------------------------------------
*/
public function getChildCount($nodeId)
{
$currentNode = $this->getNodeById($nodeId);
if(!empty($currentNode))
{
return (int)($currentNode[$this->_right]-$currentNode[$this->_left] -1)/2;
}
}
/**
+----------------------------------------------------------
* 獲取當前節點下所有子節點。 當 A子類的右節點=B子類左節點-1 則 A、B屬于同一級別
* @access public
* @param $curentId
* @param $type int 0：當前節點下所有子類，1為當前節點下一級子類
* @return bool
+----------------------------------------------------------
*/
public function getChild($nodeId,$type=0)
{
$currentNode = $this->getNodeById($nodeId);
if($currentNode[$this->_left]-$currentNode[$this->_right] ==1)
{
return false; //當 該節點左值 - 右值=1 時，其下沒有子節點。
}
else
{
$condition = $this->_left.'>'.$currentNode[$this->_left].' and '.$this->_right .'<'.$currentNode[$this->_right];
$child = $this->where($condition)->findAll();
if($type == 0)//所有子類
{
return $child;
}
else if($type ==1) //獲取當前節點下一級分類
{
$subArr = array(); //一級子類
foreach ($child as $k=>$sub) {
//子類的左節點=父類左節點+1，則子類為第一個子類
if($sub[$this->_left]==$currentNode[$this->_left]+1)
{
//$right = $sub[$k][$this->_right]; //當前節點的右節點
$firstSub = $sub; //當前節點下第一個子類
array_push($subArr,$firstSub); //子類入棧
unset($child[$k]);
}
}
$rightVal = $firstSub[$this->_right]; //第一個子節點為比較標志
$childCount = count($child);//剩余子節點數
for($i=0;$i<$childCount;$i++) //循環檢索出 同級子節點
{
foreach ($child as $key => $sub2) {
if($rightVal == $sub2[$this->_left]-1)
{
$rightVal = $sub2[$this->_right]; //把循環當前的node的右節點當做比較值
array_push($subArr,$sub2);
unset($child[$key]);
}
}
}
return $subArr;
}
}
}
/**
+----------------------------------------------------------
* 返回當前節點的完整路徑
* @access public
* @param $nodeId
* @return array
+----------------------------------------------------------
*/
public function getSinglePath($nodeId)
{
$sql = "select parent.* from __TABLE__ as node,__TABLE__ as parent where node.{$this->_left} between parent.{$this->_left}
AND parent.{$this->_right} AND node.{$this->_id} = {$nodeId} order by parent.{$this->_left}";
// echo $sql;
return $this->query($sql);
}
/**
+----------------------------------------------------------
* 添加子節點，分3種：0：在當前節點下最后追加一個子節點；1：在當前節點下追加第一個子節點；
2：在當前節點下的某個子節點后追加
復制代碼 代碼如下:
* @access public
* @param $currentId int
* @param $nodeName string 新節點名稱
* @param $targetId int 追加到當前節點下子節點的指定節點后
* @return bool
+----------------------------------------------------------
*/
public function addNode($nodeId,$newData,$type=0,$targetId=0)
{
if(empty($newData))
{
throw_exception('新分類不能為空');
}
$currentNode = $this->getNodeById($nodeId);
switch ($type) {
case 0:
$leftNode = $currentNode[$this->_right]; //新節點的左值為父節點的右值
$rightNode = $leftNode+1;
break;
case 1:
$leftNode = $currentNode[$this->_left]+1; //新節點的左值為父節點的左值+1
$rightNode = $leftNode+1;
break;
case 2:
$otherNode = $this->getNodeById($targetId);
$leftNode = $otherNode[$this->_right]+1;
$rightNode = $leftNode+1;
default:
break;
}
// $sql = "UPDATE ".TABLE_NAME." SET ".$this->_right."=".$this->_right."+2 WHERE ".$this->_right." >= ".$leftNode;
// $sql2 = "UPDATE ".TABLE_NAME." SET ".$this->_left."=".$this->_left."+2 WHERE ".$this->_left.">".$leftNode;
$this->setInc($this->_right,$this->_right.">=".$leftNode,2); //把所有右值大于新節點左值的節點的右值+2,注意效率
$this->setInc($this->_left,$this->_left.">".$leftNode,2); //把所有大于新節點的左值+2
$newData[$this->_left] = (int)$leftNode;
$newData[$this->_right] =(int) $rightNode;
return $this->add($newData);
}
/**
+----------------------------------------------------------
* 刪除節點
* @access public
* @param type 操作類型，默認為0刪除當前節點下的所有子節點，1為刪除包括自身的節點
* @param $nodeId int 要刪除的$this->_id
* @return bool
+----------------------------------------------------------
*/
public function rmNode($nodeId,$type =1)
{
$currentNode = $this->getNodeById($nodeId);
if($type == 1) //刪除包含自身的節點
{
$sql = "DELETE FROM __TABLE__ WHERE ".$this->_left.">= {$currentNode[$this->_left]} AND ".$this->_right."<= {$currentNode[$this->_right]}";
$childCount = ($this->getChildCount($nodeId)+1)*2; //要更新的值
$sql2 = "UPDATE __TABLE__ SET ".$this->_right."=".$this->_right."-".$childCount." WHERE ".$this->_right.">".$currentNode[$this->_right];
$sql3 = "UPDATE __TABLE__ SET ".$this->_left."=".$this->_left."-".$childCount." WHERE ".$this->_left.">".$currentNode[$this->_left];
}
else //刪除當前節點下的所有節點
{
$sql ="DELETE FROM __TABLE__ WHERE ".$this->_left."> {$currentNode[$this->_left]} AND ".$this->_right."< {$currentNode[$this->_right]}";
$childCount = $this->getChildCount($nodeId)*2; //要更新的值
$sql2 = "UPDATE __TABLE__ SET ".$this->_right."=".$this->_right ."-".$childCount." WHERE ".$this->_right.">=".$currentNode[$this->_right];
$sql3 = "UPDATE __TABLE__ SET ".$this->_left."=".$this->_left."-".$childCount." WHERE ".$this->_left.">".$currentNode[$this->_left];
}
$this->execute($sql);
$this->execute($sql2);
$this->execute($sql3);
return true;
}
/**
+----------------------------------------------------------
* 修改節點，名稱等
* @access public
* @param $newData array()必須含有 要修改的$this->_id,k-v必須對齊，如arr['node_name'] = '商品'
* @return bool
+----------------------------------------------------------
*/
public function modiNode($newData)
{
if(!empty($newData))
{
$id = $newData[$this->_id];
unset($newData[$this->_id]);
return $this->save($newData,$this->_id.'='.$id);
}
}
}
?>
php技術：解析thinkphp的左右值無限分類，轉載需保留來源！
鄭重聲明：本文版權歸原作者所有，轉載文章僅為傳播更多信息之目的，如作者信息標記有誤，請第一時間聯系我們修改或刪除，多謝。
