Remove multiple keys with same value data from dictionary in C# using Linq

Question

I know there has to be a better way to do this... maybe with LINQ? If I remove a value, it invalidates the iterator which is why I have this inside of an infinite loop which starts the process all over again. I'm looking for a way to do this that is easier to read, maintain and ultimately much faster. Here's what I got:

Dictionary<string, string> Channels = //...;
while (true)
{
    var bFound = false;
    foreach(var c in Channels)
    {
        if(c.Value == version)
        {
            Channels.Remove(c.Key);
            bFound = true;
            break;
        }
    }
    if (!bFound) { break; }
}

Thanks for any help in optimizing this routine.

Answer 1

Based on your example it appears you are removing based on comparison with version value.

Channels = Channels.Where(x=> x.Value != version)
              .ToDictionary(c => c.Key, c => c.Value);

Answer 2

I'm looking for a way to do this that is easier to read, maintain and ultimately much faster

Just use the code below:

var keys = Channels.Keys.ToArray();
foreach(var key in keys)
{
    if(Channels[key] == version)
    {
        Channels.Remove(key);
    }
}

No LINQ needed for simplicity. We traverse the dictionary once for performance.

Answer 3

If you capture the matches before removing items from the dictionary, your enumerator will not be invalidated.

List<KeyValuePair<string, string>> matches = Channels
  .Where(kvp => kvp.Value == version)
  .ToList();

foreach(KeyValuePair<string, string> match in matches)
{
  Channels.Remove(match.Key);
}