| ... | ... |
@@ -18,24 +18,28 @@ |
| 18 | 18 |
|
| 19 | 19 |
#ifndef LEMON_CORE_H |
| 20 | 20 |
#define LEMON_CORE_H |
| 21 | 21 |
|
| 22 | 22 |
#include <vector> |
| 23 | 23 |
#include <algorithm> |
| 24 | 24 |
|
| 25 | 25 |
#include <lemon/bits/enable_if.h> |
| 26 | 26 |
#include <lemon/bits/traits.h> |
| 27 | 27 |
|
| 28 | 28 |
///\file |
| 29 | 29 |
///\brief LEMON core utilities. |
| 30 |
/// |
|
| 31 |
///This header file contains core utilities for LEMON. |
|
| 32 |
///It is automatically included by all graph types, therefore it usually |
|
| 33 |
///do not have to be included directly. |
|
| 30 | 34 |
|
| 31 | 35 |
namespace lemon {
|
| 32 | 36 |
|
| 33 | 37 |
/// \brief Dummy type to make it easier to create invalid iterators. |
| 34 | 38 |
/// |
| 35 | 39 |
/// Dummy type to make it easier to create invalid iterators. |
| 36 | 40 |
/// See \ref INVALID for the usage. |
| 37 | 41 |
struct Invalid {
|
| 38 | 42 |
public: |
| 39 | 43 |
bool operator==(Invalid) { return true; }
|
| 40 | 44 |
bool operator!=(Invalid) { return false; }
|
| 41 | 45 |
bool operator< (Invalid) { return false; }
|
0 comments (0 inline)