Geek asks and answers

Wood style show

my input

Sore | aye
A    |   1 
A    |   2
A    |   3
B    |   1
B    |   2

outPut: and I want to sort the top table in the bottom tree

A
   1 
   2 
   3
B  
   1
   2
+3
source share
2 answers

Given this object:

public class MyObject
{
    public string Sore { get; set; }
    public int aye { get; set; }
}

With this data:

var ls=new List<MyObject>();
ls.Add(new UserQuery.MyObject(){Sore="A",aye=1});
ls.Add(new UserQuery.MyObject(){Sore="A",aye=2});
ls.Add(new UserQuery.MyObject(){Sore="A",aye=3});
ls.Add(new UserQuery.MyObject(){Sore="B",aye=1});
ls.Add(new UserQuery.MyObject(){Sore="B",aye=2});

You can do this quite easily:

var result=ls.GroupBy (l =>l.Sore)
      .Select (l =>new 
                    {
                        Root= l.Key,
                        Children=l.Select (x =>x.aye)
                    }
                ).ToList();

And then just compile the list:

foreach (var root in result)
    {
        //root.Root to the root node
        foreach(var child in root.Children)
        {
            //Add the child to the root nodes children
        }
    }
+2
source 
var str = "Sore | aye\r\nA    |   1 \r\nA    |   2\r\nA    |   3\r\nB    |   1\r\nB    |   2";

var relations = str.Split(new[] {Environment.NewLine},
                          StringSplitOptions.RemoveEmptyEntries)
                   .Skip(1).Select(l => l.Split('|').Select(
                                   x => x.Trim()).ToArray()).ToArray();

var relationsDic = new SortedDictionary<string, SortedSet<string>>();

foreach (var relation in relations)
{
    if (relationsDic.ContainsKey(relation[0]))
    {
        relationsDic[relation[0]].Add(relation[1]);
    }
    else
    {
        relationsDic[relation[0]] = new SortedSet<string> {relation[1]};
    }
}

foreach (var kvp in relationsDic)
{
    Console.WriteLine(kvp.Key);

    foreach (var sub in kvp.Value)
    {
        Console.WriteLine("\t" + sub);
    }
}
+1
source

More articles:


All Articles