DocumentCode :
2344846
Title :
Super Iterator A design pattern for Algorithm and Data structure collections
Author :
Oboler, Andre ; Twardy, Charles ; Albrecht, David
Author_Institution :
Dept. of Comput., Lancaster Univ.
fYear :
2007
fDate :
2-4 April 2007
Firstpage :
677
Lastpage :
678
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
Keywords :
data structures; object-oriented programming; software architecture; software reusability; Super Iterator; algorithm collections; component based design; data structure collections; design pattern; generalisation; software architecture; software patterns; software reuse; Aggregates; Algorithm design and analysis; Data mining; Data structures; Information technology; Libraries; Protection; Resource management; Software architecture; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology, 2007. ITNG '07. Fourth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
0-7695-2776-0
Type :
conf
DOI :
10.1109/ITNG.2007.188
Filename :
4151760
Link To Document :
بازگشت