RemoveAll for a SortedList

[Michael Nesslinger]

Hello,

i am looking for an easy way to do a "RemoveAll(Pred icate<Tmatch)" for
a SortedList like it is possible for a List.

My first question is:
Why is the Method not available for the SortedList.
And my second one:
How can it be done the best (fastest) way for a SortedList

Thanks for any ideas

Michael Neßlinger

[Nicholas Paldino [.NET/C# MVP]]

Michael,

The only way you are going to be able to do this is by looping through
each item and then determining if it should be removed:

public static int RemoveAllFromSo rtedList<TKey, TValue>(SortedL ist<TKey,
TValuesortedLis t,
Predicate<KeyVa luePair<TKey, TValue>match)
{
// The number of items removed.
int itemsRemoved = 0;

// Cycle through each of the values in the sorted list.
foreach (KeyValuePair<T Key, TValuepair in sortedList)
{
// If the predicate returns true, then remove the item.
if (match(pair))
{
// Remove the item.
sortedList.Remo ve(pair.Key);

// Increment the number of items removed.
itemsRemoved++;
}
}

// Return the items removed.
return itemsRemoved;
}

Hope this helps.
--
- Nicholas Paldino [.NET/C# MVP]
- mv*@spam.guard. caspershouse.co m

"Michael Nesslinger" <Mi************ ****@gmx.dewrot e in message
news:46******** @news.kullen.rw th-aachen.de...

Hello,

i am looking for an easy way to do a "RemoveAll(Pred icate<Tmatch)" for a
SortedList like it is possible for a List.

My first question is:
Why is the Method not available for the SortedList.
And my second one:
How can it be done the best (fastest) way for a SortedList

Thanks for any ideas

Michael Neßlinger

[Michael Nesslinger]

Nicholas Paldino [.NET/C# MVP] schrieb:

Michael,

The only way you are going to be able to do this is by looping through
each item and then determining if it should be removed:

public static int RemoveAllFromSo rtedList<TKey, TValue>(SortedL ist<TKey,
TValuesortedLis t,
Predicate<KeyVa luePair<TKey, TValue>match)
{
// The number of items removed.
int itemsRemoved = 0;

// Cycle through each of the values in the sorted list.
foreach (KeyValuePair<T Key, TValuepair in sortedList)
{
// If the predicate returns true, then remove the item.
if (match(pair))
{
// Remove the item.
sortedList.Remo ve(pair.Key);

// Increment the number of items removed.
itemsRemoved++;
}
}

// Return the items removed.
return itemsRemoved;
}

Hope this helps.

Thanks,
that is what i was suspecting. I just hoped for some nice trick to avoid
this.

Michael Neßlinger

[Ben Voigt [C++ MVP]]

"Nicholas Paldino [.NET/C# MVP]" <mv*@spam.guard .caspershouse.c omwrote in
message news:%2******** **********@TK2M SFTNGP06.phx.gb l...

Michael,

The only way you are going to be able to do this is by looping through
each item and then determining if it should be removed:

But loop from the end, to avoid repeated defragmentation .

>
public static int RemoveAllFromSo rtedList<TKey, TValue>(SortedL ist<TKey,
TValuesortedLis t,
Predicate<KeyVa luePair<TKey, TValue>match)
{
// The number of items removed.
int itemsRemoved = 0;

// Cycle through each of the values in the sorted list.
foreach (KeyValuePair<T Key, TValuepair in sortedList)
{
// If the predicate returns true, then remove the item.
if (match(pair))
{
// Remove the item.
sortedList.Remo ve(pair.Key);

// Increment the number of items removed.
itemsRemoved++;
}
}

// Return the items removed.
return itemsRemoved;
}

Hope this helps.
--
- Nicholas Paldino [.NET/C# MVP]
- mv*@spam.guard. caspershouse.co m

"Michael Nesslinger" <Mi************ ****@gmx.dewrot e in message
news:46******** @news.kullen.rw th-aachen.de...

>Hello,

i am looking for an easy way to do a "RemoveAll(Pred icate<Tmatch)" for
a SortedList like it is possible for a List.

My first question is:
Why is the Method not available for the SortedList.
And my second one:
How can it be done the best (fastest) way for a SortedList

Thanks for any ideas

Michael Neßlinger

[Ben Voigt [C++ MVP]]

"Nicholas Paldino [.NET/C# MVP]" <mv*@spam.guard .caspershouse.c omwrote in
message news:%2******** **********@TK2M SFTNGP06.phx.gb l...

Michael,

The only way you are going to be able to do this is by looping through
each item and then determining if it should be removed:

Stupid me... any sort of repeated removal involves suicidal defragmentation .
Copy items selectively into a new list instead.

>
public static int RemoveAllFromSo rtedList<TKey, TValue>(SortedL ist<TKey,
TValuesortedLis t,
Predicate<KeyVa luePair<TKey, TValue>match)
{
// The number of items removed.
int itemsRemoved = 0;

// Cycle through each of the values in the sorted list.
foreach (KeyValuePair<T Key, TValuepair in sortedList)
{
// If the predicate returns true, then remove the item.
if (match(pair))
{
// Remove the item.
sortedList.Remo ve(pair.Key);

// Increment the number of items removed.
itemsRemoved++;
}
}

// Return the items removed.
return itemsRemoved;
}

Hope this helps.
--
- Nicholas Paldino [.NET/C# MVP]
- mv*@spam.guard. caspershouse.co m

"Michael Nesslinger" <Mi************ ****@gmx.dewrot e in message
news:46******** @news.kullen.rw th-aachen.de...

>Hello,

i am looking for an easy way to do a "RemoveAll(Pred icate<Tmatch)" for
a SortedList like it is possible for a List.

My first question is:
Why is the Method not available for the SortedList.
And my second one:
How can it be done the best (fastest) way for a SortedList

Thanks for any ideas

Michael Neßlinger