données hiérarchiques multi-niveaux de tri C#

Question

j'ai une entité:

public class Document 
{ 
    public int id; 
    public int? ParentId; 
    public string name; 
} 

et des données dans la base de données:

id | ParentId | name 
----------------------- 
1 |   | fruits 
2 |   | vegetables 
3 |  2  | tomatoes 
4 |  1  | apples 
5 |  4  | golden apples 
6 |  4  | red apples 

Ou, comme C#:

var documents = new[] 
{ 
    new Document() { id = 1, ParentId = null, name = "fruits" }, 
    new Document() { id = 2, ParentId = null, name = "vegetables" }, 
    new Document() { id = 3, ParentId = 2, name = "tomatoes" }, 
    new Document() { id = 4, ParentId = 1, name = "apples" }, 
    new Document() { id = 5, ParentId = 4, name = "golden apples" }, 
    new Document() { id = 6, ParentId = 4, name = "red apples" }, 
}; 

Je dois obtenir :

id | ParentId | name 
----------------------- 
1 |   | fruits 
4 |  1  | apples 
5 |  4  | golden apples 
6 |  4  | red apples 
2 |   | vegetables 
3 |  2  | tomatoes 

Comment puis-je trier rapidement les données hiérarchiques dans C#?

Answer 1

Ainsi, étant donné:

public class Document 
{ 
    public int id; 
    public int? ParentId; 
    public string name; 
} 

Et:

var documents = new[] 
{ 
    new Document() { id = 1, ParentId = null, name = "fruits" }, 
    new Document() { id = 2, ParentId = null, name = "vegetables" }, 
    new Document() { id = 3, ParentId = 2, name = "tomatoes" }, 
    new Document() { id = 4, ParentId = 1, name = "apples" }, 
    new Document() { id = 5, ParentId = 4, name = "golden apples" }, 
    new Document() { id = 6, ParentId = 4, name = "red apples" }, 
}; 

alors cette fonction:

var lookup = documents.ToLookup(x => x.ParentId); 

Func<int?, IEnumerable<Document>> heirarchySort = null; 
heirarchySort = pid => 
    lookup[pid].SelectMany(x => new[] { x }.Concat(heirarchySort(x.id))); 

IEnumerable<Document> sorted = heirarchySort(null); 

Il vous donne: