Wintellect.PowerCollections Namespace
Algorithms Class
Bag(T) Class
BigList(T) Class
BinaryPredicate(T) Delegate
CollectionBase(T) Class
Deque(T) Class
Deque(T) Members
Deque(T) Constructor
Deque(T) Methods
Add Method
AddManyToBack Method
AddManyToFront Method
AddToBack Method
AddToFront Method
Clear Method
Clone Method
CloneContents Method
CopyTo Method
GetAtBack Method
GetAtFront Method
GetEnumerator Method
Insert Method
InsertRange Method
RemoveAt Method
RemoveFromBack Method
RemoveFromFront Method
RemoveRange Method
TrimToSize Method
Deque(T) Properties
DictionaryBase(TKey, TValue) Class
ListBase(T) Class
MultiDictionary(TKey, TValue) Class
MultiDictionaryBase(TKey, TValue) Class
OrderedBag(T) Class
OrderedBag(T).View Class
OrderedDictionary(TKey, TValue) Class
OrderedDictionary(TKey, TValue).View Class
OrderedMultiDictionary(TKey, TValue) Class
OrderedMultiDictionary(TKey, TValue).View Class
OrderedSet(T) Class
OrderedSet(T).View Class
Pair(TFirst, TSecond) Structure
ReadOnlyCollectionBase(T) Class
ReadOnlyDictionaryBase(TKey, TValue) Class
ReadOnlyListBase(T) Class
ReadOnlyMultiDictionaryBase(TKey, TValue) Class
Set(T) Class
Triple(TFirst, TSecond, TThird) Structure
GhostDoc Pro Sample Help File

Deque<(Of <(<'T>)>)>..::..RemoveRange Method

Removes a range of items at the given index in the Deque. All items at indexes greater than index move down count indices in the Deque.

Namespace:  Wintellect.PowerCollections
Assembly:  PowerCollections (in PowerCollections.dll)

Syntax

public void RemoveRange(
	int index,
	int count
)
Public Sub RemoveRange ( _
	index As Integer, _
	count As Integer _
)
public:
void RemoveRange(
	int^ index, 
	int^ count
)

Parameters

index
Type: Int32
The index in the list to remove the range at. The first item in the list has index 0.
count
Type: Int32
The number of items to remove.

Exceptions

ExceptionCondition
ArgumentOutOfRangeExceptionindex is less than zero or greater than or equal to Count, or count is less than zero or too large.

Remarks

The amount of time to delete count items in the Deque is proportional to the distance to the closest end of the Deque: O(Min(index, Count - index - count)).

See Also

Deque<(Of <(<'T>)>)> Class
Wintellect.PowerCollections Namespace