Java collections
Download as PPTX, PDF2 likes1,189 views
The Java Collections Framework provides interfaces and implementations for commonly used data structures like lists, sets, maps and queues. The core interfaces like Collection, List, Set, Queue and Map define the common operations for each type of data structure. General purpose implementations provided for these interfaces include ArrayList, LinkedList, HashSet, TreeSet, HashMap and TreeMap. Additional wrapper and convenience implementations add functionality like synchronization or provide optimized versions for specific use cases.
Java collections
- 2. APIs and Versions • Number one hint for programming with Java Collections: use the API ▫ http://java.sun.com/j2se/1.5.0/docs/api/java/util /Collection.html • Be sure to use the 1.5.0 APIs to get the version with generics
- 3. Java Collections Framework • The Java language API provides many of the data structures from this class for you. • It defines a “collection” as “an object that represents a group of objects”. • It defines a collections framework as “a unified architecture for representing and manipulating collections, allowing them to be manipulated independent of the details of their representation.”
- 4. Collections Framework (cont) • Collection Interfaces - Represent different types of collections, such as sets, lists and maps. These interfaces form the basis of the framework. • General-purpose Implementations - Primary implementations of the collection interfaces. • Legacy Implementations - The collection classes from earlier releases, Vector and Hashtable, have been retrofitted to implement the collection interfaces. • Wrapper Implementations - Add functionality, such as synchronization, to other implementations. • Convenience Implementations - High-performance "mini-implementations" of the collection interfaces. • Abstract Implementations - Partial implementations of the collection interfaces to facilitate custom implementations. • Algorithms - Static methods that perform useful functions on collections, such as sorting a list. • Infrastructure - Interfaces that provide essential support for the collection interfaces. • Array Utilities - Utility functions for arrays of primitives and reference objects. Not, strictly speaking, a part of the Collections Framework, this functionality is being added to the Java platform at the same time and relies on some of the same infrastructure.
- 5. Collection interfaces • The core collection interfaces encapsulate different types of collections. They represent the abstract data types that are part of the collections framework. They are interfaces so they do not provide an implementation!
- 6. public interface Collection<E> extends Iterable<E> • Collection — the root of the collection hierarchy. A collection represents a group of objects known as its elements. The Collection interface is the least common denominator that all collections implement and is used to pass collections around and to manipulate them when maximum generality is desired. Some types of collections allow duplicate elements, and others do not. Some are ordered and others are unordered. The Java platform doesn't provide any direct implementations of this interface but provides implementations of more specific subinterfaces, such as Set and List.
- 7. A note on iterators • An Iterator is an object that enables you to traverse through a collection and to remove elements from the collection selectively, if desired. You get an Iterator for a collection by calling its iterator() method. The following is the Iterator interface. public interface Iterator<E> { boolean hasNext(); E next(); void remove(); //optional }
- 8. public interface Set<E> • Set — a Collection<E> extendscollection that cannot contain duplicate elements. This interface models the mathematical set abstraction and is used to represent sets, such as the cards comprising a poker hand, the courses making up a student's schedule, or the processes running on a machine.
- 9. public interface List<E> extends Collection<E> (sometimes called a • List — an ordered collection sequence). Lists can contain duplicate elements. The user of a List generally has precise control over where in the list each element is inserted and can access elements by their integer index (position). If you've used Vector, you're familiar with the general flavor of List.
- 10. public interface Queue<E> extends Collection<E> • Queue — a collection used to hold multiple elements prior to processing. Besides basic Collection operations, a Queue provides additional insertion, extraction, and inspection operations.
- 11. Note on Comparator interface • Comparator is another interface (in addition to Comparable) provided by the Java API which can be used to order objects. • You can use this interface to define an order that is different from the Comparable (natural) order.
- 12. public interface SortedMap<K,V> extends Map<K,V> • SortedMap — a Map that maintains its mappings in ascending key order. This is the Map analog of SortedSet. Sorted maps are used for naturally ordered collections of key/value pairs, such as dictionaries and telephone directories.
- 13. General-purpose Implementations Interfaces Implementations Hash table Set Resizable array Linked list TreeSet (sorted) HashSet List Tree (sorted) Hash table + Linked list LinkedHashSet LinkedList ArrayList Queue Map HashMap TreeMap (sorted) LinkedHashMap Note the naming convention LinkedList also implements queue and there is a PriorityQueue implementation (implemented with heap)
- 14. Other implementations in the API • Wrapper implementations delegate all their real work to a specified collection but add (or remove) extra functionality on top of what the collection offers. ▫ Synchronization Wrappers ▫ Unmodifiable Wrappers • Convenience implementations are miniimplementations that can be more convenient and more efficient than general-purpose implementations when you don't need their full power ▫ ▫ ▫ ▫ List View of an Array Immutable Multiple-Copy List Immutable Singleton Set Empty Set, List, and Map Constants
- 15. public interface Map<K,V> • Map — an object that maps keys to values. A Map cannot contain duplicate keys; each key can map to at most one value. If you've used Hashtable, you're already familiar with the basics of Map.
- 16. public interface SortedSet<E> extends Set<E> that maintains its elements in • SortedSet — a Set ascending order. Several additional operations are provided to take advantage of the ordering. Sorted sets are used for naturally ordered sets, such as word lists and membership rolls.
- 17. Making your own implementations • Most of the time you can use the implementations provided for you in the Java API. • In case the existing implementations do not satisfy your needs, you can write your own by extending the abstract classes provided in the collections framework.