FM / detail

/usr/include/boost/graph/detail

Name	Size	Mode	Actions
adjacency_list.hpp	106090	0644	edit dl rm
adj_list_edge_iterator.hpp	3987	0644	edit dl rm
array_binary_tree.hpp	7015	0644	edit dl rm
augment.hpp	2293	0644	edit dl rm
compressed_sparse_row_struct.hpp	30100	0644	edit dl rm
connected_components.hpp	6716	0644	edit dl rm
d_ary_heap.hpp	12255	0644	edit dl rm
edge.hpp	3550	0644	edit dl rm
empty_header.hpp	383	0644	edit dl rm
geodesic.hpp	4825	0644	edit dl rm
histogram_sort.hpp	13020	0644	edit dl rm
incidence_iterator.hpp	2681	0644	edit dl rm
incremental_components.hpp	3187	0644	edit dl rm
index.hpp	2623	0644	edit dl rm
indexed_properties.hpp	9420	0644	edit dl rm
is_distributed_selector.hpp	855	0644	edit dl rm
labeled_graph_traits.hpp	6618	0644	edit dl rm
list_base.hpp	5614	0644	edit dl rm
mpi_include.hpp	536	0644	edit dl rm
permutation.hpp	6020	0644	edit dl rm
read_graphviz_new.hpp	3555	0644	edit dl rm
read_graphviz_spirit.hpp	28019	0644	edit dl rm
self_avoiding_walk.hpp	15856	0644	edit dl rm
set_adaptor.hpp	3092	0644	edit dl rm
shadow_iterator.hpp	5497	0644	edit dl rm
sparse_ordering.hpp	6345	0644	edit dl rm

Edit: /usr/include/boost/graph/detail/incidence_iterator.hpp (2681B)

#include <utility>
#include <iterator>

// OBSOLETE

namespace boost
{

namespace detail
{
    // EdgeDir tags
    struct in_edge_tag
    {
    };
    struct out_edge_tag
    {
    };

template < class Vertex, class Edge, class Iterator1D, class EdgeDir >
    struct bidir_incidence_iterator
    {
        typedef bidir_incidence_iterator self;
        typedef Edge edge_type;
        typedef typename Edge::property_type EdgeProperty;

public:
        typedef int difference_type;
        typedef std::forward_iterator_tag iterator_category;
        typedef edge_type reference;
        typedef edge_type value_type;
        typedef value_type* pointer;
        inline bidir_incidence_iterator() {}
        inline bidir_incidence_iterator(Iterator1D ii, Vertex src)
        : i(ii), _src(src)
        {
        }

inline self& operator++()
        {
            ++i;
            return *this;
        }
        inline self operator++(int)
        {
            self tmp = *this;
            ++(*this);
            return tmp;
        }

inline reference operator*() const { return deref_helper(EdgeDir()); }
        inline self* operator->() { return this; }

Iterator1D& iter() { return i; }
        const Iterator1D& iter() const { return i; }

Iterator1D i;
        Vertex _src;

protected:
        inline reference deref_helper(out_edge_tag) const
        {
            return edge_type(_src, (*i).get_target(), &(*i).get_property());
        }
        inline reference deref_helper(in_edge_tag) const
        {
            return edge_type((*i).get_target(), _src, &(*i).get_property());
        }
    };

template < class V, class E, class Iter, class Dir >
    inline bool operator==(const bidir_incidence_iterator< V, E, Iter, Dir >& x,
        const bidir_incidence_iterator< V, E, Iter, Dir >& y)
    {
        return x.i == y.i;
    }
    template < class V, class E, class Iter, class Dir >
    inline bool operator!=(const bidir_incidence_iterator< V, E, Iter, Dir >& x,
        const bidir_incidence_iterator< V, E, Iter, Dir >& y)
    {
        return x.i != y.i;
    }

}
}
#endif

// //======================================================================= // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= // #ifndef BOOST_GRAPH_DETAIL_INCIDENCE_ITERATOR_HPP #define BOOST_GRAPH_DETAIL_INCIDENCE_ITERATOR_HPP #include #include // OBSOLETE namespace boost { namespace detail { // EdgeDir tags struct in_edge_tag { }; struct out_edge_tag { }; template < class Vertex, class Edge, class Iterator1D, class EdgeDir > struct bidir_incidence_iterator { typedef bidir_incidence_iterator self; typedef Edge edge_type; typedef typename Edge::property_type EdgeProperty; public: typedef int difference_type; typedef std::forward_iterator_tag iterator_category; typedef edge_type reference; typedef edge_type value_type; typedef value_type* pointer; inline bidir_incidence_iterator() {} inline bidir_incidence_iterator(Iterator1D ii, Vertex src) : i(ii), _src(src) { } inline self& operator++() { ++i; return *this; } inline self operator++(int) { self tmp = *this; ++(*this); return tmp; } inline reference operator*() const { return deref_helper(EdgeDir()); } inline self* operator->() { return this; } Iterator1D& iter() { return i; } const Iterator1D& iter() const { return i; } Iterator1D i; Vertex _src; protected: inline reference deref_helper(out_edge_tag) const { return edge_type(_src, (*i).get_target(), &(*i).get_property()); } inline reference deref_helper(in_edge_tag) const { return edge_type((*i).get_target(), _src, &(*i).get_property()); } }; template < class V, class E, class Iter, class Dir > inline bool operator==(const bidir_incidence_iterator< V, E, Iter, Dir >& x, const bidir_incidence_iterator< V, E, Iter, Dir >& y) { return x.i == y.i; } template < class V, class E, class Iter, class Dir > inline bool operator!=(const bidir_incidence_iterator< V, E, Iter, Dir >& x, const bidir_incidence_iterator< V, E, Iter, Dir >& y) { return x.i != y.i; } } } #endif