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

Thread object pointers.
by Albert Schueller 04 Aug '10

04 Aug '10

Tue Aug 3 14:10:04 PDT 2010 Hi all, I'm trying to get up to speed on libboost's thread class using the tutorial information here: http://www.drdobbs.com/cpp/184401518 I'm curious why the two programs below seem to behave differently. In LISTING 1, three threads are declared as thrd1, thrd2, and thrd3 explicitly and each loops 10 times with random length sleeps. LISTING 2 is identical, except for the fact the three thread variables are allocated to boost::thread pointers. When I run LISTING 1 it appears that the threads are acting independently as I would hope. When I run LISTING 2, it seems that the threads are not independent, but rather thrd1 does its job, followed by thrd2, followed by thrd3. Am I not locking properly? Any help would be appreciated. Albert /////////////////////////////////////////////////////////////////////////// //LISTING 1 #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <iostream> #include <unistd.h> #include <cstdlib> boost::mutex io_mutex; struct count { count(int id) : id(id) { } void operator()() { int upause; for (int i = 0; i < 10; ++i) { upause = rand()%1000000; usleep(upause); boost::mutex::scoped_lock lock(io_mutex); std::cout << id << ": " << i << " paused " << upause << std::endl; } } int id; }; int main(int argc, char* argv[]) { boost::thread thrd1(count(1)); boost::thread thrd2(count(2)); boost::thread thrd3(count(3)); thrd1.join(); thrd2.join(); thrd3.join(); return 0; } /////////////////////////////////////////////////////////////////////////// //LISTING 2 #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <iostream> #include <unistd.h> #include <cstdlib> boost::mutex io_mutex; struct count { count(int id) : id(id) { } void operator()() { int upause; for (int i = 0; i < 10; ++i) { upause = rand()%1000000; usleep(upause); boost::mutex::scoped_lock lock(io_mutex); std::cout << id << ": " << i << "paused (" << upause << ")" << std::endl; } } int id; }; int main(int argc, char* argv[]) { int i; int num_thrds = 3; boost::thread *thrd[4]; for(i=0;i<num_thrds;i++) { thrd[i] = new boost::thread(count(i+1)); thrd[i]->join(); } // deallocate thread objects for(i=0;i<num_thrds;i++) { delete thrd[i]; } return 0; }

5 7

Open a filename with a wstring or wchar_t *
by Timothy Madden 03 Aug '10

03 Aug '10

Hello Surprisingly enough, C++ file-based streams can be opened with a char * string (for the filename) only, while modern computer systems have Unicode filenames. I see boost::iostreams::basic_file also gets constructed from a char * only. My project name has Korean characters, and I work on a Latin1 Windows system, and on my system the narrow-characters set simply does not contain Korean characters. Is there a (good) way to open a file with a wstring in boost ? Thank you, Timothy Madden

6 14

Problem with boost::bind, boost::shared_ptr and std::find_if algorithm
by przemyslaw.sliwa＠uk.bnpparibas.com 03 Aug '10

03 Aug '10

All, I have the following data sructure: struct WeightedTimeHolder { double time; double dt; double weight; double dailyVol; double varDelta_t; double cutToCutdailyVol; double extraVar; double varPlusEventVar; double aggrVar; double implVol; int cut; } and typedef multimap<int, boost::shared_ptr<WeightedTimeHolder> > DataMap. Now given value of cut in this data structure I would like to find the next position in DataMap which corresposnds to this gven value, I do it in the following manner: void nextPositionForCut(DataMap::iterator& pos, CutOffType cut) const { if((*pos).second->cut!=cut) while((*(++pos)).second->cut!=cut && pos!=m_pData->end()) {} // convert to boost::bind for better use! //pos = find_if(pos, m_pData->end(), boost::bind(&DataMap::value_type::second::value_type::cut, _1) == cut); } Since this looks really ugly I would like to ask you how this can be converto to find_if algorithm with a little help of boost::bind. I tried but could not succees. Thanks for help, Przemyslaw ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

2 1

[multi_index] modify~~
by isjk 03 Aug '10

03 Aug '10

hi, now, I have two structures like this, struct peer { int guid_; }; struct channel { int md5_; peer* pr_; int prop_; }; ------------------------------------------ peer and channel is many to many. using example6::key_from_key class; ------------------------------------------ typedef multi_index_container< peer, index_by< ordered_unique< BOOST_MULTI_INDEX_MEMBER(peer, int, guid_) > > >peer_table; typedef multi_index_container< channel, index_by< ordered_non_unique< BOOST_MULTI_INDEX_MEMBER(channel, int, md5_) > > >channel_table; typedef multi_index_container< const channel*, ordered_non_unique< key_from_key< BOOST_MULTI_INDEX_MEMBER(peer, const int, guid_), BOOST_MULTI_INDEX_MEMBER(channel, const peer*, pr_) > > >channel_table_pr_view; peer_table pt; channel_table ct; /// insert very much data.... nth_index<channel_table, 0>::type ic0,ic1; boost::tie(ic0, ic1) = get<0>(ct).equal_range(md5_); channel_table_pr_view ctpv; while (ic0 != ic1) { ctpv.insert(&*ic0); ++ic0; } channel_table_pr_view::iterator ictpv = ctpv.find(guid_); if (ictpv != ctpv.end()) { ctpv.modify(ictpv, _Modify_prop()); // right or not? } struct _Modify_prop{ void operator()(channel& cl_) { cl_.prop = rand(); } }; I want to modify channel' s prop. thanks. -- View this message in context: http://old.nabble.com/-multi_index--modify%7E%7E-tp29322711p29322711.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

Question regarding using asn1 boost libraries
by Mupparthy Ravindranath 03 Aug '10

03 Aug '10

Dear friends, From the URL "http://www.ibusy.com/devtree/asn1/boost_asn1/linking.html", I learnt that boost has support for ASN1 (Abstract Syntax Notation) encoding and decoding using BER (Basic Encoding Rules). But when I downloaded the boost tar zip file, i could not find the below header file(s): #include <boost/asn1/asn1.hpp> Can someone help me where to get the ASN1 support header files for boost... Thanks and regards, RV

3 2

boost install error
by Jack Bryan 02 Aug '10

02 Aug '10

Dear All:I am trying to install boost on MPI clsuter with MPICH2. After ./bjam install, I compile a test program provided by boost.org .But I got errors: The program is :-----------------------------------------------------------------#include <iostream>#include <boost/mpi/environment.hpp>#include <boost/mpi/communicator.hpp>namespace mpi = boost::mpi;int main(int argc, char* argv[]){ mpi::environment env(argc, argv); mpi::communicator world; std::cout << "I am process " << world.rank() << " of " << world.size() << "." << std::endl; return 0;}--------------------------------------------------------------Errors: ------------------------------------------------------------------mpic++ -o testp2p test_p2p.cpp -I/home/boost_2010_8_1/boost_1_43_0 -L/home/boost_2010_8_1/boost_1_43_0/stage/lib -lboost_mpi -lboost_serialization/usr/bin/ld: warning: liblam.so.0, needed by /home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so, not found (try using -rpath or -rpath-link)/usr/bin/ld: warning: liblamf77mpi.so.0, needed by /home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so, not found (try using -rpath or -rpath-link)/usr/bin/ld: warning: liblammpi++.so.0, needed by /home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so, not found (try using -rpath or -rpath-link)/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_short'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_unsigned'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `PMPI::Comm::mpi_comm_map'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `op_intercept'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_errors_return'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `PMPI::Intracomm::current_op'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_comm_world'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_unsigned_char'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_char'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `PMPI::Comm::mpi_err_map'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_group_empty'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_packed'collect2: ld returned 1 exit status-------------------------------------------------------------------It seems that it needs LAM/MPI. But, the LAM/MPI has been installed: PATH=/home/openmpi_123/bin:/home/boost_2010_8_1/boost_1_43_0: .......I used ./bjam --prefix=mypathand then ./bjam and then ./bjam installAny help is appreciated. Any help is appreciated. thanksJackAug. 1 2010

1 0

Re: [Boost-users] [Polygon] Test among 3 libraries
by TONGARI 02 Aug '10

02 Aug '10

OvermindDL1 wrote: >Cannot download your files, says they are unavailable (although I see >them fine...). They should be available now. Seems like permission to folder only not applies to its items.

1 0

[Serialization] Diamond shaped inheritance and serialization methods specialization
by Robert Bigaignon 02 Aug '10

02 Aug '10

Hi all, I'm having trouble with Boost's serialization library that I'm trying to integrate with an existing class hierarchy that used MFC toolkit as the archiver. It seems that when a serializable class defines a specialized save (or load or serialize for that matter) in addition to the generic method, the serialization library gets confused and ends up not identify properly that the hierarchy of serializable classes uses multiple inheritance and in particular diamond-shaped inheritance. I've reproduced the problem using the test_diamond code example provided with Boost 1.43 using MS VC 9.0 by adding a save method specialized for archive::text_oarchive to the derived1 class defined in test_diamond.cpp. The following diff shows the implementation of this specialized method: -----8<----- --- ../temp/boost_1_43_0/boost_1_43_0/libs/serialization/test/test_diamond.cpp Wed Jul 14 11:28:02 2010 +++ ../serializationProto.cpp Wed Jul 28 13:05:47 2010 @@ -95,6 +97,13 @@ ar << BOOST_SERIALIZATION_BASE_OBJECT_NVP(base); } + template<> + void save(boost::archive::text_oarchive &ar, const unsigned int i) const + { + std::cout << "Saving (Text) derived1\n"; + ar << BOOST_SERIALIZATION_BASE_OBJECT_NVP(base); + } + template<class Archive> void load(Archive & ar, const unsigned int /* file_version */) { @@ -122,6 +131,7 @@ } BOOST_SERIALIZATION_SPLIT_MEMBER() + }; class final : public derived1, public derived2 { @@ -202,3 +212,219 @@ return EXIT_SUCCESS; } ----->8----- Adding the following function definition to will result in an access violation (see call stack bellow) in access.hpp @ line 136. Any idea as to what is intrinsically wrong with code or how to fix this issue is most welcome. Call stack: > serializationProtoArchiversWrappers.exe!boost::serialization::access::cast_reference<base const ,derived2 const >(const derived2 & u={...}) Line 136 + 0x1a bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::base_object<base,derived2 const >(const derived2 & d={...}) Line 105 + 0x9 bytes C++ serializationProtoArchiversWrappers.exe!derived2::save<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int __formal=0) Line 134 + 0x9 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::member_save<boost::archive::text_oarchive,derived2 const >(boost::archive::text_oarchive & ar={...}, const derived2 & t={...}, const unsigned int file_version=0) Line 94 C++ serializationProtoArchiversWrappers.exe!boost::serialization::detail::member_saver<boost::archive::text_oarchive,derived2>::invoke(boost::archive::text_oarchive & ar={...}, const derived2 & t={...}, const unsigned int file_version=0) Line 43 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::split_member<boost::archive::text_oarchive,derived2>(boost::archive::text_oarchive & ar={...}, derived2 & t={...}, const unsigned int file_version=0) Line 69 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!derived2::serialize<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int file_version=0) Line 144 + 0x34 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::serialize<boost::archive::text_oarchive,derived2>(boost::archive::text_oarchive & ar={...}, derived2 & t={...}, const unsigned int file_version=0) Line 119 C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize<boost::archive::text_oarchive,derived2>(boost::archive::text_oarchive & ar={...}, derived2 & t={...}, const unsigned int file_version=0) Line 74 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize_adl<boost::archive::text_oarchive,derived2>(boost::archive::text_oarchive & ar={...}, derived2 & t={...}, const unsigned int file_version=0) Line 133 + 0x18 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::oserializer<boost::archive::text_oarchive,derived2>::save_object_data(boost::archive::detail::basic_oarchive & ar={...}, const void * x=0x0034de3c) Line 152 + 0x3e bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::basic_oarchive_impl::save_object(boost::archive::detail::basic_oarchive & ar={...}, const void * t=0x0034de3c, const boost::archive::detail::basic_oserializer & bos={...}) Line 285 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::basic_oarchive::save_object(const void * x=0x0034de3c, const boost::archive::detail::basic_oserializer & bos={...}) Line 434 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::save_standard::invoke<derived2>(boost::archive::text_oarchive & ar={...}, const derived2 & t={...}) Line 259 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::invoke<derived2>(boost::archive::text_oarchive & ar={...}, const derived2 & t={...}) Line 308 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::save<boost::archive::text_oarchive,derived2 const >(boost::archive::text_oarchive & ar={...}, const derived2 & t={...}) Line 525 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::common_oarchive<boost::archive::text_oarchive>::save_override<derived2 const >(const derived2 & t={...}, int __formal=0) Line 69 + 0x15 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::basic_text_oarchive<boost::archive::text_oarchive>::save_override<derived2 const >(const derived2 & t={...}, int __formal=0) Line 81 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::interface_oarchive<boost::archive::text_oarchive>::operator<<<derived2 const >(const derived2 & t={...}) Line 64 C++ serializationProtoArchiversWrappers.exe!boost::serialization::nvp<derived2 const >::save<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int __formal=0) Line 80 C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::member_save<boost::archive::text_oarchive,boost::serialization::nvp<derived2 const > const >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<derived2 const > & t={...}, const unsigned int file_version=0) Line 94 C++ serializationProtoArchiversWrappers.exe!boost::serialization::detail::member_saver<boost::archive::text_oarchive,boost::serialization::nvp<derived2 const > >::invoke(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<derived2 const > & t={...}, const unsigned int file_version=0) Line 43 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::split_member<boost::archive::text_oarchive,boost::serialization::nvp<derived2 const > >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<derived2 const > & t={...}, const unsigned int file_version=0) Line 69 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::nvp<derived2 const >::serialize<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int file_version=0) Line 89 + 0x34 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::serialize<boost::archive::text_oarchive,boost::serialization::nvp<derived2 const > >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<derived2 const > & t={...}, const unsigned int file_version=0) Line 119 C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize<boost::archive::text_oarchive,boost::serialization::nvp<derived2 const > >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<derived2 const > & t={...}, const unsigned int file_version=0) Line 74 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize_adl<boost::archive::text_oarchive,boost::serialization::nvp<derived2 const > >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<derived2 const > & t={...}, const unsigned int file_version=0) Line 133 + 0x18 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::save_only::invoke<boost::serialization::nvp<derived2 const > >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<derived2 const > & t={...}) Line 245 + 0xf bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::invoke<boost::serialization::nvp<derived2 const > >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<derived2 const > & t={...}) Line 308 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::save<boost::archive::text_oarchive,boost::serialization::nvp<derived2 const > const >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<derived2 const > & t={...}) Line 525 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::common_oarchive<boost::archive::text_oarchive>::save_override<boost::serialization::nvp<derived2 const > const >(const boost::serialization::nvp<derived2 const > & t={...}, int __formal=0) Line 69 + 0x15 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::basic_text_oarchive<boost::archive::text_oarchive>::save_override<boost::serialization::nvp<derived2 const > const >(const boost::serialization::nvp<derived2 const > & t={...}, int __formal=0) Line 81 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::interface_oarchive<boost::archive::text_oarchive>::operator<<<boost::serialization::nvp<derived2 const > const >(const boost::serialization::nvp<derived2 const > & t={...}) Line 64 C++ serializationProtoArchiversWrappers.exe!final::save<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int __formal=0) Line 159 C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::member_save<boost::archive::text_oarchive,final const >(boost::archive::text_oarchive & ar={...}, const final & t={...}, const unsigned int file_version=0) Line 94 C++ serializationProtoArchiversWrappers.exe!boost::serialization::detail::member_saver<boost::archive::text_oarchive,final>::invoke(boost::archive::text_oarchive & ar={...}, const final & t={...}, const unsigned int file_version=0) Line 43 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::split_member<boost::archive::text_oarchive,final>(boost::archive::text_oarchive & ar={...}, final & t={...}, const unsigned int file_version=0) Line 69 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!final::serialize<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int file_version=0) Line 169 + 0x34 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::serialize<boost::archive::text_oarchive,final>(boost::archive::text_oarchive & ar={...}, final & t={...}, const unsigned int file_version=0) Line 119 C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize<boost::archive::text_oarchive,final>(boost::archive::text_oarchive & ar={...}, final & t={...}, const unsigned int file_version=0) Line 74 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize_adl<boost::archive::text_oarchive,final>(boost::archive::text_oarchive & ar={...}, final & t={...}, const unsigned int file_version=0) Line 133 + 0x18 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::oserializer<boost::archive::text_oarchive,final>::save_object_data(boost::archive::detail::basic_oarchive & ar={...}, const void * x=0x0034de38) Line 152 + 0x3e bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::basic_oarchive_impl::save_object(boost::archive::detail::basic_oarchive & ar={...}, const void * t=0x0034de38, const boost::archive::detail::basic_oserializer & bos={...}) Line 265 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::basic_oarchive::save_object(const void * x=0x0034de38, const boost::archive::detail::basic_oserializer & bos={...}) Line 434 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::save_standard::invoke<final>(boost::archive::text_oarchive & ar={...}, const final & t={...}) Line 259 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::invoke<final>(boost::archive::text_oarchive & ar={...}, const final & t={...}) Line 308 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::save<boost::archive::text_oarchive,final const >(boost::archive::text_oarchive & ar={...}, const final & t={...}) Line 525 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::common_oarchive<boost::archive::text_oarchive>::save_override<final const >(const final & t={...}, int __formal=0) Line 69 + 0x15 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::basic_text_oarchive<boost::archive::text_oarchive>::save_override<final const >(const final & t={...}, int __formal=0) Line 81 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::interface_oarchive<boost::archive::text_oarchive>::operator<<<final const >(const final & t={...}) Line 64 C++ serializationProtoArchiversWrappers.exe!boost::serialization::nvp<final>::save<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int __formal=0) Line 80 C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::member_save<boost::archive::text_oarchive,boost::serialization::nvp<final> const >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<final> & t={...}, const unsigned int file_version=0) Line 94 C++ serializationProtoArchiversWrappers.exe!boost::serialization::detail::member_saver<boost::archive::text_oarchive,boost::serialization::nvp<final> >::invoke(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<final> & t={...}, const unsigned int file_version=0) Line 43 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::split_member<boost::archive::text_oarchive,boost::serialization::nvp<final> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<final> & t={...}, const unsigned int file_version=0) Line 69 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::nvp<final>::serialize<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int file_version=0) Line 89 + 0x34 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::serialize<boost::archive::text_oarchive,boost::serialization::nvp<final> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<final> & t={...}, const unsigned int file_version=0) Line 119 C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize<boost::archive::text_oarchive,boost::serialization::nvp<final> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<final> & t={...}, const unsigned int file_version=0) Line 74 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize_adl<boost::archive::text_oarchive,boost::serialization::nvp<final> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<final> & t={...}, const unsigned int file_version=0) Line 133 + 0x18 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::save_only::invoke<boost::serialization::nvp<final> >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<final> & t={...}) Line 245 + 0xf bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::invoke<boost::serialization::nvp<final> >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<final> & t={...}) Line 308 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::save<boost::archive::text_oarchive,boost::serialization::nvp<final> const >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<final> & t={...}) Line 525 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::common_oarchive<boost::archive::text_oarchive>::save_override<boost::serialization::nvp<final> const >(const boost::serialization::nvp<final> & t={...}, int __formal=0) Line 69 + 0x15 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::basic_text_oarchive<boost::archive::text_oarchive>::save_override<boost::serialization::nvp<final> const >(const boost::serialization::nvp<final> & t={...}, int __formal=0) Line 81 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::interface_oarchive<boost::archive::text_oarchive>::operator<<<boost::serialization::nvp<final> const >(const boost::serialization::nvp<final> & t={...}) Line 64 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::pointer_oserializer<boost::archive::text_oarchive,final>::save_object_ptr(boost::archive::detail::basic_oarchive & ar={...}, const void * x=0x0034de38) Line 202 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::basic_oarchive_impl::save_pointer(boost::archive::detail::basic_oarchive & ar={...}, const void * t=0x0034de38, const boost::archive::detail::basic_pointer_oserializer * bpos_ptr=0x005967c8) Line 403 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::basic_oarchive::save_pointer(const void * t=0x0034de38, const boost::archive::detail::basic_pointer_oserializer * bpos_ptr=0x005967c8) Line 442 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_pointer_type<boost::archive::text_oarchive>::polymorphic::save<base>(boost::archive::text_oarchive & ar={...}, base & t={...}) Line 445 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_pointer_type<boost::archive::text_oarchive>::save<base>(boost::archive::text_oarchive & ar={...}, const base & t={...}) Line 460 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_pointer_type<boost::archive::text_oarchive>::invoke<base const *>(boost::archive::text_oarchive & ar={...}, const base * const t=0x0034de38) Line 473 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::save<boost::archive::text_oarchive,base const * const>(boost::archive::text_oarchive & ar={...}, const base * const & t=0x0034de38) Line 525 + 0xf bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::common_oarchive<boost::archive::text_oarchive>::save_override<base const * const>(const base * const & t=0x0034de38, int __formal=0) Line 69 + 0x15 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::basic_text_oarchive<boost::archive::text_oarchive>::save_override<base const * const>(const base * const & t=0x0034de38, int __formal=0) Line 81 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::interface_oarchive<boost::archive::text_oarchive>::operator<<<base const * const>(const base * const & t=0x0034de38) Line 64 C++ serializationProtoArchiversWrappers.exe!boost::serialization::nvp<base const *>::save<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int __formal=0) Line 80 C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::member_save<boost::archive::text_oarchive,boost::serialization::nvp<base const *> const >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<base const *> & t={...}, const unsigned int file_version=0) Line 94 C++ serializationProtoArchiversWrappers.exe!boost::serialization::detail::member_saver<boost::archive::text_oarchive,boost::serialization::nvp<base const *> >::invoke(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<base const *> & t={...}, const unsigned int file_version=0) Line 43 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::split_member<boost::archive::text_oarchive,boost::serialization::nvp<base const *> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<base const *> & t={...}, const unsigned int file_version=0) Line 69 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::nvp<base const *>::serialize<boost::archive::text_oarchive>(boost::archive::text_oarchive & ar={...}, const unsigned int file_version=0) Line 89 + 0x34 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::access::serialize<boost::archive::text_oarchive,boost::serialization::nvp<base const *> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<base const *> & t={...}, const unsigned int file_version=0) Line 119 C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize<boost::archive::text_oarchive,boost::serialization::nvp<base const *> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<base const *> & t={...}, const unsigned int file_version=0) Line 74 + 0x11 bytes C++ serializationProtoArchiversWrappers.exe!boost::serialization::serialize_adl<boost::archive::text_oarchive,boost::serialization::nvp<base const *> >(boost::archive::text_oarchive & ar={...}, boost::serialization::nvp<base const *> & t={...}, const unsigned int file_version=0) Line 133 + 0x18 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::save_only::invoke<boost::serialization::nvp<base const *> >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<base const *> & t={...}) Line 245 + 0xf bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::save_non_pointer_type<boost::archive::text_oarchive>::invoke<boost::serialization::nvp<base const *> >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<base const *> & t={...}) Line 308 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::save<boost::archive::text_oarchive,boost::serialization::nvp<base const *> const >(boost::archive::text_oarchive & ar={...}, const boost::serialization::nvp<base const *> & t={...}) Line 525 + 0xd bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::common_oarchive<boost::archive::text_oarchive>::save_override<boost::serialization::nvp<base const *> const >(const boost::serialization::nvp<base const *> & t={...}, int __formal=0) Line 69 + 0x15 bytes C++ serializationProtoArchiversWrappers.exe!boost::archive::basic_text_oarchive<boost::archive::text_oarchive>::save_override<boost::serialization::nvp<base const *> const >(const boost::serialization::nvp<base const *> & t={...}, int __formal=0) Line 81 C++ serializationProtoArchiversWrappers.exe!boost::archive::detail::interface_oarchive<boost::archive::text_oarchive>::operator<<<boost::serialization::nvp<base const *> const >(const boost::serialization::nvp<base const *> & t={...}) Line 64 C++ serializationProtoArchiversWrappers.exe!test_main(int __formal=1, int __formal=1) Line 210 C++ serializationProtoArchiversWrappers.exe!main(int argc=1, char * * argv=0x0034e198) Line 180 + 0xd bytes C++ -- Robert Bigaignon

2 2

[multi_index] looking for "equal_to and less than"
by isjk 02 Aug '10

02 Aug '10

hi, I've got a structure like this, struct peer { int md5_; // unique key. int rank_; int degrees_; }; now, I need a composite_key, it can find equal_to "md5" and less than "rank_" and "degrees_" less than 8. eg: md5 rank degrees 2 0 8 2 1 5 2 2 0 2 6 3 4 3 1 4 5 0 f(2, 2) return (2 1 5) f(2, 1) return null f(2, 6) return (2 2 0)(2 1 5) f(4, 5) return (4 3 1) Thanks. -- View this message in context: http://old.nabble.com/-multi_index--looking-for-%22equal_to-and-less-than%2… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Problem to substitute the std allocator with boost.asio and boost.filesystem
by watsonsong 02 Aug '10

02 Aug '10

I subsitute the std allocator with my own stl allocator, and defined a new string type like this: typedef std::basic_string<char, std::char_traits<char>, MySTLAllocator<char> > my_string; typedef std::basic_string<wchar_t, std::char_traits<wchar_t>, MySTLAllocator<wchar_t> > my_wstring; And I want to use them in my project, but I met some problem when I use boost.asio and boost.filesystem. The boost asio directly use std::string, I can not find a way to deal with it. I know I can pass a c style string char* to the asio, but it was less efficiency. When use the boost.filesystem, I tried this way, but I also met some problem: namespace MyNamespace { struct path_traits; typedef boost::filesystem::basic_path<my_string, path_traits> path; typedef boost::filesystem::basic_path<my_wstring, path_traits> wpath; struct path_traits { typedef my_string internal_string_type; typedef my_string external_string_type; static external_string_type to_external( const path &, const internal_string_type & src ) { return src; } static internal_string_type to_internal( const external_string_type & src ) { return src; } }; typedef boost::filesystem::basic_recursive_directory_iterator<path> recursive_directory_iterator; typedef boost::filesystem::basic_recursive_directory_iterator<wpath> wrecursive_directory_iterator; } namespace boost { namespace filesystem { template<> struct is_basic_path<MyNamespace::path> { BOOST_STATIC_CONSTANT( bool, value = true ); }; template<> struct is_basic_path<MyNamespace::wpath> { BOOST_STATIC_CONSTANT( bool, value = true ); }; } } namespace MyNamespace { inline bool is_directory( const path & ph ) { return boost::filesystem::is_directory<path>( ph ); } inline bool is_directory( const wpath & ph ) { return boost::filesystem::is_directory<wpath>( ph ); } } For replace all the function is a huge work, and in this way I can not replace it for I met this function, which is also use the std::string directly: BOOST_FILESYSTEM_DECL file_status status_api( const std::string & ph, system::error_code & ec ); Maybe this way is too bother, I think there must be an easy way to replace the string. Is there any way to resolve this? Thank you. -- View this message in context: http://old.nabble.com/Problem-to-substitute-the-std-allocator-with-boost.as… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

boost compile error
by Jack Bryan 02 Aug '10

02 Aug '10

Dear All: I am trying to install boost on MPI clsuter with MPICH2. After ./bjam install, I compile a test program provided by boost.org . But I got errors: The program is :-----------------------------------------------------------------#include <iostream>#include <boost/mpi/environment.hpp>#include <boost/mpi/communicator.hpp> namespace mpi = boost::mpi; int main(int argc, char* argv[]){ mpi::environment env(argc, argv); mpi::communicator world; std::cout << "I am process " << world.rank() << " of " << world.size() << "." << std::endl; return 0;}-------------------------------------------------------------- Errors: ------------------------------------------------------------------mpic++ -o testp2p test_p2p.cpp -I/home/boost_2010_8_1/boost_1_43_0 -L/home/boost_2010_8_1/boost_1_43_0/stage/lib -lboost_mpi -lboost_serialization/usr/bin/ld: warning: liblam.so.0, needed by /home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so, not found (try using -rpath or -rpath-link)/usr/bin/ld: warning: liblamf77mpi.so.0, needed by /home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so, not found (try using -rpath or -rpath-link)/usr/bin/ld: warning: liblammpi++.so.0, needed by /home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so, not found (try using -rpath or -rpath-link)/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_short'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_unsigned'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `PMPI::Comm::mpi_comm_map'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `op_intercept'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_errors_return'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `PMPI::Intracomm::current_op'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_comm_world'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_unsigned_char'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_char'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `PMPI::Comm::mpi_err_map'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_group_empty'/home/boost_2010_8_1/boost_1_43_0/stage/lib/libboost_mpi.so: undefined reference to `lam_mpi_packed'collect2: ld returned 1 exit status ------------------------------------------------------------------- It seems that it needs LAM/MPI. But, the LAM/MPI has been installed: PATH=/home/openmpi_123/bin:/home/boost_2010_8_1/boost_1_43_0: ....... I used ./bjam --prefix=mypathand then ./bjam and then ./bjam installAny help is appreciated. Any help is appreciated. thanks Jack Aug. 1 2010

1 0

[Polygon] Test among 3 libraries
by TONGARI 01 Aug '10

01 Aug '10

Hi, I just modified a test program taken from AGG's examples to test the polygon clipping capability of following libraries. *Boost.Polygon *GPC *Clipper Here are some observations: 1) The proccesing speed (fastest to slowest): Clipper > GPC > Boost.Polygon 2) With "xor", although the results seems the same, they have different countours numbers (Clipper the least). 3) Boost.Polygon has a strange behavior that it sometimes produces erroneous vertical lines within the polygons. In this example, with "or" operation you'll see that. I put the test files here: *http://tinyurl.com/2axoqxc Anyone who wants to compile it will also need AGG and *Clipper on your computer.

2 1

Boost.FSM in boost 1_42 (newbie)
by Doron Bar 01 Aug '10

01 Aug '10

Hi to all, I intended to use the boost.FSM library. I have install boot version 1.42 but the FSM lib is not there, only statechart. Did this library has been removed from boost? Thanks a lot, Doron Doron Bar Electro-Optics Division Soreq NRC, Yavne 81800 Israel Office: +972-8-9-434361 Mobile: +972-50-6292123 Home: +972-3-9640937 ************************************************************************************ This footnote confirms that this email message has been scanned by PineApp Mail-SeCure for the presence of malicious code, vandals & computer viruses. ************************************************************************************

2 1

[Graph] Problems with in-edges for a user defined AdjacencyList
by Berit Løfstedt 31 Jul '10

31 Jul '10

Hi, I am fairly new to boost and I have a problem using the in_edges(v, G) function. I have defined a graph of type AdjacencyList: typedef adjacency_list< vecS, vecS, directedS, VertexProperties, EdgeProperties > mcf_graph; The following code with m_current_network being a private class variable of type mcf_graph void best_insertion::search() { vertex_descriptor v,u,w; edge_descriptor e; graph_traits<mcf_graph>::in_edge_iterator in_e, in_end; graph_traits<mcf_graph>::out_edge_iterator out_e, out_end; edge_index_map_t edge_indices=get ( edge_index, m_current_network ); edge_type_map_t edge_types= get(edge_type, m_current_network); capacity_map_t edge_capacities=get ( edge_capacity, m_current_network ); vector<int> indices; vector<int>::iterator it, it_end; //select vertex v to reinsert //find_edge_indices of vertex v for ( tie ( in_e, in_end ) = in_edges(v, m_current_network ); in_e != in_end; in_e++ ) { e=*in_e; indices.push_back ( edge_indices[e] ); } for ( tie ( out_e, out_end ) = out_edges( v, m_current_network ); out_e != out_end; out_e++ ) { e=*out_e; indices.push_back ( edge_indices[e] ); } produces the error: error: no matching function for call to 'in_edges(vertex_descriptor&, mcf_graph&)' The problem does not occur for out_edges. From the examples I have seen AdjacencyList should support both functions. Can anybody explain to me why in_edges do not work for this example? -- Best Regards, Berit Løfstedt PhD. Student DTU Management Engineering, Operations Research Technical University of Denmark Department of Management Engineering Produktionstorvet, Bygning 426 2800 Kgs. Lyngby blof(a)man.dtu.dk <mailto:blof@man.dtu.dk> www.or.man.dtu.dk <http://www.or.man.dtu.dk>

3 4

How often is boost::interprocess::message_queue::receive signaled?
by Andre Kirchner 31 Jul '10

31 Jul '10

Hi all, How often is method boost::interprocess::message_queue::receive signaled assuming there is data in the queue? Is it just at the end/beginning of a time-slice? I have been debugging a piece of code that is showing that receive is signaled at intervals of 15, 30 or 45 ms, and 15 ms is the duration of the time-slice of the of Windows OS when running on a multicore machine. Is there a way to increase the priority of the thread that is blocked at a receive method in a way that it would be executed right after it's signaled? Or if not possible, what other mechanism could be used? Thanks, Andre

1 0

[Asio] Dispatch question
by Malinka Rellikwodahs 31 Jul '10

31 Jul '10

Hello List, Attached is a piece of sample code in which I'm trying to use Boost.Asio to dispatch a call that will cause the program to shutdown, however for some reason the io_service is not ever calling the handle_stop method, so the program does not shutdown. Any help would be greatly appreciated.

2 3

std::fill with boost::numeric::ublas::triangular_matrix
by Max S. Kaznady 31 Jul '10

31 Jul '10

I am trying to figure out a way of doing the following (initialize a lower-triangular matrix P with 0's and fill the last row with 1's) using iterators: int n = 10; boost::numeric::ublas::triangular_matrix<double, lower>P(n, n); P = boost::numeric::ublas::zero_matrix<double>(n,n); for (unsigned col = 0; col < n; ++col) P(n, col) = 1.0; I want to try and use std::fill, so something like std::fill(P.begin1(), P.end() - (adjust pointer to not include the last row), 0.0); std::fill(P.begin2(), P.end2(), 1.0); I can't seem to find any examples though on how to use iterators for Boost lower triangular matrices. I know how to do this using STL vector, that's easy, but I'm not sure how to adjust the iterator pointer in this case. Thanks in advance for your help. Cheers, Max

1 0

A doubt in Boost multi index
by Gokulakannan Somasundaram 30 Jul '10

30 Jul '10

Hi, In boost multi-index, can i verify whether a particular index type is ordered/not or not through meta programming? There are the ordered indexes, hash indexes, sequence indexes etc. Can i find them out through meta programming? Thanks, Gokul.

2 4

Surprised by size of static libraries
by David Aldrich 30 Jul '10

30 Jul '10

Hi I have built static and shared boost_python libraries under Visual C++ 2008 under Windows and am surprised by the size difference. The commands I use are: C:\boost_1_43_0>bjam toolset=msvc-9.0 --with-python link=shared C:\boost_1_43_0>bjam toolset=msvc-9.0 --with-python link=static The resulting shared libraries are: boost_python-vc90-mt-1_43.dll 216KB boost_python-vc90-mt-gd-1_43.dll 500KB The resulting static libraries are: libboost_python-vc90-mt-1_43.lib 5.59MB libboost_python-vc90-mt-gd-1_43.lib 21.2MB Please can anyone explain why the static libraries are at least 25x larger than the shared libraries? Is there a way to reduce the size of the static libraries? Best regards David

2 1

boost I need to do some C++ programming exercises
by Jack Bryan 30 Jul '10

30 Jul '10

Dear All, I need to do some C++ programming exercises. Would you please recommend some good books or websites with C++ programming exercises and solutions ? Any help is really appreciated. Thanks Jack July 29 2010

3 2

Delay loading boost_python dll in Visual C++
by David Aldrich 30 Jul '10

30 Jul '10

Hi I wish to 'delay loading' the boost_python dll in my application, built with Microsoft Visual C++ 2008, running on Windows XP. The purpose is so that I can specify at runtime the directory in which the boost_python is stored using SettDllDirectory() (I wish to store the dll in a non-standard location). I am building in debug mode so I simply set project option Linker>Input>Delay Loaded DLLs equal to boost_python-vc90-mt-gd-1_43.dll. When I run the code I get an exception in Microsoft file delayhlp.cpp at line 331: return dli.pfnCur; No boost_python API has been called until that point by my code, but the stack frame shows that boost method: registry_lookup1(type<T>) { return registry_lookup2((T(*)())0); } has been called, and resulted in the exception. Does this simply mean that boost_python is not suited to delay loading? (Note: it has been suggested that I use a manifest file to reference the dll, but that does not work as one cannot specify arbitrary assembly locations under Windows XP). With best regards David

1 0

test: tutorials/new-year-resolution.html typo
by Hicham Mouline 30 Jul '10

30 Jul '10

Hello BOOST_AUTO_EST_CASE should be BOOST_AUTO_TEST_CASE

1 0

How to get the basic_path specialization for TCHAR ?
by Timothy Madden 30 Jul '10

30 Jul '10

Hello Is there a nice why to select a basic_path specialization with the current with of TCHAR ? I mean like a string or wstring can be selected with basic_string<TCHAR>, I would like to select path or wpath with something like basic_path<basic_string<TCHAR>> or basic_path<basic_string<TCHAR>, path_traits<TCHAR>>, except that there is no template path_traits<>. Is there a sort sort of a type selector template in boost that receives TCHAR as and index and based on its width returns on of the other type arguments ? Thank you, Timothy Madden

2 3

Can I get filesystem::basic_path<> template to use backslashes ?
by Timothy Madden 30 Jul '10

30 Jul '10

Hello Is there a way for the basic_path observer functions (string(), root_path(), relative_path(), filename()) to use backslashes instead of forward slashes on Windows ? I know Windows also accepts forward slashes, but they are not suitable for display to the user, in a dialog box. Thank you, Timothy Madden

3 3

How to build for the VS version that I have loaded the vcvars for ?
by Timothy Madden 30 Jul '10

30 Jul '10

Hello I have a project that I would like to include boost in, and I would like to build boost as part of my project build process. However on a computer with both Visual Studio 2008 and Visual Studio 2010 installed the .\bjam command will build the libraries for VS 2010, even though my project compiles with VS 2008. It is pretty useless to build the 2010 libraries for a 2008 project, because they have different names and can not be used from one Visual Studio version to another. Is there a way for the boost build procedure to compile libraries for the Visual Studio version that the environment variables currently point to ? I mean if I build boost with make from a VS 2008 project than the environment variables will point to the VS 2008 installation, and if I build boost with make from a VS 2010 project than the environment variables will point to the VS 2010 installation. Can I get bjam to build boost for the currently loaded configuration, and not the latest version that can be found installed ? Thank you, Timothy Madden

2 2

boost::interprocess segfault when calling pop on deque
by Matthew Stump 30 Jul '10

30 Jul '10

I built a datastrucuture which I called BufferedQueue. It's essentially a double buffered queue but instead of two buffers I allow a user specified number of buffers. Each buffer is a struct which contains the managed_mapped_file for the particular buffer and a pointer to a boost::interprocess::deque. Each mapped file contains only 1 deque and the deque is used to store items pushed onto the queue by the user. I automatically handle rotation between the various buffers when the user calls push or pop. Specific problem: All of my functional unit tests pass without issue and I have 100% test coverage. When I run the multi-threaded unit tests I encounter a segfault, but not immediately. I have some tests which will spawn one thread which instantiates the datastrucutre and will push 100K items onto the queue (this will span multiple buffers). I spawn a second thread which also instantiates the datastrucutre and begin to pop items off of the queue. After about 40K items have been poped off of the queue I get a segfault when calling boost::interprocess::deque::pop_front(). It's always on the same line, and occurs when the segment manager is doing it's sanity checks while de-allocating the memory. Sometimes this occurs when it's the last item in the deque which is being poped, sometimes it's not; there is no detectable pattern. For my test I'm also using ints so I'm not pushing something onto the datastrucutre that isn't compatible with boost::interprocess. Any helpful ideas as to what may be the cause of my problem would be greatly appreciated. // Type declarations for the deque typedef boost::interprocess::managed_mapped_file ManagedFile; typedef ManagedFile::segment_manager SegmentManager; typedef typename boost::interprocess::allocator<T, SegmentManager> TypeAllocator; typedef typename boost::interprocess::list<T, TypeAllocator> MMContainer; // instantiation of the deque queue = file.find_or_construct<MMContainer>(getBufferName(name, buffNum).c_str())(TypeAllocator(file.get_segment_manager())); // my pop method template<class T> void BufferedQueue<T>::pop() { checkBufferCount(); { boost::interprocess::sharable_lock<Mutex> master_lock(*m_masterMutex); boost::interprocess::scoped_lock<typename Buffer<T>::Mutex> lock(*getReadBuffer().mutex); assert(getReadBuffer().queue); if (!isBufferEmpty<T>(getReadBuffer())) { assert(!getReadBuffer().queue->empty()); getReadBuffer().queue->pop_front(); return; } } rotate_reader(); boost::interprocess::sharable_lock<Mutex> master_lock(*m_masterMutex); boost::interprocess::scoped_lock<typename Buffer<T>::Mutex> lock(*getReadBuffer().mutex); if (isBufferEmpty<T>(getReadBuffer())) throw Exception("called pop() on an empty buffer"); assert(!getReadBuffer().queue->empty()); getReadBuffer().queue->pop_front(); } /libs2/external/boost/boost/interprocess/mem_algo/rbtree_best_fit.hpp:1244: void boost::interprocess::rbtree_best_fit<MutexFamily, VoidMutex, MemAlignment>::priv_deallocate(void*) [with MutexFamily = boost::interprocess::mutex_family, VoidPointer = boost::interprocess::offset_ptr<void>, unsigned int MemAlignment = 0u]: Assertion `priv_is_allocated_block(block)' failed. #0 0x0094a410 in __kernel_vsyscall () #1 0x02850df0 in raise () from /lib/libc.so.6 #2 0x02852701 in abort () from /lib/libc.so.6 #3 0x0284a26b in __assert_fail () from /lib/libc.so.6 #4 0x0806ca9f in boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>::priv_deallocate (this=0xb5fcd004, addr=0xb5fcd0b8) at /libs2/external/boost/boost/interprocess/mem_algo/rbtree_best_fit.hpp:1244 #5 0x0807b00b in boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>::deallocate (this=0xb5fcd004, addr=0xb5fcd0b8) at /libs2/external/boost/boost/interprocess/mem_algo/rbtree_best_fit.hpp:1233 #6 0x0807b05f in boost::interprocess::segment_manager_base<boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u> >::deallocate (this=0xb5fcd004, addr=0xb5fcd0b8) at /libs2/external/boost/boost/interprocess/segment_manager.hpp:217 #7 0x0807b5fe in boost::interprocess::allocator<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >::deallocate (this=0xb5fcd0b0, ptr=...) at /libs2/external/boost/boost/interprocess/allocators/allocator.hpp:152 #8 0x0807b61c in boost::interprocess::allocator<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> >::deallocate_one (this=0xb5fcd0b0, p=...) at /libs2/external/boost/boost/interprocess/allocators/allocator.hpp:234 #9 0x0807b693 in boost::container::containers_detail::allocator_destroyer<boost::interprocess::allocator<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > >::priv_deallocate (this=0x43511dc, p=...) at /libs2/external/boost/boost/interprocess/containers/container/detail/destroyers.hpp:133 #10 0x0807b6ca in boost::container::containers_detail::allocator_destroyer<boost::interprocess::allocator<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > >::operator() (this=0x43511dc, p=...) at /libs2/external/boost/boost/interprocess/containers/container/detail/destroyers.hpp:143 #11 0x0807b786 in boost::intrusive::list_impl<boost::intrusive::listopt<boost::intrusive::detail::base_hook_traits<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::intrusive::list_node_traits<boost::interprocess::offset_ptr<void> >, normal_link, boost::intrusive::default_tag, 1>, unsigned int, true> >::erase_and_dispose<boost::container::containers_detail::allocator_destroyer<boost::interprocess::allocator<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > > > ( this=0xb5fcd0b4, i=..., disposer=...) at /libs2/external/boost/boost/intrusive/list.hpp:649 #12 0x0807b7ce in boost::intrusive::list_impl<boost::intrusive::listopt<boost::intrusive::detail::base_hook_traits<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::intrusive::list_node_traits<boost::interprocess::offset_ptr<void> >, normal_link, boost::intrusive::default_tag, 1>, unsigned int, true> >::erase_and_dispose<boost::container::containers_detail::allocator_destroyer<boost::interprocess::allocator<boost::container::containers_detail::list_node<int, boost::interprocess::offset_ptr<void> >, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > > > ( this=0xb5fcd0b4, i=..., disposer=...) at /libs2/external/boost/boost/intrusive/list.hpp:656 #13 0x0807b839 in boost::container::list<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > >::erase (this=0xb5fcd0b0, p=...) at /libs2/external/boost/boost/interprocess/containers/container/list.hpp:930 #14 0x0807b881 in boost::container::list<int, boost::interprocess::allocator<int, boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0u>, boost::interprocess::iset_index> > >::pop_front (this=0xb5fcd0b0) at /libs2/external/boost/boost/interprocess/containers/container/list.hpp:623 #15 0x0808a2e2 in Ovid::BufferedQueue<int>::pop (this=0x43512f0) at /ovid/server/shared/ovidserver-bufferedqueue.cpp:287 #16 0x080557fb in reader_multithread_two_writer_single_reader_throughput () at test-ovidserver-bufferedqueue.cpp:389 #17 0x07653832 in start_thread () from /lib/libpthread.so.0 #18 0x028f9e0e in clone () from /lib/libc.so.6

2 1

[preprocessor] It works, but how can I make it better/more elegant?
by Geoff Hilton 29 Jul '10

29 Jul '10

Yay! I finally got my type map generating code to work! There has got to be a better way though because it feels really kludgey. Opinions? If you have a more elegant way of accomplishing the same thing (without misusing BOOST_PP_APPLY as I think I did, because I only used it to remove the extra pair of parens surrounding the tuple in TEST_PP_get_type, something that, oddly, BOOST_PP_TUPLE_REM_CTOR doesn't succeed at doing (at least not without breaking the current code). Was I correct in my assumption (which is why I handled it the way I did in my below code) that basically anytime a a comma appears, the two surrounding tokens must be treated as a tuple (and thus parenthesized? This is what I've gathered from the online documentation as well as the "C++ Template Metaprogramming" book. The purpose of this code is to create a type map between array types and corresponding value types of 3rd party classes which don't conform at all to STL usage practices, that which I'd like to use, so I'm writing an array wrapper template class with associated iterator template classes using iterator_facade & the MPL. The map generated by this code is used to map between array and value types for type selection purposes. The following (reformatted for readability) code should generate this (also reformatted) preprocessed output, though I've only tested the real code and not this that is mostly copy/pasted: typedef bmpl::map< bmpl::pair<SomeIntArray, SomeInt>, bmpl::pair<SomeDoubleArray, SomeDouble>, bmpl::pair<SomeBoolArray, SomeBool>, bmpl::pair<SomeOtherClassArray, SomeOtherClass> > supported_types_map; --test.hpp-- (omitting #inclusions) namespace blah { namespace bmpl = boost::mpl; //must match size as below tuples in sequence for readability. #define TEST_PP_tuple_size 2 //index of array type inside tuple for readability. #define TEST_PP_array_descriptor 0 //index of value type inside tuple for readability. #define TEST_PP_value_descriptor 1 //sequence of tuples of supported types #define TEST_PP_supported_types \ ((SomeIntArray, SomeInt)) \ ,((SomeDoubleArray, SomeDouble)) \ ,((SomBoolArray, SomeBool)) \ ,((SomeOtherClassArray, SomeOtherClass))\ /**/ //size of TEST_PP_supported_types (BOOST_PP_SEQ_SIZE doesn't work on it) #define TEST_PP_types_size 4 #define TEST_PP_get_type(index, type_descriptor) \ BOOST_PP_TUPLE_ELEM(TEST_PP_types_tuple_size, \ type_descriptor, \ TEST_PP_get_tuple(index) \ ) \ /**/ //gets tuple from TEST_PP_supported_types #define TEST_PP_get_tuple(index) \ BOOST_PP_APPLY( \ BOOST_PP_TUPLE_ELEM( \ TEST_PP_types_size, index, (TEST_PP_supported_types)\ ) \ ) \ /**/ //this returns a tuple containing the first and last part of the mpl::pair #define TEST_PP_bmpl_pair(index) \ (bmpl::pair<TEST_PP_get_type(index, TEST_PP_array_descriptor), \ TEST_PP_get_type(index, TEST_PP_value_descriptor)>) \ /**/ #define TEST_PP_pair_fwder(next_index, index, data) \ BOOST_PP_TUPLE_REM_CTOR(2,TEST_PP_bmpl_pair(index)) \ /**/ typedef bmpl::map< BOOST_PP_ENUM(TEST_PP_types_size, TEST_PP_pair_fwder, ~) > supported_types_map; } //namespace blah Thank you! Geoff

2 5

[units] Basic usage questions
by Bryce L Nordgren 29 Jul '10

29 Jul '10

Q1 ============================================================================= What are the rules about what is allowed where? Or perhaps more appropriately, why are the rules so strange? I've been playing with units in boost 1.43.0 using gcc 4.4.3/mingw on win xp and I think I've deduced what is allowed. For instance, when declaring variables, you can do: quantity<si::length> l(1.0*si::meters) ; quantity<si::meter_base_unit::unit_type> l(1.0*si::meters) ; quantity<us::yard_base_unit::unit_type> l(1.0*si::meters) ; but not quantity<si::length> l(si::meters) ; (missing the scalar in front of the units) or quantity<si::meters> l(1.0*si::meters) ; (si::meters is not quantity-variable-declaration material??!?) Q2 ============================================================================= I spent a long time looking for a way to construct a variable with on-the-fly defined units, in order to store interim quantities which may have strange units when implementing the computation of a long expression. This would also be useful to precompute some terms which occur more than once, but which don't necessarily represent any kind of sensible value that you would return as a final result. I wanted to do something like this: quantity<si::length / si::mass> dummy_var_1 = (some_interim_expression reducing to si::length/si::mass) but I can't figure out how to do it. For the moment, I plan on just using the vast array of predefined units on the derived dimensions. However, it would be nice to be able to divide up the computation in whatever way seems natural given the equation, even if the interim variables don't represent rational physical quantities. Q3 =============================================================================== And I suppose my last question is "What does a unit system buy you?", meaning that since "yards" is not part of a unit system and I can declare a variable of type quantity<us::yard_base_unit::unit_type>, what is the added benefit of constructing a unit system which contains yards? Don't misinterpret this as a string of complaints. :) I am very grateful to not have to write this myself. I'm just having some trouble understanding how to apply the library to my situation. ;) Thanks, Bryce

2 1

[Serialization] Serialize base and derived classes.
by BlueAngel 29 Jul '10

29 Jul '10

Hi lists, I'm working with the Serialization library but I'm having some troubles with it. The tutorials in the website shown me much but still I need help. I'm using XML archives. I have this classes actually (these classes are all builders/prototypes, they serialize the datas and then they should make a new object with those datas): Serializer (an interface, every class which need serialization must be derived from this, however this is only a marker, it will be not serialized) RenderableSerializer : public Serializer - this isn't pure virtual however shouldn't be never serialized directly (since the object made by this class is a pure virtual one) - These will use the tag <renderable> SkyboxSerializer : public RenderableSerializer - these will use the tag <skybox> EntitySerializer : public Serializer - these will use the tag <entity> many other classes will be added in future and they'll all derive form RenderableSerializer. Now the problem is EntitySerializer have a pointer to a RenderableSerializer and when I serialize EntitySerializer the pointer to that class is considered to be a RenderableSerializer and not the derived class. I don't know at priori which class is the base class and this lead to problem. If I serialize a SkyboxSerializer I have the correct tag: a <skybox> which have inside a <renderable> and the datas are correct. If I try to serialize an Entity I had a lot of problem, mostly just make the library crash. As I've seen in the tutorial I should register all the derived classes before pass the pointer to the Archive. I did it registering the SkyboxSerializer classes but it lead to a wrong xml: a correct <entity> tag which have a correct <skybox> with all it's data but also a wrong <renderable> tag which have inside the same data of the tag <skybox> instead of the data of a RenderableSerializer class. Now the question is: is there a correct way to use the library this way? With a pointer to a base class of which the derived is not known? My code is too big and I made many attempt to use the library so I'm not posting it in this message. If you need it I will post it. Thank you for your replies.

2 5

suspend an asio operation
by Lloyd 29 Jul '10

29 Jul '10

Hi, I am using asio for a network server. Based on the client request the server performs the operation. Some operation could take a very long time. so we would like to implement a "feature" to terminate the long process from client side by sending some other command. Is there any mechanism in "ASIO" to do this? Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

2 1

[wave] problem with "/##/" macro
by Evgeniy Rigkov 29 Jul '10

29 Jul '10

Hello, I found a problem with preprocessing "/##/" macro. For example, I have a next code: #define COMMENT_MACRO /##/ void test() { COMMENT_MACRO comment } This code can pe preprocessed (with help any correct preprocessor) to next: void test() { // comment } But after usage boost::wave utility (from boost 1.43) I have this code: void test() { comment } How you see the symbol "//" is forgotten. How fix it?

1 0

[asio] Newbie problem running tutorial example Daytime.4 - Asynchronous UDP daytime client
by Adolfo Jimenez 29 Jul '10

29 Jul '10

Hi list: Using MSVCPP C++ 9.0 and Boost_1_43_0, and trying to follow the examples in the tutorial. The Daytime.4 example hangs in line size_t len = socket.receive_from(boost::asio::buffer(recv_buf), sender_endpoint); it seem that wait indefinitely for a response. Using this server: char* serverName = "ntp-nist.ldsbc.edu"; // 198.60.73.8 LDSBC, Salt Lake City, Utah Neither with: char* serverName = "time-nw.nist.gov" or any other in the http://tf.nist.gov/tf-cgi/servers.cgi# list. By the way, the Daytime.1 (asynchronous TCP datytime client) example and Timer1 to 5 examples works fine for me. Any suggestion would be appreciated. Thanks A.J.Millan

1 0

[datetime] Stability of ptime string representation
by Rush Manbert 28 Jul '10

28 Jul '10

I have an application that uses the string representation of a ptime object in a way that requires that representation to be stable across many years and across multiple releases of the DateTime library. We started out using the to_iso_extended_string() method to generate the string representation. I am worried that the periodic addition of leap seconds could mess me up. The scenario is rather complicated: Let's say that I go into production tomorrow using Boost 1.42. All is well. The Powers That Be decide that there will be a leap second added at the end of 2010. We keep using 1.42. A year from now I record a time value. If I did it exactly one year from when I'm writing this, the to_iso_extended_string() representation would be: 2011-07-28T10:59:30.532000 In 2012, we change out our Boost libraries for version 1.50, which contains a new version of the DateTime library which I assume knows about the leap second that was added at the end of 2010. Here's what I'm worrying about: If, sometime in 2012 after we switch libraries, I retrieve the ptime value that I recorded in 2011 by calling to_iso_extended_string(), will I get the same string that I was getting in 2011 when I was running on a pre-leap-second-addition version of DateTime, or will it be different by a second? Thanks, Rush

1 0

[type traits][enable_if] how do I resolve ambiguous class template instantiation?
by Steve Lorimer 28 Jul '10

28 Jul '10

I'm trying to use template specialization and enable_if / type_traits to correctly allocate memory for different types, where the template parameter will be one of: 1. boost::intrusive_ptr // create U on the heap, return intrusive_ptr 2. boost::shared_ptr // create U on the heap, return shared_ptr 3. U* // create U on the heap, return raw pointer 4. U // create U on the stack I'm pretty sure I'm just doing something stupid, but I'm getting ambiguous conflicts between my template for types of U and the smart pointer types. Please can you comment on how to fix the code below? TIA Steve #include <boost/utility.hpp> #include <boost/type_traits.hpp> #include <boost/intrusive_ptr.hpp> #include <boost/shared_ptr.hpp> #include <iostream> template<typename U, class Enable = void> struct alloc; template<typename U> struct alloc<U, typename boost::disable_if< boost::is_pointer >::type > { U operator()() { std::cout << __LINE__ << std::endl; return U(); } }; //----------------------------------------------------- template<typename U> struct alloc<U, typename boost::enable_if< boost::is_pointer >::type > { U operator()() { std::cout << __LINE__ << std::endl; return new U; } }; //----------------------------------------------------- template< typename U > struct alloc< boost::intrusive_ptr > { boost::intrusive_ptr operator()() { std::cout << __LINE__ << std::endl; return boost::intrusive_ptr(new U); } }; //----------------------------------------------------- template<typename U > struct alloc< boost::shared_ptr > { boost::shared_ptr operator()() { std::cout << __LINE__ << std::endl; return boost::shared_ptr(new U); } }; //----------------------------------------------------- template<typename T> struct test { alloc<T> create; T fun() { return create(); } }; struct foo { uint32_t refs; foo() : refs() { std::cout << "foo" << std::endl; } }; inline void intrusive_ptr_add_ref(foo* p) { ++p->refs; } inline void intrusive_ptr_release(foo* p) { if (!--p->refs) delete p; } int main() { test<int*> a; int* p = a.fun(); *p = 5; test<int> b; int d = b.fun(); d = 5; test< boost::intrusive_ptr<foo> > c; boost::intrusive_ptr<foo> z = c.fun(); z.get(); test< boost::shared_ptr<int> > gd; boost::shared_ptr<int> x = gd.fun(); x.get(); return 0; }

2 1

does Boost Parameter support non-type class template parameters?
by Nathan Ridge 28 Jul '10

28 Jul '10

Hello, Does the Boost Parameter library's named template parameters feature work for templates where some of the parameters are non-type parameters? Thanks, Nate. _________________________________________________________________ MSN Dating: Find someone special. Start now. http://go.microsoft.com/?linkid=9734384

1 0

how to release element from ptr_map?
by archie14 28 Jul '10

28 Jul '10

I have an instance of ptr_map<int, classA>. I need to release an element from the map and use it somewhere else, making sure that it will not be deleted when the instance of ptr_map is deleted. I am successfully doing it with ptr_vectors, but can't get it right with ptr_map. What is the proper syntax of such call? I am doing it like in the code below, which does not compile. class classA {}; typedef ptr_map<int, classA> ptrmaptype; ptrmaptype val; val.insert(1, new classA()); ptrmaptype::mapped_type t = val.release (val.begin()); // I want "t" to be of classA* type

2 2

[Random] Getting normal_distribution<> to work
by Hossein Haeri 28 Jul '10

28 Jul '10

Dear all, When I run the following simple code, the output is "-1.#IND" in MSVC 2008 and "nan" in GCC 4.4.0. I guess that means something is not initialised yet... So, what's missing here? boost::normal_distribution<double> gen; boost::mt19937 engine; double r = gen(engine); cout << r; TIA, --Hossein

2 1

boost_python: static vs shared library sizes on Windows
by David Aldrich 28 Jul '10

28 Jul '10

Hi I asked for help a week or so back regarding storing boost_python as a vendor library in our project's svn repository. The aim being to relieve our Windows developers of the effort of installing and building boost. This also ensures that everyone is using the same version. I have built shared libraries for boost_python and everything works nicely now except that it is necessary to include the path to the boost libraries in the system's PATH variable. I would rather not have to modify PATH, so I considered using static libraries instead. However, I was surprised to find that the static libraries are very much bigger than the shared libraries. So I would rather use shared libraries. Is there a way of telling the .exe file the path to the necessary dll's at build time? Is this a purpose of a manifest file? Best regards David

1 0

Is there rotate-shifts in Boost?
by Murilo Adriano Vasconcelos 28 Jul '10

28 Jul '10

Hi, I am a GSoC student and I am implementing a library to handle integral values. I want to know if exists functions to do integer rotate shifts in Boost. If it not exists I am suggesting these functions: http://svn.boost.org/svn/boost/sandbox/SOC/2010/bits_and_ints/boost/integer… To do right and left rotation shifts. And want to know if is better to check if the length of rotation is less than the size in bits of the type. Best, -- Murilo Adriano Vasconcelos http://murilo.wordpress.com

1 0

[Iterator][enable_if] Why use additional type for the enabler?
by Robert Jones 28 Jul '10

28 Jul '10

The iterator facade documention suggests that controlled conversion of iterators between const and mutable variants can be achieved by application of enable_if. Why does this need to involve an additional 'enabler' type, rather than exploiting the default void type of the enable_if template? Thx, - Rob.

1 0

[Serialization] #include order
by dariomt＠gmail.com 28 Jul '10

28 Jul '10

Hi all, Compiling the following program with Boost 1.42 fires an static assertion in boost/serialization/shared_ptr.hpp:153. This is expected. But if I change the order of includes (compile with -DCHANGE) the assertion fires in boost/serialization/shared_ptr.hpp:121. The assertion is expected but I found it strange that I end up compiling a different part of the same file... The code in that section seems related to serialization of shared_ptr in version 1_32, but since I'm not able to understand the difference, I'm just reporting it in case the order of #includes might affect how shared_ptr's get serialized. Regards ---code--- #include <boost/shared_ptr.hpp> #ifndef CHANGE #include <boost/serialization/shared_ptr.hpp> #endif #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/xml_iarchive.hpp> #ifdef CHANGE #include <boost/serialization/shared_ptr.hpp> #endif void test() { boost::shared_ptr<int> p (new int); *p = 12345; boost::archive::xml_iarchive ia(std::cin); boost::serialization::load(ia, p, 0); }

1 0

[boost.filesystem v3] recursive_directory_iterator throws unexpectedly
by Tan, Tom (Shanghai) 28 Jul '10

28 Jul '10

In boost::filesystem v3, while it's possible to choose a no-throw version of recursive_directory_iterator by passing an boost::system::error_code object to its constructor, like this: boost::system::error_code m_ec; for ( recursive_directory_iterator itr(root, m_ec), end_itr; itr != end_itr; ++itr) However, because in the implementation of the recursive_directory_iterator::increment(), directory_iterator is always constructed with the throw version, it would cause exception throws during the for-loop while accessing folders like \System Volume Information on Windows: void increment() { BOOST_ASSERT(m_imp.get() && "increment of end recursive_directory_iterator"); m_imp->increment(0); if (m_imp->m_stack.empty()) m_imp.reset(); // done, so make end iterator } Where m_imp is an object of recur_dir_itr_imp: void recur_dir_itr_imp::increment(system::error_code* ec) // ec == 0 means throw on error { ... } As it's not possible to catch this exception within the for-loop and continue the loop, it greatly limits the use of recursive_directory_iterator. With rough check, V2 does not seem to have this problem. Is this a bug or change on purpose? I personally would expect the directory_iterator to behave the same as recursive_directory_iterator in this case. Regards, Tom

1 0

program_options, multiple [sections] from a config file
by rrlangly 28 Jul '10

28 Jul '10

I'm using boost program_options 1.41 and would like to know if anyone has a better idea than what I'm trying to do. I am reading from a config file some basic parameters per section, but I have multiple sections. The problem is there could be any number of [sections] in this file, so I don't know what it is ahead of time. [server] name="a" ip="1.2.3.4" [server_2] name="b" ip="4.5.6.7" [server_3] name="c" ip="8.9.0.1" Thanks, -- View this message in context: http://old.nabble.com/program_options%2C-multiple--sections--from-a-config-… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[serialization] transparently treating a class like a built-in type
by Kenneth Riddile 28 Jul '10

28 Jul '10

I have some xml archives that store a lot of floating point values. I would like to read these into a program that is designed to easily switch between using floats and a custom fixed-point type via a typedef. The way that would be easiest would be to add a serialize() method to the fixed-point class definition. However, the xml archive requires that I use an nvp wrapper. Since the data was originally serialized out as plain floats, the data looks something like this: <x>0.95260203</x> <y>0.87517798</y> <z>0.54323343</z> whereas, to serialize this into my fixed-point type, it would need another level of indirection due to the additional required nvp wrapper like so: <x><value>0.95260203</value></x> <y><value>0.87517798</value></y> <z><value>0.54323343</value></z> Is there a way to accomplish what I'm trying to do? The fixed-point type is convertible from (but not to) a float if that helps.

3 4

assigning a value to a matrix shared_ptr
by Max S. Kaznady 28 Jul '10

28 Jul '10

Hello, I am trying to assign a value to the matrix, which is pointed to by the shared pointer, but I am not sure which operator to call, please have a look at the following code, I commented the problem: #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/io.hpp> int main () { using namespace boost::numeric::ublas; matrix<double> m (3, 3); boost::shared_ptr<matrix<double>> m2(new matrix<double>(3,3)); for (unsigned i = 0; i < m.size1 (); ++ i) for (unsigned j = 0; j < m.size2 (); ++ j) { m (i, j) = 3 * i + j; /// now do the same operation to the shared pointer's matrix m2->operator*(i, j) = 3 * i + j; // this results in a runtime error } std::cout << m << std::endl; // And how do we print m2 ? } Thanks, Max

1 2

Using boost::thread to keep all cores busy
by Internet Retard 27 Jul '10

27 Jul '10

I have a new 2 core CPU and I've been experimenting with boost::threads by attempting to keep both cores busy independent of each other. Say I have a queue of 4 tasks to do. Each task will be handled by one thread. Some tasks will take longer to complete than others so I can't use thread_group with 2 threads at a time and join_all() as one core may finish before the other and set idle until the second thread completes. I use boost::thread::hardware_concurrency() to determine how many CPU cores I have available. My problem is *knowing* when a thread/CPU core finishes a task and is available for another task. Here is some sample code. I commented what I think would be an approach. Any suggestions or hints? std::queue<std::string> string_queue() { std::queue<std::string> sq; sq.push("AAA"); sq.push("BBB"); sq.push("CCC"); sq.push("DDD"); return sq; } void worker(std::string& S) { std::cout << S << std::endl; } int main() { std::cout << "Number of Cores: " << boost::thread::hardware_concurrency() << std::endl; std::queue<std::string> strings = string_queue(); while ( !strings.empty() ) { // if ( a CPU core is available ) // { boost::thread t(boost::bind(&worker, strings.front())); t.join(); strings.pop(); // } // else // { // wait awhile and check if a CPU core is available again. // } } return 0; } _________________________________________________________________ Hotmail: Trusted email with Microsoft’s powerful SPAM protection. https://signup.live.com/signup.aspx?id=60969

4 10

subcommands with program_options (like svn command)
by Adrien Guillon 27 Jul '10

27 Jul '10

Hello all, I am writing a moderately complex command-line application, and I have been looking at program_options for simplifying my life. The best way to describe what I want to do, is in term of the svn command (which I assume most people are familiar with). In particular, what I want to do is expose a number of subcommands for controlling the application, each of which has their own particular options. For example, if I were to write svn using program_options, then the first command I have to accept could be one of: add, checkout, del, log, etc. Each of these commands has a separate list of arguments that they accept themselves. I'm a bit stumped on how exactly to do this with program_options, because the first argument (which I can do using positional arguments) decides what other arguments are valid. Any thoughts or suggestions? Thanks! AJ

1 0

enumeration type in boost
by archie14 27 Jul '10

27 Jul '10

Is there any support for proper usage of enumerations in any of the boost libraries? I am looking for something similar to Qt's QFlags class but can't find anything similar in boost.

1 0

[Intrusive] problem with inheritance
by Stephen Schleimer 27 Jul '10

27 Jul '10

Folk, I have an object which serves as a header to a "page" of memory which I serialize by simply writing out. I deserialize by reading the page and then doing a bit of fixup. I do this for performance (no copies other than the I/O in both directions). The header has an intrusive list pointer. When I reload the page, I must clear the header from the intrusive list. The page has been relocated (it may not be in the same physical location as it was when it was written). Thus, a simple unlink does not work. I was unable to figure out how to re-init the pointer when I had a base_hook. So, I switched to a member hook supposing that I could simply clear the contents of the hook (violating the abstraction) on the reload. Unfortunately, the headers are members of a hierarchy. The member_hook is defined in the base class and it is used in a subclass. I abstracted the problem into the following code: #include <boost/intrusive/list.hpp> class Foo { public: boost::intrusive::list_member_hook<> hook_; }; class Bar : public Foo { public: int x; }; class BigMess { typedef boost::intrusive::member_hook<Bar, boost::intrusive::list_member_hook<>, &Bar::hook_> mho; typedef boost::intrusive::list<Bar, mho> BarList; BarList list; }; This fails to compile using g++ (GCC) 4.4.0 on centos 2.6.18-128.1.16.el5 with: foo.cpp:15: error: could not convert template argument ‘&Foo::hook_’ to ‘boost::intrusive::list_member_hook<> Bar::*’ Clearly, the type of the base class is taken to not be compatible with the subclass. It is not clear why, however. Any thoughts would be appreciated as to how to either fix the inheritance problem or how to clear the base_hook case (which does compile and runs, by the way :-) Thanks -steve

1 0

Intrusive feature idea - accessor_hook
by Hite, Christopher 27 Jul '10

27 Jul '10

Intrusive has base_hooks and member_hooks. I wish it had a accessor hook, where you can define a member function which returns the a hook reference. My use case: I have a class being used between two threads and I want to break it up to avoid cache thrashing. struct Object{ struct UpdatedState{ } *updatedState; struct PrivateState{ } *privateState; struct PublishedState{ } *publishedState; }; So the users's thread updates stuff in UpdatedState and flags it for consumption by the service thread. The service thread has lots of private data associated with the object. It updates the user asychronously updating publishedState and flagging it for consumption by the user. The a nice way to flag things for consumption is to put them in an slist. The problem is that everyone wants an slist of Object instead of just a child like UpdatedState. The problem of course is that putting the hooks in Object would cause the cache trashing we were trying to avoid. Putting the hooks in the child objects requires a way back to Object. As work around a pointer could be added for each child back to Object. If I were writing my own linked lists, the solution is obvoius: I would add a field Object* nextUpdated to UpdatedState. What I propose is adding a accessor to Object list_member_hook<>& getUpdatedHook(); typedef accessor_hook<Object, list_member_hook<>, &Object::getUpdatedHook> MemberHookOption; Another advantage to allowing an accessor to be used is that the user can share memory between unused hooks by putting them in variant or union. In my case I've got 6 sorts 2 for add/change/delete prioritization. I only ever use 2 of these at a time, but I can't avoid the memory cost for having all the hooks. Chris Hite

2 1

Failure to load boost libraries on Linux
by David Aldrich 27 Jul '10

27 Jul '10

Hi Please will some one help me with what is probably a simple Linux error? I have installed Boost 1.40 on Centos 5.3 using an rpm from blackopsoft.com. When I run my executable I get: Failed to load the following library files: [snip] dlerror = libboost_python.so.2: cannot open shared object file: No such file or directory Executing: /sbin/ldconfig -p | grep boost gives: libboost_python-mt.so.1.40.0 (libc6,x86-64) => /usr/lib64/libboost_python-mt.so.1.40.0 libboost_python-mt.so (libc6,x86-64) => /usr/lib64/libboost_python-mt.so libboost_python-mt-d.so.1.40.0 (libc6,x86-64) => /usr/lib64/libboost_python-mt-d.so.1.40.0 libboost_python-mt-d.so (libc6,x86-64) => /usr/lib64/libboost_python-mt-d.so Please can anyone suggest what is wrong? Best regards David

4 5

[bind][function] Do copy constructors invoked inside boost::bind / boost::function get optimized out?
by Steve Lorimer 27 Jul '10

27 Jul '10

Hi I'm using boost::bind to convert a function of the form: T::fun(boost::intrusive_ptr) into a form which can be stored by boost::function. Outputting calls to intrusive_ptr_add_ref and intrusive_ptr_release reveals there are a massive number of copies of the intrusive_ptr. For a single call of boost::bind on a I'm wondering what kind of overhead this will add if I'm calling boost::bind on boost::intrusive_ptr a LOT of times? Will the copies be optimized out? There are 6 calls to intrusive_ptr_add_ref when calling boost::bind to bind a member function pointer to an object which is wrapped up in an intrusive_ptr There are 5 calls to intrusive_ptr_add_ref when calling boost::bind to bind an argument which is an intrusive_ptr There are 12 calls to intrusive_ptr_add_ref when using boost::function to store the result of boost::bind when called to bind a member function pointer to an object which is wrapped up in an intrusive_ptr There are 11 calls to intrusive_ptr_add_ref when using boost::function to store the result of boost::bind when called to bind an argument which is an intrusive_ptr Example code and output showing the calls below: #include <iostream> #include <boost/intrusive_ptr.hpp> #include <boost/function.hpp> #include <boost/bind.hpp> using namespace std; struct ref_ctd { int refs; ref_ctd() : refs(0) { } }; template<typename T> void intrusive_ptr_add_ref(T* p) { cout << "++ setting p (" <refs + 1 << endl; ++p->refs; } template<typename T> void intrusive_ptr_release(T* p) { cout << "-- setting p (" <refs - 1 << endl; if (!--p->refs) delete p; } struct foo : public ref_ctd { void func(char a) { cout << a << endl; } }; void bar(boost::intrusive_ptr<foo> f) { f->func('b'); } int main() { cout << "--------- creating intrusive ptr ----------" << endl; boost::intrusive_ptr<foo> f(new foo); cout << "--------- binding intrusive_ptr object ----------" << endl; boost::bind(&foo::func, f, 'a'); cout << "--------- now storing result of bind ----------" << endl; boost::function<void()> func1 = boost::bind(&foo::func, f, 'a'); cout << "--------- binding intrusive_ptr object ----------" << endl; boost::bind(bar, f); cout << "--------- now storing result of bind ----------" << endl; boost::function<void()> func2 = boost::bind(bar, f); return 0; } Here are the results: --------- creating intrusive ptr ---------- ++ setting p (0x33b18)'s refs to 1 --------- binding intrusive_ptr object ---------- ++ setting p (0x33b18)'s refs to 2 ++ setting p (0x33b18)'s refs to 3 ++ setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 -- setting p (0x33b18)'s refs to 3 -- setting p (0x33b18)'s refs to 2 -- setting p (0x33b18)'s refs to 1 --------- now storing result of bind ---------- ++ setting p (0x33b18)'s refs to 2 ++ setting p (0x33b18)'s refs to 3 ++ setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 -- setting p (0x33b18)'s refs to 3 ++ setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 ++ setting p (0x33b18)'s refs to 7 ++ setting p (0x33b18)'s refs to 8 ++ setting p (0x33b18)'s refs to 9 -- setting p (0x33b18)'s refs to 8 -- setting p (0x33b18)'s refs to 7 -- setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 -- setting p (0x33b18)'s refs to 3 -- setting p (0x33b18)'s refs to 2 --------- binding intrusive_ptr object ---------- ++ setting p (0x33b18)'s refs to 3 ++ setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 -- setting p (0x33b18)'s refs to 3 -- setting p (0x33b18)'s refs to 2 --------- now storing result of bind ---------- ++ setting p (0x33b18)'s refs to 3 ++ setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 ++ setting p (0x33b18)'s refs to 5 ++ setting p (0x33b18)'s refs to 6 ++ setting p (0x33b18)'s refs to 7 ++ setting p (0x33b18)'s refs to 8 ++ setting p (0x33b18)'s refs to 9 ++ setting p (0x33b18)'s refs to 10 -- setting p (0x33b18)'s refs to 9 -- setting p (0x33b18)'s refs to 8 -- setting p (0x33b18)'s refs to 7 -- setting p (0x33b18)'s refs to 6 -- setting p (0x33b18)'s refs to 5 -- setting p (0x33b18)'s refs to 4 -- setting p (0x33b18)'s refs to 3 -- setting p (0x33b18)'s refs to 2 -- setting p (0x33b18)'s refs to 1 -- setting p (0x33b18)'s refs to 0

4 6

BOOST_STATIC_ASSERT has different behavior on different platforms
by Alexander Vinokur 27 Jul '10

27 Jul '10

Hi, BOOST_STATIC_ASSERT has different behavior on different platforms Boost 1.34 -------- File foo01. cpp -------- #include <boost/static_assert.hpp> struct Foo { int m_value; Foo(); }; Foo::Foo() { BOOST_STATIC_ASSERT(sizeof(this->m_value) == 4); } int main() { Foo f; return 0; } --------------------------------- No compilation errors on UNIX compilers HP: aCC: HP C/aC++ B3910B A.06.25.01 [May 16 2010] Sun: C++ 5.9 SunOS_sparc Patch 124863-01 2007/07/25 AIX: IBM XL C/C++ Enterprise Edition V8.0 for AIX; Version: 08.00.0000.0014 Linux: Intel(R) C++ Intel(R) 64 Compiler, Version 11.0 There are compilation errors on Windows compiler Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 14.00.50727.762 for 80x86 foo01.cpp foo01.cpp(11) : error C2355: 'this' : can only be referenced inside non-static member functions foo01.cpp(11) : error C2227: left of '->m_value' must point to class/struct/union/generic type foo01.cpp(11) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE' C:\ADJUST\3rdParties\boost_1_34_0\boost/static_assert.hpp(34) : see declaration of 'boost::STATIC_ASSERTION_FAILURE' Regards, Alex Vinokur This message and the information contained herein is proprietary and confidential and subject to the Amdocs policy statement, you may review at http://www.amdocs.com/email_disclaimer.asp

2 1

Phoenix3 port to proto complete
by Thomas Heller 27 Jul '10

27 Jul '10

Ladies and Gentlemen, I proudly announce that the port of phoenix3 is completed! All testcases pass! (some with minor modifications) So, What is next? Here is my proposed schedule: - fix some minor issues - improve boost.bind compatibility: make all boost.bind testcases pass - implement all boost.lambda testcases and make them pass, as far as it is reasonable - add support for C++0x lambdas - make interoperability testcases for std::function, boost::function - adapt the documentation - clean up code (some parts are a little messy as of now) - improve compile time Did I miss something? This is a very tight schedule, I may not be able to finish all points during the GSoC period. Any help will be appreciated. Additionally a review of the current code is highly appreciated to point out some defects that might exist. The code can be checked out at: https://svn.boost.org/svn/boost/sandbox/SOC/2010/phoenix3 I will be happy to answer your questions! Additionally I would like to thank Joel de Guzman and Eric Niebler for their great assistance and initial designs! Best Regards, Thomas Heller

1 1

query regarding mutex
by Abbhishek Misra 27 Jul '10

27 Jul '10

Hello All, This is how mutex class looks like #include <boost/thread/mutex.hpp> class mutex: boost::noncopyable { public: mutex(); ~mutex(); void lock(); bool try_lock(); void unlock(); typedef platform-specific-type native_handle_type; native_handle_type native_handle(); typedef unique_lock<mutex> scoped_lock; typedef unspecified-type scoped_try_lock; }; Please help me figure out what purpose does 'unspecified-type' serve below. typedef unspecified-type scoped_try_lock; as I understand typedef type_a name_a ; enables name_a to be used instead of type_a what does unspecified-type stand for ? and how does one use it ? regards Abhishek

3 4

[Graph] Lazy BFS
by Belcourt, Kenneth 27 Jul '10

27 Jul '10

Hi, I'm looking to traverse a DAG using BFS where vertices are discovered after the last incident edge has been examined. That is, I want to discover vertices lazily rather than the current BFS behavior of discovering vertices eagerly (following the first incident edge). I know I can modify the BFS algorithm to effect this behavior but I'm wondering if anyone has figured out the visitor changes necessary to support this? Thanks. -- Noel

2 2

boost MPI Signal: Segmentation fault (11)
by Jack Bryan 26 Jul '10

26 Jul '10

Dear All, I run a 6 parallel processes with boost MPI on a system with OpenMPI. When the run-time of the program is short, it works well. But, if the run-time is long, I got errors: [n124:45521] *** Process received signal ***[n124:45521] Signal: Segmentation fault (11)[n124:45521] Signal code: Address not mapped (1)[n124:45521] Failing at address: 0x44[n124:45521] [ 0] /lib64/libpthread.so.0 [0x3c50e0e4c0][n124:45521] [ 1] /lib64/libc.so.6(strlen+0x10) [0x3c50278d60][n124:45521] [ 2] /lib64/libc.so.6(_IO_vfprintf+0x4479) [0x3c50246b19][n124:45521] [ 3] /lib64/libc.so.6(_IO_printf+0x9a) [0x3c5024d3aa][n124:45521] [ 4] /home/path/exec [0x40ec9a][n124:45521] [ 5] /lib64/libc.so.6(__libc_start_main+0xf4) [0x3c5021d974][n124:45521] [ 6] /home/path/exec [0x401139][n124:45521] *** End of error message *** It seems that there may be some problems about memory management. But, I cannot find the reason. My program needs to write results to some files. If I open the files too many without closing them, I may get the above errors. But, I have removed the writing files from my program. The problem appears again when the program runs longer time. Any help is appreciated. Jack July 25 2010 _________________________________________________________________ The New Busy is not the too busy. Combine all your e-mail accounts with Hotmail. http://www.windowslive.com/campaign/thenewbusy?tile=multiaccount&ocid=PID28…

2 1

Boost::interprocess::string problems
by this_thread 26 Jul '10

26 Jul '10

Good morning all! Many thanks in advance to anyone that can help me out with this matter. I've been doing some work with Boost::Interprocess shared memory lately, and finding it incredibly useful. I've successfully put interprocess mutexes (muti?) and vectors to work, but for whatever reason, I can't seem to get the hang of interprocess strings. I'm sure I'm just missing something stupidly obvious, and to a degree I already see it but don't know what the solution is. For a vector, I know I've got a create a new interprocess allocator which allocates whatever I want to store using the interprocess segment manager: typedef boost::interprocess::allocator<Foo, boost::interprocess::managed_shared_memory::segment_manager> FooAllocator; Then create a special vector which uses that allocator: typedef boost::interprocess::vector<Foo, FooAllocator> FooInterprocessVector; This works great, provided I remember to find<FooInterprocessVector> on the opposite process before accessing the vector during periods when it may have been modified. I can't seem to get the hang of strings though. I've looked around online and can't seem to find an example of how this should be set up, and I can't get it to accept an allocator. The only way I can seem to typedef one is something like: typedef boost::interprocess::string BoostString - or - typedef boost::interprocess::basic_string<char> BoostString; Using this, so long as I only write a short string to the shared memory, things work fine, but anything over a few characters quickly clobbers other data. Has anyone used Interprocess::Strings before and could possibly point me in the direction I'm going wrong? Thank you all! -- View this message in context: http://old.nabble.com/Boost%3A%3Ainterprocess%3A%3Astring-problems-tp292061… Sent from the Boost - Users mailing list archive at Nabble.com.

3 8

base64 encoding ?
by Timothy Madden 26 Jul '10

26 Jul '10

Hello I keep looking in the online docs, and I can find old discussions on the issue, but I can not find the function for base64 encoding in boost. Can anyone please direct me to it ? Is it still there in boost ? Thank you, Timothy Madden

2 3

boost basic_file open
by Afshin Amighi 26 Jul '10

26 Jul '10

Hello , I am very new in boost file system and simply I wrote a sample to use boost file system. I need a file descriptor for both read and write. When I implement below code for "sink" and "source" files, they work. But I don't understand why I couldn't open a basic_file object to read and write. Any comment is appreciated. Thanks in advance. void test_boost2(){ long long size=5*1024*1024; char buffer [L_tmpnam]; const char* prefix = "c1t"; string tempPath(archive::tmpdir()); filesystem::path path(tempPath); filesystem::space_info spi(space(path)); strcpy(buffer,prefix); if( spi.free > size * 3/2 && tmpnam (buffer+sizeof(prefix)-1) != NULL){ buffer[sizeof(prefix)-1]='_'; path/=buffer; boost::iostreams::basic_file<char> *tmpFile= new basic_file<char>(path.string()); tmpFile->open(path.string()); if(tmpFile->is_open()){ long long p=size-DATA_SIZE-2; tmpFile->seek(p,ios_base::beg); tmpFile->close(); } delete tmpFile; } }

1 0

boost matching \b and match_not_null flag
by Gavrilov, Roman 26 Jul '10

26 Jul '10

Hello, I'm trying to find word boundaries with regex_search and "\b" pattern. I have the following code: string buff = "aaaa*******\\b"; boost::match_flag_type flags = boost::match_default | boost::match_not_null; boost::regex re("\\b"); boost::match_results<string::const_iterator> what; string::const_iterator start = buff.begin(); string::const_iterator end = buff.end(); if ( regex_search(start, end, what, re, flags)) { string out(start,what[0].second); cout << "match : " << out << endl; } I would expect it to print "aaaa" in out string and to match the second boundary, but in fact it didn't match anything. If I remove the match_not_null flag then it will match the first boundary at the beginning of the string as expected. I don't understand this behavior, am I missing something? Any help would be highly appreciated. Thanks, Roman

2 2

[move] move emulation with bind?
by Tim Blechmann 26 Jul '10

26 Jul '10

hi all, i'm trying to make one of my classes movable. however i have some issues when using it with boost::bind: class my_movable_class; void my_function(my_movable_class const &); this doesn't compile: boost::bind(my_function, boost::move(my_movable_class)) the reason is, that the members of boost::rv are private ... is this my fault or an issue with the move emulation? thanks, tim -- tim(a)klingt.org http://tim.klingt.org Just what the hell is the experimental tradition? Morton Feldman

3 4

[statechart] template state derived from simple_state compile error
by Nicolas Emiliani 26 Jul '10

26 Jul '10

Hi, I'm experiencing a compiling problem with boost.statechart. I created a template class called request<TCallBackType> derived from state_machine, and two template states called init<TCallBackType> and post<TCallBackType>, the idea is that request's initial states is init, and when recating to an event (initialize) it transits to post. The error i get is : sc_test.cpp: In member function ‘boost::statechart::result init<TCallBackType>::react(const initialize&)’: sc_test.cpp:38: error: expected primary-expression before ‘>’ token sc_test.cpp:38: error: expected primary-expression before ‘)’ token I'm pretty sure this has to be with the fact that the template method transit is here dependant of the template parameter, thus the compiler can't solve it, but I can't seem to figure it out. Tryed using typename but did not work. I'm using gcc (Ubuntu 4.4.3-4ubuntu5) 4.4.3 Any help will be aprecciated. Here's the code, there is a comment where the error occurs. #include <boost/statechart/event.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/state.hpp> #include <boost/statechart/transition.hpp> #include <boost/statechart/custom_reaction.hpp> #include <boost/mpl/list.hpp> namespace sc = boost::statechart; //FORWARD DECLARATION OF THE INITIAL STATE template<typename TCallBackType> struct init; template<typename TCallBackType> struct post; //STATE MACHINE template<typename TCallBackType> struct request : sc::state_machine<request<TCallBackType> , init<TCallBackType> > { TCallBackType call_backs; }; //EVENT struct initialize : sc::event<initialize> { }; //INITIAL STATE template<typename TCallBackType> struct init : sc::simple_state< init<TCallBackType>, request<TCallBackType> > { //reactions typedef boost::mpl::list< sc::custom_reaction<initialize> > reactions; //on initialize sc::result react(const initialize& e){ //HERE I GET THE COMPILING ERROR //IF I COMMENT THIS IT ALL GOES SMOOTHLY return this->transit< post<TCallBackType> > (); } typedef post<TCallBackType> p; }; //SECOND STATE template<typename TCallBackType> struct post : sc::simple_state< post<TCallBackType>, request<TCallBackType> > { //reactions typedef boost::mpl::list< sc::custom_reaction<initialize> > reactions; //on initialize sc::result react(const initialize& e){ return this->discard_event(); } }; int main(int argc, char* argv[]){ request<int> r; r.initiate(); return 0; } Nicolas Emiliani.

3 4

Re: [Boost-users] Multi_indexcomposite_key
by isjk 26 Jul '10

26 Jul '10

there are one hundred million defferent manufacturer, all have "A4", "A8", "A12", "A16"... model car. manufacturer and model is many-to-many relationship.</:includetail> Particularly large data.</:includetail> </:includetail></:includetail> struct _Modify_price</:includetail> {</:includetail> _Modify_price(int price_):m_price_(price_){}</:includetail> void operator()(car_model& cm_)</:includetail> {</:includetail> cm_.price = m_price_;</:includetail> }</:includetail> private:</:includetail> int m_price_;</:includetail> }; ------------------ 原始邮件 ------------------ 发件人: "Joaquin M Lopez Munoz"<joaquin(a)tid.es>; 发送时间: 2010年7月26日(星期一) 凌晨2:49 收件人: "boost-users"<boost-users(a)lists.boost.org>; 主题: Re: [Boost-users] Multi_indexcomposite_key isjk <isjk <at> foxmail.com> writes: > Oh, sorry. Nothing to be sorry about. On another topic, please don't top-post and try to follow the discussion policies of the list as summarized at http://www.boost.org/community/policy.html > Assume "cadillac" have "A4" model, "bmw" have "A4" model too. > now, if I will querying "A4" 's price, I must kown the manufacturer. > > ordered_no_unique< > tag<model>,BOOST_MULTI_INDEX_MEMBER(car_model,std::string,model), Correct, you must change from the example's original ordered_unique to ordered_no_unique so as to allow cars with from different manufacturers yet the same model name. > ct.insert(car_model("A4",cadillac,78901)); > ct.insert(car_model("A4",bmw,65412)); > > index_iterator<car_table,model>::type im0,im1; > boost::tuples::tie(im0,im1)=get<model>(ct).equal_range(model); > > car_table_manufacturer_view ctmv; > copy(im0,im1,back_inserter(ctmv)); > car_table_manufacturer_view::iterator ictmv = ctmv.find(cm); This looks right (haven't compiled it), although a little contrived: unless you expect to have *many* cars with the same model name, you can just traverse [im0,im1) and locate the car you're after. > ctmv.modify(cctmv, _Modify_price(10000)); // right or wrong??? I don't know how you've defined _Modify_price. Care to show? Joaquín M López Muoz Telefónica, Investigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users </:includetail>

2 1

[serialization] Reading back old archives
by David Raulo 26 Jul '10

26 Jul '10

Hello, I have a problem reading back serialization archives generated by older version of boost. I used to have a YYYYMMDD class versioning scheme. This broke with boost 1.42, which truncates the class version numbers to 16 bits, causing my code to generated corrupted archives. I fixed my code by implementing my own class versioning when compiling with boost 1.42, so I am again able to create archives that I can read back. Unfortunately this fixes only half of the problem. How can I read back archives that were saved using older releases of the serialization library? I saw that someone else opened ticket 3990 for the same problem. Here you suggested using the function get_library_version() in the following way: template<class Archive> void serialization(Archive & ar, unsigned int version){ library_version_type library_version = get_library_version if(library_version < 6) // the library version is a date my_date = version; else{ // don't use the boost serialization number, use ours instead ar & my_date; } ar && old_data_items if(ar.is_loading) if(my_date > "jan 10, 2010") ar & new_data_item; but I can't get this to work: the version argument is already truncated, and can't be interpreted as a date. As the bug reporter said, this is a case of data loss. Should I reopen ticket 3990, or is this code supposed to work with svn (I admit I did not test the trunk)? Thanks for your help, David.

2 11

[Serialization][BGL] problem serializing an edge
by Ireneusz Szcześniak 25 Jul '10

25 Jul '10

Hi, I have a problem serializing an edge in a graph. This is my test case: #include <iostream> #include <boost/archive/text_oarchive.hpp> #include <boost/graph/adj_list_serialize.hpp> using namespace std; using namespace boost; int main() { typedef adjacency_list<listS, vecS, undirectedS> Graph; typedef graph_traits<Graph>::edge_descriptor Edge; Graph g; Edge e; boost::archive::text_oarchive oa(cout); oa << g; oa << e; return 0; } Compilation with gcc version 4.4.1 returns this error: /usr/include/boost/serialization/access.hpp:109: error: ‘class boost::detail::edge_desc_impl<boost::undirected_tag, unsigned int>’ has no member named ‘serialize’ I would appreciate it if someone could point out what the problem is and how to fix it. Thanks, Irek -- Ireneusz (Irek) Szczesniak http://www.irkos.org

3 6

Re: [Boost-users] ¤Multi_indexcomposite_key~~
by isjk 25 Jul '10

25 Jul '10

Oh, sorry. Assume "cadillac" have "A4" model, "bmw" have "A4" model too. now, if I will querying "A4" 's price, I must kown the manufacturer. ordered_no_unique< tag<model>,BOOST_MULTI_INDEX_MEMBER(car_model,std::string,model) >,ct.insert(car_model("A4",cadillac,78901));ct.insert(car_model("A4",bmw,65412)); index_iterator<car_table,model>::type im0,im1; boost::tuples::tie(im0,im1)=get<model>(ct).equal_range(model);car_table_manufacturer_view ctmv;copy(im0,im1,back_inserter(ctmv));car_table_manufacturer_view::iterator ictmv = ctmv.find(cm); ctmv.modify(cctmv, _Modify_price(10000)); // right or wrong??? ------------------ 原始邮件 ------------------ 发件人: "Joaquin M Lopez Munoz"<joaquin(a)tid.es>; 发送时间: 2010年7月25日(星期天) 晚上7:17 收件人: "boost-users"<boost-users(a)lists.boost.org>; 主题: Re: [Boost-users]¤Multi_indexcomposite_key~~ isjk <isjk <at> foxmail.com> writes: > > > thanks a lot! > > now, I have a new problem: > > Multi_index example 6: complex searches and forergn keys, > struct car_manufacturer > { > std::string name; > }; > > struct car_model > { > std::string model; > car_manufacturer* manufacturer; > int price; > }; > > I want use "model, name" to query "price", and I maybe to modify "price". > > How to do it? thanks. Sorry but your question is not clear to me: what do you mean by querying "price" using "model, name"? If you know the model of a car then you just can use find() in the car_table to locate the element and access the price. As for modifying, there's a tutorial section on updating elements of a multi_index_container at http://www.boost.org/libs/multi_index/doc/tutorial/basics.html#ord_updating Joaquín M López Muoz Telefónica, Investigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Boost link error with mingw
by Eugen Dedu 25 Jul '10

25 Jul '10

Hi everybody, We compile ekiga for windows and boost signals is one of its dependencies, so we need to compile it for windows. I use gcc-mingw32 from debian unstable (gcc configured for mingw, version 4.4.4-0.1) and I do like this: - download boost 1.43.0 - echo "using gcc : : i586-mingw32msvc-gcc : ;" >$(BOOST_DIR)/user-config.jam - cd $(BOOST_DIR); ./bjam $(confboost) with: confboost := --user-config=user-config.jam --layout=system variant=release threading=multi link=shared runtime-link=shared target-os=windows threadapi=win32 --without-math --without-python --without-mpi --without-serialization --without-test --without-thread --without-wave --without-date_time --without-system --without-filesystem --without-graph --without-graph_parallel --without-iostreams --without-program_options --without-regex --without-random -q stage 1. I have a link error: Component configuration: - date_time : not building - filesystem : not building - graph : not building - graph_parallel : not building - iostreams : not building - math : not building - mpi : not building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : building - system : not building - test : not building - thread : not building - wave : not building ...patience... ...found 601 targets... ...updating 4 targets... gcc.link.dll bin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/libboost_signals.dll.a Creating library file: bin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/libboost_signals.dll.abin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/trackable.o:trackable.cpp:(.text+0xc): undefined reference to `___gxx_personality_sj0' bin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/trackable.o:trackable.cpp:(.text+0x6d): undefined reference to `operator delete(void*)' bin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/trackable.o:trackable.cpp:(.text+0xac): undefined reference to `___gxx_personality_sj0' bin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/trackable.o:trackable.cpp:(.text+0x10d): undefined reference to `operator delete(void*)' [...] I have discovered that the link can proceed if I do: - echo "using gcc : : i586-mingw32msvc-g++ : ;" >$(BOOST_DIR)/user-config.jam - cd $(BOOST_DIR); ./bjam $(confboost) i.e. compile again after changing gcc to g++, but of course this is a workaround. How to solve it properly? (here is the output after changing to g++: [..] - thread : not building - wave : not building ...patience... ...found 601 targets... ...updating 4 targets... gcc.link.dll bin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/libboost_signals.dll.a Creating library file: bin.v2/libs/signals/build/gcc-mingw-4.4.4/release/target-os-windows/threadapi-win32/threading-multi/libboost_signals.dll.a common.copy stage/lib/libboost_signals.dll.a common.copy stage/lib/libboost_signals.dll ...updated 4 targets... ) Second, I execute afterwards: - cd $(BOOST_DIR); ./bjam $(confboost) install 2. Is $(confboost) still needed or not for install? 3. This command does nothing for about 1 minute 30 secs (I thought at the beginning that it simply does not work, fortunately I let it execute more than 10 seconds to see what happens), and only afterwards copy the files. Executing through strace shows many lines like this: brk(0x6116000) = 0x6116000 and these lines take almost all the installation time. Best regards, -- Eugen Dedu

2 2

回复： Multi_indexcomposite_key~~
by isjk 25 Jul '10

25 Jul '10

thanks a lot! now, I have a new problem: Multi_index example 6: complex searches and forergn keys, struct car_manufacturer { std::string name; }; struct car_model { std::string model; car_manufacturer* manufacturer; int price; }; I want use "model, name" to query "price", and I maybe to modify "price". How to do it? thanks. ------------------ 原始邮件 ------------------ 发件人: "Joaquin M Lopez Munoz"<joaquin(a)tid.es>; 发送时间: 2010年7月22日(星期四) 凌晨2:08 收件人: "boost-users"<boost-users(a)lists.boost.org>; 主题: Re: [Boost-users] Multi_indexcomposite_key~~ isjk <isjk <at> foxmail.com> writes: > > hi all, > > now,I have a composite_key like this, > struct leader_key > boost::multi_index::composite_key< > channel_info, > BOOST_MULTI_INDEX_MEMBER(channel_info, boost::uint64_t, st_md5_), > BOOST_MULTI_INDEX_MEMBER(channel_info, boost::uint32_t, st_rank_), > BOOST_MULTI_INDEX_MEMBER(channel_info, boost::uint8_t, st_degrees_), > BOOST_MULTI_INDEX_MEMBER( > channel_info, boost::uint8_t, st_lan_type_) > >{}; > > I used "md5, rank, degrees, lan_type" to query. > I want to the result like this, > equal to md5, > less than rank > degrees from small to large > equal to lan_type You can't do this by issuing a single lookup operation. A composite key on keys k1,...,kn allows you to do lookup operations of the form k1==a1, ... , kj==aj, kj+1==aj+1 k1==a1, ... , kj==aj, kj+1< aj+1 k1==a1, ... , kj==aj, kj+1<=aj+1 k1==a1, ... , kj==aj, kj+1> aj+1 k1==a1, ... , kj==aj, kj+1>=aj+1 For any j in the range [1,n], that is, you can query for the exact value of the first j keys and add any type of inequality for the last key being queried. In your particular case you can rearrange the key extractors of your composite key in the following order md5,lan_type,rank,degress then use lower_bound with elements equal to md5 equal to lan_type less than rank (note you've had to rearrange the extractors in leader_key to be able to do this) which gives you some result "it", and finally manually traverse the range [begin,it) to obtain those elements with degrees from small to large. Hope this helps, Joaquín M López Muoz Telefónica, Investigación y Desarrollo _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

boost::xpressive - Regex stack space exhausted
by Pavol Supa 25 Jul '10

25 Jul '10

Hi, I need to match a hex-written byte array, optionally separated with spaces. So i tried: boost::xpressive::sregex r = * ( * blank >> repeat<2,2> (xdigit)); smatch match; regex_match (input, match, r); when i use input of approx. 150 hex pairs, i get an exception "Regex stack space exhausted" (i use default stack size by Visual studio 2008) This pattern looks quite simple, so I'd like to know, if there is some fundamental problem with this expressions. I know i can enlarge the stack manually, but i expect the input to be cca 10kB long, depending on user input, so i consider it not being a good solution. Pavol

4 14

[units] inconvent printing of composite scaled units
by alfC 25 Jul '10

25 Jul '10

In the following program, a quantity of fempto*second unit is printed as 0 fs (correctly) but a quantity of composed units composed meter over femptosecond is printed as P( m s^-1) I was expecting: m fs^-1 At first I though it was a bug, where the P is coming from? where the parenthesis is coming from?, but then I realized that P stands for Peta (10e15). is there any workaround? For example an easy way to define fs_unit in some other way such that the f (fempto) keeps attached to the s (second). Below is the example code #include<boost/units/systems/si.hpp> #include<boost/units/make_scaled_unit.hpp> #include<iostream> using namespace boost::units; using namespace std; int main(){ typedef make_scaled_unit<si::time, scale<10, static_rational<-15> > >::type fs_unit; quantity<fs_unit> t(1.*si::second); quantity<si::length> l(1.*si::meter); quantity<divide_typeof_helper<si::length, fs_unit>::type > v = l/t; cout << t << endl; // prints 1e+15 fs cout << l << endl; // prints 1 m cout << v << endl; //prints 1e-15 P(m s^-1), notice the P return 0; }

2 1

Problem with list_of, make_shared and shared_ptr
by alapex0310＠gmail.com 24 Jul '10

24 Jul '10

Hi, I am using boost::list_of to pass a vector of pairs of string + "unsigned char" to SomeClass (as it can be seen in the typedef below - keys_t). This passes the whole vector to SomeClass which copies the vector in the keys_ private variable. The problem is: the copy ctor now copies the full vector in each SomeClass. To prevent this, as you can see, I have defined another data member which is a reference to const keys_t in my class and am initializing it in the member initialization list of the constructor with the value of keys_ and having the copy constructor copy just the reference of keys_ (rkeys_, that is - as you can see in the member initialization list of the copy ctor) instead of the full vector but the new SomeClass then holds an uninitialized vector (keys_) which is ugly and I hate seeing it in the class. Can I possible use Boost::make_shared with boost::list_of to return me a pointer to whatever (vector of type keys_t) boost::list_of returns and store that pointer instead in my class (e.g. keys_t typedef then reflects boost::shared_ptr instead of a traditional pointer) instead of the full vector. Specifying the arbitrary constants (apparently using boost::list_of) right in the constructor call is a requirement. Is there any way I can do it? Of course, I guess I could use boost::make_shared to return me a boost::shared_ptr to keys_t but my code is not even compiling and giving me errors in boost headers: std::vector<std::pair<std::string,unsigned char>> keys_t; class SomeClass { public: SomeClass(std::string nameStr, keys_t keys) : keys_(keys), rkeys_(keys_) {} SomeClass(const SomeClass &koa) : rkeys_(koa.keys_) {} private: keys_t keys_; const keys_t &rkeys_; }; SomeClass *psc = new SomeClass( "MyClass", list_of<pair<string,unsigned char>> ("one", 1) ("two", 2) ("three", 3) ("four", 4) ("five", 5) ("six", 6)); I read in boost::doc that I cannot pass shared_ptr directly as a function argument because of temporary problems. So, I cannot pass a shared_ptr to the constructor of SomeClass and that's the primary reason I hope if you can help me use make_shared or something similar to get the job done. The constraint is: I *must* pass the arbitrary number of pairs of string-unsigned-char in my constructor and that's why I am using list_of. Any way out? -Al

2 1

[asio] clang++ duplicate symbol error when compiling http server2 example
by Dane Springmeyer 24 Jul '10

24 Jul '10

I'm building boost trunk (r64316) using clang++ on mac os x 10.6. The standing library build/install went well, but I hit this error when trying to build one of the boost::asio examples: $ cd libs/asio/example/http/server2 $ ../../../../../bjam toolset=clang [...snip...] clang-darwin.compile.c++ ../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/win_main.o clang: warning: argument unused during compilation: '-O0' In file included from win_main.cpp:13: In file included from ../../../../../boost/asio.hpp:20: In file included from ../../../../../boost/asio/basic_datagram_socket.hpp:20: In file included from ../../../../../boost/asio/basic_socket.hpp:19: In file included from ../../../../../boost/asio/basic_io_object.hpp:20: In file included from ../../../../../boost/asio/io_service.hpp:684: In file included from ../../../../../boost/asio/impl/io_service.hpp:18: ../../../../../boost/asio/detail/service_registry.hpp:38:15: warning: unknown pragma ignored [-Wunknown-pragmas] # pragma GCC visibility push (default) ^ ../../../../../boost/asio/detail/service_registry.hpp:47:15: warning: unknown pragma ignored [-Wunknown-pragmas] # pragma GCC visibility pop ^ 2 warnings generated. common.mkdir ../../../../../bin.v2/libs/thread/build/clang-darwin-2.8/debug common.mkdir ../../../../../bin.v2/libs/thread/build/clang-darwin-2.8/debug/threading-multi common.mkdir ../../../../../bin.v2/libs/thread/build/clang-darwin-2.8/debug/threading-multi/pthread clang-darwin.compile.c++ ../../../../../bin.v2/libs/thread/build/clang-darwin-2.8/debug/threading-multi/pthread/thread.o clang: warning: argument unused during compilation: '-O0' clang-darwin.compile.c++ ../../../../../bin.v2/libs/thread/build/clang-darwin-2.8/debug/threading-multi/pthread/once.o clang: warning: argument unused during compilation: '-O0' clang-darwin.link.dll ../../../../../bin.v2/libs/thread/build/clang-darwin-2.8/debug/threading-multi/libboost_thread.dylib common.mkdir ../../../../../bin.v2/libs/system/build/clang-darwin-2.8/debug common.mkdir ../../../../../bin.v2/libs/system/build/clang-darwin-2.8/debug/threading-multi clang-darwin.compile.c++ ../../../../../bin.v2/libs/system/build/clang-darwin-2.8/debug/threading-multi/error_code.o clang: warning: argument unused during compilation: '-O0' clang-darwin.link.dll ../../../../../bin.v2/libs/system/build/clang-darwin-2.8/debug/threading-multi/libboost_system.dylib clang-darwin.link ../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/server ld: duplicate symbol __ZN5boost4asio6detail14do_throw_errorERKNS_6system10error_codeE in ../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/io_service_pool.o and ../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/connection.o clang: error: linker command failed with exit code 1 (use -v to see invocation) "clang++" -o "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/server" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/connection.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/io_service_pool.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/mime_types.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/posix_main.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/reply.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/request_handler.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/request_parser.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/server.o" "../../../../../bin.v2/libs/asio/example/http/server2/clang-darwin-2.8/debug/threading-multi/win_main.o" "../../../../../bin.v2/libs/thread/build/clang-darwin-2.8/debug/threading-multi/libboost_thread.dylib" "../../../../../bin.v2/libs/system/build/clang-darwin-2.8/debug/threading-multi/libboost_system.dylib" -g Does anyone have suggestions or workarounds? Thanks, Dane

1 0

Extracting uBLAS from boost
by JohnnyRep 24 Jul '10

24 Jul '10

Hi! I am new to boost and I am mainly interested in the uBLAS library. As far as I understood it should be possible to extract that module with BCP and build it later on with BJAM?! I) So I downloaded the newest boost release. II) $ bcp uBLAS config build ~/workspace/libs/uBLAS Which seemed to be successful. At least I got all the expected folders to the chosen destination. I also got a boost-build.jam in my directory, so I tried a simple III) $ bjam toolset=gcc Which leads to: error: error: no Jamfile in current directory found, and no target references specified. May be I did that all in the wrong way, but there's no real HOWTO out there (especially for the last step). Hope someone can help me out!? Many thanks! J.R. -- View this message in context: http://old.nabble.com/Extracting-uBLAS-from-boost-tp29250085p29250085.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Boost services
by Bo Jensen 24 Jul '10

24 Jul '10

I have a small business which uses boost quite a lot, thanks for all the great code. I am missing some features at the moment. Is it either possible to donate to get some things done or does some qualified people offer such services for a fee ? More specifically I would like to see the doxygen integration being expanded.

5 11

[geometry] periodic boundary conditions
by alfC 24 Jul '10

24 Jul '10

Hi, I am starting to investigate the boost.geometry library. One of the applications I have already for it is in the context of particle simulations. I still have not much idea of the architecture of the library but it seem very powerful. So for example I was wondering if geometry has facilities for distances and points living in 3D periodic boundary conditions. Topologically it is a torus but with euclidean distance. If somebody could point where to look I will appreciate it. Thank you, Alfredo

3 3

Re: [Boost-users] [boost] Phoenix3 port to proto complete
by Ahmed Charles 23 Jul '10

23 Jul '10

> > std::bind and boost::bind are both monomorphic. phoenix::bind is > polymorphic! Would you (or anyone else) mind explaining polymorphic vs monomorphic in this context? Or point to an explanation? Thanks.

2 1

[asio] endpoint lifetime requirements with acceptor
by Jeff Flinn 23 Jul '10

23 Jul '10

What is the lifetime requirement of a boost::asio::ip::tcp::endpoint imposed by boost::asio::ip::tcp::acceptor. in particular it's ctor: boost::asio::ip::tcp::acceptor(boost::asio::io_service& io_, const endpoint_type&, bool); The end point is taken by const&. Is it just used, copied, or does the acceptor hold a const&? Are these sorts of issues documented? The only clue I can find is that the endpoint has a copy ctor. I can successfully construct the acceptor, passing in a temporary endpoint which is constructed in place in the acceptor's ctor, which appears to execute on both Win/MSVC8 and Mac/XCode3.2. But if I construct an endpoint further up the call stack passing it by const&, I get a runtime error. Any help appreciated. Thanks, Jeff

1 0

[Boost.Range] Filter adaptor
by Justin Leonard 23 Jul '10

23 Jul '10

I think I'm missing something obvious - but here goes. I'm trying to rewrite the a loop similar to the following using boost::range: [code] boost::range_iterator<Doubles>::type i = boost::begin(first_range); boost::range_iterator<Doubles>::type j = boost::begin(second_range); for( ; i != boost::end(first_range) && j != boost::end(second_range); ++i,++j) { if( f(*i) ) g(*j); } [/code] Is there something similar to: [code] for_each( filtered( second_range,first_range,f ) , g ); [/code] to use in place of the above? Thanks, Justin Leonard

2 1

break and return statement in lambda expression
by Conoscenza Silente 23 Jul '10

23 Jul '10

Hi All I created a lambda expression inside my std::for_each call. Inside it there is code like this one, but I have building error telling me that error: expected primary-expression before ‘break’ error: expected `]' before ‘break’ Do you know what it is and how to fix it? The same applies to return statement Thanks AFG namespace bl = boost::lambda; int a, b; bl::var_type< int >::type a_( bl::var( a ) ); bl::var_type< int >::type b_( bl::var( b ) ); std::for_each( v.begin(), v.end(), ( if_( a_ > _b_ ) [ std::cout << _1, break ] ));

2 6

[program option] accepting list of enumerated values ?
by John Dlugosz 22 Jul '10

22 Jul '10

I want a program to take an option that is one or more values from a short list; i.e. an enumeration. For sake of a simple example, let's use color names: "red", "yellow", "blue", "green", etc. I'd like to validate that only legal strings are passed, and convert them to an enumerated type or integer. Certainly I can write po::value<std::vector<color_t> >, but what's the best way to process the input? The docs shows a brief example of overloading 'validate' but it's not clear. I'd also like a short way to specify multiple colors without repeating the option. Something like --color=red,blue but whatever the natural syntax is. Is a multi-value on one instance of a switch something that's built in? Thanks, --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

[range] Boost.Range adaptor return types
by Jeremiah Willcock 22 Jul '10

22 Jul '10

I would like to return an adapted Boost.Range from a function and would like to know what return type to put for the function. In my case, I am wrapping a counting_range with transformed(). Is there a metafunction to compute these return types? Should I just be using boost::result_of? The result_of expression is very long because of the nesting (though of course a typedef can help with the inner parts of that). Thank you for your help. -- Jeremiah Willcock

2 2

Support for dimentionality reduction techniques.
by Khaldoun "Hal" Alaqqad 22 Jul '10

22 Jul '10

Hi, I am curious to whether boost provides / supports any of the dimensionality reduction algorithms : 1- Eigen value/ Eigen vector decomposition. 2- Principle component analysis 3- Latent Symantec analysis. 4- MDS Thanks Hal

2 1

Synchronous read from a serial port with timeout?
by Gözde Bahar KOŞ 22 Jul '10

22 Jul '10

Hello, Is there a way to use synchronous read function with a timeout mechanism? I want my code to block on read function till data/error comes from the serial port or timeout expires. How can I do this with asio? Best Regards, Gözde Bahar Koş ###################################################################### Dikkat: Bu elektronik posta mesaji kisisel ve ozeldir. Eger size gonderilmediyse lutfen gondericiyi bilgilendirip mesaji siliniz. Firmamiza gelen ve giden mesajlar virus taramasindan gecirilmekte, guvenlik nedeni ile kontrol edilerek saklanmaktadir. Mesajdaki gorusler ve bakis acisi gondericiye ait olup Aselsan A.S. resmi gorusu olmak zorunda degildir. ###################################################################### Attention: This e-mail message is privileged and confidential. If you are not the intended recipient please delete the message and notify the sender. E-mails to and from the company are monitored for operational reasons and in accordance with lawful business practices. Any views or opinions presented are solely those of the author and do not necessarily represent the views of the company. ######################################################################

2 1

[bind] Possible to use variadic templates with bind?
by Steve Lorimer 22 Jul '10

22 Jul '10

Hi Is it possible to pass variadic template arguments to bind, such that bind uses them as the placeholder arguments (_1, _2, _3 etc) I show my use case below. struct job_queue { // copy f into list for asynchronous envocation by another thread void enqueue(boost::function<void()> f); }; //----------------------------------------------------------------------- // helper class to define correct form of the member function callback template<class T, typename... Args> struct cb { typedef void (T::*type)(Args...); }; // a job defines a callback function which is any member function taking any number of arguments of any type template<class T, typename... Args> class job_t { boost::shared_ptr<job_queue> queue; boost::function<void(Args...)> arg_func; public: job_t(typename cb<T, Args...>::type cb, boost::shared_ptr<T> that, boost::shared_ptr<job_queue> q) : arg_func(boost::bind(cb, that, Args...)), queue(q) {} // normally would be _1, _2, _3, etc void post(Args&... args) { boost::function<void()> f = boost::bind(arg_func, args...); queue->enqueue(f); } };

3 6

boost 1.42 , vs2010 and Vista
by Michał Nowotka 22 Jul '10

22 Jul '10

Hello, I want to install boost 1.42 on my Vista with Visual Studio 2010 from sources. When I invoke bootstrap.bat I get this error: ---------------------------------------------------------------------------------- c:\boost_1_42_0>bootstrap.bat Building Boost.Jam build engine Failed to build Boost.Jam build engine. Please consult bjam.log for furter diagnostics. You can try to obtain a prebuilt binary from http://sf.net/project/showfiles.php?group_id=7586&package_id=72941 Also, you can file an issue at http://svn.boost.org Please attach bjam.log in that case. --------------------------------------------------------------------------------------------------- In the log file I get: --------------------------------------------------------------------------------------------------- Setting environment for using Microsoft Visual Studio 2010 x86 tools. ERROR: Cannot determine the location of the VS Common Tools folder. ### ### Using 'vc10' toolset. ### c:\boost_1_42_0\tools\jam\src>if exist bootstrap rd /S /Q bootstrap c:\boost_1_42_0\tools\jam\src>md bootstrap c:\boost_1_42_0\tools\jam\src>cl /nologo /RTC1 /Zi /MTd /Fobootstrap/ /Fdbootstrap/ -DNT -DYYDEBUG -wd4996 kernel32.lib advapi32.lib user32.lib /Febootstrap\jam0 command.c compile.c debug.c execnt.c expand.c filent.c glob.c hash.c hdrmacro.c headers.c jam.c jambase.c jamgram.c lists.c make.c make1.c newstr.c option.c output.c parse.c pathunix.c regexp.c rules.c scan.c search.c subst.c timestamp.c variable.c modules.c strings.c filesys.c builtins.c pwd.c class.c w32_getreg.c native.c modules/set.c modules/path.c modules/regex.c modules/property-set.c modules/sequence.c modules/order.c command.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set compile.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set debug.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set execnt.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set expand.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set filent.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set glob.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set hash.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set hdrmacro.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set headers.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set jam.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set jambase.c jamgram.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set lists.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set make.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set make1.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set newstr.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set option.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set output.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set parse.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set Generating Code... Compiling... pathunix.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set regexp.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set rules.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set scan.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set search.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set subst.c subst.c(1) : fatal error C1034: stddef.h: no include path set timestamp.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set variable.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set modules.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set strings.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set filesys.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set builtins.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set pwd.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set class.c c:\boost_1_42_0\tools\jam\src\strings.h(8) : fatal error C1034: stddef.h: no include path set w32_getreg.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set native.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set set.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set path.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set regex.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set property-set.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set Generating Code... Compiling... sequence.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set order.c c:\boost_1_42_0\tools\jam\src\jam.h(88) : fatal error C1034: fcntl.h: no include path set Generating Code... --------------------------------------------------------------------------------------------------- Can you tell me what I'm doing wrong? -- Regards Michał Nowotka

1 0

[xpressive] Buffer-boundary matching
by gbinfo＠web.de 22 Jul '10

22 Jul '10

Hi all, it seems that the buffer-boundary-matching expressions "\a", "\z" etc. are missing from xpressive. Can anyone confirm this? regards Gerd ___________________________________________________________ GRATIS für alle WEB.DE Nutzer: Die maxdome Movie-FLAT! Jetzt freischalten unter http://movieflat.web.de

1 0

[smart_ptr] No locks in quick allocator for shared pointers
by Manish Vachharajani 21 Jul '10

21 Jul '10

I was wondering if there was a standard way to turn off locks in the quick allocator for smart_ptr without disabling threading for all of Boost? It appears that the scoped_locks in the quick allocator are controlled by BOOST_HAS_THREADS. In turn, BOOST_HAS_THREADS seems to be controllable via BOOST_DISABLE_THREADS. However, I do not want to use this option as I need to link multiple programs against the same boost non-header libraries. Some programs have threading others do not. I want to be able to selectively disable locking for the non-threaded programs. If there is not better way to do this, the patch below adds a BOOST_QA_DISABLE_THREADS that will eliminate the scoped locks. --- .../boost/smart_ptr/detail/quick_allocator.hpp | 12 ++++++------ 1 files changed, 6 insertions(+), 6 deletions(-) diff --git a/ext/boost_1_43_0/boost/smart_ptr/detail/quick_allocator.hpp b/ext/boost_1_43_0/boost/smart_ptr/detail/quick_allocator.hpp index 159bd5e..ed878cb 100644 --- a/ext/boost_1_43_0/boost/smart_ptr/detail/quick_allocator.hpp +++ b/ext/boost_1_43_0/boost/smart_ptr/detail/quick_allocator.hpp @@ -70,7 +70,7 @@ template<unsigned size, unsigned align_> struct allocator_impl #endif -#ifdef BOOST_HAS_THREADS +#if defined(BOOST_HAS_THREADS) && !defined(BOOST_QA_DISABLE_THREADS) static lightweight_mutex & mutex() { @@ -89,7 +89,7 @@ template<unsigned size, unsigned align_> struct allocator_impl static inline void * alloc() { -#ifdef BOOST_HAS_THREADS +#if defined(BOOST_HAS_THREADS) && !defined(BOOST_QA_DISABLE_THREADS) lightweight_mutex::scoped_lock lock( mutex() ); #endif if(block * x = free) @@ -119,7 +119,7 @@ template<unsigned size, unsigned align_> struct allocator_impl } else { -#ifdef BOOST_HAS_THREADS +#if defined(BOOST_HAS_THREADS) && !defined(BOOST_QA_DISABLE_THREADS) lightweight_mutex::scoped_lock lock( mutex() ); #endif if(block * x = free) @@ -144,7 +144,7 @@ template<unsigned size, unsigned align_> struct allocator_impl { if(pv != 0) // 18.4.1.1/13 { -#ifdef BOOST_HAS_THREADS +#if defined(BOOST_HAS_THREADS) && !defined(BOOST_QA_DISABLE_THREADS) lightweight_mutex::scoped_lock lock( mutex() ); #endif block * pb = static_cast<block *>(pv); @@ -161,7 +161,7 @@ template<unsigned size, unsigned align_> struct allocator_impl } else if(pv != 0) // 18.4.1.1/13 { -#ifdef BOOST_HAS_THREADS +#if defined(BOOST_HAS_THREADS) && !defined(BOOST_QA_DISABLE_THREADS) lightweight_mutex::scoped_lock lock( mutex() ); #endif block * pb = static_cast<block *>(pv); @@ -171,7 +171,7 @@ template<unsigned size, unsigned align_> struct allocator_impl } }; -#ifdef BOOST_HAS_THREADS +#if defined(BOOST_HAS_THREADS) && !defined(BOOST_QA_DISABLE_THREADS) template<unsigned size, unsigned align_> lightweight_mutex * allocator_impl<size, align_>::mutex_init = &allocator_impl<size, align_>::mutex(); -- 1.7.0.1 Manish

1 0

PBGL Compile error on windows.
by Khaldoun "Hal" Alaqqad 21 Jul '10

21 Jul '10

I am trying to build the PBGL's boost_graph_mpi on windows 7 64bit. I generated the project files for VS 8/9/10, however the build has consistently shown compile errors: distributed_property_map.hpp(240): error C3855: 'boost::parallel::detail::associative_cache_ghost_cell_storage': template parameter 'Associativity' is incompatible with the declaration I tried to look for hints anywhere on the web, but did not find anything. Can anybody advise. Thanks.

1 0

Multi_index composite_key~~
by isjk 21 Jul '10

21 Jul '10

hi all, now,I have a composite_key like this, struct leader_key : boost::multi_index::composite_key< channel_info, BOOST_MULTI_INDEX_MEMBER(channel_info, boost::uint64_t, st_md5_), BOOST_MULTI_INDEX_MEMBER(channel_info, boost::uint32_t, st_rank_), BOOST_MULTI_INDEX_MEMBER(channel_info, boost::uint8_t, st_degrees_), BOOST_MULTI_INDEX_MEMBER(channel_info, boost::uint8_t, st_lan_type_) > { }; I used "md5, rank, degrees, lan_type" to query. I want to the result like this, equal to md5, less than rank degrees from small to large equal to lan_type How should I do?

2 1

[BGL] request to be added to list of BGL users
by Nil Geisweiller 21 Jul '10

21 Jul '10

Hi, OpenCog, an open source Artificial General Intelligence framework project http://www.opencog.org/wiki/The_Open_Cognition_Project uses BGL and we'll be pleased to be added to the list of BGL Users. Should you need any more info let me know. Regards, Nil

2 4

Odd boost::filesystem path behaviour?
by Tim Rawlinson 21 Jul '10

21 Jul '10

Hi, The following seems wrong to me, specifically the behaviour on Windows: path("/c:/file") Linux Windows by iteration "/", "c:", "file" "/", "c:", "/", "file" root_path "/" "/" relative_path "c:/file" "file" Is this behaviour correct? For reference, the boost::filesystem documents says: "All basic_path string or sequence arguments that describe a path shall accept the portable pathname format, ...", which the above path seems to be but it is interpreting it in a platform specific and, to my eyes, incorrect way. - Tim

1 0

[thread/condition_variable] crashes in condition variable
by Dietmar Hummel 21 Jul '10

21 Jul '10

Hi all! I have a problem with the condition variable class. I wrote a sync object class (something which two threads have a reference to, the one is waiting on in in wait() the other will signal it with signal(). This is some pseudo code which illustrates my problem: function doSomething() { // the sync object is to keep this thread // waiting until the other one is done CPGSUSyncObject cSyncObject; // give a pointer of the sync object to another thread ... // at one time in the future the other thread will call // its signal routine which calls condition_variable::notify_all // wait until the other one has done its tasks cSyncObject.wait(); } My problem (as far as I can see it) is the following: condition_variable::notify_all() calls wake_waiters() but does further tasks after this call (I assume that wake_waiters() is doing the real signalling by the os?). But if I have the task switch fast enough, it may happen that my doSomething() method runs out of scope deleting cSyncObject which is itself deleting the condition_variable. So the vector iteration code in condition_variable::notify_all() crashes because the object is already destroyed... Any help or good hints are appreciated... Regards Dietmar

2 2

Segmentation fault in lagged fibonacci random number generator
by Moritz Beber 21 Jul '10

21 Jul '10

Dear boost users, I have a very strange segmentation fault in lagged fibonacci and unfortunately, I was not able to reduce the problem to a simple example yet. I know that stinks of the problem coming from my code but please bear with me for a moment. I have two classes that both use the same other class for some random number generation. The two classes differ only in one unrelated function. If I run my program with one class everything works just fine, if I run it with the other after a few iterations the error occurs. I have no idea why, since they both use the exact same class from which the error occurs. I use the following code to get my generators: typedef boost::uniform_smallint<short unsigned> Small; typedef boost::variate_generator<rfn::RandGen&, Small> Small_Number; Small* _us_dist = new Small(1, 20); Small_Number* _len_gen = new Small_Number(rfn::Mutation::_parameters->rng(), *_us_dist); Where rfn::Mutation::_parameters->rng() gives me a reference from a lagged_fibonacci object held in that class. I then try to get a number in the following way: short unsigned length = (*_len_gen)(); I have attached a gdb run of the program crashing. If you have any ideas where I can look for this error please tell me. It's also no problem for me to send you the complete sources but it's a rather big project. Thank you for your help, Moritz

3 3

true typedef (true_typedef) implemented in boost?
by alfC 20 Jul '10

20 Jul '10

Hi, I stumbled upon the concept of true typedef, or strong typedef in opposition to usual typedef which are weak. http://www.drdobbs.com/184401633, there is a true_typedef implemented in stlsoft http://www.stlsoft.org/doc-1.9/classstlsoft_1_1true__typedef.html I was wondering if this is already implemented in some corner of Boost, or as a detail implementation. If it is really a useful concept (I don't know) then, I though, Boost should have it somewhere. And if it doesn't have it then it must mean that Boosters come out with something even better. Did they? Thank you, Alfredo

6 10

[pool] Threadsafety
by Ruediger Berlich 20 Jul '10

20 Jul '10

Hi there, just to clarify: The pool documentation says in the "Object Usage vs. Singleton Usage" section (see here: http://www.boost.org/doc/libs/1_43_0/libs/pool/doc/interfaces.html) "Pool objects with Singleton Usage may be shared; thus, Singleton Usage implies thread-safety as well." So, with the singleton pool interface I can safely do concurrent mallocs and frees on all supported OSs (using Boost.Thread for the concurrency part), albeit at the expense of having a YASWIOI (yet another singleton with its own interface) in my programs, with all pros and cons that singletons have ? Thanks and Kind Regards, Ruediger Berlich

1 0

First set of Boostcon 2010 videos are available
by Marshall Clow 20 Jul '10

20 Jul '10

Almost all of the Transactional Memory sessions from Boostcon are now available, with the exception of Tatiana Shpeisman's presentation on the "Draft Specification of Transactional Language Constructs for C++". That talk should (hopefully) be available tomorrow. Here are the links Maurice Herlihy : Transactional Memory Today - Keynote: http://blip.tv/file/3900047/ Justin Gottschlich:TBoost.STM Engine: http://blip.tv/file/3900167/ Tatiana Shpeisman: Draft Specification of Transactional Language Constructs for C++: <coming soon> Michael Wong: IBM's TM Research: http://blip.tv/file/3900242/ Mark Moir: Sun's / Oracle's TM Research: http://blip.tv/file/3905166/ Tatiana Shpeisman: Intel's TM Research: http://blip.tv/file/3905189/ Hartmut - I apologize for removing your (very nice) introduction for Maurice from the video. Unfortunately, Maurice was wearing the microphone, and none of what you said could be heard. -- Marshall

2 1

[asio] suitable chunked circular buffer implementation?
by Steve Lorimer 20 Jul '10

20 Jul '10

Hi folks I'm trying (in vain so far) to find a suitable circular_buffer that allows chunked reads/writes which I can use in boost asio. This is my use case: I have 2 threads, Thread 1 reads data from a socket (boost::asio::tp::tcp::socket) and writes it into a buffer (boost::asio::mutable_buffer) Thread 2 reads the buffer and parses out individual messages. Thread 2 shouldn't care about what Thread 1 is doing, specifically whether or not it has completed (or is in the process of) more writes than what Thread 2 has read. All Thread 2 should receive is a small packet of information (the interface being perhaps only iterator begin() and size_t size() ) relating to the chunk of data that was written into the buffer. Reading from the iterator should be safe (ie: it should wrap when it reaches the end of the buffer) Writing into the buffer shouldn't invalidate the iterators that were created previously (which were passed to the 2nd thread) I have an implementation from before I started using boost::asio, which is below. It's quite clearly not standard compliant, but it worked for me. Is there anything out there that works like I've described? Is there an alternative method which I should pursue rather than "chunked circular buffers"? Will I be able to create something like I've pasted below successfully to work with boost asio, or are there issues I'm unaware of? (The reason I ask this question is because I find it surprising that something like this doesn't exist already) Any and all help greatly appreciated. TIA Steve #ifndef _ring_buf_h_ #define _ring_buf_h_ #include <errno.h> #include <boost/thread/mutex.hpp> namespace ring { typedef unsigned char byte; static const uint32_t RING_SIZE = 2 * 1024 * 1024; // 2 meg class iterator { private: const byte* buf; int cur; size_t buf_size; public: iterator() : buf(), cur(), buf_size() {} iterator(const byte* _buf, int _cur, size_t _buf_size) : buf(_buf), cur(_cur), buf_size(_buf_size) {} const byte& operator*() const { return buf[cur % RING_SIZE]; } const byte& operator[](int n) const { return buf[(cur + n) % RING_SIZE]; } iterator& operator+=(int n) { cur += n; buf_size -= n; return *this; } iterator& operator++() { ++cur; --buf_size; return *this; } // post-inc iterator operator++(int) { iterator tmp(*this); ++cur; --buf_size; return tmp; } // pre-inc bool operator==(iterator b) const { return cur == b.cur; } bool operator!=(iterator b) const { return cur != b.cur; } size_t size() const { return buf_size; } int offset() const { return cur; } }; //---------------------------------------------------------------- inline iterator operator+(iterator a, int b) { return a += b; } inline iterator operator+(int b, iterator a) { return a += b; } class buffer { mutable boost::mutex mtx; byte buf[RING_SIZE]; unsigned beg; unsigned end; // may wrap, wrapping is blessed for unsigned types only public: buffer() : beg(), end() { memset(buf, 0, RING_SIZE); } // create an iterator object whose size = unread data in buf iterator data() const { boost::mutex::scoped_lock l(mtx); return iterator(buf, beg % RING_SIZE, end - beg); } // free space in ring unsigned size() const { boost::mutex::scoped_lock l(mtx); return end - beg; } // frees up space in the ring (called once data has been read) void adv(unsigned n) { boost::mutex::scoped_lock l(mtx); beg += n; } // read data from a file descriptor into the buffer // returns: // -errno for error // 0 for EOF // > 0 for successful reads int read(int fd) { mtx.lock(); unsigned free = RING_SIZE - (end - beg); if (!free) { mtx.unlock(); return -ENOMEM; // must never get here } unsigned free_end = std::min(free, RING_SIZE - end % RING_SIZE); unsigned free_beg = free - free_end; iovec io[] = { { (char*)buf + end % RING_SIZE, free_end }, { (char*)buf, free_beg } }; mtx.unlock(); ssize_t n = readv(fd, io, sizeof io / sizeof *io); if (n == -1) return -errno; mtx.lock(); end += n; mtx.unlock(); return n; } }; //---------------------------------------------------------------- } // namespace ring #endif

1 0

[accumulators] density histogram, what is typical way of using it?
by alfC 20 Jul '10

20 Jul '10

Hi, the documentation on accumulator::density is not very clear to me. It seems to fulfil the need for a histogram. Can anyone point at one concrete example using accumulator::density. For example, it seems to determine de bins from the first N samples accumulated. what if you pass less elements than this. Are the bins completely fixed after that? What was the logic behind that design rather than, for example, to somehow declared uniform bins in a range? What if I have to define uniform equispaced bins, do I pass a uniform sequence at the beginning? but then those elements will be counted? How the counters or probabilities are accessed at the end? What else can be done with the density accumulator object, can the cummulative or the inverse pdf be accessed easily within the library. Can it be plugged in into a random number generator as a distribution function. Thank you, Alfredo

2 1

BGL - accessing component subgraphs.
by Adam Spargo 20 Jul '10

20 Jul '10

Any tips on the best way to access a subgraph - ideally without the memory overhead of copying the subgraph to a new object. I want to pass each component of my graph to an algorithm separately, but in some cases the original graph will only have a single or a few component(s), in other cases there will be many. Maybe I will do it differently depending on how many components I have. Any tips welcome. Thanks, Adam. -- Dr Adam Spargo High Performance Assembly Group email: aws(a)sanger.ac.uk Wellcome Trust Sanger Institute Tel: +44 (0)1223 834244 x7728 Hinxton, Cambridge CB10 1SA Fax: +44 (0)1223 494919 -- The Wellcome Trust Sanger Institute is operated by Genome Research Limited, a charity registered in England with number 1021457 and a company registered in England with number 2742969, whose registered office is 215 Euston Road, London, NW1 2BE.

2 7