StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
11868700
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
7
CommunityOwnedDate
CreationDate
2012-08-08T16:10:15.397
FavoriteCount
0
LastActivityDate
2012-08-08T17:04:58.860
LastEditDate
2012-08-08T17:04:58.860
LastEditorUserId
335858
OwnerUserId
335858
ParentId
11868612
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
There are two common ways to process a recursive structure in C# - by using <code>yield return</code> and by writing a recursive function. I prefer the second way, here is an example: <pre><code>public static class TreeUtils { public static IEnumerable<T> GetAllNodes<T>( this T node , Func<T,IEnumerable<T>> f) { return GetAllNodes(new[] {node}, f); } public static IEnumerable<T> GetAllNodes<T>( this IEnumerable<T> e , Func<T,IEnumerable<T>> f) { return e.SelectMany(c => f(c).GetAllNodes(f)).Concat(e); } } </code></pre> You can use this utility class as follows: <pre><code>class TreeNode<T> { public T Content {get; set;} public IEnumerable<TreeNode<T>> Dependents {get;set;} } foreach (TreeNode node in TreeUtils.GetAllNodes(root, n => n.Dependents)) { Console.WriteLine(node.Content); } </code></pre> A somewhat cheating way would be to employ a "recursive" lambda: <pre><code>using System; using System.Collections.Generic; public class Program { class Node { public int Data; public IEnumerable<Node> Dependents { get; set; } } public static void Main() { var root = Create( 10 , Create(5, Create(3), Create(7, Create(6), Create(8))) , Create(20, Create(15), Create(30, Create(28), Create(40))) ); // We cannot combine the declaration and definition here Func<Node,IEnumerable<Node>> all = null; // The recursive magic is in the following line all = n => n.Dependents.SelectMany(d => all(d)).Concat(new[] {n}); // Here is how you can use it foreach (var node in all(root)) { Console.WriteLine(node.Data); } } // Helper function for creating tree nodes private static Node Create(int data, params Node[] nodes) { return new Node { Data = data, Dependents = nodes }; } } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POSelect all family from root node using LINQ?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USdasblinkenlight
UserOwnerUserId
1. USdasblinkenlight
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POSelect all family from root node using LINQ?
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
CommentsPostId

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.