3

给定一个数组：

$arrData = array(
 0 => array (
   'uid'   => 1,
   'name'  => 'label',
   'open'  => 0,
   'close' => 9
 ),
 1 => array (
   'uid'   => 2,
   'name'  => 'label',
   'open'  => 1,
   'close' => 2
 ),
 2 => array (
   'uid'   => 3,
   'name'  => 'label',
   'open'  => 3,
   'close' => 8
 ),
 3 => array (
   'uid'   => 4,
   'name'  => 'label',
   'open'  => 4,
   'close' => 5
 ),
 4 => array (
   'uid'   => 5,
   'name'  => 'label',
   'open'  => 6,
   'close' => 7
 )
);

代表这个结构：

<label>     [0,9]
 <label />  [1,2]
 <label>    [3,8]
  <label /> [4,5]
  <label /> [6,7]
 </label>
</label>

我试图得到一个导致这种格式的数组：

$arrNesting = array(
 0=>array(
   'item'    => array('uid'=>1, 'name'=>'label', 'open'=>0, 'close'=>9),
   'children' => array(
     0=>array(
       'item'     => array('uid'=>2, 'name'=>'label', 'open'=>1, 'close'=>2),
       'children' => array()
     ),
     1=>array(
       'item'     => array('uid'=>3, 'name'=>'label', 'open'=>3, 'close'=>8),
       'children' => array(
         0=>array(
           'item'     => array('uid'=>2, 'name'=>'label', 'open'=>4, 'close'=>5),
           'children' => array()
         ),
         1=>array(
           'item'     => array('uid'=>3, 'name'=>'label', 'open'=>6, 'close'=>7),
           'children' => array()
         )
       )
     )
   )
 )
);

通过这样的函数调用：

// $arrData: Source Data with keys for denoting the left and right node values
// 'open': the key for the left node's value
// 'close': the key for the right node's value
$arrNested = format::nestedSetToArray( $arrData, 'open', 'close' );

到目前为止，我已经尝试过这种格式，假设 $arrData 值将始终按左值升序排列。uid 值“发生”也是按顺序排列的，但不依赖于这样：

public static function nestedSetToArray( $arrData = array(), $openKey='open', $closeKey='close') {
// Hold the current Hierarchy
$arrSets = array();

// Last parent Index, starting from 0
$intIndex = 0;

// Last Opened and Closed Node Values, and maximum node value in this set
$intLastOpened = 0;
$intLastClosed = null;
$intMaxNodeNum = null;

// loop through $arrData
foreach( $arrData as $intKey=>$arrValues) {
  if( !isset( $arrSets[ $intIndex ] )) {
      // Create a parent if one is not set - should happen the first time through
      $arrSets[ $intIndex ] = array ('item'=>$arrValues,'children'=>array());
      $intLastOpened = $arrValues[ $openKey ];
      $intLastClosed = null; // not sure how to set this for checking 2nd IF below
      $intMaxNodeNum = $arrValues[ $closeKey ];
  } else {
      // The current item in $arrData must be a sibling or child of the last one or sibling of an ancestor
      if( $arrValues[ $openKey ] == $intLastOpened + 1) {
         // This is 1 greater then an opening node, so it's a child of it
      } else if( /* condition for sibling */ ) {
         // This is 1 greater than the intLastClosed value - so it's a sibling
      } else if( /* condition for sibling of ancestor */ ) {
         // This starts with a value greater than the parent's closing value...hmm
      }
  }
}

}

任何进一步采取这一措施的指针将不胜感激。

4

1 回答 1

9

这应该有效

$stack = array();
$arraySet = array();


foreach( $arrData as $intKey=>$arrValues) {
    $stackSize = count($stack); //how many opened tags?
    while($stackSize > 0 && $stack[$stackSize-1]['close'] < $arrValues['open']) {
            array_pop($stack); //close sibling and his childrens
            $stackSize--;
        }

    $link =& $arraySet;
    for($i=0;$i<$stackSize;$i++) {
        $link =& $link[$stack[$i]['index']]["children"]; //navigate to the proper children array
    }
    $tmp = array_push($link,  array ('item'=>$arrValues,'children'=>array()));
    array_push($stack, array('index' => $tmp-1, 'close' => $arrValues['close']));

}

return $arraySet;

我跳过参数化的打开和关闭标签，但您可以简单地添加它。

编辑

这里发生了什么：

首先$stack是空的，所以我们跳过while()。然后我们将引用分配给$arraySet，$link因为$stack是空的，所以我们将引用的第一个元素推$link送到$arraySet。array_push() return 1 because this is the new length of$arraySet Next we add an element to the$stack whit values('index' => 0, 'close' => 10)`

下一个元素：现在$stack有 1 个元素，但$stack[0]['close']大于$arrValues['open']for 元素，所以我们跳过 while。我们再次设置对 to 的引用，$arraySet但$link现在有 on 元素，$stack所以我们将$link[$stack[0]['index']]["children"]引用分配给 $link 所以现在$link指向$arraySet[0]["children"]. 现在我们将元素推送到这个子数组。$tmp给我们这个孩子数组的大小，我们将适当的元素推入堆栈。

下一个元素：它看起来与第二个元素完全相同，但一开始我们从堆栈中弹出一个元素。所以在堆栈上的这个迭代之后是两个元素

('index' => 0, 'close' => 10)
('index' => 0, 'close' => 8)

下一个元素：堆栈上有两个元素，但都具有更大的close属性，$arrValues['open'] 因此我们跳过 while 循环。然后在导航部分：

  • $link指向$arraySet
  • 然后到$arraySet[0]["children"]
  • 然后到$arraySet[0]["children"][0]["children"]

我们将元素推送到这个数组。等等...

于 2013-02-03T19:26:13.757 回答