The collections framework in Java defines numerous different data structures in which you can store, group, and retrieve objects. Located inside the java.util package, the collections framework contains numerous different classes and interfaces including ArrayList, LinkedList, Queue, HashSet, HashMap, amongst others.
All of these support adding, removing, getting the total size, clearing, checking if an item exists, whether or not it is empty, and many others. In this lesson, we'll dive into some of these collections and learn how to do the basic operations in each.
ArrayList
An ArrayList is similar to a normal Java array except that the size here is dynamically and automatically adjusted as the size of the collection changes. Remember that normal arrays have a fixed size that cannot change. With ArrayList, you don't need to worry about the size. Import the class you're good to go:
Put the type of objects you want to collect inside the diamond operator like shown above and you're good to go.
Adding items to an ArrayList
JAVA
import java.util.ArrayList;
publicclassMain {
publicstaticvoidmain(String[] args) {
ArrayList<String> countries = newArrayList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
System.out.println(countries);
}
}
BASH
[United States of America, United Kingdom, Canada]
Accessing an Item in an ArrayList
JAVA
import java.util.ArrayList;
publicclassMain {
publicstaticvoidmain(String[] args) {
ArrayList<String> countries = newArrayList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
System.out.println(countries.get(1));
}
}
BASH
United Kingdom
Changing an Item in an ArrayList
JAVA
import java.util.ArrayList;
publicclassMain {
publicstaticvoidmain(String[] args) {
ArrayList<String> countries = newArrayList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
countries.set(1, "Australia");
System.out.println(countries.get(1));
}
}
BASH
Australia
Removing an Item in an ArrayList
JAVA
import java.util.ArrayList;
publicclassMain {
publicstaticvoidmain(String[] args) {
ArrayList<String> countries = newArrayList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
countries.remove(1);
System.out.println(countries);
}
}
BASH
[United States of America, Canada]
Get Size of an ArrayList
JAVA
import java.util.ArrayList;
publicclassMain {
publicstaticvoidmain(String[] args) {
ArrayList<String> countries = newArrayList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
System.out.println(countries.size());
}
}
BASH
3
Check if Item exists in ArrayList
JAVA
import java.util.ArrayList;
publicclassMain {
publicstaticvoidmain(String[] args) {
ArrayList<String> countries = newArrayList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
booleancontains= countries.contains("Canada");
System.out.println(contains);
}
}
BASH
true
Iterate over an ArrayList
JAVA
import java.util.ArrayList;
publicclassMain {
publicstaticvoidmain(String[] args) {
ArrayList<String> countries = newArrayList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
for (inti=0; i < countries.size(); i++) {
System.out.println(countries.get(i));
}
}
}
BASH
United States of America
United Kingdom
Canada
LinkedList
A LinkedList is similar to an ArrayList except the way the data is stored in memory. Where an ArrayList uses a normal array to store elements, a LinkedList uses a doubly linked list to store elements. What this means is that each item knows where the next and previous items are, instead of in an array where you simply increment or decrement the index. In general, a LinkedList is better when you're manipulating data, but an ArrayList is superior when it comes to simply storing and accessing that data.
To start using a LinkedList, import the class you're good to go:
import java.util.LinkedList;
publicclassMain {
publicstaticvoidmain(String[] args) {
LinkedList<String> countries = newLinkedList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
System.out.println(countries);
}
}
BASH
[United States of America, United Kingdom, Canada]
Removing an Item in an LinkedList
JAVA
import java.util.LinkedList;
publicclassMain {
publicstaticvoidmain(String[] args) {
LinkedList<String> countries = newLinkedList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
countries.remove(1);
System.out.println(countries);
}
}
BASH
[United States of America, Canada]
Get Size of LinkedList
JAVA
import java.util.LinkedList;
publicclassMain {
publicstaticvoidmain(String[] args) {
LinkedList<String> countries = newLinkedList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
System.out.println(countries.size());
}
}
BASH
3
Check if Item exists in LinkedList
JAVA
import java.util.LinkedList;
publicclassMain {
publicstaticvoidmain(String[] args) {
LinkedList<String> countries = newLinkedList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
booleancontains= countries.contains("Canada");
System.out.println(contains);
}
}
BASH
true
Iterate over an LinkedList
JAVA
import java.util.LinkedList;
publicclassMain {
publicstaticvoidmain(String[] args) {
LinkedList<String> countries = newLinkedList<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
for (inti=0; i < countries.size(); i++) {
System.out.println(countries.get(i));
}
}
}
BASH
United States of America
United Kingdom
Canada
HashSet
A Java HashSet is a collection that uses a hash table for storage. Elements are stored by hashing and as a result only supports unique elements only. Unlike most collections, a HashSet does not keep track of order. As a result, using a HashSet is best when you simply want to search data.
import java.util.HashSet;
publicclassMain {
publicstaticvoidmain(String[] args) {
HashSet<String> countries = newHashSet<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
System.out.println(countries);
}
}
BASH
[Canada, United States of America, United Kingdom]
Removing an Item in a HashSet
JAVA
import java.util.HashSet;
publicclassMain {
publicstaticvoidmain(String[] args) {
HashSet<String> countries = newHashSet<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
countries.remove("United Kingdom");
System.out.println(countries);
}
}
BASH
[Canada, United States of America]
Get Size of HashSet
JAVA
import java.util.HashSet;
publicclassMain {
publicstaticvoidmain(String[] args) {
HashSet<String> countries = newHashSet<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
System.out.println(countries.size());
}
}
BASH
3
Check if Item exists in HashSet
JAVA
import java.util.HashSet;
publicclassMain {
publicstaticvoidmain(String[] args) {
HashSet<String> countries = newHashSet<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
booleancontains= countries.contains("Canada");
System.out.println(contains);
}
}
BASH
true
Iterate over a HashSet
JAVA
import java.util.HashSet;
import java.util.Iterator;
publicclassMain {
publicstaticvoidmain(String[] args) {
HashSet<String> countries = newHashSet<String>();
countries.add("United States of America");
countries.add("United Kingdom");
countries.add("Canada");
Iterator<String> iterator = countries.iterator();
while(iterator.hasNext()) {
System.out.println(iterator.next());
}
}
}
BASH
Canada
United States of America
United Kingdom
HashMap
A HashMap works fundamentally different than the other collections we've seen here. A HashMap uses key-value pairs to insert and access items. All keys must be unique and this, like a HashSet does not maintain order. HashMaps are great when you know the key of the item you want to access.