CircularListTInsertRange Method

public void InsertRange(
	int index,
	IEnumerable<T> collection
)

Public Sub InsertRange ( 
	index As Integer,
	collection As IEnumerable(Of T)
)

public:
virtual void InsertRange(
	int index, 
	IEnumerable<T>^ collection
) sealed

abstract InsertRange : 
        index : int * 
        collection : IEnumerable<'T> -> unit 
override InsertRange : 
        index : int * 
        collection : IEnumerable<'T> -> unit 

Parameters

index  Int32

The zero-based index at which collection items should be inserted.

collection  IEnumerableT

The collection to insert into the list.

Implements

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

If capacity increase is needed (considering actual list size), or when the collection is inserted 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