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

Boost.Regex with QChar?
by Sebastian Pipping 13 Apr '07

13 Apr '07

It seems to me like Boost.Regex is much more powerful than QRegExp of QT. Can Boost.Regex work with QChar [1] as charT? The text "i.e. either char or wchar_t" on [2] made me unsure of this. Any limitations I should know about? Thanks for your help! Sebastian [1] http://doc.trolltech.com/4.3/qchar.html [2] http://www.boost.org/libs/regex/doc/basic_regex.html

1 0

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

[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

[python] jam file
by Seweryn Habdank-Wojewódzki 11 Apr '07

11 Apr '07

Hi! Can any one tell me in details how to prepare jam file for boost.python example, please. I have a test project in directory (on Gentoo linux) ~/Tests/ path to the boost-build is /usr/share/boost-build path to the boost includes is /usr/include/boost path to the boost libs is /usr/lib path to the python includes is /usr/include/python2.4 path to the python libs is /usr/lib/python2.4 Should I have original "boost directory tree"? I have prepared jam file, but still I have an error: Unable to load Boost.Build: could not find "boost-build.jam" Attempted search from /home/sevi/Workspace/Python/boost up to the root and in these directories from BOOST_BUILD_PATH and BOOST_ROOT: /usr/share/boost-build, /usr/share/boost-build/. ############################################### # my jam file ############################################### # This is the top of our own project tree BOOST_ROOT = /usr/include/boost/ ; BOOST_BUILD_PATH = /usr/share/boost-build/ ; #boost-build /usr/share/boost-build/v1 ; PYTHON_VERSION = 2.4 ; PYTHON_ROOT = /usr/lib/python2.4/ ; PYTHON_INCLUDES = /usr/include/python2.4/ ; PYTHON_LIB_PATH = /usr/lib/python2.4/ ; project-root . ; import python ; extension hello # Declare a Python extension called hello : hello.cpp # source # requirements and dependencies for Boost.Python extensions <template>@boost/libs/python/build/extension ; ALL_LOCATE_TARGET = . -- |\/\/| Seweryn Habdank-Wojewódzki \/\/ To reply remove "n0-5p4m-" from e-mail address.

1 0

boost and zlib on win
by Aljaz 11 Apr '07

11 Apr '07

Hello I've been trying to get boost compiled with zlib on windows. I have win xp, MSVC 2005. Boost is located in c:\cpp libraries\boost Zlib is located in c:\cpp libraries\zlib123 I have tried to build boost iostreams with running bjam from libs\iostreams\build as instructions say.. The command line I used: bjam toolset=msvc "-sZLIB_SOURCE=C:\cpp libraries\zlib123" when I do this it seems like nothing is properly built. The result I get says: ..failed updating 12 targets.. skipped 16 targets... I wonder what am I doing wrong? I want to build boost iostreams so that I can use them with bzip.. Thanks for help Regards

1 0

subgraph isomorphism
by Jaonary Rabarisoa 11 Apr '07

11 Apr '07

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. Precisely, given a template graph T and a test graph G, I'd like to detect all the subgraph of G that match exactly the template T. I found an implemation that seems to solve this problem here : http://www.mail-archive.com/boost@lists.boost.org/msg06380.html But, I'm not very familiar with the BGL interface and this code lacks of documentation. So, maybe there's someone that already use this code and can explain me more about the template parameters the this function need (esplecialy the EdgeLabeling template and the VertexLabeling template). Otherwise, is there any ready to use algorithme insind BGL that can do this. The implementation above exists since 2003 and may be it's now a part of BGL ??? Regards, Jaonary

1 0

[thread] Problems with TSS and static thread library
by Johan Nilsson 11 Apr '07

11 Apr '07

Hi, I've been trying to resolve a problem which seems to be related to TSS and the static build of the Boost.Thread library. I'm using MSVC 8.0 (no SP applied) under WinXP and Boost RC_1_34_0 (CVS) from last week. The problem only manifests itself on one machine and only for release builds. The machine in question is a XP SP2 Pro machine with dual processors. The same code works fine under a XP SP2 Pro SMP with 2 CPUs + HT enabled, and also under OpenSUSE 10.0 + gcc 4.0 (same hardware as the failing machine). What seems to be happening is that the thread_specific_ptr's cleanup method is called twice with a non-null pointer for the main thread of the application. Changing the application to use the DLL variant of the thread library cures the problem (or, at least the application no longer crashes with an access violation). The good news is that the problem is consistent - it always occurs for my test application. The bad news is that the environment is pretty complex, and I can't reproduce the problem with a simple test case. I figured I could attach some output from my test application together with source code excerpts (with tracing hacks added) and hope that somebody could give me a hint on what's actually going on. I added debug symbols and disabled optimization for the release build to try and get better call stack information, but the call stack still seems a bit messed up. Sorry for the longish output, but here goes: ------------------------- excerpt from Context.cpp ------------------------- #ifdef BOOST_MSVC __declspec(thread) static int all = 0, reals = 0; #endif // // STATIC DATA // Context::MapPtrT Context::g_pCtxMap(&Context::Cleanup); void Context::Cleanup(MapT* pCtxMap) { #ifdef BOOST_MSVC all++; DWORD thread = ::GetCurrentThreadId(); std::cout << std::hex << std::setw(8) << thread << ": Context::Cleanup(" << pCtxMap << "), all: " << all << ", reals: " << reals << std::endl; if (pCtxMap) { reals++; std::cout << "Clearing, reals: " << reals << std::endl; assert(reals == 1); pCtxMap->clear(); std::cout << "Deleting" << std::endl; delete pCtxMap; } #else delete pCtxMap; #endif } // // HELPERS // Context::MapT& Context::ContextMap() { if (!g_pCtxMap.get()) { g_pCtxMap.reset(new MapT); } return *(g_pCtxMap.get()); } -------------------- RELEASE BUILD OUTPUT -------------------- testing.unit-test C:\users\cc\builds\checkout\knmc\build\src\libs\oasis\oasistest\msvc-8.0\release\debug-symbols-on\optimization-off \threading-multi\oasistest.passed Running 402 test cases... 2b4: Context::Cleanup(00D22528), all: 1, reals: 0 Clearing, reals: 1 Deleting 7d8: Context::Cleanup(00000000), all: 1, reals: 0 754: Context::Cleanup(00000000), all: 1, reals: 0 bc: Context::Cleanup(00000000), all: 1, reals: 0 1b4: Context::Cleanup(00000000), all: 1, reals: 0 9c: Context::Cleanup(00000000), all: 1, reals: 0 5b8: Context::Cleanup(00000000), all: 1, reals: 0 530: Context::Cleanup(00000000), all: 1, reals: 0 39c: Context::Cleanup(00000000), all: 1, reals: 0 58c: Context::Cleanup(00000000), all: 1, reals: 0 6b8: Context::Cleanup(00000000), all: 1, reals: 0 318: Context::Cleanup(00000000), all: 1, reals: 0 *** No errors detected 134: Context::Cleanup(00D253F8), all: 1, reals: 0 Clearing, reals: 1 Deleting 134: Context::Cleanup(00D24658), all: 2, reals: 1 Clearing, reals: 2 ---------------- Error popup occurs here: ---------------- Unhandled exception at 0x0054ea2a in oasistest.exe: 0xC0000005: Access violation reading location 0x00000025. ------------------ Call stack when entering the debugger: ------------------ oasistest.exe!std::_Tree<std::_Tmap_traits<oasis::utility::detail::ContextKey,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > >,std::less<oasis::utility::detail::ContextKey>,std::allocator<std::pair<oasis::utility::detail::ContextKey const ,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > >,0> >::_Erase(std::_Tree_nod<std::_Tmap_traits<oasis::utility::detail::ContextKey,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > >,std::less<oasis::utility::detail::ContextKey>,std::allocator<std::pair<oasis::utility::detail::ContextKey const ,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > >,0> >::_Node * _Rootnode=0x00000000) Line 1073 + 0x11 bytes C++ > oasistest.exe!std::_Tree<std::_Tmap_traits<oasis::utility::detail::ContextKey,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > >,std::less<oasis::utility::detail::ContextKey>,std::allocator<std::pair<oasis::utility::detail::ContextKey > const > ,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > > >,0> > >::_Erase(std::_Tree_nod<std::_Tmap_traits<oasis::utility::detail::ContextKey,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > >,std::less<oasis::utility::detail::ContextKey>,std::allocator<std::pair<oasis::utility::detail::ContextKey > const > ,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > > >,0> >::_Node * _Rootnode=0x00d24df0) Line 1076 C++ oasistest.exe!std::_Tree<std::_Tmap_traits<oasis::utility::detail::ContextKey,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > >,std::less<oasis::utility::detail::ContextKey>,std::allocator<std::pair<oasis::utility::detail::ContextKey const ,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > >,0> >::clear() Line 955 C++ oasistest.exe!oasis::utility::Context::Cleanup(std::map<oasis::utility::detail::ContextKey,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > >,std::less<oasis::utility::detail::ContextKey>,std::allocator<std::pair<oasis::utility::detail::ContextKey const ,std::stack<boost::any,std::deque<boost::any,std::allocator<boost::any> > > > > > * pCtxMap=[0]()) Line 48 C++ oasistest.exe!boost::detail::function::void_function_invoker1<void (__cdecl*)(boost::shared_ptr<RCF::Session> *),void,boost::shared_ptr<RCF::Session> *>::invoke(boost::detail::function::function_buffer & function_ptr={...}, boost::shared_ptr<RCF::Session> * a0=0x00d24658) Line 114 + 0x7 bytes C++ oasistest.exe!boost::function1<void,boost::shared_ptr<RCF::Session> *,std::allocator<boost::function_base> >::operator()(boost::shared_ptr<RCF::Session> * a0=0x00d24658) Line 692 + 0x15 bytes C++ oasistest.exe!boost::detail::function::void_function_obj_invoker1<boost::detail::tss_adapter<boost::shared_ptr<rsdb::detail::IRsdbApi> >,void,void *>::invoke(boost::detail::function::function_buffer & function_obj_ptr={...}, void * a0=0x00d24658) Line 156 C++ oasistest.exe!boost::function1<void,void *,std::allocator<boost::function_base> >::operator()() + 0x4e bytes C++ oasistest.exe!boost::detail::tss::cleanup() + 0x78 bytes C++ oasistest.exe!boost::thread_specific_ptr<boost::shared_ptr<RCF::Session> >::~thread_specific_ptr<boost::shared_ptr<RCF::Session> >() Line 90 + 0x5e bytes C++ oasistest.exe!`dynamic atexit destructor for 'oasis::utility::Context::g_pCtxMap''() + 0xe bytes C++ msvcr80.dll!doexit(int code=0, int quick=0, int retcaller=0) Line 553 C msvcr80.dll!exit(int code=0) Line 398 + 0xd bytes C oasistest.exe!__tmainCRTStartup() Line 603 C kernel32.dll!7c816fd7() [Frames below may be incorrect and/or missing, no symbols loaded for kernel32.dll] kernel32.dll!7c816fd7() ------------------ DEBUG BUILD OUTPUT ------------------ testing.unit-test C:\users\cc\builds\checkout\knmc\build\src\libs\oa Running 402 test cases... 608: Context::Cleanup(0100E720), all: 1, reals: 0 Clearing, reals: 1 Deleting 1a8: Context::Cleanup(00000000), all: 1, reals: 0 600: Context::Cleanup(00000000), all: 1, reals: 0 128: Context::Cleanup(00000000), all: 1, reals: 0 31c: Context::Cleanup(00000000), all: 1, reals: 0 e4: Context::Cleanup(00000000), all: 1, reals: 0 7d0: Context::Cleanup(00000000), all: 1, reals: 0 168: Context::Cleanup(00000000), all: 1, reals: 0 f8: Context::Cleanup(00000000), all: 1, reals: 0 52c: Context::Cleanup(00000000), all: 1, reals: 0 1a0: Context::Cleanup(00000000), all: 1, reals: 0 784: Context::Cleanup(00000000), all: 1, reals: 0 *** No errors detected 6bc: Context::Cleanup(00FE3838), all: 1, reals: 0 Clearing, reals: 1 Deleting ...updated 5 targets... ----------------------------------- / Johan

2 3

Regex - hyperlink match/submatch problem
by Jeff 11 Apr '07

11 Apr '07

Dear forum members: I’m hoping that someone can copy and compile the code below and tell me what is wrong with my expression. I am trying to write a pattern that produces the following match and submatch: MATCH: <a href="http://test1.com">TEST #1</a> SUBMATCH: http://test1.com // main.cpp #include <boost/regex.hpp> #include <iostream> using namespace std; using namespace boost; int main() { // here is the data, please note the minor ‘href=’ differences. string sText = "<a href=\"http://test1.com\">TEST #1</a>" "<a href =\"http://test2.com\">TEST #2</a>" "<a href= \"http://test3.com\">TEST #3</a>" "<a href = \"http://test4.com\">TEST #4</a>" "<a href=\"http://test5.com\">TEST #5</a>"; // the following 4 patterns were my bet attempts char exp[] = "<a href(.*?)</a>"; "<a href\s*=\s*\"(.*?)\""; "<a href=(.*?)</a>"; "<a href\s*=\s*\"(.*?)</a>" int subs[] = {0,1}; regex e(exp, regex::normal | regbase::icase); sregex_token_iterator i(sText.begin(), sText.end(), e, subs); sregex_token_iterator j; while(i != j) { cout << "*******************************" << endl; cout << *i++ << endl; cout << *i++ << endl; } return 0; }

3 2

Re: [Boost-users] What is this HEAD everybody is talking about?
by shams 10 Apr '07

10 Apr '07

Here we go and daily snapshots are available at: http://www.boost-consulting.org/boost/ and see "Snapshots" (this page will be updated on boost.org I believe when 1.34 is released) Or go directly to: http://engineering.meta-comm.com/boost.aspx and see "main truck" Thanks Shams

1 0

Re: [Boost-users] What is this HEAD everybody is talking about?
by Pfligersdorffer, Christian 10 Apr '07

10 Apr '07

Robert Ramey wrote: > have been made in an attempt to accomodate it. The lastest version > of these changes have been checked into the HEAD. You might look at Hey folks, where or what is this ominous HEAD Robert is talking about? I know about the releases versions via boost.org and the developer version via CVS but no more. Please enlighten me! I tried to check it out of my head which surprisingly didn't work ;) Christian Pfligersdorffer Software Engineering EOS GmbH

2 1

Regex - how to match everything beginning at '<a href=' and ending at '</a>'
by Jeff 10 Apr '07

10 Apr '07

I am new to regex and see how to match the URL string using the expression below: Expression: <a href[^<]*</a> To match: <a href="http://art.com">Art Page</a> Unfortunately, the URL strings vary and I am basically wanting to get everything beginning at '<a href=' and ending at '</a>'. Doing so, would allow me to get URL strings like the one above as well as: <a href="http://art.com" target="_blank">Art Page<br>And More</a> or <a href="http://art.com/"><img src="http://art.com/flower.jpg" alt="Art"></a>

3 4

Adding debugging statements during boost graph construction eliminates breadth_first_search missing vertices
by Stephen Torri 10 Apr '07

10 Apr '07

Symptom: Breadth first graph visitor misses visiting vertexes when debugging statements removed during graph construction. OS: Fedora Core Linux BOOST: 1.33.1-11.fc6 GCC: 4.1.1-51.fc6 Problem: I am suspecting that there is a timing issue or something else that I am missing that causes the boost breath first visitor to miss two nodes in a graph. The reason why U suspect something is that when I add three debugging statements to determine what is happening with graph construction that the visitor is able to visit all vertexes. The following commented out lines are the ones that I add. void Component_Graph::add_Component ( Component::ptr_t obj_ptr ) { bool no_duplicate; IdVertexMap_t::iterator pos; Vertex_t node; /* std::cout << boost::format("Component_Graph::add_Component for id %d") % obj_ptr->get_ID() << std::endl; */ if ( obj_ptr.get() == 0 ) { std::cerr << boost::format("Exception throw in %s at line %d") % __FILE__ % __LINE__ << std::endl; throw errors::Component_Exception ( errors::Component_Exception::NULL_POINTER ); } boost::tie (pos, no_duplicate) = m_index.insert (std::make_pair(obj_ptr->get_ID(), node)); if ( no_duplicate ) { /* std::cout << boost::format("Component_Graph::add_Component - no duplicate with id = %d") % obj_ptr->get_ID() << std::endl; */ // 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, vertex_name_t>::type clist = 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, vertex_index_t>::type ilist = get(vertex_index, m_graph); ilist[node] = obj_ptr->get_ID(); // Grab list of parent ids std::list<boost::uint32_t> source_list = obj_ptr->get_Source_List (); for ( std::list<boost::uint32_t>::const_iterator cpos = source_list.begin(); cpos != source_list.end(); ++cpos ) { /* std::cout << boost::format("Component_Graph::add_Component parent(id=%d) for child(id=%d)") % (*cpos) % obj_ptr->get_ID() << std::endl; */ // Call add_child. This adds a edge from the parent Component to the child Component this->add_Child ( (*cpos), obj_ptr ); } } else { std::cerr << "ERROR: Duplicate source found. Skipping Component" << std::endl; return; } } The graph is a simple adjacency list that I keep in a class called Component_Graph. When it comes time to visit the boost graph is returned from the Component_Graph. Here is my definition: typedef property< vertex_index_t, uint32_t, property< vertex_name_t, boost::shared_ptr<Component> > > VertexProperty_t; typedef adjacency_list<setS, // OutEdgeList setS, // VertexList directedS, // Directed VertexProperty_t> // VertexProperties Graph_t; As you can see a standard adjacency list graph with a component as the property. The graph visitor going to each vertex is inherited from the default breadth first search visitor. Each Component performs its task via 'run()' and the results are collected for storage in the Data_Map_t for use by children Component. Order of operation is important. All parents to a Component must be executed before a child works. This was the reason why I choose a breadth first search visitor. class Graph_Visitor : public boost::default_bfs_visitor { public: // Constructor explicit Graph_Visitor ( infrastructure::Component_Graph const& graph_ref, infrastructure::Graph_Base::Data_Map_t* dmap ); // Visitor functions template <class Vertex, class Graph> void discover_vertex(Vertex v, Graph const& g) { boost::shared_ptr<infrastructure::Component> src_obj_ptr = m_graph_ref.get_Component(v); std::cout << "Visiting node: " << src_obj_ptr->get_ID() << std::endl; // This will execute the Component to perform its task src_obj_ptr->run ( m_data_map ); typename Graph::degree_size_type num_children = out_degree (v, g); // Print out the id of the vertex being visited std::cout << boost::format(" Node(%d) - children: %d") % src_obj_ptr->get_ID() % num_children << std::endl; // Save results for children Components infrastructure::Graph_Base::Result_Data_t result_data = std::make_pair ( src_obj_ptr->results(), num_children ); m_data_map->insert ( std::make_pair ( src_obj_ptr->get_ID(), result_data ) ); typename Graph::out_edge_iterator pos; typename Graph::out_edge_iterator end; typename Graph::vertex_descriptor node; boost::shared_ptr<infrastructure::Component> target_obj_ptr; // Notify children Components that the parent Component data is available for ( boost::tie(pos,end) = out_edges(v, g); pos != end; ++pos ) { node = target (*pos, g); target_obj_ptr = m_graph_ref.get_Component ( node ); target_obj_ptr->received_Input_Source_Data ( src_obj_ptr->get_ID() ); } } private: infrastructure::Component_Graph const& m_graph_ref; infrastructure::Graph_Base::Data_Map_t* m_data_map; }; So a resulting graph, which I output via a separate visitor, shows one arrange of components as it should be and how the vertexes are being visited at present ----------------------------- EXPECTED ----------------------------- digraph analysis { 1 [label="File_Type_Detector(1)"]; // Visitor starts here 1 -> 20; // All children components are initialized with Component #1 data 1 -> 30; 1 -> 40; 1 -> 5; 20 [label="Arch_Type_Detector(20)"]; // Component #20 executes 20 -> 5; // Component #5 initialized with Component #20 data 30 [label="Data_Section_Detector(30)"]; // Component #30 executes 30 -> 5; // Component #5 initialized with Component #30 data 40 [label="Code_Section_Detector(40)"]; // Component #40 executes 40 -> 5; // Component #5 initialized with Component #40 data 5 [label="Meta_Writer(5)"]; // Component #5 executes } ----------------------------- PRESENT RESULTS ----------------------------- digraph analysis { 1 [label="File_Type_Detector(1)"]; // Visitor starts here 1 -> 20; // All children components are initialized with Component #1 data 1 -> 30; 1 -> 40; 1 -> 5; 20 [label="Arch_Type_Detector(20)"]; // Component #20 executes 20 -> 5; // Component #5 initialized with Component #20 data 5 [label="Meta_Writer(5)"]; // Component #5 fails to execute. Missing data from Component #30 and #40 } STEPS TAKEN: 1. I went through the code and reviewed its design a. Redesign Component so its a pure virtual class b. Added new classes to add the old functionality via composition 2. Added the debug print statements to see what was happening with the visitors. NOTE: This is where I noticed that it work with them but fails without them. 3. Checked to see if making the copy constructors for the objects that compose the Component functionality as 'explicit' was the problem. They were not. Are there any reasons which would make a breadth first search visitor skip visiting a vertex? Stephen

1 0

boost.function and boost:bind in MSVS2005
by HeavyWave 10 Apr '07

10 Apr '07

Hi there. I'm using boost.function and boost:bind to point to Member function this way: class ModuleRegister { public: ModuleRegister(void); ~ModuleRegister(void); typedef boost::function1< std::string, std::map<std::string,std::string> > HEFunc; void RegisterClassMember(std::string & name, const HEFunc & f); }; class News : public BaseModule { public: News(void); ~News(void); std::string show(std::map<std::string,std::string> bb); }; than in other class void IParser::PrepareModules() { ModuleRegister::HEFunc f; f = boost::bind(&News::show, &NewsObj, _1); MRegister.RegisterClassMember(std::string("News.show"),f); } and I get 1>IParser.obj : error LNK2005: "union boost::detail::function::any_pointer __cdecl boost::detail::function::make_any_pointer(void *)" (?make_any_pointer@function@detail@boost@@YA?ATany_pointer@123@PAX@Z) already defined in Main.obj 1>IParser.obj : error LNK2005: "bool __cdecl boost::detail::function::has_empty_target(...)" (?has_empty_target@function@detail@boost@@YA_NZZ) already defined in Main.obj IParser.h is actually included in Main.h and #include "boost/function.hpp" is in ModuleRegister.h which is included in IParser.h can't handle this problem

1 0

[filesystem] basename() removes suffix?
by Chris Fairles 10 Apr '07

10 Apr '07

In boost, the default behavior is to remove not only all text before the last "/", but to remove all text after the first "." from the end (i.e. the file extension or suffix). In GNU and POSIX, the suffix is not removed. In PHP and Bash, the suffix is removed only if specified as an optional 2nd parameter. Whats the rationale for boost having different behavior than the above implementations? It causes a bit of a compatibility/portability issue if someone using GNU/POSIX replaces all basename functions with boost's. Chris

1 0

[Format] Errors resulting from optional.hpp
by Ferng, Andrew D 10 Apr '07

10 Apr '07

Hi all, Got a problem with using the format lib and I've no idea how to fix or get around this. I'm on an AIX using xlC ver 6. My other code using BGL compiled and ran fine so I'm assuming my library is built correctly. When I tried to compile using xlC, I get the errors listed below. The strange thing is that the same code does not generate errors in VS2005 or if I use g++ 4.11 on AIX. As indicated from the error below, line 389 in optional.hpp is: void destroy_impl ( is_not_reference_tag ) { get_ptr_impl()->T::~T() ; m_initialized = false ; } What is this optional.hpp? From the name, it sounds like it's not required? Are there certain compiler options that boost requires? I have to use xlC because of compatibility issues so I've got to figure this out. Any help would be appreciated! Thanks! Error below: --------------------------------------------------------------------- IDTApplication.cpp: "/a/Boost/include/boost/optional/optional.hpp", line 389.66: 1540-0210 (S) "T" is not a base class of "locale". "/a/Boost/include/boost/optional/optional.hpp", line 389.10: 1540-0700 (I) The previous message was produced while processing "boost::optional_detail::optional_base<std::locale>::destroy_impl(is_not _reference_tag)". "/a/Boost/include/boost/optional/optional.hpp", line 362.9: 1540-0700 (I) The previous message was produced while processing "boost::optional_detail::optional_base<std::locale>::destroy()". "/a/Boost/include/boost/optional/optional.hpp", line 208.24: 1540-0700 (I) The previous message was produced while processing "boost::optional_detail::optional_base<std::locale>::~optional_base()". "/a/Boost/include/boost/optional/optional.hpp", line 130.7: 1540-0700 (I) The previous message was produced while processing "boost::optional_detail::optional_base<std::locale>::__dftbdt()". "/a/Boost/include/boost/optional/optional.hpp", line 472.5: 1540-0700 (I) The previous message was produced while processing "boost::optional<std::locale>::~optional()". "/a/Boost/include/boost/format/internals.hpp", line 38.9: 1540-0700 (I) The previous message was produced while processing "boost::io::detail::stream_format_state<char,std::char_traits<char> >::stream_format_state(char)". "/a/Boost/include/boost/format/internals.hpp", line 78.53: 1540-0700 (I) The previous message was produced while processing "boost::io::detail::format_item<char,std::char_traits<char>,std::allocat or<char> >::format_item(char)". "/a/Boost/include/boost/format/format_implementation.hpp", line 121.40: 1540-0700 (I) The previous message was produced while processing "boost::basic_format<char,struct std::char_traits<char>,class std::allocator<char> >::make_or_reuse_data(size_t)". "/a/Boost/include/boost/format/parsing.hpp", line 415.9: 1540-0700 (I) The previous message was produced while processing "boost::basic_format<char,struct std::char_traits<char>,class std::allocator<char> >::parse(const string_type &)". "/a/Boost/include/boost/format/format_implementation.hpp", line 33.13: 1540-0700 (I) The previous message was produced while processing "boost::basic_format<char,struct std::char_traits<char>,class std::allocator<char> >::basic_format(const char *)". "IDTApplication.cpp", line 1082.17: 1540-0700 (I) The previous message was produced while processing "IDTApplication::createO(Pnt29aFile &, IDTConditionCodeFile &, string &, IDTDetails_File &)".

2 1

boost::thread - Checking that an object is called from the right thread
by Thomas Sondergaard 10 Apr '07

10 Apr '07

I've got an object that should only be called from the thread that instantiated, and I'd like the object to check that. Using pthreads I've checked this with pthread_self, but now I'm moving to boost threads, my code looks like this: class MyClass { boost::thread instantiating_thread; public: void doSomething() { // Verify that we have been called from the right thread assert(boost::thread() == instantiating_thread) // Actually do something... } }; Is this alright? The boost::threads documentation has this to say about the boost::thread() default constructor: 1. thread(); Effects: Constructs a thread object representing the current thread of execution. Postconditions: *this is non-joinable. Notes: Danger:*this is valid only within the current thread. (http://www.boost.org/doc/html/thread.html) If *this is not valid from another thread, as the documentation states, then my assert above is broken, right? Regards, Thomas Søndergaard

1 0

Boost Filesystem Library - TYPO?
by SmokingRope 10 Apr '07

10 Apr '07

I have been reading through the Boost Filesystem library trying to get a feel for syntax. I'm looking at the current version available through sourceforge (1.33.1). I also noticed that the sourceforge version is different than the CVS version. Anyway: file: /libs/fileystem/src/path_posix_windows.cpp function: m_path_append(const std::string&, name_checker) lines: 305 -311 // append '/' if needed if( !empty() #ifdef BOOST_WINDOWS && *(m_path.end()-1) != ':' // QUESTION related to this #endif && *(m_path.end()-1) != '/' ) m_path += '/'; ------------------------------------------------------------- The line in question appears to be a typo and should actually read && *(m_path.end()-1) != '\\' Has this gone past the radar or do my eyes decieve me?

1 0

[mpl] public inheritance
by Igor Mikushkin 08 Apr '07

08 Apr '07

Hello! Can I use public or protected inheritance using inherit and inherit_linearly metafunctions?

2 2

[serialization] Suggestion for documenting stream_error
by Oleg V. Zhylin 06 Apr '07

06 Apr '07

Hi, I have an experience of debugging stream_error problem. It appeared that I was saving pointer and loading reference. I suggest such a mistake is common enough to be documented at http://www.boost.org/libs/serialization/doc/exceptions.html#stream_error WBR Oleg V. Zhylin ovz(a)yahoo.com ____________________________________________________________________________________ Never miss an email again! Yahoo! Toolbar alerts you the instant new Mail arrives. http://tools.search.yahoo.com/toolbar/features/mail/

1 0

why STLport?
by n.torrey.pines＠gmail.com 06 Apr '07

06 Apr '07

I'm curious, are there reasons to use STLport with GCC + Boost instead of GCC's own library? Better debugging?

1 0

[1.34] using STLport 5.1.0 fails during linking
by Vincent Torri 05 Apr '07

05 Apr '07

Hello, I'm trying to build Boost 1.34 using STLport 5.1(.0), but I get those error messages during link: /usr/bin/ld: cannot find -lstlportstlg.5.1 /usr/bin/ld: cannot find -lstlport.5.1 I use Linux and gcc 4.1.2. The static libs of STLport exist, but without the version number. Here is how I compile and install STLport: tar jxvf STLport-5.1.0.tar.bz2 cd STLport-5.1.0/build/lib make -f gcc.mak depend make -f gcc.mak make -f gcc.mak all-static make -f gcc.mak install make -f gcc.mak install-static cd ../.. cp lib/libstlport* $HOME/local/lib/ cp -R stlport $HOME/local/include/ Here are the available static libs: libstlport.a libstlportg.a libstlportstlg.a Note: I've just compiled STLport 5.1.3. Same files. They didn't change the build system. Note bis: I've asked the STLport devs if I should link my project with static or shared lib of STLport. They answered the shared lib as it is less troublesome. Maybe Boost should also do that. I modified user-config.jam by adding ($HOME == /home/torri): using stlport : 5.1.0 : "/home/torri/local/stlport" "/home/torri/local/lib" ; I compiled Boost with that command line: ../../boost-jam-3.1.13-1-linuxx86/bjam --prefix=$HOME/local stdlib=stlport --toolset=gcc If needed, I can provide more informations on my system. Vincent Torri

2 3

Serialization problem with DLLs
by Gheury Edmond (DBB) 05 Apr '07

05 Apr '07

Hello, I am experiencing some trouble with the boost.serialization library. I'm using Visual Studio .Net 2003. My serialization code is located inside a specific DLL (i'm using polymorphic archives). When I want to save the data, there is no problem. But when I want to load previously saved data, it throws an "unregistered class" exception. Thus, I tried the following test: instead of building a DLL, I built the serialization code into a static ".lib" and relinked my program. Then everything worked fine. I tried to track down what threw the exception in the DLL code. I think the bug consequences show up in extended_type_info.cpp. The ktmap class is used to register the type keys. When the ktmap::insert is called the first time, it assigns the address of the static data "instance" to the m_self class attribute (like singletons). Then, after ktmap::insert has been called several times, the process enters serialization's load code and, when ktmap::find is called the first time, it does a check on m_self, which is NULL. Therefore, it exits without returning anything, causing a throw in the calling function (basic_iarchive). When I built the code into a static lib, the ktmap::insert calls occur like with the DLL code, but when ktmap::find is called, the "m_self" attribute hasn't been reset to NULL, and the data is loaded successfully. I don't know what to do, no warnings are issued when I compile the serialization DLL so I guess everything is OK on that side. Both the DLL and the lib are compiled using "multithreaded debug DLL" option in the code generation tab, which works fine for everything else. I did some googling and didn't find any thread mentionning that specific problem. Has anyone suggestions to solve this problem ? Thank you very much, Edmond. -------------------------------------- Dexia Bank disclaimer : http://www.dexia.be/maildisclaimer.htm --------------------------------------

2 1

Boost Con question
by Elisha Berns 05 Apr '07

05 Apr '07

Boost Conference Organizers, The conference schedule and program looks great. There is just one thing I would like to know: can participants receive/access something on the order of recordings and slides of the sessions? That way I don't need to fret about missing a session or track I can't physically attend. Thanks for the clarification, Elisha Berns

2 3

[RFC] Preferred API for a CGI library proposal
by Darren Garvey 05 Apr '07

05 Apr '07

Hello all, This may seem off-topic, but I assure you it isn't. ;) This is an initial probe for ideas about an API for [any] upcoming CGI library submission. I have my own ideas, but I don't think putting them here would be particularly relevant. The reason I'm asking such an open-ended question is that I'm assuming lots of people here will have experience using CGI libraries (possibly in other languages, possibly your own) and may have specific ideas about what should or shouldn't move from them into a Boost.CGI library, if one were accepted. Whether or not you see the point of a C++ CGI library, your comments on APIs provided by other languages would still be very much appreciated! Cheers, Darren

2 1

[pool] Does alloc_size waste memory?
by Soren Soe 05 Apr '07

05 Apr '07

Hi, I am trying to replace an old implementation of a small object memory allocator with boost::pool. I have noticed that boost::pool uses quite a bit more memory for certain requested_size than the allocator I am trying to replace. After looking at the code and reading the Guaranteeing Alignment <http://www.boost.org/libs/pool/doc/implementation/alignment.html> document, I am wondering why boost::pool::alloc_size() have to be lcm(sizeof(void*), sizeof(size_type), requested_size)? Lots of bytes can be wasted in the chunks returned to user when requested_size is not a multiple of min_alloc_size (lcm(sizeof(void*), sizeof(size_type))). I would think the requested_size alignment could be the first multiple of min_alloc_size that is larger than requested_size. For example, the convoluted example in the alignment document has requested_size==7, sizeof(void*)==3, and sizeof(size_type)==5. Currently alloc_size() returns lcm(3,5,7)==105, but since min_alloc_size is lcm(3,5)==15, I think requested_size alignment could be 15 bytes, rather than the 105 bytes. Another way to look at this. If requested_size was changed to 15, then the current implementation of alloc_size() would return 15 bytes (lcm(3,5,15)==15), so why the huge penalty when requested size is 7? Am I missing something? Thank you. Soren

1 0

boost::filesystem and an odd linker error.
by Matt Handley 05 Apr '07

05 Apr '07

Hi. I'm having difficulty using the boost::filesystem library. I have checked-out the source from the CVS repository, and ran: /usr/local/bin/bjam --v2 --toolset=darwin --with-regex --with- serialization --with-filesystem --layout=system --prefix=SOMEDIR variant=release threading=single link=shared install Thinking that it would install headers in SOMEDIR/include and SOMEDIR/ lib. That it did. However, when I try to compile the simple_ls.cpp example, I get the following errors: $ g++ -o simple_ls simple_ls.cpp -Llibraries/lib -lboost_filesystem - lboost_system /usr/bin/ld: Undefined symbols: boost::filesystem::initial_path() boost::filesystem::is_directory(boost::filesystem::path const&) boost::filesystem::system_complete(boost::filesystem::path const&) boost::filesystem::path::path(char const*, bool (*) (std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)) boost::filesystem::detail::dir_itr_init (boost::shared_ptr<boost::filesystem::detail::dir_itr_imp>&, boost::filesystem::path const&) boost::filesystem::detail::dir_itr_increment (boost::shared_ptr<boost::filesystem::detail::dir_itr_imp>&) boost::filesystem::detail::dir_itr_dereference (boost::shared_ptr<boost::filesystem::detail::dir_itr_imp> const&) boost::filesystem::exists(boost::filesystem::path const&) boost::filesystem::path::native_file_string() const boost::filesystem::path::native_directory_string() const boost::filesystem::path::leaf() const collect2: ld returned 1 exit status Which is a bit odd. The contents of the libraries/lib directory: $ ls libraries/lib/libboost* libraries/lib/libboost_filesystem.dylib libraries/lib/ libboost_serialization.dylib libraries/lib/ libboost_wserialization.dylib libraries/lib/libboost_regex.dylib libraries/lib/ libboost_system.dylib Why is this simple program not linking? Matt

1 0

[guid] Linker Error when using precompiled headers
by Christian Henning 05 Apr '07

05 Apr '07

Hi there, there is a problem with the free flowing functions random_byte(...) and swap(...). stdafx.obj : error LNK2005: "unsigned char __cdecl boost::detail::random_byte(void)" (?random_byte@detail@boost@@YAEXZ) already defined in database.obj stdafx.obj : error LNK2005: "void __cdecl boost::swap(class boost::guid &,class boost::guid &)" (?swap@boost@@YAXAAVguid@1@0@Z) already defined in database.obj To solve that one would need to move the functions inside a structure. For example: namespace boost { namespace detail { struct utilities { static uint8_t random_byte() { ... } }; }} Christian

2 3

[FileSystem] can't use path class
by Alexander Fradiani 05 Apr '07

05 Apr '07

Hello. I can't initialize the path class with a char* argument. I'm using cygwin, with the boost libraries installed as part of the cygwin installation packages. this is the code: #include "boost/filesystem/operations.hpp" #include "boost/filesystem/path.hpp" #include <iostream> #include <string> using namespace boost::filesystem; using namespace std; int main() { path mypath("/code/fileMan.txt"); return 0; } and the error i get when trying to compile with g++ is: "undefined reference to boost::filesystem::path::path(char const*)" I dont know exactly what is wrong, this is the first time i use the boost libraries so i really appreciate some help, thanks _________________________________________________________________ Charla con tus amigos en línea mediante MSN Messenger: http://messenger.latam.msn.com/

2 1

Re: [Boost-users] [bind] binding a boost::reference_wrapper to a function template
by Barchenkov, Alexei (IT) 05 Apr '07

05 Apr '07

>The problem is that tr is ref( t ) and is interpreted by bind as a request to store a reference to t. >boost::bind( &foo< Test& >, tr ) should work, if this helps. Peter, thank you very much. Could you please clarify what you mean however, because my understanding was that on construction, boost::bind internally just stores a copy of the bound argument without regard to the signature of the function to be invoked. The conversion of the argument to the type appropriate to the function invocation occurs when the functor is actually called. Is my understanding incorrect? Thank you. -------------------------------------------------------- NOTICE: If received in error, please destroy and notify sender. Sender does not intend to waive confidentiality or privilege. Use of this email is prohibited when received in error.

2 1

bind visit_each and obtaining argument values from bind
by Braddock Gaskill 05 Apr '07

05 Apr '07

Am I correct that the bind visit_each functionality briefly mentioned in the boost::bind documentations will allow me to get at actual argument values passed to a bind statement? That would be VERY useful to me at the moment. Is there a working example? The bind_visitor.cpp example seems to be broken(?). thanks, braddock

2 3

ERROR
by Lucas de Sales Joner 05 Apr '07

05 Apr '07

C:\Arquivos de programas\Dev-Cpp\include\boost\numeric\ublas\exception.hpp exception handling disabled, use -fexceptions to enable Somebody Know what is this and how I do that de error say? _________________________________________________________________ Veja só alguns dos novos serviços online no Windows Live Ideas — são tão novos que ainda não foram disponibilizados oficialmente. http://ideas.live.com

1 0

Plot
by Lucas de Sales Joner 05 Apr '07

05 Apr '07

Somebody know how I plot a vector boost? _________________________________________________________________ Obtenha o novo Windows Live Messenger! http://get.live.com/messenger/overview

1 0

pointers to static structures
by Scott Finley 05 Apr '07

05 Apr '07

I am wondering about best practices for the use of pointers to static structures. I have a class that will essentially replace an enumeration and represent a set of options. The options will be static members of the class. I would also like to have a vector of pointers to all the static members in order to be able to query all possible values at run time. This vector would be initialized explicitly by the constructor. Is there any reason that the vector should not hold normal raw pointers? Obviously I want to use these options without copying them around all over the place, so pointers seem to be the answer, but I will never be creating an option dynamically, so I don't really have any risk of memory leaks. Is there any reason to use shared_ptr with a custom destructor that does nothing? My use case would be something like: class myOption; class myOptionSet { public: myOptionSet() { allOptions.push_back( &OPTION_1 ); allOptions.push_back( &OPTION_2 ); } vector<myOption> const &getAllOptions() { return allOptions; } static myOption const OPTION_1; // initialized in .cpp static myOption const OPTION_2; private: static vector<myOption const *> allOptions; } class OptionUsingClass { OptionUsingClass( vector<myOption> const &possibleOptions ); // This can now check that the option is a possibleOption void doSomething( myOption const &option ); // or maybe this is better... void doSomething( myOption const *option ); }; Is this a good way to do things? Should I be using some sort of pointer wrapper instead? -- /************************************** * Scott Finley * Research Software Engineer * TomoTherapy Inc. * Email: sfinley(a)tomotherapy.com * Phone: 608.824.3381 ***/

1 0

[BGL] how to build a hierarchy of graphs
by Shufei Fan 05 Apr '07

05 Apr '07

Hi, I need to build a hierarchy of graphs bottom up. Conceptually, every level(>1) of graph is a result of merging groups of nearest neighbors of its immediate lower level, according to some sort of criteria. My general question is, what is the best way of building this hierarchy using BGL?(or, BGL already has this kind of mechanism somewhere?) (I didnot read in detail concepts like subgraph, filter, etc. From the names, they seems to of help?) And Is it possible to effeciently retrieve information both within same level and across levels? Thanks in advance. Shufei

1 0

[licensing] Proper way of quoting the license
by Ruediger Berlich 05 Apr '07

05 Apr '07

Hi there, while looking for a thread-safe buffer implementation, I discovered the upcoming circular_buffer library (with a thread-safe bounded_buffer implementation on top), and William E. Kempf's tutorial implementation of a bounded buffer (boost_1_33_1/libs/thread/tutorial/bounded_buffer.cpp in the 1.33.1 boost sources). The circular_buffer library is not yet officially available as part of Boost, but fortunately the tutorial implementaion does most of what I need. That is, with the notable exception that it covers Integers only. I have thus made a few small changes, including making it a template, so I can "plug in" any type I want, and I want to use it for the time being (until circular_buffer becomes officially available). ** My question now is, what the proper way is to refer to William and honour the license terms, while still excluding any "express or implied warranty" for my changes. ** Here is my current approach: /** * Note: This class was taken (with small modifications) * from the Boost.thread tutorials * ( boost_1_33_1/libs/thread/tutorial/bounded_buffer.cpp ). * The original code contained the following text: * *************************************************************** * Copyright (C) 2001-2003 * * William E. Kempf * * * * Permission to use, copy, modify, distribute and sell this * * software and its documentation for any purpose is hereby * * granted without fee, provided that the above copyright * * notice appear in all copies and that both that copyright * * notice and this permission notice appear in supporting * * documentation. William E. Kempf makes no representations * * about the suitability of this software for any purpose. * * It is provided "as is" without express or implied warranty. * *************************************************************** * * All modifications to William E. Kempf's original code, as shown * in this file, are covered by the same license as listed above, * and are Copyright (C) 2007 Ruediger Berlich. In particular, * please note that * *************************************************************** * Ruediger Berlich makes no representations * * about the suitability of this software for any purpose. * * It is provided "as is" without express or implied warranty. * *************************************************************** * / Is this sufficient ? And [do I have to / may I / should I] include an additional copyright statement for the modifications ? Or am I just paranoid ? ;-) Thanks and have a good easter time, Ruediger

1 0

[MultiIndex] Resolving foreign keys
by Christian Henning 05 Apr '07

05 Apr '07

Hi there, beware I'm a new to Multiindex and haven't digested the whole capabilities of the library, yet. In my example I have two entities that are connected via a foreign key. In this case the key is type of an int. When retrieving the objects from a database I end up having two containers containing those objects. In the code below there are a customer_row and a order_row class. There is a one-to_many relationship between them. One customer can have several order but one order is can only one customer. So, my goal is to find an way to create order objects that are pointing to the correct row objects. So far, I don't really see how the MultiIndex lib can be of help for me. I have looked at the example six which I think came pretty close to my goal. So, taken this example, is it possible to use an key type instead of the car_manufacturer pointer? Please consider the following code: using namespace std; using namespace boost; using namespace boost::multi_index; struct primary {}; struct foreign {}; struct customer_row { int _id; string _name; customer_row( int id, const string& name ) : _id( id ), _name( name ) {} friend ostream& operator<<( ostream& os, const customer_row& c ) { os << c._id << " " << c._name << endl; return os; } }; typedef multi_index_container< customer_row, indexed_by< ordered_unique< tag< primary >, BOOST_MULTI_INDEX_MEMBER(customer_row,int,_id) > > > customer_table; struct order_row { int _id; int _customer_id; string _article; order_row( int id, int customer_id, const string& article ) : _id( id ), _customer_id( customer_id ), _article( article ) {} friend ostream& operator<<( ostream& os, const order_row& o ) { os << o._id << " " << o._customer_id << " " << o._article << endl; return os; } }; typedef multi_index_container< order_row, indexed_by< ordered_unique< tag< primary >, BOOST_MULTI_INDEX_MEMBER(order_row,int,_id) >, ordered_non_unique< tag< foreign >, BOOST_MULTI_INDEX_MEMBER(order_row,int,_customer_id) > > > order_table; struct order { const order_row* _order_row; const customer_row* _customer_row; }; int main() { customer_table ct; ct.insert( customer_row( 97, "Bon Jovi" )); ct.insert( customer_row( 98, "Billy Joel" )); ct.insert( customer_row( 99, "Morgan Freeman" )); order_table ot; ot.insert( order_row( 0, 97, "Book" )); ot.insert( order_row( 1, 97, "Car" )); ot.insert( order_row( 2, 97, "Dish Washer" )); order_table::iterator it = ot.get<primary>().begin(); order_table::iterator end = ot.get<primary>().end(); vector<order> orders; while( it != end ) { // find customer typedef customer_table::index<primary>::type customer_table_by_primary; customer_table_by_primary::iterator ic = ct.get<primary>().find( it->_customer_id ); order o; o._order_row = &( *it ); o._customer_row = &*ct.get<primary>().find( it->_customer_id ); orders.push_back( o ); ++it; } return 0; } Is there a more advanced way using the MultiIndex lib of combining two related objects so I can created my orders array? Or in different words can I structure my code more efficiently? Since this is a very simplified version it should be extensible to more entities with more than one foreign keys. Thanks ahead, Christian

2 5

[BGL] re-indexing of vertices /or edges
by Shufei Fan 05 Apr '07

05 Apr '07

Hi, Can I disable re-indexing of vertices after one of them is removed? In one of the old thread: http://thread.gmane.org/gmane.comp.lib.boost.user/10551/focus=10552 Doug said: " Vertex and edge indices are a weak point in the BGL. It seems like they should be automatically updated, but that can't be done efficiently. We have a partial solution (a graph type that is reasonably good all-around and does automatic (re-)indexing), but it's not ready for release yet." I am using release 1.33.1. Is this re-indexing released?(I assume so, from my simple trial) But, is there any way of enabling /and disabling re-indexing? Interestingly, my application needs re-indexing disabled, even though some vertices or edges are removed. Thanks, Shufei

3 5

to Jan gaspar : status of circular buffer
by Vincent Torri 05 Apr '07

05 Apr '07

Hello, I would like to know the status of the circular buffer library. The boost sandbox cvs shows regular commits, but is it close to a release (in boost 1.35, for example) ? thank you Vincent Torri

2 1

Re: [Boost-users] [serialization] Serialization through pointer to baseclass
by Pfligersdorffer, Christian 05 Apr '07

05 Apr '07

Hey Ruediger, you simply need to make toString() virtual :-) Life can be that simple sometimes... Best wishes, DI Christian Pfligersdorffer Software Engineering EOS GmbH > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org]On Behalf Of Ruediger > Berlich > Sent: Wednesday, April 04, 2007 5:28 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [serialization] Serialization through > pointer to > baseclass > > > Hi there, > I am trying to serialize an object through a pointer to its > base class. > > My application is in the field of distributed processing. I have > a "communicator" type of class, which receives pointers from > other objects, > serializes them, sends the generated string over a network > for further, > remote processing and then deals with the responses. It is > supposed to know > nothing about the objects it serializes, except that they contain a > method "toString()", which is contained in the base class. > > However, when I call that method, I only get a serialization > of that base > class, not of the derived class. > > Here is some code to illustrate the problem. The output of > the program is > listed at the end of this posting. > > How can I achieve serialization of the derived class (without explicit > casting), if it is stored in a pointer to a base class ? > > My assumption is that this has to do with the fact that the > "serialization" > method cannot be virtual, as it is a member function template. > > Any help is appreciated. > > Thanks and have a good day, > Ruediger > > /************************************************************* > ************/ > // headers and namespace statements removed ... > > class base > :public vector<int> > { > friend class boost::serialization::access; > > template<class Archive> > void serialize(Archive & ar, const unsigned int version){ > using boost::serialization::make_nvp; > ar & make_nvp("vector", > > boost::serialization::base_object<std::vector<int> >(*this)); > } > > public: > base(){ /* nothing */ } > virtual ~base() { /* nothing */ } > > virtual void appendValue(int val) = 0; > > string toString(void){ > ostringstream ofs; > boost::archive::xml_oarchive oa(ofs); > // this should point to derived objects > oa << make_nvp("myp",*this); > return ofs.str(); > } > > void printType(void){ > cout << typeid(*this).name() << endl; > } > }; > > BOOST_IS_ABSTRACT(base); > > /************************************************************* > ***************/ > > class derived > :public base > { > friend class boost::serialization::access; > > template<class Archive> > void serialize(Archive & ar, const unsigned int version){ > using boost::serialization::make_nvp; > ar & make_nvp("base", > boost::serialization::base_object<base>(*this)); > } > > public: > derived(){ /* nothing */ } > virtual ~derived() { /* nothing */ } > > void appendValue(int val){ > this->push_back(val); > } > }; > > > BOOST_CLASS_EXPORT(derived); > > /************************************************************* > ***************/ > > main() > { > base *myp = new derived(); > myp->appendValue(1); > > // only serializes class "base" > cout << myp->toString(); > > cout << "===========================" << endl; > > myp->printType(); > // this in printType points to the correct type > cout << "===========================" << endl; > > // Explicit casting to the derived class yields the > correct response > derived *mypp = (derived *)myp; > ostringstream ofs; > boost::archive::xml_oarchive oa(ofs); > oa << make_nvp("myp",*mypp); > cout << ofs.str() << endl; > } > > /************************************************************* > ***************/ > > Here is the output of the program: > > <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> > <!DOCTYPE boost_serialization> > <boost_serialization signature="serialization::archive" version="3"> > <myp class_id="0" tracking_level="0" version="0"> > <vector> > <count>1</count> > <item>1</item> > </vector> > </myp> > =========================== > 7derived > =========================== > <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> > <!DOCTYPE boost_serialization> > <boost_serialization signature="serialization::archive" version="3"> > <myp class_id="0" tracking_level="1" version="0" object_id="_0"> > <base class_id="1" tracking_level="0" version="0"> > <vector> > <count>1</count> > <item>1</item> > </vector> > </base> > </myp> > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

1 0

nested containers with boost?
by nicola 05 Apr '07

05 Apr '07

Hi, I would like an arbitrarily nested data structure, e.g. similar to std::vector< std::list<int> >, giving access to the elements of any of its subcontainers, but, at the same time, being a model of Container - in particular, having an iterator over all the elements in the last nesting level (int's in the previous example). Space/time efficiency is very important in my application. My solution would be to build a container adaptor similar to // vector of lists of ... of int typedef my_nested_container<std::vector, std::list, ..., int> nc_type; nc_type nc; (with type lists?) with an iterator adaptor that allows me to write something like: for (nc_type::iterator i = nc.begin(); i != nc.end(); ++i) // do smth with integer *i The nested container should also allow the user to modify each subcontainer and to iterate over the elements of a subcontainer, possibly without (much) overhead, e.g. // Iteration over the elements of one subcontainer for (nc_type::inner_iterator j = nc.inner_begin(); j != nc.inner_end(); ++j) // ... I have started to implement a prototype from scratch, but I am wondering whether I am reinventing the wheel. I think I can use boost::iterator_facade for my_nested_container::iterator and/or boost::pointer_container to build the nested structure internally (to minimize reallocation overhead upon dynamical change of the structure). Is there any other boost library I could take advantage from? I find that operations on a nested container are not completely trivial to implement (or even to define properly, think of add/remove in subcontainers which may themselves be nested containers) given its recursive nature, so I would be very glad to know that something like that is available off-the-shelf. I have found myself in need for such a data structure more often than not. Nicola

2 2

[serialization] Serialization through pointer to base class
by Ruediger Berlich 05 Apr '07

05 Apr '07

Hi there, I am trying to serialize an object through a pointer to its base class. My application is in the field of distributed processing. I have a "communicator" type of class, which receives pointers from other objects, serializes them, sends the generated string over a network for further, remote processing and then deals with the responses. It is supposed to know nothing about the objects it serializes, except that they contain a method "toString()", which is contained in the base class. However, when I call that method, I only get a serialization of that base class, not of the derived class. Here is some code to illustrate the problem. The output of the program is listed at the end of this posting. How can I achieve serialization of the derived class (without explicit casting), if it is stored in a pointer to a base class ? My assumption is that this has to do with the fact that the "serialization" method cannot be virtual, as it is a member function template. Any help is appreciated. Thanks and have a good day, Ruediger /*************************************************************************/ // headers and namespace statements removed ... class base :public vector<int> { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version){ using boost::serialization::make_nvp; ar & make_nvp("vector", boost::serialization::base_object<std::vector<int> >(*this)); } public: base(){ /* nothing */ } virtual ~base() { /* nothing */ } virtual void appendValue(int val) = 0; string toString(void){ ostringstream ofs; boost::archive::xml_oarchive oa(ofs); // this should point to derived objects oa << make_nvp("myp",*this); return ofs.str(); } void printType(void){ cout << typeid(*this).name() << endl; } }; BOOST_IS_ABSTRACT(base); /****************************************************************************/ class derived :public base { friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version){ using boost::serialization::make_nvp; ar & make_nvp("base", boost::serialization::base_object<base>(*this)); } public: derived(){ /* nothing */ } virtual ~derived() { /* nothing */ } void appendValue(int val){ this->push_back(val); } }; BOOST_CLASS_EXPORT(derived); /****************************************************************************/ main() { base *myp = new derived(); myp->appendValue(1); // only serializes class "base" cout << myp->toString(); cout << "===========================" << endl; myp->printType(); // this in printType points to the correct type cout << "===========================" << endl; // Explicit casting to the derived class yields the correct response derived *mypp = (derived *)myp; ostringstream ofs; boost::archive::xml_oarchive oa(ofs); oa << make_nvp("myp",*mypp); cout << ofs.str() << endl; } /****************************************************************************/ Here is the output of the program: <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="3"> <myp class_id="0" tracking_level="0" version="0"> <vector> <count>1</count> <item>1</item> </vector> </myp> =========================== 7derived =========================== <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="3"> <myp class_id="0" tracking_level="1" version="0" object_id="_0"> <base class_id="1" tracking_level="0" version="0"> <vector> <count>1</count> <item>1</item> </vector> </base> </myp>

2 3

[serialization] bug? serializing a vector resets ignored element members
by n.torrey.pines＠gmail.com 05 Apr '07

05 Apr '07

Hi If I serialize a struct, while ignoring one of its members, the member retains its value. I understand that this is the inteded serialization semantics - what you ignore for reading and writing remains intact. However, if I do this with a vector, the ingored members of its elements get reset to their "default" values. I'm too lazy to pore over the sources, but I'm guessing this might be happening because the implementation of vector serialization calls its constructor (and assignment?) where a resize could probably be better. Here is the specific code I boiled down the manifestation of this feature/bug to: // creates writes "remove_me" file #include <iostream> #include <fstream> #include <vector> #include <boost/filesystem/fstream.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/vector.hpp> struct s { s() : i(0), j(0) {} s(int i, int j) : i(i), j(j) {} int i, j; private: friend class boost::serialization::access; template<typename Archive> void serialize(Archive& ar, const unsigned version) { // ignore j ar & i; } }; struct v { v(const s& x) : data(5, x) {} std::vector<s> data; void write(const char* name) const { std::ofstream out(name); boost::archive::text_oarchive ar(out); ar << *this; } void read(const char* name) { std::ifstream in(name); boost::archive::text_iarchive ar(in); ar >> *this; } private: friend class boost::serialization::access; template<typename Archive> void serialize(Archive& ar, const unsigned version) { ar & data; } }; int main() { using namespace std; const char name[] = "remove_me"; s si(1, 2); // j == 2 v vi(si); vi.write(name); vi.read(name); std::cout << vi.data[0].j << std::endl; // j == 0 }

2 1

[mpl] insert not inserting?
by Scott Meyers 04 Apr '07

04 Apr '07

In my continuing effort to demonstrate my inability to get much of anything working with the MPL, I'm having trouble inserting a type into an existing set of types. The code compiles and runs, but the revised type sequence is empty. Here's the code: #include <boost/mpl/set.hpp> #include <boost/mpl/for_each.hpp> #include <typeinfo> #include <iostream> namespace mpl = boost::mpl; struct Base { virtual ~Base(){} }; struct A { virtual ~A(){} }; struct B { virtual ~B(){} }; struct Print { template<typename T> void operator()(const T&) { std::cout << typeid(T).name() << ", "; } }; int main() { typedef mpl::set<A, B> Constraints; // print contents of Constraints (should be the equivalent // of "[A, B,]") std::cout << '['; mpl::for_each<Constraints>(Print()); std::cout << "]\n"; // add Base to Constraints, call result BaseClasses typedef mpl::insert<Constraints, mpl::end<Constraints>, Base> BaseClasses; // print contents of BaseClasses (should be the equivalent // of "[A, B, Base, ]") std::cout << '['; mpl::for_each<BaseClasses>(Print()); std::cout << "]\n"; } Can anybody spot what I'm doing wrong? I know that I could use the two-argument form of insert with a set, but I'm trying to write code that will work with a vector, too, and at any rate, I get the same results with the two-argument form of set. Thanks, Scott

8 26

[bind] binding a boost::reference_wrapper to a function template
by Barchenkov, Alexei (IT) 04 Apr '07

04 Apr '07

Rewording from a previous post: Are there any issues with binding a boost:ref to a free templated function? On gcc32 this generates an error: class Test { }; template <class T> void foo(T arg_) { } int main(int) { Test t; boost::reference_wrapper<Test> tr(t); boost::function<void()> fun1 = boost::bind(&::foo<boost::reference_wrapper<Test> >, tr); // line 41 } - Alex ________________________________ From: Barchenkov, Alexei (IT) Sent: Friday, March 23, 2007 12:55 PM To: boost-users(a)lists.boost.org Subject: question about binding a boost::reference_wrapper argument inside a templated function I am getting an error when compiling the following code on gcc32. Could someone please point out what is the problem? Thank you. class Test { }; template <class T> void foo(T arg_) { } template <class T> void fooRef(const T& arg_){ } int main(int) { Test t; boost::reference_wrapper<Test> tr(t); boost::function<void()> fun1 = boost::bind(&::foo<boost::reference_wrapper<Test> >, tr); // line 41 boost::function<void()> fun2 = boost::bind(&::fooRef<boost::reference_wrapper<Test> >, tr); // line 42 } .... /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp: In member function `void boost::_bi::list1<A1>::operator()(boost::_bi::type<void>, F&, A&, int) [with F = void (*)(boost::reference_wrapper<Test>), A = boost::_bi::list0, A1 = boost::reference_wrapper<Test>]': /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind/bind_template.h pp:20: instantiated from `boost::_bi::result_traits<R, F>::type boost::_bi::bind_t<R, F, L>::operator()() [with R = void, F = void (*)(boost::reference_wrapper<Test>), L = boost::_bi::list1<boost::reference_wrapper<Test> >]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:136: instantiated from `static void boost::detail::function::void_function_obj_invoker0<FunctionObj, R>::invoke(boost::detail::function::any_pointer) [with FunctionObj = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:479: instantiated from `void boost::function0<R, Allocator>::assign_to(FunctionObj, boost::detail::function::function_obj_tag) [with FunctionObj = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:430: instantiated from `void boost::function0<R, Allocator>::assign_to(Functor) [with Functor = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:294: instantiated from `boost::function0<R, Allocator>::function0(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:638: instantiated from `boost::function<R ()(), Allocator>::function(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(boost::reference_wrapper<Test>), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' test10.C:41: instantiated from here /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp:229: conversion from `Test' to non-scalar type `boost::reference_wrapper<Test>' requested /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp: In member function `void boost::_bi::list1<A1>::operator()(boost::_bi::type<void>, F&, A&, int) [with F = void (*)(const boost::reference_wrapper<Test>&), A = boost::_bi::list0, A1 = boost::reference_wrapper<Test>]': /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind/bind_template.h pp:20: instantiated from `boost::_bi::result_traits<R, F>::type boost::_bi::bind_t<R, F, L>::operator()() [with R = void, F = void (*)(const boost::reference_wrapper<Test>&), L = boost::_bi::list1<boost::reference_wrapper<Test> >]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:136: instantiated from `static void boost::detail::function::void_function_obj_invoker0<FunctionObj, R>::invoke(boost::detail::function::any_pointer) [with FunctionObj = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:479: instantiated from `void boost::function0<R, Allocator>::assign_to(FunctionObj, boost::detail::function::function_obj_tag) [with FunctionObj = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:430: instantiated from `void boost::function0<R, Allocator>::assign_to(Functor) [with Functor = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:294: instantiated from `boost::function0<R, Allocator>::function0(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/function/function_te mplate.hpp:638: instantiated from `boost::function<R ()(), Allocator>::function(Functor, boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functo r>::value>::value, int>::type) [with Functor = boost::_bi::bind_t<void, void (*)(const boost::reference_wrapper<Test>&), boost::_bi::list1<boost::reference_wrapper<Test> > >, R = void, Allocator = std::allocator<void>]' test10.C:42: instantiated from here /ms/dist/fsf/PROJ/boost/1.33.1/common/include/boost/bind.hpp:229: could not convert `(+a)->boost::_bi::list0::operator[](const boost::reference_wrapper<T>&) const [with T = Test](this)' to `const boost::reference_wrapper<Test>&' -------------------------------------------------------- NOTICE: If received in error, please destroy and notify sender. Sender does not intend to waive confidentiality or privilege. Use of this email is prohibited when received in error.

2 1

Initialization and shutdown code with boost::unit_test_framework
by Jules d'Entremont 04 Apr '07

04 Apr '07

I have a set of unit tests that require an initialization function to be called once at program startup, and a shutdown function to be called at program exit. Something like this: int main() { init(); // run unit tests fini(); } Is it possible using the unit test framework for me to substitute my own main() function for the one that normally gets run by the framework? Or is there some other way of accomplishing the same thing? Jules d'Entremont.

1 0

assign with my container
by abir basak 04 Apr '07

04 Apr '07

Hi, I am inheriting a vector for some reason. Just like template<typename T> class my_vector : public std::vector<T>{ }; I want my_vector to take the advantage of boost::assign library. How to do it? Thanks abir -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

3 6

[MultiIndex] typo in tutorial
by Christian Henning 04 Apr '07

04 Apr '07

Hi there, maybe it has been fixed already. In the section Sequenced Indices there is a type in the sample code. *(s.begin()) == 1; should be *(s.begin()) = 1; Christian

2 1

how subslice can be made from some disjoint section ?
by abir basak 04 Apr '07

04 Apr '07

Hi, I have a ublas vector (or it can be std::vector also). Where I want to perform certain operation as a rotating basis. The program below illustrates it. std::vector<int> v; v+=1,2,3,4,5,6,7,8,9; ublas::vector<int> v1(v.size()); std::copy(v.begin(),v.end(),v1.begin()); std::cout<<ublas::sum(ublas::subrange(v1,1,3))<<std::endl; std::cout<<ublas::sum(ublas::subrange(v1,7,2))<<std::endl; In the first case I got a sum for [1 ,3) , I also want to get a sum for [7, 2) in a wrapped (circular )way. So is there any range functionality provides it in that way ? I also want some std algorithms to perform over some iterator adapter in a wrapped way .I can write such iterators , but are they already exist in boost ? Thanks abir basak -- Abir Basak, Member IEEE Software Engineer, Read Ink Technologies B. Tech, IIT Kharagpur email: abir(a)abirbasak.com homepage: www.abirbasak.com

1 0

Proper way to change a cached shared pointer
by Stephen Torri 04 Apr '07

04 Apr '07

I have a class which is containing a shared_ptr to data. This class parses in a XML file and populates the data based upon the contents. There is a memory problem in this file where I reset the shared_ptr. class Graph; class Parser { public: boost::shared_ptr<Graph> parse ( std::string filename, std::string directory ) { // Line 110 Formula_Parser.cpp m_graph.reset ( new Graph() ); ... parse file ... return m_graph; } private boost::shared_ptr<Graph> m_graph; }; The error I am getting is saying that the problem appears to be in the ==28769== by 0x4154024: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:128) ==28769== by 0x8055869: main (reverse.cpp:50) ==28769== Address 0x4389BC0 is 8 bytes inside a block of size 60 alloc'd ==28769== at 0x4005BA5: operator new(unsigned) (vg_replace_malloc.c:163) ==28769== by 0x41968E1: libreverse::infrastructure::Formula_Parser::get_Graph(std::string, std::string) (Formula_Parser.cpp:110) ==28769== by 0x419351E: libreverse::infrastructure::Configurator::get_Graph(unsigned, unsigned) (Configurator.cpp:110) ==28769== by 0x4153FBC: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:115) ==28769== by 0x8055869: main (reverse.cpp:50) ==28769== ==28769== Uninitialised byte(s) found during client check request ==28769== at 0x4161176: libreverse::api::Reverse_Impl::print_Graph(libreverse::infrastructure::Component_Graph const&, std::string) const (Reverse_Impl.cpp:184) ==28769== by 0x4161D96: libreverse::api::Reverse_Impl::execute_Input_Section(boost::shared_ptr<std::map<std::string, boost::shared_ptr<libreverse::infrastructure::Component_Graph>, std::less<std::string>, std::allocator<std::pair<std::string const, boost::shared_ptr<libreverse::infrastructure::Component_Graph> > > > > const&, boost::shared_ptr<libreverse::infrastructure::Data_Source_Base const>, boost::shared_ptr<libreverse::infrastructure::Component>) (Reverse_Impl.cpp:45) ==28769== by 0x4154024: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:128) ==28769== by 0x8055869: main (reverse.cpp:50) ==28769== Address 0xBE9D82CC is on thread 1's stack Visiting node: 1

2 2

Proper way to change a cached shared pointer
by Stephen Torri 04 Apr '07

04 Apr '07

Sorry for the duplicate. I hit a weird set of key strokes and the email was sent. I have a class which is containing a shared_ptr to data. This class parses in a XML file and populates the data based upon the contents. There is a memory problem in this file where I reset the shared_ptr. Am I right in interpreting the output of valgrind that the problem is at Line 110 in Formula_Parser.cpp or is it somewhere else? I thought it was in Formula_Parser.cpp so I printed out here what is happening in the function. I am trying to create a Graph pointer where data will be added to it when the XML parser calls back endElement. So I cannot pass the pointer to the graph as a part of the XML calls without editing that library. So I made it a member variable to the class. The idea is that the Graph is populated with Components and then returned at the end of parse(). Am I correctly resetting m_graph? Stephen ---------------- class Graph; class Parser { public: boost::shared_ptr<Graph> parse ( std::string filename, std::string directory ) { // Line 110 Formula_Parser.cpp m_graph.reset ( new Graph() ); ... parse file ... return m_graph; } void endElement ( ... ) { // Add item to m_graph m_graph.add ( new Component ); } private boost::shared_ptr<Graph> m_graph; }; ==28769== Uninitialised byte(s) found during client check request ==28769== at 0x4161127: libreverse::api::Reverse_Impl::print_Graph(libreverse::infrastructure::Component_Graph const&, std::string) const (Reverse_Impl.cpp:183) ==28769== by 0x4161D96: libreverse::api::Reverse_Impl::execute_Input_Section(boost::shared_ptr<std::map<std::string, boost::shared_ptr<libreverse::infrastructure::Component_Graph>, std::less<std::string>, std::allocator<std::pair<std::string const, boost::shared_ptr<libreverse::infrastructure::Component_Graph> > > > > const&, boost::shared_ptr<libreverse::infrastructure::Data_Source_Base const>, boost::shared_ptr<libreverse::infrastructure::Component>) (Reverse_Impl.cpp:45) ==28769== by 0x4154024: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:128) ==28769== by 0x8055869: main (reverse.cpp:50) ==28769== Address 0x4389BC0 is 8 bytes inside a block of size 60 alloc'd ==28769== at 0x4005BA5: operator new(unsigned) (vg_replace_malloc.c:163) ==28769== by 0x41968E1: libreverse::infrastructure::Formula_Parser::get_Graph(std::string, std::string) (Formula_Parser.cpp:110) ==28769== by 0x419351E: libreverse::infrastructure::Configurator::get_Graph(unsigned, unsigned) (Configurator.cpp:110) ==28769== by 0x4153FBC: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:115) ==28769== by 0x8055869: main (reverse.cpp:50) ==28769== ==28769== Uninitialised byte(s) found during client check request ==28769== at 0x4161176: libreverse::api::Reverse_Impl::print_Graph(libreverse::infrastructure::Component_Graph const&, std::string) const (Reverse_Impl.cpp:184) ==28769== by 0x4161D96: libreverse::api::Reverse_Impl::execute_Input_Section(boost::shared_ptr<std::map<std::string, boost::shared_ptr<libreverse::infrastructure::Component_Graph>, std::less<std::string>, std::allocator<std::pair<std::string const, boost::shared_ptr<libreverse::infrastructure::Component_Graph> > > > > const&, boost::shared_ptr<libreverse::infrastructure::Data_Source_Base const>, boost::shared_ptr<libreverse::infrastructure::Component>) (Reverse_Impl.cpp:45) ==28769== by 0x4154024: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:128) ==28769== by 0x8055869: main (reverse.cpp:50) ==28769== Address 0xBE9D82CC is on thread 1's stack

1 0

boost_1_33_1\libs\serialization\vc7ide\Library.vcproj settings
by Oleg V. Zhylin 03 Apr '07

03 Apr '07

Hi, I've just discovered an inconsistency in settings of Library VC7 project for serialization. For Debug builds the target in project settings is libboost_serialization-vc71-s-gd-1_33_1.lib while according to auto_link.hpp "s-gd" should rather be "sgd". Will this be fixed in next release? WBR Oleg V. Zhylin ovz(a)yahoo.com ____________________________________________________________________________________ Bored stiff? Loosen up... Download and play hundreds of games for free on Yahoo! Games. http://games.yahoo.com/games/front

3 2

Troubles with build boost
by Vadim Doroginin 03 Apr '07

03 Apr '07

Hi all! Boost-1.33.1 mingw-3.4.2 msys-1.0.10 building boost: bjam.exe -j1 "-sTOOLS=mingw" "-sBUILD=debug release" --prefix=d:\devel\msys\tmp\boost-install install>install.log 2> install.err bjam successfully creates folder boost-install and puts there include\boost...in lib folder bjam puts these files: File: boost_date_time-mgw-1_33_1.dll 6 KB 4/3/2007 7:47:14 PM File: boost_date_time-mgw-1_33_1.lib 4 KB 4/3/2007 7:47:14 PM File: boost_date_time-mgw-d-1_33_1.dll 240 KB 4/3/2007 7:47:10 PM File: boost_date_time-mgw-d-1_33_1.lib 4 KB 4/3/2007 7:47:10 PM File: boost_date_time-mgw-d.lib 4 KB 4/3/2007 7:47:10 PM File: boost_date_time-mgw.lib 4 KB 4/3/2007 7:47:14 PM File: boost_iostreams-mgw-1_33_1.dll 66 KB 4/3/2007 7:48:07 PM File: boost_iostreams-mgw-1_33_1.lib 41 KB 4/3/2007 7:48:07 PM File: boost_iostreams-mgw-d-1_33_1.dll 922 KB 4/3/2007 7:48:04 PM File: boost_iostreams-mgw-d-1_33_1.lib 72 KB 4/3/2007 7:48:04 PM File: boost_iostreams-mgw-d.lib 72 KB 4/3/2007 7:48:04 PM File: boost_iostreams-mgw.lib 41 KB 4/3/2007 7:48:07 PM File: boost_program_options-mgw-1_33_1.dll 451 KB 4/3/2007 7:49:26 PM File: boost_program_options-mgw-1_33_1.lib 291 KB 4/3/2007 7:49:26 PM File: boost_program_options-mgw-d-1_33_1.dll 3501 KB 4/3/2007 7:49:02 PM File: boost_program_options-mgw-d-1_33_1.lib 1024 KB 4/3/2007 7:49:02 PM File: boost_program_options-mgw-d.lib 1024 KB 4/3/2007 7:49:02 PM File: boost_program_options-mgw.lib 291 KB 4/3/2007 7:49:26 PM File: boost_regex-mgw-1_33_1.dll 666 KB 4/3/2007 7:50:31 PM File: boost_regex-mgw-1_33_1.lib 626 KB 4/3/2007 7:50:31 PM File: boost_regex-mgw-d-1_33_1.dll 3962 KB 4/3/2007 7:49:46 PM File: boost_regex-mgw-d-1_33_1.lib 2155 KB 4/3/2007 7:49:45 PM File: boost_regex-mgw-d.lib 2155 KB 4/3/2007 7:49:45 PM File: boost_regex-mgw.lib 626 KB 4/3/2007 7:50:31 PM File: boost_thread-mgw-mt-1_33_1.dll 296 KB 4/3/2007 7:56:38 PM File: boost_thread-mgw-mt-1_33_1.lib 155 KB 4/3/2007 7:56:38 PM File: boost_thread-mgw-mt-d-1_33_1.dll 4192 KB 4/3/2007 7:56:22 PM File: boost_thread-mgw-mt-d-1_33_1.lib 405 KB 4/3/2007 7:56:22 PM File: boost_thread-mgw-mt-d.lib 405 KB 4/3/2007 7:56:22 PM File: boost_thread-mgw-mt.lib 155 KB 4/3/2007 7:56:38 PM File: libboost_date_time-mgw-1_33_1.lib 71 KB 4/3/2007 7:47:21 PM File: libboost_date_time-mgw-d-1_33_1.lib 1293 KB 4/3/2007 7:47:17 PM File: libboost_date_time-mgw-d.lib 1293 KB 4/3/2007 7:47:17 PM File: libboost_date_time-mgw.lib 71 KB 4/3/2007 7:47:21 PM File: libboost_filesystem-mgw-1_33_1.lib 123 KB 4/3/2007 7:47:37 PM File: libboost_filesystem-mgw-d-1_33_1.lib 4180 KB 4/3/2007 7:47:28 PM File: libboost_filesystem-mgw-d.lib 4180 KB 4/3/2007 7:47:28 PM File: libboost_filesystem-mgw.lib 123 KB 4/3/2007 7:47:37 PM File: libboost_iostreams-mgw-1_33_1.lib 39 KB 4/3/2007 7:48:00 PM File: libboost_iostreams-mgw-d-1_33_1.lib 1675 KB 4/3/2007 7:47:57 PM File: libboost_iostreams-mgw-d.lib 1675 KB 4/3/2007 7:47:57 PM File: libboost_iostreams-mgw.lib 39 KB 4/3/2007 7:48:00 PM File: libboost_prg_exec_monitor-mgw-1_33_1.lib 38 KB 4/3/2007 7:54:38 PM File: libboost_prg_exec_monitor-mgw-d-1_33_1.lib 376 KB 4/3/2007 7:54:37 PM File: libboost_prg_exec_monitor-mgw-d.lib 376 KB 4/3/2007 7:54:37 PM File: libboost_prg_exec_monitor-mgw.lib 38 KB 4/3/2007 7:54:38 PM File: libboost_program_options-mgw-1_33_1.lib 432 KB 4/3/2007 7:48:46 PM File: libboost_program_options-mgw-d-1_33_1.lib 5976 KB 4/3/2007 7:48:23 PM File: libboost_program_options-mgw-d.lib 5976 KB 4/3/2007 7:48:23 PM File: libboost_program_options-mgw.lib 432 KB 4/3/2007 7:48:46 PM File: libboost_regex-mgw-1_33_1.lib 1135 KB 4/3/2007 7:51:37 PM File: libboost_regex-mgw-d-1_33_1.lib 6656 KB 4/3/2007 7:50:50 PM File: libboost_regex-mgw-d.lib 6656 KB 4/3/2007 7:50:50 PM File: libboost_regex-mgw.lib 1135 KB 4/3/2007 7:51:37 PM File: libboost_serialization-mgw-1_33_1.lib 1044 KB 4/3/2007 7:52:48 PM File: libboost_serialization-mgw-d-1_33_1.lib 21728 KB 4/3/2007 7:52:11 PM File: libboost_serialization-mgw-d.lib 21728 KB 4/3/2007 7:52:11 PM File: libboost_serialization-mgw.lib 1044 KB 4/3/2007 7:52:48 PM File: libboost_signals-mgw-1_33_1.lib 136 KB 4/3/2007 7:54:35 PM File: libboost_signals-mgw-d-1_33_1.lib 2864 KB 4/3/2007 7:54:26 PM File: libboost_signals-mgw-d.lib 2864 KB 4/3/2007 7:54:26 PM File: libboost_signals-mgw.lib 136 KB 4/3/2007 7:54:35 PM File: libboost_test_exec_monitor-mgw-1_33_1.lib 472 KB 4/3/2007 7:55:23 PM File: libboost_test_exec_monitor-mgw-d-1_33_1.lib 6663 KB 4/3/2007 7:54:58 PM File: libboost_test_exec_monitor-mgw-d.lib 6663 KB 4/3/2007 7:54:58 PM File: libboost_test_exec_monitor-mgw.lib 472 KB 4/3/2007 7:55:23 PM File: libboost_thread-mgw-mt-1_33_1.lib 113 KB 4/3/2007 7:57:08 PM File: libboost_thread-mgw-mt-d-1_33_1.lib 7994 KB 4/3/2007 7:56:53 PM File: libboost_thread-mgw-mt-d.lib 7994 KB 4/3/2007 7:56:53 PM File: libboost_thread-mgw-mt.lib 113 KB 4/3/2007 7:57:08 PM File: libboost_unit_test_framework-mgw-1_33_1.lib 452 KB 4/3/2007 7:56:05 PM File: libboost_unit_test_framework-mgw-d-1_33_1.lib 6302 KB 4/3/2007 7:55:42 PM File: libboost_unit_test_framework-mgw-d.lib 6302 KB 4/3/2007 7:55:42 PM File: libboost_unit_test_framework-mgw.lib 452 KB 4/3/2007 7:56:05 PM File: libboost_wave-mgw-1_33_1.lib 2868 KB 4/3/2007 7:59:48 PM File: libboost_wave-mgw-d-1_33_1.lib 88490 KB 4/3/2007 7:58:13 PM File: libboost_wave-mgw-d.lib 88490 KB 4/3/2007 7:58:13 PM File: libboost_wave-mgw.lib 2868 KB 4/3/2007 7:59:48 PM looks good, but install.err has many "undefined reference" errors and install.log has "failed gcc-Link-action" lines...last 3 lines from install.log: ...failed updating 12 targets... ...skipped 18 targets... ...updated 3845 targets... some lines from install.err: bin\boost\libs\filesystem\build\boost_filesystem.dll\mingw\debug\operations_posix_windows.obj(.text+0x7ac): In function `ZN5boost10filesystem6detail12dir_itr_initERNS_10shared_ptrINS1_11dir_itr_impEEERKNS0_4pathE': D:/devel/boost-1_33_1/libs/filesystem/build/../src/operations_posix_windows.cpp:308: undefined reference to `boost::filesystem::detail::system_error_code()' is it normal? must i do something? p.s. sorry for my bad english :)

1 0

where can I get a copy of Quantitave Units
by Polder, Matthew J 03 Apr '07

03 Apr '07

Hi, I noticed a new library, Quantitave Unit, is being reviewed. Where can I get a copy of the library? I'd like to compare it to Quan which was reviewed a while ago and see it if suits my needs better. thanks, matthew

2 1

Re: [Boost-users] [Serialization] issue withportable_binary_oarchive
by Pfligersdorffer, Christian 03 Apr '07

03 Apr '07

boost-users-bounces(a)lists.boost.org wrote: > Hi, > I have switched all the 0 pointer cases to use some Null object. > Now everything works fine. > Thanks very much for your help. > > One last (I hope) question: > > The compilation of this archive produce some compilation > warnings, how can I avoid it ? > > Thanks again, > Dan Leibovich Dear Dan & Robert, I read this thread with very much interest since I want to use the portable binary archive too. Could you please share your experience and especially the code of the version that actually works? Did you also add code to treat floating point types? Yours sincerely, -- DI Christian Pfligersdorffer Software Engineering EOS GmbH

4 4

[serialization] Serialize function pointers
by Sohail Somani 03 Apr '07

03 Apr '07

Hi, Is it possible to serialize function pointers? I'm trying to serialize this guy: struct f { typedef void(*function_t)(); function_t the_ptr_; }; Thanks, Sohail

2 5

[wave::token_type] Checking if the token_type instance is empty
by Ovanes Markarian 03 Apr '07

03 Apr '07

Hello Hartmut, I have a question and may be small interface change to the token_type. Currently there is no "legal" way to check if a token type instance is empty, than using token_id operator and comparing it with T_EOI (which is not really documented, available in the header and default ctor of impl::token_data only). Why did I need it: I have a state machine class which preserves the look ahead. Now when I construct the state machine, the look ahead is default constructed. In particular states I have to distinguish if there is look ahead available or not and take some actions accordingly. Now I would need to rely on the following comparison: BASEID_FROM_TOKEN(T_EOI)==tok.operator token_id(); Instead it would be more flexible to write tok.empty(). I am not sure if this convinces you, but at least T_EOI should be documented (I am still using old documentation 1.33.1). The docs should also state that empty token has this type. On the other hand I don't know where else T_EOI is used and how to distinguishe this case then. I would appreciate the empty member function, which can greatly ease the life ;) With Kind Regards, Ovanes Markarian

2 2

[guid] create_random_based and create_name_based
by Christian Henning 03 Apr '07

03 Apr '07

Hi there, I just downloaded guid_v6 from the vault. Seems that there is mix up in both create functions. The random version is calling create_name_based and vice versa. Reagrds, Christian

2 1

identify boost thread
by Goroll, Torsten 03 Apr '07

03 Apr '07

Hi, I'm looking for a way, to identify a boost::thread from inside the thread. The background is, that I want to log into a global logger, which has to know from which thread the message was sent. I have thought at using the pointer of the class as an identifier, but that won't work if two threads are from the same class. Maybe it is possible to save a pointer to the member methods??? Kind Regards Torsten

2 1

string_algo no erase_if
by gast128 03 Apr '07

03 Apr '07

Dear all, I was trying to remove (replace, find...) characters from a string through the handy classification class. Unfortunately there is no erase_if fct which can be fed with this predicate functions. There is a trim_if function, but this trims only. It would be handy if all these '_if' variants where implemented for find, repalce and erase. Also the 'any' (or contains_if with predicate) is something we need regularly. But maybe this functionality can be achieved in another way. Anyone an idea? Remove_if/erase combination does of course work, but these are quite cumbersome. Wkr, me

1 1

checked_delete, shared_ptr, and incomplete types...
by Graham Reitz 03 Apr '07

03 Apr '07

I was toying with the example in "Beyond the C++ Standard Library An Introduction to Boost", Library 3:Utility. Specifically, the section on using checked_delete(). On page 85 it mentions that, "It can be easy to get into this kind of trouble with smart pointers". I tried the example presented with raw and shared_ptr. The destructor doesn't get called with the raw pointer example (the undefined behavior) but when using shared_ptr with the same example the destructor gets called. What was the author (Bjorn Karlsson) referring to when he mentioned this can be an issue with smart pointers? Thanks, Graham Code: // to_be_deleted.h #include <iostream> class to_be_deleted { public: ~to_be_deleted() { std::cout << "Help me get called.\n"; } }; // deleter.h #include "boost/shared_ptr.hpp" class to_be_deleted; using namespace boost; class deleter { public: //void delete_it(shared_ptr<to_be_deleted> p); void delete_it(to_be_deleted* p); }; // deleter.cpp #include "deleter.h" #include "boost/checked_delete.hpp" void deleter::delete_it(to_be_deleted* p) //void deleter::delete_it(shared_ptr<to_be_deleted> p) { delete p; //boost::checked_delete(p); } // main.cpp #include "boost/shared_ptr.hpp" #include "deleter.h" #include "to_be_deleted.h" using namespace boost; // Forces the type being deleted to be known at compile time int main(int argc, char* argv[]) { { //shared_ptr<to_be_deleted> p(new to_be_deleted()); to_be_deleted* p = new to_be_deleted; deleter d; d.delete_it(p); } return 0; }

1 0

Boost Con
by Robert Marion 02 Apr '07

02 Apr '07

So, attending the Boost Con in May is no trivial task. Aside from the $599 (early bird) conference cost and the hotel, you have to fly to Denver and then drive about 200 miles to Aspen -- because the airport in Aspen is closed in May (no kidding). I'm tempted to go just because the place will be nearly uninhabited. Dudes, what gives? Robert

4 3

Tokenizer - remainder of parsed string
by Gleske, Paul GOSS 02 Apr '07

02 Apr '07

I have a situation where I want to parse off the first few fields of a message and then return the rest of the message. The message format is: <STX>field1,field2,field3,field4,field5,field6,field7,field8,field9<ETX> What I want to do is pull off the first 5 fields and then get at the remainder of the string (fields 6-9) as a single string. I've pieced together something that mostly works It leaves me with a remainder of ",field6,field7,field8,field9". Note the leading comma. ----------------- std::string str = "\x02" "field1,field2,field3,field4,field5,field6,field7,field8,field9" "\x03"; typedef boost::tokenizer<boost::char_separator<char> > tokenizer; boost::char_separator<char> sep(",\x02\x03"); tokenizer tokens(str, sep); tokenizer::iterator tok_iter = tokens.begin(); for (int i=1; tok_iter != tokens.end(); tok_iter++) { std::cout << "<" << *tok_iter << "> "; ++i; if (i > 5) break; } std::cout << "\n"; std::cout << "current token <" << tok_iter.current_token() << ">"; std::cout << "\n"; boost::char_separator<char> sep2("\x03"); tokenizer remainder(tok_iter.base(), str.end(), sep2); std::cout << "<" << *remainder.begin() << ">" << "\n"; ----------------- What I don't understand is what the tok_iter.base() returns, or how the tokenizer constructor that uses it works (see the line for remainder). How can that constructer take tok_iter.base() and str.end()? Is the string iterator converted? Is there a better way to get the remainder of the tokenized string? I would very much like to not have the leading comma on the remainder. I know I can use substr on the remainder, but it seems that there should be a better way. Thanks, -pkg -------------------------------------------------------- Goss ... Innovation for Business NOTICE: This e-mail and any attachment(s) may contain confidential and proprietary information of Goss International Corporation and/or its subsidiaries and may be legally privileged. This e-mail is intended solely for the addressee. If you are not the addressee, dissemination, copying or other use of this e-mail or any of its content is strictly prohibited and may be unlawful. If you are not the intended recipient please inform the sender immediately and destroy the e-mail and any copies. All liability for viruses is excluded to the fullest extent permitted by law. Any views expressed in this message are those of the individual sender. No contract may be construed by this e-mail.

1 0

Boost and WXwidgets
by Lucas de Sales Joner 02 Apr '07

02 Apr '07

Hi, I have a program that use boost library (matrix, vector and others) and return a vector and I need plot this vector with wxwidgets. The problem is that I can´t use wxwidgets with boost library because return a lot of problems. My plot program work well, but when I use "include<boost/numeric/ublas/matrix.hpp>" in that program, return this errors: C:\Arquivos de programas\Dev-Cpp\include\boost\numeric\ublas\storage.hpp:25, from C:\Arquivos de programas\Dev-Cpp\include\boost\numeric\ublas\vector.hpp In file included from C:/Arquivos de programas/Dev-Cpp/include/boost/numeric/ublas/storage.hpp:25, from C:/Arquivos de programas/Dev-Cpp/include/boost/numeric/ublas/vector.hpp C:\Arquivos de programas\Dev-Cpp\include\boost\numeric\ublas\exception.hpp In member function `void boost::numeric::ublas::bad_argument::raise()': C:\Arquivos de programas\Dev-Cpp\include\boost\numeric\ublas\exception.hpp exception handling disabled, use -fexceptions to enable How can I use wxwidgets and boost library? Someone know other way to plot points in using boost? LUCAS DE SALES JONER Engenharia de Controle e Automação Industrial - UFSC Laboratório de Robotica - UFSC ionner_rs(a)hotmail.com ionner.rs(a)gmail.com (48) 9148 4732 _________________________________________________________________ Veja só alguns dos novos serviços online no Windows Live Ideas — são tão novos que ainda não foram disponibilizados oficialmente. http://ideas.live.com

2 1

Iostreams - GZip problem
by Jabin Reinhold 02 Apr '07

02 Apr '07

Im trying to use the iostreams gzip compression on xml serializations produced using boost::serialization and Im having a bit of trouble with it. The variable to be serialized is savedClass. As shown below, I create the serialization, save to a file with gzip_compressor, then read it from the file with gzip_decompressor. My issue is that at the end of the code, test1.xml(~10k) and test2.xml(~12k) are not identical. Test2.xml has some extraneous characters added to the end (~2k worth). I assume these are leftovers from a memcopy somewhere, but Im not sure why. I have the same effect when I use zlib_compressor as well. What is wrong with my usage of the library(s)? //////////////////////////////////////////////////////////////// std::strstream sStream; if(true) { //Scope used to ensure that the archive is fully processed boost::archive::xml_oarchive oArchive(sStream); oArchive << BOOST_SERIALIZATION_NVP(savedClass); } std::ofstream oStreamXML1( "c:\\test1.xml", std::ios::out ); oStreamXML1 << sStream.str(); if(true) { //Scope used to ensure that the archive is fully processed std::ofstream file("c:\\test.gz", std::ios_base::out | std::ios_base::binary); boost::iostreams::filtering_streambuf<boost::iostreams::output> outStream; outStream.push(boost::iostreams::gzip_compressor()); outStream.push(file); boost::iostreams::copy(sStream, outStream); } std::strstream sStream2; if(true) { //Scope used to ensure that the archive is fully processed std::ifstream file2("c:\\test.gz", std::ios_base::in | std::ios_base::binary); boost::iostreams::filtering_streambuf<boost::iostreams::input> inStream; inStream.push(boost::iostreams::gzip_decompressor()); inStream.push(file2); boost::iostreams::copy(inStream, sStream2); } std::ofstream oStreamXML2( "c:\\test2.xml", std::ios::out ); oStreamXML2 << sStream2.str(); ////////////////////////////////////////////////////////////////

2 2

Intrusive library review results: library accepted
by "JOAQUIN LOPEZ MU?Z" 02 Apr '07

02 Apr '07

I'm pleased to announce that Ion Gaztañaga's Intrusive library has been accepted into Boost. Prior to its inclusion in Boost, the author is encouraged to address several issues raised during the review, a summary of which is given below. A total of 14 full reviews were received, all of them positive. Additionally, other members did not submit full reviews but expressed their support for the library. One Boost member raised some concerns about the usefulness of the library; I hope these concerns have been satisfactorily addressed by those review participants who explained their current and potential usage scenarios for Boost.Intrusive. This has shown that more movitational material need to be provided in the documentation introduction and in the form of full-fledged examples. Thank you to Ion Gaztañaga for all the hard work involved in creating a Boost library, to Olaf Krzikalla, who wrote the first versions of this piece of work, and to all the participants in the review. The list of issues to be addressed follows. Feel free to comment if you detect some error or omission from my part. List of issues to be addressed prior to inclusion of the Intrusive library into Boost: * Documentation - Provide a motivating introduction about usefulness of Boost.Intrusive. - Add some hello world motivating examples. - Class names linked to their section in the reference (except in code due to Quickbook limitations). - Document iterator and const_iterator as part of the container interfaces. - Add overview of iterator validity rules. - Document usage before concepts. - Improve concepts part. - Provide container concepts à la STL. - Add performance section. - Add quick guide to docs. - Make the tests more comprehensive. - Add examples section. - State clearly the purpose of the lib in the introduction. - Add more examples using the different hooks. - State in docs the possibility that tags be incomplete types. - State in docs the fact that Boost.Intrusive does not support shared_ptr's. - Document the fact that member hooks rely on non-standard implementation techniques. * Naming - Change Destroyer to a more suitable name (e.g. Sink or Disposer), rename member functions accordingly. - Rename current() as iterator_to(). - Rename [s]list_algorithms as circular_[s]list_algorithms. - Drop the 'i' prefix from the names of containers. - Rename linked() as is_linked(). - Rename assign_and_destroy() as destroy_and_assign(). * Interface improvements - Study ways to simplify the usage syntax of hooks. - Add a default value to Tag. - Member hooks shouldn't be parameterized on the host class type. - Make hooks assignment operator a no-op. - bucket_size() y bucket() should be const. - Provide cbegin(), cend() etc. - Add *_fwd.hpp headers. - Fuse autolink and regular/safe hooks into one class whose second parameter is a category class. * Implementation improvements - Iterators to be implemented with iterator_facade. - Use Boost.Concept for concept checking if compilation times are not severely affected. - Extend bucket primes table to 64 bits. - Use template trick to avoid direct use std::size_t in template parms of containers, thus pulling the std namespace in via ADL. - Use Watanabe's version of swap_nodes() for ilist. - Use insert_after() in clone_from(). - Reimplement clone_from() to not delete partially constructed data on exception. - Investigate bug with member hooks and virtual inheritance. * Extensions and issues to be considered in the future - Order-statistics tree. - Study other libraries for ideas: DOL, PTL, jjLib. - Study feasibility of implementing a "destroy multihooked element when completely unlinked" mode. - Investigate use of two-way pointers with Boost.Intrusive. - Consider a shift() member function for lists and slists. - Additional slist-like container with a pointer-to-last member to make swapping constant time. The Review Manager, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Typetraits for decomposing member function pointers?
by Tom Bachmann 02 Apr '07

02 Apr '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, is there a way to get more information about a member function pointer, using type traits, than is_member_function_pointer<T>::value? I'm looking for information about e.g. the constness and function_traits-like information. - -- - -ness- -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) iD8DBQFGBs++vD/ijq9JWhsRApJNAJ9nbbZnRMnTMBi0l09yqBaCIiYGmgCfTjRO I12viJTyF3sUp0sICPR/nDg= =ym+h -----END PGP SIGNATURE-----

2 1

[mpl] find_all type vectors in a type matrix that match a predicate.
by Christian Henning 02 Apr '07

02 Apr '07

Hi there, is it possible to find all type vectors in a type matrix ( 2D type vector ) that match a predicate? In the end I would like to have them in another type matrix. Can somebody point out how I would put together such a metafunction? I'm not sure if the mpl lib supports my feature request. Consider the following code: #include "boost/mpl/vector.hpp" #include <boost/mpl/find_if.hpp> #include <boost/mpl/at.hpp> using namespace std; using namespace boost; namespace fields { struct id {}; struct name {}; struct address {}; struct birthday {}; } namespace tags { struct primary {}; struct foreign {}; struct no_key {}; } typedef mpl::vector<fields::id , tags::primary> id_field_t; typedef mpl::vector<fields::name , tags::foreign> name_field_t; typedef mpl::vector<fields::address , tags::foreign> address_field_t; typedef mpl::vector<fields::birthday, tags::no_key> birthday_field_t; typedef mpl::vector< id_field_t , name_field_t , address_field_t , birthday_field_t > table; // aggregate all foreign keys in the following vector typedef mpl::vector0<> foreign_keys; /// ??? metafunction for aggregating all foreign keys ??? int main() { return 0; } BTW, I'm not particular interested in a certain order of the aggregated type vectors. Reagrds, Christian

3 7

newbie's questions about multi_index
by Guillaume Lazzara 02 Apr '07

02 Apr '07

Hi, I'm currently using multi_index and I have few questions: - I have a multi_index with composed keys, sometimes I need to get a range of items, iterate over them and modify their key. How can I do this properly? sample code: EquivSet::iterator tmp; std::pair<EquivSet::iterator, EquivSet::iterator> es = contains.equal_range(*it); for (EquivSet::iterator it_equiv = es.first; it_equiv != es.second;) if (!X[it_equiv->id]) { tmp = it_equiv++; contains.modify_key(tmp, update_equiv(nbEns)); } else it_equiv++; In this example, the second iterator in the pair, normaly used as end iterator, can be changed and, sometimes, the loop iterates beyond the latter. - If I can choose between a std::set and a multi_index used as a set, which one should I use? Thank you very much for your answers! -- Guillaume Lazzara Epita CSI 2008

2 2

[fusion] error in example code
by Christian Henning 02 Apr '07

02 Apr '07

Hi there, the example code of the list sequence doesn't compile. list<int, float> l(12, 5.5f); std::cout << at<0>(l) << std::endl; std::cout << at<1>(l) << std::endl; It should be: list<int, float> l(12, 5.5f); std::cout << at<mpl::int_<0> >(l) << std::endl; std::cout << at<mpl::int_<1> >(l) << std::endl; I'm using MSVC 7.1. Regards, Christian

2 1

Which is preferred? Static assertions with type traits or concept_check?
by Benjamin Lau 02 Apr '07

02 Apr '07

Hi all, I'm writing a template class and I have several requirements on the type parameters. A lot of it has to do with the inter-convertibility of the types. I have 2 options to choose from as to how I can check for these convertibility requirements: static assertions with the type traits selector is_convertible, or using concept_check to check if the assignment operation is defined for the types. Even though the former leads to shorter code, the latter works just as well as I already have concepts modeled for these types, so I could just dump the inter-convertibility checks inside as well without much hassle. In summary, I either choose this: BOOST_STATIC_ASSERT((boost::is_convertible<T1, T2>::value)); or this: template<class T1, class T2> class Concept { public: void constraints() { // insert other constraints a = b; b = a; } T1 a; T2 b; }; Thanks a lot, and have a good day Benjamin Lau

2 1

[mpl] erase_key confusion
by Scott Meyers 02 Apr '07

02 Apr '07

I expect the following code to compile cleanly. It does not. #include <boost/mpl/set.hpp> #include <boost/mpl/equal.hpp> #include <boost/mpl/erase_key.hpp> namespace mpl = boost::mpl; using mpl::_1; using mpl::_2; struct A {}; struct B {}; typedef mpl::set<A, B> set1; typedef mpl::set<B, A> set2; BOOST_MPL_ASSERT(( mpl::equal< mpl::erase_key<set1, A>::type, mpl::erase_key<set2, A>::type > )); I'm simply trying to assert that the sets {A,B} and {B,A} have the same elements after A has been removed from both. What am I doing wrong? Thanks, Scott

4 10

[threads] Passing Data and Thread Joining
by Sami Lakka 02 Apr '07

02 Apr '07

I have an method in my application which is called by a third-party app by every 1 second. In my method I have to do some intensive math operations as well as persist data. Because I have to do the math operations in the one second period I'm creating a thread that will handle the file operations (as there are no hurry for these). My question is how should I pass the data to my file saving thread? The data is in shared_array<double> so should the data be passed by value or by reference? My code looks like as follows: void workerMethod() { // do some mathematics shared_array<double> data = .... thread saveThread(bind(&DataFileSaver::saveInThread, dataFileSaver,data)); // Thread is not joined } I think that if I pass by reference the data variable can go out of scope and my thread can end up saving garbage. Am I correct? My second question is that in my saveInThread method I'm using scoped_lock to guard the file operations. When I run some unit tests for this method I'm experiencing crashes and memory leaks. This is probably because I'm not joining the started thread in the workerMethod but in my unit tests I use sleep() enough so that the threads should have performed the operations. What am I doing wrong?

1 0

[graph] adjacency_list with edges in mulitsetS does not seem to sort
by Carsten Scholtes 02 Apr '07

02 Apr '07

Hello! I'm trying to use boost::graph's adjacency_list<listS, multisetS,...>. The documentation ( boost_1_33_1/libs/graph/doc/adjacency_list.html ) states for the function edge_range(): > This function only works when the OutEdgeList for the adjacency_list > is a container that sorts the out edges according to target vertex, > and allows for parallel edges. The multisetS selector chooses > such a container. Attached you find a small program demonstrating a case where edges do not seem to get sorted accordingly. The last comment in the program contains a sample output. * The line below "All edges" shows the sequence of all edges. It does not seem to be sorted in the specified way. Probably as a consequnce of this, edge_range() does not work as expected: * The last line of the output is generated by using edge_range(). It should output edges from node 1 to node 0. There is only one such edge. Instead of that, edges (1,2) and (1,0) are returned. Am I using the interface in a wrong way or is there an error in the implementation of adjacency_list<>? Thank you in advance for any comment or advice. Carsten Scholtes

2 2

[serialization] abstract templatized base class
by Ruediger Berlich 02 Apr '07

02 Apr '07

Hi again, apologies for the frequent questions. Here is another problem I've run into. I think I've found a solution, but would like to cross-check whether I'm right. I have a number of templatized base classes, that contain purely virtual member functions. As per the Boost.Serialization documentation, purely virtual classes should be labelled as "abstract". >From the documentation and the header file "is_abstract.hpp" it appears as if using the macro BOOST_IS_ABSTRACT would not work (indeed it produces lots of error messages) for templatized classes, but that I should instead add the following to the header: namespace boost { namespace serialization { template<class T> struct is_abstract<myClass<T> > { typedef mpl::bool_<true> type; BOOST_STATIC_CONSTANT(bool, value = true); }; }} Indeed this seems to work. It appears to me as if another solution might be to use the original macro in those files where the templatized classes are first instantiated (i.e. "filled" with a type). Please note, though, that they are base-classes for some other non-abstract classes, so that I'm not sure this would work. Anyway, the idea would be something along the lines of // [...] // myClass<myType> is no longer a template BOOST_IS_ABSTRACT(myClass<myType>) class derived :public myClass<myType> { ...}; Would these two options cause any problems ? Thanks and have a good day, Ruediger

2 2

[lexical-cast] double not converted as it is to a string
by Digvijoy Chatterjee 01 Apr '07

01 Apr '07

Hello, I am seeing this behavious with boost::lexical_cast<std::string>(double) occasionaly numbers like 76.32 are being converted to strings of the form 76.319999999 The expected behavior is seen for almost all doubles except for a few which are reproducible e.g. 76.32.. here is a simple program, int main() { double d=76.32; std::string s = boost::lexical_cast<std::string>(d); cout << s << endl; } output 76.319999999... a) am i doing something wrong ?? b) if this is not wrong s this standard behavior ?? Thanks Digz

3 3

Building for cygwin on Windows?
by John Harper 01 Apr '07

01 Apr '07

I can't get the boost libraries to build correctly using Cygwin and GCC on Windows XP. Boost seems determined to build for some kind of native Windows environment. I'm trying: bjam "-sTOOLS=gcc" "--prefix=/usr/local" and it complains "wide i/o not supported on this platform". If I omit --prefix it puts the libraries in the Windows file system under C:\Boost, but even if I copy them to somewhere under cygwin and point GCC at them, it still doesn't find them. SUrely I'm not the first person to want to do this? What is the magic formula? Thanks...

2 1

[serialization] free load/save
by Ruediger Berlich 01 Apr '07

01 Apr '07

Dear all, I'd like to serialize a number of classes using the free-standing version of the serialize function. As I do not want to access internals of the classes directly, I have to work with set/get functions, which in turn implies having to write load/save functions. This seems to work for simple types, like in the following example. But will it circumvent any internal mechanisms of Boost.Serialization , if I do not give the library direct access to class data ? Will this work for complex types, e.g. vectors of shared_ptr objects ? /*************************************************************************/ class base{ public: base(void){ setSecret(1); } base(int val){ setSecret(val); } virtual ~base(){ /* nothing */ } virtual int getSecret(void) const{ return secret; } virtual void printInfo(void) = 0; void setSecret(int val){ secret = val; } private: int secret; }; BOOST_IS_ABSTRACT(base); namespace boost { namespace serialization { template<class Archive> void save(Archive & ar, const base & t, unsigned int version) { int secret = t.getSecret(); ar & make_nvp("secret", secret); } template<class Archive> void load(Archive & ar, base & t, unsigned int version) { int secret; ar & make_nvp("secret", secret); t.setSecret(secret); } template<class Archive> inline void serialize(Archive & ar, base & t; const unsigned int version) { split_free(ar, t, version); } } } /*************************************************************************/ Thanks and have a good day, Ruediger

2 2

[serialization / shared_ptr] Problem to serialize a shared_ptr
by Ruediger Berlich 31 Mar '07

31 Mar '07

Hi there, I am relatively new to Boost in general and serialization in particular. Nevertheless, having spent the day trying to find out how to serialize a shared_ptr, I feel it is time to search for some external advice. So any help is appreciated! Here is the (hopefully) simple program: /************************************************************/ #include <typeinfo> #include <fstream> #include <iostream> #include <sstream> #include <vector> #include <boost/shared_ptr.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/nvp.hpp> #include <boost/serialization/vector.hpp> // #include <boost/serialization/shared_ptr_132.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/base_object.hpp> #include <boost/serialization/utility.hpp> #include <boost/serialization/export.hpp> #include <boost/serialization/tracking.hpp> using namespace std; using namespace boost; using namespace boost::serialization; class ptr{ friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version){ using boost::serialization::make_nvp; ar & make_nvp("p",p); } shared_ptr<int> p; public: ptr(){ shared_ptr<int> dummy(new int(6)); p = dummy; } void printInfo(void){ cout << "*(p.get()) = " << *(p.get()) << endl; } }; main() { ostringstream ofs; ptr myp; { boost::archive::xml_oarchive oa(ofs); oa << make_nvp("myp",myp); } cout << ofs.str() << endl; ptr newmyp; { istringstream ifs; ifs.str(ofs.str()); boost::archive::xml_iarchive ia(ifs); ia >> make_nvp("myp",newmyp); } newmyp.printInfo(); return 0; } /************************************************************/ When I try to compile this (OpenSUSE 10.2, g++ 4.1.2, Boost 1.33.1), I get a LONG list of error messages, of which I will only quote the first few lines only: /************************************************************/ $ g++ -o test14 -lboost_serialization test14.cc /usr/include/boost/serialization/shared_ptr.hpp: In function ‘void boost::serialization::serialize(Archive&, boost::shared_ptr<U>&, unsigned int) [with Archive = boost::archive::xml_iarchive, T = int]’: /usr/include/boost/serialization/serialization.hpp:140: instantiated from ‘void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::xml_iarchive, T = boost::shared_ptr<int>]’ /usr/include/boost/archive/detail/iserializer.hpp:160: instantiated from ‘void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::archive::xml_iarchive, T = boost::shared_ptr<int>]’ test14.cc:73: instantiated from here /usr/include/boost/serialization/shared_ptr.hpp:235: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ [...] /************************************************************/ The "STATIC_ASSERTION_FAILURE appears quite often in the error messages. BTW, the program runs nicely, if I include a simple int as "data load" in this class (and modify the program to accept an int instead of a shared_ptr, of course). I'm therefore confident that most of the logic is just fine. Any help is appreciated! Best Regards, Ruediger

2 3

stream / container / shared_ptr
by JD 31 Mar '07

31 Mar '07

Hello, Anyone has an idea why this code crashes: // snippet on #include <list> #include <string> #include <iostream> #include <boost/shared_ptr.hpp> struct null_deleter { void operator()(void const *) const {} }; int main() { std::list<boost::shared_ptr<std::ostream> > l; boost::shared_ptr<std::ostream> p(&std::cout, null_deleter()); *p << "on the shared pointer" << std::endl; l.push_back(p); std::list<boost::shared_ptr<std::ostream> >::iterator it = l.begin(); std::cout << "before loop" << std::endl; while (it++ != l.end()) { boost::shared_ptr<std::ostream> p2 = *it; *p2 << "test" << std::endl; // crash here } return 0; } // snippet off // output on on the shared pointer before loop segmentation fault // output off It crashes on: std::ostream::sentry::sentry () from /usr/lib/libstdc++.so.6 Thanks.

2 1

statechart events and operator=
by Federico J. Fernández 31 Mar '07

31 Mar '07

As you may know, I'm trying to use boost::statechart::events with boost::variant, but I have the following problem. When I try to assign a statechart::event to a variant<events...> I need to define operator= for my class that is derived from the events.. and then when I call the statechart::event::operator= the compiler throws the following error: /usr/include/boost/statechart/detail/rtti_policy.hpp: In member function 'boost::statechart::detail::rtti_policy::rtti_base_type<boost::statechart::detail::counted_base<true> >& boost::statechart::detail::rtti_policy::rtti_base_type<boost::statechart::detail::counted_base<true> >::operator=(const boost::statechart::detail::rtti_policy::rtti_base_type<boost::statechart::detail::counted_base<true> >&)': /usr/include/boost/statechart/detail/rtti_policy.hpp:94: error: non-static reference member 'const boost::statechart::detail::id_provider& boost::statechart::detail::rtti_policy::rtti_base_type<boost::statechart::detail::counted_base<true> >::idProvider_', can't use default assignment operator /usr/include/boost/statechart/event_base.hpp: In member function 'boost::statechart::event_base& boost::statechart::event_base::operator=(const boost::statechart::event_base&)': /usr/include/boost/statechart/event_base.hpp:51: note: synthesized method 'boost::statechart::detail::rtti_policy::rtti_base_type<boost::statechart::detail::counted_base<true> >& boost::statechart::detail::rtti_policy::rtti_base_type<boost::statechart::detail::counted_base<true> >::operator=(const boost::statechart::detail::rtti_policy::rtti_base_type<boost::statechart::detail::counted_base<true> >&)' first required here /usr/include/boost/statechart/detail/rtti_policy.hpp: In member function 'boost::statechart::detail::rtti_policy::rtti_derived_type<evt_enviar_telegrama, boost::statechart::event_base>& boost::statechart::detail::rtti_policy::rtti_derived_type<evt_enviar_telegrama, boost::statechart::event_base>::operator=(const boost::statechart::detail::rtti_policy::rtti_derived_type<evt_enviar_telegrama, boost::statechart::event_base>&)': /usr/include/boost/statechart/detail/rtti_policy.hpp:149: note: synthesized method 'boost::statechart::event_base& boost::statechart::event_base::operator=(const boost::statechart::event_base&)' first required here /usr/include/boost/statechart/event.hpp: In member function 'boost::statechart::event<evt_enviar_telegrama, std::allocator<void> >& boost::statechart::event<evt_enviar_telegrama, std::allocator<void> >::operator=(const boost::statechart::event<evt_enviar_telegrama, std::allocator<void> >&)': /usr/include/boost/statechart/event.hpp:32: note: synthesized method 'boost::statechart::detail::rtti_policy::rtti_derived_type<evt_enviar_telegrama, boost::statechart::event_base>& boost::statechart::detail::rtti_policy::rtti_derived_type<evt_enviar_telegrama, boost::statechart::event_base>::operator=(const boost::statechart::detail::rtti_policy::rtti_derived_type<evt_enviar_telegrama, boost::statechart::event_base>&)' first required here evento.h: In member function 'evt_enviar_telegrama& evt_enviar_telegrama::operator=(const evt_enviar_telegrama&)': evento.h:64: note: synthesized method 'boost::statechart::event<evt_enviar_telegrama, std::allocator<void> >& boost::statechart::event<evt_enviar_telegrama, std::allocator<void> >::operator=(const boost::statechart::event<evt_enviar_telegrama, std::allocator<void> >&)' first required here (evt_enviar_telegrama is one of the types of the variant, and I'm calling sc::event<evt_enviar_telegrama>::operator=(t); line 64) Any clues? Thanks!

2 1

[BGL] internal properties problem
by Alejandro Marcos Aragón 31 Mar '07

31 Mar '07

Hi everyone, I'm trying to create a graph with two internal properties and it is strange because my code works fine when I use only one internal property, and I have a segmentation fault when I attach the second property. Does anyone have a clue why this is happening? Is this a bug? The code is as follows: struct vertex_point_t { typedef vertex_property_tag kind; }; struct vertex_location_t { typedef vertex_property_tag kind; }; struct edge_invalid_t { typedef edge_property_tag kind; }; // vertex properties typedef property < vertex_point_t, Point > domainVertexProperty; // edge propeties typedef property < edge_invalid_t, bool > domainEdgeProperty; typedef adjacency_list< setS, vecS, undirectedS, domainVertexProperty, domainEdgeProperty > domainGraph; this works fine but if I declare the domainVertexProperty as typedef property < vertex_point_t, Point, property < vertex_loation_t, int > > domainVertexProperty; it doesn't work anymore. Thanks for your help.

1 0

Boost::Graph breadth first search visitor has an invalid write of size 4
by Stephen Torri 30 Mar '07

30 Mar '07

This is the error that I am getting reported back to me by valgrind for my program. Unfortunately whatever the real reason is causing Valgrind to barf at this error and cry foul. The Valgrind FAQ says fix your memory errors and this will hopefully go away. Well I am quite naive on my use of Valgrind to nail down a particular bug. From the output below can anyone suggested as to where to start looking? System: Fedora Core 6 GCC: 4.1.1 20070105 (Red Hat 4.1.1-51) BOOST: 1.33.1 (11.fc6) Reverse_Impl::print_Graph is defined as: void Reverse_Impl::print_Graph ( infrastructure::Component_Graph const& graph_ref, std::string const name ) const { std::stringstream output_data; visitor::Graphviz_Visitor graphviz_ref ( graph_ref, output_data ); boost::breadth_first_search ( graph_ref.get_Graph(), // Return the Boost directed graph graph_ref.get_Vertex ( 1 ), // Return the root vertex in the boost graph boost::visitor ( graphviz_ref ) ); std::stringstream filename; filename << name << ".dot"; std::string final_name = filename.str(); std::ofstream output_file ( final_name.c_str() ); output_file << "digraph " << name << " {" << std::endl; output_file << output_data.str(); output_file << "}" << std::endl; output_file.close(); } Graphviz_Vistor discover_vertex is the only function I override in the default breadth first search visitor: class Graphviz_Visitor : public boost::default_bfs_visitor { public: // Constructor Graphviz_Visitor ( infrastructure::Component_Graph const& graph_ref, std::stringstream& output ); // Visitor functions template <class Vertex, class Graph> void discover_vertex(Vertex v, Graph const& g) { typename Graph::out_edge_iterator pos; typename Graph::out_edge_iterator end; typename Graph::vertex_descriptor node; typename infrastructure::Component::ptr_t target_obj_ptr; typename infrastructure::Component::ptr_t src_obj_ptr = m_graph_ref.get_Component(v); // Print out graphviz node for vertex m_output_data << boost::format("%d [label=\"%s(%d)\"];") % src_obj_ptr->get_ID() % src_obj_ptr->get_Name() % src_obj_ptr->get_ID() << std::endl; // For all children, print out path from vertex id to child id for ( boost::tie(pos,end) = out_edges(v, g); pos != end; ++pos) { node = target (*pos, g); target_obj_ptr = m_graph_ref.get_Component(node); m_output_data << boost::format("%d -> %d;") % src_obj_ptr->get_ID() % target_obj_ptr->get_ID() << std::endl; } } private: infrastructure::Component_Graph const& m_graph_ref; std::stringstream& m_output_data; }; File_Type_Detector(1) - initialized with data from component #0 ==13733== Invalid write of size 4 ==13733== at 0x4155F73: void boost::put<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::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::directedS<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::shared_ptr<libreverse::infrastructure::Component>, boost::shared_ptr<libreverse::infrastructure::Component>, boost::listS>, unsigned, unsigned const&, boost::property>, boost::default_color_type, boost::default_color_type&>, unsigned const, void*, boost::default_color_type>(boost::put_get_helper<unsigned const, 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::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::directedS<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::shared_ptr<libreverse::infrastructure::Component>, boost::shared_ptr<libreverse::infrastructure::Component>, boost::listS>, unsigned, unsigned const&, boost::property>, boost::default_color_type, boost::default_color_type&> > const&, void*, boost::default_color_type const&) (property_map.hpp:319) ==13733== by 0x415D9D1: void boost::breadth_first_search<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::queue<void*, std::deque<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, std::allocator<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> > > >, libreverse::visitor::Graphviz_Visitor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<libreverse::visitor::Graphviz_Visitor, std::allocator<libreverse::visitor::Graphviz_Visitor> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, libreverse::visitor::Graphviz_Visitor, libreverse::visitor::Graphviz_Visitor&> >(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const&, boost::graph_traits<boost::adj_list_vertex_property_map>::vertex_descriptor, boost::queue<void*, std::deque<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, std::allocator<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> > > >&, libreverse::visitor::Graphviz_Visitor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<libreverse::visitor::Graphviz_Visitor, std::allocator<libreverse::visitor::Graphviz_Visitor> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, libreverse::visitor::Graphviz_Visitor, libreverse::visitor::Graphviz_Visitor&>) (breadth_first_search.hpp:97) ==13733== by 0x415DAF1: void boost::detail::bfs_helper<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<__gnu_cxx, std::allocator<__gnu_cxx> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, __gnu_cxx, __gnu_cxx&>, libreverse::visitor::Graphviz_Visitor, unsigned const&, boost::graph_visitor_t, boost::no_property>(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>&, boost::graph_traits<__gnu_cxx>::vertex_descriptor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<__gnu_cxx, std::allocator<__gnu_cxx> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, __gnu_cxx, __gnu_cxx&>, libreverse::visitor::Graphviz_Visitor, boost::bgl_named_params<unsigned const&, boost::graph_visitor_t, boost::no_property> const&) (breadth_first_search.hpp:185) ==13733== by 0x415DCC1: void boost::detail::bfs_dispatch<boost::detail::error_property_not_found>::apply<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property>(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>&, boost::graph_traits<libreverse::visitor::Graphviz_Visitor>::vertex_descriptor, boost::bgl_named_params<libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property> const&, boost::detail::error_property_not_found) (breadth_first_search.hpp:226) ==13733== by 0x415DD4B: void boost::breadth_first_search<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property>(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const&, boost::graph_traits<libreverse::visitor::Graphviz_Visitor>::vertex_descriptor, boost::bgl_named_params<libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property> const&) (breadth_first_search.hpp:255) ==13733== by 0x41515D5: libreverse::api::Reverse_Impl::print_Graph(libreverse::infrastructure::Component_Graph const&, std::string) const (Reverse_Impl.cpp:189) ==13733== by 0x4151D71: libreverse::api::Reverse_Impl::execute_Analysis_Section(boost::shared_ptr<std::map<std::string, boost::shared_ptr<libreverse::infrastructure::Component_Graph>, std::less<std::string>, std::allocator<std::pair<std::string const, boost::shared_ptr<libreverse::infrastructure::Component_Graph> > > > >, std::pair<boost::shared_ptr<libreverse::infrastructure::Data_Source_Base const>, boost::shared_ptr<libreverse::infrastructure::Component> > const&) (Reverse_Impl.cpp:104) ==13733== by 0x4144534: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:138) ==13733== by 0x8055599: main (reverse.cpp:50) ==13733== Address 0x5AE64F0 is not stack'd, malloc'd or (recently) free'd valgrind: m_mallocfree.c:178 (mk_plain_bszB): Assertion 'bszB != 0' failed. ==13733== at 0x38016499: report_and_quit (m_libcassert.c:136) ==13733== by 0x380167C3: vgPlain_assert_fail (m_libcassert.c:200) ==13733== by 0x3802040C: vgPlain_arena_malloc (m_mallocfree.c:178) ==13733== by 0x38036077: vgPlain_cli_malloc (replacemalloc_core.c:101) ==13733== by 0x3800238E: vgMemCheck___builtin_new (mc_malloc_wrappers.c:182) ==13733== by 0x380367D2: do_client_request (scheduler.c:1158) ==13733== by 0x3803810C: vgPlain_scheduler (scheduler.c:869) ==13733== by 0x38057103: run_a_thread_NORETURN (syswrap-linux.c:87) sched status: running_tid=1 Thread 1: status = VgTs_Runnable ==13733== at 0x4005BA5: operator new(unsigned) (vg_replace_malloc.c:163) ==13733== by 0x48035A1A: std::string::_Rep::_S_create(unsigned, unsigned, std::allocator<char> const&) (in /usr/lib/libstdc++.so.6.0.8) ==13733== by 0x48037747: std::string::_M_mutate(unsigned, unsigned, unsigned) (in /usr/lib/libstdc++.so.6.0.8) ==13733== by 0x480378E9: std::string::_M_replace_safe(unsigned, unsigned, char const*, unsigned) (in /usr/lib/libstdc++.so.6.0.8) ==13733== by 0x48038959: std::string::replace(unsigned, unsigned, char const*, unsigned) (in /usr/lib/libstdc++.so.6.0.8) ==13733== by 0x48038B46: std::string::replace(__gnu_cxx::__normal_iterator<char*, std::string>, __gnu_cxx::__normal_iterator<char*, std::string>, __gnu_cxx::__normal_iterator<char const*, std::string>, __gnu_cxx::__normal_iterator<char const*, std::string>) (in /usr/lib/libstdc++.so.6.0.8) ==13733== by 0x8057F3D: std::string& std::string::append<__gnu_cxx::__normal_iterator<char const*, std::string> >(__gnu_cxx::__normal_iterator<char const*, std::string>, __gnu_cxx::__normal_iterator<char const*, std::string>) (basic_string.h:847) ==13733== by 0x8057FDF: void boost::io::detail::append_string<std::string>(std::string&, std::string const&, std::string::size_type, std::string::size_type) (parsing.hpp:383) ==13733== by 0x8063049: boost::basic_format<char, std::char_traits<char>, std::allocator<char> >::parse(std::string const&) (parsing.hpp:433) ==13733== by 0x8063593: boost::basic_format<char, std::char_traits<char>, std::allocator<char> >::basic_format(char const*) (format_implementation.hpp:33) ==13733== by 0x415C2D8: void libreverse::visitor::Graphviz_Visitor::discover_vertex<void*, boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> >(void*, boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const&) (Graphviz_Visitor.h:33) ==13733== by 0x415D5E6: void boost::breadth_first_visit<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::queue<void*, std::deque<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, std::allocator<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> > > >, libreverse::visitor::Graphviz_Visitor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<libreverse::visitor::Graphviz_Visitor, std::allocator<libreverse::visitor::Graphviz_Visitor> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, libreverse::visitor::Graphviz_Visitor, libreverse::visitor::Graphviz_Visitor&> >(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const&, boost::graph_traits<boost::adj_list_vertex_property_map>::vertex_descriptor, boost::queue<void*, std::deque<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, std::allocator<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> > > >&, libreverse::visitor::Graphviz_Visitor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<libreverse::visitor::Graphviz_Visitor, std::allocator<libreverse::visitor::Graphviz_Visitor> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, libreverse::visitor::Graphviz_Visitor, libreverse::visitor::Graphviz_Visitor&>) (breadth_first_search.hpp:65) ==13733== by 0x415DA51: void boost::breadth_first_search<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::queue<void*, std::deque<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, std::allocator<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> > > >, libreverse::visitor::Graphviz_Visitor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<libreverse::visitor::Graphviz_Visitor, std::allocator<libreverse::visitor::Graphviz_Visitor> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, libreverse::visitor::Graphviz_Visitor, libreverse::visitor::Graphviz_Visitor&> >(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const&, boost::graph_traits<boost::adj_list_vertex_property_map>::vertex_descriptor, boost::queue<void*, std::deque<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, std::allocator<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> > > >&, libreverse::visitor::Graphviz_Visitor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<libreverse::visitor::Graphviz_Visitor, std::allocator<libreverse::visitor::Graphviz_Visitor> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, libreverse::visitor::Graphviz_Visitor, libreverse::visitor::Graphviz_Visitor&>) (breadth_first_search.hpp:100) ==13733== by 0x415DAF1: void boost::detail::bfs_helper<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<__gnu_cxx, std::allocator<__gnu_cxx> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, __gnu_cxx, __gnu_cxx&>, libreverse::visitor::Graphviz_Visitor, unsigned const&, boost::graph_visitor_t, boost::no_property>(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>&, boost::graph_traits<__gnu_cxx>::vertex_descriptor, boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<__gnu_cxx, std::allocator<__gnu_cxx> > >, boost::adj_list_vertex_property_map<boost::no_property, unsigned, unsigned const&, boost::vertex_index_t>, __gnu_cxx, __gnu_cxx&>, libreverse::visitor::Graphviz_Visitor, boost::bgl_named_params<unsigned const&, boost::graph_visitor_t, boost::no_property> const&) (breadth_first_search.hpp:185) ==13733== by 0x415DCC1: void boost::detail::bfs_dispatch<boost::detail::error_property_not_found>::apply<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property>(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>&, boost::graph_traits<libreverse::visitor::Graphviz_Visitor>::vertex_descriptor, boost::bgl_named_params<libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property> const&, boost::detail::error_property_not_found) (breadth_first_search.hpp:226) ==13733== by 0x415DD4B: void boost::breadth_first_search<boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS>, libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property>(boost::adjacency_list<boost::setS, boost::setS, boost::directedS, boost::property<boost::vertex_index_t, unsigned, boost::property<boost::vertex_name_t, boost::shared_ptr<libreverse::infrastructure::Component>, boost::no_property> >, boost::no_property, boost::no_property, boost::listS> const&, boost::graph_traits<libreverse::visitor::Graphviz_Visitor>::vertex_descriptor, boost::bgl_named_params<libreverse::visitor::Graphviz_Visitor, boost::graph_visitor_t, boost::no_property> const&) (breadth_first_search.hpp:255) ==13733== by 0x41515D5: libreverse::api::Reverse_Impl::print_Graph(libreverse::infrastructure::Component_Graph const&, std::string) const (Reverse_Impl.cpp:189) ==13733== by 0x4151D71: libreverse::api::Reverse_Impl::execute_Analysis_Section(boost::shared_ptr<std::map<std::string, boost::shared_ptr<libreverse::infrastructure::Component_Graph>, std::less<std::string>, std::allocator<std::pair<std::string const, boost::shared_ptr<libreverse::infrastructure::Component_Graph> > > > >, std::pair<boost::shared_ptr<libreverse::infrastructure::Data_Source_Base const>, boost::shared_ptr<libreverse::infrastructure::Component> > const&) (Reverse_Impl.cpp:104) ==13733== by 0x4144534: libreverse::api::Reverse::execute(std::string const&, unsigned const&, unsigned const&) (Reverse.cpp:138) ==13733== by 0x8055599: main (reverse.cpp:50) Stephen

1 0

Correct way to store shared_ptr objects in a stl::map
by Stephen Torri 30 Mar '07

30 Mar '07

I have a class, called Reader_Factory, which creates file readers for a particular input file based on its type. Other objects will request a certain type of reader multiple times so I am caching the reader object in a STL map with its file name as the key. std::map<std::string, boost::shared_ptr<Reader> > Well when I include in sp_debug_hooks.cpp into my build along with defining -DBOOST_SP_ENABLE_DEBUG_HOOKS in the compiler's command line flags I am seeing a error come up with its destroying the Reader_Factory. *** errors detected in test suite "Reverse_Impl test suite"; see standard output for details test_one_node_per_section: sp_debug_hooks.cpp:201: void operator delete(void*): Assertion `*pm == allocated_scalar' failed. Checking the back trace in gdb (full backtrace below) I am seeing that Reader_Factory destructor is called followed by the std::map destructor followed by the reader object's destructor. So this made me think that perhaps I am doing something wrong with storing a reader object in the Reader_Factory class. Well gdb reports back that there was a segmentation fault in a destructor for a class called Data_Source. The line reades: 26 m_transfer_method->close(); Checking m_transfer_method in gdb reports: (gdb) p m_transfer_method $3 = {px = 0x8d8af58, pn = {pi_ = 0x8d8af80, id_ = 741732609}} (gdb) p *m_transfer_method.px $4 = {<libreverse::infrastructure::Data_Transfer_Base> = {_vptr.Data_Transfer_Base = 0x4}, m_config = {px = 0x8d7ff28, pn = {pi_ = 0x8d7ff40, id_ = 741732609}}, m_data = {px = 0x8d87360, pn = {pi_ = 0x8d873c8, id_ = 741732609}}} So I am not sure what is the segfault here. To help here is pseudo code similiar to what I am doing: class File_Reader { }; class B_Reader : public File_Reader {}; class Reader_Factory { public: virtual ~Reader_Factory(){} boost::shared_ptr<File_Reader> create_B_Reader ( std::string filename ) { boost::shared_ptr<File_Reader> tmp_ptr ( new B_Reader ( filename ) ); IF tmp_ptr->support_File_Type is TRUE THEN return reader ELSE throw an exception } boost::shared_ptr<File_Reader> get_Reader ( std::string filename ) { bool found = false; boost::shared_ptr<File_Reader> reader_ptr; // IF the File_Reader is already cached in the map THEN return pointer to it // ELSE // Find which reader will support it THEN set found to TRUE // (For example, see create_B_Reader) // IF found equal to TRUE and reader_ptr is set THEN check to see if its in the reader map // IF not THEN add it // ELSE we should not reach this point (abort. If it exists already then the first IF statement will catch it) Reader_Map_t::const_iterator cpos = reader_map.find ( filename ); if ( cpos == reader_map.end() ) { try { reader_ptr = this->create_B_Reader ( filename ); found = true; } catch ( std::exception& ) { found = false; } if ( ! found ) THEN throw exception saying unsupported file type else { if ( ( reader_map.insert ( std::make_pair ( filename, reader_ptr ) ) ).second == false ) THEN report exception saying duplicate entry the program is broken stop running } } else { reader_ptr = (*cpos).second; } return reader_ptr; } typedef std::map<std::string, boost::shared_ptr<File_Reader> > Reader_Map_t; Reader_Map_t reader_map; }; Is there a problem or problems with this design? Stephen ---------------------------------------------------------------------------- Full gdb output from SIGABRT given by sp_debug_hooks ---------------------------------------------------------------------------- #0 0x00367402 in __kernel_vsyscall () #1 0x47bd9d40 in raise () from /lib/libc.so.6 #2 0x47bdb591 in abort () from /lib/libc.so.6 #3 0x47bd338b in __assert_fail () from /lib/libc.so.6 #4 0x006c20ae in operator delete (p=0x8d9f2a8) at sp_debug_hooks.cpp:201 #5 0x006d4983 in __gnu_cxx::new_allocator<std::_Rb_tree_node<std::pair<unsigned int const, unsigned int> > >::deallocate ( this=0x8d8ae4c, __p=0x8d9f2a8) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/ext/new_allocator.h:94 #6 0x006d49b8 in std::_Rb_tree<unsigned int, std::pair<unsigned int const, unsigned int>, std::_Select1st<std::pair<unsigned int const, unsigned int> >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int> > >::_M_put_node (this=0x8d8ae4c, __p=0x8d9f2a8) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:362 #7 0x006d4a18 in std::_Rb_tree<unsigned int, std::pair<unsigned int const, unsigned int>, std::_Select1st<std::pair<unsigned int const, unsigned int> >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int> > >::destroy_node (this=0x8d8ae4c, __p=0x8d9f2a8) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:392 #8 0x006d4a8e in std::_Rb_tree<unsigned int, std::pair<unsigned int const, unsigned int>, std::_Select1st<std::pair<unsigned int const, unsigned int> >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int> > >::_M_erase (this=0x8d8ae4c, __x=0x8d9f2a8) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:1266 #9 0x006d4a6e in std::_Rb_tree<unsigned int, std::pair<unsigned int const, unsigned int>, std::_Select1st<std::pair<unsigned int const, unsigned int> >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int> > >::_M_erase (this=0x8d8ae4c, __x=0x8d9e1a0) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:1264 #10 0x006d4a6e in std::_Rb_tree<unsigned int, std::pair<unsigned int const, unsigned int>, std::_Select1st<std::pair<unsigned int const, unsigned int> >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int> > >::_M_erase (this=0x8d8ae4c, __x=0x8d9df20) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:1264 #11 0x006d4a6e in std::_Rb_tree<unsigned int, std::pair<unsigned int const, unsigned int>, std::_Select1st<std::pair<unsigned int const, unsigned int> >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int> > >::_M_erase (this=0x8d8ae4c, __x=0x8d9d520) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:1264 #12 0x006d4a6e in std::_Rb_tree<unsigned int, std::pair<unsigned int const, unsigned int>, std::_Select1st<std::pair<unsigned int const, unsigned int> >, std::less<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int> > >::_M_erase (this=0x8d8ae4c, __x=0x8d9c120) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:1264 #13 0x006d4acd in ~_Rb_tree (this=0x8d8ae4c) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:578 #14 0x006d4b29 in ~map (this=0x8d8ae4c) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_map.h:93 #15 0x006d0407 in ~Memory_Map (this=0x8d8ae28) at Memory_Map.cpp:75 #16 0x006d3ba8 in boost::checked_delete<libreverse::data_types::Memory_Map> (x=0x8d8ae28) at /usr/include/boost/checked_delete.hpp:34 #17 0x006d6645 in boost::detail::sp_counted_impl_p<libreverse::data_types::Memory_Map>::dispose (this=0x8d9e318) #18 0x0805e62c in boost::detail::sp_counted_base::release (this=0x8d9e318) at /usr/include/boost/detail/sp_counted_base_gcc_x86.hpp:145 #19 0x0805e66e in ~shared_count (this=0x8d89c38) at /usr/include/boost/detail/shared_count.hpp:159 #20 0x006d3024 in ~shared_ptr (this=0x8d89c34) at /usr/include/boost/shared_ptr.hpp:106 #21 0x00703c65 in ~File (this=0x8d89c28) at File.cpp:83 #22 0x0077c9bd in ~Elf_File (this=0x8d89c28) at ../../../../src/io/input/File_Readers/Elf/Elf_Header_Eident.h:10 #23 0x0077c9ed in boost::checked_delete<libreverse::elf_module::Elf_File<32u> > (x=0x8d89c28) at /usr/include/boost/checked_delete.hpp:34 #24 0x0077cb59 in boost::detail::sp_counted_impl_p<libreverse::elf_module::Elf_File<32u> >::dispose (this=0x8d9e788) at /usr/include/boost/detail/sp_counted_impl.hpp:76 #25 0x0805e62c in boost::detail::sp_counted_base::release (this=0x8d9e788) at /usr/include/boost/detail/sp_counted_base_gcc_x86.hpp:145 #26 0x0805e66e in ~shared_count (this=0x8d8b1b0) at /usr/include/boost/detail/shared_count.hpp:159 #27 0x00760b38 in ~shared_ptr (this=0x8d8b1ac) at /usr/include/boost/shared_ptr.hpp:106 #28 0x00769906 in ~Elf_Reader (this=0x8d8b1a8) at ../../../../src/io/input/File_Readers/Elf/Elf_Reader_T.cpp:44 #29 0x00760ffa in boost::checked_delete<libreverse::elf_module::Elf_Reader<32u> > (x=0x8d8b1a8) at /usr/include/boost/checked_delete.hpp:34 #30 0x0076ff35 in boost::detail::sp_counted_impl_p<libreverse::elf_module::Elf_Reader<32u> >::dispose (this=0x8d84410) at /usr/include/boost/detail/sp_counted_impl.hpp:76 #31 0x0805e62c in boost::detail::sp_counted_base::release (this=0x8d84410) at /usr/include/boost/detail/sp_counted_base_gcc_x86.hpp:145 #32 0x0805e66e in ~shared_count (this=0x8d8acd8) at /usr/include/boost/detail/shared_count.hpp:159 #33 0x00760a78 in ~shared_ptr (this=0x8d8acd4) at /usr/include/boost/shared_ptr.hpp:106 #34 0x00766ff7 in ~pair (this=0x8d8acd0) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_pair.h:69 #35 0x00767053 in __gnu_cxx::new_allocator<std::pair<std::string const, boost::shared_ptr<libreverse::io::File_Reader> > >::destroy (this=0xbff1b343, __p=0x8d8acd0) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/ext/new_allocator.h:107 #36 0x007672f1 in std::_Rb_tree<std::string, std::pair<std::string const, boost::shared_ptr<libreverse::io::File_Reader> >, std::_Select1st<std::pair<std::string const, boost::shared_ptr<libreverse::io::File_Reader> > >, std::less<std::string>, std::allocator<std::pair<std::string const, boost::shared_ptr<libreverse::io::File_Reader> > > >::destroy_node (this=0x8d8b184, __p=0x8d8acc0) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:391 #37 0x00767384 in std::_Rb_tree<std::string, std::pair<std::string const, boost::shared_ptr<libreverse::io::File_Reader> >, std::_Select1st<std::pair<std::string const, boost::shared_ptr<libreverse::io::File_Reader> > >, std::less<std::string>, std::allocator<std::pair<std::string const, boost::shared_ptr<libreverse::io::File_Reader> > > >::_M_erase (this=0x8d8b184, __x=0x8d8acc0) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:1266 #38 0x00767447 in ~_Rb_tree (this=0x8d8b184) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_tree.h:578 #39 0x007674a3 in ~map (this=0x8d8b184) at /usr/lib/gcc/i386-redhat-linux/4.1.1/../../../../include/c++/4.1.1/bits/stl_map.h:93 #40 0x0075fbb0 in ~Reader_Factory (this=0x8d8b180) at Reader_Factory.cpp:16 #41 0x007612b8 in boost::checked_delete<libreverse::io::Reader_Factory> (x=0x8d8b180) at /usr/include/boost/checked_delete.hpp:34 #42 0x0076ff79 in boost::detail::sp_counted_impl_p<libreverse::io::Reader_Factory>::dispose (this=0x8d8b018) at /usr/include/boost/detail/sp_counted_impl.hpp:76 #43 0x0805e62c in boost::detail::sp_counted_base::release (this=0x8d8b018) at /usr/include/boost/detail/sp_counted_base_gcc_x86.hpp:145 #44 0x0805e66e in ~shared_count (this=0x868890) at /usr/include/boost/detail/shared_count.hpp:159 #45 0x00760a52 in ~shared_ptr (this=0x86888c) at /usr/include/boost/shared_ptr.hpp:106 #46 0x0075fab4 in __tcf_1 () at Reader_Factory.cpp:14 #47 0x47bdcbe9 in __cxa_finalize () from /lib/libc.so.6 #48 0x006b4303 in __do_global_dtors_aux () from /usr/local/lib/libreverse.so.0 #49 0x0079cb2c in _fini () from /usr/local/lib/libreverse.so.0 #50 0x47ba2572 in _dl_fini () from /lib/ld-linux.so.2 #51 0x47bdc939 in exit () from /lib/libc.so.6 #52 0x47bc6f34 in __libc_start_main () from /lib/libc.so.6 #53 0x0805cf41 in _start ()

3 4

Boost regex/ICU link problems on linux
by Gary M Ciany 30 Mar '07

30 Mar '07

I am having a problem getting the boost regex icu example code to link on linux. I am on Redhat Linux 9, using gcc 3.4.4. I downloaded the src ICU package and built and installed it as root in /usr/local with no problem. I downloaded boost_1_33_1 and got it to build and install with no problem. I first did a configure telling it where my ICU was located. As it built it stated it was being built with ICU in /usr/local/include. So now I got to build the regex/example code. There is a program under snippets/icu_example.cpp. I went into that example and forced the code to compile the main using the icu. By that I mean I took out the #ifdef BOOST_HAS_ICU and deleted the code around the main that printed "<NOTE>ICU support not enabled..." The code compiles, but when it goes to link I get all these unresolved external references..e.g. ../../../bin/boost/libs/regex/example/icu_example.test/gcc/debug/threading-multi/icu_example.0(.text+0x3e9): In function 'extract_greek(icu_3_6::UnicodeString const&)': snippets/icu_example.cpp:61 undefined reference to icu_3_6::UnicodeString::UnicodeString(unsigned short const*, int)' I get other cases where for example.. ../boost_1_33_1/boost/regex/icu.hpp:1001: Undefined reference to 'icu_3_6::UnicodeString::UnicodeString()' (It seems that maybe the prefix icu_3_6 is being added in the class resolution when creating this .o but was not used in the creation of the .a boost/icu libraries. ) Any idea how to fix this? Gary

1 0

[lambda] logical operators related errors
by Dizzy 30 Mar '07

30 Mar '07

Hello I have the following testcase: #include <string> #include <iostream> #include <boost/lambda/lambda.hpp> #include <boost/bind.hpp> #include <boost/mem_fn.hpp> struct A { std::string s1, s2, s3; A(std::string const& s1_, std::string const& s2_, std::string const& s3_) :s1(s1_), s2(s2_), s3(s3_) {} }; void eval(bool val) { std::cout << "result: " << val << std::endl; } int main() { using boost::bind; using boost::mem_fn; A a1("str1", "str2", "str3"); A a2("str2", "str1", "str3"); eval(((bind(&A::s1, _1) < bind(&A::s1, _2)) && (bind(&A::s2, _1) < bind(&A::s2, _2)))(a1, a2)); } This errors compiling about operator&& no match found. I am trying to write a binary predicate (for a sort type algorithm) that should lexicographically compare the s1 field of the first argument with the corresponding one in the second argument, then compare the s2 fields similary (in this order). It does seem to work for the simpler case of just one "<" operation but doesn't seem to work when using "&&" on the results of "<". I was hoping there is an overloaded && that works on the functors returned by the overloaded < version. Can someone offer a working solution (possibly better looking than this one heh). Thanks! PS: For didactic reasons I specifically do not want to write the comparator manually but using lambda/bind composition and the like -- Mihai RUSU Email: dizzy(a)roedu.net GPG : http://dizzy.roedu.net/dizzy-gpg.txt WWW: http://dizzy.roedu.net "Linux is obsolete" -- AST

2 4

Re: [Boost-users] about static lib of boost::regex
by llwaeva＠21cn.com 30 Mar '07

30 Mar '07

>Hi there, > I am writing a DLL under Windows with MSVC 2005. In my project, >boost:regex is involved. I do nothing but include the following in my >stdafx.h I try to compile the project with OPTION /MD,; however, the compile report that libboost_regex-vc80-mt-s-1_33_1.lib cannot be found. It fails to compile the project even I specify the path and library while compiling. What's going on? Thanks again.

2 1

about static lib of boost::regex
by llwaeva＠21cn.com 30 Mar '07

30 Mar '07

Hi there, I am writing a DLL under Windows with MSVC 2005. In my project, boost:regex is involved. I do nothing but include the following in my stdafx.h #include <boost/regex.hpp> #include <boost/regex/v4/match_flags.hpp> #include <boost/scoped_ptr.hpp> #include <boost/compressed_pair.hpp> #include <boost/format.hpp> #include <boost/algorithm/string/regex.hpp> #include <boost/algorithm/string/regex_find_format.hpp> #include <boost/algorithm/string/replace.hpp> #include <boost/algorithm/string/split.hpp> #include <boost/algorithm/string.hpp> #include <boost/algorithm/string_regex.hpp> #include <boost/algorithm/string/trim.hpp> #include <fstream> #include <sstream> #include <string> #include <vector> it is all right to complie the project once I specify the path of the library of boost::regex. I found there are librarys in the directory libboost_regex-vc80-mt-s-1_33_1.lib and libboost_regex-vc80-mt-s.lib I wonder what's different between these two librarys? Which one should I used to develope a DLL? Thanks in advance.

2 1