Adds an item to the end of the BigList. The indices of all existing items in the Deque are unchanged.

Adds a collection of items to the end of BigList. The indices of all existing items are unchanged. The last item in the added collection becomes the last item in the BigList.

Adds a BigList of items to the end of BigList. The indices of all existing items are unchanged. The last item in list becomes the last item in this list. The added list list is unchanged.

Adds a collection of items to the front of BigList. The indices of all existing items in the are increased by the number of items in collection. The first item in the added collection becomes the first item in the BigList.

Adds a BigList of items to the front of BigList. The indices of all existing items are increased by the number of items in list. The first item in list becomes the first item in this list. The added list list is unchanged.

Adds an item to the beginning of the BigList. The indices of all existing items in the Deque are increased by one, and the new item has index zero.

Provides a read-only view of this list. The returned IList<T> provides a view of the list that prevents modifications to the list. Use the method to provide access to the list without allowing changes. Since the returned object is just a view, changes to the list will be reflected in the view.

Searches a sorted list for an item via binary search. The list must be sorted in the order defined by the default ordering of the item type; otherwise, incorrect results will be returned.

Searches a sorted list for an item via binary search. The list must be sorted by the ordering defined by the passed IComparer<T> interface; otherwise, incorrect results will be returned.

Searches a sorted list for an item via binary search. The list must be sorted by the ordering defined by the passed Comparison<T> delegate; otherwise, incorrect results will be returned.

Removes all of the items from the BigList.

Creates a new BigList that is a copy of this list.

Makes a deep clone of this BigList. A new BigList is created with a clone of each element of this set, by calling ICloneable.Clone on each element. If T is a value type, then this method is the same as Clone.

Determines if the list contains any item that compares equal to item. The implementation simply checks whether IndexOf(item) returns a non-negative value.

Convert the list to a new list by applying a delegate to each item in the collection. The resulting list contains the result of applying converter to each item in the list, in order. The current list is unchanged.

Convert this collection of items by applying a delegate to each item in the collection. The resulting enumeration contains the result of applying converter to each item in this collection, in order.

Copies all the items in the list, in order, to array, starting at index 0.

Copies all the items in the collection into an array. Implemented by using the enumerator returned from GetEnumerator to get all the items and copy them to the provided array.

Copies a range of elements from the list to array, starting at arrayIndex.

Counts the number of items in the collection that satisfy the condition defined by predicate.

Determines if the collection contains any item that satisfies the condition defined by predicate.

Finds the first item in the list that satisfies the condition defined by predicate. If no item matches the condition, than the default value for T (null or all-zero) is returned.

Enumerates the items in the collection that satisfy the condition defined by predicate.

Finds the index of the first item in the list that satisfies the condition defined by predicate. If no item matches the condition, -1 is returned.

Finds the index of the first item, in the range of items extending from index to the end, that satisfies the condition defined by predicate. If no item matches the condition, -1 is returned.

Finds the index of the first item, in the range of count items starting from index, that satisfies the condition defined by predicate. If no item matches the condition, -1 is returned.

Finds the last item in the list that satisfies the condition defined by predicate. If no item matches the condition, than the default value for T (null or all-zero) is returned.

Finds the index of the last item in the list that satisfies the condition defined by predicate. If no item matches the condition, -1 is returned.

Finds the index of the last item, in the range of items extending from the beginning of the list to index, that satisfies the condition defined by predicate. If no item matches the condition, -1 is returned.

Finds the index of the last item, in the range of count items ending at index, that satisfies the condition defined by predicate. If no item matches the condition, -1 is returned.

Performs the specified action on each item in this collection.

Enumerates all of the items in the list, in order. The item at index 0 is enumerated first, then the item at index 1, and so on. Usually, the foreach statement is used to call this method implicitly.

Creates a new list that contains a subrange of elements from this list. The current list is unchanged.

Finds the index of the first item in the list that is equal to item.

Finds the index of the first item, in the range of items extending from index to the end, that is equal to item.

Finds the index of the first item, in the range of count items starting from index, that is equal to item.

Inserts a new item at the given index in the BigList. All items at indexes equal to or greater than index move up one index.

Inserts a collection of items at the given index in the BigList. All items at indexes equal to or greater than index increase their indices by the number of items inserted.

Inserts a BigList of items at the given index in the BigList. All items at indexes equal to or greater than index increase their indices by the number of items inserted.

Finds the index of the last item in the list that is equal to item.

Finds the index of the last item, in the range of items extending from the beginning of the list to index, that is equal to item.

Finds the index of the last item, in the range of count items ending at index, that is equal to item.

Returns a view onto a sub-range of this list. Items are not copied; the returned IList<T> is simply a different view onto the same underlying items. Changes to this list are reflected in the view, and vice versa. Insertions and deletions in the view change the size of the view, but insertions and deletions in the underlying list do not.

Searches the list for the first item that compares equal to item. If one is found, it is removed. Otherwise, the list is unchanged.

Removes all the items in the collection that satisfy the condition defined by predicate.

Removes the item at the given index in the BigList. All items at indexes greater than index move down one index.

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.

Reverses the current list in place.

Reverses the items in the range of count items starting from start, in place.

Sorts the list in place.

Sorts the list in place. A supplied IComparer<T> is used to compare the items in the list.

Sorts the list in place. A supplied Comparison<T> delegate is used to compare the items in the list.

Creates an array of the correct size, and copies all the items in the collection into the array, by calling CopyTo.

Shows the string representation of the collection. The string representation contains a list of the items in the collection. Contained collections (except string) are expanded recursively.

Determines if all of the items in the collection satisfy the condition defined by predicate.

Finds the first item in the list that satisfies the condition defined by predicate.

Finds the last item in the list that satisfies the condition defined by predicate.