ArrayList represents an ordered collection of an object that can be indexed individually. It is basically an alternative to an array. It also allows dynamic memory allocation, adding, searching and sorting items in the list. ArrayList.Clear method is used to remove all the elements from the ArrayList.
- Elements can be added or removed from the Array List collection at any point in time.
- The ArrayList is not guaranteed to be sorted.
- The capacity of an ArrayList is the number of elements the ArrayList can hold.
- Elements in this collection can be accessed using an integer index. Indexes in this collection are zero-based.
- It also allows duplicate elements.
- Using multidimensional arrays as elements in an ArrayList collection is not supported.
public virtual void Clear ();
Exceptions: This method will give NotSupportedException if the ArrayList is read-only or the ArrayList has a fixed size.
- This method is an O(n) operation, where n is Count.
- Count is set to zero, and references to other objects from elements of the collection are also released.
- Capacity remains unchanged.
Below programs illustrate the use of ArrayList.Clear Method:
Example 1 :
Number of elements in ArrayList initially : 6 Number of elements in ArrayList : 0
Number of elements in ArrayList initially : 5 Number of elements in ArrayList : 0