January 2010 - Boost-users - lists.preview.boost.org

Re: [Boost-users] binary size:boost::serialization and boost::variant
by Brian Wood 25 Jan '10

25 Jan '10

Robert Ramey writes: > It's not a question of the symbols. with MSVC 7.1 at least, > Release mode optimization collapses all the inline template > instantiations down to code which is no larger than one > would write by hand. This can be verified by adding the > debug symbols to the release mode and disassembling at > the point where serialization is invoked. In MSVC the > debug symbols are a separate file. The "code bloat" > results from that fact that inline template code is not > optimized by the comiler in Debug builds. In the tests I've done on Windows Vista and MSVC++ 10 with -O2, executables built with release version of Boost Serialization are more than two times the size of executables built with Ebenezer Enterprises' approach. On Linux the stripped Boost executables are more than 4 times larger than their Ebenezer counterparts. http://webEbenezer.net/comparison.html Regards, Brian Wood http://www.webEbenezer.net (651) 251-9384 <http://frankrosenbloom.com>

2 1

[multi_array] compiling and changing an example
by sean farrow 25 Jan '10

25 Jan '10

Hi: I'm tryingto use boost::multi_array, I've included boost/multi_array.hpp in the file and have the following code: private: typedef boost::multi_array<double, 3> array_type; typedef array_type::index index; array_type test(boost::extents[3][4][2]); Commenting out the third line compiles fine, but leaving this in gives a c2061 error. It seems there is an issue with boost::extents, which header is this in? I don't have a using boost; earlier, should I have? I'm using visual c+ 2008. Any help apreciated. Sean.

1 0

[asio] Throwing an exception on timeout
by Pascal Kesseli 24 Jan '10

24 Jan '10

Hi folks While reading out a serial interface with boost asio, I used the following timeout protection: const boost::function<void(const error_code &)> SerialInterface::ON_TIMEOUT(if_then(_1 != error::operation_aborted, throw_exception(bind(constructor< SerialInterfaceTimeoutException> ())))); // ... void SerialInterface::read(void *buf, size_t size) throw(SerialInterfaceTimeoutException) { charTimeout.expires_from_now(maxCharDelay); charTimeout.async_wait(ON_TIMEOUT); // ... If a timeout occurs, the exception is thrown as expected. However, it is not handed any further from read, but instead the program terminates with a message concerning the exception. Is there any method having a throw() constraint in this async_wait chain? Thanks for any hint and best regards Pascal _________________________________________________________________ Personalisiere dein Messenger, inklusive persönliche Smileys ;-) Überrasche deine Freunde - wir zeigen dir wie's geht. http://rubrik.ch.msn.com/reportagen/personalisieren.aspx

3 2

[BGL] astar_search with VertexList=listS and bundled properties - binary '[' : no operator found
by liong＠gmx.ch 24 Jan '10

24 Jan '10

Hi all I'm stuck trying to get astar_search with VertexList=listS to compile properly with MS VC 2008SP1 or gcc version 4.4.1 (Ubuntu 4.4.1-4ubuntu9)gcc-4.4.1 using boost_1_41_0: I tried two approaches: The first is to have the vertex index as a member of the bundled vertex properties and the second is to have the vertex index as an exterior property map. Both approaches result in the same errors (with VC) and after reading a lot of docs, i'm even more confused and still cannot figure how to get rid of them. I'm new to BGL and and thankful for any suggestions. Lion **************************************************************************** vertex index as member of bundled vertex property **************************************************************************** #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/astar_search.hpp> using namespace std; using namespace boost; // bundled properties typedef float TCost; struct Fork { Fork() {}; Fork(float p_x, float p_y, string p_Name) : x(p_x) , y(p_y) , Name(p_Name) {}; string Name; float x; float y; // tmp size_t VertexIdx; }; struct Street { Street() {}; Street(TCost p_Weight) : Weight(p_Weight) {}; TCost Weight; }; // define the graph // 2do: what to change when using listS for vertices typedef adjacency_list<listS, listS, bidirectionalS, Fork, Street, no_property, listS> Graph; // declare the graph Graph g; // construct a graph object typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::edge_descriptor Edge; // A* specific // ************************************************************************* // euclidean distance heuristic template <class Graph, class CostType, class LocMap> class distance_heuristic : public astar_heuristic<Graph, CostType> { public: typedef typename graph_traits<Graph>::vertex_descriptor Vertex; distance_heuristic(LocMap l, Vertex goal) : m_location(l), m_goal(goal) {} CostType operator()(Vertex u) { CostType dx = m_location[m_goal].x - m_location[u].x; CostType dy = m_location[m_goal].y - m_location[u].y; return ::sqrt(dx * dx + dy * dy); } private: LocMap m_location; Vertex m_goal; }; // A* termination (goal) struct found_goal {}; // exception for termination // visitor that terminates when we find the goal template <class Vertex> class astar_goal_visitor : public boost::default_astar_visitor { public: astar_goal_visitor(Vertex goal) : m_goal(goal) {} template <class Graph> void examine_vertex(Vertex u, Graph& g) { if(u == m_goal) throw found_goal(); } private: Vertex m_goal; }; // ************************************************************************* int main(int argc, char* argv[]) { Fork vpLH(-1, 1, "LH"); Fork vpLT(-1, -1, "LT"); Fork vpO(0, 2, "O"); Fork vpRH(1, 1, "RH"); Fork vpRT(1, -1, "RT"); Fork vpU(0, -2, "U"); Vertex vlh = add_vertex(vpLH, g); Vertex vlt = add_vertex(vpLT, g); Vertex vo = add_vertex(vpO, g); Vertex vrh = add_vertex(vpRH, g); Vertex vrt = add_vertex(vpRT, g); Vertex vu = add_vertex(vpU, g); Street epULT(1); Street epLTLH(2); Street epLHO(3); Street epURT(4); Street epRTRH(5); Street epRHO(6); bool inserted; Edge eult, eltlh, elho, eurt, ertrh, erho; tie(eult, inserted) = add_edge(vu, vlt, epULT, g); tie(eltlh, inserted) = add_edge(vlt, vlh, epLTLH, g); tie(elho, inserted) = add_edge(vlh, vo, epLHO, g); tie(eurt, inserted) = add_edge(vu, vrt, epURT, g); tie(ertrh, inserted) = add_edge(vrt, vrh, epRTRH, g); tie(erho, inserted) = add_edge(vrh, vo, epRHO, g); Edge eltrt; Street epLTRT(2); tie(eltrt, inserted) = add_edge(vlt, vrt, epLTRT, g); // do a A* search // ********************************************************************* Vertex start = vu; Vertex goal = vo; property_map<Graph, vertex_bundle_t>::type Forks = get(vertex_bundle, g); property_map<Graph, edge_bundle_t>::type Streets = get(edge_bundle, g); vector<Vertex> predecessors(num_vertices(g)); vector<float> ranks(num_vertices(g)); vector<float> distances(num_vertices(g)); vector<boost::default_color_type> colors(num_vertices(g)); typedef boost::property_map<Graph, TCost Street::*>::type EdgeWeightMap; EdgeWeightMap edgeWeightMap = get(&Street::Weight, g); typedef boost::property_map<Graph, size_t Fork::*>::type VertexIndexmap; VertexIndexmap vertexIndexmap = get(&Fork::VertexIdx, g); iterator_property_map < vector<Vertex>::iterator, VertexIndexmap, Vertex, Vertex& > ipm_predecessors(predecessors.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_ranks(ranks.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_distances(distances.begin()); iterator_property_map < vector<boost::default_color_type>::iterator, VertexIndexmap, default_color_type, default_color_type& > ipm_colors(colors.begin()); try { // initialize the vertex_index property values // (when using listS for vertices) graph_traits<Graph>::vertex_iterator vi, vend; graph_traits<Graph>::vertices_size_type cnt = 0; for (tie(vi,vend) = vertices(g); vi != vend; ++vi) put(vertexIndexmap, *vi, cnt++); astar_search (g, start, distance_heuristic<Graph, TCost, property_map<Graph, vertex_bundle_t>::type> (Forks, goal), astar_goal_visitor<Vertex>(goal), ipm_predecessors, ipm_ranks, ipm_distances, edgeWeightMap, vertexIndexmap, ipm_colors, std::less<TCost>(), closed_plus<TCost>(), std::numeric_limits<TCost>::max BOOST_PREVENT_MACRO_SUBSTITUTION (), std::numeric_limits<TCost>::min() ); } catch (found_goal fg) { // found a path to the goal } return 0; } ---------------------------------------------------------------------------- compiler output from MS VC 2008SP1 ---------------------------------------------------------------------------- 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'Vertex ' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, Vertex )' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(116) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,Value,unsigned int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Value=Vertex, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=Vertex, 1> V=unsigned int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(113) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::push(const Value &)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(251) : see reference to class template instantiation 'boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>' being compiled 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(298) : see reference to function template instantiation 'void boost::astar_search_no_init<VertexListGraph,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> VertexIndexMap=VertexIndexmap, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1> .\boost_graph.cpp(233) : see reference to function template instantiation 'void boost::astar_search<Graph,distance_heuristic<Graph,CostType,LocMap>,astar_goal_visitor<Vertex>,boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,EdgeWeightMap,VertexIndexmap,boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,IndexMap,boost::default_color_type,boost::default_color_type &>,std::less<_Ty>,boost::closed_plus<TCost>,std::numeric_limits<float>::_Ty,std::numeric_limits<float>::_Ty>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,VertexIndexMap,ColorMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> Graph=Graph, 1> CostType=TCost, 1> LocMap=boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>, 1> Vertex=Vertex, 1> RandomAccessIterator=std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>, 1> IndexMap=VertexIndexmap, 1> T=Vertex, 1> R=Vertex &, 1> _Ty=float, 1> _Alloc=std::allocator<float>, 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> VertexIndexMap=VertexIndexmap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'void *' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, void *)' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(133) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,void*,int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=void *, 1> V=int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(129) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::pop(void)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1>2 error(s) **************************************************************************** vertex index as exterior property map **************************************************************************** #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/astar_search.hpp> using namespace std; using namespace boost; // bundled properties typedef float TCost; struct Fork { Fork() {}; Fork(float p_x, float p_y, string p_Name) : x(p_x) , y(p_y) , Name(p_Name) {}; string Name; float x; float y; }; struct Street { Street() {}; Street(TCost p_Weight) : Weight(p_Weight) {}; TCost Weight; }; // define the graph // 2do: what to change when using listS for vertices typedef adjacency_list<listS, listS, bidirectionalS, Fork, Street, no_property, listS> Graph; // declare the graph Graph g; // construct a graph object typedef graph_traits<Graph>::vertex_descriptor Vertex; typedef graph_traits<Graph>::edge_descriptor Edge; // exterior property maps typedef std::map<Vertex, size_t> MapVertexIndex; MapVertexIndex mapVertexIndex; typedef boost::associative_property_map<MapVertexIndex> VertexIndexmap; VertexIndexmap vertexIndexmap(mapVertexIndex); // A* specific // ************************************************************************* // euclidean distance heuristic template <class Graph, class CostType, class LocMap> class distance_heuristic : public astar_heuristic<Graph, CostType> { public: typedef typename graph_traits<Graph>::vertex_descriptor Vertex; distance_heuristic(LocMap l, Vertex goal) : m_location(l), m_goal(goal) {} CostType operator()(Vertex u) { CostType dx = m_location[m_goal].x - m_location[u].x; CostType dy = m_location[m_goal].y - m_location[u].y; return ::sqrt(dx * dx + dy * dy); } private: LocMap m_location; Vertex m_goal; }; // A* termination (goal) struct found_goal {}; // exception for termination // visitor that terminates when we find the goal template <class Vertex> class astar_goal_visitor : public boost::default_astar_visitor { public: astar_goal_visitor(Vertex goal) : m_goal(goal) {} template <class Graph> void examine_vertex(Vertex u, Graph& g) { if(u == m_goal) throw found_goal(); } private: Vertex m_goal; }; // ************************************************************************* int main(int argc, char* argv[]) { Fork vpLH(-1, 1, "LH"); Fork vpLT(-1, -1, "LT"); Fork vpO(0, 2, "O"); Fork vpRH(1, 1, "RH"); Fork vpRT(1, -1, "RT"); Fork vpU(0, -2, "U"); Vertex vlh = add_vertex(vpLH, g); Vertex vlt = add_vertex(vpLT, g); Vertex vo = add_vertex(vpO, g); Vertex vrh = add_vertex(vpRH, g); Vertex vrt = add_vertex(vpRT, g); Vertex vu = add_vertex(vpU, g); Street epULT(1); Street epLTLH(2); Street epLHO(3); Street epURT(4); Street epRTRH(5); Street epRHO(6); bool inserted; Edge eult, eltlh, elho, eurt, ertrh, erho; tie(eult, inserted) = add_edge(vu, vlt, epULT, g); tie(eltlh, inserted) = add_edge(vlt, vlh, epLTLH, g); tie(elho, inserted) = add_edge(vlh, vo, epLHO, g); tie(eurt, inserted) = add_edge(vu, vrt, epURT, g); tie(ertrh, inserted) = add_edge(vrt, vrh, epRTRH, g); tie(erho, inserted) = add_edge(vrh, vo, epRHO, g); Edge eltrt; Street epLTRT(2); tie(eltrt, inserted) = add_edge(vlt, vrt, epLTRT, g); // do a A* search // ********************************************************************* Vertex start = vu; Vertex goal = vo; property_map<Graph, vertex_bundle_t>::type Forks = get(vertex_bundle, g); property_map<Graph, edge_bundle_t>::type Streets = get(edge_bundle, g); vector<Vertex> predecessors(num_vertices(g)); vector<float> ranks(num_vertices(g)); vector<float> distances(num_vertices(g)); vector<boost::default_color_type> colors(num_vertices(g)); typedef boost::property_map<Graph, TCost Street::*>::type EdgeWeightMap; EdgeWeightMap edgeWeightMap = get(&Street::Weight, g); iterator_property_map < vector<Vertex>::iterator, VertexIndexmap, Vertex, Vertex& > ipm_predecessors(predecessors.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_ranks(ranks.begin()); iterator_property_map < vector<float>::iterator, VertexIndexmap, float, float& > ipm_distances(distances.begin()); iterator_property_map < vector<default_color_type>::iterator, VertexIndexmap, default_color_type, default_color_type& > ipm_colors(colors.begin()); try { // initialize the vertex_index property values // (when using listS for vertices) graph_traits<Graph>::vertex_iterator vi, vend; graph_traits<Graph>::vertices_size_type cnt = 0; for (tie(vi,vend) = vertices(g); vi != vend; ++vi) put(vertexIndexmap, *vi, cnt++); astar_search (g, start, distance_heuristic<Graph, TCost, property_map<Graph, vertex_bundle_t>::type> (Forks, goal), astar_goal_visitor<Vertex>(goal), ipm_predecessors, ipm_ranks, ipm_distances, edgeWeightMap, vertexIndexmap, ipm_colors, std::less<TCost>(), closed_plus<TCost>(), std::numeric_limits<TCost>::max BOOST_PREVENT_MACRO_SUBSTITUTION (), std::numeric_limits<TCost>::min() ); } catch (found_goal fg) { // found a path to the goal } return 0; } ---------------------------------------------------------------------------- compiler output from MS VC 2008SP1 ---------------------------------------------------------------------------- 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'Vertex ' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, Vertex )' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(116) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,Value,unsigned int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Value=Vertex, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=Vertex, 1> V=unsigned int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(113) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::push(const Value &)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(251) : see reference to class template instantiation 'boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>' being compiled 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/astar_search.hpp(298) : see reference to function template instantiation 'void boost::astar_search_no_init<VertexListGraph,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> VertexIndexMap=VertexIndexmap, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1> .\boost_graph.cpp(237) : see reference to function template instantiation 'void boost::astar_search<Graph,distance_heuristic<Graph,CostType,LocMap>,astar_goal_visitor<Vertex>,boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,boost::iterator_property_map<std::_Vector_iterator<_Ty,_Alloc>,IndexMap,float,float &>,EdgeWeightMap,VertexIndexmap,boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,IndexMap,boost::default_color_type,boost::default_color_type &>,std::less<_Ty>,boost::closed_plus<TCost>,std::numeric_limits<float>::_Ty,std::numeric_limits<float>::_Ty>(VertexListGraph &,void *,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,VertexIndexMap,ColorMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> Graph=Graph, 1> CostType=TCost, 1> LocMap=boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>, 1> Vertex=Vertex, 1> RandomAccessIterator=std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>, 1> IndexMap=VertexIndexmap, 1> T=Vertex, 1> R=Vertex &, 1> _Ty=float, 1> _Alloc=std::allocator<float>, 1> VertexListGraph=Graph, 1> AStarHeuristic=distance_heuristic<Graph,TCost,boost::adj_list_vertex_property_map<Graph,Fork,Fork &,boost::vertex_bundle_t>>, 1> AStarVisitor=astar_goal_visitor<Vertex>, 1> PredecessorMap=boost::iterator_property_map<std::_Vector_iterator<Vertex ,std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::listS,boost::listS,boost::bidirectionalS,Fork,Street,RoadNetwork,boost::listS>,boost::listS,boost::listS,boost::bidirectionalS,boost::property<boost::vertex_bundle_t,Fork>,boost::property<boost::edge_bundle_t,Street>,RoadNetwork,boost::listS>::config::vertex_ptr >>,VertexIndexmap,Vertex,Vertex &>, 1> CostMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> WeightMap=EdgeWeightMap, 1> VertexIndexMap=VertexIndexmap, 1> ColorMap=boost::iterator_property_map<std::_Vector_iterator<boost::default_color_type,std::allocator<boost::default_color_type>>,VertexIndexmap,boost::default_color_type,boost::default_color_type &>, 1> CompareFunction=std::less<TCost>, 1> CombineFunction=boost::closed_plus<TCost>, 1> CostInf=std::numeric_limits<float>::_Ty, 1> CostZero=std::numeric_limits<float>::_Ty 1> ] 1>C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/property_map.hpp(324) : error C2679: binary '[' : no operator found which takes a right-hand operand of type 'void *' (or there is no acceptable conversion) 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/property_map/vector_property_map.hpp(69): could be 'unsigned int &boost::vector_property_map<T>::operator [](const unsigned int &) const' 1> with 1> [ 1> T=size_t 1> ] 1> while trying to match the argument list '(const boost::vector_property_map<T>, void *)' 1> with 1> [ 1> T=size_t 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(133) : see reference to function template instantiation 'void boost::put<boost::vector_property_map<T>,unsigned int&,void*,int>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> T=size_t, 1> Reference=unsigned int &, 1> LvaluePropertyMap=boost::vector_property_map<size_t>, 1> K=void *, 1> V=int 1> ] 1> C:\Data\_dev\SW_Libs\boost_1_41_0\boost/graph/detail/d_ary_heap.hpp(129) : while compiling class template member function 'void boost::d_ary_heap_indirect<Value,Arity,IndexInHeapPropertyMap,DistanceMap,Compare>::pop(void)' 1> with 1> [ 1> Value=Vertex, 1> Arity=4, 1> IndexInHeapPropertyMap=IndexInHeapMap, 1> DistanceMap=boost::iterator_property_map<std::_Vector_iterator<float,std::allocator<float>>,VertexIndexmap,float,float &>, 1> Compare=std::less<TCost> 1> ] 1>2 error(s) ---------------------------------------------------------------------------- compiler output from gcc-4.4.1 ---------------------------------------------------------------------------- In file included from /usr/include/c++/4.4/backward/hash_set:59, from /home/zaphod/data/dev/boost_1_41_0/boost/graph/adjacency_list.hpp:25, from bundled_list_not_working_exterior.cpp:6: /usr/include/c++/4.4/backward/backward_warning.h:28:2: warning: #warning This file includes at least one deprecated or antiquated header which may be removed without further notice at a future date. Please use a non-deprecated interface with equivalent functionality instead. For a listing of replacement headers and interfaces, consult the file backward_warning.h. To disable this warning use -Wno-deprecated. In file included from /home/zaphod/data/dev/boost_1_41_0/boost/graph/adjacency_list.hpp:42, from bundled_list_not_working_exterior.cpp:6: /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp: In function ‘void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, Reference = long unsigned int&, K = void*, V = size_t]’: /home/zaphod/data/dev/boost_1_41_0/boost/graph/detail/d_ary_heap.hpp:116: instantiated from ‘void boost::d_ary_heap_indirect<Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container>::push(const Value&) [with Value = void*, long unsigned int Arity = 4ul, IndexInHeapPropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, Compare = std::less<float>, Container = std::vector<void*, std::allocator<void*> >]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/breadth_first_search.hpp:73: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Buffer = boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]::MutableQueue, BFSVisitor = boost::detail::astar_bfs_visitor<distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, astar_goal_visitor<void*>, boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, boost::closed_plus<float>, std::less<float> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:259: instantiated from ‘void boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:296: instantiated from ‘void boost::astar_search(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, VertexIndexMap, ColorMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = Graph, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ bundled_list_not_working_exterior.cpp:237: instantiated from here /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: invalid conversion from ‘void*’ to ‘size_t’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: initializing argument 1 of ‘typename std::iterator_traits<typename std::vector<T, std::allocator<_CharT> >::iterator>::reference boost::vector_property_map<T, IndexMap>::operator[](const typename boost::property_traits<IndexMap>::key_type&) const [with T = long unsigned int, IndexMap = boost::identity_property_map]’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp: In function ‘void boost::put(const boost::put_get_helper<Reference, PropertyMap>&, K, const V&) [with PropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, Reference = long unsigned int&, K = void*, V = int]’: /home/zaphod/data/dev/boost_1_41_0/boost/graph/detail/d_ary_heap.hpp:133: instantiated from ‘void boost::d_ary_heap_indirect<Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container>::pop() [with Value = void*, long unsigned int Arity = 4ul, IndexInHeapPropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, Compare = std::less<float>, Container = std::vector<void*, std::allocator<void*> >]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/breadth_first_search.hpp:75: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Buffer = boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]::MutableQueue, BFSVisitor = boost::detail::astar_bfs_visitor<distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, astar_goal_visitor<void*>, boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, boost::closed_plus<float>, std::less<float> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:259: instantiated from ‘void boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:296: instantiated from ‘void boost::astar_search(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, VertexIndexMap, ColorMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = Graph, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ bundled_list_not_working_exterior.cpp:237: instantiated from here /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: invalid conversion from ‘void*’ to ‘size_t’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:324: error: initializing argument 1 of ‘typename std::iterator_traits<typename std::vector<T, std::allocator<_CharT> >::iterator>::reference boost::vector_property_map<T, IndexMap>::operator[](const typename boost::property_traits<IndexMap>::key_type&) const [with T = long unsigned int, IndexMap = boost::identity_property_map]’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp: In function ‘Reference boost::get(const boost::put_get_helper<Reference, PropertyMap>&, const K&) [with PropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, Reference = long unsigned int&, K = void*]’: /home/zaphod/data/dev/boost_1_41_0/boost/graph/detail/d_ary_heap.hpp:146: instantiated from ‘void boost::d_ary_heap_indirect<Value, Arity, IndexInHeapPropertyMap, DistanceMap, Compare, Container>::update(const Value&) [with Value = void*, long unsigned int Arity = 4ul, IndexInHeapPropertyMap = boost::vector_property_map<long unsigned int, boost::identity_property_map>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, Compare = std::less<float>, Container = std::vector<void*, std::allocator<void*> >]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:182: instantiated from ‘void boost::detail::astar_bfs_visitor<AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate>::gray_target(Edge, Graph&) [with Edge = boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Graph = const boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, UniformCostVisitor = astar_goal_visitor<void*>, UpdatableQueue = boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, BinaryFunction = boost::closed_plus<float>, BinaryPredicate = std::less<float>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/breadth_first_search.hpp:83: instantiated from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Buffer = boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]::MutableQueue, BFSVisitor = boost::detail::astar_bfs_visitor<distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, astar_goal_visitor<void*>, boost::d_ary_heap_indirect<void*, 4ul, boost::vector_property_map<long unsigned int, boost::identity_property_map>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, std::less<float>, std::vector<void*, std::allocator<void*> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, boost::closed_plus<float>, std::less<float> >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:259: instantiated from ‘void boost::astar_search_no_init(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, VertexIndexMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ /home/zaphod/data/dev/boost_1_41_0/boost/graph/astar_search.hpp:296: instantiated from ‘void boost::astar_search(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, AStarHeuristic, AStarVisitor, PredecessorMap, CostMap, DistanceMap, WeightMap, VertexIndexMap, ColorMap, CompareFunction, CombineFunction, CostInf, CostZero) [with VertexListGraph = Graph, AStarHeuristic = distance_heuristic<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, float, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, Fork, Fork&, boost::vertex_bundle_t> >, AStarVisitor = astar_goal_visitor<void*>, PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*, std::allocator<void*> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, void*, void*&>, CostMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<float*, std::vector<float, std::allocator<float> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, float, float&>, WeightMap = boost::bundle_property_map<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, Fork, Street, RoadNetwork, boost::listS>, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, Street, float>, VertexIndexMap = boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::associative_property_map<std::map<void*, long unsigned int, std::less<void*>, std::allocator<std::pair<void* const, long unsigned int> > > >, boost::default_color_type, boost::default_color_type&>, CompareFunction = std::less<float>, CombineFunction = boost::closed_plus<float>, CostInf = float, CostZero = float]’ bundled_list_not_working_exterior.cpp:237: instantiated from here /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:317: error: invalid conversion from ‘void* const’ to ‘size_t’ /home/zaphod/data/dev/boost_1_41_0/boost/property_map/property_map.hpp:317: error: initializing argument 1 of ‘typename std::iterator_traits<typename std::vector<T, std::allocator<_CharT> >::iterator>::reference boost::vector_property_map<T, IndexMap>::operator[](const typename boost::property_traits<IndexMap>::key_type&) const [with T = long unsigned int, IndexMap = boost::identity_property_map]’ -- Haiti-Nothilfe! Helfen Sie per SMS: Sende UIHAITI an die Nummer 81190. Von 5 Euro je SMS (zzgl. SMS-Gebühr) gehen 4,83 Euro an UNICEF.

1 0

[BoostCon 2010] Final Call for Participation
by Hartmut Kaiser 24 Jan '10

24 Jan '10

Please distribute! -------------------------------- 4th Annual Boost Conference 2010 -------------------------------- Aspen CO, USA, May 10-14, 2010, www.boostcon.com Final Call for Participation -------------------------------- Important dates: Proposal submissions Extended to January 3, 2010 Proposals decisions sent January 25, 2010 (tentative program available) Fully scheduled program available February 10, 2010 Session materials due April 15, 2010 -------------------------------- We invite you to submit session proposals to the 4th Annual Boost Conference: BoostCon 2010 (Aspen CO, USA, May 10-14, 2010). Traditionally the main face-to-face event for all things Boost (www.boost.org), BoostCon 2010 will present leading speakers from the whole C++ community. From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and the new C++ Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at two constituencies: Boost end-users and hard-core Boost library and tool developers. The program fosters interaction and engagement within and across those two groups, with an emphasis on hands-on, participatory sessions. Session topics -------------- Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it will change life for users and library writers * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Other topics likely to be of great interest to Boost users and developers Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. Session formats --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops Workshops provide an active arena for advancements in Boost- relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. Submitting a proposal --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). Submission details ------------------ All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon10. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates). The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon website and will be available to attendees. For general information on the BoostCon 2010 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon10(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

5 4

binary size:boost::serialization and boost::variant
by Tyler Littlefield 24 Jan '10

24 Jan '10

Hello, When working with the serialization my project's binary isn't overly bloated, until I add in the serialization. The debug size becomes about 13M with the size of the binary with symbols stripped being about 1.1M larger than before I included the variant.hpp. Is there any reason for this, or a way it can be solved? I'd rather not distribute a binary this large if I can help it. Thanks, Tyler Littlefield http://tds-solutions.net Twitter: sorressean

2 3

[1.42] The PDF build of the docs for the 1.42 BETA available
by John Maddock 24 Jan '10

24 Jan '10

The PDF build of the docs for 1.42 BETA are now available for download from the sourceforge download page https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_…. Please let me know if you spot any issues, Thanks, John Maddock.

1 0

generate an n-deep runtime for loop
by Hicham Mouline 24 Jan '10

24 Jan '10

Hello, I have a fusion sequence of optionals, for e.g. fusion::vector< optional< variant< std::vector<double>, triplet<double>, pair<double>, double> >, optional< variant< std::vector<int>, triplet<int>, pair<int>, int> >, optional< variant< std::vector<double>, triplet<double>, pair<double>, double> > > The size of fusion::vector is variable. The optionals are never empty. In 1 possible instance of this fusion vector, we have these runtime values { 5.5, 10.1, 15.7, 30.9 //std::vector<double> v1 5:15:5 // triplet<int> range from 5 to 10 incrementing with 4 5.4 // double, value fixed at 5.4 } I wish to generate at runtime the following code (not always 3-deep for loops, the 3 would be known at compile time, but the bounds of the indices in the for loops are only known at runtime) for (size_t index1=0; index1< v1.size(); ++index1) { for (int index2=5; index2<=15; index2+=5) { for (double index3=5.4; index3<=5.4; ++index3) { // some code } } } is this possible? regards,

2 5

bjam library build problem in 1.41 for VS 2005?
by Jeff 24 Jan '10

24 Jan '10

After installing Boost 1.41, I am having some library file problems which I think were caused by not building boost correctly. I built boost using the following commands: bootstrap .\bjam When I link an application that uses Regex, this is what happens: LINK : fatal error LNK1104: cannot open file 'libboost_regex-vc80-mt-s-1_41.lib' Please note that I have included the stage\lib into my VS library include options. The problem is that that file does not exist but this one does: C:\boost_1_41_0\stage\lib\libboost_regex-vc80-mt.lib How do I get the *mt-s-1_41.lib versions to build? Thank you Running Visual Studio 2005, Windows XP

2 2

Build boost library on 64 bit linux
by JongKwan Kim 23 Jan '10

23 Jan '10

Hi all, I would like to build boost library 1.36.0 on the 64 bits linux machine. In fact, I install it, but when I run my code, I got the segmentation faults. So, I found the web site to solve this problem... http://old.nabble.com/How-to-build-32-bits-boost-library-on-a-64-bits-platf… At this site, they say I have to use "address-model=32 architecture=x86" arguments to bjam, but I do not know how can I use this arguments. Do I have to install the bjam separately? If someone knows that, please let me know. Thanks,

2 1