Question

I have a list from the .NET collections library and I want to remove a single element. Sadly, I cannot find it by comparing directly with another object.

I fear that using FindIndex and RemoveAt will cause multiple traversals of the list.

I don’t know how to use Enumerators to remove elements, otherwise that could have worked.

RemoveAll does what I need, but will not stop after one element is found.

Ideas?

Answer 1

EDIT: Now the OP has changed to use a LinkedList<T>, it’s easy to give an answer which only iterates as far as it has to:

public static void RemoveFirst<T>(LinkedList<T> list, Predicate<T> predicate)
{
    var node = list.First;
    while (node != null)
    {
        if (predicate(node.Value))
        {
            list.Remove(node);
            return;
        }
        node = node.Next;
    }
}