- Boost-users - lists.boost.org

boost serialization & C++ STL
by sam p 03 Jun '08

03 Jun '08

Is it right to use serialization library in the following environment, ********************** Main1.cpp : Compiled with Gcc stores map in /tmp/z ********************** (1) main1.cpp -------------------- #include <map> #include<string> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/map.hpp> #include <boost/serialization/string.hpp> int main() { std::ofstream f("/tmp/z"); boost::archive::text_oarchive oar(f); std::map<std::string, std::string> a; ..... //Some data added to this map oar & a; return 0; } ************************** main2.cpp : Compiled with Forte compiler (or say older version of GCC) loads map stored in /tmp/z ******************************* (2) main2.cpp ----------------------------------------------- #include <map> #include<string> #include <boost/archive/text_iarchive.hpp> #include <boost/serialization/map.hpp> int main() { std::ifstream f("/tmp/z"); boost::archive::text_iarchive iar(f); std::map<std::string, std::string> a; iar & a; return 0; } *********************************** Can such use create problems especially with STL and their vendor specific implementations? Thanks, Sameer

3 2

program_options to load data from a configuration file?
by Chris Ross 03 Jun '08

03 Jun '08

I want to put a bunch of configuration into a file, and was wondering if boost::program_options could be used to load it. Looking at the documentation for program_options, it's easy to load configuration off of the command line, and then other values for same and additional configuration parameters from a config file. But, what I want to do is have a data file. I want to have a file that looks like, say: [thing1] name=dogooder method=http [thing2] name=bob method=http [thing4] name=mary method=gopher And, I'm wondering if I can use program_options::parse_config_file to load this, or if there's no way for parse_config_file to load things that aren't specifically entered in to the options_decription as expected options... Can it load unexpected options? Is there an iterator that would let me just look at everything that was loaded? Thanks... - Chris

1 0

[boost-users][statechart] processing an event by few orthogonal regions
by Igor R 03 Jun '08

03 Jun '08

Hi, I'd like several orthogonal regions to process some event. However, it seems (according to the manual and to what I see) that after one of the regions processes the event, it's discarded - isn't it? The only trick I could think about is to requeue the event in all the regions' reactions but one. But probably there is some more elegant way to do this? Thanks, Igor'.

2 1

[build] setting alignment (very urgent)
by Ovanes Markarian 03 Jun '08

03 Jun '08

Hello *, is someone aware how to set cutom structure member alignment for boost libs (DLLs) being compiled. We used ...\boost\config\abi\msvc_prefix.hpp #pragma pack(push,4) ...\boost\config\abi\msvc_suffix.hpp #pragma pack(pop) Either these files are not included by boost libs during the build process, or we have to enable their inclusion. Where to do it is unclear. Maybe we can set the correct flag in some .jam file at all. Any help would be greatly appreciated. Many thanks, Ovanes P.S. We are using Microsoft Visual Studio 2003 with boost 1.34.0 distribution.

1 0

connected_components
by Imran A. Pirwani 03 Jun '08

03 Jun '08

Hi, I am new to boost. I would like to use the following: typedef adjacency_list< listS, listS > Graph; Using a graph defined as above will allow me to call "remove_vertex". I would also like to use "connected_components()" to get connected components after I have removed a bunch of vertices (by calling "remove_vertex"). The example at: http://www.boost.org/doc/libs/1_35_0/libs/graph/example/connected_component… doesn't work for me because of the difference in adjacency lists used. Any help will be greatly appreciated! Thanks! -Imran.

2 2

[Units] and angular acceleration
by P Hawley 03 Jun '08

03 Jun '08

Hi, There are defined structs for angular_velocity, moment_of_inertia and angular_momentum as well as torque. Are you going to add angular_acceleration? Thanks Pat

4 3

normal_distribution<> behaviour
by Kevin Martin 03 Jun '08

03 Jun '08

I found this in the archive: http://thread.gmane.org/gmane.comp.lib.boost.user/26685 I am experiencing the same problem. However it works with variate_generator - see attached code. Is this simply a documentation bug which should say `Must always use variate_generator' or are the distributions supposed to work with any source of randomness? In which case they don't in 1.35.0 and I will go report it. Thanks, Kevin Martin #include <boost/random.hpp> #include <iostream> template<typename Randmoness_>void func1(Randmoness_ &r) { boost::normal_distribution<> x(180, 60); boost::uniform_real<> X(5.0, 10.0); std::cout << x(r) << " " << X(r) << std::endl; } template<typename Randmoness_>void func2(Randmoness_ &r) { boost::normal_distribution<> x(180, 60); boost::variate_generator<Randmoness_ &, boost::normal_distribution<> > y(r, x); boost::uniform_real<> X(5.0,10.0); boost::variate_generator<Randmoness_ &, boost::uniform_real<> > Y(r, X); std::cout << y() << " " << Y() << std::endl; } int main() { boost::mt19937 rng; func1(rng); func2(rng); return 0; }

1 0

[boost-users][statechart] state_machine::initiate()
by Igor R 03 Jun '08

03 Jun '08

Hi, Regarding the subj, the reference says: Effects: 1. Calls terminate() ...... 5. Processes all posted events (see process_event()). Returns to the caller if there are no more posted events But on terminate() call, all the posted events are cleared, so initiate() has nothing to process. Thus, I cannot write something like this: output MyMachine::invoke(SomeInput intput) { post_event(EvIput(input)); initiate(); // I want to proceed only after all the input is processed; the states might post internal events return output; } What would be the correct solution for this? Thanks a lot, Igor'.

1 1

BGL problem wit prims
by Line Blander Reinhardt 03 Jun '08

03 Jun '08

Hi I have some problems with using prim_minimum_spanning_tree function My major problem is I want to use a different weight than standard. My code: vector<standard::UnDirectedVertex> parent(num_vertices(graph_)); vector<std::size_t> distance(num_vertices(graph_)); boost::property_map<standard::Graph, mst_cost_t>::type weightmap = boost::get(mst_cost, graph_); boost::property_map<standard::Graph, boost::vertex_index_t>::type indexmap = get(boost::vertex_index, graph_); prim_minimum_spanning_tree(graph_,0, &parent[0], &distance[0],weightmap,indexmap,boost::default_dijkstra_visitor()); The error message is: 1>c:\program files\microsoft visual studio 8\vc\include\limits(109) : error C2440: '<function-style-cast>' : cannot convert from 'int' to 'W' 1> No constructor could take the source type, or constructor overload resolution was ambiguous 1> c:\program files\microsoft visual studio 8\vc\include\limits(107) : while compiling class template member function 'W std::numeric_limits<_Ty>::max(void) throw()' 1> with 1> [ 1> _Ty=W 1> ] 1> c:\boost\include\boost-1_33_1\boost\graph\prim_minimum_spanning_tree.hpp (61) : see reference to class template instantiation 'std::numeric_limits<_Ty>' being compiled 1> with 1> [ 1> _Ty=W 1> ] Can any one help getting the call right??? Thanks Line

1 0

[ptr_map] container equality comparison doesn't compile
by Rodolfo Lima 03 Jun '08

03 Jun '08

Hi, is there any other reason (apart from begin a bug) that the following code doesn't compile with g++-4.3? #include <boost/ptr_container/ptr_map.hpp> int main() { boost::ptr_map<int,int> m1, m2; m1.insert(1,std::auto_ptr<int>(new int(2))); m2.insert(1,std::auto_ptr<int>(new int(2))); return m1 == m2; } gcc spits the following errors (be seated...): /usr/lib/gcc/i686-pc-linux-gnu/4.3.0/include/g++-v4/bits/stl_algobase.h: In static member function 'static bool std::__equal<_BoolType>::equal(_II1, _II1, _II2) [with _II1 = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, _II2 = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, bool _BoolType = false]': /usr/lib/gcc/i686-pc-linux-gnu/4.3.0/include/g++-v4/bits/stl_algobase.h:818: instantiated from 'bool std::__equal_aux(_II1, _II1, _II2) [with _II1 = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, _II2 = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>]' /usr/lib/gcc/i686-pc-linux-gnu/4.3.0/include/g++-v4/bits/stl_algobase.h:950: instantiated from 'bool std::equal(_II1, _II1, _II2) [with _II1 = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, _II2 = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>]' /usr/include/boost/ptr_container/detail/reversible_ptr_container.hpp:441: instantiated from 'bool boost::ptr_container_detail::reversible_ptr_container<Config, CloneAllocator>::operator==(const boost::ptr_container_detail::reversible_ptr_container<Config, CloneAllocator>&) const [with Config = boost::ptr_container_detail::map_config<int, std::map<int, void*, std::less<int>, std::allocator<std::pair<const int, void*> > > >, CloneAllocator = boost::heap_clone_allocator]' teste.cpp:10: instantiated from here /usr/lib/gcc/i686-pc-linux-gnu/4.3.0/include/g++-v4/bits/stl_algobase.h:789: error: no match for 'operator==' in '((boost::iterator_facade<boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, boost::ptr_container_detail::ref_pair<int, const int* const>, boost::bidirectional_traversal_tag, boost::ptr_container_detail::ref_pair<int, const int* const>, int>*)(& __first1))->boost::iterator_facade<I, V, TC, R, D>::operator* [with Derived = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, Value = boost::ptr_container_detail::ref_pair<int, const int* const>, CategoryOrTraversal = boost::bidirectional_traversal_tag, Reference = boost::ptr_container_detail::ref_pair<int, const int* const>, Difference = int]() == ((boost::iterator_facade<boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, boost::ptr_container_detail::ref_pair<int, const int* const>, boost::bidirectional_traversal_tag, boost::ptr_container_detail::ref_pair<int, const int* const>, int>*)(& __first2))->boost::iterator_facade<I, V, TC, R, D>::operator* [with Derived = boost::ptr_map_iterator<std::_Rb_tree_const_iterator<std::pair<const int, void*> >, int, const int* const>, Value = boost::ptr_container_detail::ref_pair<int, const int* const>, CategoryOrTraversal = boost::bidirectional_traversal_tag, Reference = boost::ptr_container_detail::ref_pair<int, const int* const>, Difference = int]()' make: ** [teste] Erro 1 My guess it that boost::ptr_container_detail::ref_pair should have an equality operator (and a less than also) somehow. In fact... by adding the following operator== to it the code compiles and behaves as expected: // #include <boost/utility/compare_pointees.hpp at top of the file bool operator==(const ref_pair &that) const { return first==that.first && boost::equal_pointees(second, that.second); } Something equivalent should be done for operator< Any objections? Regards, rod

2 1