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

[proto] Wrapper compile error
by David A. Greene 02 Feb '10

02 Feb '10

Eric, Here's a message I've owed you for a while. I mentioned a compile error with the ADL example for expression wrappers. I've attached a testcase. Uncommenting the commented bits and compiling with g++ results in an error message which leads me to believe that somewhere in the guts of proto there's an expectation that wrappers have one template argument. Usually this gets solved by using metafunction classes. Or, more likely, I'm just doing something wrong. :) -Dave

2 1

Help with custom classes PLEASE!!
by Daniel Veneros 02 Feb '10

02 Feb '10

Hi, I am trying to create a shared memory segment where I can share a STRING between 2 process, I tried using the following code: *In the "main" process:* #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <cstdlib> #include <string> #include <iostream> using namespace boost::interprocess; typedef allocator<std::string, managed_shared_memory::segment_manager> ShMemAllocator; typedef vector<std::string, ShMemAllocator> MyVector; int main(int argc, char** argv) { struct shm_remove { shm_remove() {shared_memory_object::remove("MySharedMemory"); } ~shm_remove() {shared_memory_object::remove("MySharedMemory"); } }remover; managed_shared_memory segment(create_only, "MySharedMemory", 65536); const ShMemAllocator alloc_inst(segment.get_segment_manager()); MyVector *myVector = segment.construct<MyVector>("MyVector" )(alloc_inst); myVector->push_back("a"); int stop; //this line helps me wait until i run the other process std::cin >> stop; return (EXIT_SUCCESS); } *at the "client" process:* #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/interprocess/containers/vector.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <cstdlib> #include <string> #include <iostream> using namespace boost::interprocess; typedef allocator<std::string, managed_shared_memory::segment_manager> ShMemAllocator; typedef vector<std::string, ShMemAllocator> MyVector; int main(int argc, char** argv) { managed_shared_memory segment(open_only, "MySharedMemory"); MyVector *myVector = segment.find<MyVector>("MyVector").first; std::cout << "myVector size: " << myVector->at(0) << std::endl; return (EXIT_SUCCESS); } When I run both I receive an error "Segmentation Fault, Core Dumped"... Does anyone know how to solve this? Thanks Dann

2 5

Re: [Boost-users] generate structs with all combinations of members from a given struct
by Hicham Mouline 02 Feb '10

02 Feb '10

----- Original Message ----- From: Hicham Mouline To: boost-users(a)lists.boost.org Sent: Monday, February 01, 2010 12:09 PM Subject: Re: [Boost-users] generate structs with all combinations of members from a given struct My previous runtime solution was wrong. I just fixed it now. #include <iostream> #include <list> typedef std::list< std::list<size_t> > main_list_t; void combinations(main_list_t& m, const size_t* arr, size_t arrsize) { if (arrsize==0) return; const std::list<size_t> empty_list; std::list<size_t> l( m.empty()? empty_list: m.back() ); for (size_t s=0; s<arrsize; ++s) { l.push_back( arr[s] ); m.push_back(l); l.pop_back(); combinations(m, arr+s+1, arrsize-s-1); } } int main() { const size_t arr[] = { 1, 2, 3, 4, 5 }; const size_t arrsize = sizeof(arr)/sizeof(size_t); main_list_t mm; combinations(mm, arr, arrsize); std::cout<< "size="<< mm.size() <<std::endl; for (main_list_t::const_iterator i = mm.begin(); i!=mm.end(); ++i) { const std::list<size_t>& l = *i; for (std::list<size_t>::const_iterator ii = l.begin(); ii!=l.end(); ++ii) { std::cout<< *ii << '\t'; } std::cout<<std::endl; } }

3 4

More problems...
by Daniel Veneros 02 Feb '10

02 Feb '10

Sorry to bother with this questions... What I am trying to do is: Share MAP objects between several process, the map I need to share is something like this: map<string, Employee> myMap; String is the key and the value has to be a custom class or a struct... I tried this but I got lots of errors: struct Employee { std::string name; int age; }; managed_shared_memory segment(create_only, "MySharedMemory", 65536); typedef std::pair<boost::interprocess::basic_string, Employee> ValueType; typedef allocator<ValueType, managed_shared_memory::segment_manager> ShMemAllocator; typedef map<StrAllocator, EmpAllocator, NULL, ShMemAllocator> MyMap; ShMemAllocator alloc_inst (segment.get_segment_manager()); MyMap m*mymap = segment.construct<MyMap>("MyMap")(alloc_inst); //to insert just one value: Employee John; john.name = "Johnny"; john.age = 25; mymap->insert(std::pair<"Hello", john>(boost::interprocess::basic_string, Employee); Actually I don't know what other path should I take on this... Could anyone please help me fix this portion of code? Thank you very much. Dann

2 1

xlC 6.0 building math lib - Errors
by Radha 02 Feb '10

02 Feb '10

Hi Team, I am trying to compile boost math library using xlC version 6 on Aix 5.3. I get the following error: "./boost/fusion/sequence/intrinsic/begin.hpp", line 54.88: 1540-0408 (S) The base class "apply<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> >" is declared but not defined. "./boost/fusion/container/vector/detail/vector_n.hpp", line 65.41: 1540-0700 (I) The previous message was produced while processing "struct boost::fusion::result_of::begin<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> >". "./boost/fusion/sequence/intrinsic/at.hpp", line 58.26: 1540-0408 (S) The base class "apply<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,mpl_::int_<0> >" is declared but not defined. "./boost/fusion/sequence/intrinsic/at.hpp", line 63.15: 1540-0700 (I) The previous message was produced while processing "struct boost::fusion::result_of::at<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,mpl_::int_<0> >". "./boost/fusion/sequence/intrinsic/at.hpp", line 62.16: 1540-0700 (I) The previous message was produced while processing "struct boost::fusion::result_of::at_c<const boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,0>". "./boost/math/tools/roots.hpp", line 41.13: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::unpack_0<boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,double>(const tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> &, double &)". "./boost/math/tools/roots.hpp", line 45.6: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::handle_zero_derivative<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double &, const double &, double &, double &, double &, const double &, const double &)". "./boost/math/tools/roots.hpp", line 274.3: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int, uintmax_t &)". "./boost/math/tools/roots.hpp", line 418.10: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int)". "./boost/math/special_functions/cbrt.hpp", line 52.18: 1540-0700 (I) The previous message was produced while processing "boost::math::detail::cbrt_imp<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::polici...". "./boost/math/special_functions/cbrt.hpp", line 61.11: 1540-0700 (I) The previous message was produced while processing "boost::math::cbrt<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_...". "libs/math/build/../src/tr1/c_policy.hpp", line 129.1: 1540-0700 (I) The previous message was produced while processing "c_policies::cbrt<double>(double)". "libs/math/build/../src/tr1/cbrt.cpp", line 16.11: 1540-0700 (I) The previous message was produced while processing "cbrt(double)". "./boost/math/tools/roots.hpp", line 42.9: 1540-0218 (S) The call does not match any parameter list for "std::tr1::get<0>". "./boost/fusion/tuple/tuple.hpp", line 82.5: 1540-1283 (I) "template <int N, class Tuple> boost::fusion::get(const Tuple &)" is not a viable candidate. "./boost/fusion/tuple/tuple.hpp", line 75.5: 1540-1283 (I) "template <int N, class Tuple> boost::fusion::get(Tuple &)" is not a viable candidate. "./boost/math/tools/roots.hpp", line 41.13: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::unpack_0<boost::fusion::tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_>,double>(const tuple<double,double,double,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_,boost::fusion::void_> &, double &)". "./boost/math/tools/roots.hpp", line 45.6: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::detail::handle_zero_derivative<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double &, const double &, double &, double &, double &, const double &, const double &)". "./boost/math/tools/roots.hpp", line 274.3: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int, uintmax_t &)". "./boost/math/tools/roots.hpp", line 418.10: 1540-0700 (I) The previous message was produced while processing "boost::math::tools::halley_iterate<boost::math::detail::cbrt_functor<double>,double>(cbrt_functor<double>, double, double, double, int)". "./boost/math/special_functions/cbrt.hpp", line 52.18: 1540-0700 (I) The previous message was produced while processing "boost::math::detail::cbrt_imp<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::polici...". "./boost/math/special_functions/cbrt.hpp", line 61.11: 1540-0700 (I) The previous message was produced while processing "boost::math::cbrt<double,boost::math::policies::policy<boost::math::policies::domain_error<1>,boost::math::policies::pole_error<1>,boost::math::policies::overflow_error<1>,boost::math::policies::evaluation_error<1>,boost::math::policies::rounding_error<1>,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_policy,boost::math::policies::default_...". "libs/math/build/../src/tr1/c_policy.hpp", line 129.1: 1540-0700 (I) The previous message was produced while processing "c_policies::cbrt<double>(double)". "libs/math/build/../src/tr1/cbrt.cpp", line 16.11: 1540-0700 (I) The previous message was produced while processing "cbrt(double)". Is there any patch i need to apply? Any help would be much appreciated! All my search on this error didn't get me anywhere; if there is prior post on same topic and solution please let me know! Thanks, Radha

3 3

[proto] Manipulating _data
by David A. Greene 01 Feb '10

01 Feb '10

So I've had fun tinkering with my lambda-like language. I moved on to try to introduce scoping, but I'm having some trouble. I've attached a simplified example. Compiling as-is, the test outputs what I would expect. It seems like the LookupSymbol transform works brilliantly, so symbol lookup is a go. However, convincing the grammar to match an expression that invokes the AddScope transform seems more difficult. Commenting the #if clause results in an error about converting a Wrapper<...> to a shared_ptr<Base> which I can only guess means the grammar is not matching the proto expression. I've tried all sorts of different things. I don't think the UnaryPassThrough transform should be neccessary, but maybe it does't hurt either. With or without it, the error is the same. What am I missing here? Thanks! -Dave

3 2

boost::weak_ptr usage in multithreaded environments
by Virgil Palanciuc 01 Feb '10

01 Feb '10

Hello all, [long story short: I'd like to know whether a weak_ptr.lock() counts as a "shared pointer read" or as a "shared pointer write" ] I'm using boost shared pointers in an multi-threaded app. Basically, my app maintains a "forest" of "context trees" - i.e. I have a map from a "file name" to a "global context" that organizes the information for that file. The "global context" in the map is basically the root node of a tree of "local contexts" in that file. The tree is kept with boost:shared_ptr<> on the way down (father-son relations) and boost::weak_ptr<> on the way up (son->father pointers). I have added proper synchronization to the data structure... I think. I use reader/writer locks (only one writer allowed, but arbitrary number of readers) and I'm still getting sporadic crashes, especially when constructing a "global context" (root node) shared_ptr<> from a weak_ptr<> - using lock(). I am assuming in my app. that weak_ptr<>.lock() only requires a "read lock", not a "write lock".. is this true? I've checked out the page at http://www.boost.org/doc/libs/1_41_0/libs/smart_ptr/shared_ptr.htm#ThreadSa…, but there's nothing about weak_ptr there... Thanks, Virgil.

4 5

BoostCon 2010 preliminary program
by Hartmut Kaiser 01 Feb '10

01 Feb '10

Hey all, please find below a list of accepted submissions to BoostCon 2010. A tentative, fully scheduled program will be available soon. The keynote will be held by Maurice Herlihy. Maurice Herlihy is a computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to the design of concurrent algorithms, and in particular to the exposition and quantification of the properties and uses of hardware synchronization operations. He is currently (2009) a professor of computer science at Brown University and one of the leading visionaries in the field of transactional memory. Following up on this keynote we will have a full day sessions and panel discussion where we plan for 4 different groups to talk about their work on transactional memory (Mark Moir (Sun), Tatiana Shpeisman (Intel), Michael Wong (IBM), Vicente Botet (TBoost.STM)) In addition we have a high quality, distinctive, fully packed, and very diverse list of accepted talks: João P. R. Abecasis: Cross-platform development with Qt and Boost Ruediger Berlich: Distributed parametric optimization with the Geneva library Dean Michael Berris: Techniques in Flexible Header-Only C++ Network Library Implementations Michael Caisse: Using Spirit 2.1: Qi and Karma An Asio Based Flash XML Server Marshall Clow: A (proposed) MIME library for Boost Tony Van Eerd: The Basics of Lock-free Programming Joel Falcou and Jean-Thierry Lapresté: The Numerical Template Toolbox: BOOST'ed Generic Array Library for High Performance Computing Joachim Faulhaber: Boost.Alabaster (proposed): A Law Based Tester Barend Gehrels, Bruno Lalande and Mateusz Loskot: Generic Programming for Geometry Justin Gottschlich: TBoost.STM's Engine: An Efficient Software Transactional Memory Using Commit-Time Invalidatio Douglas Gregor: Clang: An Open-Source C++ Compiler Library C++ Tool-Builders Workshop Christophe Henry: Tutorial: The Meta State Machine Library V2 Ken Joyner: Revisiting Guidelines to Using Exceptions in C++ Hartmut Kaiser and Joel de Guzman: RAD Spirit Spirit History and Evolution Zachary Laine and Matt Calabrese: Instantiations Must Go! Stephan Lavavej: Data Structure Visualizers in Visual Studio 2010 Nevin Liber: Type Erasure Eric Niebler: Practical DSEL Design with Proto Roshan Naik: Logic Paradigm for C++ Stjepan Rajko: Patterns Library: a generic library for modeling, recognition, and synthesis of sequential patterns Gennadiy Rozental: Production use of Boost.Test David Sankel: Functional Programming in C++ Jeremy Siek: Generic Programming and the Boost Graph Library Robert Ramey: Is Boost Broken? Michael Wong: C++0x Update C++0x Concurrency We believe this program is reason enough to come to BoostCon this year (Aspen, CO, USA, May 10-14th)! For registration, accommodation, and more information please visit the conference website at http://www.boostcon.com. Please note the reduced early registration fee! Regards Hartmut Program Chair BoostCon 2010 --------------- Meet me at BoostCon www.boostcon.com

1 0

boost::random: get same number sequences 32/64 bit?
by Sebastian Mach 01 Feb '10

01 Feb '10

Hello list, today I found out that boost::random, at least the combination boost::mt19937 rng(<seed>); typedef boost::uniform_int<int> dist_t; dist_t dist (<min>, <max>); boost::variate_generator< boost::mt19937&, dist_t > rand_ (rng, dist); will give me different results depending on whether I use "g++ (Debian 4.3.2-1.1) 4.3.2" (with sizeof(long)=8) or "g++.exe (TDM-2 mingw32) 4.4.1" (with sizeof(long)=4). This testcase: ++ #include <boost/random.hpp> boost::mt19937 rng(1); typedef boost::uniform_int<int> dist_t; dist_t dist (0, 16); boost::variate_generator< boost::mt19937&, dist_t > rand_ (rng, dist); int main () { for (int i=0; i<6; ++i) { std::cout << rand_() << std::endl; } } -- will print 16 8 1 6 0 12 with the 64bit variant variant, but 7 16 12 15 0 2 with the 32bit variant. Is there a (preferably portable) way to ensure that they will be the same on all 32bit+ machines? Otherwise this would be a real stopper to use boost::random for me, and I'd have to go back to libcoyotl's Mersenne Twister, which gives consistent results, upon which I really depend. Sincerely Sebastian Mach phresnel(a)gmail.com

2 4

PP: how to use automatic recursion
by Hicham Mouline 01 Feb '10

01 Feb '10

Hello, I am trying to generate many types from 1 struct (for full background, please see thread "generate structs with all combinations of members from a given struct"), with the help of Boost.PP #include <boost/preprocessor/control/if.hpp> #include <boost/preprocessor/seq/size.hpp> #include <boost/preprocessor/seq/seq.hpp> #include <boost/preprocessor/seq/elem.hpp> #include <boost/preprocessor/arithmetic/sub.hpp> #include <boost/preprocessor/seq/pop_front.hpp> #include <boost/preprocessor/seq/push_back.hpp> #define STRUCTMEMBERS ((double,m1))((double,m2))((double,m3))((double,m4))((double,m5)) #define SEQ_LAST_ELEM(seq) \ BOOST_PP_SEQ_ELEM( BOOST_PP_SUB(BOOST_PP_SEQ_SIZE(seq), 1), seq) #define UPDATE_MAIN_SEQ(mainseq, globalseq)\ BOOST_PP_IF( BOOST_PP_SEQ_SIZE(mainseq),\ BOOST_PP_SEQ_PUSH_BACK(\ mainseq,\ ((SEQ_LAST_ELEM(mainseq))(BOOST_PP_SEQ_HEAD(globalseq)))\ ),\ ((BOOST_PP_SEQ_HEAD(globalseq)))\ ) #define COMBINATIONS(seq, combseq)\ BOOST_PP_IF( BOOST_PP_SEQ_SIZE(seq),\ COMBINATIONS( UPDATE_MAIN_SEQ(combseq,seq), BOOST_PP_SEQ_POP_FRONT(seq) ), \ combseq\ ) #define COMBOS COMBINATIONS(STRUCTMEMBERS, BOOST_PP_SEQ_NIL) COMBOS Reading PP docs, I just realized that the preprocessor disallows recursion ( the COMBINATIONS macro calls itself in my case), but I didn't understand the reentrancy topic page. How can I change the above code to make the recursive COMBINATIONS possible? regards,

3 2

[range_ex]"Practical" Status of boost::range, boost::range_ex, and associated algorithms
by Jesse Perla 01 Feb '10

01 Feb '10

Hi there, I am excited to start using ranges in user code with standard algorithms (mostly copy, transform, binary_searches). Is it safe for me to start using code with range/range_ex? Since the http://www.boostpro.com/vault/index.php?directory=Algorithms version hasn't been updated for a while, I was worried that there could be interface changes. I am perfectly willing to use a subset of algorithms that are expected to remain stable -Jesse

3 7

mix usage of boost.thread and pthread?
by Hua Su 01 Feb '10

01 Feb '10

Hi all, Is it OK to use both pthread and boost.thread in the same program under linux? E.g., there are two cases: 1. use pthread api to create/join/detach/cancel threads but use boost.thread's mutex/condition_variable etc. to do thread synchronization, and this_thread/sleep/get_id/thread_local_storage etc.. 2. use boost.thread api to create/join/detach/interrupt thread but use pthread api to do thread synchronization. I know boost.thread is a pthread api wrapper under linux, but I'm afraid of that the two cases above aren't safe if boost.thread uses some tricks I don't understand. Would you kindly give any hints? Thanks! Hua

5 9

[property_tree]problem with equal_range
by Ken Murphy 01 Feb '10

01 Feb '10

Hello all, I am getting an error while trying to compile the following program: #include "boost/property_tree/ptree.hpp" int main(int argc, char* argv[]) { boost::property_tree::ptree t; t.equal_range("KEY"); return 0; } Compiler output: 1>c:\hibbettlinux\src\boost-1.41.0\boost\property_tree\detail\ptree_impl 1>emen tation.hpp(448) : error C2039: 'base' : is not a member of 'boost::multi_index::detail::bidir_node_iterator<Node>' 1> with 1> [ 1> Node=boost::multi_index::detail::ordered_index_node<boost::multi_index::deta il::index_node_base<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>,std: :allocator<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>>>> 1> ] 1> c:\hibbettlinux\src\boost-1.41.0\boost\property_tree\detail\ptree_implementa tion.hpp(444) : while compiling class template member function 'std::pair<_Ty1,_Ty2> boost::property_tree::basic_ptree<Key,Data>::equal_range(const std::basic_string<_Elem,_Traits,_Ax> &)' 1> with 1> [ 1> _Ty1=boost::property_tree::basic_ptree<std::string,std::string>::assoc_itera tor, 1> _Ty2=boost::property_tree::basic_ptree<std::string,std::string>::assoc_itera tor, 1> Key=std::string, 1> Data=std::string, 1> _Elem=char, 1> _Traits=std::char_traits<char>, 1> _Ax=std::allocator<char> 1> ] 1> c:\hibbettlinux\src\platform\vc80\test\test.cpp(9) : see 1> reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>' being compiled 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] 1>c:\hibbettlinux\src\boost-1.41.0\boost\property_tree\detail\ptree_impl 1>emen tation.hpp(449) : error C2039: 'base' : is not a member of 'boost::multi_index::detail::bidir_node_iterator<Node>' 1> with 1> [ 1> Node=boost::multi_index::detail::ordered_index_node<boost::multi_index::deta il::index_node_base<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>,std: :allocator<std::pair<const std::string,boost::property_tree::basic_ptree<std::string,std::string>>>>> 1> ] I am using boost 1.41 with VC 7.1 Any help is appreciated!!!!!! Ken Murphy

3 3

Re: [Boost-users] [boost.asio] Flush serial port buffers?
by Pascal Kesseli 01 Feb '10

01 Feb '10

No ideas on this one? > Hi everyone > > My program currently writes some characters to a > device connected over the serial interface and > subsequently changes the baud rate, followed by > sending some more characters. > > The problem is that the first transfer does not > seem to complete before the baud rate switch and > thus is sent with the new baud rate, which is not > supposed to happen. What I am looking for is > something like a flush() before changing the baud > rate. Using: > > boost::asio::write(*port, buffer(buf, size), transfer_all()); > > does not seem to work. Any suggestions? > > Thanks and best regards > Pascal

2 1

Mingw: build, install, .LIB files and boost-config?
by John Pye 01 Feb '10

01 Feb '10

Hi all While I'm aware that MinGW is not one of the 'primary' platforms for MinGW, I wanted to ask a few questions to help me in the task of building a binary copy of Boost for this platform that's as good as it can be. Firstly, what would be the correct build commands to build Boost for MinGW such that I end up with both shared libraries and static libraries? What I've worked out so far is shown here: http://ascendwiki.cheme.cmu.edu/Binary_installer_for_Boost_on_MinGW Secondly, to install Boost at an arbitrary path under MinGW, what is the correct BJAM command? On MinGW, I'm not running ./configure, so the suggestions from the Unix build documentation don't make sense. By default under MinGW, if I run "bjam install", my files end up in c:\Boost but I'd like too have another target directory, so that it's possible to build even without write privileges to that folder. Is there such a thing as "bjam --install-prefix=c:/MinGW install"? Is there a way to strip out all the redundant folder levels like "release" and "gcc-mingw-3.4.5" etc? Third, using BJAM on MinGW results in .LIB files being generated. These .LIB files are NOT correctly names for use with MinGW. As far as I can tell, I have to rename them as .A files, or else do something else with them so that they'll correctly be detected by the the GCC "-l" linker flag. Finally, there was a bit of discussion on the mailing list about a year ago about providing a "boost-config" script. With the ever-changing naming conventions for Boost libs, and the possible presence of static libraries, shared libraries, -mt, -d, and other file suffixes, such a script would be INVALUABLE for people looking to access pre-built Boost binaries for their projects. It would be an almost trivial task to implement such a script -- has there been any progress on this anywhere? Can I suggest that for MinGW, a native shell script, with file paths constructed relative to the boost-config path, would probably be the best way, rather than pkg-config, which is not available in MinGW/MSYS by default. Feel free to direct me to the online documentation of this stuff if it exists -- I couldn't find it though. Cheers JP -- John Pye Dept of Engineering Australian National University http://pye.dyndns.org/

3 4

boost serialization stream error question
by Gabe Sibley 01 Feb '10

01 Feb '10

Dear All, I'm using boost serialization and have come across issues with "steam error" when I try to deseriailze from an xml or text archive. Binary archives are fine, but I can't use binary because my users need xml archives. The problem is caused by double values less than DBL_MIN. Apparently, streaming such values in causes the input stream fail_bit to be set, which causes the serialization lib to throw an exception. One work around is to make sure all double values are clamped and finite when the archive is created. I can live with this, esp. since I have algorithms that will from time to time produce non-finite results. So far what I've done is just replace BOOST_SERIALIZATION_NVP macro with the following MAKE_NVP macro that calls "FixReal": #define BOOST_SERIALIZATION_NVP(name) \ boost::serialization::make_nvp(BOOST_PP_STRINGIZE(name), name ) // Use this macro instead of BOOST_SERIALIZATION_NVP because it fixes doubles that are not streamable. // That is, it fixes double values that cause streaming errors. #define MAKE_NVP(name) \ boost::serialization::make_nvp(BOOST_PP_STRINGIZE(name), FixReal(name) ) // note the call to FixReal // does nothing -- just pass all non-double types through template<class T> inline T& FixReal( T& t ) { return t; } /// Routine to make sure doubles are streamable -- Nan, Inf, etc. cause stream errors, so we prevent them. inline double& FixReal( double& d ) { if( d < DBL_MIN ) { d = DBL_MIN; } if( d > DBL_MAX ) { d = DBL_MAX; } if( std::isnan(d) ) { d = 0; } if( std::isinf(d) ){ d = DBL_MAX; } return d; } /// We also need to fix double arrays. The ugly syntax is because // we have to pass and return a reference to an array. inline double (&FixReal( double (&d)[2] ))[2] { for( size_t ii = 0; ii < 2; ii++ ){ FixReal(d[ii]); } return d; } Ok, here's my question: How can I get the "FixReal" functionality above without having to write a specialized function for every possible double signature? For instance, I don't want to have to write inline double (&FixReal( double (&d)[3] ))[3] inline double (&FixReal( double (&d)[4] ))[4] ... etc. or any of the other POD double signatures possible. I just want the serialization library to fix the errant double values when I create the archive. I guess I could modify the "void save(const double t)" function in basic_text_oprimitive.hpp to check all doubles, but that seems like a bad plan. Any suggestions? thanks for your help, Gabe

3 7

Strange output from boost::exception diagnostic_information
by pholding 01 Feb '10

01 Feb '10

-------------------------------------------------------------------------------- I've been having a look at the diagnostic_information function in the boost exception library, but seem to be getting a strangely formatted output. The code I'm using is as follows Code: #include <boost/exception/diagnostic_information.hpp> #include <stdexcept> #include <iostream> void myerror(){ throw boost::enable_error_info(std::range_error("blah")); } int main(){ try{ myerror(); } catch(boost::exception & e){ std::cerr << diagnostic_information(e) << std::endl; } return 0; }The output is as follows: Quote: Throw in function (unknown) Dynamic exception type: N5boost16exception_detail19error_info_injectorISt1 1range_errorEE std::exception::what: blah What I don't understand is why I'm getting N5, 16, 19, ISt11 and EE between the details of the exception type. To rule out my code, I compiled the example_io.cpp file provided in the boost example documentation and I'm getting a similar output. Does anyone what is causing the strange characters displayed? I'm running Ubuntu 9.10 and the version of g++ is 4.4.1 -- View this message in context: http://old.nabble.com/Strange-output-from-boost%3A%3Aexception-diagnostic_i… Sent from the Boost - Users mailing list archive at Nabble.com.

5 5

Re: [Boost-users] [BGL] Color Maps
by pablo barrio lópez-cortijo 31 Jan '10

31 Jan '10

Hi Andrew, thanks for your help. > I would recommend using the named parameter version of the call since it lets you omit optional parameters. It seems like the right approach. So now my code is as follows: typedef graph_traits<graph_t>::vertex_descriptor Vertex; Vertex source; ... some code that finds the appropriate vertex // DFSActions is the DFS visitor, with actions on vertex discover and finish DFSActions actions(this); // Calling DFS with named parameters depth_first_search(*g, visitor(actions), root_vertex(source)); Problem: the code doesn't compile, and I'm sure the fault is in "root_vertex(source)". This is the (very synthesized) error thrown by the compiler: property_map.hpp: In instantiation of ‘boost::property_traits<boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property> >’: depth_first_search.hpp:192: instantiated from ‘void boost::depth_first_search( long line ) [ with REALLY long line ]’ depth_first_search.hpp:222: instantiated from ‘void boost::depth_first_search( long line ) [ with REALLY long line ]’ graphdef.cpp:134: instantiated from here graphdef.cpp:134: instantiated from here property_map.hpp:31: error: no type named ‘key_type’ in ‘struct boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property>’ property_map.hpp:33: error: no type named ‘reference’ in ‘struct boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property>’ property_map.hpp:34: error: no type named ‘category’ in ‘struct boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::no_property>’ And many other errors, but this is the first one. To check if the problem was in my "source" vertex, I changed the call to DFS with the default value for the root_vertex (looked up in the header file): depth_first_search(*g, visitor(actions), root_vertex(*vertices(*g).first)); The error keeps showing. Having a look at the DFS source code, it seems that the named param function expects a root_vertex of type root_vertex_t, which appears several times in the error msg. The Boost docs specify a type of graph_traits<graph_t>::vertex_descriptor, which is what I'm using now. I suppose it's the same type, but I've not found the type definition. I'm sure it must be a very stupid mistake, but I can't see it. Any clues?

2 1

[circular_buffer] Serialization support for circular_buffer
by Brian Wood 31 Jan '10

31 Jan '10

B"H Shalom, Boost, The C++ Middleware Writer now supports marshalling circular_buffers. This is done by transmitting a circular buffer's capacity, then size, followed by it's elements. An example of the code used when marshalling a circular_buffer is here -- http://webEbenezer.net/posts/cirbuf.hh. -- Brian Wood http://www.webEbenezer.net (651) 251-9384

1 0

Can someone provide an Asio Serial Port example?
by Jeff 30 Jan '10

30 Jan '10

I would like to use Asio to connect to a microcontroller to send and read from, but there are no serial_port samples available. For instance, I would like to type an ‘a’ into the keyboard and have the microcontroller return 1. The microcontroller is already programmed for this but I need to create an interface for it. A sample that does this or any working sample at all would be sincerely appreciated. Thank you, Jeff

5 4

std::list customization
by Etienne Philip Pretorius 30 Jan '10

30 Jan '10

Hello List, I know this is not boost specific, but I would appreciate any comments about the following. I have a specific set of values stored in a std::list<unsigned char>. As expected I can delete and add items anywhere, since I am using the std::list object rearrange its own contents. But here is the problem - when I have already decided that item at position 13 should always remain at position 13 if the list has 13 or more objects in it... If I remove an item from the beginning then the item at position 13 becomes the item at position 12, while this is undesired - the effect of shifting everything else on by one value is desired. Some examples of what I require: Fixed position marked with []. a,b,c,[d],e,f pop_front() is called b,c,e,[d],f This list object should also work when inserting items and keep those with fixed positions at their position if the object size allows it. Any suggestions, Ideas on how to implement this would be greatly appreciated. Kind Regards, Etienne

2 2

[mpl - function_types] Generate typedef from operator() of a functor
by Olivier Tournaire 30 Jan '10

30 Jan '10

Hi all, Given an mpl sequence of types such as: typedef mpl::vector<T0, T1, T2, T3> arg_types; 1) the users of my library provide functors such as F (where T0 and T1 may have been any of the types of arg_types: class F { typedef mpl::pair<T0,T1> signature_type; double operator()(const T0& t0, T1& t1); }; is there a way to generate signature_type automatically ? 2) if the operator() is overloaded, the user class currently has to typedef an mpl::vector of mpl::pairs such as class G { typedef mpl::vector<mpl::pair<T2,T3>, mpl::pair<T1,T1>, mpl::pair<T3,T1> > signature_type; double operator()(const T2& t2, T3& t3); double operator()(const T1& t1, T1& t1); double operator()(const T3& t3, T1& t1); }; in this case, is it also possible to generate signature_type automatically ? Regrads, Olivier

2 3

[function_types] About parameter_types
by Olivier Tournaire 30 Jan '10

30 Jan '10

Hi all, I am trying to extract the parameters types of a given function/functor in a mpl sequence. Digging boost libraries, I came across function_types, and in particular parameter_types, which might be the right tool. However, I cannot figure how to use it. Could you please help ? Suppose I have: void foo(int, double); And would like to generate the following sequence: mpl::vector<int, double> How can I do that ? Regards, Olivier

2 2

[doc] Add "Last Update" information
by Marco Guazzone 30 Jan '10

30 Jan '10

Dear Boosters, In my opinion it would be very helpful if the documentation include for each library the version of the last update. For instance, one could add this information in the summary page (http://www.boost.org/doc/libs/1_41_0) --- [snip] --- uBLAS uBLAS provides matrix and vector classes ... Author(s)...........Joerg Walter and Mathias Koch First Release...1.29.0 -> Last Update......1.40.0 <- Standard Build & Link......Header only Categories........Math and numerics --- [/snip] --- The reason for this is that it should simplify the discovery of what version of Boost one needs for his own software project. As a matter of fact, the use of "First Release" might not be sufficient because after the initial release of a library many other features could have been added. So the need for this additional piece of information. What do you think? Regards, -- Marco

1 0

asio UDP local port binding issue on Windows
by akos＠maroy.hu 30 Jan '10

30 Jan '10

Hi, I seem to encounter an issue when using boost asio. I'm trying to create a UDP client-server environment, where for the client I'm creating an asio socket like this: io_service _io_service; ip::udp::socket _socket(_io_service, ip::udp::v4()); my expectation at this point is that the _socket is created, and it can send and receive UDP packets. this includes receiving packets, which also means that the socket is bound to some random port on the local network interface. now this is all true on Linux and MacOS, but on Windows, the socket does not seem to bind to a port. interestingly, for _socket.is_open() I get true in return. but for _socket.local_endpoint(), I get an error excaption with the error code 10022, which is defined as WSAEINVAL. I also tried the following, and got the same results: io_service _io_service; ip::udp::socket _socket(_io_service); _socket.open(ip::udp::v4()); is my assumption that the above should result in a socket bound to a local random port incorrect? Akos

1 0