Super Iterator - A design pattern for Algorithm and Data structure collections

Andre Oboler, Charles Twardy, David Albrecht

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - International Conference on Information Technology-New Generations, ITNG 2007
Pages677-678
Number of pages2
DOIs
Publication statusPublished - 28 Aug 2007
Event4th International Conference on Information Technology-New Generations, ITNG 2007 - Las Vegas, United States of America
Duration: 2 Apr 20074 Apr 2007

Conference

Conference4th International Conference on Information Technology-New Generations, ITNG 2007
CountryUnited States of America
CityLas Vegas
Period2/04/074/04/07

Keywords

  • Component based design
  • Generalisation
  • Reuse
  • Software architecture
  • Software patterns

Cite this

Oboler, A., Twardy, C., & Albrecht, D. (2007). Super Iterator - A design pattern for Algorithm and Data structure collections. In Proceedings - International Conference on Information Technology-New Generations, ITNG 2007 (pp. 677-678). [4151760] https://doi.org/10.1109/ITNG.2007.188