Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:
Ganesh_JavaSE7_Programming_1z0-804_study_guide.pdf
Скачиваний:
94
Добавлен:
02.02.2015
Размер:
5.88 Mб
Скачать

Chapter 6 Generics and Collections

There are many old java.util classes (now known as legacy collection types) that were superceded by new collection classes. Some of them are (with newer types in parentheses): Enumeration (Iterator),

Vector (ArrayList), Dictionary (Map), and Hashtable (HashMap). In addition, Stack and Properties are legacy classes that do not have direct replacements.

The Iterator Interface

Let’s discuss Iterator first since we will be using Iterator to illustrate other concrete classes. The Iterator interface is a simple interface with only three methods: hasNext(), next(), and remove() (see Table 6-5).

Table 6-5.  Methods in the Iterator Interface

 

 

Method

Short Description

boolean hasNext()

Checks if the iterator has more elements to traverse.

E next()

Moves the iterator to the next element and returns that (next) element.

void remove()

Removes the last visited element from the underlying container. next() should have been

 

called before calling remove(); otherwise it will throw an IllegalStateException.

 

 

List Classes

Lists are used for storing a sequence of elements. You can insert an element of the container in a specific position using an index, and retrieve the same element later (i.e., it maintains the insertion order). You can store duplicate elements in a list. There are two concrete classes that you need to know: ArrayList and LinkedList.

ArrayList Class

ArrayList implements a resizable array. When you create a native array (say, new String[10];), the size of the array is known (fixed) at the time of creation. However, ArrayList is a dynamic array: it can grow in size as required. Internally, an ArrayList allocates a block of memory and grows it as required. So, accessing array elements is very fast in an ArrayList. However, when you add or remove elements, internally the rest of the elements are copied; so addition/deletion of elements is a costly operation.

Here’s a simple example to visit elements in an ArrayList. You take an ArrayList and use the for-each construct for traversing a collection:

ArrayList<String> languageList = new ArrayList<>(); languageList.add("C");

languageList.add("C++");

languageList.add("Java");

for(String language : languageList) { System.out.println(language);

}

It prints the following:

C C++ Java

175

Chapter 6 Generics and Collections

This for-each is equivalent to the following code, which explicitly uses an Iterator:

for(Iterator<String> languageIter = languageList.iterator(); languageIter.hasNext();) { String language = languageIter.next();

System.out.println(language);

}

This code segment will also print the same output as the previous for-each loop code. Here is a step-by-step description of how this for loop works:

1.You use the iterator() method to get the iterator for that container. Since languageList is an ArrayList of type <String>, you should create Iterator with String. Name it languageIter.

2.Before entering the loop, you check if there are any elements to visit. You call the hasNext() method for checking that. If it returns true, there are more elements to visit; if it returns false, the iteration is over and you exit the loop.

3.Once you enter the body of the loop, the first thing you have to do is call next() and move the iterator. The next() method returns the iterated value. You capture that return value in the language variable.

4.You print the language value, and then the loop continues.

This iteration idiom—the way you call iterator(), hasNext(), and next() methods—is important to learn; we’ll be using either the for-each loop or this idiom extensively in our examples.

Note that you create ArrayList<String> and Iterator<String> instead of just using ArrayList or Iterator

(i.e., you provide type information along with these classes). The Collection classes are generic classes; therefore you need to specify the type parameters to use them. Here you are storing/iterating a list of strings, so you use <String>.

You can remove elements while traversing a container using iterators. Let’s create an object of ArrayList<Integer> type with ten elements. You’ll iterate over the elements and remove all of them (instead of using the removeAll() method in ArrayList). Listing 6-14 shows the code. Will it work?

Listing 6-14.  TestIterator.java

// This program shows the usage of Iterator

import java.util.*;

class TestIterator {

public static void main(String []args) { ArrayList<Integer> nums = new ArrayList<Integer>(); for(int i = 1; i < 10; i++)

nums.add(i); System.out.println("Original list " + nums); Iterator<Integer> numsIter = nums.iterator(); while(numsIter.hasNext()) {

numsIter.remove();

}

System.out.println("List after removing all elements" + nums);

}

}

176

Chapter 6 Generics and Collections

It prints the following:

Original list [1, 2, 3, 4, 5, 6, 7, 8, 9]

Exception in thread "main" java.lang.IllegalStateException

at java.util.AbstractList$Itr.remove(AbstractList.java:356) at TestIterator.main(Main.java:12)

Oops! What happened? The problem is that you haven’t called next() before calling remove(). Checking hasNext() in the while loop condition, moving to the element using next(), and calling remove() is the correct idiom for removing an element. If you don’t follow it correctly, you can get into trouble (i.e., you’ll get

IllegalStateException). Similarly, if you call remove() twice without sandwiching a next() between the statements, you’ll get this exception.

Let’s fix this program by calling next() before calling remove(). Here is the relevant part of the code:

Iterator<Integer> numsIter = nums.iterator(); while(numsIter.hasNext()) {

numsIter.next();

numsIter.remove();

}

System.out.println("List after removing all elements " + nums);

It prints the list with no elements, as expected:

List after removing all elements []

Remember that next() needs to be called before calling remove() in an Iterator; otherwise, you’ll get an IllegalStateException. Similarly, calling remove() in subsequent statements without calling next() between these statements will also result in this exception. Basically, any modifications to the underlying container while an iterator is traversing through the container will result in this exception.

The ListIterator Interface

You should understand ListIterator first before you look at LinkedList. The ListIterator interface extends the Iterator interface, so it inherits the methods hasNext(), next(), and remove(). Additionally, ListIterator has many other methods (see Table 6-6). Using these methods, you can traverse in the reverse direction, get the previous or next index position, and set or add new elements to the underlying container.

Table 6-6.  Methods in the ListIterator Interface (in Addition to Iterator Methods)

 

 

Method

Short Description

boolean hasPrevious()

Checks if the iterator has more elements to traverse in reverse direction.

Element previous()

Moves the iterator to the next element and returns that (next) element in reverse direction.

int nextIndex()

Returns the index of the next element in the iteration in forward direction.

int previousIndex()

Returns the index of the next element in the iteration in reverse direction.

void set(Element)

Sets the last element visited (using next or previous); it replaces the existing element.

void add(Element)

Adds the element into the list at the current iteration position.

 

 

177

Chapter 6 GeneriCs and ColleCtions

The LinkedList Class

The LinkedList class internally uses a doubly-linked list. So, insertion and deletion is very fast in LinkedList. However, accessing an element entails traversing the nodes one-by-one, so it is slow. When you want to add or remove elements frequently in a list of elements, it is better to use a LinkedList. You’ll see an example of LinkedList together with the ListIterator interface.

A palindrome is a word or phrase that reads the same forward and backward. A palindrome string “abcba” reads the same in both directions. Given a string, how can you determine whether the string is a palindrome or not?

Well, you can determine whether an input string is a palindrome or not by storing the input string in a String and using the charAt() method in a for loop to compare characters (one from the start and another from the end). To show you how to use ListIterator and LinkedList, see Listing 6-15 for a contrived solution that does the same thing.

Listing 6-15. ListIterator.java

// This program demonstrates the usage of ListIterator

import java.util.*;

class ListIteratorTest {

public static void main(String []args) { String palStr = "abcba";

List<Character> palindrome = new LinkedList<Character>();

for(char ch : palStr.toCharArray()) palindrome.add(ch);

System.out.println("Input string is: " + palStr); ListIterator<Character> iterator = palindrome.listIterator();

ListIterator<Character> revIterator = palindrome.listIterator (palindrome.size());

boolean result = true;

while(revIterator.hasPrevious() && iterator.hasNext()) { if(iterator.next() != revIterator.previous()){

result = false; break;

}

}

if (result)

System.out.print("Input string is a palindrome");

else

System.out.print("Input string is not a palindrome");

}

}

It prints the following:

Input string is: abcba

Input string is a palindrome

178

Соседние файлы в предмете [НЕСОРТИРОВАННОЕ]