Greetings Guru's, my objective is to create a Dictionary of Lists, does a simpler technique exist?
I prefer the List(t) to IEnumerable(t) which is why I chose the Dictionary of Lists over Ilookup or IGrouping.
The code works but it seems like a messy way of doing things.
string[] files = Directory.GetFiles (@"C:\test");
Dictionary<string,List<string>> DataX = new Dictionary<string,List<string>>();
foreach (var group in files.GroupBy (file => Path.GetExtension (file)))
{
DataX.Add (group.Key, group.ToList());
}
A string is a sequence of characters. A list a sequence of values which can be characters, integers or even another list (referred to as a nested list). A dictionary is a more general version of a list and is made up a set of keys and values where there is a mapping between a given key and its corresponding value.
Save this question. Show activity on this post. List<string> key = new List<string>(); List<long> val = new List<long>(); List<long> tempList = new List<long>(); Dictionary<string, List<long>> testList = new Dictionary<string, List<long>>(); key.
Rate me: A relatively safe, simple, yet high performance technique for using lists as dictionary keys. Using collections as dictionary keys is sometimes necessary, but it can be a performance killer and unsafe.
To do it all in LINQ you can use ToDictionary()
:
string[] files = Directory.GetFiles (@"C:\test");
var DataX = files.GroupBy (file => Path.GetExtension (file))
.ToDictionary(g => g.Key, g => g.ToList());
or as Klaus points below out you can do this all in one go:
var DataX = Directory.GetFiles (@"C:\test")
.GroupBy (file => Path.GetExtension (file))
.ToDictionary(g => g.Key, g => g.ToList());
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With