williamr@2
|
1 |
//
|
williamr@2
|
2 |
//=======================================================================
|
williamr@2
|
3 |
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
|
williamr@2
|
4 |
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
williamr@2
|
5 |
//
|
williamr@2
|
6 |
// Distributed under the Boost Software License, Version 1.0. (See
|
williamr@2
|
7 |
// accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
8 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
9 |
//=======================================================================
|
williamr@2
|
10 |
//
|
williamr@2
|
11 |
#ifndef BOOST_GRAPH_DETAIL_INCIDENCE_ITERATOR_HPP
|
williamr@2
|
12 |
#define BOOST_GRAPH_DETAIL_INCIDENCE_ITERATOR_HPP
|
williamr@2
|
13 |
|
williamr@2
|
14 |
#include <utility>
|
williamr@2
|
15 |
#include <iterator>
|
williamr@2
|
16 |
|
williamr@2
|
17 |
// OBSOLETE
|
williamr@2
|
18 |
|
williamr@2
|
19 |
namespace boost {
|
williamr@2
|
20 |
|
williamr@2
|
21 |
namespace detail {
|
williamr@2
|
22 |
// EdgeDir tags
|
williamr@2
|
23 |
struct in_edge_tag { };
|
williamr@2
|
24 |
struct out_edge_tag { };
|
williamr@2
|
25 |
|
williamr@2
|
26 |
template <class Vertex, class Edge, class Iterator1D, class EdgeDir>
|
williamr@2
|
27 |
struct bidir_incidence_iterator {
|
williamr@2
|
28 |
typedef bidir_incidence_iterator self;
|
williamr@2
|
29 |
typedef Edge edge_type;
|
williamr@2
|
30 |
typedef typename Edge::property_type EdgeProperty;
|
williamr@2
|
31 |
public:
|
williamr@2
|
32 |
typedef int difference_type;
|
williamr@2
|
33 |
typedef std::forward_iterator_tag iterator_category;
|
williamr@2
|
34 |
typedef edge_type reference;
|
williamr@2
|
35 |
typedef edge_type value_type;
|
williamr@2
|
36 |
typedef value_type* pointer;
|
williamr@2
|
37 |
inline bidir_incidence_iterator() {}
|
williamr@2
|
38 |
inline bidir_incidence_iterator(Iterator1D ii, Vertex src)
|
williamr@2
|
39 |
: i(ii), _src(src) { }
|
williamr@2
|
40 |
|
williamr@2
|
41 |
inline self& operator++() { ++i; return *this; }
|
williamr@2
|
42 |
inline self operator++(int) { self tmp = *this; ++(*this); return tmp; }
|
williamr@2
|
43 |
|
williamr@2
|
44 |
inline reference operator*() const {
|
williamr@2
|
45 |
return deref_helper(EdgeDir());
|
williamr@2
|
46 |
}
|
williamr@2
|
47 |
inline self* operator->() { return this; }
|
williamr@2
|
48 |
|
williamr@2
|
49 |
Iterator1D& iter() { return i; }
|
williamr@2
|
50 |
const Iterator1D& iter() const { return i; }
|
williamr@2
|
51 |
|
williamr@2
|
52 |
Iterator1D i;
|
williamr@2
|
53 |
Vertex _src;
|
williamr@2
|
54 |
protected:
|
williamr@2
|
55 |
inline reference deref_helper(out_edge_tag) const {
|
williamr@2
|
56 |
return edge_type( _src, (*i).get_target(), &(*i).get_property() );
|
williamr@2
|
57 |
}
|
williamr@2
|
58 |
inline reference deref_helper(in_edge_tag) const {
|
williamr@2
|
59 |
return edge_type((*i).get_target(), _src, &(*i).get_property() );
|
williamr@2
|
60 |
}
|
williamr@2
|
61 |
};
|
williamr@2
|
62 |
|
williamr@2
|
63 |
template <class V, class E, class Iter, class Dir>
|
williamr@2
|
64 |
inline bool operator==(const bidir_incidence_iterator<V,E,Iter,Dir>& x,
|
williamr@2
|
65 |
const bidir_incidence_iterator<V,E,Iter,Dir>& y)
|
williamr@2
|
66 |
{
|
williamr@2
|
67 |
return x.i == y.i;
|
williamr@2
|
68 |
}
|
williamr@2
|
69 |
template <class V, class E, class Iter, class Dir>
|
williamr@2
|
70 |
inline bool operator!=(const bidir_incidence_iterator<V,E,Iter,Dir>& x,
|
williamr@2
|
71 |
const bidir_incidence_iterator<V,E,Iter,Dir>& y)
|
williamr@2
|
72 |
{
|
williamr@2
|
73 |
return x.i != y.i;
|
williamr@2
|
74 |
}
|
williamr@2
|
75 |
|
williamr@2
|
76 |
|
williamr@2
|
77 |
}
|
williamr@2
|
78 |
}
|
williamr@2
|
79 |
#endif
|