Question

I’d like to take an object like this:

SortedList<string, SortedList<int, SortedList<DateTime, double>>> Data

and, for a given ‘int’ value (key of first nested sorted list), restructure it like this:

SortedList<DateTime, SortedList<string, double>>

or, better yet, this:

SortedList<DateTime, double[]>

where each ‘double[]’ has as many elements as there are KeyValue pairs in the SortedList.

I’m guessing Linq is the way to go, but can’t figure it out. Thanks for any suggestions.

Answer 1

digEmAll beat me to it, but here’s the second case in query comprehension syntax:

int desiredInt = //whatever...

var query = from pair in Data
        from pair2 in pair.Value
        where pair2.Key == desiredInt
        from pair3 in pair2.Value
        group pair3.Value by pair3.Key into grp
        select new { grp.Key, Value = grp.ToArray() };

var result = new SortedList<DateTime, double[]>(query.ToDictionary(a => a.Key, a => a.Value));