ISupportsRangeListTReplaceRange Method

void ReplaceRange(
	int index,
	int count,
	IEnumerable<T> collection
)

Sub ReplaceRange ( 
	index As Integer,
	count As Integer,
	collection As IEnumerable(Of T)
)

void ReplaceRange(
	int index, 
	int count, 
	IEnumerable<T>^ collection
)

abstract ReplaceRange : 
        index : int * 
        count : int * 
        collection : IEnumerable<'T> -> unit 

Parameters

index  Int32

The zero-based index of the first item to remove and also the index at which collection items should be inserted.

count  Int32

The number of items to remove.

collection  IEnumerableT

The collection to insert into the list.

If the length of the CircularListT is n and the length of the collection to insert is m, then replacement at the first or last position has O(m) cost.

If the elements to remove and to add have the same size, then the cost is O(m) at any position.

If capacity increase is needed (considering actual list size), or when the replacement of different amount of elements to remove and insert is performed in the middle of the CircularListT, the cost is O(Max(n, m)), and in practice no more than n/2 elements are moved.

Reference