- Boost-users - lists.boost.org

serialization of c++0x or boost unordered_map
by William Oquendo 08 Sep '10

08 Sep '10

Dear all, I would like to know if is there a canonical way to use serialization for c++0x or boost unordered_map, like the provided for standards vectors with the file boost/serialization/vector.hpp . Thanks in advance. Best regards / Cordialmente, -- William Oquendo Phd Candidate Simulation Of Physical Systems Group Universidad Nacional de Colombia Linux User # 321481 ********************* Este correo puede carecer de tildes o eñes ya que el teclado no contiene estos caracteres. Presento excusas por eso. *********************

2 1

[Random] uniform_real, min/max at end of value range
by Ruediger Berlich 08 Sep '10

08 Sep '10

Hi there, from what I can see, uniform_real(min,max) essentially does this: fp_type result = uniform_fp_between_0_and_1 * (max - min) + min; // (1) (1) will fail e.g. if the distance between min and max is > std::numeric_limits<fp_type>::max() While writing unit tests for my code I have come across exactly this situation. My application would not suffer much from reducing the allowed value range for my variables to < +/-0.5*std::numeric_limits<fp_type>::max() . However I feel that this would be a bit artificial. Hence I was wondering whether code like the following made more sense (although it is certainly not as efficient): /**********************************************************/ fp_type uniform_real(const fp_type& min, const fp_type& max) { // Check that min and max have appropriate values assert(min<=max); if(min >= fp_type(0.) || max <= fp_type(0.)) { // (max-min) is valid return uniform_01() * (max - min) + min; } else { // Some values will fail (max-min) // We know: min<0., max>0. assert(min<0); assert(max>0); // Calculate a random number in the range [0,1[ fp_type fraction = uniform_01(); // Calculate the fraction of the distance of min from 0. volatile fp_type minFraction = -fraction*min; // Calculate the fraction of the distance of max from 0. volatile fp_type maxFraction = fraction*max; // // The start of the scale volatile fp_type result = min + minFraction; // Add maxFraction to the result. result += maxFraction; return result; } } /**********************************************************/ Essentially, in cases where (max-min) could be larger than the allowed value range, the distance to 0 of each max and min is individually multiplied with a fp random number in the range [0,1[ . The resulting values are then added seperately to min. There should be no situation where an attempt is made to create a value larger than the allowed value range ... unless the compiler optimizes this to "result=min+minFraction+maxFraction;" or worse. volatile might or might not prevent this, I am not sure (seems to work with g++ 4.4.3, though). What is your view on this ? Are there different/better approaches in Boost that I could use ? Best Regards, Ruediger

2 1

insert_iterator() for Unordered Containers
by Hossein Haeri 08 Sep '10

08 Sep '10

Dear all, Is there any insert_iterator (the std Iterator Adaptor) for unordered containers? I am especially interested in unordered_map. TIA, --Hossein

2 1

BOOST_FUSION_ADAPT_STRUCT for empty structs
by Hicham Mouline 08 Sep '10

08 Sep '10

Hello I have this situation: namespace X { struct base_parameters { double skid; }; namespace XX { struct derived_parameters: public base_parameters { double old_field; }; } } // at global namespace BOOST_FUSION_ADAPT_STRUCT( X::XX::parameters, (double, skid) //(double, old_field) ) boost 1.44 Is this supposed to work? I'm getting a compile error which I can't understand and 1 change that I've done is remove the only field that was before in derived_parameters. Regards,

2 2

Building Boost on Mac Snow Leopard
by Andrew Maclean 08 Sep '10

08 Sep '10

Hi All, If I build boost using bjam (no problems there) and set in .bashrc: export DYLD_LIBRARY_PATH="$DYLD_LIBRARY_PATH:${BOOST_ROOT}/stage/lib" Things seem to work OK when when calling applications from the command line in a terminal. However if I invoke the application e.g. x.app from the Finder the boost dynamic libraries are not found. If I run for example, otool -D /Users/andrewmaclean/Code/GeneralLibraries/boost_1_44_0/stage/lib/libboost_date_time.dylib /Users/andrewmaclean/Code/GeneralLibraries/boost_1_44_0/stage/lib/libboost_date_time.dylib: libboost_date_time.dylib Clearly no absolute path is set. It seems to me that Finder is ignoring the DYLD_LIBRARY_PATH variable, I even changed it to DYLD_FALLBACK_LIBRARY_PATH to see if it would make any difference. So the only solution I have is to install boost into the default system libraries, where it works perfectly. Now comes the interesting question. If I build VTK then the absolute paths are put into the dynamic libraries. So something in CMake/gcc actually adds these paths into the dynamic libraries. Why doesn't bjam do this? Is there a parameter I am missing? Rgeards Andrew -- ___________________________________________ Andrew J. P. Maclean Centre for Autonomous Systems The Rose Street Building J04 The University of Sydney 2006 NSW AUSTRALIA Ph: +61 2 9351 3283 Fax: +61 2 9351 7474 URL: http://www.acfr.usyd.edu.au/ ___________________________________________

4 4

Compilation error's while building Boost 1_43_0 on HP-UX 11.11 with gcc version 3.3.1
by Nakul Virmani 08 Sep '10

08 Sep '10

HI All, I am trying to build boost 1_43_0 on HP-UX box (HP-UX 11.11) using gcc verision 3.3.1, but i am running into compilation errors. The gcc version details are as below -bash-3.2$ ./gcc -v Reading specs from ./../lib/gcc-lib/hppa2.0w-hp-hpux11.11/3.3.1/specs Configured with: ../src/configure --enable-languages=c,c++ --prefix=/usr/local/pa20_32 --with-local-prefix=/usr/local/pa20_32 --with-gnu-as --with-as=/usr/local/pa20_32/bin/as --with-ld=/usr/ccs/bin/ld --disable-shared --disable-nls Thread model: single gcc version 3.3.1 The following error are thrown and not even a single file is built ...patience... ...patience... ...patience... ...found 5243 targets... ...updating 747 targets... common.mkdir stage common.mkdir stage/lib common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2 common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1 common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/.. common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/../src common.mkdir /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/../src/tr1 gcc.compile.c++.pch /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/../src/tr1/pch.hpp.gch g++: unrecognized option `-pthread' g++: language c++-header not recognized g++: libs/math/build/../src/tr1/pch.hpp: linker input file unused because linking not done gcc.compile.c++ /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/assoc_laguerre.o g++: unrecognized option `-pthread' cc1plus: error: unrecognized option `-Winvalid-pch' "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -Winvalid-pch -DBOOST_ALL_NO_LIB=1 -DBOOST_BUILD_PCH_ENABLED -DBOOST_MATH_TR1_DYN_LINK=1 -DNDEBUG -I"/export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/../src/tr1" -I"." -I"libs/math/src/tr1" -c -o "/export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/assoc_laguerre.o" "libs/math/build/../src/tr1/assoc_laguerre.cpp" ...failed gcc.compile.c++ /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/assoc_laguerre.o... gcc.compile.c++ /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/assoc_legendre.o g++: unrecognized option `-pthread' cc1plus: error: unrecognized option `-Winvalid-pch' "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fPIC -Winvalid-pch -DBOOST_ALL_NO_LIB=1 -DBOOST_BUILD_PCH_ENABLED -DBOOST_MATH_TR1_DYN_LINK=1 -DNDEBUG -I"/export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/../src/tr1" -I"." -I"libs/math/src/tr1" -c -o "/export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/assoc_legendre.o" "libs/math/build/../src/tr1/assoc_legendre.cpp" ...failed gcc.compile.c++ /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/assoc_legendre.o... gcc.compile.c++ /export/home/devuser/Boost_1_43_0/boost_1_43_0/tmp/libs/boost/bin.v2/libs/math/build/gcc-3.3.1/release/threading-multi/beta.o g++: unrecognized option `-pthread' cc1plus: error: unrecognized option `-Winvalid-pch' Am i missing something?Is there any specific HP-UX version or any minimum gcc version that is required to build boost 1_43_0? Regards, Nakul Virmani

1 0

Using subscript operator with interprocess map
by Michi Mutsuzaki 08 Sep '10

08 Sep '10

El 03/09/2010 9:18, Michi Mutsuzaki escribió: > char_string needs an allocator in its constructor (not tested code): > (*mymap)[char_string("key", alloc_inst)] = 1; Thanks Ion, that fixed the compilation error. Now I'm trying create a map from char_string to char_string, and that's failing. Here is the code and the error message I'm getting (I'm really sorry I keep posting about compilation errors, but I'm having hard time parsing the error message): #include <functional> #include <iostream> #include <algorithm> #include <boost/interprocess/managed_mapped_file.hpp> #include <boost/interprocess/containers/map.hpp> #include <boost/interprocess/containers/string.hpp> #include <boost/interprocess/allocators/allocator.hpp> namespace bi = boost::interprocess; typedef bi::allocator<char, bi::managed_mapped_file::segment_manager> char_alloc; typedef bi::basic_string<char, std::char_traits<char>, char_alloc> char_string; typedef std::pair<const char_string, char_string> ValueType; typedef bi::allocator<ValueType, bi::managed_mapped_file::segment_manager> map_alloc; typedef bi::map<char_string, char_string, std::less<char_string>, map_alloc> MyMap; int main () { bi::managed_mapped_file segment(bi::open_or_create, "/tmp/test", 65536); map_alloc alloc_inst (segment.get_segment_manager()); char_alloc alloc_inst2 (segment.get_segment_manager()); MyMap *mymap = segment.find_or_construct<MyMap>("MyMap") (std::less<char_string>(), alloc_inst); (*mymap)[char_string("key", alloc_inst2)] = char_string("val", alloc_inst2); return 0; } /usr/local/include/boost/interprocess/containers/map.hpp: In instantiation of `T& boost::interprocess::map<Key, T, Pred, Alloc>::operator[](const typename boost::interprocess::detail::rbtree<Key, std::pair<const Key, T>, boost::interprocess::detail::select1st<std::pair<const Key, T> >, Pred, Alloc>::key_type&) [with Key = char_string, T = char_string, Pred = std::less<char_string>, Alloc = map_alloc]': boost_test.cc:27: instantiated from here /usr/local/include/boost/interprocess/containers/map.hpp:325: error: no matching function for call to `boost::interprocess::allocator<char, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >::allocator()' /usr/local/include/boost/interprocess/allocators/allocator.hpp:135: note: candidates are: boost::interprocess::allocator<T, SegmentManager>::allocator(const boost::interprocess::allocator<T, SegmentManager>&) [with T = char, SegmentManager = boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index>] /usr/local/include/boost/interprocess/allocators/allocator.hpp:130: note: boost::interprocess::allocator<T, SegmentManager>::allocator(SegmentManager*) [with T = char, SegmentManager = boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index>]

1 0

Re: [Boost-users] [MSM] stack overflow happens when there is a false-guard anonymous transition
by Christophe Henry 07 Sep '10

07 Sep '10

<snip previous discussion> > Thanks for getting me on the same page. I think completion events are > peculiar only in the sense that their event is implicitly generated. > Run-to-completion step semantics must still be obeyed as well as guards > must be evaluated only once. Yes, I agree on this. This is now the trunk state. > If the completion event has been dispatched and it fails to take a > transition I believe the state is now quiescent (for reasons articulated > earlier). I also see it that way after re-reading the standard. > So... how do we exit? The *only* way to exit via the completion > transition is for a completion event to be dispatched again. How can > this happen? Via a self transition (or compound transition that returns) > or via hierarchical search and a return to history. > > > ----------- ----------- > ----->| | [g] | | > | S1 |--------->| S2 | > -->| entry/F1 | | | > | | exit/F2 | | | > | |__________| |_________| > |____| > E You are probably right from a Standard perspective (IIUC) but it is not a very elegant solution. Worse, those using completion events often write a complete state machine this way, and this method will almost double their number of transitions, which will cost much in compile-time. > I think executing process_completion is actually a violation of the > model (UML). Completion events occur based on a well defined set of > rules. Failure to take a completion transition because of a guard is by > design or implementation (intentional or a flaw). A new event must be > processed that results in a completion event to be dispatched for the > evaluation to occur again. It also rubs me wrong because > run-to-completion steps are always initiated via an event being > dispatched. process_completion would produce a second "interface" for > injecting behavior. > > My recommendation would be to stick with the standard. Typically the > side affects of entry F1 or transition E will result in the evaluation > of g to true. If simply calling process_completion again results in g > becoming true it means significant state changes outside of the state > machine (or in a parallel machine). In my opinion, this would be an > indicator of a bad design. The one place where I do something similar is > when "polling" real hardware; however, I use the above configuration and > trigger E to evaluate g in a predictable manner. As msm is used in embedded systems, there is plenty of hardware and it seems a valid use case. Anyway, thinking about it again today, I realized that we do not need process_completion. I'm wondering how I could miss this. As completion events are defined for msm as having the event "none", the same effect can be achieved by simply calling: fsm.process_event(none()); And now we are UML-conform. We have our completion semantics for the first time the source state becomes active, and our standard event semantics using "none" as event. And this costs us no extra transition. Now this is a win-win scenario :) So, process_completion is out :) > As for the "wildcard" or any trigger, ROOM had this notion and I have > used it extensively over the years. In 13.3.1 you will find > AnyReceiveEvent. A transition trigger can be associated with this > message event which would specify the transition should be triggered by > receipt of any message. I don't think MSM encompasses the Communications > Package models and this may be a stretch to get working. BTW, MSM does not have the wildcard concept (yet) but is coming pretty close using a base event. If you define in your fsm an event called "any_event" and all your other events inherit from any_event: struct eventA : public any_event{}; struct eventB : public any_event{}; The following transition: Row<State1, any_event, State2> Will fire if you throw at it an any_event, an eventA or an eventB. It's not perfect but it will help until I find a better solution. Thanks for your very useful insights! Regards, Christophe

2 1

Boost::config
by Jean-Sebastien Stoezel 07 Sep '10

07 Sep '10

Hello, Could somebody suggest a good tutorial for the Boost::config library. More precisely, how to parse from files, and use section names: http://www.boost.org/doc/libs/1_44_0/doc/html/program_options/overview.html… Thanks! Jean

1 0

How do I use random_device?
by Raphael MD 07 Sep '10

07 Sep '10

Hi everyone! I need to use random_device for generating non deterministic random numbers, but I don't know how to use this class, it's very confusing, I don't understand it. I'm using linux. My example code: using namespace std; #include <iostream> #include <string> #include <boost/timer.hpp> #include <boost/nondet_random.hpp> int main() { boost::random_device::result_type min(1); boost::random_device::result_type max(60); boost::random_device dev; } Thanks for help.

2 1