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/incremental_components.hpp (3187B)

#ifndef BOOST_GRAPH_DETAIL_INCREMENTAL_COMPONENTS_HPP
#define BOOST_GRAPH_DETAIL_INCREMENTAL_COMPONENTS_HPP

#include <boost/operators.hpp>

namespace boost
{

namespace detail
{

// Iterator for a component index linked list.  The contents of
    // each array element represent the next index in the list.  A
    // special value (the maximum index + 1) is used to terminate a
    // list.
    template < typename IndexRandomAccessIterator >
    class component_index_iterator
    : boost::forward_iterator_helper<
          component_index_iterator< IndexRandomAccessIterator >,
          typename std::iterator_traits<
              IndexRandomAccessIterator >::value_type,
          typename std::iterator_traits<
              IndexRandomAccessIterator >::difference_type,
          typename std::iterator_traits< IndexRandomAccessIterator >::pointer,
          typename std::iterator_traits<
              IndexRandomAccessIterator >::reference >
    {

private:
        typedef component_index_iterator< IndexRandomAccessIterator > self;

public:
        typedef std::forward_iterator_tag iterator_category;
        typedef typename std::iterator_traits<
            IndexRandomAccessIterator >::value_type value_type;
        typedef typename std::iterator_traits<
            IndexRandomAccessIterator >::difference_type reference;
        typedef
            typename std::iterator_traits< IndexRandomAccessIterator >::pointer
                pointer;
        typedef typename std::iterator_traits<
            IndexRandomAccessIterator >::reference difference_type;

// Constructor for "begin" iterator
        component_index_iterator(
            IndexRandomAccessIterator index_iterator, value_type begin_index)
        : m_index_iterator(index_iterator), m_current_index(begin_index)
        {
        }

// Constructor for "end" iterator (end_index should be the linked
        // list terminator).
        component_index_iterator(value_type end_index)
        : m_current_index(end_index)
        {
        }

inline value_type operator*() const { return (m_current_index); }

self& operator++()
        {
            // Move to the next element in the linked list
            m_current_index = m_index_iterator[m_current_index];
            return (*this);
        }

bool operator==(const self& other_iterator) const
        {
            return (m_current_index == *other_iterator);
        }

protected:
        IndexRandomAccessIterator m_index_iterator;
        value_type m_current_index;

}; // class component_index_iterator

} // namespace detail

#endif // BOOST_GRAPH_DETAIL_INCREMENTAL_COMPONENTS_HPP

//======================================================================= // Copyright 2002 Indiana University. // Copyright 2009 Trustees of Indiana University. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek, Michael Hansen // // 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_INCREMENTAL_COMPONENTS_HPP #define BOOST_GRAPH_DETAIL_INCREMENTAL_COMPONENTS_HPP #include namespace boost { namespace detail { // Iterator for a component index linked list. The contents of // each array element represent the next index in the list. A // special value (the maximum index + 1) is used to terminate a // list. template < typename IndexRandomAccessIterator > class component_index_iterator : boost::forward_iterator_helper< component_index_iterator< IndexRandomAccessIterator >, typename std::iterator_traits< IndexRandomAccessIterator >::value_type, typename std::iterator_traits< IndexRandomAccessIterator >::difference_type, typename std::iterator_traits< IndexRandomAccessIterator >::pointer, typename std::iterator_traits< IndexRandomAccessIterator >::reference > { private: typedef component_index_iterator< IndexRandomAccessIterator > self; public: typedef std::forward_iterator_tag iterator_category; typedef typename std::iterator_traits< IndexRandomAccessIterator >::value_type value_type; typedef typename std::iterator_traits< IndexRandomAccessIterator >::difference_type reference; typedef typename std::iterator_traits< IndexRandomAccessIterator >::pointer pointer; typedef typename std::iterator_traits< IndexRandomAccessIterator >::reference difference_type; // Constructor for "begin" iterator component_index_iterator( IndexRandomAccessIterator index_iterator, value_type begin_index) : m_index_iterator(index_iterator), m_current_index(begin_index) { } // Constructor for "end" iterator (end_index should be the linked // list terminator). component_index_iterator(value_type end_index) : m_current_index(end_index) { } inline value_type operator*() const { return (m_current_index); } self& operator++() { // Move to the next element in the linked list m_current_index = m_index_iterator[m_current_index]; return (*this); } bool operator==(const self& other_iterator) const { return (m_current_index == *other_iterator); } protected: IndexRandomAccessIterator m_index_iterator; value_type m_current_index; }; // class component_index_iterator } // namespace detail } // namespace detail #endif // BOOST_GRAPH_DETAIL_INCREMENTAL_COMPONENTS_HPP