- Boost-users - lists.boost.org

[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

[bind] bind and back_inserter
by Christian Henning 11 Apr '07

11 Apr '07

I cannot figure out how to copy a vector to another vector and calling a member function. Please consider the following example. #include <string> #include <vector> #include <algorithm> #include <functional> #include <boost/bind.hpp> using namespace std; using namespace boost; class A { public: A( const string& name ) : _name( name ) {} const string& name() const { return _name; } private: string _name; }; int _tmain(int argc, _TCHAR* argv[]) { vector<A> as; as.push_back( A( "A" )); as.push_back( A( "B" )); vector<string> ss; // how to call A::name for each A???? copy( as.begin() , as.end() , back_inserter( ss )); return 0; } I'm sure it's very easy, but I don't see right now. Thanks, Christian

2 2

[Serialization] Template leaf class serialized by base class pointer => export
by Sohail Somani 11 Apr '07

11 Apr '07

Hi, Given class Base and template<typename T> class Child : public Base where Child will always be serialized by base class pointer (and thus require exporting): Is there a way to do BOOST_CLASS_EXPORT for all instantiations of Child? Thanks, Sohail

2 2

Boost::regex problems.
by Farraday 11 Apr '07

11 Apr '07

Hello. I'm trying to use the Boost regular expressions functions but it fails. I'm forced to write some programs in C++ at work - I usually work in java/python and I'm not up to date with C/C++ - and it was recommended I use the Boost libraries for various utilities. However, on linux, the regex functions don't work don't work for some reason. I reinstalled the latest version of the Boost libraries and everything seems fine (ie, I tried the graph container and it works great). I tried both on SuSe linux 10.2 and Ubuntu with gcc 4.1.2 and the latest Boost libs 1.33.1 but it fails at compile time. At first I thought I was doing something wrong, but then I tried both the examples provided in the Boost documentation and other examples/tutorials on Boost::regex on the net (ie ,the ones on OnLAMP of O'Reilly and others) and they fail too with the same error(s): "boost_regexp.o: In function `boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::assign(char const*, char const*, unsigned int)': /usr/include/boost/regex/v4/basic_regex.hpp:254: undefined reference to `boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign(char const*, char const*, unsigned int)'" the problem is when the assign method is called (either if i call the constructor with arguments or when I call the assign method of an boost::regex object). the problem is in the boost::regex code, more exactly in (***)/boost/regex/v4/basic_regex.hpp the code that produces this result is the same as shown in the Boost:regex documentation (http://www.boost.org/libs/regex/doc/partial_matches.html) Thanx.

2 1

Re: [Boost-users] [boost] [units] Review results
by Matthias Schabel 11 Apr '07

11 Apr '07

John, Thanks for running a smooth review, and for your comprehensive efforts at consolidating and organizing the many useful comments on the library. Naturally, we're delighted with the outcome, and will work over the next few months to address the many issues raised. Thanks also the the many reviewers and others who provided input - as John pointed out, the library has benefited greatly from your comments. Cheers, Matthias

1 0

[pool] Proper example of usage of pool allocator
by Seweryn Habdank-Wojewódzki 11 Apr '07

11 Apr '07

Hi! Can any one show me the proper example of usage of pool allocator. I have two examples (code below) and usage of pool consumes a lot of memory, and nothing is faster/better/etc. So what should be a design goal for using pool allocator? Kind regards. The code without allocator: #include <vector> #include <iostream> #include <algorithm> #include <iterator> namespace primes { template < typename T > void PrimesLE( T const Limit, std::vector<T> & result ) { using namespace std; typedef vector<T> cont_t; result.clear(); result.resize(static_cast<typename cont_t::size_type>(Limit/2+1)); result[0] = static_cast<T>(2); typename cont_t::iterator pos = result.begin(); T lim = 0; T sq = 4; T j = 1; for (T counter = 3; counter <= Limit; counter += 2 ) { if ( counter >= sq ) { ++lim; sq = result[lim] * result[lim]; } T f = 1; for ( ; f < lim; ++f ) { if ( counter % result[f] == 0 ) break; } if ( f >= lim ) { result[j++] = counter; } } return; } } int main() { using namespace std; typedef vector<int> Vi; Vi p; primes::PrimesLE(100000000,p); //Vi::const_iterator pos = p.begin(); //Vi::const_iterator const end = p.end(); //for ( ; pos != end && *pos > 0 ; ++pos ) { // cout << *pos << endl; //} cout << "Done" << endl; cin.get(); } The same code with allocator: #include <vector> #include <iostream> #include <algorithm> #include <iterator> #include <boost/pool/pool_alloc.hpp> namespace primes { template < typename T > void PrimesLE( T const Limit, std::vector<T,boost::fast_pool_allocator<T> > & result ) { using namespace std; typedef vector<T,boost::fast_pool_allocator<T> > cont_t; result.clear(); result.push_back(static_cast<T>(2)); T lim = 0; T sq = 4; for (T counter = 3; counter <= Limit; counter += 2 ) { if ( counter >= sq ) { ++lim; sq = result[lim] * result[lim]; } T f = 1; for ( ; f < lim; ++f ) { if ( counter % result[f] == 0 ) break; } if ( f >= lim ) { result.push_back( counter ); } } return; } } int main() { using namespace std; vector<int,boost::fast_pool_allocator<int> > p; int const limit = 100000000; primes::PrimesLE(limit,p); //for ( size_t i = 0; i < limit/2+1 && p[i] > 0 ; ++i ) { // cout << p[i] << endl; //} //boost::singleton_pool<boost::pool_allocator_tag,sizeof(int)>::release_memory(); cout << "Done" << endl; cin.get(); } -- |\/\/| Seweryn Habdank-Wojewódzki \/\/

2 3