Take the type/ID checking out of the recursion, so just have a “give me all the controls, recursively” method, e.g. public static IEnumerable<Control> GetAllControls(this Control parent) { foreach (Control control in parent.Controls) { yield return control; foreach(Control descendant in control.GetAllControls()) { yield return descendant; } } } That’s somewhat inefficient (in terms of creating lots … Read more
This is an extension: public static async Task<IEnumerable<T1>> SelectManyAsync<T, T1>(this IEnumerable<T> enumeration, Func<T, Task<IEnumerable<T1>>> func) { return (await Task.WhenAll(enumeration.Select(func))).SelectMany(s => s); } That allows you to run: var result = await myEnumerable.SelectManyAsync(c => Functions.GetDataAsync(c.Id)); Explanation: you have a list of tasks, each returns Task<IEnumerable<T>>. So you need to fire them all, then await all, and … Read more
Yes it is indeed possible to pause execution midway through a linq query. Convert your linq to query style using lambda expressions and insert a Select statement that returns itself somewhere after the point in the linq that you want to debug. Some sample code will make it clearer – var query = dataset.Tables[0].AsEnumerable() .Where … Read more
Using closures and anonymous method: List<Item> myList = FetchDataFromDatabase(); decimal currentTotal = 0; var query = myList .OrderBy(i => i.Date) .Select(i => { currentTotal += i.Amount; return new { Date = i.Date, Amount = i.Amount, RunningTotal = currentTotal }; } ); foreach (var item in query) { //do with item }
Write the clearest code you can, and then benchmark and profile to discover any performance problems. If you do have performance problems, you can experiment with different code to work out whether it’s faster or not (measuring all the time with as realistic data as possible) and then make a judgement call as to whether … Read more
survey.QuestionList .Where(l => l.Questions != null) .SelectMany(l => l.Questions) .Where(q => q != null && q.AnswerRows != null) .SelectMany(q => q.AnswerRows); I’d recommend you ensure your collections are never null. null can be a bit of a nuisance if you don’t handle it well. You end up with if (something != null) {} all over … Read more
As Dennis Traub has pointed out, the overload of Aggregate you are using throws that exception when the source sequence is empty. The obvious fix is to use the other overload of Aggregate that accepts an initial seed (you want string.Empty), but that would result in a leading comma in the result which you’ll have … Read more
From LINQPad: C#: age_Centers.Select(c => c.Id).First(); age_Centers.Select(c => c.Id).FirstOrDefault(); age_Centers.Select(c => c.Id).Take(1).Dump(); SQL: SELECT TOP (1) [t0].[Id] FROM [age_Centers] AS [t0] GO SELECT TOP (1) [t0].[Id] FROM [age_Centers] AS [t0] GO SELECT TOP (1) [t0].[Id] FROM [age_Centers] AS [t0] *Note that Take(1) enumerates and returns an IQueryable.
LINQ to Objects doesn’t provide this functionality easily in a built-in way, but MoreLINQ has a handy DistinctBy method: messages = messages.DistinctBy(m => new { m.id, m.date }).ToList();
You need to assembly an Expression<Func<T, bool>> and pass it to the Where() extension method: Expression<Func<T, bool>> whereClause = a => a.zip == 23456; var x = frSomeList.Where(whereClause); EDIT: If you’re using LINQ to Objects, remove the word Expression to create an ordinary delegate.