Java Enumeration and Iterators

Posted February 10, 2006 by William_Wilson in Java programming

The following Tech-Recipes tutorial describes Enumeration and Iterators and how to use them.

Set: an unordered array of elements or objects
Collection: an ordered set
*Vectors already implement the Collection interface, but you can define your own Collection.
*ArrayLists and Vectors, both support Iterators

An enumeration is an object that generates elements one at a time. It is used for passing through a collection, usually of unknown size.
The traversing of elements can only be done once per creation.

Enumeration’s have two options:
nextElement() which returns the next object in the collection
hasMoreElements() which returns true, until the last object has been returned by nextElement()

Code Example:
import java.util.Vector;
import java.util.Enumeration;
public class EnumerationTester {
public static void main(String args[]) {
Enumeration days;
Vector dayNames = new Vector();
days = dayNames.elements();
while (days.hasMoreElements())
System.out.println(days.nextElement()); } }
/*The output will be the days of the week listed in order*/

Enumerations do not allow for the modification of the collection, which is being traversed. Thus the Iterators are used if this is required.

Iterators have three options:
hasNext() returns true if there is another element in the collection
next() which returns the next object
remove() which removes the last object taken using next()

Code Example:
import java.util.Vector;
import java.util.Iterator;
public class IteratorTester {
public static void main(String args[]) {
String[] num = {“one”, “two”, “three”, “four”, “five”,”six”, “seven”, “eight”, “nine”, “ten”};
Vector aVector = new
System.out.println(“Before Vector: ” + aVector);
Iterator nums = aVector.iterator();
while(nums.hasNext()) {
String aString = (String);
if (aString.length() > 4)
nums.remove(); }
System.out.println(“After Vector: ” + aVector); } }
/*displays the collection, then removes items with a length greater than 4 and displays again to show the remove feature */

*Why not use for(int i=0; i< v.size();i++){}? For loops are expensive to the processor when the collection reaches large sizes, as many operations are done just to compute the first line: int i = 0 is an assignment and creation (2 operations)
i get size, check value of i, and compare (3 operations)
i++ gets i then adds 1 to it [++i is only 2 operations] this one (3 operations)
*7/8 operations in total, each time the loop runs through

where an enumeration or iterator uses a while(){}
while(v.hasNext()) has next true or false (1 operation)
while(v.hasMoreElements()) has more true or false (1 operation)
*Only one operation per repeat of this loop

Questions/Comments as always can be sent to: [email protected]
*OR suggestions for other Java tech-recipes

-William. ยง (marvin_gohan)

The Conversation

Follow the reactions below and share your own thoughts.