International Conference on Information Technology (ITNG'07) Super Iterator A design pattern for Algorithm and Data structure collections Las Vegas, Nevada, USA April 02-April 04 ISBN: 0-7695-2776-0
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITNG.2007.188
The Super Iterator pattern, like the standard Iterator pattern, traverses an unknown data structure without exposing that structure. With the standard Iterator pattern, clients must create a different iterator for each new structure, and the object returned must be of the specific type stored in the structure, even when they share a common super class. With the Super Iterator pattern, the object returned is of the common super class, and the iterator itself need not be altered when adding a new subtype with custom data structures. The client, however, must change two lines of code to load and instantiate the new subclass.
Citation:
Andre Oboler, Charles Twardy, David Albrecht, "Super Iterator A design pattern for Algorithm and Data structure collections," itng, pp.677-678, International Conference on Information Technology (ITNG'07), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||