Scribd
Upload
33 views

Linkedlist, Hashset, Treeset: Collections

The document discusses the key components of a collections framework, including interfaces that represent collections, implementations of those interfaces like LinkedList and TreeSet, and algorithms that can be used polymorphically on different implementations. It notes that the Java collections framework was designed with standard interfaces to make extending collections easy. Maps are also covered as storing key-value pairs and being integrated with collections.

Uploaded by

Amutha Arun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views

Linkedlist, Hashset, Treeset: Collections

The document discusses the key components of a collections framework, including interfaces that represent collections, implementations of those interfaces like LinkedList and TreeSet, and algorithms that can be used polymorphically on different implementations. It notes that the Java collections framework was designed with standard interfaces to make extending collections easy. Maps are also covered as storing key-value pairs and being integrated with collections.

Uploaded by

Amutha Arun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Extending and/or adapting a collection had to be easy.

Towards this end, the entire collections framework is designed around a set of standard interfaces. Several standard
implementations such as LinkedList, HashSet, and TreeSet, of these interfaces are provided that you may use as-is
and you may also implement your own collection, if you choose.
A collections framework is a unified architecture for representing and manipulating collections. All collections
frameworks contain the following:

Interfaces: These are abstract data types that represent collections. Interfaces allow collections to be manipulated
independently of the details of their representation. In object-oriented languages, interfaces generally form a
hierarchy.
Implementations, i.e., Classes: These are the concrete implementations of the collection interfaces. In essence,
they are reusable data structures.
Algorithms: These are the methods that perform useful computations, such as searching and sorting, on objects that
implement collection interfaces. The algorithms are said to be polymorphic: that is, the same method can be used on
many different implementations of the appropriate collection interface.
In addition to collections, the framework defines several map interfaces and classes. Maps store key/value pairs.
Although maps are not collections in the proper use of the term, but they are fully integrated with collections.

You might also like