iteration_macros.hpp File Reference

#include <utility>

Include dependency graph for iteration_macros.hpp:

This graph shows which files directly or indirectly include this file:

Macros
#define	BGL_CAT(x, y)   x ## y
#define	BGL_RANGE(linenum)   BGL_CAT(bgl_range_,linenum)
#define	BGL_FIRST(linenum)   (BGL_RANGE(linenum).first)
#define	BGL_LAST(linenum)   (BGL_RANGE(linenum).second)
#define	BGL_FORALL_VERTICES_T(VNAME, GNAME, GraphType)
#define	BGL_FORALL_VERTICES(VNAME, GNAME, GraphType)
#define	BGL_FORALL_EDGES_T(ENAME, GNAME, GraphType)
#define	BGL_FORALL_EDGES(ENAME, GNAME, GraphType)
#define	BGL_FORALL_ADJ_T(UNAME, VNAME, GNAME, GraphType)
#define	BGL_FORALL_ADJ(UNAME, VNAME, GNAME, GraphType)
#define	BGL_FORALL_OUTEDGES_T(UNAME, ENAME, GNAME, GraphType)
#define	BGL_FORALL_OUTEDGES(UNAME, ENAME, GNAME, GraphType)
#define	BGL_FORALL_INEDGES_T(UNAME, ENAME, GNAME, GraphType)
#define	BGL_FORALL_INEDGES(UNAME, ENAME, GNAME, GraphType)

Macro Definition Documentation

#define BGL_CAT	(		x,
			y
	)		x ## y

#define BGL_FIRST

(

linenum

)

(BGL_RANGE(linenum).first)

#define BGL_FORALL_ADJ	(		UNAME,
			VNAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<boost::graph_traits<GraphType>::adjacency_iterator, \
               boost::graph_traits<GraphType>::adjacency_iterator> BGL_RANGE(__LINE__) = adjacent_vertices(UNAME, GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
for (boost::graph_traits<GraphType>::vertex_descriptor VNAME; \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (VNAME = *BGL_FIRST(__LINE__), true) : false; \
   ++BGL_FIRST(__LINE__))

#define BGL_FORALL_ADJ_T	(		UNAME,
			VNAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<typename boost::graph_traits<GraphType>::adjacency_iterator, \
               typename boost::graph_traits<GraphType>::adjacency_iterator> BGL_RANGE(__LINE__) = adjacent_vertices(UNAME, GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
for (typename boost::graph_traits<GraphType>::vertex_descriptor VNAME; \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (VNAME = *BGL_FIRST(__LINE__), true) : false; \
   ++BGL_FIRST(__LINE__))

Referenced by boost::detail::compute_in_degree(), boost::graph::distributed::connected_components_ps(), boost::graph::distributed::fruchterman_reingold_force_directed_layout(), and boost::graph::detail::page_rank_step().

#define BGL_FORALL_EDGES	(		ENAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<boost::graph_traits<GraphType>::edge_iterator, \
               boost::graph_traits<GraphType>::edge_iterator> BGL_RANGE(__LINE__) = edges(GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
  for (boost::graph_traits<GraphType>::edge_descriptor ENAME; \
     BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (ENAME = *BGL_FIRST(__LINE__), true):false; \
     ++BGL_FIRST(__LINE__))

#define BGL_FORALL_EDGES_T	(		ENAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<typename boost::graph_traits<GraphType>::edge_iterator, \
               typename boost::graph_traits<GraphType>::edge_iterator> BGL_RANGE(__LINE__) = edges(GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
  for (typename boost::graph_traits<GraphType>::edge_descriptor ENAME; \
    BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (ENAME = *BGL_FIRST(__LINE__), true):false; \
     ++BGL_FIRST(__LINE__))

Referenced by boost::graph::copy_edge_property(), boost::copy_edge_property(), boost::edge_coloring(), boost::find_flow_cost(), boost::detail::graph::mutate_graph_impl< compressed_sparse_row_graph< Directed, VertexProperty, EdgeProperty, GraphProperty, Vertex, EdgeIndex > >::finish_building_graph(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::graph::num_dup_edges(), boost::EdgePrinter< Graph, E >::operator()(), boost::serialization::save(), boost::detail::parallel::save_edges(), boost::successive_shortest_path_nonnegative_weights(), boost::verify_isomorphism(), and boost::verify_vf2_subgraph_iso().

#define BGL_FORALL_INEDGES	(		UNAME,
			ENAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<boost::graph_traits<GraphType>::in_edge_iterator, \
               boost::graph_traits<GraphType>::in_edge_iterator> BGL_RANGE(__LINE__) = in_edges(UNAME, GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
for (boost::graph_traits<GraphType>::edge_descriptor ENAME; \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (ENAME = *BGL_FIRST(__LINE__), true) : false; \
   ++BGL_FIRST(__LINE__))

#define BGL_FORALL_INEDGES_T	(		UNAME,
			ENAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<typename boost::graph_traits<GraphType>::in_edge_iterator, \
               typename boost::graph_traits<GraphType>::in_edge_iterator> BGL_RANGE(__LINE__) = in_edges(UNAME, GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
for (typename boost::graph_traits<GraphType>::edge_descriptor ENAME; \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (ENAME = *BGL_FIRST(__LINE__), true) : false; \
   ++BGL_FIRST(__LINE__))

Referenced by boost::detail::state< Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection >::feasible(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::detail::page_rank_step(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::pop(), boost::graph::property_on_adjacents(), boost::graph::property_on_inedges(), boost::graph::property_on_predecessors(), and boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::push().

#define BGL_FORALL_OUTEDGES	(		UNAME,
			ENAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<boost::graph_traits<GraphType>::out_edge_iterator, \
               boost::graph_traits<GraphType>::out_edge_iterator> BGL_RANGE(__LINE__) = out_edges(UNAME, GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
for (boost::graph_traits<GraphType>::edge_descriptor ENAME; \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (ENAME = *BGL_FIRST(__LINE__), true) : false; \
   ++BGL_FIRST(__LINE__))

#define BGL_FORALL_OUTEDGES_T	(		UNAME,
			ENAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<typename boost::graph_traits<GraphType>::out_edge_iterator, \
               typename boost::graph_traits<GraphType>::out_edge_iterator> BGL_RANGE(__LINE__) = out_edges(UNAME, GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
for (typename boost::graph_traits<GraphType>::edge_descriptor ENAME; \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (ENAME = *BGL_FIRST(__LINE__), true) : false; \
   ++BGL_FIRST(__LINE__))

Referenced by boost::astar_search_no_init_tree(), boost::graph::distributed::boman_et_al_graph_coloring(), boost::detail::can_extend_graph(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::delta_stepping_impl(), boost::dijkstra_shortest_paths_no_color_map_no_init(), boost::graph::distributed::hohberg_vertex_processor< Graph >::echo_phase(), boost::detail::state< Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection >::feasible(), boost::graph::distributed::hohberg_vertex_processor< Graph >::fill_edge_map(), boost::graph::distributed::hohberg_vertex_processor< Graph >::get_edge_index(), boost::graph::distributed::hohberg_vertex_processor< Graph >::get_incident_edge_index(), boost::graph::distributed::hohberg_vertex_processor< Graph >::initialize_leader(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::detail::invert_cd_path(), boost::detail::is_free(), boost::detail::maximal_fan(), boost::detail::maximum_adjacency_search(), boost::graph::distributed::hohberg_vertex_processor< Graph >::num_starting_bicomponents(), boost::graph::distributed::hohberg_vertex_processor< Graph >::operator()(), boost::detail::equivalent_edge_exists< Graph, Enable >::operator()(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::pop(), boost::graph::property_on_adjacents(), boost::graph::property_on_outedges(), boost::graph::property_on_successors(), boost::detail::base_state< Graph1, Graph2, IndexMap1, IndexMap2 >::push(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), boost::mpi::graph_communicator::setup_graph(), boost::graph::st_connected(), boost::graph::distributed::st_connected(), boost::graph::distributed::hohberg_vertex_processor< Graph >::start_naming_phase(), boost::graph::weight_degree_dist(), and boost::weighted_random_out_edge().

#define BGL_FORALL_VERTICES	(		VNAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<boost::graph_traits<GraphType>::vertex_iterator, \
               boost::graph_traits<GraphType>::vertex_iterator> BGL_RANGE(__LINE__) = vertices(GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
  for (boost::graph_traits<GraphType>::vertex_descriptor VNAME; \
    BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (VNAME = *BGL_FIRST(__LINE__), true):false; \
     ++BGL_FIRST(__LINE__))

#define BGL_FORALL_VERTICES_T	(		VNAME,
			GNAME,
			GraphType
	)

Value:

for (std::pair<typename boost::graph_traits<GraphType>::vertex_iterator, \
               typename boost::graph_traits<GraphType>::vertex_iterator> BGL_RANGE(__LINE__) = vertices(GNAME); \
  BGL_FIRST(__LINE__) != BGL_LAST(__LINE__); BGL_FIRST(__LINE__) = BGL_LAST(__LINE__)) \
  for (typename boost::graph_traits<GraphType>::vertex_descriptor VNAME; \
    BGL_FIRST(__LINE__) != BGL_LAST(__LINE__) ? (VNAME = *BGL_FIRST(__LINE__), true):false; \
     ++BGL_FIRST(__LINE__))

Referenced by boost::are_property_maps_different(), boost::graph::distributed::boman_et_al_graph_coloring(), boost::detail::can_extend_graph(), boost::circle_graph_layout(), boost::detail::compute_in_degree(), boost::detail::graph::kamada_kawai_spring_layout_impl< Topology, Graph, PositionMap, WeightMap, EdgeOrSideLength, Done, VertexIndexMap, DistanceMatrix, SpringStrengthMatrix, PartialDerivativeMap >::compute_partial_derivatives(), boost::graph::distributed::connected_components_ps(), boost::graph::copy_vertex_property(), boost::copy_vertex_property(), boost::count_vertices(), boost::cuthill_mckee_ordering(), boost::cycle_canceling(), boost::graph::degree_dist(), boost::degree_vertex_invariant< InDegreeMap, Graph >::degree_vertex_invariant(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::delta_stepping_impl(), boost::dijkstra_shortest_paths_no_color_map(), boost::graph::parallel::detail::do_brandes_sssp(), boost::graph::parallel::detail::do_sequential_brandes_sssp(), boost::graph::dup_edge_dist(), boost::fill_membership_map(), boost::detail::mas_min_cut_visitor< ParityMap, WeightMap, IndexMap >::finish_vertex(), boost::fruchterman_reingold_force_directed_layout(), boost::graph::distributed::fruchterman_reingold_force_directed_layout(), boost::graph::distributed::hohberg_biconnected_components(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::distributed::detail::initialize_min_out_weights(), boost::king_ordering(), boost::detail::maximum_adjacency_search(), boost::detail::mcgregor_common_subgraphs_internal(), boost::detail::mcgregor_common_subgraphs_internal_init(), boost::graph::parallel::detail::non_distributed_brandes_betweenness_centrality_impl(), boost::graph::distributed::number_components_from_parents(), boost::vf2_print_callback< Graph1, Graph2 >::operator()(), boost::graph::distributed::neighboring_tiles_force_pairs< PositionMap >::operator()(), boost::EdgePrinter< Graph, E >::operator()(), boost::GraphPrinter< Graph, V, E >::operator()(), boost::detail::unique_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::detail::maximum_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::detail::unique_maximum_subgraph_interceptor< GraphFirst, GraphSecond, VertexIndexMapFirst, VertexIndexMapSecond, SubGraphCallback >::operator()(), boost::graph::page_rank(), boost::graph::distributed::page_rank_impl(), boost::graph::detail::page_rank_step(), boost::graph::distributed::cc_detail::parallel_connected_components(), boost::graph::property_on_adjacents(), boost::graph::property_on_inedges(), boost::graph::property_on_outedges(), boost::graph::property_on_predecessors(), boost::graph::property_on_successors(), boost::detail::r_c_shortest_paths_dispatch(), boost::random_graph_layout(), boost::detail::random_spanning_tree_internal(), boost::graph::distributed::delta_stepping_impl< Graph, PredecessorMap, DistanceMap, EdgeWeightMap >::run(), boost::graph::parallel::detail::betweenness_centrality_delta_stepping_impl< Graph, DistanceMap, IncomingMap, EdgeWeightMap, PathCountMap >::run(), boost::serialization::save(), boost::detail::parallel::save_in_edges(), boost::scale_graph(), boost::mpi::graph_communicator::setup_graph(), boost::graph::st_connected(), boost::graph::distributed::st_connected(), boost::successive_shortest_path_nonnegative_weights(), boost::detail::isomorphism_algo< Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2 >::test_isomorphism(), boost::graph_test< Graph >::test_vertex_property_graph(), and boost::graph::weight_degree_dist().

#define BGL_LAST

(

linenum

)

(BGL_RANGE(linenum).second)

#define BGL_RANGE

(

linenum

)

BGL_CAT(bgl_range_,linenum)