Complete Traversals and their Implementation Using the Standard Template Library

Authors

  • Eric Gamess Universidad del Valle, Cali, Colombia D
  • David R. Musser Rensselaer Polytechnic Institute, Troy, USA A
  • Arturo J. Sanchez Ruiz Universidad Central de Venezuela, Caracas, Venezuela

DOI:

https://doi.org/10.19153/cleiej.1.2.4

Abstract

A complete traversal of a container C (such as a set) is informally described by the iteration scheme for x in C F(x,C) where F is a function that might possibly modify C by inserting new elements into it. We assume that the order in which the elements are treated is not relevant, as long as the iteration continues until F has been applied to all elements currently in C, including those F has inserted. Standard iteration mechanisms, such as the iterators provided in the C++ Standard Template Library (STL), do not directly support complete traversals. In this paper we present two approaches to complete traversals, both extending the STL framework, one by means of generic algorithms and the other by means of a container adaptor. 

Downloads

Published

1998-12-01

Issue

Vol. 1 No. 2 (1998): Special Issue of Best Papers presented at CLEI'97. Valparaiso

Section

Articles

License

CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).