【发布时间】:2015-12-18 05:08:54
【问题描述】:
我在 c# 中有一个 Windows 窗体应用程序,我正在显示字典。
我要做的是对字典进行排序。
在字典中有文件路径以及字典中有多少次的值。我想对列表进行排序以使出现最多的条目出现在顶部,而出现在底部的条目最少
我不知道从哪里开始。
这是我目前的代码:
namespace Xml_reader
{
public partial class Form1 : Form
{
Dictionary<string, int> _dictionary = new Dictionary<string, int>();
public Form1()
{
InitializeComponent();
}
private void getFile_Click(object sender, EventArgs e)
{
FileStream fileStream = null;
fileStream = new FileStream(@"C:\myProject\svn.xml", FileMode.Open, FileAccess.Read, FileShare.Read);
XmlSerializer xmlSerializer = new XmlSerializer(typeof(log) );
log logInstance;
lock (xmlSerializer)
{
logInstance = (log)xmlSerializer.Deserialize(fileStream);
}
_dictionary = CreateDictionary(logInstance);
}
private Dictionary<string, int> CreateDictionary(log logInstance)
{
Dictionary<string, int> dictionary = new Dictionary<string, int>();
int commonStringNumber = FindCommonString(logInstance);
for (int entryIdex = 0; entryIdex < logInstance.logentry.Count(); entryIdex++)
{
logLogentry entry = logInstance.logentry[entryIdex];
for (int pathIdex = 0; pathIdex < entry.paths.Count(); pathIdex++)
{
logLogentryPath path = entry.paths[pathIdex];
string filePath = path.Value;
if (filePath.Length >= commonStringNumber)
{
string cutPath = filePath.Substring(commonStringNumber);
if (dictionary.ContainsKey(cutPath))
{
dictionary[cutPath]++;
}
else
{
dictionary.Add(cutPath, 1);
}
}
}
}
return dictionary;
}
private static int FindCommonString(log logInstance)
{
string fCompare = logInstance.logentry[0].paths[0].Value;
for (int entryIdex = 0; entryIdex < logInstance.logentry.Count(); entryIdex++)
{
logLogentry entry = logInstance.logentry[entryIdex];
for (int pathIdex = 0; pathIdex < entry.paths.Count(); pathIdex++)
{
logLogentryPath path = entry.paths[pathIdex];
string fcheck = path.Value;
fCompare = similarString(fCompare, fcheck);
}
}
return fCompare.Length;
}
private static string similarString(string fCompare, string fcheck)
{
int length = Math.Min(fCompare.Length, fcheck.Length);
string common = String.Empty;
for (int i = 0; i < length; i++)
{
if (fCompare[i] == fcheck[i])
{
common += fCompare[i];
}
else
{
break;
}
}
return common;
}
private void converToText(Dictionary<string, int> dictionaryList)
{
List<KeyValuePair<string, int>> changesWithValues = dictionaryList.ToList();
display(changesWithValues);
}
private void display(List<KeyValuePair<string, int>> changesWithValues)
{
textBox1.Text = String.Join(Environment.NewLine, changesWithValues.Where(kvp => kvp.Key != "").Select(kvp => string.Format("{0} = {1}", kvp.Key, kvp.Value)));
}
private void Show_Click(object sender, System.EventArgs e)
{
converToText(_dictionary);
}
【问题讨论】:
标签: c# sorting dictionary