Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>You should use recursion.</p> <p>Here an exemple of code:</p> <pre><code>$datas = array( array('id' =&gt; 1, 'parent' =&gt; 0, 'name' =&gt; 'Page 1'), array('id' =&gt; 2, 'parent' =&gt; 1, 'name' =&gt; 'Page 1.1'), array('id' =&gt; 3, 'parent' =&gt; 2, 'name' =&gt; 'Page 1.1.1'), array('id' =&gt; 4, 'parent' =&gt; 3, 'name' =&gt; 'Page 1.1.1.1'), array('id' =&gt; 5, 'parent' =&gt; 3, 'name' =&gt; 'Page 1.1.1.2'), array('id' =&gt; 6, 'parent' =&gt; 1, 'name' =&gt; 'Page 1.2'), array('id' =&gt; 7, 'parent' =&gt; 6, 'name' =&gt; 'Page 1.2.1'), array('id' =&gt; 8, 'parent' =&gt; 0, 'name' =&gt; 'Page 2'), array('id' =&gt; 9, 'parent' =&gt; 0, 'name' =&gt; 'Page 3'), array('id' =&gt; 10, 'parent' =&gt; 9, 'name' =&gt; 'Page 3.1'), array('id' =&gt; 11, 'parent' =&gt; 9, 'name' =&gt; 'Page 3.2'), array('id' =&gt; 12, 'parent' =&gt; 11, 'name' =&gt; 'Page 3.2.1'), ); function generatePageTree($datas, $parent = 0, $depth=0){ $ni=count($datas); if($ni === 0 || $depth &gt; 1000) return ''; // Make sure not to have an endless recursion $tree = '&lt;ul&gt;'; for($i=0; $i &lt; $ni; $i++){ if($datas[$i]['parent'] == $parent){ $tree .= '&lt;li&gt;'; $tree .= $datas[$i]['name']; $tree .= generatePageTree($datas, $datas[$i]['id'], $depth+1); $tree .= '&lt;/li&gt;'; } } $tree .= '&lt;/ul&gt;'; return $tree; } echo(generatePageTree($datas)); </code></pre> <p>You can test it at: <a href="http://phpfiddle.org/main/code/1qy-5fj" rel="nofollow noreferrer">http://phpfiddle.org/main/code/1qy-5fj</a></p> <p>Or if you want the exact format:</p> <pre><code>function generatePageTree($datas, $parent = 0, $depth = 0){ $ni=count($datas); if($ni === 0 || $depth &gt; 1000) return ''; // Make sure not to have an endless recursion $tree = ''; for($i=0; $i &lt; $ni; $i++){ if($datas[$i]['parent'] == $parent){ $tree .= str_repeat('-', $depth); $tree .= $datas[$i]['name'] . '&lt;br/&gt;'; $tree .= generatePageTree($datas, $datas[$i]['id'], $depth+1); } } return $tree; } </code></pre> <p>The test: <a href="http://phpfiddle.org/main/code/jw3-s1j" rel="nofollow noreferrer">http://phpfiddle.org/main/code/jw3-s1j</a></p>
    singulars
    1. This table or related slice is empty.
    1. POFlat PHP Array to Hierarchy Tree
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USCode-Source
    1. USCode-Source
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POFlat PHP Array to Hierarchy Tree
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload