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

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