April 2007 - Boost-users - lists.preview.boost.org

problem using boost::condition in Win32
by PJ Durai 13 Apr '07

13 Apr '07

Hello everyone, I am having problems using boost::condition in win32. I have two threads waiting on a condition. When I call condition::notify_all() from the main thread, I expected both threads to fall through and proceed simultaneously. But that is not what I am witnessing. They behave like I had called condition::notify_one() twice. One thread continues, does its thing (in this case a simple Sleep and a printf) comes back to wait. Only after that point the second thread continued from the condition. Is this expected ? What am I missing ? I can post the code if anyone wants to take a look. My setup: boost 1.33.1 Visual C++ 2005 Windows XP SP2 I have no other problems with building and running boost classes. (I think the 'barrier' works as expected..) appreciate your time. thanks pj

1 0

Re: [Boost-users] BGL: need help with connected_components and boost::setS
by Maarten Nieber 13 Apr '07

13 Apr '07

Hi Terry, Thanks for the suggestion, but the boost::get statement seems to work fine. The error occurs in the call to connected_components on the last line. The compiler output is m:\Code\Replace_NewWaveProp\Boost\boost\property_map.hpp(349) : error C2678: binary '+' : no operator found which takes a left-hand operand of type 'const std::vector<_Ty>::iterator' (or there is no acceptable conversion) with [ _Ty=boost::default_color_type ] m:\Code\Replace_NewWaveProp\Boost\boost\property_map.hpp(349) : while compiling class-template member function 'boost::default_color_type boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>::operator [](boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>::key_type) const' with [ RandomAccessIterator=std::vector<boost::default_color_type>::iterator, IndexMap=boost::detail::choose_pmap_helper<boost::property_value<boost::bgl_named_params<boost::detail::components_recorder<ComponentPropertyMap>,boost::graph_visitor_t,boost::no_property>,boost::vertex_index_t>::type,Graph,boost::vertex_index_t>::const_result_type, T=boost::default_color_type, R=boost::default_color_type & ] m:\Code\Replace_NewWaveProp\Boost\boost\graph\depth_first_search.hpp(250) : see reference to class template instantiation 'boost::iterator_property_map<RandomAccessIterator,IndexMap,T,R>' being compiled with [ RandomAccessIterator=std::vector<boost::default_color_type>::iterator, IndexMap=boost::detail::choose_pmap_helper<boost::property_value<boost::bgl_named_params<boost::detail::components_recorder<ComponentPropertyMap>,boost::graph_visitor_t,boost::no_property>,boost::vertex_index_t>::type,Graph,boost::vertex_index_t>::const_result_type, T=boost::default_color_type, R=boost::default_color_type & ] m:\Code\Replace_NewWaveProp\Boost\boost\graph\depth_first_search.hpp(332) : see reference to function template instantiation 'void boost::detail::dfs_dispatch<boost::detail::error_property_not_found>::apply<VertexListGraph,boost::detail::choose_param_helper<boost::detail::error_property_not_found>::result<Default>::type,boost::detail::choose_param_helper<Param>::result<boost::dfs_visitor<>>::type,boost::detail::components_recorder<ComponentsMap>,boost::graph_visitor_t,boost::no_property>(const VertexListGraph &,DFSVisitor,Vertex,const boost::bgl_named_params<T,T ag,Base> &,boost::detail::error_property_not_found)' being compiled with [ VertexListGraph=Graph, Default=std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::setS,boost::setS,boost::undirectedS,VertexComponentProperty>,boost::setS,boost::setS,boost::undirectedS,boost::detail::retag_property_list<boost::vertex_bundle_t,VertexComponentProperty>::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::no_property>::type,boost::no_property,boost::listS>::config::vertex_ptr >::value_type , Param=boost::property_value<boost::bgl_named_params<boost::detail::components_recorder<ComponentPropertyMap>,boost::graph_visitor_t,boost::no_property>,boost::graph_visitor_t>::type, ComponentsMap=ComponentPropertyMap, DFSVisitor=boost::detail::choose_param_helper<boost::property_value<boost::bgl_named_params<boost::detail::components_recorder<ComponentPropertyMap>,boost::graph_visitor_t,boost::no_property>,boost::graph_visitor_t>::type>::result<boost::dfs_visitor<>>::type, Vertex=boost::detail::choose_param_helper<boost::detail::error_property_not_found>::result<std::allocator<boost::detail::adj_list_gen<boost::adjacency_list<boost::setS,boost::setS,boost::undirectedS,VertexComponentProperty>,boost::setS,boost::setS,boost::undirectedS,boost::detail::retag_property_list<boost::vertex_bundle_t,VertexComponentProperty>::type,boost::detail::retag_property_list<boost::edge_bundle_t,boost::no_property>::type,boost::no_property,boost::listS>::config::vertex_ptr >::value_type >::type, T=boost::detail::components_recorder<ComponentPropertyMap>, Tag=boost::graph_visitor_t, Base=boost::no_property ] m:\Code\Replace_NewWaveProp\Boost\boost\graph\connected_components.hpp(93) : see reference to function template instantiation 'void boost::depth_first_search<Graph,boost::detail::components_recorder<ComponentsMap>,boost::graph_visitor_t,boost::no_property>(const VertexListGraph &,const boost::bgl_named_params<T,Tag,Base> &)' being compiled with [ Graph=Graph, ComponentsMap=ComponentPropertyMap, VertexListGraph=Graph, T=boost::detail::components_recorder<ComponentPropertyMap>, Tag=boost::graph_visitor_t, Base=boost::no_property ] TestBoost.cpp(29) : see reference to function template instantiation 'boost::property_traits<PA>::value_type boost::connected_components<Graph,ComponentPropertyMap>(const Graph &,ComponentMap)' being compiled with [ PA=ComponentPropertyMap, Graph=Graph, ComponentMap=ComponentPropertyMap ] ----- Original Message ---- From: Stephen Torri <storri(a)torri.org> To: boost-users(a)lists.boost.org Sent: Friday, April 13, 2007 2:41:44 PM Subject: Re: [Boost-users] BGL: need help with connected_components and boost::setS On Fri, 2007-04-13 at 04:50 -0700, Maarten Nieber wrote: > Graph g; > ComponentPropertyMap vertexToComponent = boost::get(component_t(), > g); > > // THIS LINE DOES NOT COMPILE. No problem if boost::vecS is used > instead of boost::setS in the Graph typedef! > connected_components(g, vertexToComponent); > } I believe you do not want the () after the word component_t. In my examples I do not have boost::property_map<Graph_Base::Graph_t, boost::vertex_name_t>::type clist = boost::get(boost::vertex_name, m_graph); I think you want the line to read: Graph g; ComponentPropertyMap vertexToComponent = boost::get(component_t, g); Stephen _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

Boost/gccxml bug fix
by boost_list＠atl-intl.com 13 Apr '07

13 Apr '07

To avoid a compilation error under GCCXML running on WIndows, the following changes were made to a local copy: >Index: and.hpp >=================================================================== >RCS file: C:\CVS/boost/boost/mpl/and.hpp,v >retrieving revision 1.1 >diff -d -u -r1.1 and.hpp >--- and.hpp 12 Apr 2007 14:55:22 -0000 1.1 >+++ and.hpp 12 Apr 2007 15:01:06 -0000 >@@ -29,19 +29,23 @@ > // has to be checked in a separate condition, otherwise GCC complains > // about 'and' being an alternative token > #if defined(_MSC_VER) >+#ifndef __GCCXML__ > #if defined(and) > # pragma push_macro("and") > # undef and > # define and(x) > #endif > #endif >+#endif > > # define BOOST_MPL_PREPROCESSED_HEADER and.hpp > # include <boost/mpl/aux_/include_preprocessed.hpp> > > #if defined(_MSC_VER) >+#ifndef __GCCXML__ > #if defined(and) > # pragma pop_macro("and") >+#endif > #endif > #endif > >Index: or.hpp >=================================================================== >RCS file: C:\CVS/boost/boost/mpl/or.hpp,v >retrieving revision 1.1 >diff -d -u -r1.1 or.hpp >--- or.hpp 12 Apr 2007 14:55:22 -0000 1.1 >+++ or.hpp 12 Apr 2007 15:00:27 -0000 >@@ -30,19 +30,23 @@ > // has to be checked in a separate condition, otherwise GCC complains > // about 'or' being an alternative token > #if defined(_MSC_VER) >+#ifndef __GCCXML__ > #if defined(or) > # pragma push_macro("or") > # undef or > # define or(x) > #endif > #endif >+#endif > > # define BOOST_MPL_PREPROCESSED_HEADER or.hpp > # include <boost/mpl/aux_/include_preprocessed.hpp> > > #if defined(_MSC_VER) >+#ifndef __GCCXML__ > #if defined(or) > # pragma pop_macro("or") >+#endif > #endif > #endif

1 0

shared_ptr sharing the same ref count
by Loïc Joly 13 Apr '07

13 Apr '07

Hello, I have the following classes: class Owned; class Owner { unknownType getOwned(int i); vector<Owned> owned; }; Owner will be handled in the client code by shared_ptr. At some places, the client code will only know one owned object, obtained through getOwned, therefore, the owned object should contain a shared_ptr to its owner, to make it survive. Now, my question is: What should be unknownType? If I make unknownType a classic shared_ptr<Owned>, I have a circular reference. What I would like would be a way to have a kind of shared_ptr<Owned> that would use the ref count of the owner. Is this possible to do? The alternative I currently envision are: - Use intrusive ref count in Owner and make Owned shared_ptr use the same ref count, using something similar to the technique described in "Using a shared_ptr to hold a pointer to an object with an embedded reference count" - Make unknownType a class that contain a shared_ptr<Owner> and a Owned*, and forward all its functions to Owned. What do you think of them ? Thank you, -- Loïc

3 3

[boost][math toolkit] Formal Review today, April 11, through April 20
by Matthias Schabel 13 Apr '07

13 Apr '07

The formal review of the Math Toolkit, submitted by John Maddock, Paul Bristow, Hubert Holin, and Xiaogang Zhang, begins today, April 11 and ends April 20. The library and documentation may be downloaded from the Boost Vault: http://www.boost-consulting.org/vault/index.php? &direction=0&order=&directory=Math%20-%20Numerics The Math Toolkit is divided into three interrelated components : 1) a reasonably comprehensive set of statistical distributions 2) a set of high quality special functions 3) tools needed to implement special functions Because this library subsumes a wide range of material, I anticipate that not all reviewers will feel comfortable reviewing the entirety of the library. In order to expand the potential reviewer and increase overall participation, partial reviews of one or more of the three components described above are encouraged. As this is a primarily numerical library, quality of implementation, both correctness and efficiency, is critical. The authors have provided an extensive set of tests, but, as always, more eyes catch more bugs. Attention paid to these areas by reviewers is particularly welcome. Your comments may be brief or lengthy, as long as they provide sufficient basis for the Review Manager to assess your evaluation of the library. Relevant areas include interface/design, implementation, relevance to Boost, etc... If you identify problems along the way, please note if they are minor, serious, or showstoppers. Here are some questions you might want to answer in your review: • What is your evaluation of the design? • What is your evaluation of the implementation? • What is your evaluation of the documentation? • What is your evaluation of the potential usefulness of the library? • Did you try to use the library? With what compiler? Did you have any problems? • How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? • Are you knowledgeable about the problem domain? And finally, every review should answer this question: • Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Review comments can be sent to the developer list, the user list, or directly to me if you don't wish to comment publicly. Thank you in advance for your time and work on this review. Matthias Schabel Review Manager _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/ listinfo.cgi/boost

3 4

[Statechart] casting event type in unconsumed_event
by JD 12 Apr '07

12 Apr '07

Hi, Here some code: //snippet on template< class MostDerived > struct EventA : sc::event< MostDerived > { virtual std::string name() { return "unnamed event"; } }; struct EventB : public EventA< EventB > { std::string name() { return "EventB"; } }; struct MyMachine : sc::state_machine< MyMachine, Whatever > { void unconsumed_event( const sc::event_base & evt ) { // How can I display a message here with the event name? } }; //snippet off So the objective is to display the event name returned by the 'name' function when an event is unconsumed. I have tried some way like using dynamic_type and static_type but no luck... Any idea? Thank you. JD

2 4

[serialize] struct save_array_type in oserializer.hpp
by Oleg V. Zhylin 12 Apr '07

12 Apr '07

Hi, Is there a reason to use type int in the code at line 487 in oserializer.hpp? int count = sizeof(t) / ( static_cast<const char *>(static_cast<const void *>(&t[1])) - static_cast<const char *>(static_cast<const void *>(&t[0])) C++ standard draft states in section 5.3.3 [expr.sizeof] The result is a constant of an implementation-defined type which is the same type as that which is named size_t in the standard header <cstddef>(18.1). WBR Oleg V. Zhylin ovz(a)yahoo.com ____________________________________________________________________________________ 8:00? 8:25? 8:40? Find a flick in no time with the Yahoo! Search movie showtime shortcut. http://tools.search.yahoo.com/shortcuts/#news

3 5

serialization of std::map
by David Kantowitz 12 Apr '07

12 Apr '07

I'm having a bit of trouble using boost.serialization with a std::map. It seems like there is something simple I'm not doing correctly. I'm hoping someone can point me in the right direction. Thanks, David K. I'm using VS2005. Here is my test code: #include <map> #include <fstream> #include "boost/serialization/map.hpp" #include "boost/archive/xml_oarchive.hpp" std::map<int, int> map1; int main(int argc, char**argv) { map1[1] = 100; std::ofstream os("out.xml"); boost::archive::xml_oarchive oa(os); oa << BOOST_SERIALIZATION_NVP(map1); } This is the error: ...boost-win32-1_33_1\include\boost\archive\detail\oserializer.hpp(131) : error C2027: use of undefined type 'boost::serialization::extended_type_info_null<T>' with [ T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\detail\oserializer.hpp(128) : while compiling class template member function 'bool boost::archive::detail::oserializer<Archive,T>::is_polymorphic(void) const' with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\detail\oserializer.hpp(264) : see reference to class template instantiation 'boost::archive::detail::oserializer<Archive,T>' being compiled with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\detail\oserializer.hpp(263) : while compiling class template member function 'void boost::archive::detail::save_non_pointer_type<Archive,T>::save_standard::invoke(Archive &,const T &)' with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\detail\oserializer.hpp(322) : see reference to class template instantiation 'boost::archive::detail::save_non_pointer_type<Archive,T>::save_standard' being compiled with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\detail\oserializer.hpp(310) : while compiling class template member function 'void boost::archive::detail::save_non_pointer_type<Archive,T>::invoke(Archive &,const T &)' with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\detail\oserializer.hpp(536) : see reference to class template instantiation 'boost::archive::detail::save_non_pointer_type<Archive,T>' being compiled with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\basic_xml_oarchive.hpp(99) : see reference to function template instantiation 'void boost::archive::save<Archive,T>(Archive &,const T &)' being compiled with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ] ...boost-win32-1_33_1\include\boost\archive\detail\interface_oarchive.hpp(78) : see reference to function template instantiation 'void boost::archive::basic_xml_oarchive<Archive>::save_override<std::map<_Kty,_Ty>>(const boost::serialization::nvp<T> &,int)' being compiled with [ Archive=boost::archive::xml_oarchive, _Kty=int, _Ty=int, T=std::map<int,int> ] ...\source1.cpp(14) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_oarchive<Archive>::operator <<<const boost::serialization::nvp<T>>(const boost::serialization::nvp<T> &)' being compiled with [ Archive=boost::archive::xml_oarchive, T=std::map<int,int> ]

3 3

subgraph isomorphism
by KLINIK Markus SDI2-G (AREVA NP GmbH) 12 Apr '07

12 Apr '07

> From: "Jaonary Rabarisoa" <jaonary(a)gmail.com> > > Hi all, > I'm relatively new with BGL and I'm looking for a ready to use tools > to detect a subgraph isomorphism inside a graph. Hi, in my diploma thesis I used the GUB toolkit. http://www.iam.unibe.ch/~fki/ (From http://www.adinf.unisa.it/zope/home/mivia/databases/db_database/1 "Warning: the code is quite old and unmantained. It does not compile out of the box with a modern C++ environment.") -- yes ;) -- Markus KLINIK AREVA NP GmbH Diagnostics and Instrumentation SDI-G Freyeslebenstr. 1 91058 Erlangen Phone: +49 (0) 9131 18-93040 mail to: markus.klinik(a)areva.com Wichtiger Hinweis: Diese E-Mail kann Betriebs- oder Geschäftsgeheimnisse, bzw. sonstige vertrauliche Informationen enthalten. Sollten Sie diese E-Mail irrtümlich erhalten haben, ist Ihnen eine Kenntnisnahme des Inhalts, eine Vervielfältigung oder Weitergabe der E-Mail ausdrücklich untersagt. Bitte benachrichtigen Sie uns und vernichten Sie die empfangene E-Mail. Vielen Dank.

1 0

Where is vertex_name and vertex_index defined in the boost graph code?
by Stephen Torri 12 Apr '07

12 Apr '07

I have the following example that I am using as a test. It is to figure why my method of creating a directed graph fails to meet the boost requirement of a directed graph when using topological_sort. I cannot figure out why my fuller code compiles fine and this example does not. I am trying to be explicit and not use 'using namespace boost' for example. I want to declare its found in namespace x::y::z for example. Stephen ------------ #include <boost/graph/adjacency_list.hpp> #include <boost/shared_ptr.hpp> #include <boost/cstdint.hpp> #include <boost/format.hpp> #include <boost/graph/topological_sort.hpp> #include <iostream> #include <map> class Component; class Graph_Base { public: typedef boost::property< boost::vertex_index_t, boost::uint32_t, boost::property< boost::vertex_name_t, boost::shared_ptr<Component> > > VertexProperty_t; typedef boost::adjacency_list< boost::setS, // OutEdgeList boost::setS, // VertexList boost::directedS, // Directed VertexProperty_t > // VertexProperties Graph_t; }; class Component { public: typedef boost::shared_ptr<Component> ptr_t; Component ( boost::uint32_t id ) : m_id ( id ) {} ~Component () { m_source_list.clear(); } // Now part of Component_Data void set_Data_Source ( uint32_t id ) { if ( ! m_source_list.insert ( std::make_pair ( id, false ) ).second ) { std::cerr << "WARNING: Attempted to add a duplicate component id."; std::cerr << std::endl; std::cerr << "Ignoring component id." << std::endl; } } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_Begin() const { return m_source_list.begin(); } std::map<boost::uint32_t, bool>::const_iterator get_Source_List_End() const { return m_source_list.end(); } boost::uint32_t get_ID (void) const { return m_id; } private: boost::uint32_t m_id; std::map<boost::uint32_t, bool> m_source_list; }; class Component_Graph { public: typedef boost::graph_traits<Graph_Base::Graph_t>::vertex_descriptor Vertex_t; typedef boost::graph_traits<Graph_Base::Graph_t>::edge_descriptor Edge_t; typedef std::map<uint32_t, Vertex_t> IdVertexMap_t; Component_Graph () {} void add_Component ( Component::ptr_t obj_ptr ) { bool no_duplicate; IdVertexMap_t::iterator pos; Vertex_t node; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } boost::tie (pos, no_duplicate) = m_index.insert (std::make_pair(obj_ptr->get_ID(), node)); if ( no_duplicate ) { // Insertion was successful // Make a new vertex and return handle to 'node' node = add_vertex(m_graph); // Get list of Components boost::property_map<Graph_Base::Graph_t, boost::vertex_name_t>::type clist = boost::get(vertex_name, m_graph); // Assign component to vertex position clist[node] = obj_ptr; // Add vertex handle to map position pos->second = node; // Get list of indexes boost::property_map<Graph_Base::Graph_t, boost::vertex_index_t>::type ilist = get(vertex_index, m_graph); ilist[node] = obj_ptr->get_ID(); for ( std::map<boost::uint32_t,bool>::const_iterator cpos = obj_ptr->get_Source_List_Begin(); cpos != obj_ptr->get_Source_List_End(); ++cpos ) { this->add_Child ( (*cpos).first, obj_ptr ); } } else { std::cerr << "ERROR: Duplicate source found. Skipping Component" << std::endl; return; } } void add_Child ( uint32_t parent_id, Component::ptr_t obj_ptr ) { IdVertexMap_t::iterator pos; IdVertexMap_t::iterator cpos; if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; return; } pos = m_index.find (parent_id); cpos = m_index.find ( obj_ptr->get_ID() ); if (pos == m_index.end()) { std::cerr << "ERROR: Cannot find parent. Skipping adding component #" << obj_ptr->get_ID() << std::endl; return; } // Add edge from parent to child Edge_t link; if (! (add_edge ( pos->second, cpos->second, m_graph).second)) { std::cerr << "ERROR: Duplicate edge exists from " << parent_id << " to " << obj_ptr->get_ID() << std::endl; return; } } Graph_Base::Graph_t const& get_Graph () const { return m_graph; } private: Graph_Base::Graph_t m_graph; IdVertexMap_t m_index; }; int main (int, char**) { // CREATE Component_Graph Component_Graph m_graph; // Create Components Component::ptr_t node_one ( new Component ( 1 ) ); Component::ptr_t node_twenty ( new Component ( 20 ) ); node_twenty->set_Data_Source ( 1 ); Component::ptr_t node_thirty ( new Component ( 30 ) ); node_thirty->set_Data_Source ( 1 ); Component::ptr_t node_forty ( new Component ( 40 ) ); node_forty->set_Data_Source ( 1 ); Component::ptr_t node_five ( new Component ( 5 ) ); node_five->set_Data_Source ( 1 ); node_five->set_Data_Source ( 20 ); node_five->set_Data_Source ( 30 ); node_five->set_Data_Source ( 40 ); // Add Components to Graph m_graph.add_Component ( node_one ); m_graph.add_Component ( node_twenty ); m_graph.add_Component ( node_thirty ); m_graph.add_Component ( node_forty ); m_graph.add_Component ( node_five ); // Call topological_sort on graph typedef std::vector<Component_Graph::Vertex_t> m_container; m_container comp_list; boost::topological_sort ( m_graph.get_Graph(), std::back_inserter ( comp_list ) ); return 0; }

1 0