无限型将排序的一维数组压制成-PHP源码

init($opt);
}

private function get_row_value($pos){
if(!$this->row_keys){
$this->row_keys=array_keys($this->row);
}
return $this->row[$this->row_keys[$pos]];
}

function init($opt){
if($opt[&＃39;id_names&＃39;] && is_array($opt[&＃39;id_names&＃39;])){
$this->id_names=$opt[&＃39;id_names&＃39;];
}
if($opt[&＃39;data_names&＃39;] && is_array($opt[&＃39;data_names&＃39;])){
$this->data_names=$opt[&＃39;data_names&＃39;];
}
}
function pick(&$row){
$this->row=$row;
$this->row_size=sizeof($row);
$this->smash($this->tree);
}
function get_tree(){
return $this->tree;
}
private function smash(&$node,$key_index=0){
$id_name=$this->get_id_name($key_index);
$data_name=$this->get_data_name($key_index);
if(sizeof($this->row)<$key_index){
return;
}
if(!sizeof($node)){
if((sizeof($this->row)-1)==($key_index)){
$node[]=$this->get_row_value($key_index);
return;
}else{
$node[]=[
$id_name=>$this->get_row_value($key_index),
$data_name=>[]
];
}
$new_node=&$node[0][$data_name];
$node=&$new_node;
}else{
$size=sizeof($node);
if( ($this->row_size-1) == $key_index){
$node[]=$this->get_row_value($key_index);
return;
}
if( ($node[$size-1][$id_name]) == ($this->get_row_value($key_index)) ){
$next_node=&$node[$size-1][$data_name];
$node=&$next_node;
}else{
$node[]=[
$id_name=>$this->get_row_value($key_index),
$data_name=>[]
];
$size=sizeof($node);
$next_node=&$node[$size-1][$data_name];
$node=&$next_node;
}
}
$this->smash($node,++$key_index);
}
private function get_id_name($k){
if($this->id_names && $this->id_names[$k]){
return $this->id_names[$k];
}else{
return &＃39;id&＃39;;
}
}
private function get_data_name($k){
if($this->data_names && $this->data_names[$k]){
return $this->data_names[$k];
}else{
return &＃39;data&＃39;;
}
}
}

?>

$a=[
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>11,&＃39;ymd&＃39;=>1,&＃39;v&＃39;=>1],
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>11,&＃39;ymd&＃39;=>2,&＃39;v&＃39;=>2],
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>11,&＃39;ymd&＃39;=>3,&＃39;v&＃39;=>3],
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>11,&＃39;ymd&＃39;=>4,&＃39;v&＃39;=>4],
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>12,&＃39;ymd&＃39;=>2,&＃39;v&＃39;=>5],
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>12,&＃39;ymd&＃39;=>3,&＃39;v&＃39;=>6],
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>12,&＃39;ymd&＃39;=>4,&＃39;v&＃39;=>7],
[&＃39;depid&＃39;=>1,&＃39;uid&＃39;=>12,&＃39;ymd&＃39;=>5,&＃39;v&＃39;=>8],
[&＃39;depid&＃39;=>2,&＃39;uid&＃39;=>2,&＃39;ymd&＃39;=>1,&＃39;v&＃39;=>9],
[&＃39;depid&＃39;=>2,&＃39;uid&＃39;=>2,&＃39;ymd&＃39;=>2,&＃39;v&＃39;=>10],
[&＃39;depid&＃39;=>2,&＃39;uid&＃39;=>2,&＃39;ymd&＃39;=>3,&＃39;v&＃39;=>11],
[&＃39;depid&＃39;=>2,&＃39;uid&＃39;=>2,&＃39;ymd&＃39;=>3,&＃39;v&＃39;=>12]
];
$r=[];
$t=new array_2_tree();
foreach($a as $k=>$v){
$t->pick($v);
}
$r=$t->get_tree();
debug($r);