Complete Traversals and their Implementation Using the Standard Template Library
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 ite...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Centro Latinoamericano de Estudios en Informática
1998-12-01
|
| Series: | CLEI Electronic Journal |
| Online Access: | http://clei.org/cleiej-beta/index.php/cleiej/article/view/378 |