Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Here is a snippet of code that I use to perform this task from my core library. It allows you to list the nodes either depth first or breath first without the use of recursion, which has the overhead of constructing stackframes in the JIT engine. Its very fast.</p> <p>To use it simply go:</p> <p>List&lt; TreeNode > nodes = TreeViewUtils.FlattenDepth(tree);</p> <p>Sorry you you VB heads, I can't give an example, but I'm sure you'll work it out.</p> <pre><code>public class TreeViewUtils { /// &lt;summary&gt; /// This static utiltiy method flattens all the nodes in a tree view using /// a queue based breath first search rather than the overhead /// of recursive method calls. /// &lt;/summary&gt; /// &lt;param name="tree"&gt;&lt;/param&gt; /// &lt;returns&gt;&lt;/returns&gt; public static List&lt;TreeNode&gt; FlattenBreath(TreeView tree) { List&lt;TreeNode&gt; nodes = new List&lt;TreeNode&gt;(); Queue&lt;TreeNode&gt; queue = new Queue&lt;TreeNode&gt;(); // // Bang all the top nodes into the queue. // foreach(TreeNode top in tree.Nodes) { queue.Enqueue(top); } while(queue.Count &gt; 0) { TreeNode node = queue.Dequeue(); if(node != null) { // // Add the node to the list of nodes. // nodes.Add(node); if(node.Nodes != null &amp;&amp; node.Nodes.Count &gt; 0) { // // Enqueue the child nodes. // foreach(TreeNode child in node.Nodes) { queue.Enqueue(child); } } } } return nodes; } /// &lt;summary&gt; /// This static utiltiy method flattens all the nodes in a tree view using /// a stack based depth first search rather than the overhead /// of recursive method calls. /// &lt;/summary&gt; /// &lt;param name="tree"&gt;&lt;/param&gt; /// &lt;returns&gt;&lt;/returns&gt; public static List&lt;TreeNode&gt; FlattenDepth(TreeView tree) { List&lt;TreeNode&gt; nodes = new List&lt;TreeNode&gt;(); Stack&lt;TreeNode&gt; stack = new Stack&lt;TreeNode&gt;(); // // Bang all the top nodes into the queue. // foreach(TreeNode top in tree.Nodes) { stack.Push(top); } while(stack.Count &gt; 0) { TreeNode node = stack.Pop(); if(node != null) { // // Add the node to the list of nodes. // nodes.Add(node); if(node.Nodes != null &amp;&amp; node.Nodes.Count &gt; 0) { // // Enqueue the child nodes. // foreach(TreeNode child in node.Nodes) { stack.Push(child); } } } } return nodes; } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POHow to get a list of all child nodes in a TreeView in .NET
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USAdrian Regan
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    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. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COI'll look into it. Thanks for sharing, Adrian!
      singulars
      1. PO
      1. USMatt Hanson
 

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