1.1 --- a/src/hugo/for_each_macros.h	Fri May 14 15:01:21 2004 +0000
     1.2 +++ b/src/hugo/for_each_macros.h	Fri May 14 15:19:18 2004 +0000
     1.3 @@ -17,6 +17,7 @@
     1.4    /// iterators.
     1.5    /// \code
     1.6    /// Graph g;
     1.7 +  /// ...
     1.8    /// Graph::NodeIt n;
     1.9    /// FOR_EACH_GLOB(n, g) {
    1.10    /// ...
    1.11 @@ -33,6 +34,7 @@
    1.12    /// iterators.
    1.13    /// \code
    1.14    /// Graph g;
    1.15 +  /// ...
    1.16    /// Graph::Node v;
    1.17    /// Graph::OutEdgeIt e;
    1.18    /// FOR_EACH_INC_GLOB(e, g, v) {
    1.19 @@ -40,6 +42,7 @@
    1.20    /// }
    1.21    /// typedef BipartiteGraph<Graph> BGraph;
    1.22    /// BGraph h;
    1.23 +  /// ...
    1.24    /// BGraph::ClassNodeIt n;
    1.25    /// FOR_EACH_INC_GLOB(BGraph::ClassNodeIt, n, h, h.S_CLASS) {
    1.26    /// ...
    1.27 @@ -120,6 +123,7 @@
    1.28    /// iterators.
    1.29    /// \code
    1.30    /// Graph g;
    1.31 +  /// ...
    1.32    /// FOR_EACH_LOC(Graph::NodeIt, n, g) {
    1.33    /// ...
    1.34    /// }
    1.35 @@ -134,12 +138,14 @@
    1.36    /// iterators.
    1.37    /// \code
    1.38    /// Graph g;
    1.39 +  /// ...
    1.40    /// Graph::Node v;
    1.41    /// FOR_EACH_INC_LOC(Graph::OutEdgeIt, e, g, v) {
    1.42    /// ...
    1.43    /// }
    1.44    /// typedef BipartiteGraph<Graph> BGraph;
    1.45    /// BGraph h;
    1.46 +  /// ...
    1.47    /// FOR_EACH_INC_LOC(BGraph::ClassNodeIt, n, h, h.S_CLASS) {
    1.48    /// ...
    1.49    /// }