C# | Remove all elements from the ArrayList (original) (raw)
Last Updated : 01 Feb, 2019
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.Properties:
- 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.
Syntax:
public virtual void Clear ();
Exceptions: This method will give NotSupportedException if the ArrayList is read-only or the ArrayList has a fixed size. Note:
- 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 :
CSHARP `
// C# code to remove all elements // from an ArrayList using System; using System.Collections;
class GFG {
// Driver code
public static void Main()
{
// Creating an ArrayList
ArrayList myList = new ArrayList(10);
// Adding elements to ArrayList
myList.Add("A");
myList.Add("B");
myList.Add("C");
myList.Add("D");
myList.Add("E");
myList.Add("F");
// Displaying the elements in ArrayList
Console.WriteLine("Number of elements in ArrayList initially : "
+ myList.Count);
// Removing all elements from ArrayList
myList.Clear();
// Displaying the elements in ArrayList
// after Removing all the elements
Console.WriteLine("Number of elements in ArrayList : " + myList.Count);
}
}
`
Output:
Number of elements in ArrayList initially : 6 Number of elements in ArrayList : 0
Example 2:
CSHARP `
// C# code to remove all elements // from an ArrayList using System; using System.Collections;
class GFG {
// Driver code
public static void Main()
{
// Creating an ArrayList
ArrayList myList = new ArrayList(10);
// Adding elements to ArrayList
myList.Add(3);
myList.Add(5);
myList.Add(7);
myList.Add(9);
myList.Add(11);
// Displaying the elements in ArrayList
Console.WriteLine("Number of elements in ArrayList initially : "
+ myList.Count);
// Removing all elements from ArrayList
myList.Clear();
// Displaying the elements in ArrayList
// after Removing all the elements
Console.WriteLine("Number of elements in ArrayList : " + myList.Count);
}
}
`
Output:
Number of elements in ArrayList initially : 5 Number of elements in ArrayList : 0
Reference:
Similar Reads
- C# | Remove a range of elements from the ArrayList 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.RemoveRange(Int32, Int32) method is used to remove a range of ele 3 min read
- C# | Remove all elements from a SortedList SortedList class is a collection of (key, value) pairs which are sorted according to keys. Those pairs can be accessible by key and as well as by index(zero-based indexing). This comes under System.Collections namespace. SortedList.Clear method is used to remove all the elements from a SortedList ob 2 min read
- C# | Remove all elements from the Hashtable The Hashtable class represents a collection of key-and-value pairs that are organized based on the hash code of the key. The key is used to access the items in the collection. Hashtable.Clear Method is used to remove all elements from the Hashtable. Syntax: myTable.Clear() Here myTable is the name o 2 min read
- C# | Remove all elements from the SortedSet SortedSet class represents the collection of objects in sorted order. This class comes under the System.Collections.Generic namespace. SortedSet.Clear Method is used to remove the all elements from the SortedSet. Properties: In C#, SortedSet class can be used to store, remove or view elements. 2 min read
- C# | Removing all the elements from the List List class represents the list of objects which can be accessed by index. It comes under the System.Collection.Generic namespace. List class can be used to create a collection of different types like integers, strings etc. List class also provides the methods to search, sort, and manipulate lists. L 3 min read
- C# | Remove all elements from a HashSet A HashSet is an unordered collection of the unique elements. It comes under the System.Collections.Generic namespace. It is used in a situation where we want to prevent duplicates from being inserted in the collection. As far as performance is concerned, it is better in comparison to the list. HashS 2 min read
- C# | Remove all elements from the Collection Collection.Clear method is used to remove all elements from the Collection. Syntax: public void Clear (); Below given are some examples to understand the implementation in a better way: Example 1: CSHARP // C# code to remove all // elements from the Collection using System; using S 2 min read
- C# | Getting a subset of the elements from the source ArrayList ArrayList.GetRange(Int32, Int32) Method is used to get an ArrayList which will represent a subset of the elements in the source ArrayList. Syntax: public virtual System.Collections.ArrayList GetRange (int index, int count); Parameters: index: It is of Int32 type and represents the zero-based ArrayLi 3 min read
- C# | Remove the element at the specified index of the ArrayList 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.RemoveAt(Int32) method is used to remove the element at the speci 3 min read
- C# | Remove the specified element from a HashSet A HashSet is an unordered collection of the unique elements. It comes under System.Collections.Generic namespace. It is used in a situation where we want to prevent duplicates from being inserted in the collection. As far as performance is concerned, it is better in comparison to the list. HashSet 3 min read