# HG changeset patch
# User Balazs Dezso <deba@inf.elte.hu>
# Date 1206631643 -3600
# Node ID d59ce3f357216c7bffbdc5d12972af0e1b433764
# Parent f2d66d810c88fed376f6d79890418b04dea40707
Ignore warnings with gcc-4.3
diff -r f2d66d810c88 -r d59ce3f35721 lemon/bits/traits.h
a
|
b
|
namespace lemon { |
150 | 150 | typedef typename Map::Key Key; |
151 | 151 | typedef typename Map::Value Value; |
152 | 152 | |
153 | | typedef const Value ConstReturnValue; |
154 | | typedef const Value ReturnValue; |
| 153 | typedef Value ConstReturnValue; |
| 154 | typedef Value ReturnValue; |
155 | 155 | }; |
156 | 156 | |
157 | 157 | template <typename Map> |
… |
… |
namespace lemon { |
178 | 178 | typedef typename MatrixMap::SecondKey SecondKey; |
179 | 179 | typedef typename MatrixMap::Value Value; |
180 | 180 | |
181 | | typedef const Value ConstReturnValue; |
182 | | typedef const Value ReturnValue; |
| 181 | typedef Value ConstReturnValue; |
| 182 | typedef Value ReturnValue; |
183 | 183 | }; |
184 | 184 | |
185 | 185 | template <typename MatrixMap> |
diff -r f2d66d810c88 -r d59ce3f35721 lemon/list_graph.h
a
|
b
|
namespace lemon { |
115 | 115 | int n; |
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 | } |
121 | 121 | |
… |
… |
namespace lemon { |
125 | 125 | } else { |
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 | } |
132 | 132 | } |