Changeset 184:716b220697a0 in lemon
 Timestamp:
 03/27/08 16:27:23 (11 years ago)
 Branch:
 default
 Phase:
 public
 Files:

 6 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bits/bezier.h
r157 r184 33 33 class BezierBase { 34 34 public: 35 typedef Point<double> Point;35 typedef lemon::dim2::Point<double> Point; 36 36 protected: 37 37 static Point conv(Point x,Point y,double t) {return (1t)*x+t*y;} 
lemon/bits/traits.h
r139 r184 151 151 typedef typename Map::Value Value; 152 152 153 typedef constValue ConstReturnValue;154 typedef constValue ReturnValue;153 typedef Value ConstReturnValue; 154 typedef Value ReturnValue; 155 155 }; 156 156 … … 179 179 typedef typename MatrixMap::Value Value; 180 180 181 typedef constValue ConstReturnValue;182 typedef constValue ReturnValue;181 typedef Value ConstReturnValue; 182 typedef Value ReturnValue; 183 183 }; 184 184 
lemon/dijkstra.h
r169 r184 24 24 ///\brief Dijkstra algorithm. 25 25 26 #include <limits> 26 27 #include <lemon/list_graph.h> 27 28 #include <lemon/bin_heap.h> 
lemon/graph_to_eps.h
r157 r184 1016 1016 else for(ArcIt e(g);e!=INVALID;++e) 1017 1017 if((!_undirectedg.source(e)<g.target(e))&&_arcWidths[e]>0 1018 &&g.source(e)!=g.target(e)) 1018 &&g.source(e)!=g.target(e)) { 1019 1019 if(_drawArrows) { 1020 1020 dim2::Point<double> d(mycoords[g.target(e)]mycoords[g.source(e)]); … … 1036 1036 << _arcColors[e].green() << ' ' 1037 1037 << _arcColors[e].blue() << " arr\n"; 1038 } 1038 } 1039 1039 else os << mycoords[g.source(e)].x << ' ' 1040 1040 << mycoords[g.source(e)].y << ' ' … … 1045 1045 << _arcColors[e].blue() << ' ' 1046 1046 << _arcWidths[e]*_arcWidthScale << " l\n"; 1047 } 1047 1048 os << "grestore\n"; 1048 1049 } 
lemon/list_graph.h
r149 r184 116 116 for(n = first_node; 117 117 n!=1 && nodes[n].first_in == 1; 118 n = nodes[n].next) ;118 n = nodes[n].next) {} 119 119 arc.id = (n == 1) ? 1 : nodes[n].first_in; 120 120 } … … 126 126 int n; 127 127 for(n = nodes[arcs[arc.id].target].next; 128 n!=1 && nodes[n].first_in == 1;129 n = nodes[n].next);128 n!=1 && nodes[n].first_in == 1; 129 n = nodes[n].next) {} 130 130 arc.id = (n == 1) ? 1 : nodes[n].first_in; 131 131 } 
test/test_tools.h
r171 r184 25 25 26 26 #include <iostream> 27 #include <stdlib.h> 27 28 28 29 ///If \c rc is fail, writes an error message and exits. … … 37 38 ///print something like this (and then exits). 38 39 ///\verbatim file_name.cc:123: error: This is obviously false. \endverbatim 39 ///40 ///\todo It should be in \c assert.h41 40 #define check(rc, msg) \ 42 41 if(!(rc)) { \
Note: See TracChangeset
for help on using the changeset viewer.