wyk/juipnet
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

忽略

Browse Source
This commit is contained in:
“wanyongkang”
2020-12-28 14:55:48 +08:00
parent c2ec7392cb
commit 40a40b6d36
305 changed files with 20629 additions and 20629 deletions
Download Patch File Download Diff File Expand all files Collapse all files

148
Infrastructure/Hncore.Infrastructure/Tree/DataNode.cs
View File

@@ -1,74 +1,74 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Hncore.Infrastructure.Tree
{
public class DataNode<TData>
{
public DataNode(TData data)
{
this.Data = data;
}
public DataNode<TData> Parent { get; set; }
public TData Data { get; set; }
public List<DataNode<TData>> Children { get; set; } = new List<DataNode<TData>>();
public bool IsLeaf { get { return this.Children.Count()==0; } }
public void Traverse(Action<DataNode<TData>> act)
{
act(this);
this.Children.ForEach(item =>
{
item.Traverse(act);
});
}
public string GetFullPath(Func<TData, string> func, string separator = ".")
{
var parent = this.Parent;
var names = new List<string> { func(this.Data) };
while (parent != null)
{
names.Add(func(parent.Data));
parent = parent.Parent;
}
names.Reverse();
return string.Join(separator, names).TrimStart(separator.ToArray());
}
public DataNode<TData> SortAsc<Tkey>(Func<TData, Tkey> exp)
{
if (this.Children.Count > 0)
{
Func<DataNode<TData>, Tkey> iierExp = m => exp(m.Data);
this.Children.OrderBy(iierExp);
this.Children.ForEach(item =>
{
item.SortAsc(exp);
});
}
return this;
}
public DataNode<TData> SortDesc<Tkey>(Func<TData, Tkey> exp)
{
if (this.Children.Count > 0)
{
Func<DataNode<TData>, Tkey> iierExp = m => exp(m.Data);
this.Children.OrderByDescending(iierExp);
this.Children.ForEach(item =>
{
item.SortDesc(exp);
});
}
return this;
}
}
}
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Hncore.Infrastructure.Tree
{
public class DataNode<TData>
{
public DataNode(TData data)
{
this.Data = data;
}
public DataNode<TData> Parent { get; set; }
public TData Data { get; set; }
public List<DataNode<TData>> Children { get; set; } = new List<DataNode<TData>>();
public bool IsLeaf { get { return this.Children.Count()==0; } }
public void Traverse(Action<DataNode<TData>> act)
{
act(this);
this.Children.ForEach(item =>
{
item.Traverse(act);
});
}
public string GetFullPath(Func<TData, string> func, string separator = ".")
{
var parent = this.Parent;
var names = new List<string> { func(this.Data) };
while (parent != null)
{
names.Add(func(parent.Data));
parent = parent.Parent;
}
names.Reverse();
return string.Join(separator, names).TrimStart(separator.ToArray());
}
public DataNode<TData> SortAsc<Tkey>(Func<TData, Tkey> exp)
{
if (this.Children.Count > 0)
{
Func<DataNode<TData>, Tkey> iierExp = m => exp(m.Data);
this.Children.OrderBy(iierExp);
this.Children.ForEach(item =>
{
item.SortAsc(exp);
});
}
return this;
}
public DataNode<TData> SortDesc<Tkey>(Func<TData, Tkey> exp)
{
if (this.Children.Count > 0)
{
Func<DataNode<TData>, Tkey> iierExp = m => exp(m.Data);
this.Children.OrderByDescending(iierExp);
this.Children.ForEach(item =>
{
item.SortDesc(exp);
});
}
return this;
}
}
}

120
Infrastructure/Hncore.Infrastructure/Tree/DataTree.cs
View File

@@ -1,60 +1,60 @@
using System;
using System.Collections.Generic;
using System.Linq;
namespace Hncore.Infrastructure.Tree
{
public class DataTree
{
/// <summary>
///
/// </summary>
/// <param name="topPredicate">得到第一级节点条件</param>
/// <param name="childPredicate">得到孩子得条件</param>
public static DataNode<TData> Load<TData>(IEnumerable<TData> datas, Func<TData, bool> topPredicate, Func<TData, TData, bool> childPredicate) where TData : new()
{
var root = new DataNode<TData>(new TData() { });
if (datas == null || datas.Count() == 0)
return root;
var tops = datas.Where(topPredicate);
foreach (var p in tops)
{
LoadChildren(datas, root, p, childPredicate);
}
return root;
}
private static void LoadChildren<TData>(IEnumerable<TData> datas,DataNode<TData> topNode, TData p, Func<TData,TData, bool> childPredicate)
{
var pNode = new DataNode<TData>(p);
pNode.Parent = topNode;
topNode.Children.Add(pNode);
var childDatas = datas.Where(item=>childPredicate(p,item)) ;
if (childDatas.Count() > 0)
{
foreach (var childData in childDatas)
{
LoadChildren(datas,pNode, childData, childPredicate);
}
}
}
public static void Traverse<TData>(DataNode<TData> rootNode, Action<DataNode<TData>> act, bool root = true)
{
if (root)
{
rootNode.Traverse(act);
}
else
{
rootNode.Children.ForEach(item =>
{
item.Traverse(act);
});
}
}
}
}
using System;
using System.Collections.Generic;
using System.Linq;
namespace Hncore.Infrastructure.Tree
{
public class DataTree
{
/// <summary>
///
/// </summary>
/// <param name="topPredicate">得到第一级节点条件</param>
/// <param name="childPredicate">得到孩子得条件</param>
public static DataNode<TData> Load<TData>(IEnumerable<TData> datas, Func<TData, bool> topPredicate, Func<TData, TData, bool> childPredicate) where TData : new()
{
var root = new DataNode<TData>(new TData() { });
if (datas == null || datas.Count() == 0)
return root;
var tops = datas.Where(topPredicate);
foreach (var p in tops)
{
LoadChildren(datas, root, p, childPredicate);
}
return root;
}
private static void LoadChildren<TData>(IEnumerable<TData> datas,DataNode<TData> topNode, TData p, Func<TData,TData, bool> childPredicate)
{
var pNode = new DataNode<TData>(p);
pNode.Parent = topNode;
topNode.Children.Add(pNode);
var childDatas = datas.Where(item=>childPredicate(p,item)) ;
if (childDatas.Count() > 0)
{
foreach (var childData in childDatas)
{
LoadChildren(datas,pNode, childData, childPredicate);
}
}
}
public static void Traverse<TData>(DataNode<TData> rootNode, Action<DataNode<TData>> act, bool root = true)
{
if (root)
{
rootNode.Traverse(act);
}
else
{
rootNode.Children.ForEach(item =>
{
item.Traverse(act);
});
}
}
}
}