Boost Users :

Date view	Thread view	Subject view	Author view

Subject: [Boost-users] [BGL] astar_search with VertexList=listS and bundled properties - binary '[' : no operator found
From: liong_at_[hidden]
Date: 2010-01-24 14:23:50

Next message: Charles Solar: "[Boost-users] Integrating Boost::Test into a logger"
Previous message: Emil Dotchevski: "Re: [Boost-users] [asio] Throwing an exception on timeout"

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
// *************************************************************************

// A* termination (goal)
struct found_goal {}; // exception for termination

// *************************************************************************

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");

    Street epULT(1);
    Street epLTLH(2);
    Street epLHO(3);
    Street epURT(4);
    Street epRTRH(5);
    Street epRHO(6);

bool inserted;

    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());

        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,

} 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 unsign
ed 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> > > >, Col
orMap = 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/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 unsign
ed 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/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: 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_p
roperty_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::ve
ctor<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*>, Predeces
sorMap = 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, boos
t::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_plu
s<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/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.

Next message: Charles Solar: "[Boost-users] Integrating Boost::Test into a logger"
Previous message: Emil Dotchevski: "Re: [Boost-users] [asio] Throwing an exception on timeout"

Date view	Thread view	Subject view	Author view

Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net