In addition to the Arrays class, Java provides an ArrayList class which can be used to create containers that store lists of objects. ArrayList can be considered as a growable array. It gives you fast iteration and fast random access. ArrayList implements the new RandomAccess interface—a marker interface (meaning it has no methods) that says, "This list supports fast (generally constant time) random access." Choose this over a LinkedList when you need fast iteration but aren't as likely to be doing a lot of insertion and deletion.
Earlier versions of Java have one legacy collection class called Vector which is very much similar to ArrayList. Vector implements a dynamic array. A Vector is basically the same as an ArrayList, but Vector methods are synchronized for thread safety. You'll normally want to use ArrayList instead of Vector because the synchronized methods add a performance hit you might not need. In this tutorial, we will discuss ArrayList only considering all is applicable to Vector as well.
The java.util.ArrayList class is one of the most commonly used of all the classes in the Collections Framework.An ArrayList is dynamically resizable, meaning that its size can change during program execution. This means that:
To state the obvious: Arraylist is an ordered collection (by index), but not sorted.
To use the ArrayList class, you must use the following import statement:
import java.util.ArrayList;
Then, to declare an ArrayList, you can use the default constructor, as in the following example:
ArrayList names = new ArrayList();
The default constructor creates an ArrayList with a capacity of 10 items. The capacity of an ArrayList is the number of items it can hold without having to increase its size. Other constructors of ArrayList as follows,
ArrayList names = new ArrayList(int size);
ArrayList names = new ArrayList(Collection c);
You can also specify a capacity/size of initial ArrayList as well as create ArrayList from other collection types.
Some of the advantages ArrayList has over arrays are
ArrayList methods
Method Purpose public void add(Object) public void add(int, Object) Adds an item to an ArrayList. The default version adds an item at the next available location; an overloaded version allows you to specify a position at which to add the item public void remove(int) Removes an item from an ArrayList at a specified location public void set(int, Object) Alters an item at a specified ArrayList location Object get(int) Retrieves an item from a specified location in an ArrayList public int size() Returns the current ArrayList sizeJava Program to demonstrate the use of all above methods described above. Here we are creating ArrayList named myList and adding objects using add() method as well as using index based add method, then printing all the objects using for loop. Then there we demonstrate use of get(), contains(), and size() methods. the output of program is shown below the java code.
Java Code: Go to the editor
import java.util.ArrayList;
public class ArrayListDemo {
public static void main(String[] args) {
//declaring Arraylist of String objects
ArrayList<String> myList = new ArrayList<String>();
//Adding objects to Array List at default index
myList.add("Apple");
myList.add("Mango");
myList.add("Orange");
myList.add("Grapes");
//Adding object at specific index
myList.add(1, "Orange");
myList.add(2,"Pinapple");
System.out.println("Print All the Objects:");
for(String s:myList){
System.out.println(s);
}
System.out.println("Object at index 3 element from list: "+ myList.get(3));
System.out.println("Is Chicku is in list: " + myList.contains("Chicku"));
System.out.println("Size of ArrayList: " + myList.size());
myList.remove("Papaya");
System.out.println("New Size of ArrayList: "+ myList.size());
}
}
Output:
Summary:
Java Code Editor:
Previous: Java Collection Framework
Next: Java LinkedList Class
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4