Paper Info
Title
Super Iterator A design pattern for Algorithm and Data structure collections
Abstract
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.
Year
DOI
Venue
2007
10.1109/ITNG.2007.188
Las Vegas, NV
Keywords
Field
DocType
design pattern,unknown data structure,standard iterator pattern,different iterator,new subtype,specific type,custom data structure,super iterator pattern,common super class,data structure collection,new subclass,new structure,data structure,resource management,component based design,lines of code,data mining,software architecture,switches,algorithm design and analysis,object oriented programming,generalisation,data structures,information technology
Iterator pattern,Data structure,Object-oriented programming,Computer science,Theoretical computer science,Component-based software engineering,Software architecture,Source lines of code,Iterator,Design pattern
Conference
ISBN
Citations 
PageRank 
0-7695-2776-0
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Andre Oboler1143.10
Charles R. Twardy2277.60
David Albrecht335636.66