Get recursive depth for each row.

Question

I have the following db table

82 is the parent of 84. 24 is the parent of 82 and 83. In php, I have a method for retrieving strings using uid.

public function fetchByUid($uid){ //code } 

This will get the 7th and 6th values ​​from the table. Now I want to get not only strings where uid is equal, but also strings in which the parent is a child of uid. For instance. 82 - the parent element 84, as well as the child element 24.

So, I came up with some recursion.

 public function fetchByUidRec($uid, $data, $counter){ //set of rows by uid $db_resultSet; foreach($db_resultSet as $row){ $entry = array(); $entry['id'] = $row->id; $entry['uid'] = $row->uid; $entry['rid'] = $row->rid; $entry['layer'] = $counter; $data [] = $entry; //now I want to do the same on the child $data [] = fetchByUidRec($row->rid, $data, $counter = $counter + 1) } return $data; } public function getchByUid($uid){ $data = array(); $counter = 0; return fetchByUidRec($uid, $data, $counter) } 

But this does not work at all :( I want to keep the current recursion depth in $ data ['layer']

Any ideas?

Answer 1

If you understand correctly:

 $rows = array ( 0 => array('id' => 8, 'uid' => 82, 'rid' => 84), 1 => array('id' => 7, 'uid' => 24, 'rid' => 82), 2 => array('id' => 6, 'uid' => 24, 'rid' => 83), ); function fetchByUidRec($uid, $counter = 0) { global $rows; // or in your case // $rows = SELECT FROM table WHERE uid = $uid; $data = array(); foreach ($rows as $row) { if ($row['uid'] == $uid) { $data[] = array_merge($row, array('layer' => $counter)); $data = array_merge($data, fetchByUidRec($row['rid'], $counter++)); } } return $data; } 

---

An example :

 echo '<pre>'; print_r(fetchByUidRec(24)); echo '</pre>'; 

---

Output

 Array ( [0] => Array ( [id] => 7 [uid] => 24 [rid] => 82 [layer] => 0 ) [1] => Array ( [id] => 8 [uid] => 82 [rid] => 84 [layer] => 0 ) [2] => Array ( [id] => 6 [uid] => 24 [rid] => 83 [layer] => 1 ) )