Iterator Pattern
Author: Deron Eriksson
Description: This Java tutorial describes the iterator pattern, a behavioral object pattern.
Tutorial created using:
Windows Vista || JDK 1.6.0_11 || Eclipse JEE Ganymede SR1 (Eclipse 3.4.1)
The iterator pattern is a behavioral object design pattern. The iterator pattern allows for the traversal through the elements in a grouping of objects via a standardized interface. An Iterator interface defines the actions that can be performed. These actions include being able to traverse the objects and also obtain the objects. JavaSW features the widely used java.util.Iterator interface which is used to iterate through things such as Java collections. We can write our own iterator by implementing java.util.Iterator. This interface features the hasNext(), next(), and remove() methods. When writing an iterator for a class, it is very common for the iterator class to be an inner class of the class that we'd like to iterate through. Let's look at an example of this. We have an Item class, which represents an item on a menu. An item has a name and a price. Item.javapackage com.cakes; public class Item { String name; float price; public Item(String name, float price) { this.name = name; this.price = price; } public String toString() { return name + ": $" + price; } } Here is the Menu class. It has a list of menu items of type Item. Items can be added via the addItem() method. The iterator() method returns an iterator of menu items. The MenuIterator class is an inner class of Menu that implements the Iterator interface for Item objects. It contains basic implementations of the hasNext(), next(), and remove() methods. Menu.javapackage com.cakes; import java.util.ArrayList; import java.util.Iterator; import java.util.List; public class Menu { List<Item> menuItems; public Menu() { menuItems = new ArrayList<Item>(); } public void addItem(Item item) { menuItems.add(item); } public Iterator<Item> iterator() { return new MenuIterator(); } class MenuIterator implements Iterator<Item> { int currentIndex = 0; @Override public boolean hasNext() { if (currentIndex >= menuItems.size()) { return false; } else { return true; } } @Override public Item next() { return menuItems.get(currentIndex++); } @Override public void remove() { menuItems.remove(--currentIndex); } } } The Demo class demonstrates the iterator pattern. It creates three items and adds them to the menu object. Next, it gets an Item iterator from the menu object and iterates over the items in the menu. After this, it calls remove() to remove the last item obtained by the iterator. Following this, it gets a new iterator object from the menu and once again iterates over the menu items. Demo.javapackage com.cakes; import java.util.Iterator; public class Demo { public static void main(String[] args) { Item i1 = new Item("spaghetti", 7.50f); Item i2 = new Item("hamburger", 6.00f); Item i3 = new Item("chicken sandwich", 6.50f); Menu menu = new Menu(); menu.addItem(i1); menu.addItem(i2); menu.addItem(i3); System.out.println("Displaying Menu:"); Iterator<Item> iterator = menu.iterator(); while (iterator.hasNext()) { Item item = iterator.next(); System.out.println(item); } System.out.println("\nRemoving last item returned"); iterator.remove(); System.out.println("\nDisplaying Menu:"); iterator = menu.iterator(); while (iterator.hasNext()) { Item item = iterator.next(); System.out.println(item); } } } The console output is shown here. Console OutputDisplaying Menu: spaghetti: $7.5 hamburger: $6.0 chicken sandwich: $6.5 Removing last item returned Displaying Menu: spaghetti: $7.5 hamburger: $6.0 Note that since the menu utilizes a Java collection, we could have used an iterator obtained for the menu list rather than write our own iterator as an inner class. Related Tutorials:
|