Java Collection Framework

JAVA
COLLECTION
COLLECTIONCC XX
FRAMEWORK
Collections
The Collection in Java is a framework that provides
an architecture to store and manipulate the group of
objects.
Java Collections can achieve all the operations that

you perform on a data such as searching, sorting,
insertion, manipulation, and deletion.
Java Collection framework provides many interfaces

(Set, List, Queue, Deque) and classes (ArrayList,
Vector, LinkedList, PriorityQueue, HashSet,
LinkedHashSet, TreeSet).
Hierarchy
The java.util package contains all the classes and
interfaces for the Collection framework.
Methods of collection interface
The Collection interface is the root interface of the
Java Collections Framework. It defines common
operations that all collections support.
Key Methods:
boolean add(E e): Adds an element to the
collection.
boolean remove(Object o): Removes a single
instance of the specified element.
boolean contains(Object o): Returns true if the
collection contains the specified element.
int size(): Returns the number of elements in the
collection.
void clear(): Removes all elements from the
collection.
boolean isEmpty(): Returns true if the collection
contains no elements.
Iterator<E> iterator(): Returns an iterator over
the elements in the collection.
Methods of collection interface
The Collection interface is the root interface of the
Java Collections Framework. It defines common
operations that all collections support.
Key Methods:
boolean add(E e): Adds an element to the
collection.
boolean remove(Object o): Removes a single
instance of the specified element.
collection contains the specified element.
collection.
void clear(): Removes all elements from the
collection.
boolean isEmpty(): Returns true if the collection
contains no elements.
Iterator<E> iterator(): Returns an iterator over
the elements in the collection.
List Interface
The List interface extends Collection and represents
an ordered collection (sequence). Lists can contain
duplicate elements and allow positional access.
Key Implementations:
ArrayList: A resizable array implementation.
LinkedList: A doubly-linked list implementation.
Vector: A synchronized resizable array
implementation.
List interface is implemented by the classes

ArrayList, LinkedList, Vector, and Stack.
To instantiate the List interface, we must use :
List Interface
Key Methods:
void add(int index, E element): Inserts an
element at the specified position.
E get(int index): Returns the element at the
specified position.
E set(int index, E element): Replaces the element
at the specified position.
E remove(int index): Removes the element at the
specified position.
int indexOf(Object o): Returns the index of the
first occurrence of the specified element.
ArrayList
The ArrayList class implements the List interface to
store the duplicate element of different data types
using dynamic array.
ArrayList is not synchronized, meaning it is not
thread-safe.
ArrayList
LinkedList
LinkedList is a doubly-linked list implementation of
the List and Deque interfaces.
It allows for quick insertion and removal of elements
at both ends of the list.
Vector
Vector is a synchronized, resizable array
implementation of the List interface.
It is similar to ArrayList but is thread-safe.
Synchronization makes Vector slower compared to
ArrayList
Set Interface
The Set interface extends Collection and represents
a collection that does not allow duplicate elements.
It models the mathematical set abstraction.
Key Implementations:
HashSet: A hash table-based implementation.
LinkedHashSet: A hash table and linked list
implementation, with predictable iteration order.
TreeSet: A NavigableSet implementation based
on a TreeMap.
Set Interface
Key Methods:
boolean add(E e): Adds the specified element to
the set if it is not already present.
boolean remove(Object o): Removes the
specified element from the set if it is present.
set contains the specified element.
set.
void clear(): Removes all elements from the set.
HashSet
HashSet is a hash table-based implementation of
the Set interface.
It makes no guarantees about the iteration order
of the set; in particular, it does not guarantee that
the order will remain constant over time.
It permits the null element.
LinkedHashSet
LinkedHashSet is an implementation of the Set
interface that uses a hash table and a doubly
linked list to maintain the insertion order of
elements.
It maintains a linked list of the entries in the set,
in the order in which they were inserted.
TreeSet
TreeSet is a NavigableSet implementation based
on a TreeMap.
The elements in a TreeSet are sorted according to
their natural ordering or by a comparator
provided at set creation time.
It does not permit null elements.
Queue Interface
The Queue interface extends the Collection
interface.
It represents a collection designed for holding
elements prior to processing.
Queues typically, but do not necessarily, order
elements in a FIFO (first-in-first-out) manner.
Queue Interface
Key Methods:
boolean add(E e): Inserts the specified element
into the queue, returning true if successful.
boolean offer(E e): Inserts the specified element
into the queue, returning false if not possible.
E remove(): Retrieves and removes the head of
the queue.
E poll(): Retrieves and removes the head of the
queue, returning null if the queue is empty.
E element(): Retrieves, but does not remove, the
head of the queue.
E peek(): Retrieves, but does not remove, the
head of the queue, returning null if the queue is
empty.
Priority Queue
PriorityQueue is an unbounded priority queue
based on a priority heap.
Elements of the priority queue are ordered
according to their natural ordering, or by a
Comparator provided at queue construction
time, depending on which constructor is used.
Priority Queue
Deque Interface
Deque interface extends the Queue interface. In
Deque, we can remove and add the elements from
both the side. Deque stands for a double-ended
queue which enables us to perform the operations at
both the ends.
Array Deque
ArrayDeque is a resizable-array implementation
of the Deque interface.
It has no capacity restrictions and provides
better performance than LinkedList for stack and
queue operations.
Array Deque
Thank You

Java Collection Framework

Uploaded by

Java Collection Framework

Uploaded by

JAVA

Java Collections can achieve all the operations that

Java Collection framework provides many interfaces

List interface is implemented by the classes

You might also like