0
11
0
11
28
10
28
10
17
198
340
112
82
... | ... |
@@ -49,7 +49,7 @@ |
49 | 49 |
node("source", s). // read 'source' node to s |
50 | 50 |
node("target", t). // read 'target' node to t |
51 | 51 |
run(); |
52 |
} catch ( |
|
52 |
} catch (Exception& error) { // check if there was any error |
|
53 | 53 |
std::cerr << "Error: " << error.what() << std::endl; |
54 | 54 |
return -1; |
55 | 55 |
} |
... | ... |
@@ -310,8 +310,9 @@ |
310 | 310 |
|
311 | 311 |
///This is the type of the return value of ArgParser::operator[](). |
312 | 312 |
///It automatically converts to \c int, \c double, \c bool or |
313 |
///\c std::string if the type of the option matches, otherwise it |
|
314 |
///throws an exception (i.e. it performs runtime type checking). |
|
313 |
///\c std::string if the type of the option matches, which is checked |
|
314 |
///with an \ref LEMON_ASSERT "assertion" (i.e. it performs runtime |
|
315 |
///type checking). |
|
315 | 316 |
class RefType |
316 | 317 |
{ |
317 | 318 |
const ArgParser &_parser; |
... | ... |
@@ -108,7 +108,7 @@ |
108 | 108 |
/// |
109 | 109 |
/// \brief Macro for assertion with customizable message |
110 | 110 |
/// |
111 |
/// Macro for assertion with customizable message. |
|
111 |
/// Macro for assertion with customizable message. |
|
112 | 112 |
/// \param exp An expression that must be convertible to \c bool. If it is \c |
113 | 113 |
/// false, then an assertion is raised. The concrete behaviour depends on the |
114 | 114 |
/// settings of the assertion system. |
... | ... |
@@ -135,16 +135,6 @@ |
135 | 135 |
#endif |
136 | 136 |
class Bfs { |
137 | 137 |
public: |
138 |
///\ref Exception for uninitialized parameters. |
|
139 |
|
|
140 |
///This error represents problems in the initialization of the |
|
141 |
///parameters of the algorithm. |
|
142 |
class UninitializedParameter : public lemon::UninitializedParameter { |
|
143 |
public: |
|
144 |
virtual const char* what() const throw() { |
|
145 |
return "lemon::Bfs::UninitializedParameter"; |
|
146 |
} |
|
147 |
}; |
|
148 | 138 |
|
149 | 139 |
///The type of the digraph the algorithm runs on. |
150 | 140 |
typedef typename TR::Digraph Digraph; |
... | ... |
@@ -232,7 +222,8 @@ |
232 | 222 |
typedef T PredMap; |
233 | 223 |
static PredMap *createPredMap(const Digraph &) |
234 | 224 |
{ |
235 |
|
|
225 |
LEMON_ASSERT(false, "PredMap is not initialized"); |
|
226 |
return 0; // ignore warnings |
|
236 | 227 |
} |
237 | 228 |
}; |
238 | 229 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -250,7 +241,8 @@ |
250 | 241 |
typedef T DistMap; |
251 | 242 |
static DistMap *createDistMap(const Digraph &) |
252 | 243 |
{ |
253 |
|
|
244 |
LEMON_ASSERT(false, "DistMap is not initialized"); |
|
245 |
return 0; // ignore warnings |
|
254 | 246 |
} |
255 | 247 |
}; |
256 | 248 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -268,7 +260,8 @@ |
268 | 260 |
typedef T ReachedMap; |
269 | 261 |
static ReachedMap *createReachedMap(const Digraph &) |
270 | 262 |
{ |
271 |
|
|
263 |
LEMON_ASSERT(false, "ReachedMap is not initialized"); |
|
264 |
return 0; // ignore warnings |
|
272 | 265 |
} |
273 | 266 |
}; |
274 | 267 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -286,7 +279,8 @@ |
286 | 279 |
typedef T ProcessedMap; |
287 | 280 |
static ProcessedMap *createProcessedMap(const Digraph &) |
288 | 281 |
{ |
289 |
|
|
282 |
LEMON_ASSERT(false, "ProcessedMap is not initialized"); |
|
283 |
return 0; // ignore warnings |
|
290 | 284 |
} |
291 | 285 |
}; |
292 | 286 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -304,6 +298,7 @@ |
304 | 298 |
static ProcessedMap *createProcessedMap(const Digraph &g) |
305 | 299 |
{ |
306 | 300 |
return new ProcessedMap(g); |
301 |
return 0; // ignore warnings |
|
307 | 302 |
} |
308 | 303 |
}; |
309 | 304 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -1040,7 +1035,6 @@ |
1040 | 1035 |
///\return \c true if \c t is reachable form \c s. |
1041 | 1036 |
bool run(Node s, Node t) |
1042 | 1037 |
{ |
1043 |
if (s==INVALID || t==INVALID) throw UninitializedParameter(); |
|
1044 | 1038 |
Bfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); |
1045 | 1039 |
if (Base::_pred) |
1046 | 1040 |
alg.predMap(*reinterpret_cast<PredMap*>(Base::_pred)); |
... | ... |
@@ -1323,18 +1317,6 @@ |
1323 | 1317 |
class BfsVisit { |
1324 | 1318 |
public: |
1325 | 1319 |
|
1326 |
/// \brief \ref Exception for uninitialized parameters. |
|
1327 |
/// |
|
1328 |
/// This error represents problems in the initialization |
|
1329 |
/// of the parameters of the algorithm. |
|
1330 |
class UninitializedParameter : public lemon::UninitializedParameter { |
|
1331 |
public: |
|
1332 |
virtual const char* what() const throw() |
|
1333 |
{ |
|
1334 |
return "lemon::BfsVisit::UninitializedParameter"; |
|
1335 |
} |
|
1336 |
}; |
|
1337 |
|
|
1338 | 1320 |
///The traits class. |
1339 | 1321 |
typedef _Traits Traits; |
1340 | 1322 |
|
... | ... |
@@ -1389,7 +1371,8 @@ |
1389 | 1371 |
struct SetReachedMapTraits : public Traits { |
1390 | 1372 |
typedef T ReachedMap; |
1391 | 1373 |
static ReachedMap *createReachedMap(const Digraph &digraph) { |
1392 |
|
|
1374 |
LEMON_ASSERT(false, "ReachedMap is not initialized"); |
|
1375 |
return 0; // ignore warnings |
|
1393 | 1376 |
} |
1394 | 1377 |
}; |
1395 | 1378 |
/// \brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -129,7 +129,6 @@ |
129 | 129 |
/// already stored in the heap. |
130 | 130 |
/// Otherwise it inserts the given item with the given priority. |
131 | 131 |
/// |
132 |
/// It may throw an \ref UnderflowPriorityException. |
|
133 | 132 |
/// \param i The item. |
134 | 133 |
/// \param p The priority. |
135 | 134 |
void set(const Item &i, const Prio &p) {} |
... | ... |
@@ -136,16 +136,6 @@ |
136 | 136 |
#endif |
137 | 137 |
class Dfs { |
138 | 138 |
public: |
139 |
///\ref Exception for uninitialized parameters. |
|
140 |
|
|
141 |
///This error represents problems in the initialization of the |
|
142 |
///parameters of the algorithm. |
|
143 |
class UninitializedParameter : public lemon::UninitializedParameter { |
|
144 |
public: |
|
145 |
virtual const char* what() const throw() { |
|
146 |
return "lemon::Dfs::UninitializedParameter"; |
|
147 |
} |
|
148 |
}; |
|
149 | 139 |
|
150 | 140 |
///The type of the digraph the algorithm runs on. |
151 | 141 |
typedef typename TR::Digraph Digraph; |
... | ... |
@@ -232,7 +222,8 @@ |
232 | 222 |
typedef T PredMap; |
233 | 223 |
static PredMap *createPredMap(const Digraph &) |
234 | 224 |
{ |
235 |
|
|
225 |
LEMON_ASSERT(false, "PredMap is not initialized"); |
|
226 |
return 0; // ignore warnings |
|
236 | 227 |
} |
237 | 228 |
}; |
238 | 229 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -250,7 +241,8 @@ |
250 | 241 |
typedef T DistMap; |
251 | 242 |
static DistMap *createDistMap(const Digraph &) |
252 | 243 |
{ |
253 |
|
|
244 |
LEMON_ASSERT(false, "DistMap is not initialized"); |
|
245 |
return 0; // ignore warnings |
|
254 | 246 |
} |
255 | 247 |
}; |
256 | 248 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -268,7 +260,8 @@ |
268 | 260 |
typedef T ReachedMap; |
269 | 261 |
static ReachedMap *createReachedMap(const Digraph &) |
270 | 262 |
{ |
271 |
|
|
263 |
LEMON_ASSERT(false, "ReachedMap is not initialized"); |
|
264 |
return 0; // ignore warnings |
|
272 | 265 |
} |
273 | 266 |
}; |
274 | 267 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -286,7 +279,8 @@ |
286 | 279 |
typedef T ProcessedMap; |
287 | 280 |
static ProcessedMap *createProcessedMap(const Digraph &) |
288 | 281 |
{ |
289 |
|
|
282 |
LEMON_ASSERT(false, "ProcessedMap is not initialized"); |
|
283 |
return 0; // ignore warnings |
|
290 | 284 |
} |
291 | 285 |
}; |
292 | 286 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -974,7 +968,6 @@ |
974 | 968 |
///\return \c true if \c t is reachable form \c s. |
975 | 969 |
bool run(Node s, Node t) |
976 | 970 |
{ |
977 |
if (s==INVALID || t==INVALID) throw UninitializedParameter(); |
|
978 | 971 |
Dfs<Digraph,TR> alg(*reinterpret_cast<const Digraph*>(Base::_g)); |
979 | 972 |
if (Base::_pred) |
980 | 973 |
alg.predMap(*reinterpret_cast<PredMap*>(Base::_pred)); |
... | ... |
@@ -1270,18 +1263,6 @@ |
1270 | 1263 |
class DfsVisit { |
1271 | 1264 |
public: |
1272 | 1265 |
|
1273 |
/// \brief \ref Exception for uninitialized parameters. |
|
1274 |
/// |
|
1275 |
/// This error represents problems in the initialization |
|
1276 |
/// of the parameters of the algorithm. |
|
1277 |
class UninitializedParameter : public lemon::UninitializedParameter { |
|
1278 |
public: |
|
1279 |
virtual const char* what() const throw() |
|
1280 |
{ |
|
1281 |
return "lemon::DfsVisit::UninitializedParameter"; |
|
1282 |
} |
|
1283 |
}; |
|
1284 |
|
|
1285 | 1266 |
///The traits class. |
1286 | 1267 |
typedef _Traits Traits; |
1287 | 1268 |
|
... | ... |
@@ -1336,7 +1317,8 @@ |
1336 | 1317 |
struct SetReachedMapTraits : public Traits { |
1337 | 1318 |
typedef T ReachedMap; |
1338 | 1319 |
static ReachedMap *createReachedMap(const Digraph &digraph) { |
1339 |
|
|
1320 |
LEMON_ASSERT(false, "ReachedMap is not initialized"); |
|
1321 |
return 0; // ignore warnings |
|
1340 | 1322 |
} |
1341 | 1323 |
}; |
1342 | 1324 |
/// \brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -225,16 +225,6 @@ |
225 | 225 |
#endif |
226 | 226 |
class Dijkstra { |
227 | 227 |
public: |
228 |
///\ref Exception for uninitialized parameters. |
|
229 |
|
|
230 |
///This error represents problems in the initialization of the |
|
231 |
///parameters of the algorithm. |
|
232 |
class UninitializedParameter : public lemon::UninitializedParameter { |
|
233 |
public: |
|
234 |
virtual const char* what() const throw() { |
|
235 |
return "lemon::Dijkstra::UninitializedParameter"; |
|
236 |
} |
|
237 |
}; |
|
238 | 228 |
|
239 | 229 |
///The type of the digraph the algorithm runs on. |
240 | 230 |
typedef typename TR::Digraph Digraph; |
... | ... |
@@ -332,7 +322,8 @@ |
332 | 322 |
typedef T PredMap; |
333 | 323 |
static PredMap *createPredMap(const Digraph &) |
334 | 324 |
{ |
335 |
|
|
325 |
LEMON_ASSERT(false, "PredMap is not initialized"); |
|
326 |
return 0; // ignore warnings |
|
336 | 327 |
} |
337 | 328 |
}; |
338 | 329 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -351,7 +342,8 @@ |
351 | 342 |
typedef T DistMap; |
352 | 343 |
static DistMap *createDistMap(const Digraph &) |
353 | 344 |
{ |
354 |
|
|
345 |
LEMON_ASSERT(false, "DistMap is not initialized"); |
|
346 |
return 0; // ignore warnings |
|
355 | 347 |
} |
356 | 348 |
}; |
357 | 349 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -370,7 +362,8 @@ |
370 | 362 |
typedef T ProcessedMap; |
371 | 363 |
static ProcessedMap *createProcessedMap(const Digraph &) |
372 | 364 |
{ |
373 |
|
|
365 |
LEMON_ASSERT(false, "ProcessedMap is not initialized"); |
|
366 |
return 0; // ignore warnings |
|
374 | 367 |
} |
375 | 368 |
}; |
376 | 369 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -408,11 +401,13 @@ |
408 | 401 |
typedef CR HeapCrossRef; |
409 | 402 |
typedef H Heap; |
410 | 403 |
static HeapCrossRef *createHeapCrossRef(const Digraph &) { |
411 |
|
|
404 |
LEMON_ASSERT(false, "HeapCrossRef is not initialized"); |
|
405 |
return 0; // ignore warnings |
|
412 | 406 |
} |
413 | 407 |
static Heap *createHeap(HeapCrossRef &) |
414 | 408 |
{ |
415 |
|
|
409 |
LEMON_ASSERT(false, "Heap is not initialized"); |
|
410 |
return 0; // ignore warnings |
|
416 | 411 |
} |
417 | 412 |
}; |
418 | 413 |
///\brief \ref named-templ-param "Named parameter" for setting |
... | ... |
@@ -1158,7 +1153,6 @@ |
1158 | 1153 |
///in order to compute the shortest path to each node. |
1159 | 1154 |
void run(Node s) |
1160 | 1155 |
{ |
1161 |
if (s==INVALID) throw UninitializedParameter(); |
|
1162 | 1156 |
Dijkstra<Digraph,LengthMap,TR> |
1163 | 1157 |
dijk(*reinterpret_cast<const Digraph*>(Base::_g), |
1164 | 1158 |
*reinterpret_cast<const LengthMap*>(Base::_length)); |
... | ... |
@@ -1180,7 +1174,6 @@ |
1180 | 1174 |
///\return \c true if \c t is reachable form \c s. |
1181 | 1175 |
bool run(Node s, Node t) |
1182 | 1176 |
{ |
1183 |
if (s==INVALID || t==INVALID) throw UninitializedParameter(); |
|
1184 | 1177 |
Dijkstra<Digraph,LengthMap,TR> |
1185 | 1178 |
dijk(*reinterpret_cast<const Digraph*>(Base::_g), |
1186 | 1179 |
*reinterpret_cast<const LengthMap*>(Base::_length)); |
... | ... |
@@ -35,380 +35,238 @@ |
35 | 35 |
/// \addtogroup exceptions |
36 | 36 |
/// @{ |
37 | 37 |
|
38 |
/// \brief |
|
38 |
/// \brief Generic exception class. |
|
39 | 39 |
/// |
40 |
/// Exception safe wrapper class to implement the members of exceptions. |
|
41 |
template <typename _Type> |
|
42 |
class ExceptionMember { |
|
43 |
public: |
|
44 |
typedef _Type Type; |
|
45 |
|
|
46 |
ExceptionMember() throw() { |
|
47 |
try { |
|
48 |
ptr.reset(new Type()); |
|
49 |
} catch (...) {} |
|
50 |
} |
|
51 |
|
|
52 |
ExceptionMember(const Type& type) throw() { |
|
53 |
try { |
|
54 |
ptr.reset(new Type()); |
|
55 |
if (ptr.get() == 0) return; |
|
56 |
*ptr = type; |
|
57 |
} catch (...) {} |
|
58 |
} |
|
59 |
|
|
60 |
ExceptionMember(const ExceptionMember& copy) throw() { |
|
61 |
try { |
|
62 |
if (!copy.valid()) return; |
|
63 |
ptr.reset(new Type()); |
|
64 |
if (ptr.get() == 0) return; |
|
65 |
*ptr = copy.get(); |
|
66 |
} catch (...) {} |
|
67 |
} |
|
68 |
|
|
69 |
ExceptionMember& operator=(const ExceptionMember& copy) throw() { |
|
70 |
if (ptr.get() == 0) return; |
|
71 |
try { |
|
72 |
if (!copy.valid()) return; |
|
73 |
*ptr = copy.get(); |
|
74 |
} catch (...) {} |
|
75 |
} |
|
76 |
|
|
77 |
void set(const Type& type) throw() { |
|
78 |
if (ptr.get() == 0) return; |
|
79 |
try { |
|
80 |
*ptr = type; |
|
81 |
} catch (...) {} |
|
82 |
} |
|
83 |
|
|
84 |
const Type& get() const { |
|
85 |
return *ptr; |
|
86 |
} |
|
87 |
|
|
88 |
bool valid() const throw() { |
|
89 |
return ptr.get() != 0; |
|
90 |
} |
|
91 |
|
|
92 |
private: |
|
93 |
std::auto_ptr<_Type> ptr; |
|
94 |
}; |
|
95 |
|
|
96 |
/// Exception-safe convenient error message builder class. |
|
97 |
|
|
98 |
/// Helper class which provides a convenient ostream-like (operator << |
|
99 |
/// based) interface to create a string message. Mostly useful in |
|
100 |
/// exception classes (therefore the name). |
|
101 |
class ErrorMessage { |
|
102 |
protected: |
|
103 |
///\e |
|
104 |
|
|
105 |
mutable std::auto_ptr<std::ostringstream> buf; |
|
106 |
|
|
107 |
///\e |
|
108 |
bool init() throw() { |
|
109 |
try { |
|
110 |
buf.reset(new std::ostringstream); |
|
111 |
} |
|
112 |
catch(...) { |
|
113 |
buf.reset(); |
|
114 |
} |
|
115 |
return buf.get(); |
|
116 |
} |
|
117 |
|
|
118 |
public: |
|
119 |
|
|
120 |
///\e |
|
121 |
ErrorMessage() throw() { init(); } |
|
122 |
|
|
123 |
ErrorMessage(const ErrorMessage& em) throw() : buf(em.buf) { } |
|
124 |
|
|
125 |
///\e |
|
126 |
ErrorMessage(const char *msg) throw() { |
|
127 |
init(); |
|
128 |
*this << msg; |
|
129 |
} |
|
130 |
|
|
131 |
///\e |
|
132 |
ErrorMessage(const std::string &msg) throw() { |
|
133 |
init(); |
|
134 |
*this << msg; |
|
135 |
} |
|
136 |
|
|
137 |
///\e |
|
138 |
template <typename T> |
|
139 |
ErrorMessage& operator<<(const T &t) throw() { |
|
140 |
if( ! buf.get() ) return *this; |
|
141 |
|
|
142 |
try { |
|
143 |
*buf << t; |
|
144 |
} |
|
145 |
catch(...) { |
|
146 |
buf.reset(); |
|
147 |
} |
|
148 |
return *this; |
|
149 |
} |
|
150 |
|
|
151 |
///\e |
|
152 |
const char* message() throw() { |
|
153 |
if( ! buf.get() ) return 0; |
|
154 |
|
|
155 |
const char* mes = 0; |
|
156 |
try { |
|
157 |
mes = buf->str().c_str(); |
|
158 |
} |
|
159 |
catch(...) {} |
|
160 |
return mes; |
|
161 |
} |
|
162 |
|
|
163 |
}; |
|
164 |
|
|
165 |
/// Generic exception class. |
|
166 |
|
|
167 | 40 |
/// Base class for exceptions used in LEMON. |
168 | 41 |
/// |
169 | 42 |
class Exception : public std::exception { |
170 | 43 |
public: |
171 |
///\e |
|
44 |
///\e Constructor |
|
172 | 45 |
Exception() {} |
173 |
///\e |
|
46 |
///\e Virtual destructor |
|
174 | 47 |
virtual ~Exception() throw() {} |
175 |
///\e |
|
48 |
///\e A short description of the exception |
|
176 | 49 |
virtual const char* what() const throw() { |
177 | 50 |
return "lemon::Exception"; |
178 | 51 |
} |
179 | 52 |
}; |
180 | 53 |
|
181 |
/// |
|
54 |
/// \brief Input-Output error |
|
55 |
/// |
|
56 |
/// This exception is thrown when a file operation cannot be |
|
57 |
/// succeeded. |
|
58 |
class IoError : public Exception { |
|
59 |
protected: |
|
60 |
std::string _message; |
|
61 |
std::string _file; |
|
182 | 62 |
|
183 |
/// Logic errors represent problems in the internal logic of a program; |
|
184 |
/// in theory, these are preventable, and even detectable before the |
|
185 |
/// program runs (e.g. violations of class invariants). |
|
186 |
/// |
|
187 |
/// A typical example for this is \ref UninitializedParameter. |
|
188 |
class LogicError : public Exception { |
|
63 |
mutable std::string _what; |
|
189 | 64 |
public: |
65 |
|
|
66 |
/// Copy constructor |
|
67 |
IoError(const IoError &error) { |
|
68 |
message(error._message); |
|
69 |
file(error._file); |
|
70 |
} |
|
71 |
|
|
72 |
/// Constructor |
|
73 |
explicit IoError(const char *message) { |
|
74 |
IoError::message(message); |
|
75 |
} |
|
76 |
|
|
77 |
/// Constructor |
|
78 |
explicit IoError(const std::string &message) { |
|
79 |
IoError::message(message); |
|
80 |
} |
|
81 |
|
|
82 |
/// Constructor |
|
83 |
IoError(const std::string &file, const char *message) { |
|
84 |
IoError::message(message); |
|
85 |
IoError::file(file); |
|
86 |
} |
|
87 |
|
|
88 |
/// Constructor |
|
89 |
IoError(const std::string &file, const std::string &message) { |
|
90 |
IoError::message(message); |
|
91 |
IoError::file(file); |
|
92 |
} |
|
93 |
|
|
94 |
/// Virtual destructor |
|
95 |
virtual ~IoError() throw() {} |
|
96 |
|
|
97 |
/// Set the error message |
|
98 |
void message(const char *message) { |
|
99 |
try { |
|
100 |
_message = message; |
|
101 |
} catch (...) {} |
|
102 |
} |
|
103 |
|
|
104 |
/// Set the error message |
|
105 |
void message(const std::string& message) { |
|
106 |
try { |
|
107 |
_message = message; |
|
108 |
} catch (...) {} |
|
109 |
} |
|
110 |
|
|
111 |
/// Set the file name |
|
112 |
void file(const std::string &file) { |
|
113 |
try { |
|
114 |
_file = file; |
|
115 |
} catch (...) {} |
|
116 |
} |
|
117 |
|
|
118 |
/// Returns the error message |
|
119 |
const std::string& message() const { |
|
120 |
return _message; |
|
121 |
} |
|
122 |
|
|
123 |
/// \brief Returns the filename |
|
124 |
/// |
|
125 |
/// Returns the filename or empty string if the filename was not |
|
126 |
/// specified. |
|
127 |
const std::string& file() const { |
|
128 |
return _file; |
|
129 |
} |
|
130 |
|
|
131 |
/// \brief Returns a short error message |
|
132 |
/// |
|
133 |
/// Returns a short error message which contains the message, the |
|
134 |
/// file name and the line number. |
|
190 | 135 |
virtual const char* what() const throw() { |
191 |
|
|
136 |
try { |
|
137 |
_what.clear(); |
|
138 |
std::ostringstream oss; |
|
139 |
oss << "lemon:IoError" << ": "; |
|
140 |
oss << message(); |
|
141 |
if (!file().empty()) { |
|
142 |
oss << " ("; |
|
143 |
if (!file().empty()) oss << "with file '" << file() << "'"; |
|
144 |
oss << ")"; |
|
145 |
} |
|
146 |
_what = oss.str(); |
|
147 |
} |
|
148 |
catch (...) {} |
|
149 |
if (!_what.empty()) return _what.c_str(); |
|
150 |
else return "lemon:IoError"; |
|
192 | 151 |
} |
152 |
|
|
193 | 153 |
}; |
194 | 154 |
|
195 |
/// \ref Exception for uninitialized parameters. |
|
196 |
|
|
197 |
/// This error represents problems in the initialization |
|
198 |
/// of the parameters of the algorithms. |
|
199 |
class UninitializedParameter : public LogicError { |
|
200 |
public: |
|
201 |
virtual const char* what() const throw() { |
|
202 |
return "lemon::UninitializedParameter"; |
|
203 |
} |
|
204 |
}; |
|
205 |
|
|
206 |
|
|
207 |
/// One of the two main subclasses of \ref Exception. |
|
208 |
|
|
209 |
/// Runtime errors represent problems outside the scope of a program; |
|
210 |
/// they cannot be easily predicted and can generally only be caught |
|
211 |
/// as the program executes. |
|
212 |
class RuntimeError : public Exception { |
|
213 |
public: |
|
214 |
virtual const char* what() const throw() { |
|
215 |
return "lemon::RuntimeError"; |
|
216 |
} |
|
217 |
}; |
|
218 |
|
|
219 |
///\e |
|
220 |
class RangeError : public RuntimeError { |
|
221 |
public: |
|
222 |
virtual const char* what() const throw() { |
|
223 |
return "lemon::RangeError"; |
|
224 |
} |
|
225 |
}; |
|
226 |
|
|
227 |
///\e |
|
228 |
class IoError : public RuntimeError { |
|
229 |
public: |
|
230 |
virtual const char* what() const throw() { |
|
231 |
return "lemon::IoError"; |
|
232 |
} |
|
233 |
}; |
|
234 |
|
|
235 |
///\e |
|
236 |
class DataFormatError : public IoError { |
|
155 |
/// \brief Format error |
|
156 |
/// |
|
157 |
/// This class is used to indicate if an input file has wrong |
|
158 |
/// formatting, or a data representation is not legal. |
|
159 |
class FormatError : public Exception { |
|
237 | 160 |
protected: |
238 |
ExceptionMember<std::string> _message; |
|
239 |
ExceptionMember<std::string> _file; |
|
161 |
std::string _message; |
|
162 |
std::string _file; |
|
240 | 163 |
int _line; |
241 | 164 |
|
242 |
mutable |
|
165 |
mutable std::string _what; |
|
243 | 166 |
public: |
244 | 167 |
|
245 |
DataFormatError(const DataFormatError &dfe) : |
|
246 |
IoError(dfe), _message(dfe._message), _file(dfe._file), |
|
247 |
_line(dfe._line) {} |
|
248 |
|
|
249 |
///\e |
|
250 |
explicit DataFormatError(const char *the_message) |
|
251 |
: _message(the_message), _line(0) {} |
|
252 |
|
|
253 |
///\e |
|
254 |
DataFormatError(const std::string &file_name, int line_num, |
|
255 |
const char *the_message) |
|
256 |
: _message(the_message), _line(line_num) { file(file_name); } |
|
257 |
|
|
258 |
///\e |
|
259 |
void line(int ln) { _line = ln; } |
|
260 |
///\e |
|
261 |
void message(const std::string& msg) { _message.set(msg); } |
|
262 |
///\e |
|
263 |
void file(const std::string &fl) { _file.set(fl); } |
|
264 |
|
|
265 |
///\e |
|
266 |
int line() const { return _line; } |
|
267 |
///\e |
|
268 |
const char* message() const { |
|
269 |
if (_message.valid() && !_message.get().empty()) { |
|
270 |
return _message.get().c_str(); |
|
271 |
} else { |
|
272 |
return 0; |
|
273 |
|
|
168 |
/// Copy constructor |
|
169 |
FormatError(const FormatError &error) { |
|
170 |
message(error._message); |
|
171 |
file(error._file); |
|
172 |
line(error._line); |
|
274 | 173 |
} |
275 | 174 |
|
276 |
/// \brief Returns the filename. |
|
277 |
/// |
|
278 |
/// Returns \e null if the filename was not specified. |
|
279 |
const char* file() const { |
|
280 |
if (_file.valid() && !_file.get().empty()) { |
|
281 |
return _file.get().c_str(); |
|
282 |
} else { |
|
283 |
return 0; |
|
284 |
|
|
175 |
/// Constructor |
|
176 |
explicit FormatError(const char *message) { |
|
177 |
FormatError::message(message); |
|
178 |
_line = 0; |
|
285 | 179 |
} |
286 | 180 |
|
287 |
/// |
|
181 |
/// Constructor |
|
182 |
explicit FormatError(const std::string &message) { |
|
183 |
FormatError::message(message); |
|
184 |
_line = 0; |
|
185 |
} |
|
186 |
|
|
187 |
/// Constructor |
|
188 |
FormatError(const std::string &file, int line, const char *message) { |
|
189 |
FormatError::message(message); |
|
190 |
FormatError::file(file); |
|
191 |
FormatError::line(line); |
|
192 |
} |
|
193 |
|
|
194 |
/// Constructor |
|
195 |
FormatError(const std::string &file, int line, const std::string &message) { |
|
196 |
FormatError::message(message); |
|
197 |
FormatError::file(file); |
|
198 |
FormatError::line(line); |
|
199 |
} |
|
200 |
|
|
201 |
/// Virtual destructor |
|
202 |
virtual ~FormatError() throw() {} |
|
203 |
|
|
204 |
/// Set the line number |
|
205 |
void line(int line) { _line = line; } |
|
206 |
|
|
207 |
/// Set the error message |
|
208 |
void message(const char *message) { |
|
209 |
try { |
|
210 |
_message = message; |
|
211 |
} catch (...) {} |
|
212 |
} |
|
213 |
|
|
214 |
/// Set the error message |
|
215 |
void message(const std::string& message) { |
|
216 |
try { |
|
217 |
_message = message; |
|
218 |
} catch (...) {} |
|
219 |
} |
|
220 |
|
|
221 |
/// Set the file name |
|
222 |
void file(const std::string &file) { |
|
223 |
try { |
|
224 |
_file = file; |
|
225 |
} catch (...) {} |
|
226 |
} |
|
227 |
|
|
228 |
/// \brief Returns the line number |
|
229 |
/// |
|
230 |
/// Returns the line number or zero if it was not specified. |
|
231 |
int line() const { return _line; } |
|
232 |
|
|
233 |
/// Returns the error message |
|
234 |
const std::string& message() const { |
|
235 |
return _message; |
|
236 |
} |
|
237 |
|
|
238 |
/// \brief Returns the filename |
|
239 |
/// |
|
240 |
/// Returns the filename or empty string if the filename was not |
|
241 |
/// specified. |
|
242 |
const std::string& file() const { |
|
243 |
return _file; |
|
244 |
} |
|
245 |
|
|
246 |
/// \brief Returns a short error message |
|
247 |
/// |
|
248 |
/// Returns a short error message which contains the message, the |
|
249 |
/// file name and the line number. |
|
288 | 250 |
virtual const char* what() const throw() { |
289 | 251 |
try { |
290 |
std::ostringstream ostr; |
|
291 |
ostr << "lemon:DataFormatError" << ": "; |
|
292 |
if (message()) ostr << message(); |
|
293 |
if( file() || line() != 0 ) { |
|
294 |
ostr << " ("; |
|
295 |
if( file() ) ostr << "in file '" << file() << "'"; |
|
296 |
if( file() && line() != 0 ) ostr << " "; |
|
297 |
if( line() != 0 ) ostr << "at line " << line(); |
|
298 |
|
|
252 |
_what.clear(); |
|
253 |
std::ostringstream oss; |
|
254 |
oss << "lemon:FormatError" << ": "; |
|
255 |
oss << message(); |
|
256 |
if (!file().empty() || line() != 0) { |
|
257 |
oss << " ("; |
|
258 |
if (!file().empty()) oss << "in file '" << file() << "'"; |
|
259 |
if (!file().empty() && line() != 0) oss << " "; |
|
260 |
if (line() != 0) oss << "at line " << line(); |
|
261 |
oss << ")"; |
|
299 | 262 |
} |
300 |
|
|
263 |
_what = oss.str(); |
|
301 | 264 |
} |
302 | 265 |
catch (...) {} |
303 |
if( _message_holder.valid()) return _message_holder.get().c_str(); |
|
304 |
return "lemon:DataFormatError"; |
|
266 |
if (!_what.empty()) return _what.c_str(); |
|
267 |
else return "lemon:FormatError"; |
|
305 | 268 |
} |
306 | 269 |
|
307 |
virtual ~DataFormatError() throw() {} |
|
308 |
}; |
|
309 |
|
|
310 |
///\e |
|
311 |
class FileOpenError : public IoError { |
|
312 |
protected: |
|
313 |
ExceptionMember<std::string> _file; |
|
314 |
|
|
315 |
mutable ExceptionMember<std::string> _message_holder; |
|
316 |
public: |
|
317 |
|
|
318 |
FileOpenError(const FileOpenError &foe) : |
|
319 |
IoError(foe), _file(foe._file) {} |
|
320 |
|
|
321 |
///\e |
|
322 |
explicit FileOpenError(const std::string& fl) |
|
323 |
: _file(fl) {} |
|
324 |
|
|
325 |
|
|
326 |
///\e |
|
327 |
void file(const std::string &fl) { _file.set(fl); } |
|
328 |
|
|
329 |
/// \brief Returns the filename. |
|
330 |
/// |
|
331 |
/// Returns \e null if the filename was not specified. |
|
332 |
const char* file() const { |
|
333 |
if (_file.valid() && !_file.get().empty()) { |
|
334 |
return _file.get().c_str(); |
|
335 |
} else { |
|
336 |
return 0; |
|
337 |
} |
|
338 |
} |
|
339 |
|
|
340 |
///\e |
|
341 |
virtual const char* what() const throw() { |
|
342 |
try { |
|
343 |
std::ostringstream ostr; |
|
344 |
ostr << "lemon::FileOpenError" << ": "; |
|
345 |
ostr << "Cannot open file - " << file(); |
|
346 |
_message_holder.set(ostr.str()); |
|
347 |
} |
|
348 |
catch (...) {} |
|
349 |
if( _message_holder.valid()) return _message_holder.get().c_str(); |
|
350 |
return "lemon::FileOpenError"; |
|
351 |
} |
|
352 |
virtual ~FileOpenError() throw() {} |
|
353 |
}; |
|
354 |
|
|
355 |
class IoParameterError : public IoError { |
|
356 |
protected: |
|
357 |
ExceptionMember<std::string> _message; |
|
358 |
ExceptionMember<std::string> _file; |
|
359 |
|
|
360 |
mutable ExceptionMember<std::string> _message_holder; |
|
361 |
public: |
|
362 |
|
|
363 |
IoParameterError(const IoParameterError &ile) : |
|
364 |
IoError(ile), _message(ile._message), _file(ile._file) {} |
|
365 |
|
|
366 |
///\e |
|
367 |
explicit IoParameterError(const char *the_message) |
|
368 |
: _message(the_message) {} |
|
369 |
|
|
370 |
///\e |
|
371 |
IoParameterError(const char *file_name, const char *the_message) |
|
372 |
: _message(the_message), _file(file_name) {} |
|
373 |
|
|
374 |
///\e |
|
375 |
void message(const std::string& msg) { _message.set(msg); } |
|
376 |
///\e |
|
377 |
void file(const std::string &fl) { _file.set(fl); } |
|
378 |
|
|
379 |
///\e |
|
380 |
const char* message() const { |
|
381 |
if (_message.valid()) { |
|
382 |
return _message.get().c_str(); |
|
383 |
} else { |
|
384 |
return 0; |
|
385 |
} |
|
386 |
} |
|
387 |
|
|
388 |
/// \brief Returns the filename. |
|
389 |
/// |
|
390 |
/// Returns \c 0 if the filename was not specified. |
|
391 |
const char* file() const { |
|
392 |
if (_file.valid()) { |
|
393 |
return _file.get().c_str(); |
|
394 |
} else { |
|
395 |
return 0; |
|
396 |
} |
|
397 |
} |
|
398 |
|
|
399 |
///\e |
|
400 |
virtual const char* what() const throw() { |
|
401 |
try { |
|
402 |
std::ostringstream ostr; |
|
403 |
if (message()) ostr << message(); |
|
404 |
if (file()) ostr << "(when reading file '" << file() << "')"; |
|
405 |
_message_holder.set(ostr.str()); |
|
406 |
} |
|
407 |
catch (...) {} |
|
408 |
if( _message_holder.valid() ) return _message_holder.get().c_str(); |
|
409 |
return "lemon:IoParameterError"; |
|
410 |
} |
|
411 |
virtual ~IoParameterError() throw() {} |
|
412 | 270 |
}; |
413 | 271 |
|
414 | 272 |
/// @} |
... | ... |
@@ -40,6 +40,7 @@ |
40 | 40 |
#include<lemon/maps.h> |
41 | 41 |
#include<lemon/color.h> |
42 | 42 |
#include<lemon/bits/bezier.h> |
43 |
#include<lemon/error.h> |
|
43 | 44 |
|
44 | 45 |
|
45 | 46 |
///\ingroup eps_io |
... | ... |
@@ -1166,8 +1167,13 @@ |
1166 | 1167 |
GraphToEps<DefaultGraphToEpsTraits<G> > |
1167 | 1168 |
graphToEps(G &g,const char *file_name) |
1168 | 1169 |
{ |
1170 |
std::ostream* os = new std::ofstream(file_name); |
|
1171 |
if (!(*os)) { |
|
1172 |
delete os; |
|
1173 |
throw IoError(file_name, "Cannot write file"); |
|
1174 |
} |
|
1169 | 1175 |
return GraphToEps<DefaultGraphToEpsTraits<G> > |
1170 |
(DefaultGraphToEpsTraits<G>(g,* |
|
1176 |
(DefaultGraphToEpsTraits<G>(g,*os,true)); |
|
1171 | 1177 |
} |
1172 | 1178 |
|
1173 | 1179 |
///Generates an EPS file from a graph |
... | ... |
@@ -1182,8 +1188,13 @@ |
1182 | 1188 |
GraphToEps<DefaultGraphToEpsTraits<G> > |
1183 | 1189 |
graphToEps(G &g,const std::string& file_name) |
1184 | 1190 |
{ |
1191 |
std::ostream* os = new std::ofstream(file_name.c_str()); |
|
1192 |
if (!(*os)) { |
|
1193 |
delete os; |
|
1194 |
throw IoError(file_name, "Cannot write file"); |
|
1195 |
} |
|
1185 | 1196 |
return GraphToEps<DefaultGraphToEpsTraits<G> > |
1186 |
(DefaultGraphToEpsTraits<G>(g,* |
|
1197 |
(DefaultGraphToEpsTraits<G>(g,*os,true)); |
|
1187 | 1198 |
} |
1188 | 1199 |
|
1189 | 1200 |
} //END OF NAMESPACE LEMON |
... | ... |
@@ -48,11 +48,13 @@ |
48 | 48 |
Value operator()(const std::string& str) { |
49 | 49 |
std::istringstream is(str); |
50 | 50 |
Value value; |
51 |
is >> value |
|
51 |
if (!(is >> value)) { |
|
52 |
throw FormatError("Cannot read token"); |
|
53 |
} |
|
52 | 54 |
|
53 | 55 |
char c; |
54 | 56 |
if (is >> std::ws >> c) { |
55 |
throw |
|
57 |
throw FormatError("Remaining characters in token"); |
|
56 | 58 |
} |
57 | 59 |
return value; |
58 | 60 |
} |
... | ... |
@@ -166,7 +168,7 @@ |
166 | 168 |
if (it == _map.end()) { |
167 | 169 |
std::ostringstream msg; |
168 | 170 |
msg << "Item not found: " << str; |
169 |
throw |
|
171 |
throw FormatError(msg.str()); |
|
170 | 172 |
} |
171 | 173 |
return it->second; |
172 | 174 |
} |
... | ... |
@@ -184,12 +186,12 @@ |
184 | 186 |
|
185 | 187 |
typename Graph::Arc operator()(const std::string& str) { |
186 | 188 |
if (str.empty() || (str[0] != '+' && str[0] != '-')) { |
187 |
throw |
|
189 |
throw FormatError("Item must start with '+' or '-'"); |
|
188 | 190 |
} |
189 | 191 |
typename std::map<std::string, typename Graph::Edge> |
190 | 192 |
::const_iterator it = _map.find(str.substr(1)); |
191 | 193 |
if (it == _map.end()) { |
192 |
throw |
|
194 |
throw FormatError("Item not found"); |
|
193 | 195 |
} |
194 | 196 |
return _graph.direct(it->second, str[0] == '+'); |
195 | 197 |
} |
... | ... |
@@ -235,7 +237,7 @@ |
235 | 237 |
inline char readEscape(std::istream& is) { |
236 | 238 |
char c; |
237 | 239 |
if (!is.get(c)) |
238 |
throw |
|
240 |
throw FormatError("Escape format error"); |
|
239 | 241 |
|
240 | 242 |
switch (c) { |
241 | 243 |
case '\\': |
... | ... |
@@ -264,7 +266,7 @@ |
264 | 266 |
{ |
265 | 267 |
int code; |
266 | 268 |
if (!is.get(c) || !isHex(c)) |
267 |
throw |
|
269 |
throw FormatError("Escape format error"); |
|
268 | 270 |
else if (code = valueHex(c), !is.get(c) || !isHex(c)) is.putback(c); |
269 | 271 |
else code = code * 16 + valueHex(c); |
270 | 272 |
return code; |
... | ... |
@@ -273,7 +275,7 @@ |
273 | 275 |
{ |
274 | 276 |
int code; |
275 | 277 |
if (!isOct(c)) |
276 |
throw |
|
278 |
throw FormatError("Escape format error"); |
|
277 | 279 |
else if (code = valueOct(c), !is.get(c) || !isOct(c)) |
278 | 280 |
is.putback(c); |
279 | 281 |
else if (code = code * 8 + valueOct(c), !is.get(c) || !isOct(c)) |
... | ... |
@@ -300,7 +302,7 @@ |
300 | 302 |
os << c; |
301 | 303 |
} |
302 | 304 |
if (!is) |
303 |
throw |
|
305 |
throw FormatError("Quoted format error"); |
|
304 | 306 |
} else { |
305 | 307 |
is.putback(c); |
306 | 308 |
while (is.get(c) && !isWhiteSpace(c)) { |
... | ... |
@@ -460,6 +462,7 @@ |
460 | 462 |
|
461 | 463 |
std::istream* _is; |
462 | 464 |
bool local_is; |
465 |
std::string _filename; |
|
463 | 466 |
|
464 | 467 |
Digraph& _digraph; |
465 | 468 |
|
... | ... |
@@ -509,18 +512,24 @@ |
509 | 512 |
/// Construct a directed graph reader, which reads from the given |
510 | 513 |
/// file. |
511 | 514 |
DigraphReader(const std::string& fn, Digraph& digraph) |
512 |
: _is(new std::ifstream(fn.c_str())), local_is(true), |
|
515 |
: _is(new std::ifstream(fn.c_str())), local_is(true), |
|
516 |
_filename(fn), _digraph(digraph), |
|
513 | 517 |
_use_nodes(false), _use_arcs(false), |
514 |
_skip_nodes(false), _skip_arcs(false) { |
|
518 |
_skip_nodes(false), _skip_arcs(false) { |
|
519 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
520 |
} |
|
515 | 521 |
|
516 | 522 |
/// \brief Constructor |
517 | 523 |
/// |
518 | 524 |
/// Construct a directed graph reader, which reads from the given |
519 | 525 |
/// file. |
520 | 526 |
DigraphReader(const char* fn, Digraph& digraph) |
521 |
: _is(new std::ifstream(fn)), local_is(true), |
|
527 |
: _is(new std::ifstream(fn)), local_is(true), |
|
528 |
_filename(fn), _digraph(digraph), |
|
522 | 529 |
_use_nodes(false), _use_arcs(false), |
523 |
_skip_nodes(false), _skip_arcs(false) { |
|
530 |
_skip_nodes(false), _skip_arcs(false) { |
|
531 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
532 |
} |
|
524 | 533 |
|
525 | 534 |
/// \brief Destructor |
526 | 535 |
~DigraphReader() { |
... | ... |
@@ -845,7 +854,7 @@ |
845 | 854 |
if (!readLine() || !(line >> c) || c == '@') { |
846 | 855 |
if (readSuccess() && line) line.putback(c); |
847 | 856 |
if (!_node_maps.empty()) |
848 |
throw |
|
857 |
throw FormatError("Cannot find map names"); |
|
849 | 858 |
return; |
850 | 859 |
} |
851 | 860 |
line.putback(c); |
... | ... |
@@ -859,7 +868,7 @@ |
859 | 868 |
if (maps.find(map) != maps.end()) { |
860 | 869 |
std::ostringstream msg; |
861 | 870 |
msg << "Multiple occurence of node map: " << map; |
862 |
throw |
|
871 |
throw FormatError(msg.str()); |
|
863 | 872 |
} |
864 | 873 |
maps.insert(std::make_pair(map, index)); |
865 | 874 |
++index; |
... | ... |
@@ -871,7 +880,7 @@ |
871 | 880 |
if (jt == maps.end()) { |
872 | 881 |
std::ostringstream msg; |
873 | 882 |
msg << "Map not found in file: " << _node_maps[i].first; |
874 |
throw |
|
883 |
throw FormatError(msg.str()); |
|
875 | 884 |
} |
876 | 885 |
map_index[i] = jt->second; |
877 | 886 |
} |
... | ... |
@@ -895,11 +904,11 @@ |
895 | 904 |
if (!_reader_bits::readToken(line, tokens[i])) { |
896 | 905 |
std::ostringstream msg; |
897 | 906 |
msg << "Column not found (" << i + 1 << ")"; |
898 |
throw |
|
907 |
throw FormatError(msg.str()); |
|
899 | 908 |
} |
900 | 909 |
} |
901 | 910 |
if (line >> std::ws >> c) |
902 |
throw |
|
911 |
throw FormatError("Extra character on the end of line"); |
|
903 | 912 |
|
904 | 913 |
Node n; |
905 | 914 |
if (!_use_nodes) { |
... | ... |
@@ -908,13 +917,13 @@ |
908 | 917 |
_node_index.insert(std::make_pair(tokens[label_index], n)); |
909 | 918 |
} else { |
910 | 919 |
if (label_index == -1) |
911 |
throw |
|
920 |
throw FormatError("Label map not found in file"); |
|
912 | 921 |
typename std::map<std::string, Node>::iterator it = |
913 | 922 |
_node_index.find(tokens[label_index]); |
914 | 923 |
if (it == _node_index.end()) { |
915 | 924 |
std::ostringstream msg; |
916 | 925 |
msg << "Node with label not found: " << tokens[label_index]; |
917 |
throw |
|
926 |
throw FormatError(msg.str()); |
|
918 | 927 |
} |
919 | 928 |
n = it->second; |
920 | 929 |
} |
... | ... |
@@ -938,7 +947,7 @@ |
938 | 947 |
if (!readLine() || !(line >> c) || c == '@') { |
939 | 948 |
if (readSuccess() && line) line.putback(c); |
940 | 949 |
if (!_arc_maps.empty()) |
941 |
throw |
|
950 |
throw FormatError("Cannot find map names"); |
|
942 | 951 |
return; |
943 | 952 |
} |
944 | 953 |
line.putback(c); |
... | ... |
@@ -952,7 +961,7 @@ |
952 | 961 |
if (maps.find(map) != maps.end()) { |
953 | 962 |
std::ostringstream msg; |
954 | 963 |
msg << "Multiple occurence of arc map: " << map; |
955 |
throw |
|
964 |
throw FormatError(msg.str()); |
|
956 | 965 |
} |
957 | 966 |
maps.insert(std::make_pair(map, index)); |
958 | 967 |
++index; |
... | ... |
@@ -964,7 +973,7 @@ |
964 | 973 |
if (jt == maps.end()) { |
965 | 974 |
std::ostringstream msg; |
966 | 975 |
msg << "Map not found in file: " << _arc_maps[i].first; |
967 |
throw |
|
976 |
throw FormatError(msg.str()); |
|
968 | 977 |
} |
969 | 978 |
map_index[i] = jt->second; |
970 | 979 |
} |
... | ... |
@@ -987,21 +996,21 @@ |
987 | 996 |
std::string target_token; |
988 | 997 |
|
989 | 998 |
if (!_reader_bits::readToken(line, source_token)) |
990 |
throw |
|
999 |
throw FormatError("Source not found"); |
|
991 | 1000 |
|
992 | 1001 |
if (!_reader_bits::readToken(line, target_token)) |
993 |
throw |
|
1002 |
throw FormatError("Target not found"); |
|
994 | 1003 |
|
995 | 1004 |
std::vector<std::string> tokens(map_num); |
996 | 1005 |
for (int i = 0; i < map_num; ++i) { |
997 | 1006 |
if (!_reader_bits::readToken(line, tokens[i])) { |
998 | 1007 |
std::ostringstream msg; |
999 | 1008 |
msg << "Column not found (" << i + 1 << ")"; |
1000 |
throw |
|
1009 |
throw FormatError(msg.str()); |
|
1001 | 1010 |
} |
1002 | 1011 |
} |
1003 | 1012 |
if (line >> std::ws >> c) |
1004 |
throw |
|
1013 |
throw FormatError("Extra character on the end of line"); |
|
1005 | 1014 |
|
1006 | 1015 |
Arc a; |
1007 | 1016 |
if (!_use_arcs) { |
... | ... |
@@ -1012,7 +1021,7 @@ |
1012 | 1021 |
if (it == _node_index.end()) { |
1013 | 1022 |
std::ostringstream msg; |
1014 | 1023 |
msg << "Item not found: " << source_token; |
1015 |
throw |
|
1024 |
throw FormatError(msg.str()); |
|
1016 | 1025 |
} |
1017 | 1026 |
Node source = it->second; |
1018 | 1027 |
|
... | ... |
@@ -1020,7 +1029,7 @@ |
1020 | 1029 |
if (it == _node_index.end()) { |
1021 | 1030 |
std::ostringstream msg; |
1022 | 1031 |
msg << "Item not found: " << target_token; |
1023 |
throw |
|
1032 |
throw FormatError(msg.str()); |
|
1024 | 1033 |
} |
1025 | 1034 |
Node target = it->second; |
1026 | 1035 |
|
... | ... |
@@ -1029,13 +1038,13 @@ |
1029 | 1038 |
_arc_index.insert(std::make_pair(tokens[label_index], a)); |
1030 | 1039 |
} else { |
1031 | 1040 |
if (label_index == -1) |
1032 |
throw |
|
1041 |
throw FormatError("Label map not found in file"); |
|
1033 | 1042 |
typename std::map<std::string, Arc>::iterator it = |
1034 | 1043 |
_arc_index.find(tokens[label_index]); |
1035 | 1044 |
if (it == _arc_index.end()) { |
1036 | 1045 |
std::ostringstream msg; |
1037 | 1046 |
msg << "Arc with label not found: " << tokens[label_index]; |
1038 |
throw |
|
1047 |
throw FormatError(msg.str()); |
|
1039 | 1048 |
} |
1040 | 1049 |
a = it->second; |
1041 | 1050 |
} |
... | ... |
@@ -1060,18 +1069,18 @@ |
1060 | 1069 |
|
1061 | 1070 |
std::string attr, token; |
1062 | 1071 |
if (!_reader_bits::readToken(line, attr)) |
1063 |
throw |
|
1072 |
throw FormatError("Attribute name not found"); |
|
1064 | 1073 |
if (!_reader_bits::readToken(line, token)) |
1065 |
throw |
|
1074 |
throw FormatError("Attribute value not found"); |
|
1066 | 1075 |
if (line >> c) |
1067 |
throw |
|
1076 |
throw FormatError("Extra character on the end of line"); |
|
1068 | 1077 |
|
1069 | 1078 |
{ |
1070 | 1079 |
std::set<std::string>::iterator it = read_attr.find(attr); |
1071 | 1080 |
if (it != read_attr.end()) { |
1072 | 1081 |
std::ostringstream msg; |
1073 | 1082 |
msg << "Multiple occurence of attribute " << attr; |
1074 |
throw |
|
1083 |
throw FormatError(msg.str()); |
|
1075 | 1084 |
} |
1076 | 1085 |
read_attr.insert(attr); |
1077 | 1086 |
} |
... | ... |
@@ -1093,7 +1102,7 @@ |
1093 | 1102 |
if (read_attr.find(it->first) == read_attr.end()) { |
1094 | 1103 |
std::ostringstream msg; |
1095 | 1104 |
msg << "Attribute not found in file: " << it->first; |
1096 |
throw |
|
1105 |
throw FormatError(msg.str()); |
|
1097 | 1106 |
} |
1098 | 1107 |
} |
1099 | 1108 |
} |
... | ... |
@@ -1109,7 +1118,7 @@ |
1109 | 1118 |
void run() { |
1110 | 1119 |
LEMON_ASSERT(_is != 0, "This reader assigned to an other reader"); |
1111 | 1120 |
if (!*_is) { |
1112 |
throw |
|
1121 |
throw FormatError("Cannot find file"); |
|
1113 | 1122 |
} |
1114 | 1123 |
|
1115 | 1124 |
bool nodes_done = _skip_nodes; |
... | ... |
@@ -1129,7 +1138,7 @@ |
1129 | 1138 |
_reader_bits::readToken(line, caption); |
1130 | 1139 |
|
1131 | 1140 |
if (line >> c) |
1132 |
throw |
|
1141 |
throw FormatError("Extra character on the end of line"); |
|
1133 | 1142 |
|
1134 | 1143 |
if (section == "nodes" && !nodes_done) { |
1135 | 1144 |
if (_nodes_caption.empty() || _nodes_caption == caption) { |
... | ... |
@@ -1151,22 +1160,23 @@ |
1151 | 1160 |
readLine(); |
1152 | 1161 |
skipSection(); |
1153 | 1162 |
} |
1154 |
} catch ( |
|
1163 |
} catch (FormatError& error) { |
|
1155 | 1164 |
error.line(line_num); |
1165 |
error.file(_filename); |
|
1156 | 1166 |
throw; |
1157 | 1167 |
} |
1158 | 1168 |
} |
1159 | 1169 |
|
1160 | 1170 |
if (!nodes_done) { |
1161 |
throw |
|
1171 |
throw FormatError("Section @nodes not found"); |
|
1162 | 1172 |
} |
1163 | 1173 |
|
1164 | 1174 |
if (!arcs_done) { |
1165 |
throw |
|
1175 |
throw FormatError("Section @arcs not found"); |
|
1166 | 1176 |
} |
1167 | 1177 |
|
1168 | 1178 |
if (!attributes_done && !_attributes.empty()) { |
1169 |
throw |
|
1179 |
throw FormatError("Section @attributes not found"); |
|
1170 | 1180 |
} |
1171 | 1181 |
|
1172 | 1182 |
} |
... | ... |
@@ -1244,6 +1254,7 @@ |
1244 | 1254 |
|
1245 | 1255 |
std::istream* _is; |
1246 | 1256 |
bool local_is; |
1257 |
std::string _filename; |
|
1247 | 1258 |
|
1248 | 1259 |
Graph& _graph; |
1249 | 1260 |
|
... | ... |
@@ -1293,18 +1304,24 @@ |
1293 | 1304 |
/// Construct an undirected graph reader, which reads from the given |
1294 | 1305 |
/// file. |
1295 | 1306 |
GraphReader(const std::string& fn, Graph& graph) |
1296 |
: _is(new std::ifstream(fn.c_str())), local_is(true), |
|
1307 |
: _is(new std::ifstream(fn.c_str())), local_is(true), |
|
1308 |
_filename(fn), _graph(graph), |
|
1297 | 1309 |
_use_nodes(false), _use_edges(false), |
1298 |
_skip_nodes(false), _skip_edges(false) { |
|
1310 |
_skip_nodes(false), _skip_edges(false) { |
|
1311 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
1312 |
} |
|
1299 | 1313 |
|
1300 | 1314 |
/// \brief Constructor |
1301 | 1315 |
/// |
1302 | 1316 |
/// Construct an undirected graph reader, which reads from the given |
1303 | 1317 |
/// file. |
1304 | 1318 |
GraphReader(const char* fn, Graph& graph) |
1305 |
: _is(new std::ifstream(fn)), local_is(true), |
|
1319 |
: _is(new std::ifstream(fn)), local_is(true), |
|
1320 |
_filename(fn), _graph(graph), |
|
1306 | 1321 |
_use_nodes(false), _use_edges(false), |
1307 |
_skip_nodes(false), _skip_edges(false) { |
|
1322 |
_skip_nodes(false), _skip_edges(false) { |
|
1323 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
1324 |
} |
|
1308 | 1325 |
|
1309 | 1326 |
/// \brief Destructor |
1310 | 1327 |
~GraphReader() { |
... | ... |
@@ -1673,7 +1690,7 @@ |
1673 | 1690 |
if (!readLine() || !(line >> c) || c == '@') { |
1674 | 1691 |
if (readSuccess() && line) line.putback(c); |
1675 | 1692 |
if (!_node_maps.empty()) |
1676 |
throw |
|
1693 |
throw FormatError("Cannot find map names"); |
|
1677 | 1694 |
return; |
1678 | 1695 |
} |
1679 | 1696 |
line.putback(c); |
... | ... |
@@ -1687,7 +1704,7 @@ |
1687 | 1704 |
if (maps.find(map) != maps.end()) { |
1688 | 1705 |
std::ostringstream msg; |
1689 | 1706 |
msg << "Multiple occurence of node map: " << map; |
1690 |
throw |
|
1707 |
throw FormatError(msg.str()); |
|
1691 | 1708 |
} |
1692 | 1709 |
maps.insert(std::make_pair(map, index)); |
1693 | 1710 |
++index; |
... | ... |
@@ -1699,7 +1716,7 @@ |
1699 | 1716 |
if (jt == maps.end()) { |
1700 | 1717 |
std::ostringstream msg; |
1701 | 1718 |
msg << "Map not found in file: " << _node_maps[i].first; |
1702 |
throw |
|
1719 |
throw FormatError(msg.str()); |
|
1703 | 1720 |
} |
1704 | 1721 |
map_index[i] = jt->second; |
1705 | 1722 |
} |
... | ... |
@@ -1723,11 +1740,11 @@ |
1723 | 1740 |
if (!_reader_bits::readToken(line, tokens[i])) { |
1724 | 1741 |
std::ostringstream msg; |
1725 | 1742 |
msg << "Column not found (" << i + 1 << ")"; |
1726 |
throw |
|
1743 |
throw FormatError(msg.str()); |
|
1727 | 1744 |
} |
1728 | 1745 |
} |
1729 | 1746 |
if (line >> std::ws >> c) |
1730 |
throw |
|
1747 |
throw FormatError("Extra character on the end of line"); |
|
1731 | 1748 |
|
1732 | 1749 |
Node n; |
1733 | 1750 |
if (!_use_nodes) { |
... | ... |
@@ -1736,13 +1753,13 @@ |
1736 | 1753 |
_node_index.insert(std::make_pair(tokens[label_index], n)); |
1737 | 1754 |
} else { |
1738 | 1755 |
if (label_index == -1) |
1739 |
throw |
|
1756 |
throw FormatError("Label map not found in file"); |
|
1740 | 1757 |
typename std::map<std::string, Node>::iterator it = |
1741 | 1758 |
_node_index.find(tokens[label_index]); |
1742 | 1759 |
if (it == _node_index.end()) { |
1743 | 1760 |
std::ostringstream msg; |
1744 | 1761 |
msg << "Node with label not found: " << tokens[label_index]; |
1745 |
throw |
|
1762 |
throw FormatError(msg.str()); |
|
1746 | 1763 |
} |
1747 | 1764 |
n = it->second; |
1748 | 1765 |
} |
... | ... |
@@ -1766,7 +1783,7 @@ |
1766 | 1783 |
if (!readLine() || !(line >> c) || c == '@') { |
1767 | 1784 |
if (readSuccess() && line) line.putback(c); |
1768 | 1785 |
if (!_edge_maps.empty()) |
1769 |
throw |
|
1786 |
throw FormatError("Cannot find map names"); |
|
1770 | 1787 |
return; |
1771 | 1788 |
} |
1772 | 1789 |
line.putback(c); |
... | ... |
@@ -1780,7 +1797,7 @@ |
1780 | 1797 |
if (maps.find(map) != maps.end()) { |
1781 | 1798 |
std::ostringstream msg; |
1782 | 1799 |
msg << "Multiple occurence of edge map: " << map; |
1783 |
throw |
|
1800 |
throw FormatError(msg.str()); |
|
1784 | 1801 |
} |
1785 | 1802 |
maps.insert(std::make_pair(map, index)); |
1786 | 1803 |
++index; |
... | ... |
@@ -1792,7 +1809,7 @@ |
1792 | 1809 |
if (jt == maps.end()) { |
1793 | 1810 |
std::ostringstream msg; |
1794 | 1811 |
msg << "Map not found in file: " << _edge_maps[i].first; |
1795 |
throw |
|
1812 |
throw FormatError(msg.str()); |
|
1796 | 1813 |
} |
1797 | 1814 |
map_index[i] = jt->second; |
1798 | 1815 |
} |
... | ... |
@@ -1815,21 +1832,21 @@ |
1815 | 1832 |
std::string target_token; |
1816 | 1833 |
|
1817 | 1834 |
if (!_reader_bits::readToken(line, source_token)) |
1818 |
throw |
|
1835 |
throw FormatError("Node u not found"); |
|
1819 | 1836 |
|
1820 | 1837 |
if (!_reader_bits::readToken(line, target_token)) |
1821 |
throw |
|
1838 |
throw FormatError("Node v not found"); |
|
1822 | 1839 |
|
1823 | 1840 |
std::vector<std::string> tokens(map_num); |
1824 | 1841 |
for (int i = 0; i < map_num; ++i) { |
1825 | 1842 |
if (!_reader_bits::readToken(line, tokens[i])) { |
1826 | 1843 |
std::ostringstream msg; |
1827 | 1844 |
msg << "Column not found (" << i + 1 << ")"; |
1828 |
throw |
|
1845 |
throw FormatError(msg.str()); |
|
1829 | 1846 |
} |
1830 | 1847 |
} |
1831 | 1848 |
if (line >> std::ws >> c) |
1832 |
throw |
|
1849 |
throw FormatError("Extra character on the end of line"); |
|
1833 | 1850 |
|
1834 | 1851 |
Edge e; |
1835 | 1852 |
if (!_use_edges) { |
... | ... |
@@ -1840,7 +1857,7 @@ |
1840 | 1857 |
if (it == _node_index.end()) { |
1841 | 1858 |
std::ostringstream msg; |
1842 | 1859 |
msg << "Item not found: " << source_token; |
1843 |
throw |
|
1860 |
throw FormatError(msg.str()); |
|
1844 | 1861 |
} |
1845 | 1862 |
Node source = it->second; |
1846 | 1863 |
|
... | ... |
@@ -1848,7 +1865,7 @@ |
1848 | 1865 |
if (it == _node_index.end()) { |
1849 | 1866 |
std::ostringstream msg; |
1850 | 1867 |
msg << "Item not found: " << target_token; |
1851 |
throw |
|
1868 |
throw FormatError(msg.str()); |
|
1852 | 1869 |
} |
1853 | 1870 |
Node target = it->second; |
1854 | 1871 |
|
... | ... |
@@ -1857,13 +1874,13 @@ |
1857 | 1874 |
_edge_index.insert(std::make_pair(tokens[label_index], e)); |
1858 | 1875 |
} else { |
1859 | 1876 |
if (label_index == -1) |
1860 |
throw |
|
1877 |
throw FormatError("Label map not found in file"); |
|
1861 | 1878 |
typename std::map<std::string, Edge>::iterator it = |
1862 | 1879 |
_edge_index.find(tokens[label_index]); |
1863 | 1880 |
if (it == _edge_index.end()) { |
1864 | 1881 |
std::ostringstream msg; |
1865 | 1882 |
msg << "Edge with label not found: " << tokens[label_index]; |
1866 |
throw |
|
1883 |
throw FormatError(msg.str()); |
|
1867 | 1884 |
} |
1868 | 1885 |
e = it->second; |
1869 | 1886 |
} |
... | ... |
@@ -1888,18 +1905,18 @@ |
1888 | 1905 |
|
1889 | 1906 |
std::string attr, token; |
1890 | 1907 |
if (!_reader_bits::readToken(line, attr)) |
1891 |
throw |
|
1908 |
throw FormatError("Attribute name not found"); |
|
1892 | 1909 |
if (!_reader_bits::readToken(line, token)) |
1893 |
throw |
|
1910 |
throw FormatError("Attribute value not found"); |
|
1894 | 1911 |
if (line >> c) |
1895 |
throw |
|
1912 |
throw FormatError("Extra character on the end of line"); |
|
1896 | 1913 |
|
1897 | 1914 |
{ |
1898 | 1915 |
std::set<std::string>::iterator it = read_attr.find(attr); |
1899 | 1916 |
if (it != read_attr.end()) { |
1900 | 1917 |
std::ostringstream msg; |
1901 | 1918 |
msg << "Multiple occurence of attribute " << attr; |
1902 |
throw |
|
1919 |
throw FormatError(msg.str()); |
|
1903 | 1920 |
} |
1904 | 1921 |
read_attr.insert(attr); |
1905 | 1922 |
} |
... | ... |
@@ -1921,7 +1938,7 @@ |
1921 | 1938 |
if (read_attr.find(it->first) == read_attr.end()) { |
1922 | 1939 |
std::ostringstream msg; |
1923 | 1940 |
msg << "Attribute not found in file: " << it->first; |
1924 |
throw |
|
1941 |
throw FormatError(msg.str()); |
|
1925 | 1942 |
} |
1926 | 1943 |
} |
1927 | 1944 |
} |
... | ... |
@@ -1955,7 +1972,7 @@ |
1955 | 1972 |
_reader_bits::readToken(line, caption); |
1956 | 1973 |
|
1957 | 1974 |
if (line >> c) |
1958 |
throw |
|
1975 |
throw FormatError("Extra character on the end of line"); |
|
1959 | 1976 |
|
1960 | 1977 |
if (section == "nodes" && !nodes_done) { |
1961 | 1978 |
if (_nodes_caption.empty() || _nodes_caption == caption) { |
... | ... |
@@ -1977,22 +1994,23 @@ |
1977 | 1994 |
readLine(); |
1978 | 1995 |
skipSection(); |
1979 | 1996 |
} |
1980 |
} catch ( |
|
1997 |
} catch (FormatError& error) { |
|
1981 | 1998 |
error.line(line_num); |
1999 |
error.file(_filename); |
|
1982 | 2000 |
throw; |
1983 | 2001 |
} |
1984 | 2002 |
} |
1985 | 2003 |
|
1986 | 2004 |
if (!nodes_done) { |
1987 |
throw |
|
2005 |
throw FormatError("Section @nodes not found"); |
|
1988 | 2006 |
} |
1989 | 2007 |
|
1990 | 2008 |
if (!edges_done) { |
1991 |
throw |
|
2009 |
throw FormatError("Section @edges not found"); |
|
1992 | 2010 |
} |
1993 | 2011 |
|
1994 | 2012 |
if (!attributes_done && !_attributes.empty()) { |
1995 |
throw |
|
2013 |
throw FormatError("Section @attributes not found"); |
|
1996 | 2014 |
} |
1997 | 2015 |
|
1998 | 2016 |
} |
... | ... |
@@ -2054,6 +2072,7 @@ |
2054 | 2072 |
|
2055 | 2073 |
std::istream* _is; |
2056 | 2074 |
bool local_is; |
2075 |
std::string _filename; |
|
2057 | 2076 |
|
2058 | 2077 |
typedef std::map<std::string, _reader_bits::Section*> Sections; |
2059 | 2078 |
Sections _sections; |
... | ... |
@@ -2074,13 +2093,19 @@ |
2074 | 2093 |
/// |
2075 | 2094 |
/// Construct a section reader, which reads from the given file. |
2076 | 2095 |
SectionReader(const std::string& fn) |
2077 |
: _is(new std::ifstream(fn.c_str())), local_is(true) |
|
2096 |
: _is(new std::ifstream(fn.c_str())), local_is(true), |
|
2097 |
_filename(fn) { |
|
2098 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
2099 |
} |
|
2078 | 2100 |
|
2079 | 2101 |
/// \brief Constructor |
2080 | 2102 |
/// |
2081 | 2103 |
/// Construct a section reader, which reads from the given file. |
2082 | 2104 |
SectionReader(const char* fn) |
2083 |
: _is(new std::ifstream(fn)), local_is(true) |
|
2105 |
: _is(new std::ifstream(fn)), local_is(true), |
|
2106 |
_filename(fn) { |
|
2107 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
2108 |
} |
|
2084 | 2109 |
|
2085 | 2110 |
/// \brief Destructor |
2086 | 2111 |
~SectionReader() { |
... | ... |
@@ -2236,12 +2261,12 @@ |
2236 | 2261 |
_reader_bits::readToken(line, caption); |
2237 | 2262 |
|
2238 | 2263 |
if (line >> c) |
2239 |
throw |
|
2264 |
throw FormatError("Extra character on the end of line"); |
|
2240 | 2265 |
|
2241 | 2266 |
if (extra_sections.find(section) != extra_sections.end()) { |
2242 | 2267 |
std::ostringstream msg; |
2243 | 2268 |
msg << "Multiple occurence of section " << section; |
2244 |
throw |
|
2269 |
throw FormatError(msg.str()); |
|
2245 | 2270 |
} |
2246 | 2271 |
Sections::iterator it = _sections.find(section); |
2247 | 2272 |
if (it != _sections.end()) { |
... | ... |
@@ -2250,8 +2275,9 @@ |
2250 | 2275 |
} |
2251 | 2276 |
readLine(); |
2252 | 2277 |
skipSection(); |
2253 |
} catch ( |
|
2278 |
} catch (FormatError& error) { |
|
2254 | 2279 |
error.line(line_num); |
2280 |
error.file(_filename); |
|
2255 | 2281 |
throw; |
2256 | 2282 |
} |
2257 | 2283 |
} |
... | ... |
@@ -2260,7 +2286,7 @@ |
2260 | 2286 |
if (extra_sections.find(it->first) == extra_sections.end()) { |
2261 | 2287 |
std::ostringstream os; |
2262 | 2288 |
os << "Cannot find section: " << it->first; |
2263 |
throw |
|
2289 |
throw FormatError(os.str()); |
|
2264 | 2290 |
} |
2265 | 2291 |
} |
2266 | 2292 |
} |
... | ... |
@@ -2360,14 +2386,18 @@ |
2360 | 2386 |
/// Construct an \e LGF contents reader, which reads from the given |
2361 | 2387 |
/// file. |
2362 | 2388 |
LgfContents(const std::string& fn) |
2363 |
: _is(new std::ifstream(fn.c_str())), local_is(true) { |
|
2389 |
: _is(new std::ifstream(fn.c_str())), local_is(true) { |
|
2390 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
2391 |
} |
|
2364 | 2392 |
|
2365 | 2393 |
/// \brief Constructor |
2366 | 2394 |
/// |
2367 | 2395 |
/// Construct an \e LGF contents reader, which reads from the given |
2368 | 2396 |
/// file. |
2369 | 2397 |
LgfContents(const char* fn) |
2370 |
: _is(new std::ifstream(fn)), local_is(true) { |
|
2398 |
: _is(new std::ifstream(fn)), local_is(true) { |
|
2399 |
if (!(*_is)) throw IoError(fn, "Cannot open file"); |
|
2400 |
} |
|
2371 | 2401 |
|
2372 | 2402 |
/// \brief Destructor |
2373 | 2403 |
~LgfContents() { |
... | ... |
@@ -55,7 +55,7 @@ |
55 | 55 |
|
56 | 56 |
template <typename T> |
57 | 57 |
bool operator<(const T&, const T&) { |
58 |
throw |
|
58 |
throw FormatError("Label map is not comparable"); |
|
59 | 59 |
} |
60 | 60 |
|
61 | 61 |
template <typename _Map> |
... | ... |
@@ -203,7 +203,7 @@ |
203 | 203 |
typename std::map<Value, std::string>::const_iterator it = |
204 | 204 |
_map.find(str); |
205 | 205 |
if (it == _map.end()) { |
206 |
throw |
|
206 |
throw FormatError("Item not found"); |
|
207 | 207 |
} |
208 | 208 |
return it->second; |
209 | 209 |
} |
... | ... |
@@ -223,7 +223,7 @@ |
223 | 223 |
typename std::map<typename Graph::Edge, std::string> |
224 | 224 |
::const_iterator it = _map.find(val); |
225 | 225 |
if (it == _map.end()) { |
226 |
throw |
|
226 |
throw FormatError("Item not found"); |
|
227 | 227 |
} |
228 | 228 |
return (_graph.direction(val) ? '+' : '-') + it->second; |
229 | 229 |
} |
... | ... |
@@ -462,7 +462,9 @@ |
462 | 462 |
/// output file. |
463 | 463 |
DigraphWriter(const std::string& fn, const Digraph& digraph) |
464 | 464 |
: _os(new std::ofstream(fn.c_str())), local_os(true), _digraph(digraph), |
465 |
_skip_nodes(false), _skip_arcs(false) { |
|
465 |
_skip_nodes(false), _skip_arcs(false) { |
|
466 |
if (!(*_os)) throw IoError(fn, "Cannot write file"); |
|
467 |
} |
|
466 | 468 |
|
467 | 469 |
/// \brief Constructor |
468 | 470 |
/// |
... | ... |
@@ -470,7 +472,9 @@ |
470 | 472 |
/// output file. |
471 | 473 |
DigraphWriter(const char* fn, const Digraph& digraph) |
472 | 474 |
: _os(new std::ofstream(fn)), local_os(true), _digraph(digraph), |
473 |
_skip_nodes(false), _skip_arcs(false) { |
|
475 |
_skip_nodes(false), _skip_arcs(false) { |
|
476 |
if (!(*_os)) throw IoError(fn, "Cannot write file"); |
|
477 |
} |
|
474 | 478 |
|
475 | 479 |
/// \brief Destructor |
476 | 480 |
~DigraphWriter() { |
... | ... |
@@ -1018,7 +1022,9 @@ |
1018 | 1022 |
/// output file. |
1019 | 1023 |
GraphWriter(const std::string& fn, const Graph& graph) |
1020 | 1024 |
: _os(new std::ofstream(fn.c_str())), local_os(true), _graph(graph), |
1021 |
_skip_nodes(false), _skip_edges(false) { |
|
1025 |
_skip_nodes(false), _skip_edges(false) { |
|
1026 |
if (!(*_os)) throw IoError(fn, "Cannot write file"); |
|
1027 |
} |
|
1022 | 1028 |
|
1023 | 1029 |
/// \brief Constructor |
1024 | 1030 |
/// |
... | ... |
@@ -1026,7 +1032,9 @@ |
1026 | 1032 |
/// output file. |
1027 | 1033 |
GraphWriter(const char* fn, const Graph& graph) |
1028 | 1034 |
: _os(new std::ofstream(fn)), local_os(true), _graph(graph), |
1029 |
_skip_nodes(false), _skip_edges(false) { |
|
1035 |
_skip_nodes(false), _skip_edges(false) { |
|
1036 |
if (!(*_os)) throw IoError(fn, "Cannot write file"); |
|
1037 |
} |
|
1030 | 1038 |
|
1031 | 1039 |
/// \brief Destructor |
1032 | 1040 |
~GraphWriter() { |
... | ... |
@@ -1576,13 +1584,17 @@ |
1576 | 1584 |
/// |
1577 | 1585 |
/// Construct a section writer, which writes into the given file. |
1578 | 1586 |
SectionWriter(const std::string& fn) |
1579 |
: _os(new std::ofstream(fn.c_str())), local_os(true) { |
|
1587 |
: _os(new std::ofstream(fn.c_str())), local_os(true) { |
|
1588 |
if (!(*_os)) throw IoError(fn, "Cannot write file"); |
|
1589 |
} |
|
1580 | 1590 |
|
1581 | 1591 |
/// \brief Constructor |
1582 | 1592 |
/// |
1583 | 1593 |
/// Construct a section writer, which writes into the given file. |
1584 | 1594 |
SectionWriter(const char* fn) |
1585 |
: _os(new std::ofstream(fn)), local_os(true) { |
|
1595 |
: _os(new std::ofstream(fn)), local_os(true) { |
|
1596 |
if (!(*_os)) throw IoError(fn, "Cannot write file"); |
|
1597 |
} |
|
1586 | 1598 |
|
1587 | 1599 |
/// \brief Destructor |
1588 | 1600 |
~SectionWriter() { |
0 comments (0 inline)