The Collections Framework provides a
well-designed set of interfaces and classes used for storing and manipulating groups
of data into a single unit. The collections framework is a unified architecture
which is used to represent
and manipulate collections. The framework allows the collections to get manipulated independently as well as reduces programming effort for increasing
It includes implementations of interfaces, and algorithms included in it to manipulate them. Basically it is a unified architecture that consists the following collections:
Implementations are the reusable data objects used to store collections, which implement the collection interfaces. Implementations are also responsible for documenting the operations which they support. All of the general-purpose implementations of the Java platform support all of the optional operations.The following kinds of implementations are described below:
|Hash table||Tree||Linked list||Hash table + Linked list|
The Java Collections Framework provides several
general-purpose implementations of the
Map interfaces. Each of the general-purpose implementations
provides all optional operations contained in its interface. All permit null
elements, keys, and values.
The following description describes the categories in which the Collection Framework interfaces are implemented.
The Set implementations are grouped into
general-purpose and special-purpose implementations. List implementations
are grouped into general-purpose and special-purpose implementations.
implementations are grouped into general-purpose, special-purpose, and
concurrent implementations. The Queue implementations are grouped into
general-purpose and concurrent implementations.
Ask Questions? Discuss: Introduction to collection Implementations
Post your Comment
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.