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

Windows installation issues
by Alexander Carôt 01 Aug '16

01 Aug '16

Hi all, after having switched from OSX and Linux to Windows 10 I have issues compiling boost (1.61)with the MinGW compiler. The very first step fails: bootstrap.bat mingw results in not finding a right path, denying access and aborting the installation. So far I only found this article: https://andres.jaimes.net/698/use-c-with-mingw-and-netbeans-in-windows/ but it does not contain further info how (and where) to add additional info (I added c:\MinGW\bin to my PATH but it didn’t help). Any help appreciated, thanks in advance Alex --

6 8

Python TypeError with application compiled with CXX11_ABI=0
by Jackson Wiegman 29 Jul '16

29 Jul '16

Hi, I have an application I am trying to compile on Ubuntu 16.04. This is using GCC 5.4.0 and libboost 1.58.0 (stock libraries). The application has a linking to a library that was built with GCC 4.*, so I have to compile with D_GLIBCXX_USE_CXX11_ABI=0 to get backwards comparability (otherwise I have undefined abi:cxx11 links). However when I do this, I get a TypeError in Python: TypeError: No registered converter was able to produce a C++ rvalue of type > std::string from this Python object of type str It looks like boost is having a problem working without the ABI. Does anyone have a work-around or a patch for this? Jackson

2 2

[Python] gcc error compiling boost
by Àlex Jarauta 29 Jul '16

29 Jul '16

Dear all, my name is Alex and I am a postdoc at the University of Alberta, Edmonton, Canada. I am working with an in-house opensource code that uses boost to wrap C++ code with Python. In the latest version of our code, one has to download boost manually and compile it. I have tried wot two different versions (1.59 and 1.60) and I can compile them with python 2.7. However, if I try to compile it using either Python 3.3 or 3.5, I always get the same error: "./boost/python/detail/wrap_python.hpp:50:23: fatal error: pyconfig.h: No such file or directory # include <pyconfig.h>" I have been looking for this error for a while, but I have not been able to find a proper solution. I wonder if you could help me on this matter. Thank you very much for your attention. Best regards, Àlex

2 1

Graph: Trying to filter on custom properties
by Amit Prakash Ambasta 29 Jul '16

29 Jul '16

How should I be writing the get_filtered_graph in a generic way? #include <map> #include <string> #include <vector> #include <iostream> #include <boost/graph/adjacency_list.hpp> #include <boost/property_map/property_map.hpp> #include <boost/graph/filtered_graph.hpp> #include <boost/graph/graph_utility.hpp> template <typename F> struct EdgeProperty { F features; EdgeProperty() = default; EdgeProperty(const F& f) : features(f) {} }; template <typename EM, typename F> struct filtered_edge { F filters; EM emap; filtered_edge() = default; filtered_edge(EM emap_, F filters_) : emap(emap_), filters(filters_) {} template <typename E> bool operator()(const E& e) { auto e_prop = get(emap, e); auto e_feat = e_prop.features; for (auto it: e_feat) { if (get(e_feat, it.first) != it.second) { return false; } } return true; } }; template<typename G, typename F> G get_filtered_graph(G& g, F& filters) { typedef filtered_edge<boost::property_map<G, EdgeProperty<F> >, F> filter_fn; filter_fn filter{get(&EdgeProperty<F>::features, g), filters}; boost::filtered_graph<G, filter_fn> fg(g, filter); return fg; } typedef std::map<std::string, int> dict; typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, boost::no_property, EdgeProperty<dict> > Graph; Graph create_empty_graph() noexcept { return {}; } int main() { const char* name = "ABCDE"; auto g = create_empty_graph(); auto v0 = boost::add_vertex(g); auto v1 = boost::add_vertex(g); auto v2 = boost::add_vertex(g); dict d01; d01["a"] = 1; dict d12; d12["b"] = 1; dict fil; fil["a"] = 1; auto ep01 = EdgeProperty<dict>{ dict{} }; boost::add_edge(v0, v1, d01, g); boost::add_edge(v1, v2, d12, g); std::cout << "Before filter" << std::endl; boost::print_graph(g, name); auto fg = get_filtered_graph(g, fil); std::cout << "After filter" << std::endl; boost::print_graph(fg, name); Graph ga; }

2 2

[boost.geometry] concept namespace conflicts with new concept keyword (gcc 6.1)
by kique G 28 Jul '16

28 Jul '16

Hello, I am using boost.geometry with gcc 6.1 and I am finding conflicts between the new concept keyword (-fconcepts) and the concept namespace: /usr/include/boost/geometry/geometries/concepts/point_concept.hpp:33:50: error: expected identifier before 'concept' Am I missing something? If not, are there any plans for renaming this namespace? Do you know of any other incompatibilities between the boost libraries and the concepts TS? Thanks and best regards, Enrique Garcia

2 2

SVGMath no longer available
by Je suis la poubelle 27 Jul '16

27 Jul '16

Hi, I don't have any question to ask (yet :) ) but have a comment. In the folder "libs\math\doc\html\math_toolkit", there's the file sf_implementation.html. Inside this file, there's a section called "Creating and Managing the Equations". Inside it, you talked about a program called SVGMath (with a hyperlink). However, the hyperlink points to a website which no longer exists. Have a nice day

2 1

[boost.geometry] Why point coordinates are stored to SVG as integers?
by Mikhail Matrosov 27 Jul '16

27 Jul '16

Hello, I'm using boost::geometry::svg_mapper to save my shapes with floating point coordinates into an .svg file. It works great, but they are stored as integers. I can see this line in svg_mapper.hpp: namespace detail { namespace svg { typedef model::point<int, 2, cs::cartesian> svg_point_type; }} Thus svg_point is clearly defined to have integer coordinates. However, it is not convenient - SVG handles floating point coordinated perfectly well. Why not using original type of the serialized collection and let streams handle representation? ----- Best regards, Mikhail Matrosov

2 1

Re: [Boost-users] lockfree : getting a move only type into spsc_queue
by Bjorn Reese 24 Jul '16

24 Jul '16

On 07/23/2016 11:36 PM, Thomas Novotny wrote: > In the end Imade a custom version of spsc_queue. Getting this working > (as a hack) was fairly easy, so I wanted to share it in the hope that a > better solution might make it into a future version of the library. FYI, there is a pull request about adding move support to spsc_queue, but the consequences have not been fully examined yet: https://github.com/boostorg/lockfree/pull/24 In the meanwhile, you can make a cleaner solution with a unique_ptr specialization of spsc_queue. See attachment. > bool push( T & t, T * buffer, size_t max_size ) T&& t

2 1

lockfree : getting a move only type into spsc_queue
by Thomas Novotny 23 Jul '16

23 Jul '16

I had a unique_ptr from a pool with a custom deleter that I needed to get int a lockfree queue. This did not work out of the box with either boost::lockfree::queue or boost::lockfree::spsc_queue. There were three main issues: * default construction * copying * copy construction To solve the issue with default constructability I had to wrap the unique_ptr in a class. In the end Imade a custom version of spsc_queue. Getting this working (as a hack) was fairly easy, so I wanted to share it in the hope that a better solution might make it into a future version of the library. In essence, I only had to add some std::move calls and adjust the api for push. two lines here: bool push(T const & t, T * buffer, size_t max_size) { const size_t write_index = write_index_.load(memory_order_relaxed); // only written from push thread const size_t next = next_index(write_index, max_size); if (next == read_index_.load(memory_order_acquire)) return false; /* ringbuffer is full */ new (buffer + write_index) T(t); // copy-construct write_index_.store(next, memory_order_release); return true; } to bool push( T & t, T * buffer, size_t max_size ) { const size_t write_index = write_index_.load( memory_order_relaxed ); // only written from push thread const size_t next = next_index( write_index, max_size ); if( next == read_index_.load( memory_order_acquire ) ) return false; /* ringbuffer is full */ new (buffer + write_index) T(); // default-construct *(buffer + write_index) = std::move( t ); // move write_index_.store( next, memory_order_release ); return true; } a line here: bool push(T const & t) { return base_type::push(t); } to bool push(T & t) { return base_type::push(t); } and a few lines here template< class OutputIterator > OutputIterator copy_and_delete( T * first, T * last, OutputIterator out ) { if (boost::has_trivial_destructor<T>::value) { return std::copy(first, last, out); // will use memcpy if possible } else { for (; first != last; ++first, ++out) { *out = *first; first->~T(); } return out; } } to template< class OutputIterator > OutputIterator copy_and_delete( T * first, T * last, OutputIterator out ) { for (; first != last; ++first, ++out) { *out = std::move(*first); first->~T(); } return out; } In copy_payload there is only one change struct copy_convertible { template <typename T, typename U> static void copy(T & t, U & u) { u = t; } }; became template <typename T, typename U> static void copy(T & t, U & u) { u = std::move(t); } and that was it. The result is not pretty but works (only single element push and pop used).

1 0

Boost Social Event at CppCon 2016
by Jon Kalb 23 Jul '16

23 Jul '16

Boost Users, Because a lot of Boosters are going to be attending CppCon, we¹d like to arrange a social event for Boosters/C++Now attendees. http://cppcon.org/ If you are planning to attend CppCon or even If you are just going to be in or around Bellevue, Washington between September 17th and 23rd and you¹d like to join us for dinner, please let us know so we can get a count. Please send mail to: social(a)boost.org Once we settle on a date, etc, we¹ll let everyone who responded know when and where, so please let us know, even if you are a ³maybe.² If you are attending, please make your hotel reservations soon. We are likely to sell out of our room block. http://cppcon.org/lodging/ I hope to see you at CppCon. Jon

1 0

Problem using Boost 1.61.0 with VTK Marching Cubes
by PAUL SMITH 15 Jul '16

15 Jul '16

To whom it may concern, I asked this question to boost-bugs, but I was told not to expect a response from that email address and instead ask here. I seem to be having a problem using Boost 1.61.0 in conjunction with VTK 7.0.0. My purpose for using Boost is to obtain the filenames of all PNG files in any given folder using the following code: #define BOOST_FILESYSTEM_VERSION 3 #define BOOST_FILESYSTEM_NO_DEPRECATED #include "boost/filesystem.hpp" namespace fs = ::boost::filesystem; // return the filenames of all files that have the specified extension // in the specified directory and all subdirectories void get_all(const fs::path& root, const string& ext, vector<fs::path>&ret) { if(!fs::exists(root) || !fs::is_directory(root)) return; fs::recursive_directory_iterator it(root); fs::recursive_directory_iterator endit; while(it != endit) { if(fs::is_regular_file(*it) && it->path().extension() == ext) ret.push_back(it->path().filename()); ++it; } } This code is used as part of the CXX file, which is built with an appropriate CMakeLists file using CMake 3.5.1 to produce a corresponding .xcodeproj file. CXX and CMakeLists files are attached. However, the main problem that I'm facing is that attempting to build the project using an ALL_BUILD scheme in Xcode 7.0.1 leads to a series of errors pointing to the #include statements of the header files in the Boost folder (which is located in the same folder as the CXX and CMakeLists files). For instance, it starts off saying that "'boost/filesystem/config.hpp' file not found" in response to the following line of boost/filesystem.hpp: # include <boost/filesystem/config.hpp> Such errors could be resolved if I were to modify the syntax of the #include statements to follow a different format: # include "./filesystem/config.hpp" i.e., replacing the <> with "" and using relative paths to find the other required header files. However, going in to modify every single header file is a sort of tedium that I find it difficult to handle, and therefore I was hoping for a simpler solution to this problem. By the way, I am on a Mac, and my operating system is El Capitan version 10.11.5. Thank you in advance.

3 2

回复：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