- Boost-users - lists.boost.org

type() Segmentation Fault
by Samuel Jiménez Gil 16 Feb '17

16 Feb '17

Hi, I've got a very strange segmentation error that stems from calling type() method in any class. Surprisingly, this only occurs in another compilation that I have where I link with other gnu libraries. In both cases I am compiling with -std=c++11 and cygwin32. Is anybody aware of type() method conflicting with other libraries? Many thanks. Best regards. -- Samuel Jiménez Gil. Ph.D. Student Real-Time Systems Group, Department of Computer Science University of York Heslington York, UK YO10 5GH Email disclaimer: http://www.york.ac.uk/docs/disclaimer/email.htm

1 0

[test] bitwise checks for non-integer types
by Norbert Wenzel 14 Feb '17

14 Feb '17

I was just surprised that BOOST_CHECK_BITWISE_EQUAL does not simply take two memory ranges and compares them bitwise, but requires integers (or types that support bit shifting). I wanted to compare two floats after binary deserialization and wanted to make sure all bits had been placed correctly, before doing value comparison. What I came up with now is a reinterpret_cast to uint8_t* and then using bitwise comparison byte for byte. I would have expected the test framework to do exactly that internally. Is comparing anything besides integers bitwise considered a bad practice or is there another reason for this limitation of BITWISE_EQUAL? If there is a rationale could that be documented at [0], since the documentation currently only speaks of unconstrained "values". thanks, Norbert [0] http://www.boost.org/doc/libs/1_63_0/libs/test/doc/html/boost_test/utf_refe…

2 2

[serialization]: Possible to not escape double quotes
by Forumer 4umer 14 Feb '17

14 Feb '17

Hello, I am using boost serialization to save some parameteres into an xml file but this xml file is parsed through gettext tools to generate translations. The macro used for generations is _("") so my xml should look like this: <ProcedureSchema> <procedures class_id="4" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item> <Name>_("Full procedure")</Name> </item> </procedures> </ProcedureSchema> The problem is boost serialization escapes double quotes with " : <Name>_("Full procedure")</Name> Would it be possible to not escape double quotes ? or at least provide a parameter that allows it ?

2 1

Boost.Log and reinitializing text file backend on I/O errors
by Tero Saarni 13 Feb '17

13 Feb '17

Hi, I'm using text file sink to log into a file on NFS filesystem. I would like to make logging more robust when it comes to unreliability of NFS. I've registered an exception handler to ignore I/O errors, but I don't know how to re-open the log file automatically so that logging would continue when the filesystem is online again. My first try was to remove and reinitialize all sinks when the exception handler is called, but this seems to cause deadlock. Is there a way to simply re-open the associated file which caused the exception? -- Tero

1 0

[accumulator] std::chrono::duration in boost::accumulator
by georg＠schorsch-tech.de 12 Feb '17

12 Feb '17

I want to build a histogram of `std::chrono::high_resolution_clock::duration` object. For this issue i wanted to use boost::accumulators as the framework. As it did not compile in my project i teared it down and based it on a running example with `double` as a data type. My general goal on my project is to do use for everything united types. Time and all measured stuff. I would want to avoid to use `.count()` on the duration. Is there any known workaround around this? it is not dependent on the compiler as it seems. With gcc 6.3 it failes too. It compiles when i use clang++-3.9 --std=c++14 -g -O0 main.cpp But when i set the define USE_CHRONO it failes with the error: clang++-3.9 --std=c++14 -g -O0 -DUSE_CHRONO main.cpp In file included from main.cpp:7: /usr/include/boost/accumulators/statistics/density.hpp:75:15: error: no matching constructor for initialization of 'array_type' (aka 'vector<std::chrono::duration<unsigned long, std::ratio<1, 1000000000> > >') , samples_in_bin(num_bins + 2, 0.) ^ ~~~~~~~~~~~~~~~~ and here is my teared down example. I used this site as a base and exhanged double to data_t. http://programmingexamples.net/wiki/CPP/Boost/Histogram #include <vector> #include <algorithm> #include <iostream> #include <chrono> #include <boost/accumulators/accumulators.hpp> #include <boost/accumulators/statistics/density.hpp> #include <boost/accumulators/statistics/stats.hpp> using namespace boost; using namespace boost::accumulators; using duration_t = std::chrono::high_resolution_clock::duration; #ifdef USE_CHRONO using data_t = duration_t; data_t construct(double d) { return std::chrono::milliseconds(0); } #else using data_t = double; data_t construct(double d) { return d; } #endif using acc = accumulator_set<data_t, features<tag::density> >; using histogram_type = iterator_range<std::vector<std::pair<data_t, data_t> >::iterator >; template <typename T> class data_filler { public: data_filler(){} T operator()() { return rand()/(T)RAND_MAX; } }; template <> class data_filler<duration_t> { public: data_filler(){} duration_t operator()() { return std::chrono::milliseconds(rand()/RAND_MAX); } }; int main(int argc, char** argv) { //create some random data std::vector<data_t> data(100); std::generate(data.begin(), data.end(), data_filler<data_t>()); int c = data.size();//cache size for histogramm. //create an accumulator acc myAccumulator( tag::density::num_bins = 20, tag::density::cache_size = 10); //fill accumulator for (int j = 0; j < c; ++j) { myAccumulator(data[j]); } auto hist = density(myAccumulator); data_t total = construct(0.0); for( int i = 0; i < hist.size(); i++ ) { // std::cout << "Bin lower bound: " << hist[i].first << ", Value: " << hist[i].second << std::endl; total += hist[i].second; } //std::cout << "Total: " << total << std::endl; //should be 1 (and it is) return 0; }

1 0

boost::icl::contains question
by Sanchay Harneja 09 Feb '17

09 Feb '17

Hi, boost::icl::interval_map<int, boost::icl::interval_map<int, boost::icl::interval_set<int>>> larger, smaller; larger.add(make_pair(boost::icl::discrete_interval<int>::closed(102,104), boost::icl::interval_map<int, boost::icl::interval_set<int>>{ make_pair(boost::icl::discrete_interval<int>::closed(0,0), boost::icl::interval_set<int>{boost::icl::discrete_interval<int>::closed(2,4)})})); smaller.add(make_pair(boost::icl::discrete_interval<int>::closed(103,103), boost::icl::interval_map<int, boost::icl::interval_set<int>>{ make_pair(boost::icl::discrete_interval<int>::closed(0,0), boost::icl::interval_set<int>{boost::icl::discrete_interval<int>::closed(3,3)})})); cout << larger << endl; cout << smaller << endl; cout << boost::icl::contains(larger, smaller) << endl; cout << ((smaller & larger) == smaller) << endl; As given above, I'm trying to check if smaller is subset of larger. But I get following output: {([102,104]->{([0,0]->{[2,4]})})} {([103,103]->{([0,0]->{[3,3]})})} 0 1 Any reason why boost::icl::contains(larger, smaller) doesn't work but ((smaller & larger) == smaller) works? Thanks.

1 0

Thread safe full duplex sockets
by Christi258 09 Feb '17

09 Feb '17

This question has been asked many times, but I'm still not satisfied with the answers. I want to use a socket in full duplex: 1. asynchronously: with async_read, async_write (multiple threads running io_service.run()) 2. synchronously: with read and write in two distinct threads I am pretty sure that 1. is thread safe using strands. But I can find no information about 2. Please refere to any official documents of boost. -- View this message in context: http://boost.2283326.n4.nabble.com/Thread-safe-full-duplex-sockets-tp469155… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[serialization] Object reference tracking on instances bug?
by Robert P 07 Feb '17

07 Feb '17

In my serialize function I am exporting a class which is a template wrapper around std:vector. template <typename E> class MyArray { public: vector<E> array; ... template <typename Archive> void MyArray::serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(array); } } When I add unique class instance variables to this array and then serialize it to XML... ... MyArray<Color> colorsArray; Color a; a.name = "one"; colorsArray.add(a); Color b; b.name = "two"; colorsArray.add(b); ... template <typename Archive> void MyColorsObject::serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(colorsArray); } Sometimes the XML comes out using object_id_reference instead of the unique values, and this then gets improperly unserialized with incorrect values, i.e. both colors will have "one" as the name. I was able to disable object tracking and it works now, but I don't think it should be doing object reference tracking on instance variables. Is it because of the template wrapper around vector?

4 4

[gsoc17] Attn: We need 2017 mentors and project ideas for Boost!
by Niall Douglas 07 Feb '17

07 Feb '17

Dear Boost community, We are now a few weeks from the beginning of Google Summer of Code 2017! Last year we had the big surprise of being rejected by Google as an org, the second time ever, on the basis that Google felt we needed a year off. Thanks to the quick actions of the Boost Steering Committee and IMC Financial Markets we managed to put together a "Boost Summer of Code" so the students with projects in progress would not be left stranded. Despite a fair few teething problems, I think that worked out okay. As part of filling in our application for 2017, we must supply to Google a list of potential GSoC mentors and potential GSoC projects for summer 2017 in order to be approved as an organisation this year. Therefore a lengthy page of awesome project ideas at https://svn.boost.org/trac/boost/wiki/SoC2017 before *February 9th* would be an enormous help to getting us approved again this year and bringing to Boost another US$35,000 of Google funding. If you think yourself able to mentor a student doing some work on Boost this summer, *please* consider adding a description of the proposed work item and your name to the list. The year before last we had more slots awarded to us by Google than we had good combinations of student and mentor, so we had to return slots which I believe has not happened here at Boost GSoC in at least a decade. That means that your project ideas have a better chance than ever of receiving funding if you can find a good student, and that is best done by getting project ideas floated *early*. If you want to know more about mentoring a Google Summer of Code funded student work before you nominate yourself, please feel free to ask on the main Boost developers mailing list boost(a)lists.boost.org or via gsoc-admin(a)boost.org. Thank you in advance for your time.

1 1

[MultiIndex] Prevent automatic re-indexing after "modify"?
by Deniz Bahadir 06 Feb '17

06 Feb '17

Hi guys, Hi Joaquín, I have a question concerning the automatic re-indexing of Boost.MultiIndex indexes. Is it somehow possible to modify a member of the element-type that is used as key for (another) index without triggering automatic re-indexing? (Of course, I want to be able to trigger manual re-indexing later.) Or is it at least possible to adjust the code so that this can be achieved? To understand my question, here is my use-case and why I need it. I have a boost::multi_index_container with multiple indexes (one hashed_unique and four hashed_non_unique). I am accessing a range of elements through a hashed_non_unique index 'A'. Then I am iterating through these elements and want to modify the value of a member 'M' of each element. However, that member is used when calculating the key for another hashed_non_unique index 'B'. Therefore, I must use the "modify" function of index 'A'. The problem is now that it takes forever to modify the entire range. (We are talking about 100 thousands if not millions of entries that need to be modified.) Probably because re-indexing is triggered after each call to "modify". However, in my case it should be perfectly fine to postpone the re-indexing after I modified the entire range, because I am not going to access any element through index 'B' until I finished modifying the entire range. As a workaround I removed index 'B' from the container and declared the element-member 'M' as mutable. This allows me to directly change the value of 'M'. The speedup is astonishing. It now finishes almost in no time. But this workaround is not really feasible as it requires reimplementing index 'B' by somehow tracking the information outside of the multi_index_container. Therefore, my question really is: Is it possible to provide an "unsafe_modify" function, which does the same as "modify" but does not trigger automatic re-indexing, and an "refresh_index" function, which (manually) triggers the re-indexing? Thanks, Deniz

3 4