r269:f5965bbf1353
Sun, 21 Sep 2008 18:09:47
[Not Reviewed]
0 comments (0 inline)
0
1
0
| 1 |
/* -*- C++ -*- |
|
| 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
|
| 2 | 2 |
* |
| 3 |
* This file is a part of LEMON, a generic C++ optimization library |
|
| 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
|
| 4 | 4 |
* |
| 5 | 5 |
* Copyright (C) 2003-2008 |
| 6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
| 7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
| 8 | 8 |
* |
| 9 | 9 |
* Permission to use, modify and distribute this software is granted |
| ... | ... |
@@ -73,13 +73,13 @@ |
| 73 | 73 |
<b>Therefore, by convention, <tt>.run()</tt> must be used |
| 74 | 74 |
explicitly to execute a function having named parameters |
| 75 | 75 |
everywhere in LEMON.</b> |
| 76 | 76 |
|
| 77 | 77 |
\section named-templ-func-param Named Function Template Parameters |
| 78 | 78 |
|
| 79 |
A named parameter can also be a template |
|
| 79 |
A named parameter can also be a template function. The usage is |
|
| 80 | 80 |
exactly the same, but the implementation behind is a kind of black |
| 81 | 81 |
magic and they are the dirtiest part of the LEMON code. |
| 82 | 82 |
|
| 83 | 83 |
You will probably never need to know how it works, but if you really |
| 84 | 84 |
committed, have a look at \ref lemon/graph_to_eps.h for an example. |
| 85 | 85 |
|
| ... | ... |
@@ -100,20 +100,20 @@ |
| 100 | 100 |
was instantiated by using a traits class as a template parameter, and |
| 101 | 101 |
the class contains named parameters, we do not have to instantiate again |
| 102 | 102 |
the class with new traits class, but instead adaptor classes can |
| 103 | 103 |
be used as shown in the following example. |
| 104 | 104 |
|
| 105 | 105 |
\code |
| 106 |
Dijkstra<>:: |
|
| 106 |
Dijkstra<>::SetPredMap<NullMap<Node,Arc> >::Create |
|
| 107 | 107 |
\endcode |
| 108 | 108 |
|
| 109 | 109 |
It can also be used in conjunction with other named template |
| 110 | 110 |
parameters in arbitrary order. |
| 111 | 111 |
|
| 112 | 112 |
\code |
| 113 |
Dijkstra<>::SetDistMap<MyMap>::SetPredMap<NullMap<Node, |
|
| 113 |
Dijkstra<>::SetDistMap<MyMap>::SetPredMap<NullMap<Node,Arc> >::Create |
|
| 114 | 114 |
\endcode |
| 115 | 115 |
|
| 116 | 116 |
The result will be an instantiated Dijkstra class, in which the |
| 117 | 117 |
DistMap and the PredMap is modified. |
| 118 | 118 |
|
| 119 | 119 |
*/ |
0 comments (0 inline)