November 2008 - Boost-users - lists.preview.boost.org

[BGL] boost::detail::error_property_not_found issue
by M. Siebeneicher 18 Nov '08

18 Nov '08

Hi boost users, at first some pieces of code: class EdgeProperties { public: cPose m_pose; PosePrecision m_precisionPose; }; class VertexContainer { public: VertexID m_idVertex; //!< ID of the container VertexID m_idParent; //!< ID of the parent container unsigned int m_nDepth; //!< Depth of vertex in the tree }; typedef adjacency_list< vecS , vecS , bidirectionalS , VertexContainer , EdgeProperties > BGLGraph; void traverse(BGLGraph& graphIn, const IDMapper& idMapperIn) { // Get the index map typedef property_map<BGLGraph, VertexID VertexContainer::*>::type IndexMap; IndexMap im = get(&VertexContainer::m_idVertex, graphIn); // The source vertex BGLVertexDescriptor startDescriptor; idMapperIn.mapIDs(this->getStartID(), startDescriptor); std::vector<BGLVertexDescriptor> p(num_vertices(graphIn)); p[get(im, startDescriptor)] = startDescriptor; //p[startDescriptor] = startDescriptor; breadth_first_search( graphIn , startDescriptor , vertex_index_map(im).visitor(make_bfs_visitor(record_predecessors(&p[0], boost::on_tree_edge()))) ); . . . } Compiling my whole code that contains the above one gives me the following error/warning: ----------------------------------------------------------------------------------------------------------- ph_visitor_t,boost::bgl_named_params<IndexMap,boost::vertex_index_t,boost::no_property>::self>,boost::graph_visitor_t>::type>::result<boost::bfs_visitor<>>::type ] d:\FAS_SIM\SDKs\boost_1_35_0\boost\graph\breadth_first_search.hpp(256): Siehe Verweis auf Instanziierung der kompilierten Funktionsvorlage 'void boost::detail::bfs_dispatch<boost::detail::error_property_not_found>::apply<VertexListGraph,boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self>(VertexListGraph &,boost::graph_traits<G>::vertex_descriptor,const boost::bgl_named_params<boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self> &,boost::detail::error_property_not_found)' with [ VertexListGraph=de::audi::scenetree::BGLGraph, Visitors=boost::predecessor_recorder<std::allocator<std::_Vbase>::value_type *__w64 ,boost::on_tree_edge>, T=IndexMap, Tag=boost::vertex_index_t, Base=boost::no_property, G=de::audi::scenetree::BGLGraph ] d:\Sources\SceneTreeLib\test_src\de\audi\scenetree\visitor\DepthTestVisitor.cpp(48): Siehe Verweis auf Instanziierung der kompilierten Funktionsvorlage 'void boost::breadth_first_search<de::audi::scenetree::BGLGraph,boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self>(const VertexListGraph &,boost::graph_traits<G>::vertex_descriptor,const boost::bgl_named_params<boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self> &)' with [ Visitors=boost::predecessor_recorder<std::allocator<std::_Vbase>::value_type *__w64 ,boost::on_tree_edge>, T=IndexMap, Tag=boost::vertex_index_t, Base=boost::no_property, VertexListGraph=de::audi::scenetree::BGLGraph, G=de::audi::scenetree::BGLGraph ] ----------------------------------------------------------------------------------------------------------- Does anybody know what this means? greetz, Manuel -- Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer

3 2

Building sandbox library (chrono)
by Niklas Angare 18 Nov '08

18 Nov '08

I can't figure out how to build chrono. Here's what I did: svn co http://svn.boost.org/svn/boost/trunk boost svn co -N http://svn.boost.org/svn/boost/sandbox boost-sandbox svn co http://svn.boost.org/svn/boost/sandbox/chrono boost-sandbox/chrono cd boost ./configure cd ../boost-sandbox/chrono/libs/chrono/test ../../../../../boost/tools/jam/src/bin.qnxntox86/bjam I get: error: Could not find parent for project at '../../../..' error: Did not find Jamfile.jam or Jamroot.jam in any parent directory. I have no clue how to create a Jamroot.jam if that's what I need to do. -- Regards Niklas Angare

1 0

vsprints in boost
by Simon Pickles 18 Nov '08

18 Nov '08

A simple question... Does boost offer a version of vsprintf? Simon

2 2

Re: [Boost-users] Speed up bjam
by Simon Pickles 18 Nov '08

18 Nov '08

Is there a quicker alternative? Trouble is I've only just got to grips with jam files! ------------------------------------------------------------------------ Seconded. I once tried using bjam to build on an even slower machine, and never tried it again. > > ------------------------------------------------------------------------ > > Subject: > Speed up bjam > From: > Simon Pickles <sipickles(a)hotmail.com> > Date: > Tue, 18 Nov 2008 13:35:03 +0000 > To: > boost-users(a)lists.boost.org > > To: > boost-users(a)lists.boost.org > > > Hi, > > Is there any way to make bjam only scan files for changes in the > current working directory, rather than the whole boost installation? I > hoped this would speed up the bjam build process. Everytime I do a > build I get, for example: > > ...patience... > ...patience... > ...found 2982 targets... > ...updating 6 targets... > > Wouldn't be quicker if it wasn't checking 3000 files each build? its a > very slow machine you see! 900 MHZ! > > Thanks > > Simon >

2 1

[Boost Graph Library] Example fails with dynamic allocated array?
by r89 18 Nov '08

18 Nov '08

Hi all, The following code is from http://www.boost.org/doc/libs/1_37_0/libs/graph/example/dijkstra-example.cpp and it works fine on my computer. However, if I change int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1, 1 }; to int *weights = new int[9]; and, similarly, change the edge_array to Edge *edge_array = new Edge[9]; (followed by assigning the weights and edges of course), then the results are different than the original code. Can anyone see why they are different? The reason I need to dynamically allocate, is because I don't know the number of nodes and edges at compile time. Please provide suggestions, thanks a lot! (Code below comes from http://www.boost.org/doc/libs/1_37_0/libs/graph/example/dijkstra-example.cpp) typedef adjacency_list < listS, vecS, directedS, no_property, property < edge_weight_t, int > > graph_t; typedef graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef graph_traits < graph_t >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Edge; const int num_nodes = 5; enum nodes { A, B, C, D, E }; char name[] = "ABCDE"; Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), Edge(C, B), Edge(C, D), Edge(D, E), Edge(E, A), Edge(E, B) }; int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1, 1 }; int num_arcs = sizeof(edge_array) / sizeof(Edge); graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); std::vector<vertex_descriptor> p(num_vertices(g)); std::vector<int> d(num_vertices(g)); vertex_descriptor s = vertex(A, g); dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0])); -- View this message in context: http://www.nabble.com/-Boost-Graph-Library--Example-fails-with-dynamic-allo… Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

Up-casting shared_ptr
by david.weber＠l-3com.com 18 Nov '08

18 Nov '08

We're using smart pointers, and due to the way that they are created, we wish to hide the functionality behind a static create() function for each class. That way, the callers only need call create() and they have a smart_pointer to a new object, without having to worry too much about implementation details. So, this has been working fine, until I tried doing some polymorphism. Basically, we have a smart pointer to a base class, where the derived class is chosen at run time, (based on what the caller wants to do). The base class is pure virtual, so we don't know, (or care to know) how the child class implements its functionality. The following code illustrates what I'm trying to do: #include <iostream> #include <boost/shared_ptr.hpp> // Base class class base { public: typedef boost::shared_ptr<base> SharedPtr; ~base(){}; virtual void foo(){ std::cout << "base" << std::endl;}; static SharedPtr create(){ return SharedPtr(new base); }; protected: base(){}; }; // Derived class class d1 : base { public: typedef boost::shared_ptr<d1> SharedPtr; ~d1(){}; void foo() {std::cout << "derived 1" << std::endl;}; static SharedPtr create() { return SharedPtr(new d1); }; protected: d1(){}; }; int main() { base::SharedPtr bsp; d1::SharedPtr d1sp = d1::create(); d1sp->foo(); // This is producing the error. I want to upcast my d1::SharedPtr to a // base::SharedPtr, so that it can be stored, and the reference count // is still intact bsp = boost::static_pointer_cast<base>(d1sp); } And here is the error that I'm getting (from Visual Studio 2003) c:\Program Files\boost\boost_1_35_0\boost\shared_ptr.hpp(222) : error C2243: 'static_cast' : conversion from 'd1 *const' to 'boost::shared_ptr<T>::element_type * with [T=base]' exists, but is inaccessible; c:\Program Files\boost\boost_1_35_0\boost\shared_ptr.hpp(513) : see reference to function template instantiation 'boost::shared_ptr<T>::shared_ptr<d1>(const boost::shared_ptr<d1> &,boost::detail::static_cast_tag) with [T=base]' being compiled; c:\Documents and Settings\td26134\Desktop\trunk1\main.cpp(54) : see reference to function template instantiation 'boost::shared_ptr<T> boost::static_pointer_cast<base,d1>(const boost::shared_ptr<d1> &) with [T=base]' being compiled Thanks.. --dw

2 2

[spirit2] Trivial parser crashes
by sm4 18 Nov '08

18 Nov '08

Hello, Playing with spirit-2 (boost 1.36 release) I got the following code to ASSERT when compiled on Visual Studio 2008/SP1. Any ideas what's wrong? ---------------------------------------------------------- #include #include #include #include #include #include #include #include #include using namespace boost::spirit; using namespace boost::spirit::qi; using namespace boost::spirit::ascii; using namespace boost::spirit::arg_names; namespace phoenix = boost::phoenix; using phoenix::at_c; struct key_val { std::string key; std::string value; }; BOOST_FUSION_ADAPT_STRUCT( key_val, (std::string, key) (std::string, value) ) template struct my_grammar : grammar { my_grammar() : my_grammar::base_type(start) { quoted_string %= lexeme['"' >> +(char_ - '"') >> '"']; key %= quoted_string; value %= quoted_string; start = key [at_c<0>(_val) = _1] >> ':' >> value [at_c<1>(_val) = _1] ; } rule key; rule quoted_string; rule value; rule start; }; int main() { typedef std::string::const_iterator citerator; std::string str = "\"x\": \"25\" "; citerator iter = str.begin(); citerator end = str.end(); my_grammar my_parser; key_val kv; phrase_parse(iter, end, my_parser, kv, space); // ASSERTs return 0; } -------------------------------------------------------------------------- thanks -- View this message in context: http://www.nabble.com/-spirit2--Trivial-parser-crashes-tp19624910p19624910.… Sent from the Boost - Users mailing list archive at Nabble.com.

5 9

rint, the interval library and Visual Studio 2008
by Stephan Puchegger 18 Nov '08

18 Nov '08

Dear group members! I am currently using the interval library and the following linker errors pop up: error LNK2028: unresolved token (0A000596) "extern "C" double __cdecl rint(double)" (?rint@@$$J0YANN@Z) referenced in function "public: static double __cdecl boost::numeric::interval_lib::detail::x86_rounding::to_int(double const &)" (?to_int@x86_rounding@detail@interval_lib@numeric@boost@@$$FSANABN@Z) Internal.obj Docs.Evaluation error LNK2019: unresolved external symbol "extern "C" double __cdecl rint(double)" (?rint@@$$J0YANN@Z) referenced in function "public: static double __cdecl boost::numeric::interval_lib::detail::x86_rounding::to_int(double const &)" (?to_int@x86_rounding@detail@interval_lib@numeric@boost@@$$FSANABN@Z) Internal.obj Docs.Evaluation rint does not show up in the MSDN documentation. This seems to be another example of Microsofts C99 compliance problems if I am not mistaken. I found a bug in the bug-database (#446: Bugs: MSVC support (closed: Wont Fix)) but when I try to view the bugreport all I get is a "Trac detected an internal error: TypeError: a float is required". Guillaume Melquiond seems to have posted a workaround in https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1246358&group_… but I cannot view this either, because this artifact is private and can be viewed only be groupmembers of a certain group (no idea which one). Would it not be a solution to simply add an rint implementation to the interval library? Best regards Stephan -- Stephan Puchegger Dynamics of Condensed Systems Faculty of Physics University of Vienna Strudlhofgasse 4, A-1090 Vienna Tel: ++43 (0) 1 4277 51352 Email: stephan.puchegger(a)univie.ac.at

2 1

Re: [Boost-users] Problem compiling with CodeGear Borland 2007
by Philip Ogunbona 18 Nov '08

18 Nov '08

Thanks to David (siliconman) and Nicola Musatti. Your posts are very helpful in understanding and resolving the problem. bcbboost is a great site, well done Nicola. Regards, Philip Ogunbona

1 0

Speed up bjam
by Simon Pickles 18 Nov '08

18 Nov '08

Hi, Is there any way to make bjam only scan files for changes in the current working directory, rather than the whole boost installation? I hoped this would speed up the bjam build process. Everytime I do a build I get, for example: ...patience... ...patience... ...found 2982 targets... ...updating 6 targets... Wouldn't be quicker if it wasn't checking 3000 files each build? its a very slow machine you see! 900 MHZ! Thanks Simon -- Linux Counter: User# 424693 -- Linux Counter: User# 424693

2 1