COIN-OR::LEMON - Graph Library

Changeset 636:e59b0c363a9e in lemon-0.x


Ignore:
Timestamp:
05/14/04 16:41:30 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@834
Message:
 
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/for_each_macros.h

    r409 r636  
    33#define FOR_EACH_MACROS_H
    44
     5// /// \ingroup gwrappers
     6/// \file
     7/// \brief Iteraton macros.
     8///
     9/// This file contains several macros which make easier writting
     10/// for cycles in HUGO, using HUGO iterators.
     11///
     12/// \author Marton Makai
     13
    514namespace hugo {
    615
     16/// The iteration with HUGO iterators i.e. for cycles can be
     17/// written very comfortable with this macro.
     18/// \code
     19/// Graph g;
     20/// Graph::NodeIt n;
     21/// FOR_EACH_GLOB(n, g) {
     22/// ...
     23/// }
     24/// Graph::EdgeIt e;
     25/// FOR_EACH_GLOB(e, g) {
     26/// ...
     27/// }
     28/// In the above cycle, the iterator variable \c n and \c e are global ones.
     29/// \endcode
    730#define FOR_EACH_GLOB(e, g) for((g).first((e)); (g).valid((e)); (g).next((e)))
     31
     32/// The iteration with HUGO iterators i.e. for cycles can be
     33/// written very comfortable with this macro.
     34/// \code
     35/// Graph g;
     36/// Graph::Node v;
     37/// Graph::OutEdgeIt e;
     38/// FOR_EACH_INC_GLOB(e, g, v) {
     39/// ...
     40/// }
     41/// typedef BipartiteGraph<Graph> BGraph;
     42/// BGraph h;
     43/// BGraph::ClassNodeIt n;
     44/// FOR_EACH_INC_GLOB(BGraph::ClassNodeIt, n, h, h.S_CLASS) {
     45/// ...
     46/// }
     47/// In the above cycle, the iterator variable \c e and \c n are global ones.
     48/// \endcode
    849#define FOR_EACH_INC_GLOB(e, g, v) for((g).first((e), (v)); (g).valid((e)); (g).next((e)))
    950
     51/// \deprecated
    1052#define FOR_EACH_EDGE_GLOB(e, g) for((g).first((e)); (g).valid((e)); (g).next((e)))
     53/// \deprecated
    1154#define FOR_EACH_NODE_GLOB(e, g) for((g).first((e)); (g).valid((e)); (g).next((e)))
     55/// \deprecated
    1256#define FOR_EACH_INEDGE_GLOB(e, g, v) for((g).first((e), (v)); (g).valid((e)); (g).next((e)))
     57/// \deprecated
    1358#define FOR_EACH_OUTEDGE_GLOB(e, g, v) for((g).first((e), (v)); (g).valid((e)); (g).next((e)))
    1459
     
    72117//   }
    73118
     119/// The iteration with HUGO iterators i.e. for cycles can be
     120/// written very comfortable with this macro.
     121/// \code
     122/// Graph g;
     123/// FOR_EACH_LOC(Graph::NodeIt, n, g) {
     124/// ...
     125/// }
     126/// FOR_EACH_LOC(Graph::EdgeIt, e, g) {
     127/// ...
     128/// }
     129/// In the above cycle, the iterator variable \c n and \c e are local ones.
     130/// \endcode
    74131#define FOR_EACH_LOC(Ittype, e, g) for(Ittype e=loopFirst(Ittype(), (g)); (g).valid(e); (g).next(e))
     132
     133/// The iteration with HUGO iterators i.e. for cycles can be
     134/// written very comfortable with this macro.
     135/// \code
     136/// Graph g;
     137/// Graph::Node v;
     138/// FOR_EACH_INC_LOC(Graph::OutEdgeIt, e, g, v) {
     139/// ...
     140/// }
     141/// typedef BipartiteGraph<Graph> BGraph;
     142/// BGraph h;
     143/// FOR_EACH_INC_LOC(BGraph::ClassNodeIt, n, h, h.S_CLASS) {
     144/// ...
     145/// }
     146/// In the above cycle, the iterator variable \c e and \c n are local ones.
     147/// \endcode
    75148#define FOR_EACH_INC_LOC(Ittype, e, g, v) for(Ittype e=loopFirst(Ittype(), (g), (v)); (g).valid(e); (g).next(e))
    76149
Note: See TracChangeset for help on using the changeset viewer.