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

回复：Re: the performance of boost::lock_free is slow in centos 6 and 7
by gao1738＠sina.com 12 Jul '16

12 Jul '16

Thanks for the response! What I want to know are: 1. when I should use the boost::lock_free? 2. What is the main usage of boost::lock_free? Not for better performance? 3. what is the best practice for boost::lock_free? 4. why the better the machine is, the worse the performance for boost::lock_free? In my test 3, by using 32core machine, I test threads from 1 to 32. In all of the test cases, the boost::lock_free is much slower than mutex, why? Best regards, dennis ----- 原始邮件 ----- 发件人：james <dirtydroog(a)gmail.com> 收件人：boost-users(a)lists.boost.org 主题：Re: [Boost-users] the performance of boost::lock_free is slow in centos 6 and 7 日期：2016年07月08日 21点21分 I suspect the main issue with your test is the effects of false sharing being magnified when the number of cores is >= the number of threads. I'd also suggest using the mm_pause intrinsic when busy spinning if your CPU supports it. (It's a real shame there's no official spinlock class in C++) Also, use something like a countdown latch to make sure your threads all start the actual work at the same time. On Fri, Jul 8, 2016 at 1:50 PM, Michael <mwpowellhtx(a)gmail.com> wrote: On July 8, 2016 1:39:13 AM EDT, gao1738(a)sina.com wrote: > Hi all, > >I try the boost::lockfree::queue and find some performance issue： > >I use the following test programs: > >lock_free_test.cc > >#include <boost/thread/thread.hpp> >#include <boost/lockfree/queue.hpp> >#include <iostream> >#include<cstdio> > >#include <boost/atomic.hpp> > >boost::atomic_int producer_count(0); >boost::atomic_int consumer_count(0); > >boost::lockfree::queue<int> queue(128); > >const int iterations = 1000000; >const int producer_thread_count = 4; >const int consumer_thread_count = 4; > >void producer(void) >{ > for (int i = 0; i != iterations; ++i) { > int value = ++producer_count; > while (!queue.push(value)) > ; > } >} > >boost::atomic<bool> done (false); >void consumer(void) >{ > int value; > while (!done) { > while (queue.pop(value)) > ++consumer_count; > } > > while (queue.pop(value)) > ++consumer_count; >} > >int main(int argc, char* argv[]) >{ > using namespace std; > cout << "boost::lockfree::queue is "; > if (!queue.is_lock_free()) > cout << "not "; > cout << "lockfree" << endl; > > boost::thread_group producer_threads, consumer_threads;//线程组 > > for (int i = 0; i != producer_thread_count; ++i) > producer_threads.create_thread(producer); > > for (int i = 0; i != consumer_thread_count; ++i) > consumer_threads.create_thread(consumer); > > producer_threads.join_all(); > done = true; > > consumer_threads.join_all(); > > cout << "produced " << producer_count << " objects." << endl; > cout << "consumed " << consumer_count << " objects." << endl; >} > > >locktest.cc > >#include <boost/thread/thread.hpp> >#include <boost/lockfree/queue.hpp> >#include <iostream> >#include<cstdio> >#include <queue> > >#include <boost/atomic.hpp> >using namespace std; > >boost::mutex producer_count_mu; >boost::mutex consumer_count_mu; >int producer_count = 0; >int consumer_count = 0; > >std::queue<int> message_queue; > >boost::mutex queue_mutex; > >const int iterations = 1000000; >const int producer_thread_count = 4; >const int consumer_thread_count = 4; > >void producer(void) >{ > for (int i = 0; i != iterations; ++i) { > queue_mutex.lock(); > int value = ++producer_count; > message_queue.push(value); > queue_mutex.unlock(); > } >} I haven't used lockfree per se but my understanding is that it solves what its name says. My guess is that most of the time is spent contending for the mutex. Incidentally, why not use one of the proper lock classes? You are already using boost, so this is also there. That'll save you having to lock and unlock, at least. I haven't explored lockfree that much, I could be wrong, but I thought the whole point of running lockfree was to avoid expensive locks, but not absolving you of being aware of exhausted conditions when your queue was empty. Also, doing a test like this what are you really asserting? Lock free; not expense free. There are no free lunches. Less so ever before. Anyhow, HTH Regards, Michael Powell >bool done (false); >void consumer(void) >{ > int value; > while (!done) { > queue_mutex.lock(); > while (!message_queue.empty()) { > message_queue.pop(); > ++consumer_count; > } > queue_mutex.unlock(); > } > > queue_mutex.lock(); > while (!message_queue.empty()) { > message_queue.pop(); > ++consumer_count; > } > queue_mutex.unlock(); >} >int main(int argc, char* argv[]) >{ > using namespace std; > cout << "boost::lockfree::queue is "; >// if (!queue.is_lock_free()) > cout << "not "; > cout << "lockfree" << endl; > > boost::thread_group producer_threads, consumer_threads;//线程组 > > for (int i = 0; i != producer_thread_count; ++i) > producer_threads.create_thread(producer); > > for (int i = 0; i != consumer_thread_count; ++i) > consumer_threads.create_thread(consumer); > > producer_threads.join_all(); > done = true; > > consumer_threads.join_all(); > > cout << "produced " << producer_count << " objects." << endl; > cout << "consumed " << consumer_count << " objects." << endl; >} > > >The compile command is: >g++ -I/usr/local/inlcude -L/usr/local/lib lock_free_test.cc >-lboost_thread -lboost_system -o lock_free_test >g++ -I/usr/local/inlcude -L/usr/local/lib lock_test.cc -lboost_thread >-lboost_system -o lock_test > >1. I first test in on my work computer, which use ubuntu 14.04 with >2core(i5), with >boost version: 1.54 >gcc version: 4.8.4 >g++ version: 4.8.4 > >The test result is that: > >time ./lock_test > >boost::lockfree::queue is not lockfree > >produced 4000000 objects. > >consumed 4000000 objects. > > > >real 0m3.844s > >user 0m1.800s > >sys 0m12.308s > time ./lock_free_test > >boost::lockfree::queue is lockfree > >produced 4000000 objects. > >consumed 4000000 objects. > > > >real 0m1.745s > >user 0m6.886s > >sys 0m0.000s > > >We can see that the lock free solution has better performance, about >50%. > >2. then I test it in a PC server with centos 6.4 , and 8 core (CPU >Intel(R) Xeon(R) CPU E5-2650 0 @ 2.00GHz ) > >boost version: 1.54 >gcc version: 4.4.7 >g++ version:4.4.7 > >The test result is that: > >time ./lock_test >boost::lockfree::queue is not lockfree >produced 4000000 objects. >consumed 4000000 objects. > >real 0m3.900s >user 0m2.593s >sys 0m27.282s > > time ./lock_free_test >boost::lockfree::queue is lockfree >produced 4000000 objects. >consumed 4000000 objects. > >real 0m5.470s >user 0m43.105s >sys 0m0.000s > > >Non lock free solution is better than lock free solution. > >3. I test it in a better PC server with centos 7.1 and 32 core CPU >(Intel(R) Xeon(R) CPU E7-4820 v2 @ 2.00GHz) >boost version: 1.53 >gcc version: 4.8.3 >g++ version: 4.8.3 > >time ./lock_test >boost::lockfree::queue is not lockfree >produced 4000000 objects. >consumed 4000000 objects. > >real 0m3.023s >user 0m1.929s >sys 0m20.706s > >time ./lock_free_test >boost::lockfree::queue is lockfree >produced 4000000 objects. >consumed 4000000 objects. > >real 0m9.804s >user 1m14.900s >sys 0m0.100s > >The lock free solution will be 3 times lower than the non-lock free >solution! > > >My question is that: >1. why lock free solution will get better performance in ubuntu but >much slower in centos 6 and 7? > Is it the issue of kernal or the gcc version or the boost version? >The more cpu in the machine the worse performance for lock free >solution? > >2. In which case, we should use the boost lock free solution to get >better performance? > > > >Best Regards! > >dennis > > > > >------------------------------------------------------------------------ > >_______________________________________________ >Boost-users mailing list >Boost-users(a)lists.boost.org >http://lists.boost.org/mailman/listinfo.cgi/boost-users -- Sent from my Android device with K-9 Mail. Please excuse my brevity. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

3 2

[boost.test] Don't report skipped test as failure
by Florian Lindner 11 Jul '16

11 Jul '16

Hello, I use boost.test precondition in an MPI application to disable test at ranks != 0 if they do not use MPI: boost::test_tools::assertion_result isMaster(boost::unit_test::test_unit_id) { return precice::utils::Parallel::getProcessRank() == 0; } BOOST_AUTO_TEST_SUITE(NearestNeighborMapping) BOOST_AUTO_TEST_CASE(ConsistentNonIncremental, * boost::unit_test::precondition(isMaster)) {...} That works perfect, I just don't like that sipped test are reported as errors. Example with all tests deactivated: % ./testprecice Global setup Running 2 test cases... Global teardown *** Errors were detected in the test module "Master Test Suite"; see standard output for details Here you think it's an error, but it's just skipped tests: % ./testprecice -r detailed Global setup Running 2 test cases... Global teardown Test module "Master Test Suite" has failed with: 2 test cases out of 2 skipped Test suite "NearestNeighborMapping" has failed with: 2 test cases out of 2 skipped Test case "NearestNeighborMapping/ConsistentNonIncremental" was skipped Test case "NearestNeighborMapping/ConservativeNonIncremental" was skipped Could this behavior be changed somehow and skipped test not be reported as failures? Thanks, Florian

2 2

substantial lag time difference from boost::thread 1.57 and 1.60
by David Medine 09 Jul '16

09 Jul '16

Hello, I am an engineer in a neurosciences lab. We have some data acquisition software that uses boost::thread and some other boost libraries as well. Part of my job is to measure the lag time for our devices' data acquisition. I have been testing the acquisition software when linking against boost v.1.57.0 and v.160.0. Basically I generate a test signal and read it in with an NIDAQ and our EEG system. The signal is a series of 3ms long pulses. When the input to the NIDAQ goes high, I generate a timestamped marker. Meanwhile the EEG system is getting the same pulse train input and I record that digital data on its own thread and timestamp that as well. Then I compare the timestamps at which the EEG signal has a rising edge with the timestamps of the markers. The difference between these time values is the lag of the EEG system. The app I use to get the EEG signal uses boost::thread. The lag time is consistently ~2.7 ms when linking against boost v.1.57.0 and is a whopping 11.6 ms when I link against v.1.60.0. Since the data acquisition happens in a tight loop on its own thread, I am guessing that there is some kind of increased latency of boost threads in newer versions of the library. Does anybody know what might be causing this? I am on Windows 7, 64-bit and am using the pre-compiled boost libraries (i.e. I am not compiling them myself). Cheers, David

2 2

Acquiring and rebuilding C++ libraries on Windows
by Eric Mittelette 08 Jul '16

08 Jul '16

Hello I'm Program Manager at Microsoft, working on VC++ Libraries team (VC runtime, STL...) We are working on the spec of a tool to acquire 3rd party libraries on Windows. We are targeting mainly OSS libraries, our tool will help dev to rebuild locally from the source code on Windows. Today we have a proto, based on a port tree approach. (having a repo with the build script and the associated patch file) I wanted to have a discussion with the Boost community about this project, and how dev could acquire Boost this way. Feel free to contact me to initiate this discussion, we'll be happy to share our idea and prototype with you and collect feedback and suggestions. Best, Eric Mittelette Senior Program Manager - Visual C++ (VCLib) Microsoft Corp.

6 10

the performance of boost::lock_free is slow in centos 6 and 7
by gao1738＠sina.com 08 Jul '16

08 Jul '16

Hi all, I try the boost::lockfree::queue and find some performance issue： I use the following test programs: lock_free_test.cc #include <boost/thread/thread.hpp> #include <boost/lockfree/queue.hpp> #include <iostream> #include<cstdio> #include <boost/atomic.hpp> boost::atomic_int producer_count(0); boost::atomic_int consumer_count(0); boost::lockfree::queue<int> queue(128); const int iterations = 1000000; const int producer_thread_count = 4; const int consumer_thread_count = 4; void producer(void) { for (int i = 0; i != iterations; ++i) { int value = ++producer_count; while (!queue.push(value)) ; } } boost::atomic<bool> done (false); void consumer(void) { int value; while (!done) { while (queue.pop(value)) ++consumer_count; } while (queue.pop(value)) ++consumer_count; } int main(int argc, char* argv[]) { using namespace std; cout << "boost::lockfree::queue is "; if (!queue.is_lock_free()) cout << "not "; cout << "lockfree" << endl; boost::thread_group producer_threads, consumer_threads;//线程组 for (int i = 0; i != producer_thread_count; ++i) producer_threads.create_thread(producer); for (int i = 0; i != consumer_thread_count; ++i) consumer_threads.create_thread(consumer); producer_threads.join_all(); done = true; consumer_threads.join_all(); cout << "produced " << producer_count << " objects." << endl; cout << "consumed " << consumer_count << " objects." << endl; } locktest.cc #include <boost/thread/thread.hpp> #include <boost/lockfree/queue.hpp> #include <iostream> #include<cstdio> #include <queue> #include <boost/atomic.hpp> using namespace std; boost::mutex producer_count_mu; boost::mutex consumer_count_mu; int producer_count = 0; int consumer_count = 0; std::queue<int> message_queue; boost::mutex queue_mutex; const int iterations = 1000000; const int producer_thread_count = 4; const int consumer_thread_count = 4; void producer(void) { for (int i = 0; i != iterations; ++i) { queue_mutex.lock(); int value = ++producer_count; message_queue.push(value); queue_mutex.unlock(); } } bool done (false); void consumer(void) { int value; while (!done) { queue_mutex.lock(); while (!message_queue.empty()) { message_queue.pop(); ++consumer_count; } queue_mutex.unlock(); } queue_mutex.lock(); while (!message_queue.empty()) { message_queue.pop(); ++consumer_count; } queue_mutex.unlock(); } int main(int argc, char* argv[]) { using namespace std; cout << "boost::lockfree::queue is "; // if (!queue.is_lock_free()) cout << "not "; cout << "lockfree" << endl; boost::thread_group producer_threads, consumer_threads;//线程组 for (int i = 0; i != producer_thread_count; ++i) producer_threads.create_thread(producer); for (int i = 0; i != consumer_thread_count; ++i) consumer_threads.create_thread(consumer); producer_threads.join_all(); done = true; consumer_threads.join_all(); cout << "produced " << producer_count << " objects." << endl; cout << "consumed " << consumer_count << " objects." << endl; } The compile command is: g++ -I/usr/local/inlcude -L/usr/local/lib lock_free_test.cc -lboost_thread -lboost_system -o lock_free_test g++ -I/usr/local/inlcude -L/usr/local/lib lock_test.cc -lboost_thread -lboost_system -o lock_test 1. I first test in on my work computer, which use ubuntu 14.04 with 2core(i5), with boost version: 1.54 gcc version: 4.8.4 g++ version: 4.8.4 The test result is that: time ./lock_test boost::lockfree::queue is not lockfree produced 4000000 objects. consumed 4000000 objects. real 0m3.844s user 0m1.800s sys 0m12.308s time ./lock_free_test boost::lockfree::queue is lockfree produced 4000000 objects. consumed 4000000 objects. real 0m1.745s user 0m6.886s sys 0m0.000s We can see that the lock free solution has better performance, about 50%. 2. then I test it in a PC server with centos 6.4 , and 8 core (CPU Intel(R) Xeon(R) CPU E5-2650 0 @ 2.00GHz ) boost version: 1.54 gcc version: 4.4.7 g++ version:4.4.7 The test result is that: time ./lock_test boost::lockfree::queue is not lockfree produced 4000000 objects. consumed 4000000 objects. real 0m3.900s user 0m2.593s sys 0m27.282s time ./lock_free_test boost::lockfree::queue is lockfree produced 4000000 objects. consumed 4000000 objects. real 0m5.470s user 0m43.105s sys 0m0.000s Non lock free solution is better than lock free solution. 3. I test it in a better PC server with centos 7.1 and 32 core CPU (Intel(R) Xeon(R) CPU E7-4820 v2 @ 2.00GHz) boost version: 1.53 gcc version: 4.8.3 g++ version: 4.8.3 time ./lock_test boost::lockfree::queue is not lockfree produced 4000000 objects. consumed 4000000 objects. real 0m3.023s user 0m1.929s sys 0m20.706s time ./lock_free_test boost::lockfree::queue is lockfree produced 4000000 objects. consumed 4000000 objects. real 0m9.804s user 1m14.900s sys 0m0.100s The lock free solution will be 3 times lower than the non-lock free solution! My question is that: 1. why lock free solution will get better performance in ubuntu but much slower in centos 6 and 7? Is it the issue of kernal or the gcc version or the boost version? The more cpu in the machine the worse performance for lock free solution? 2. In which case, we should use the boost lock free solution to get better performance? Best Regards! dennis

3 2

BOOST_PP_SEQ_ENUM troubles
by Cherotek Music 08 Jul '16

08 Jul '16

Hi, I'm trying to make a macro chain that expands something like this *A, B, C* into something like this *{"A", create<AFile>}, {"B", create<BFile>}, {"C", create<CFile>}* This is what I have come up with *#define FORMATS A, B, C // Add new formats here* *#define SEQ_FORMATS BOOST_PP_VARIADIC_TO_SEQ(FORMATS)* *#define ARG_PAIR(s, data, x) {#x, create<x##File>}* *#define SEQ_ARG_PAIRS BOOST_PP_SEQ_TRANSFORM(ARG_PAIR, ~, SEQ_FORMATS)* *#define ARG_PAIRS BOOST_PP_SEQ_ENUM(SEQ_ARG_PAIRS)* The SEQ_ARG_PAIRS macro does expand into *({"A", create<AFile>}) ({"B", create<BFile>}) ({"C", create<CFile>})* but ARG_PAIRS fails with the following error: test.cpp:20:1: error: macro "BOOST_PP_SEQ_SIZE_0" passed 2 arguments, but takes just 1 ARG_PAIRS ^ BOOST_PP_SEQ_ENUM_0 ({"B", create<BFile>}) ({"C", create<CFile>}) ({"A", create<AFile>}) ({"B", create<BFile>}) ({"C", create<CFile>}) Any ideas? thanks a lot

3 7

boost::any with const value types
by Robert Dailey 07 Jul '16

07 Jul '16

I'm finding that if I store a `char*` versus `char const*` in a boost::any object, that this impacts the behavior of boost::any_cast. I do not find this documented anywhere. For example, if I store a const qualified character pointer in a boost::any object, then I do `boost::any_cast<char*>(......)`, it will throw. Changing the type to `char const*` fixes it. Is this by design? I find this makes things more difficult to deal with since I don't always know if the type I'm getting is const or not. Also my implementation does not change depending on constness.

4 3

State of context and coroutine
by Michael Steinberg 06 Jul '16

06 Jul '16

Hello, I find myself working on a project which makes use of boost::context functionality which got moved to the detail namespace somewhen before booost 1.61 . Now this project is mimicing something along the lines of boost::coroutine on top of context. I could try to adapt to the new intended usage of context or change the setup to use coroutine. Hence my question is whether the public coroutine interface, specifically the asymmetric parts, is stable yet? Im seeing 1's and 2's there side by side, so I could imagine there's still deciding on a good interface going on. Kind Regards, Michael

4 12

Re: [Boost-users] Acquiring and rebuilding C++ libraries on Windows
by LeMay.Steve 06 Jul '16

06 Jul '16

Probably a great topic for CPPCON. Sent from my iPad From: Ernest Zaslavsky Sent: 7/5/16, 8:44 PM To: , Boost Subject: Re: [Boost-users] Acquiring and rebuilding C++ libraries on Windows Hi, And what happened to the native NuGet packages idea? It is quite convenient way to get, use and update third parties. From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Eric Mittelette Sent: Wednesday, July 06, 2016 2:49 AM To: boost-users(a)lists.boost.org Subject: [Boost-users] Acquiring and rebuilding C++ libraries on Windows Hello I’m Program Manager at Microsoft, working on VC++ Libraries team (VC runtime, STL…) We are working on the spec of a tool to acquire 3rd party libraries on Windows. We are targeting mainly OSS libraries, our tool will help dev to rebuild locally from the source code on Windows. Today we have a proto, based on a port tree approach. (having a repo with the build script and the associated patch file) I wanted to have a discussion with the Boost community about this project, and how dev could acquire Boost this way. Feel free to contact me to initiate this discussion, we’ll be happy to share our idea and prototype with you and collect feedback and suggestions. Best, Eric Mittelette Senior Program Manager – Visual C++ (VCLib) Microsoft Corp. CONFIDENTIALITY NOTICE: This message is the property of International Game Technology PLC and/or its subsidiaries and may contain proprietary, confidential or trade secret information. This message is intended solely for the use of the addressee. If you are not the intended recipient and have received this message in error, please delete this message from your system. Any unauthorized reading, distribution, copying, or other use of this message or its attachments is strictly prohibited.

1 0

filesystem path{}.string() interface brittle when developing cross platform
by Werner Erasmus 05 Jul '16

05 Jul '16

Firstly, I would like to than the author/s of filesystem for their great work and their time. I've recently written some code on Linux where I had to adapt a filesystem::path object to string. I noticed that the return value was of type [const std::string&], and used the same return value in my getter that exposed the underlying string. Moving over to windows, I had strange crashes (undefined behaviour) as result of the type under windows being converted to [std::string]. The reason for the "undefined behaviour" took me a while to figure out. While understanding why the author returned by value (Windows API underlying type not a std::string...), I think that for a specific type, the contract concerning return value "semantics" should no be broken. There is a significant difference between returning by const reference as opposed to returning by value. If the contract cannot be held, the decision should be made to (in the interest of consistency/clarity) to return the same type for all OS's/platforms if the code is to be considered platform independent. This might mean to compromise by returning by value, or to, in the case of Windows (where the underlying string has a different type), cache the string, or at the very least document a *BOLD* note that caution must be taken. I can comprehend that if conversion is required, return by value is the only option. I expect type consistency per type, as this to me is part of the contract of a function. I don't consider this a bug, but would appreciate some response. Kind Regards

3 2

[coroutine2] - exceptions from constructor fail
by Tamas.Ruszkai＠leica-geosystems.com 01 Jul '16

01 Jul '16

2 1

Re: [Boost-users] Multiprecison: converting a complex class to a number<> backend (John Maddock)
by Daniel Brake 30 Jun '16

30 Jun '16

Hi Boost, particularly John Maddock and Christopher Kormanyos *first my response to John:* > From: John Maddock <jz.maddock(a)googlemail.com> > Date: Wed, 29 Jun 2016 19:28:19 +0100 Subject: Re: [Boost-users] Multiprecison: converting a complex class to a > number<> backend I suggest you take a look at rational_adaptor which does more or less > exactly this but for rational types - if you basically just gut the > function implementations from that file, search and replace the class > names, and then fill in the blanks you should be 95% there. > this is exactly the kind of advice i was looking for, thanks very much!!! i think i can get started almost right away. > This is actually something that's been on our TODO list for far too long, > ideally this should be part of the library - fancy helping out - or at > least being a testing guinea pig? > absolutely, i would love to help with this. the major challenge I see for getting everything fully functional in my active codebase using the new backend is Eigen. I continue to push the boundaries of Eigen with respect to expression templated numeric types, ha. i absolutely love that library! by the time I am done with my code, it will be expressions and templates the whole way down. i am guessing that personal emails or the dev list are the best place to continue discussion of helping work on this part of the library? > I quickly mocked up an example (attached) of how I think this should look > if we were to add it to the library, basically: > thanks for the mock-up! > As noted in the attached example, we really need another number category > for complex types, and while mixed arithmetic with (real) scalars will just > work, if you wanted an imaginary type as well, that would involve a whole > lot more work, as class number does not currently support return a type > different from either argument type in the binary operators (for real + > imaginary for example). > mixed real-complex is enough for me for now, adding imag-real specializations won't affect much of my codebase, so not currently a high priority for me. sometime over the rainbow, it might become important, but not right now. > And finally... there is this: > https://code.google.com/archive/p/cpp-imaginary-numbers/ which takes a > different view of things (but loses multiprecision's expression templates). > I really need the expression templates, but this is a good resource. thanks for the link. > PS, one final note: ideally this would be handled by std::complex, but > sadly that class can not be instantiated on any type other than > float/double/long double with invoking undefined behaviour. > agreed. the STL's most disappointing template to me: the std::complex. i was disheartened to feed in higher precision types, and get only double precision out of atan. then i found out about the invocation of UB resulting from what i had done... thanks for the response, John. you are always most helpful, and I really appreciate your time. ---------- *second, my response to Christopher and John* On 29/06/2016 22:17, Christopher Kormanyos wrote: > >> >> In my opinion, trying to adapt a complex number class to the backend >> requirements of number might not be the best way to go. >> >> I would recommend writing an extended complex template class >> that is intended to be instantiated for both user-defined types as well as >> float, double and long double. >> > should be a relatively easy conversion, to add template parameters to my class, and replace the hard-code of real_ and imag_ type. this is definitely a desirable modification, though not a pressing need in my context. It would be nice to be able to use any type. John, I think we should talk about the final needs of a complex_backend for inclusion in the multiprecision library. Thanks for the response Christopher. Thanks for reading and responding! Daniel

2 1

Re: [Boost-users] boost::serialize 1.61 ticket #12141 not quite fixed for VS2015? (Robert Ramey)
by Colin Humphries 30 Jun '16

30 Jun '16

Hello Robert, Thank you for your quick reply. Today I down-loaded and rebuilt boost 1.61.0, for both .zip and .7z versions from boost.org but I still see that final expanded line. Regards Colin Humphries On 6/26/16 3:33 PM, Colin Humphries wrote: > After converting to boost 1.61 and Visual Studio 15 we now see a > problem closely related to one reported in ticket #12141. Our XML > archives now end with the following 2 lines: > > </boost_serialization> > </boost_serialization> > > Could someone suggest a quick fix please? I think the problem must be > in archive/impl/xml_woarchive_impl.ipp but I cannot grasp how > the archive destructor emits the last line. When this was reported we took emergency action to make sure it was addressed before the final release. Are you sure you have the actual 1.61 final release? Robert Ramey >

1 0

boost unit test framework exports std::basic_ostringstream
by Sascha Kremers 30 Jun '16

30 Jun '16

The boost unit test framework exports std::basic_ostringstream to the dll. This causes linker errors on visual studio 2012 (LNK 2005), if the tested code contains std::basic_ostringstream. You can confirm the symbol std::basic_ostringstream is in boost_unit_test_framework-vc110-mt-1_61.dll by using dependency walker. I have the same problem with my self-built dlls as well as the ones downloaded from https://sourceforge.net/projects/boost/files/boost-binaries/. Is this a problem with boost or did I configure the build wrong? Thank you. I posted the issue on Stack Overflow a week ago [1]. Please excuse, if this still counts as cross posting. Regards Sascha [1] http://stackoverflow.com/questions/37922117/stdbasic-ostringstream-exported…

2 2

Re: [Boost-users] Multiprecison: converting a complex class to a number<> backend
by John Maddock 30 Jun '16

30 Jun '16

On 29/06/2016 22:17, Christopher Kormanyos wrote: > > In my opinion, trying to adapt a complex number class to the backend > requirements of number might not be the best way to go. > > I would recommend writing an extended complex template class > that is intended to be instantiated for both user-defined types as well as > float, double and long double. > > The real and imag parts are template parameter types. They could be > of type mpfr_float because the template parameter type is > determined at compile-time when the class is instantiated. > > In the winter, I wrote an extended complex class and tested it extensively > with multiprecision and fixed point. There was also another candidate > implementation of extended complex a few years ago from another > developer, but it never got to review. > > I have not yet made my extended complex code available. > > I am not subscribed to the user's list. If the post gets to the > developer's > list, there is a good chance I will see it. I'm curious as to what you see as the stumbling block to providing a complex number backend to class number<> ? The main advantages are that the expression-template code and all operator overloads are "just there" already, what do you see as the drawbacks? Best, John.

1 0

Multiprecison: converting a complex class to a number<> backend
by Daniel Brake 29 Jun '16

29 Jun '16

Hi Boost, I have implemented my own complex class wrapping around Boost.Multiprecision number<>, particularly mpfr_float. Now, I'd like to take the class I've written, and extend/convert it into a backend suitable for use in number<>. While I've read the documentation describing the requirements for a backend <http://www.boost.org/doc/libs/1_61_0/libs/multiprecision/doc/html/boost_mul…>, and think I understand what I need to do, I have found 0 examples in the wild. My current setup has a pair of files mpfr_complex.hpp, mpfr_complex.cpp describing something like (just what you'd expect, really) --------- class complex{ mpfr_float real_, imag_; public: // the *= family of operators, getters, setters, // some factory functions, etc }; //the free operators defined down here, along with pow, exp, etc. -------------- I think what I'd like to write is a new complex_backend.hpp file which implements the required functions for the complex wrapper around mpfr_float. In this file, I believe I implement the family of functions such as eval_multiply(b, a) in terms of the operators for my complex class. Is this right? In a related vein, with et_on for mpfr_float, I've started adding templated overloads for the complex operators and math function accepting expressions of reals, and I think this is going to get out of hand, so using number<> would conceivably save me a ton of time writing my own functions. It will also save me a ton of errors for hand-writing the expression templates for complexes, which appear to be ready to go from Boost.Multiprecision once I get a backend implemented. Again, my goal is expression templates for complexes with real and imaginary fields consisting of mpfr_floats, leveraging the number<> template, with et_on, and my own backend. Do you have any advice? Any references to any other custom backends? Daniel Brake University of Notre Dame Applied and Computational Mathematics and Statistics

2 1

Boost interprocess mutex with shared memory
by Ashok Palaniswamy 28 Jun '16

28 Jun '16

Hi all, I want to implement boost interprocess mutex with shared memory. This mutex will protect the SMBUS access between multiple processes. In the entire source code, this mutex will be used across different the files. Please let me know if you have any sample programs available. Thanks, P.Ashok L&T Technology Services Ltd www.LntTechservices.com<http://www.lnttechservices.com/> This Email may contain confidential or privileged information for the intended recipient (s). If you are not the intended recipient, please do not use or disseminate the information, notify the sender and delete it from your system.

2 1

boost::serialize 1.61 ticket #12141 not quite fixed for Visual Studio 15?
by Colin Humphries 27 Jun '16

27 Jun '16

After converting to boost 1.61 and Visual Studio 15 we now see a problem closely related to one reported in ticket #12141. Our XML archives now end with the following 2 lines: </boost_serialization> </boost_serialization> Could someone suggest a quick fix please? I think the problem must be in archive/impl/xml_woarchive_impl.ipp but I can't seem to grasp how the archive destructor emits the last line. Regards, Colin Humphries

2 1

Backend of multi_index container
by Anaswara Nair 27 Jun '16

27 Jun '16

Hi, I was going through the documentation of boost::multi_index container. I would like to know what is in its back end. Something like B-Tree,B+tree,etc.? Actually I want to create a database(in the sense it contains millions of records), but need not be reusable at a later period of time. i.e, I am looking only for run-time persistent data. Once data is inserted to this, it will not be modified. And there will be a unique id for each record. I would also like to know whether multi_index is the best suited one for the implementation of my so called database.. Thankyou

6 16

Re: [Boost-users] Backend of multi_index container
by anaswara 26 Jun '16

26 Jun '16

I have 7 fields in each record,two strings and five 64 bit integers. Of these,one of the integers is unique. I need to store all such records into the DB. In multi-index, I have a structure and this structure is being indexed by that integer value. If I have to similarly create a structure and store it as the value in LMDB, then what is its difference from multimap? I can do the same in multimap also. Then how does LMDB become a database. Sent from Samsung Mobile -------- Original message -------- From: degski <degski(a)gmail.com> Date: 24/06/2016 7:43 PM (GMT+05:30) To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Backend of multi_index container On 24 June 2016 at 15:51, Anaswara Nair <anaswara.nn(a)gmail.com> wrote: I have gone through LMDB. However AFAIK LMDB stores the data as a key-value pair. Yes, it's a key-value store. Though duplicate keys are allowed, I couldn't find any relation between these entries. I couldn't understand its use as a database as well. It's like std::(multi)map, maybe the wikipedia entry helps. Can you provide some help so that I can go deeper into this. In your original question, you refer to having one unique ID and some related data per record. Maybe you could expand a bit on what you would like to achieve. degski

1 0

[Boost.PropertyTree] Application hangs (Boost 1.61)
by Andrew C 25 Jun '16

25 Jun '16

Hi! It seems to be a bug that this application hangs inside "erase" method: #include <boost/property_tree/ptree.hpp> int main() { boost::property_tree::ptree pt; pt.erase(pt.begin()); // enters infinite loop... } Compiled with Cygwin/GCC-5.4.0. Is it really a bug or my misuse? Thanks!

2 2

CPack, CMake and Boost's shared libraries
by r＠primef.actor 25 Jun '16

25 Jun '16

What is the canonical cross-platform way to package boost shared libraries with CPack (and/or CMake)? On Windows, DLLs can be copied to the executable's folder and it will "just work". On OS X, one can use install_name_tool to set up a so-called rpath pointing to a relative location where the libraries reside, relative to the executable. On Ubuntu, one can similarly use ldd for setting up the correct pointers to where the libraries will reside relative to the executable. The question is then: is there some documentation on how to ship boost libraries along with your executable, in a cross-platform and canonical way, with CPack? Here's a question on stack overflow [1] that addresses the same problem, however the proposed solution of using set(CMAKE_EXE_LINKER_FLAGS "-Wl,-rpath='$ORIGIN'") in CMake does not seem cross-platform to me (MSVC won't recognize the command). Regards, Raoul [1]: http://stackoverflow.com/questions/26142948/packaging-c-program-using-boost…

1 0

[Interprocess] Sharing FFMPEG Datatypes
by Loren Garavaglia 25 Jun '16

25 Jun '16

Hi All, I'm trying to figure out if it's possible using Boost to share FFMPEG data between 2 processes. What I'm trying to do is have one process read from a video stream and place the received packets in a buffer. The other process then reads from the buffer, decodes the packet, and does some analysis on the image. Unfortunately, due to some constraints I cannot take a multi-threaded approach to this problem. My data that I would like to share is as follows: struct FFMPEGData { AVFormatContext *pFormatCtx; AVCodecContext *pCodecCtx; AVCodec *pCodec; AVFrame *pFrame, dst; AVPacket *packet; AVPacket* pack = new AVPacket[packetNum]; struct SwsContext *convert_ctx; }; With "pack" being my buffer with a set size. I tried following the boost example here <http://www.boost.org/doc/libs/1_57_0/doc/html/interprocess/allocators_conta…> but it seems to be for a simpler form of complex data. All of the FFMPEG datatypes are structs themselves, so I wasn't sure what to do. My question is, is it even possible to share these kinds of datatypes between processes using Boost Interprocess and if so do I need to create allocators and containers for all of the data fields within these FFMPEG datatypes? Thanks, Loren

2 1

Boost + Android NDK r11 + Clang
by Robert Dailey 23 Jun '16

23 Jun '16

How can I cross-compile static boost libraries for Clang in Android NDK r11 (arm) along with LLVM C++ (static)? Thanks in advance for detailed instructions

1 0

[iostreams] use of gzip_compressor with strings
by Boncek, John 23 Jun '16

23 Jun '16

I need to do some in-memory manipulation of strings, including compression to gzip format. I am new to the use of Boost and to the use of gzip. I found the following snippet on the Internet, compressing a std::string and producing a new std::string as output. This implies that gzip_compressor never produces a null byte in its output but the gzip_compressor documentation doesn't say that and my search of the underlying library zlib documentation doesn't say anything like that either. So is this a correct use? std::string compress(const std::string& data) { namespace bio = boost::iostreams; std::stringstream compressed; std::stringstream origin(data); bio::filtering_streambuf<bio::input> out; out.push(bio::gzip_compressor(bio::gzip_params(bio::gzip::best_compression))); out.push(origin); bio::copy(out, compressed); return compressed.str(); } Thanks, John Boncek

2 2

[Context] Console output problem under Cygwin
by Andrew C 23 Jun '16

23 Jun '16

Hi! Boost.Context examples (libs\context\example\v2) behave strangely under Cygwin/GCC-5.4.0. The problem is that all of the example applications output nothing to console. For example, jump_void.exe just ends at first "std::cout" command in execution context without any crash. This is the command line arguments I use to build both Boost.Context library and examples: b2.exe variant=debug link=static cxxflags="-std=c++14 -Wall -pedantic -D_GNU_SOURCE" Does anyone else ever met such a problem? Could it be a compiler bug or Boost.Context defect? Note: Under MinGW/GCC-4.9.3 all works OK. Thanks!

1 0

[polygon] get_trapezoids not reporting holes?
by David Thompson 22 Jun '16

22 Jun '16

Hi all, I am having trouble with boost::polygon: when get_trapezoids is called on a polygon_set_data containing a polygon_with_holes_data, it returns trapezoids covering the outer loop but that cover the hole (i.e., the hole is being ignored). A small example is below to demonstrate. I've tried with boost 1.60, 1.55, and 1.50. Am I doing something wrong? Thanks, David #include "boost/polygon/polygon.hpp" #include <vector> namespace poly = boost::polygon; typedef long long Coord; typedef poly::point_data<Coord> Point; Coord outerPts[] = { -37205784000000LL, -22528321200000LL, -20252740200000LL, -40391736000000LL, 19228717200000LL, -39708900000000LL, 37774737000000LL, 32882157000000LL, -37205784000000LL, -22528321200000LL, }; Coord innerPts[] = { -8808676800000LL, -4351000500000LL, 29799924000000LL, 21288613500000LL, 8185023000000LL, -10611816600000LL, -8808676800000LL, -4351000500000LL, }; template<typename T> void liftPt(double x[2], const T& pt, double sf) { x[0] = sf * pt.x(); x[1] = sf * pt.y(); } template<typename T> void print_polyarray(const std::string& msg, T& parr, double scale, double iscale) { std::cout << msg << " has " << parr.size() << " polygons\n"; std::vector<poly::polygon_data<Coord> >::const_iterator pit; int pp = 0; for (pit = parr.begin(); pit != parr.end(); ++pit, ++pp) { poly::polygon_data<Coord>::iterator_type pcit; std::cout << " Polygon " << pp << " has " << pit->size() << " points\n"; double p0[2]; for (pcit = poly::begin_points(*pit); pcit != poly::end_points(*pit); ++pcit) { liftPt(p0, *pcit, iscale); std::cout << " " << p0[0] << " " << p0[1] << "\n"; } std::cout << "--\n"; } } int main() { const double scale = 2.31e13; const double iscale = 1./2.31e13; poly::polygon_with_holes_data<Coord> pface; std::vector<poly::polygon_data<Coord> > holes; poly::polygon_data<Coord> loop; std::vector<Point> polypts1; for (unsigned ii = 0; ii < sizeof(outerPts)/sizeof(outerPts[0])/2; ++ii) { polypts1.push_back(Point(outerPts[2*ii], outerPts[2*ii + 1])); } pface.set(polypts1.begin(), polypts1.end()); std::vector<Point> polypts2; for (unsigned ii = 0; ii < sizeof(innerPts)/sizeof(innerPts[0])/2; ++ii) { polypts2.push_back(Point(innerPts[2*ii], innerPts[2*ii + 1])); } loop.set(polypts2.rbegin(), polypts2.rend()); holes.push_back(loop); pface.set_holes(holes.begin(), holes.end()); Point holecenter( 9725423400000LL, 2108598800000LL); Point nonholepnt(37774730000000LL, 32882150000000LL); // ^^ Compare to 37774737000000LL, 32882157000000LL, which is a vertex in outerPts. std::cout << "Polygon has " << pface.size() << " vertices and " << pface.size_holes() << " holes\n"; std::cout << "Winding is " << (poly::winding(pface) == poly::CLOCKWISE ? "cw" : "ccw") << "\n"; std::cout << "Contains hole center? " << (poly::contains(pface, holecenter) ? "Y" : "N") << "\n"; std::cout << "Contains point it should? " << (poly::contains(pface, nonholepnt) ? "Y" : "N") << "\n"; // The above demonstrates that pface appears to be a valid polygon with a hole. // However, now when we ask for trapezoids, no hole is provided: // Add pface to polys so we can get trapezoids: poly::polygon_set_data<Coord> polys; std::vector<poly::polygon_data<Coord> > parr; polys.insert(pface); polys.get(parr); // This prints that parr (and thus polys) contains 0 polygons, which seems wrong: print_polyarray("Original polygon set", parr, scale, iscale); polys.get_trapezoids(parr); // This prints 2 polygons that form only the outer boundary, which seems wrong: print_polyarray("Tessellation ", parr, scale, iscale); return 0; }

1 0

[boost] Checking interest in stacktrace library
by Antony Polukhin 22 Jun '16

22 Jun '16

Hi, I've got some prototype for getting stack traces: https://github.com/apolukhin/stacktrace It's design is based on the idea that class for stacktrace must be fully noexcept, without dynamic allocations in constructors and as simple as possible. Is there interest in it? What functionality would you like to have in it? -- Best regards, Antony Polukhin

7 12

Coroutine jump_fcontext crash (Boost 1.61)
by Jason Mancini 22 Jun '16

22 Jun '16

Hello, Starting with Boost 1.61, if -DBOOST_USE_VALGRIND=1 is set, then the Coroutine sample from boost docs crashes on first stack switch. Is this a known issue? (We're using GCC 6.1 on 64-bit Linux.) Not posting a code sample, it's literally the exact one from the Coroutine web page. Compile with the define, then run. We have Valgrind 3.10.1 installed. [Curiously, the Context code sample runs fine.] I am suspecting a missing snippet on the Coroutine side that affects stack_context structure size. Thanks! Jason # gdb ./a.out ... SIGSEGV, Segmentation fault. (gdb) bt #0 0x00002aaaaaab3ec0 in jump_fcontext () from .../lib/libboost_context.so.1.61.0 (gdb)

3 8

Re: [Boost-users] Suggestion for boost::dll:import_alias<>() or boost::dll::import<>()
by Leo Carreon 19 Jun '16

19 Jun '16

Sorry, I figured out how to use the search capability. I was misinformed because the documentation did not include the possible values for boost::dll::load_mode which I discovered by needing to have a look in the source code. From: Leo Carreon Sent: Sunday, June 19, 2016 1:40 PM To: Boost Users Mailing List Subject: Suggestion for boost::dll:import_alias<>() or boost::dll::import<>() Hi, I have been experimenting with the Boost.DLL library and I have discovered that the “lib” argument of either boost::dll::import_alias<>() or boost::dll::import<>() functions require the full path to the shared library to load. If I’m not mistaken, this functions use either the POSIX dlopen() function or the Windows LoadLibrary() function. These platform specific functions are capable of searching a list of paths if a non-qualified shared library name is given. My suggestion is to use this search capability for non-qualified shared library names. Kind regards, Leo Carreon

1 0

Suggestion for boost::dll:import_alias<>() or boost::dll::import<>()
by Leo Carreon 19 Jun '16

19 Jun '16

Hi, I have been experimenting with the Boost.DLL library and I have discovered that the “lib” argument of either boost::dll::import_alias<>() or boost::dll::import<>() functions require the full path to the shared library to load. If I’m not mistaken, this functions use either the POSIX dlopen() function or the Windows LoadLibrary() function. These platform specific functions are capable of searching a list of paths if a non-qualified shared library name is given. My suggestion is to use this search capability for non-qualified shared library names. Kind regards, Leo Carreon

1 0

is parallel-bgl active?
by Salvador Aguiñaga 17 Jun '16

17 Jun '16

Installing on a local 2 core system on a cluster ends in errors Installing on small system I want to use for temporary development, I get the following error. > > >parallel-bgl-0.7.0/boost/property_map/property_map.hpp:16:37: fatal > error: boost/pending/cstddef.hpp: No such file or directory > compilation terminated > > I've configured the system: > >"sudo apt-get install build-essential" > > And successfully installed the openmpi: "openmpi-1.10.2.tar.bz2" > > But when I get to: > /parallel-bgl-0.7.0/build/cmake .. > > I can't find a good solution online to this cstddef.hpp error. > > Any suggestions? > > > My system: uname -a > > Linux atomix 4.2.0-16-generic #19-Ubuntu SMP Thu Oct 8 14:46:51 UTC 2015 > i686 i686 i686 GNU/Linux >

1 0

Re: [Boost-users] boost bind, issue moving from 1.57 to 1.60
by Jason Mancini 17 Jun '16

17 Jun '16

We worked around this failure by changing: Func = boost::bind(Func, _1) && boost::bind(&Boom::Oops, _1); to Func = boost::bind(AND, Func, &Boom::Oops, _1); // custom AND function Not sure why it used to work, or why it still works with raw pointers, but not shared_ptr. The actual change happens from 1.59 (working) to 1.60 (changed behavior). Jason

4 11

Undefined Reference to 'boost::system::generic_category()'
by Blair Climenhaga 16 Jun '16

16 Jun '16

Hello everyone, I have been attempting to install OpenFOAM however the boost library has been giving me trouble, most recently reading out these error during OpenFOAM installation. undefined reference to `boost::system::generic_category()' undefined reference to `boost::system::system_category()' undefined reference to `boost::detail::set_tss_data(void const*, boost::shared_ptr<boost::detail::tss_cleanup_function>, void*, bool)' undefined reference to `boost::detail::get_tss_data(void const*)' If anyone has ever encountered this problem before, or has a hypothesis on how to solve I would be eager to hear your advice. I should mention that this error has persisted across multiple attempts at boost installs (1.48.0,1.52, and 1.61.0) as well as an update of my system from Ubuntu 12.04 to 14.04. Thank you everyone for your time in reading this and for any advice you may give. All the best, Blair Climenhaga

4 6

[xint] Ptoblems with compiling
by Андрей Серебро 16 Jun '16

16 Jun '16

1 0

[Log] Get the streams in a text_ostream_backend derived class
by Florian Lindner 16 Jun '16

16 Jun '16

Hello, I have class StreamBackend : public boost::log::sinks::text_ostream_backend and manually instantiate the backend and add a stream boost::shared_ptr<StreamBackend> backend = boost::make_shared<StreamBackend>(); backend->add_stream(boost::shared_ptr<std::ostream>(new std::ofstream(some file name))); using sink_t = boost::log::sinks::synchronous_sink<StreamBackend>; boost::shared_ptr<sink_t> sink(new sink_t(backend)); sink->set_formatter(config.second.format); sink->set_filter(config.second.filter); boost::log::core::get()->add_sink(sink); All I want is to overwrite the consume function in the derived class. Since I want to retain the original functionality as far as possible, I would like to work on the streams added add_streams. Problem is that the m_pImpl->m_Streams vector in the implementation is private and there is no method to get the added streams. What is the best way to go here? Thanks, Florian

1 0

boost bind, issue moving from 1.57 to 1.60
by Jason Mancini 16 Jun '16

16 Jun '16

Hello, The following minimized program works under 1.57 but no longer under 1.60, as the second bind results in calling of a member function with nullptr at run-time. Is the code mal-formed? Is it a boost bind bug? It still works fine with raw pointers, but no longer works correctly with boost::shared_ptr. Same result with gcc 4.8.1 and gcc 6.1.0 on Linux. Thanks, Jason ------------------- #include <stdio.h> #include <boost/shared_ptr.hpp> #include <boost/make_shared.hpp> #include <boost/bind.hpp> #include <boost/function.hpp> struct Boom { bool Oops() const { printf("Boom::Oops @ %p\n", this); return true; } }; int main() { boost::shared_ptr<const Boom> obj = boost::make_shared<Boom>(); using tMatcher = boost::function<bool(boost::shared_ptr<const Boom>)>; tMatcher Func = boost::bind(&Boom::Oops, _1); Func = boost::bind(Func, _1) && boost::bind(&Boom::Oops, _1); Func(obj); } ------------------- Expected output: Boom::Oops @ 0x11f6d79 Boom::Oops @ 0x11f6d79 Actual output: Boom::Oops @ 0x11f6d79 Boom::Oops @ (nil) -------------------

1 0

Handling process termination
by Shaginesh P.K.(NeSTIT) 12 Jun '16

12 Jun '16

Hi All, I am using boost library for logger. Seems pretty good. Am using boost with asynchronous sink. Hence require a close down of sink explicitly. But this is not possible when process crashes. Do boost have any mechanism for the same (Like handling the signals of OS and like stack dumps)? What does boost prefer for unexpected termination of process where the logs will go out uncollected? Could you please help me out of this? Thanks and Regards Shaginesh PK ________________________________ Confidentiality Statement / Disclaimer : This message and any attachments is intended for the sole use of the intended recipient. It may contain confidential information. Any unauthorized use, dissemination or modification is strictly prohibited. If you are not the intended recipient, please notify the sender immediately then delete it from all your systems, and do not copy, use or print. Internet communications are not secure and it is the responsibility of the recipient to make sure that it is virus/malicious code exempt. The company/sender cannot be responsible for any unauthorized alterations or modifications made to the contents. If you require any form of confirmation of the contents, please contact the company/sender. The company/sender is not liable for any errors or omissions in the content of this message. ________________________________

2 2

Re: [Boost-users] Another query on Boost DLL Library
by Leo Carreon 11 Jun '16

11 Jun '16

Please ignore this question, I found out the answer with a bit more understanding of the example. From: Leo Carreon Sent: Thursday, June 09, 2016 2:07 PM To: Boost Users Mailing List Subject: Another query on Boost DLL Library Hi, When using the factory method when creating a plugin, is it possible to pass an argument to the factory method? If yes, how? Kinds regards, Leo

1 0

Trouble Updating Boost to run OpenFOAM
by Blair Climenhaga 10 Jun '16

10 Jun '16

Hello Everyone, I have recently begun using OpenFOAM which requires boost for some of its functions, however upon installing OpenFOAM it appears that some of the needed Boost contents are not in my usr/include/boost such as the directories container, move, intrusive, core and many others. I have attempted to update boost in multiple ways so that these directories are added to the boost directory however I have had no success. The two types of attempts I have made are listed below. 1. Using sudo apt-get install libboost-all-dev, however this seems to just update the lib and provide me with the needed directories 2. Download the .zip of the newest boost version and follow the steps listed on the boost website. I have been downloading and installing the files to a directory in the home rather than usr and it seems that the product is not on the Path of the computer, as it is does not appear when I use the echo or whereis commands. If anyone has any advice for how to solve this issue or any recommendations I would greatly appreciate the assistance. Thank you for your time and for your help in advance. All the best, Blair Climenhaga

4 12

[boost] [thread] thread handling question
by Markus Pieper 09 Jun '16

09 Jun '16

Hi, this may be a very dumb question… My boost version is 1.56.0. In my program I use a database logging technique. To avoid blocking the main thread, I coded this: int main() { while(bDoCalculations == true) { // calculate some stuff m_Logger->doLogging(); } } void CLoggingData::doLogging() { std::vector<float>* Result; // fill Result boost::thread (&CLoggingData::doStoreData, this, Result); } void CLoggingData::doStoreData(std::vector<float>* dataVector) { // pass pointer to database writer instance delete dataVector; } I do not use join() in the doLogging method because I don’t want the main thread to block if the database is busy and will not respond immediately. But then, after a long run I get a boost::thread_resource_error exception. You may say: Of course, you never join your thread and after a few thousands new threads you blow your stack. Well, but what can I do to get my desired behavior? In the documentation I found this which I think of might help: You can use a thread_joiner to ensure that the thread has been joined at the thread destructor. int main() { boost::thread t(my_func); boost::thread_joiner g(t); // do someting else } // here the thread_joiner destructor will join the thread before it is destroyed. But where is the thread_joiner class implemented? Or do I have to add something inside my doStoreData method to end the thread properly? Thanks in advance, Markus Gesendet mit AquaMail für Android http://www.aqua-mail.com

4 6

Another query on Boost DLL Library
by Leo Carreon 09 Jun '16

09 Jun '16

Hi, When using the factory method when creating a plugin, is it possible to pass an argument to the factory method? If yes, how? Kinds regards, Leo

1 0

Re: [Boost-users] Query on Boost DLL Library
by Leo Carreon 09 Jun '16

09 Jun '16

After a bit more reading of the documentation, my understanding is std::shared_ptr can be used but not std::experimental::filesystem because boost::filesystem is an argument to boost::dll::import_alias. In light of this, can I request a revision to the Boost DLL Library. Can boost::filesystem be replaced with either std::experimental::filesystem or std::filesystem. whichever is available on the version of the compiler being used? The reason for this is so that there is only one version of the filesystem library to be used in your application. From: Leo Carreon Sent: Thursday, June 09, 2016 11:06 AM To: Boost Users Mailing List Subject: Query on Boost DLL Library Hi, In Boost DLL Library factory method example it uses boost::shared_ptr and boost::filesystem, can these be replaced by std::shared_ptr and std::experimental::filesystem? Kind regards, Leo

1 0

Query on Boost DLL Library
by Leo Carreon 09 Jun '16

09 Jun '16

Hi, In Boost DLL Library factory method example it uses boost::shared_ptr and boost::filesystem, can these be replaced by std::shared_ptr and std::experimental::filesystem? Kind regards, Leo

1 0

Re: [Boost-users] [boost] RFC : About forking a C++11 standard library and adapt it to C++98 compilers
by Vicente J. Botet Escriba 07 Jun '16

07 Jun '16

Le 06/06/2016 à 11:16, Joseph Van Riper a écrit : > On Thu, Jun 2, 2016 at 6:09 PM Vicente J. Botet Escriba < > vicente.botet(a)wanadoo.fr> wrote: > >> Hi, >> >> Some of us have to work yet with C++98 compiler at work (due to well >> know reasons) and this for a long time. This is a reality. >> >> I was wondering about forking a public domain C++11/14/17 standard >> library and adapt it to C++98 compilers. This library could be seen as >> another TR1, an extension of the C++03 standard library. >> >> Does this make any sens? Would this project be of interest for the >> Boost/C++ community? >> > Yes. At least for what we do where I work. > > The cyber-security field works with very old machines, either for forensics > (people forget they have some old machine until it gets hacked and some old > process that always "just worked" stops working), teaching (teaching old, > outmoded techniques helps to illustrate cyber security problems without > giving people tools for modern exploitation), or competitions. > > I kind of hate having to work with clunky, antediluvian C++ compilers that > magnify the level of woe required to deal with old machinery. Especially > while the rest of the C++ world moves on to the spiffy-shiny features found > in the later compilers. Having at least a library that helps us use some > of those nifty features can help us use our skills on more modern projects > when we move on to another job, while easing the efforts required to do our > work. A library wouldn't change your compiler ;-), but it could change the way you program :). > > Anyway, if you find that this will be useful to you at your work we will >> need your participation. Would you be interested in working on it? > > Hmmm... am I even knowledgeable enough? > > While I may find myself learning quite a lot about C++ by studying the > boost code people write, I am also humbled by what I see there. I fear I > am only beginning to dip into some of the intermediate meta-programming > techniques that seem to confer tremendous power to this language. > > as a Boost community project? >> outside Boost, as an independent project? >> > Hmmm... > > The boost 'brand' confers a certain gravitas. If you wish to maintain this > gravitas in the new library, I'd say keep the boost brand, but require the > same rigor. We have a License issue, so it couldn't be a Boost library :( Vicente P.S. Please, contact me privately if you are interested.

1 0

[BGL] breadth_first_search with distance record and predecessors?
by The Maschine 06 Jun '16

06 Jun '16

Hi all, Im trying to cover the dijkstra_shortest_paths call I usually do with a BFS. Id like to get back the predecessors so I can rebuild the paths and the distance to each vertex. The dijkstra_shortest_paths work for me fine! I tried a couple of BFS calls but I always get errors. What am I missing? std::vector<Vertex> predecessors(boost::num_vertices(m_ugraph)); // To store parents std::vector<Weight> distances(boost::num_vertices(m_ugraph), std::numeric_limits<double>::max() ); // To store distances IndexMap indexMap = boost::get(boost::vertex_index, m_ugraph); PredecessorMap predecessorMap(&predecessors[0], indexMap); DistanceMap distanceMap(&distances[0], indexMap); boost::dijkstra_shortest_paths(m_ugraph, s_vertex, boost::predecessor_map(predecessorMap).distance_map(distanceMap).weight_map(boost::get(&EdgeProperties::m_weight, m_ugraph)) ); //breadth_first_search(m_ugraph, s_vertex, visitor( make_bfs_visitor( record_predecessors( &predecessors, on_tree_edge() ) ) ).vertex_index_map( identity_property_map() ).record_distances(&distances.begin(),boost::on_tree_edge()) ); //boost::breadth_first_search(m_ugraph, s_vertex, boost::visitor(boost::make_bfs_visitor(std::make_pair(boost::record_distances(&distances.begin(),boost::on_tree_edge()),boost::record_predecessors(&predecessors.begin(),boost::on_tree_edge{}))))); Thanks a lot!

1 0

Boost.Fiber mini-review May 23 - June 1: review report
by Nat Goodspeed 06 Jun '16

06 Jun '16

The Boost.Fiber mini-review is now closed. Results: Bjorn Reese: YES Niall Douglas (private): YES Agustín K-ballo Bergé: YES Niall Douglas reminds me that in a previous mini-review he already voted to accept the Fiber library. Unless he stated that he had changed his mind, it would be reasonable to carry forward that "yes" vote. However, he did reaffirm his previous stance. In that spirit, let me remind the community of another couple previous positive votes: Eugene Yakubovich Antony Polukhin Significantly, there were no remaining NO votes. I therefore conclude that the Boost community ACCEPTS the Fiber library into the Boost family of libraries. On behalf of the Boost community, I would like to congratulate Oliver Kowalke not only for his engineering work, but for considerable patience in working to improve the library and its documentation. Thank you, Oliver!

3 3

Boost fusion problem
by Jess Morecroft 05 Jun '16

05 Jun '16

Hi guys, We're trying out the latest version of Boost (1.61, migrating from 1.55) and have some code calling the fusion library that now doesn't compile and it's not obvious (to me at least) why. I've created a simple program (below) to demonstrate the issue. As per the compile/run section below, this compiles and runs with Boost 1.55, not with 1.61. If anyone has any idea or pointers to what is wrong here I'd really appreciate it. Sorry if this isn't the right forum for this kind of issue too - if so please let me know how best to seek help on this. Regards Jess ******************** main.cpp #include <boost/fusion/algorithm/iteration/for_each.hpp> #include <boost/fusion/view/zip_view.hpp> #include <boost/fusion/tuple.hpp> #include <iostream> #include <string> struct Helper { template<typename Arg> void operator()(const Arg& arg) const { std::cout << boost::fusion::get<0>(arg) << std::endl; std::cout << boost::fusion::get<1>(arg) << std::endl; } }; int main() { const int myint(123); const double mydub(456.0); const std::string mystr("blah"); const bool mybool(false); typedef boost::fusion::tuple<const int&, const double&> Tuple1; typedef boost::fusion::tuple<const std::string&, const bool&> Tuple2; typedef boost::fusion::tuple<const Tuple1&, const Tuple2&> Tuple3; Helper helper; boost::fusion::for_each( boost::fusion::zip_view<Tuple3>( Tuple3(Tuple1(myint, mydub), Tuple2(mystr, mybool))), helper); return 0; } ******************** compile/run tests jess@flathead:~$ g++ --version g++ (Ubuntu 5.3.1-14ubuntu2) 5.3.1 20160413 Copyright (C) 2015 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. (boost 1.55) jess@flathead:~$ g++ -std=c++14 main.cpp jess@flathead:~$ ./a.out 123 blah 456 0 (boost 1.61) jess@flathead:~$ g++ -std=c++14 main.cpp In file included from /usr/local/include/boost/fusion/container/vector/vector10.hpp:25:0, from /usr/local/include/boost/fusion/view/transform_view/transform_view.hpp:22, from /usr/local/include/boost/fusion/algorithm/transformation/transform.hpp:11, from /usr/local/include/boost/fusion/view/zip_view/detail/begin_impl.hpp:14, from /usr/local/include/boost/fusion/view/zip_view/zip_view.hpp:16, from /usr/local/include/boost/fusion/view/zip_view.hpp:12, from main.cpp:2: /usr/local/include/boost/fusion/container/vector/vector.hpp: In instantiation of ‘constexpr boost::fusion::vector_detail::vector_data<std::integer_sequence<long unsigned int, _Idx ...>, T ...>::vector_data(boost::fusion::vector_detail::each_elem, U&& ...) [with U = {const boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>&}; long unsigned int ...I = {0ul, 1ul}; T = {const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&}]’: /usr/local/include/boost/fusion/container/vector/vector.hpp:305:97: required from ‘boost::fusion::vector<T>::vector(U&& ...) [with U = {const boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>&}; T = {const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&}]’ /usr/local/include/boost/fusion/view/zip_view/zip_view.hpp:128:30: required from ‘constexpr boost::fusion::zip_view<Sequences>::zip_view(const Sequences&) [with Sequences = boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>]’ main.cpp:32:64: required from here /usr/local/include/boost/fusion/container/vector/vector.hpp:230:52: error: mismatched argument pack lengths while expanding ‘boost::fusion::vector_detail::store<I, T>’ : store<I, T>(std::forward<U>(var))... ^ /usr/local/include/boost/fusion/container/vector/vector.hpp: In instantiation of ‘constexpr boost::fusion::vector_detail::store<<anonymous>, T>::store() [with long unsigned int <anonymous> = 0ul; T = const boost::fusion::tuple<const int&, const double&>&]’: /usr/local/include/boost/fusion/container/vector/vector.hpp:230:52: required from ‘constexpr boost::fusion::vector_detail::vector_data<std::integer_sequence<long unsigned int, _Idx ...>, T ...>::vector_data(boost::fusion::vector_detail::each_elem, U&& ...) [with U = {const boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>&}; long unsigned int ...I = {0ul, 1ul}; T = {const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&}]’ /usr/local/include/boost/fusion/container/vector/vector.hpp:305:97: required from ‘boost::fusion::vector<T>::vector(U&& ...) [with U = {const boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>&}; T = {const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&}]’ /usr/local/include/boost/fusion/view/zip_view/zip_view.hpp:128:30: required from ‘constexpr boost::fusion::zip_view<Sequences>::zip_view(const Sequences&) [with Sequences = boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>]’ main.cpp:32:64: required from here /usr/local/include/boost/fusion/container/vector/vector.hpp:137:24: error: value-initialization of reference type ‘const boost::fusion::tuple<const int&, const double&>&’ : elem() // value-initialized explicitly ^ /usr/local/include/boost/fusion/container/vector/vector.hpp: In instantiation of ‘constexpr boost::fusion::vector_detail::store<<anonymous>, T>::store() [with long unsigned int <anonymous> = 1ul; T = const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&]’: /usr/local/include/boost/fusion/container/vector/vector.hpp:230:52: required from ‘constexpr boost::fusion::vector_detail::vector_data<std::integer_sequence<long unsigned int, _Idx ...>, T ...>::vector_data(boost::fusion::vector_detail::each_elem, U&& ...) [with U = {const boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>&}; long unsigned int ...I = {0ul, 1ul}; T = {const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&}]’ /usr/local/include/boost/fusion/container/vector/vector.hpp:305:97: required from ‘boost::fusion::vector<T>::vector(U&& ...) [with U = {const boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>&}; T = {const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&}]’ /usr/local/include/boost/fusion/view/zip_view/zip_view.hpp:128:30: required from ‘constexpr boost::fusion::zip_view<Sequences>::zip_view(const Sequences&) [with Sequences = boost::fusion::tuple<const boost::fusion::tuple<const int&, const double&>&, const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&>]’ main.cpp:32:64: required from here /usr/local/include/boost/fusion/container/vector/vector.hpp:137:24: error: value-initialization of reference type ‘const boost::fusion::tuple<const std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&, const bool&>&’

2 3

Re: [Boost-users] [boost] RFC : About forking a C++11 standard library and adapt it to C++98 compilers
by Vicente J. Botet Escriba 03 Jun '16

03 Jun '16

Le 03/06/2016 à 01:35, Edward Diener a écrit : > On 6/2/2016 6:09 PM, Vicente J. Botet Escriba wrote: >> Hi, >> >> Some of us have to work yet with C++98 compiler at work (due to well >> know reasons) and this for a long time. This is a reality. >> >> I was wondering about forking a public domain C++11/14/17 standard >> library and adapt it to C++98 compilers. This library could be seen as >> another TR1, an extension of the C++03 standard library. >> >> Does this make any sens? Would this project be of interest for the >> Boost/C++ community? > > Most C++11 libraries have a Boost equivalent. In that case you could > either use the Boost library equivalent with your C++98 compiler or > use CXXD so that when you upgraded to a C++11 compiler you would not > have to change your code. CXXD would not ensure an almost compliant standard library. CXXD could be used to choose between this new library (scope C++11, implementation C++98) and the C++11 standard one. > So I assume you are talking about a C++11 library that does not have a > Boost equivalent. In which case what C++11/14/17 standard library are > you interested in forking ? No I was talking about the whole C++11 standard library. Vicente

1 0

RFC : About forking a C++11 standard library and adapt it to C++98 compilers
by Vicente J. Botet Escriba 03 Jun '16

03 Jun '16

Hi, Some of us have to work yet with C++98 compiler at work (due to well know reasons) and this for a long time. This is a reality. I was wondering about forking a public domain C++11/14/17 standard library and adapt it to C++98 compilers. This library could be seen as another TR1, an extension of the C++03 standard library. Does this make any sens? Would this project be of interest for the Boost/C++ community? I have not a clear idea of the cost of doing this work, how it should be done, what would be the limitations, ... but I'm sure that this would be quite useful on the projects that are forced to use C++98 and an excellent bridge to those that will move from C++98 to C++11 compilers. There are some Boost libraries that could be used to reduce the limitations, as Boost.Config/Predef, Boost.Move, ...and others that could be used as inspiration on how to implement them using C++98. Anyway, if you find that this will be useful to you at your work we will need your participation. Would you be interested in working on it? as a Boost community project? outside Boost, as an independent project? Comments and suggestion welcome. Best, Vicente P.S. The same can be done for C++14 standard libraries and the future standard C++17 libraries P.S.S. The same can be done for C++14 libraries and the future C++17 libraries but this time adapting to C++11 compilers (this will be much easier but the concerned community will be quite different ).

2 2