- Boost - lists.preview.boost.org

[gsoc2017] Apply for static_map
by Dobra Gábor 17 Mar '17

17 Mar '17

Hi all, I'm planning to participate to Boost GSOC, about static_map proposal. I'm Gábor Dobra, third-year student of Budapest University of Technology, Hungary, software engineering BSc. I've contributed to a few open-source libraries, I'm working as a C++ developer at a finance company. I'd like to contact a mentor of static_map (possibly Niall Douglas?) about my competency test. Thanks, Gábor

2 1

[gsoc17] Apply for the ticket to Project static_map
by John Lee 17 Mar '17

17 Mar '17

Hello all, I’m John Lee from China, learning at BUPT, Beijing. I love coding, especially in C++. I am willing to contribute to Boost Community and applying for developing cool things with the community in GSOC 2017. As described in the requirement section, I suppose that I am well prepared :-) - I spent my 2016 in learning and practicing my Modern C++ (up to C++ 14, not 17 so far due to the poor support of compilers...) on both coursework and real products. - I’ve been contributing to some projects in C++ open-source communities in China, such as http://purecpp.org/ . - I’ve developed an open-source Header-Only, Strong-Typed, Compile-time Object Relation Mapping (ORM) in Modern C++, available at https://github.com/BOT-Man-JL/ORM-Lite (over-1000-line non-coursework library, first committed 5 months ago and iterated over time) (surprisingly meeting the requirements) lol - I also developed an toy Graphics Library on both Windows and X Window, but no longer maintain it. :-( It’s available at https://github.com/BOT-Man-JL/EggAche-GL/tree/x11 I’m a bit confused on some items on the main page of Boost GSOC 2017, and I will appreciate it very much if anyone could answer these questions: - I am very interested in generic/meta programming and willing to apply for Project static map. My question is should I still post a solution of the competency test of this project? - There are 3 suggested proposals on the main page. Are they the project we should do in GSOC 2017, or we can do other projects if applying for the ticket to a certain project of three? - How could I find a mentor if I have the ticket? Posting something like this or contact one on the email list? It’s my first year to attending GSOC, and the first time to work with the community internationally. Thanks for your help. ;-) Best Regards, John Lee Feel free to contact me :-) https://BOT-Man-JL.github.io/ -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc17-Apply-for-the-ticket-to-Project-s… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

[release} 1.64.0 additional merge required
by Oliver Kowalke 17 Mar '17

17 Mar '17

Unforutnately I got an andditional pull reqeuest taht fixes an segmentation fault on ARM - https://github.com/boostorg/context/pull/47/files Do I get permission to merge to master? ty, Oliver

2 1

Feedback request for Invariant Library idea
by Attila Szenczi 17 Mar '17

17 Mar '17

Hello! I am asking for some feedback if my library idea is good enough to be part of boost if it will meet the requirements. When i started this small utility lib i had 3 goals in my mind: - Write cleaner interfaces - Be safer with pre and post conditions - Eliminate redundant checks whenever possible at compile time The goal is to solve this problem for primitive types. *Example "bad" code:* void set_red_color(int red) { //Why the precondition is not visible on the interface? assert(red >= 0 && red <= 255); } *Example "good" code:* void set_red_color(bounded_i<0, 255> red) {} *Example "bad" code:* void foo(int bar) { assert(bar >= 0); } *Example "good" code:* void foo(positive_i bar) {} or void foo(lower_bounded_i<0> bar) {} Basically the main idea is to have an invariant_host class, which is customizable via policies: -* Invariant policy:* Define a static check() function which ensure the invariant. - *Fail policy: *Define a static trigger_assert function which is called when the invariant policy::check is failed. If the fail policy is disabled (constexpr bool flag), then the checks doesn't happen. Defining your own class looks like this: template<typename PrimitiveType> using my_type = invariant_host<PrimitiveType, default_fail, my_invariant<PrimitiveType>>; *Optimizations:* bounded_i<0, 50> bi (30); //trigger check bounded_i<0, 100> bi2(bi); //range check happens at compile time bounded_i<51, 52> bi3(bi1); //should be compile error bounded_i<0, 50> bi4(integral_constant<int, 10>); //check should happen compile time Things like operator+,-,*,/, bitwise operators etc can trigger checks. Tho alot of times it can be optimized away. For example adding 2 positive number should stay positive. C++20(?) contracts will be great, it will allow us to write cleaner interfaces, but i don't feel like it solve every issue i would like to solve. Do you think it would be a good addition to boost? I appreciate any feedback! Thank you very much! Attila Szenczi

2 4

Advanced find() for associative containers
by Boris Rasin 16 Mar '17

16 Mar '17

I've written an improved version of find() for associative containers (in the form of a free function), and I need your help answering these two questions: 1. Will it be a useful addition to boost? 2. Where exactly should it fit in the boost? Public interface consists of a single free function template: template <typename C> auto find(C& c, const typename C::key_type& key); If element is found, return value evaluates to true and contains iterator to found element. If element is not found, return value evaluates to false and contains hint iterator for insert/emplace. Allowing one to do this: if (auto i = find(container, key)) { i->value_member(); container.erase(i); } And this: if (auto i = !find(container, key)) { container.insert(i, expensive_value_construction()); } The code is here: https://github.com/Boris-Rasin/find I've tested it with the following containers: std::map std::multimap std::unordered_map std::set std::multiset std::unordered_set boost::container::map boost::container::set boost::container::flat_map boost::container::flat_set boost::multi_index::ordered_unique boost::multi_index::ordered_non_unique boost::multi_index::hashed_unique boost::multi_index::hashed_non_unique boost::multi_index::ranked_unique boost::multi_index::ranked_non_unique Thanks for your comments and help.

2 1

Fwd: Google Summer of Code
by Georgios Samaras 16 Mar '17

16 Mar '17

Dear all, my name is Georgios Samaras, a Masters student from NKUA, Greece. I am interested in the distance predicates <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT1.Filteringofcomparedi….> of Boost Geometry, but I am flexible. I am attaching my CV in case anyone is interested. Here is my GitHub <https://github.com/gsamaras>, which demonstrates that I have experience in C++. Good luck with all your projects, Georgios Samaras

2 1

Issue Tracker for Boost organization?
by Olaf van der Spek 16 Mar '17

16 Mar '17

Hi, Do we have an issue tracker for Boost 'organization' itself? I know we've got mailing lists and the steering committee but it's hard to track issues like that. -- Olaf

2 1

[gsoc17] boost.uBLAS
by Leandro Raffo 16 Mar '17

16 Mar '17

Hi My name is Leandro, I'm a CS student at the University of Buenos Aires, and I'm interested in the uBLAS projects. I've already done the competency test and I was wondering who I should talk/send it to and who could be a possible mentor. Thanks

3 2

Libc++ failures on linux
by Tom Kent 16 Mar '17

16 Mar '17

So I tried to add my first linux regression runner using libc++ with clang, and I'm seeing the following error saying it can't find <cstddef>: http://www.boost.org/development/tests/develop/developer/output/teeks99-02-… "clang++-3.9" -c -x c++ -Wno-c99-extensions -std=c++1z -stdlib=libc++ -O0 -g -fno-inline -Wall -g -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_STATIC_LINK=1 -DBOOST_CHRONO_THREAD_DISABLED -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_TEST_NO_AUTO_LINK=1 -DBOOST_TIMER_STATIC_LINK=1 -I".." -o "/var/boost/run/results/boost/bin.v2/libs/accumulators/test/count.test/clang-linux-3.9~c++1z~lc/debug/link-static/count.o" "../libs/accumulators/test/count.cpp" In file included from ../libs/accumulators/test/count.cpp:6: In file included from ../boost/test/unit_test.hpp:18: In file included from ../boost/test/test_tools.hpp:17: In file included from ../boost/config.hpp:44: ../boost/config/select_stdlib_config.hpp:18:12: fatal error: 'cstddef' file not found # include <cstddef> ^ 1 error generated. However when I try to compile the following program on the same docker image (teeks99/boost-build:clang-3.9) // basic.cpp #include <cstddef> int main(int argc, char* argv[]) { size_t three = 3; return three; } with: $ clang++-3.9 -stdlib=libc++ -std=c++1z basic.cpp It works fine $ ./a.out $ echo $? 3 I can build this sample file fine with the whole command line shown above, so it doesn't seem to be one of the other options conflicting. Any thoughts on why boost code wouldn't be able to find this but some basic stuff would? One relevant detail, I'm building with clang 3.9, however the libc++ version that I'm using (ubuntu default) is the one that shipped with clang 3.7. That shouldn't preclude including a file! I also found a couple old threads with the same error, but never any good resolution. http://lists.boost.org/boost-testing/2012/07/7075.php http://lists.boost.org/boost-users/2012/11/76659.php Tom

4 7

Re: [boost] [release] 1.64.0 closed for Beta
by Rene Rivera 15 Mar '17

15 Mar '17

On Tue, Mar 14, 2017 at 9:50 PM, Tom Kent <lists(a)teeks99.com> wrote: > > > On Tue, Mar 14, 2017 at 9:23 PM, Rene Rivera <grafikrobot(a)gmail.com> > wrote: > >> On Tue, Mar 14, 2017 at 6:09 PM, Tom Kent via Boost < >> boost(a)lists.boost.org> wrote: >> >>> >>> I tried building the latest snapshot from bintray, but it doesn't find >>> any >>> compiler when running `bootstrap.bat`. However running `boootstrap.bat >>> vc14.0` works, so something in bootstrap's lookup logic? >>> >> >> Which VSs did you have installed when you tried that? >> > > Everything from VS 2005 to VS2017. > In my Win10 setup I have VS 11, 12, 14, and 14.10.. And it seems to work for me. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

2 1

[release] 1.64.0 closed for Beta
by Rene Rivera 15 Mar '17

15 Mar '17

The master branch is now closed for all changes except by permission for the Beta release. Also, remember to add your libraries' changes to the release notes at: < https://github.com/boostorg/website/blob/master/feed/history/boost_1_64_0.q… > Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

7 17

[config] msvc-14.1 and C++14 constexpr
by John Maddock 13 Mar '17

13 Mar '17

So.... MSVC-14.1 (2017) sort of supports C++14 constexpr. However, it is also prone to internal compiler errors, and currently does not compile config_test.cpp unless we set BOOST_NO_CXX14_CONSTEXPR. Does anyone have a view on which way this macro should be set? Thanks, John. --- This email has been checked for viruses by AVG. http://www.avg.com

4 3

Re: [boost] [gsoc17] Project1: Static map: Can I implement the competency test in g++-7?
by Vic Luo 13 Mar '17

13 Mar '17

Hi, During the implementation of my static_map, I recently encountered a problem: how to deal with string types? For example: constexpr auto cmap_str = make_static_map({ {"abc", 1}, {"bcd", 2} }); static_assert(cmap_str["abc"] == 1, "test"); In my implementation, KeyType requires 1. constexpr operator==, which is not provided by const char * 2. constexpr hash(const KeyType&). Since there is no such thing in standard library, I have to implement some in this project. Currently I would like to use string_view, since it looks like a general solution for compile-time string with lots of constexpr functions, but I don't know which of the following designs looks better: Design A: template<typename KeyType, typename MappedType, typename EqualOp = StaticEqualOp<KeyType>, typename HashOp = StaticHashOp<KeyType>> class static_map; // StaticEqualOp: Specialize StaticEqualOp for those KeyTypes that // can construct string_view and use operator== of string_view, // otherwise we simply use operator== of KeyType // StaticHashOp: size_t operator()(const string_view&, const string_view&) // for types that can construct string_view Design B: We don't specialize any StaticEqualOp for const char*. Instead, make_static_map({{"abc", 1}}) returns static_map<string_view, int> instead of static_map<const char *, int>. Which one is better? Or is there any more feasible design? Thanks, -- --------------------------------- Vic Luo Shanghai Jiaotong University Key fingerprint 0x98809ca08bf5662a

3 6

[safe_numerics] The review is finished
by Andrzej Krzemienski 13 Mar '17

13 Mar '17

Hi Everyone, The review of safe_numerics library by Robert Ramey is now finished. Thanks to all participants for submitting their reviews, and sharing their insights. I will announce the result in the next couple of days. -- Andrzej Krzemienski, review manager

1 0

[gsoc17] Project Static map : Clarifications and Competency test
by Pasindu Kanchana 13 Mar '17

13 Mar '17

Hi I am Pasindu Kanchana from Sri Lanka, studying at the University of Moratuwa as a final year undergraduate(4th year).I have worked as a developer intern for past 6 months for an exchange related company focusing c++ and have used boost memory mapped_file , tokenizer and filesystem. It would be really helpful if i get answers for the following 3 questions. A)Although the requested key is not in range ,still the code should compile?(without any error throwing and halting compilation) B)The solution to the problem should prove that compile time initiation of the map is confirmed(constexpr should definitely compile at the compile time not remain to the run time).would it be enough to practically proving this for different compilers under c++14 to approve as a solution? C)Should I take the competency test? Thank you.

2 1

[outcome] Seeking review manager for Boost.Outcome
by Niall Douglas 13 Mar '17

13 Mar '17

It's only taken a month of work and writing my own C preprocessor, but I finally have a usable set of API reference docs for Outcome at https://ned14.github.io/boost.outcome/. Apart from a few docs glitches caused by the old version of doxygen on Travis, I'd say Outcome is ready for review. Would anybody be interested in review managing Outcome? Thanks, Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 0

[safe_numerics] Review
by Barrett Adair 12 Mar '17

12 Mar '17

Last minute review here. This will be short and sweet. > What is your evaluation of the design? I like it. The "drop-in replacement" approach is easy to understand. > What is your evaluation of the implementation? It's more complicated than I expected, but if it works, it works. I think the runtime checks in this library might be good candidates for BOOST_[UN]LIKELY. Are there test cases for post decrement? The implementation appears to return a reference to local: https://github.com/robertramey/safe_numerics/blob/master/include/safe_base.… safe_base & operator--(int){ // post decrement safe_base old_t = *this; --(*this); return old_t; } If I'm reading correctly, this is UB (and likely a segfault). > What is your evaluation of the documentation? The documentation is quite thorough. A "cheatsheet" page would be nice, because most of the documentation is rather in-depth. There are many bells and whistles documented that end users might not want to sift through. I'm not sure what this would look like, though. The FAQ appears to be formatted strangely. Notes about bitwise operators in the FAQ might be nice (signed right-shift especially). Very nice job overall. Much work and thought went into this. > What is your evaluation of the potential usefulness of the library? Useful. I'd consider using it in applications that are not latency-sensitive, perhaps if only in debug mode. Detecting accidental unsigned underflow is especially useful. I do think this library might be much more useful with floating point support, if it is eventually added. > Did you try to use the library? With what compiler? Did you have any problems? No. > How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 3 hours reading documentation, source code, and previous reviews. > Are you knowledgeable about the problem domain? No more than any CS grad should be. > Do you think the library should be accepted as a Boost library? Yes. This library would be a good addition to Boost. I trust that Robert will address the issues raised in this review and others (especially Steven's) before this library would be shipped with a future Boost release, should it be accepted.

3 3

[container] moving a pre-built vector into a flat_set
by Sam Kellett 12 Mar '17

12 Mar '17

a common problem i encounter is that i have two stage's w/r/t to a large collection of data: building and querying. vector is obviously the king of building. flat_set is the king of querying. so what i often tend to do is build up a very large vector, sort it then create a flat_set using the flat_set(ordered_unique_t) constructor. however this still copies the entire vector into the flat_set, right? what i would like to be able to do is move the vector straight into the flat_set, something like: std::vector<T> data; flat_set data_set1(std::move(data)) // move vector in and sort it // or: std::sort(data.begin(), data.end()); // sort vector flat_set data_set2(ordered_unique_t, std::move(data)) // and move it in is this doable (am i just being blind?) or is there plans/interest for this?

8 19

[safe_numerics] review
by John McFarlane 12 Mar '17

12 Mar '17

I'm reviewing this library as someone who has tried to use it in the past, has made minor contributions to it and has a vested interest in improving numeric support for C++ developers. However, I have very little knowledge of the code and relatively little experience of Boost and the Boost community. I hope my comments are helpful nevertheless. tl;dr: make `safe<>` more like the type I describe in [ http://wg21.link/p0554#componentization-safety] or at least ensure that the API can evolve toward this without backward-breaking changes. ---- I do feel that a safe integer type should be available to as many people as possible and Robert's approach is on the right track. But given the choice, I would make some significant API changes. Any of these which can be added incrementally should not delay acceptance of safe_numerics into Boost. The goal of making `safe<int>` a drop-in replacement for int is essential. But further, `safe<Rep>` should be a drop-in replacement for `Rep` where `Rep` is any integer type which exhibits "surprising" results, e.g. through UB of overflow / divide-by-zero or indeterminate initial value. `Rep` should not just be any type for which `std::is_integral_v<Rep>` is true and ideally, `safe<safe<Rep>>`, while pointless, should compile and function like `safe<Rep>`. Unfortunately, `safe<int>` fails to be a drop-in replacement for fundamental integer types for a number of reasons. Firstly, conversion from floating-point types is not fully supported [ https://github.com/robertramey/safe_numerics/issues/13] This alludes to a wider issue with the API of this library: it tries to do too much. Conversion from integers to real numbers is not so much *unsafe* as *lossy*. Users intuitively understand that `int n = 0.5;` will not define a variable with value 0.5 and this is often exactly what they intend, e.g.: void sample(map<safe<int>, safe<int>>& histogram, double v) { ++ histogram[v]; } If implicit conversions to and from other numeric types is not supported, this prevents potential users from converting existing programs. Bear in mind that implicit conversions do not prevent `safe<>` from catching run-time errors. And if one wishes to catch risky narrowing conversions, they already have tools to do this, e.g. GCC's `-Wconversion`. In short, it's a separate concern. Another example of overreach of the API is in governing the results of arithmetic operations. Via policy choice, `safe<int>` can produce auto-widening functionality, e.g. returning a 16-bit result from a multiply operation with 8-bit operands. This behavior belongs in a whole different class. It achieves overlapping safety wins but it complicates the interface. I believe that the correct approach is to produce a type which is dedicated to performing run-time overflow checks and another type which performs automatic widening and to combine them, e.g.: // simplified for clarity, see: wg21.link/p0554#composition-safe_elastic_integer template<typename Rep> class auto_widening_integer; template<typename Rep> class safe_integer; template<typename Rep> using extra_safe_integer = safe_integer<auto_widening_integer<Rep>>; Of the two component classes, `auto_widening_integer` can be used to perform limited overflow-avoidance with zero run-time overhead. (The penalty is that if, say, you multiply two 32-bit integers together, you get back a 64-bit result.) Meanwhile, `safe_integer` provides iron-clad run-time safety checking and obeys the promotion rules of its `Rep` type. The combination of them reduces the number of run-time checks by reducing the chance of overflow. This solution is more complex, but the individual components are simpler and self-sufficient. Unfortunately, due to these kinds of design choices, I have not spent more time attempting to integrate Robert's library with my own. I would dearly like to include `safe<>` as part of a wider set of numeric components which users can then combine to their hearts content. Details of how I think that might come about can be found in (shamelessly plugged) paper, [wg21.link/p0554]. I accept that's a tall order. At the very least I would like developers of substantial projects to be able to replace build-in integers with the following: #if defined(NDEBUG) template<typename Rep> using Integer = Rep; #else template<typename Rep> using Integer = safe<Rep>; #endif Hope that helps, John

4 12

HELP Needed
by Poulomi Hore 11 Mar '17

11 Mar '17

Hi, I would like to work on project 1 under Boost.Geometry for GSoc 2017. Can you please suggest as to where should i start from ? Thank you. Regards, Poulomi Hore

2 1

[safe_numerics] One more review
by Antony Polukhin 11 Mar '17

11 Mar '17

- What is your evaluation of the design? Looks good, simple to use. I'd like to see an additional statefull ExceptionPolicy that remembers that an UB was triggered, but does not throw at all. Here's how it could be used: bool try_do_something(int& out) noexcept { using namespace boost::numeric; safe<int, native, lazy> x = INT_MAX; // remembers that error was triggered ++x; // ... other operations on `x` // ... if (!x.no_errors()) { // One of the operations triggered UB return false; } out = x; return true; } - What is your evaluation of the implementation? Checked a few border cases that I'm aware of. All of them were taken care of in the library. Nitpicks: Missing BOOST_NORETURN in multiple places, for example https://github.com/robertramey/safe_numerics/blob/master/include/exception_… . Adding that attribute may result in better code generation and in warnings suppression. std::is_literal_type type trait is deprecated since C++17 https://github.com/robertramey/safe_numerics/blob/master/include/interval.h… More generic streaming operators could be profitable (better to use basic_ostream<Char, Trait> instead of ostream) https://github.com/robertramey/safe_numerics/blob/master/include/interval.h… Many operations may be decorated with noexcept This macro seems broken https://github.com/robertramey/safe_numerics/blob/master/include/safe_liter… . Also looks like this class is not covered well with tests, because line https://github.com/robertramey/safe_numerics/blob/master/include/safe_liter… shall not compile There's a bunch of implicit conversions in the library https://github.com/robertramey/safe_numerics/blob/master/include/safe_base.… (BTW, have not found a body of this one). Would it be better to make them explicit? Those headers are very heavy https://github.com/robertramey/safe_numerics/blob/7ee656ecdf23f6f29f9333176… Try using <iosfwd> and making all the function below to use `basic_ostream<Char, Trait>&`. No need to define those in `namespace std` https://github.com/robertramey/safe_numerics/blob/7ee656ecdf23f6f29f9333176… . Defining those in `boost::numeric` namespace works fine (thanks to ADL!). I'd really like to see tests coverage for the library. This is pretty simple to add, just follow the instructions from here: https://svn.boost.org/trac/boost/wiki/TravisCoverals - What is your evaluation of the documentation? Good, very interesting examples. - What is your evaluation of the potential usefulness of the library? Useful. I was dealing with such problems in Boost.LexicalCast. - Did you try to use the library? With what compiler? Did you have any problems? Have not tried. - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? About two hours of reading source code and docs. - Are you knowledgeable about the problem domain? A little bit, not an expert. - Do you think the library should be accepted as a Boost library? Yes, the library should be accepted. -- Best regards, Antony Polukhin

5 10

[safe_numerics] Formal review starts today
by Andrzej Krzemienski 11 Mar '17

11 Mar '17

Hi Everyone, Today, on March 2nd (or tomorrow, depending on your timezone), is the start of the formal review of safe_numerics library by Robert Ramey. The review will run till March 11th. I will be serving as review manager. safe_numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey/safe_numerics/ master/doc/html/index.html Formal Review comments can be posted publicly on the mailing list or Boost Library Incubator <http://blincubator.com>, or sent privately to the review manager, that is myself. Here are some questions you might want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And most importantly: Do you think the library should be accepted as a Boost library? For more information about Boost Formal Review Process, see: http://www.boost.org/community/reviews.html Your review is needed! Regards, Andrzej Krzemieński, review manager.

5 19

[safe_numerics] Last three days
by Andrzej Krzemienski 11 Mar '17

11 Mar '17

Hi Everyone, We have three last days remaining for safe_numerics review (till March 11th). If you like working under time pressure, this is the perfect moment for doing your review. If you would like to submit your review, but feel you will not make it till March 11th, let me know, we can try to extend the review period. Currently, I recorder three reviews with a yes/no call, from Paul A. Bristow and Steven Watanabe, and one without a yes/no call from Vicente J. Botet Escriba. If you have submitted a review, but were not mentioned in my list, please let me know: it means I must have missed it. ----- safe_numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey /safe_numerics/master/doc/html/index.html Formal Review comments can be posted publicly on the mailing list or Boost Library Incubator <http://blincubator.com>, or sent privately to the review manager, that is myself. Here are some questions you might want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And most importantly: Do you think the library should be accepted as a Boost library? For more information about Boost Formal Review Process, see: http://www.boost.org/community/reviews.html Regards, &rzej;

7 17

how can I use ipv6 on boost::asio
by Kazuaki Okimoto 11 Mar '17

11 Mar '17

Hi I can connect through IPV4 when I open the socket by following method. _socket->open(boost::asio::ip::tcp::v4()); But , it can't use IPV6 network. I'd like to use my app on IPV6 network. How can I use IPV6 on boost:asio ? Dies anyone tell me the method of it ? best regards

2 1

IPC: compiler optimization related issues
by Robert 11 Mar '17

11 Mar '17

Hi! Before creating a bug in trac, would you accept issues related to compiler optimization (-O2 and -O3) flags? I have a very specific issue with an inter-process mutex (race condition), but it can be reproduced only when flag O2 or higher is being used during compilation. Thank you!

2 2

To contribute in Static map (boost::static_map<Key, T, ConstExprHash = boost::constexpr_hash<Key>, Pred = boost::constexpr_equal_to<Key>>)
by SUSHIL KHANCHI 11 Mar '17

11 Mar '17

Hello, I am an engineering student in Computer Science from SMVDU(India). I would like to contribute to your STATIC MAP project and take part in Gsoc.For getting familiar to your work, I would like to get my hands on your projects issues. Can you please guide me to your project where I can start with fixing small bugs.

1 0

[Endian] Reading/writing from/to byte buffers
by Olaf van der Spek 10 Mar '17

10 Mar '17

Hi, One often needs to read or write values from/to a buffer while having a pointer. Could you support this? I guess one could use *reinterpret_cast<big_int64_buf_t&>(*p) but I think functions would be more convenient. On second guess one probably has to use memcpy rather then reinterpret_cast. The functions are probably implemented already but aren't exposed. https://github.com/boostorg/endian/issues/17 -- Olaf

2 3

Fw: Build failed: smart_ptr 1.0.81-develop
by Peter Dimov 10 Mar '17

10 Mar '17

AppVeyor says that bootstrap.bat is broken: bootstrap Building Boost.Build engine ****** B A T C H R E C U R S I O N exceeds STACK limits ****** Recursion Count=509, Stack Usage=90 percent ****** B A T C H PROCESSING IS A B O R T E D ****** Command exited with code 255 -----Original Message----- From: AppVeyor Sent: Friday, March 10, 2017 17:22 To: pdimov(a)pdimov.com Subject: Build failed: smart_ptr 1.0.81-develop Build smart_ptr 1.0.81-develop failed Commit fac6fbe3cf by Glen Fernandes on 3/10/2017 3:21 PM: Update documentation in make_shared_array.html Configure your notification preferences

1 0

[regression dashboard] missing tests
by Raffi Enficiaud 10 Mar '17

10 Mar '17

Hi all, The regression dashboard is truncated, I should see many more tests here: http://www.boost.org/development/tests/develop/developer/test.html at least as many as for the master branch: http://www.boost.org/development/tests/master/developer/test.html Any idea? Raffi

1 0

[stacktrace] review
by Artyom Beilis 10 Mar '17

10 Mar '17

Hello, This is my review of stacktrace library: Note that I have experience with the subject as I developed a similar library for the CppCMS framework [1] > - What is your evaluation of the design? > The design is straight forward and I don't see any major issues with the API. Also I have several suggestions in handling backtrace with catch from } catch (const traced& e) { std::cerr << e.what() << '\n'; if (e.trace) { std::cerr << "Backtrace:\n" << e.trace << '\n'; } } catch (const std::exception& e) { std::cerr << e.what() << '\n'; } In my library I use much simpler approach in terms of API [2] catch(std::exception const &e) { std::cerr << e.what() << std::endl; std::cerr << booster::trace(e); } Where booster::trace is a manipulator that prints strack trace if "e" contains backtrace information - much shorted code without additional catch. I find it very easy to use. Just a suggestion. I also like with_trace templated class idea. > - What is your evaluation of the implementation? Most of my > personal concerns with this library are with the implementation and I > would hugely appreciate feedback from others with substantial > experience of using stacktracing "in anger" in non-trivial use case > scenarios. I mostly reviewed the backend. Linux: ========= 1st of all: I recommend mentioning in the documentation the option -rdynamic/-export-dynamic as otherwise dladdr would likely to fail - it is critical as many may miss one. Regarding use of add2line utility: 1. Failing to calling an external program in case of dladdr fails is bad idea. This behaviour is unexpected by the user. I understand the advantage of this as you can use debug information but should be done only per user specific request (i.e. compilation option) and not by default. 2. If you call add2line - use it for ALL addresses in backtrace at once and not for each single one! My recommendation is to provide alternative backed that uses other way to extract information not involving forking. Maybe try to analyze debug data or so - or require preparing initial map using nm tool and than loading it from file or something like that. Additionally calling the backed linux is bad - as same approach with slight modifications works on *BSD, Mac OS X and Solaris (RIP). Windows: ======== I have a question why you used COM instead of SymFromAddr functions? I understand thread safety issues but simple mutex can solve them. My concerns are regarding MinGW compilers. Have you tested it on MinGW compiler? It wouldn't work as it used MSVC debug information in general so maybe it is good idea to provide an alternative backend that extracts only address and DLL name so you can analyse the stacktrace later (using addr2line utility for example) Take a look on my code [1] regarding non-msvc windows compilers - it provides at least some useful information. > - What is your evaluation of the documentation? The documentation is ok in general and straight forward as the library itself. What I do lack is the documentation of underlying backends - how do they work. 1. use of -rdynamic/-export-dynamic should be noted in "bold face" regarding the use of the library. 2. please do not call it "POSIX backend" - as there none of the stuff you use is actually POSIX... Also you'll probably need different backends for MINGW and mention it. > - What is your evaluation of the potential usefulness of the > library? Very Very useful. > - Did you try to use the library? With what compiler? Did you have any problems? No I didn't - I mostly read the documentation and the backend code. > - How much effort did you put into your evaluation? A glance? A > quick reading? In-depth study? 3-4 hours > - Are you knowledgeable about the problem domain? Yes I am. I have written similar library for CppCMS project [1] - FINAL VOTE: Yes, Conditionally Conditions: Use of addr2line must not be enabled by default. [1] https://sourceforge.net/p/cppcms/code/HEAD/tree/framework/trunk/booster/boo… https://sourceforge.net/p/cppcms/code/HEAD/tree/framework/trunk/booster/lib… [2] https://sourceforge.net/p/cppcms/code/HEAD/tree/framework/trunk/booster/boo… Best Regards, Artyom Beilis

4 5

boost::asio::ssl::stream handshake hang up in reconnection
by jupiter 09 Mar '17

09 Mar '17

Hi, I am running boost socket communication on Debian 8, the following client code works fine when it connected to the server the first time. s.lowest_layer().connect(*endpoint_iterator++, error); s.handshake(boost::asio::ssl::stream_base::client, error); But when the server connection lost, the client would try to run above code repeatedly until the server connection was resumed, the it passed the first line of s.lowest_layer().connect without error, but the it stuck at s.handshake(boost::asio::ssl::stream_base::client, error), the handshake hang up. What I could be missing here? Thank you.

1 0

[preprocessing] Feedback requested on a C99 preprocessor written in pure universal Python
by Niall Douglas 09 Mar '17

09 Mar '17

Those of you who watch reddit/r/cpp will know I've been working for the past month on a pure Python implementation of a C99 conforming preprocessor. I am pleased to be able to ask for Boost feedback on a fairly high quality implementation: https://github.com/ned14/pcpp It passes the C11 standard's list of "tricky" preprocessor expansions and the mcpp test suite. It has no issue correctly handling the preprocessor metaprogramming I've thrown at it from my Boost libraries. I'm not going to claim it can handle Boost.Preprocessor or especially Boost.VMD and I've tried neither, but pull requests with source code fixes adding support for those (with accompanying unit tests) would be welcome. My main use case for writing this is to assemble my header only Boost libraries into a single "drop in and go" file. To that end it has a (still buggy) --passthru mode which passes through #define and #undef plus any #if logic which uses an undefined macro. I'm still working on pass through mode so expect showstopper bugs in that configuration, but as a straight highly standards conforming preprocessor it's ready for others to use and I welcome any feedback. There are a multitude of use cases, everything from running as a conforming preprocessor before invoking MSVC to compile right through to parsing, reflection and introspection of source code. (and yes it is also a Python library as well as a command line tool, you can find API reference docs at https://ned14.github.io/pcpp/) I look forward to any feedback and my thanks in advance for it. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

7 21

[regression runner] Preference libstdc++ vs. libc++
by Tom Kent 09 Mar '17

09 Mar '17

I have a bunch of linux regression runners that are executing clang runs of the boost regression suite (clang 3.0 - 4.0), currently these are all using the default, GCC libstdc++. Is there an interest from developers to see these runs with libc++? The basic options: 1) Convert all compatible clang builds to libc++, don't mess with libstdc++ & clang. 2) Duplicate all the clang builds to build each version with both (acknowledging that will add nearly 1/3 to the already large ~125 linux runs). 3) Change most of the runs, but keep a few token libstdc++ & clang runs, with the latest compiler version (what c++ standard c++14? c++1z?). 4) Just add a few token libc++ runs, with the latest compiler version (what c++ standard c++14? c++1z?). 5) Don't add libc++. For background (you can respond to one of the above preferences without reading on), there are two machines constantly running linux builds (in addition to the two windows ones) that I manage. One I consider the "full" suite of compilers. It runs clang 3.0 - 4.0 and gcc 4.4 - 6. For the oldest and latest releas (gcc 4.4, gcc 6, clang 3.0, clang 3.9), I run all the supported standard configs I could find (c++98, c++0x, gnu98, gnu0x -- c++03, c++11, c++14, c++1z and their gnu equivalents). I also do runs with optimization and warnings cranked, against the latest standard config e.g. "-std=c++1z -O2". For all the compiler versions that aren't on the endcaps, I just run a single config with whatever was the latest standard config for that compiler (e.g. gcc-4.8 with c++1y). This is all repeated for develop and master for a total of about 100 different configurations. The machine I consider the "fast results" machine is configured with only four runs, one each for the latest release of gcc and clang with the latest supported standard config (currently gcc-6 1z and clang-3.9 1z), for both master and develop. The goal here is that for any change checked in, the author will have feedback on its success against something modern and relevant within just a few hours. As a backup to the "fast results" machine, I also run those four regression modern runs, interspersed with the rest of the configs every dozen or so runs, bringing the total number of runs on the "full" machine up to around 125, which takes about a week for the machine to get through all the configurations. You can see more details about all of this on the github page where I keep my regression build scripts: https://github.com/teeks99/boost-build/tree/master/Regression The actual confgs run by the "full": https://github.com/teeks99/boost-build/blob/master/ Regression/teeks99-02/machine_vars.json The docker builds for all these machine configurations are kept at: https://github.com/teeks99/boost-build/tree/master/Docker And can be pulled from the docker hub with e.g. `docker pull teeks99/boost-build:clang-3.9` If you've read this far, I'd be happy for any other opinions from developers who use the test matrix. Is it worth keeping all those compilers in the middle? Do we need to test the latest compilers with all the different standard configs (03, 11, 14, 1z + gnu equivalents)? Thanks, Tom

12 27

[safe numerics] comment
by Robert Ramey 09 Mar '17

09 Mar '17

I'm re-posting Vicente's message which apparently got lost in a server issue so we can respond to it. Robert Ramey Hi, let me start with some comments and questions. I was wondering if the requirements of Numeric don't need some kind of conversions between other numeric types. https://htmlpreview.github.io/?https://raw.githubusercontent.com/robertrame… T(u) T{u} How can you implement the conversion from safe<U> to T if you can not convert from U to T? We have implicit conversion from T to Safe and from Safe to T template<class T> constexpr /*explicit*/ safe_base(const T & t); template< class R, typename std::enable_if< !boost::numeric::is_safe<R>::value, int >::type = 0 > constexpr operator R () const; constexpr operator Stored () const; I believed that the conversion from Safe to T needed to be explicit. Having implicit conversion in both directions is suspect. Why the explicit conversion between safe<T> and safe<U> are not allowed when T and U are not the same? IMO, safe_base<T> is either not trivial default constructible and we check the validity of 0, if we don't check it, we should declare it =default. The current definition doesn't adds nothing and makes the type a non-POD and non trivial_default_constructible, which forbids its use on binary messages. constexpr explicit safe_base() { // this permits creating of invalid instances. This is inline // with C++ built-in but violates the premises of the whole library // choice are: // do nothing - violates premise of he library that all safe objects // are valid // initialize to valid value - violates C++ behavior of types. // add "initialized" flag. Preserves fixes the above, but doubles // "overhead" // still pending on this. } I'll suggest to use constexpr safe_base() = default; BTW, why the default constructor is declared explicit? As you say, could we talk of safe<short> when we can have one uninitialized? I believe this needs to appear clearly on the documentation if not already in. Has safe<const T> a sense? Integer<T> are not traits as there is a compiler error when T is not an integer :( template <class T> class Integer : public Numeric<T> { // integer types must have the corresponding numeric trait. static_assert( std::numeric_limits<T>::is_integer, "Fails to fulfill requirements for an integer type" ); }; The same for Numeric. Have you considered to define traits (usable with SFINAE)? I don't see a concept SafeNumeric. Have you considerd it? BTW, these concept classes check only for a single requirement. Shouldn't you specialize numeric_limits lowest()? Have you considered to define basic algorithms managing with the valid conversion between Numeric with the different policies, as Lawrence Crowl is proposing for the standard? http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0103r1.html http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0105r1.html I find weird the way you are including the files #include "concept/integer.hpp" #include "concept/exception_policy.hpp" #include "concept/promotion_policy.hpp" #include "safe_common.hpp" #include "exception_policies.hpp" #include "boost/concept/assert.hpp" I believed we used to inlcude boost files using <> and the absolute path. Is this a good practice? Does it allows the compiler to perform better? Best, Vicente

2 5

Regarding Mentor
by Shaunak Dixit 08 Mar '17

08 Mar '17

Hi I have joined the Boost Developer's mailing list please help me how to find a mentor. thanks you

3 4

[gsoc17] Project1: Static map: Can I implement the competency test in g++-7?
by Vic Luo 07 Mar '17

07 Mar '17

Hi, I'm Zheng Luo, a third-year undergraduate from Shanghai Jiaotong University who have special interest in C++ programming(especially for templates). This is my second year of applying Google Summer of Code and I'm willing to contribute to Static Map project mentioned on SoC2017 page. Previously I worked for a company as a C++ intern for months on Chromium-related projects where I gained some experience about C++ in industry. And my question is, am I allowed to implement the competency test of static_map in g++-7? I have just implemented my own version of static_map which supports the following operations: constexpr StaticMap<int, const char *, 3> m(make_pair(2, "abc"), make_pair(4, "def"), make_pair(6, "ghi")); if (!m[4]) abort(); const char *foo = m[2]; return 0; which is compiled into assembly as: main: xorl %eax, %eax ret under g++-7 with -std=c++1z -O3 So I was wondering did I pass the test? Thanks, -- --------------------------------- Vic Luo Shanghai Jiaotong University Key fingerprint 0x98809ca08bf5662a

3 4

[gsoc17]Getting started with Project 2 in Boost.Geometry:R-tree serialization
by Ruoyun Jing 07 Mar '17

07 Mar '17

Hi Everyone: My name is Ruoyun Jing, I am an undergraduate student in Northwest University(China) of Software Engineering.Although i am a girl,i really love coding and algorithms!!! I've coded many algorithms problems with C++ and Python,and got Bronze Metal in ACMICPC Asia Shenyang Regional contest. GSoC is really a precious chance for me to get in touch with open source software. After reading all the organizations and their projects, I'm pretty interested in R-tree serialization in Boost.Geometry. Despite my lack of project experience,i will try my best to learn ,code and communicate with mentor!!! Looking forward from you.:) Thank. -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

3 10

[gsoc17] Regarding projects 1 & 3 of Boost.Geometry
by Vissarion Fisikopoulos 07 Mar '17

07 Mar '17

Hello, I proposed to mentor projects 1 & 3 of Boost.Geometry. As in Boost GSoC webpage you may choose to either provide links to existing library you developed or take a competency test. For the latter the test is the same for both projects 1 & 3, you can find it in https://svn.boost.org/trac/boost/wiki/SoC2017#Programmingcompetencytest2 Best, Vissarion ps. sorry for cross-posting, my previous reply inherited a weird subject title that most probably made it difficult to discover in most email clients > Date: Thu, 2 Mar 2017 15:41:39 +0530 > From: Shaunak Dixit <sdixit_be15(a)thapar.edu> > To: boost(a)lists.boost.org > Subject: Re: [boost] Regarding Mentor > Message-ID: > <CAAEsT1nYLwdmDnV5GNHuGAQH3DCejxx__AAtq+gak5EhKH1U3A(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > I would like to work on boost.geometry. > For given projects > > *PROJECT 1. Filtering of compare distance predicates.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT1.Filteringofcomparedi….> > > *PROJECT 3. Nearly antipodal points distance accuracy improvement.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT3.Nearlyantipodalpoint….> > > Please help me out how to start and in finding mentors for the above > projects. > > Thanks a lot > On 2 Mar 2017 15:18, "Shaunak Dixit" <sdixit_be15(a)thapar.edu> wrote: > >> Thanks a lot >> But I would like to work on geometry >> >> Thank you >> On 2 Mar 2017 14:49, "David Bellot via Boost" <boost(a)lists.boost.org> >> wrote: >> >>> you can find project with mentors and their email address on >>> https://svn.boost.org/trac/boost/wiki/SoC2017 >>> >>> I proposed to mentor for Boost.uBLAS (numerical computations). If you're >>> interested, please contact me. >>> >>> Cheers, >>> David >>> >>> On Wed, Mar 1, 2017 at 8:08 PM, Shaunak Dixit via Boost < >>> boost(a)lists.boost.org> wrote: >>> >>> > Hi I have joined the Boost Developer's mailing list >>> > please help me how to find a mentor. >>> > >>> > >>> > >>> > >>> > thanks you >>> > >>> > _______________________________________________ >>> > Unsubscribe & other changes: http://lists.boost.org/ >>> > mailman/listinfo.cgi/boost >>> > >>> >>> _______________________________________________ >>> Unsubscribe & other changes: http://lists.boost.org/mailman >>> /listinfo.cgi/boost >>>

1 0

Re: [boost] Boost Digest, Vol 5363, Issue 1
by Vissarion Fisikopoulos 06 Mar '17

06 Mar '17

Hello, I proposed to mentor projects 1 & 3 of Boost.Geometry. As in Boost GSoC webpage you may choose to either provide links to existing library you developed or take a competency test. For the latter the test is the same for both projects 1 & 3, you can find it in https://svn.boost.org/trac/boost/wiki/SoC2017#Programmingcompetencytest2 Best, Vissarion > Date: Thu, 2 Mar 2017 15:41:39 +0530 > From: Shaunak Dixit <sdixit_be15(a)thapar.edu> > To: boost(a)lists.boost.org > Subject: Re: [boost] Regarding Mentor > Message-ID: > <CAAEsT1nYLwdmDnV5GNHuGAQH3DCejxx__AAtq+gak5EhKH1U3A(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > I would like to work on boost.geometry. > For given projects > > *PROJECT 1. Filtering of compare distance predicates.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT1.Filteringofcomparedi….> > > *PROJECT 3. Nearly antipodal points distance accuracy improvement.* > <https://svn.boost.org/trac/boost/wiki/SoC2017#PROJECT3.Nearlyantipodalpoint….> > > Please help me out how to start and in finding mentors for the above > projects. > > Thanks a lot > On 2 Mar 2017 15:18, "Shaunak Dixit" <sdixit_be15(a)thapar.edu> wrote: > >> Thanks a lot >> But I would like to work on geometry >> >> Thank you >> On 2 Mar 2017 14:49, "David Bellot via Boost" <boost(a)lists.boost.org> >> wrote: >> >>> you can find project with mentors and their email address on >>> https://svn.boost.org/trac/boost/wiki/SoC2017 >>> >>> I proposed to mentor for Boost.uBLAS (numerical computations). If you're >>> interested, please contact me. >>> >>> Cheers, >>> David >>> >>> On Wed, Mar 1, 2017 at 8:08 PM, Shaunak Dixit via Boost < >>> boost(a)lists.boost.org> wrote: >>> >>> > Hi I have joined the Boost Developer's mailing list >>> > please help me how to find a mentor. >>> > >>> > >>> > >>> > >>> > thanks you >>> > >>> > _______________________________________________ >>> > Unsubscribe & other changes: http://lists.boost.org/ >>> > mailman/listinfo.cgi/boost >>> > >>> >>> _______________________________________________ >>> Unsubscribe & other changes: http://lists.boost.org/mailman >>> /listinfo.cgi/boost >>>

1 0

[trac] SSL certificate revoked?
by Andrey Semashev 06 Mar '17

06 Mar '17

Hi, I'm getting an error while trying to open an existing Trac ticket: https://svn.boost.org/trac/boost/ticket/11798 Secure Connection Failed An error occurred during a connection to svn.boost.org. Peer’s Certificate has been revoked. Error code: SEC_ERROR_REVOKED_CERTIFICATE Is this a known problem? Firefox 51.0.1.

2 3

Re: [boost] [builds] broken
by Tom Kent 06 Mar '17

06 Mar '17

On Sun, Mar 5, 2017 at 11:43 AM, Rene Rivera <grafikrobot(a)gmail.com> wrote: > > On Sun, Mar 5, 2017 at 11:34 AM, Tom Kent <lists(a)teeks99.com> wrote: > >> >> On Sun, Mar 5, 2017 at 9:03 AM, Rene Rivera <grafikrobot(a)gmail.com> >> wrote: >> >>> On Sun, Mar 5, 2017 at 6:49 AM, Tom Kent via Boost < >>> boost(a)lists.boost.org> wrote: >>> >>>> On Thu, Mar 2, 2017 at 9:59 PM, Rene Rivera via Boost < >>>> boost(a)lists.boost.org >>>> > wrote: >>>> >>>> > On Thu, Mar 2, 2017 at 9:52 AM, Raffi Enficiaud via Boost < >>>> > boost(a)lists.boost.org> wrote: >>>> > >>>> > > Le 02/03/2017 à 16:25, Rene Rivera via Boost a écrit : >>>> > > >>>> > >> On Thu, Mar 2, 2017 at 9:22 AM, Raffi Enficiaud via Boost < >>>> > >> boost(a)lists.boost.org> wrote: >>>> > >> >>>> > >> Le 02/03/2017 à 16:20, Rene Rivera via Boost a écrit : >>>> > >>> >>>> > >>> On Wed, Mar 1, 2017 at 5:23 PM, Raffi Enficiaud via Boost < >>>> > >>>> boost(a)lists.boost.org> wrote: >>>> > >>>> >>>> > >>>> Hi all, >>>> > >>>> >>>> > >>>>> >>>> > >>>>> On develop, I have the following error for gcc/linux and >>>> clang/osx: >>>> > >>>>> >>>> > >>>>> 01-Mar-2017 23:58:05 libs/python/build/Jamfile:155: in >>>> > >>>>> lib_boost_numpy >>>> > >>>>> 01-Mar-2017 23:58:05 *** argument error >>>> > >>>>> 01-Mar-2017 23:58:05 * rule lib ( names + : sources * : >>>> > >>>>> requirements * >>>> > >>>>> : default-build * : usage-requirements * ) >>>> > >>>>> 01-Mar-2017 23:58:05 * called with: ( : numpy/dtype.cpp >>>> > >>>>> numpy/matrix.cpp >>>> > >>>>> >>>> > >>>>> >>>> > >>>> >>>> > >>>> How are you configuring python in your user-config.jam? >>>> > >>>> >>>> > >>>> >>>> > >>> I am not touching anything about user-config.jam: the failure >>>> happens >>>> > on >>>> > >>> a >>>> > >>> build machine (specific build user, supposedly clean). If there >>>> is a >>>> > >>> user-config.jam, then I do not know how it landed there :) >>>> > >>> >>>> > >> >>>> > >> >>>> > >> OK.. Which means that the version number for whatever python it >>>> picks up >>>> > >> is >>>> > >> undetermined and blank. I'll have to figure out why that is. >>>> > >> >>>> > > >>>> > > FYI: the Linux/OSX machines have the apt/OS python installed, and >>>> > > python3.4. >>>> > >>>> > >>>> > OK.. It turns out to have been a simple forgetting of some parens. >>>> Note >>>> > that bootstrap generates a project-config.jam file. So you do have >>>> one. You >>>> > just don't see what it is :-) But it does print out in the CI logs >>>> what it >>>> > detects as far as Python is concerned. Anyway.. It's fixed. And will >>>> be >>>> > reflected whenever stuff updates to latest develop. >>>> >>>> >>>> I think this is related, but not sure...all the regression runs I start >>>> (Linux + Windows) are currently failing with: >>>> >>>> boost-test(COMPILE) "python/select_holder" : >>>> "libs/python/test/select_holder.cpp" >>>> boost-test(RUN) "python/select_from_python_test" : >>>> "libs/python/test/select_from_python_test.cpp" "libs/python/src/conve >>>> rter/type_id.cpp" >>>> boost-test(COMPILE) "python/select_arg_to_python_test" : >>>> "libs/python/test/select_arg_to_python_test.cpp" >>>> boost-test(COMPILE_FAIL) "python/raw_pyobject_fail1" : >>>> "libs/python/test/raw_pyobject_fail1.cpp" >>>> boost-test(COMPILE_FAIL) "python/raw_pyobject_fail2" : >>>> "libs/python/test/raw_pyobject_fail2.cpp" >>>> boost-test(COMPILE_FAIL) "python/as_to_python_function" : >>>> "libs/python/test/as_to_python_function.cpp" >>>> boost-test(COMPILE_FAIL) "python/object_fail1" : >>>> "libs/python/test/object_fail1.cpp" >>>> error: at /var/boost/run/boost_bb/src/kernel/modules.jam:107 >>>> error: Unable to find file or target named >>>> error: '/boost/python//boost_numpy' >>>> error: referred to from project at >>>> error: '../libs/python/test' >>>> >>>> at the end of the results/bjam.log file. This was causing develop to >>>> fail >>>> for awhile, and now appears to have migrated to master as well. >>>> >>> >>> OK, I'm almost certain I fixed both develop and master for this now. >>> Thanks for reporting it. >>> >> >> Hmm, doesn't seem to have fixed it, still seeing the same error. >> > > Hm.. Is python configured on the runners? > Yeah, the specific runner I'm looking at at the moment has python, both 2 (2.7.6) and 3 (3.4.3, despite what the summary page says under the python versions): http://www.boost.org/development/tests/develop/developer/summary.html If you want to try that config yourself, you can get it from docker hub: teeks99/boost-build:gcc-6 I verified that it was getting the latest commit from develop: 6abf48add87c66a7b118d0bc5e24ae045ba6fbb0 Also, I noticed that there are two errors. The end of the output looks like: warning: toolset gcc initialization: can not find tool windres warning: initialized from /home/boost/user-config.jam:11 notice: using rc compiler :: <toolset>gcc-6~c++1z~warn :: /usr/bin/as notice: [python-cfg] Configuring python... notice: [python-cfg] user-specified version: "2.7" notice: [python-cfg] user-specified includes: "/usr/include/python2.7" notice: [python-cfg] user-specified libraries: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking interpreter command "python2.7"... notice: [python-cfg] running command 'python2.7 -c "from sys import *; print('version=%d.%d\nplatform=%s\nprefix=%s\nexe c_prefix=%s\nexecutable=%s' % (version_info[0],version_info[1],platform,prefix,exec_prefix,executable))" 2>&1' notice: [python-cfg] ...requested configuration matched! notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python2.7" notice: [python-cfg] include path: "/usr/include/python2.7" notice: [python-cfg] library path: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking for NumPy... notice: [python-cfg] running command 'python2.7 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_i nclude())"' notice: [python-cfg] NumPy disabled. Reason: notice: [python-cfg] python2.7 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_include())" abor ted with notice: [python-cfg] Traceback (most recent call last): File "<string>", line 1, in <module> ImportError: No module named numpy notice: [python-cfg] Configuring python... notice: [python-cfg] user-specified version: "3.4" notice: [python-cfg] user-specified includes: "/usr/include/python3.4" notice: [python-cfg] user-specified libraries: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking interpreter command "python3.4"... notice: [python-cfg] running command 'python3.4 -c "from sys import *; print('version=%d.%d\nplatform=%s\nprefix=%s\nexe c_prefix=%s\nexecutable=%s' % (version_info[0],version_info[1],platform,prefix,exec_prefix,executable))" 2>&1' notice: [python-cfg] ...requested configuration matched! notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python3.4" notice: [python-cfg] include path: "/usr/include/python3.4" notice: [python-cfg] library path: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking for NumPy... notice: [python-cfg] running command 'python3.4 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_i nclude())"' notice: [python-cfg] ...requested configuration matched! notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python3.4" notice: [python-cfg] include path: "/usr/include/python3.4" notice: [python-cfg] library path: "/usr/lib/x86_64-linux-gnu" notice: [python-cfg] Checking for NumPy... notice: [python-cfg] running command 'python3.4 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_i nclude())"' notice: [python-cfg] NumPy disabled. Reason: notice: [python-cfg] python3.4 -c "import sys; sys.stderr = sys.stdout; import numpy; print(numpy.get_include())" abor ted with notice: [python-cfg] Traceback (most recent call last): File "<string>", line 1, in <module> ImportError: No module named 'numpy' notice: [zlib] Using pre-installed library notice: [zlib] Condition notice: [bzip2] Using pre-installed library notice: [bzip2] Condition Performing configuration checks - 32-bit : no - 64-bit : yes - arm : no - mips1 : no - power : no - sparc : no - x86 : yes - symlinks supported : yes ...found 1067 targets... # Starting tests ("/var/boost/run/boost_bb/src/engine/bin.linuxx86_64/b2" "-sBOOST_BUILD_PATH=/var/boost/run:/var/boost/ run/boost_bb/src" "-sBOOST_ROOT=/var/boost/run/boost_root" "--boost=/var/boost/run/boost_root" "--boost-root=/var/boost/ run/boost_root" "--boost-build=/var/boost/run/boost_bb/src" "--debug-configuration" -l300 toolset=gcc-6~c++1z -d2 prese rve-test-targets=off --dump-tests -j8 address-model=64 --remove-test-targets -m64 "--build-dir=/var/boost/run/results" > >"/var/boost/run/results/bjam.log" 2>&1)... # Running Boost.Build tests Traceback (most recent call last): File "run.py", line 71, in <module> runner(root) File "/var/boost/run/boost_regression_src/regression.py", line 287, in __init__ self.main() File "/var/boost/run/boost_regression_src/regression.py", line 624, in main getattr(self,action_m)() File "/var/boost/run/boost_regression_src/regression.py", line 589, in command_regression self.command_test() File "/var/boost/run/boost_regression_src/regression.py", line 368, in command_test self.command_test_boost_build() File "/var/boost/run/boost_regression_src/regression.py", line 410, in command_test_boost_build "boost/bin.v2/libs/any/test/any_test.test")); OSError: [Errno 2] No such file or directory: '/var/boost/run/results/boost/bin.v2/libs/any/test/any_test.test' While the end of the results/bjam.log is: boost-test(RUN) "ptr_container/const_element_containers" : "libs/ptr_container/test/const_element_containers.cpp" boost-test(RUN_PYD) "ptr_container/__boost_check_library__" : "status/boost_check_library.py" boost-test(RUN) "python/exec" : "libs/python/test/exec.cpp" boost-test(RUN) "python/exec-dynamic" : "libs/python/test/exec.cpp" boost-test(RUN_PYD) "python/crossmod_exception" : "libs/python/test/crossmod_exception.py" "libs/python/test/crossmod_ex ception_a.cpp" "libs/python/test/crossmod_exception_b.cpp" boost-test(RUN_PYD) "python/injected" : "libs/python/test/injected.py" "libs/python/test/injected.cpp" boost-test(RUN_PYD) "python/properties" : "libs/python/test/properties.py" "libs/python/test/properties.cpp" boost-test(RUN_PYD) "python/return_arg" : "libs/python/test/return_arg.py" "libs/python/test/return_arg.cpp" boost-test(RUN_PYD) "python/staticmethod" : "libs/python/test/staticmethod.py" "libs/python/test/staticmethod.cpp" boost-test(RUN_PYD) "python/boost_shared_ptr" : "libs/python/test/boost_shared_ptr.py" "libs/python/test/boost_shared_pt r.cpp" boost-test(RUN_PYD) "python/shared_ptr" : "libs/python/test/shared_ptr.py" "libs/python/test/shared_ptr.cpp" boost-test(RUN_PYD) "python/enable_shared_from_this" : "libs/python/test/enable_shared_from_this.py" "libs/python/test/e nable_shared_from_this.cpp" boost-test(RUN_PYD) "python/andreas_beyer" : "libs/python/test/andreas_beyer.py" "libs/python/test/andreas_beyer.cpp" boost-test(RUN_PYD) "python/wrapper_held_type" : "libs/python/test/wrapper_held_type.py" "libs/python/test/wrapper_held_ type.cpp" boost-test(RUN_PYD) "python/polymorphism2_auto_ptr" : "libs/python/test/polymorphism2_auto_ptr.py" "libs/python/test/pol ymorphism2.py" "libs/python/test/polymorphism2_auto_ptr.cpp" boost-test(RUN_PYD) "python/polymorphism" : "libs/python/test/polymorphism.py" "libs/python/test/polymorphism.cpp" boost-test(RUN_PYD) "python/polymorphism2" : "libs/python/test/polymorphism2.py" "libs/python/test/polymorphism2.cpp" boost-test(RUN_PYD) "python/auto_ptr" : "libs/python/test/auto_ptr.py" "libs/python/test/auto_ptr.cpp" boost-test(RUN_PYD) "python/minimal" : "libs/python/test/minimal.py" "libs/python/test/minimal.cpp" boost-test(RUN_PYD) "python/args" : "libs/python/test/args.py" "libs/python/test/args.cpp" boost-test(RUN_PYD) "python/raw_ctor" : "libs/python/test/raw_ctor.py" "libs/python/test/raw_ctor.cpp" boost-test(RUN_PYD) "python/enum" : "libs/python/test/test_enum.py" "libs/python/test/enum_ext.cpp" boost-test(RUN_PYD) "python/exception_translator" : "libs/python/test/exception_translator.py" "libs/python/test/excepti on_translator.cpp" boost-test(RUN_PYD) "python/pearu1" : "libs/python/test/test_cltree.py" "libs/python/test/cltree.cpp" boost-test(RUN_PYD) "python/try" : "libs/python/test/newtest.py" "libs/python/test/m1.cpp" "libs/python/test/m2.cpp" boost-test(RUN_PYD) "python/const_argument" : "libs/python/test/const_argument.py" "libs/python/test/const_argument.cpp" boost-test(RUN_PYD) "python/keywords" : "libs/python/test/keywords.cpp" "libs/python/test/keywords_test.py" boost-test(RUN_PYD) "python/builtin_converters" : "libs/python/test/test_builtin_converters.py" boost-test(RUN_PYD) "python/test_pointer_adoption" : "libs/python/test/test_pointer_adoption.py" "libs/python/test/test_ pointer_adoption.cpp" boost-test(RUN_PYD) "python/operators" : "libs/python/test/operators.py" "libs/python/test/operators.cpp" boost-test(RUN_PYD) "python/operators_wrapper" : "libs/python/test/operators_wrapper.py" "libs/python/test/operators_wra pper.cpp" boost-test(RUN_PYD) "python/callbacks" : "libs/python/test/callbacks.py" "libs/python/test/callbacks.cpp" boost-test(RUN_PYD) "python/defaults" : "libs/python/test/defaults.py" "libs/python/test/defaults.cpp" boost-test(RUN_PYD) "python/object" : "libs/python/test/object.py" "libs/python/test/object.cpp" boost-test(RUN_PYD) "python/class" : "libs/python/test/class.py" "libs/python/test/class.cpp" boost-test(RUN_PYD) "python/list" : "libs/python/test/list.py" "libs/python/test/list.cpp" boost-test(RUN_PYD) "python/long" : "libs/python/test/long.py" "libs/python/test/long.cpp" boost-test(RUN_PYD) "python/dict" : "libs/python/test/dict.py" "libs/python/test/dict.cpp" boost-test(RUN_PYD) "python/tuple" : "libs/python/test/tuple.py" "libs/python/test/tuple.cpp" boost-test(RUN_PYD) "python/str" : "libs/python/test/str.py" "libs/python/test/str.cpp" boost-test(RUN_PYD) "python/slice" : "libs/python/test/slice.py" "libs/python/test/slice.cpp" boost-test(RUN_PYD) "python/virtual_functions" : "libs/python/test/virtual_functions.py" "libs/python/test/virtual_funct ions.cpp" boost-test(RUN_PYD) "python/back_reference" : "libs/python/test/back_reference.py" "libs/python/test/back_reference.cpp" boost-test(RUN_PYD) "python/implicit" : "libs/python/test/implicit.py" "libs/python/test/implicit.cpp" boost-test(RUN_PYD) "python/data_members" : "libs/python/test/data_members.py" "libs/python/test/data_members.cpp" boost-test(RUN_PYD) "python/ben_scott1" : "libs/python/test/ben_scott1.py" "libs/python/test/ben_scott1.cpp" boost-test(RUN_PYD) "python/bienstman1" : "libs/python/test/bienstman1.py" "libs/python/test/bienstman1.cpp" boost-test(RUN_PYD) "python/bienstman2" : "libs/python/test/bienstman2.py" "libs/python/test/bienstman2.cpp" boost-test(RUN_PYD) "python/bienstman3" : "libs/python/test/bienstman3.py" "libs/python/test/bienstman3.cpp" boost-test(RUN_PYD) "python/multi_arg_constructor" : "libs/python/test/multi_arg_constructor.py" "libs/python/test/multi _arg_constructor.cpp" oost-test(RUN_PYD) "python/iterator" : "libs/python/test/iterator.py" "libs/python/test/iterator.cpp" "libs/python/test /input_iterator.cpp" boost-test(RUN_PYD) "python/stl_iterator" : "libs/python/test/stl_iterator.py" "libs/python/test/stl_iterator.cpp" boost-test(RUN_PYD) "python/extract" : "libs/python/test/extract.py" "libs/python/test/extract.cpp" boost-test(RUN_PYD) "python/crossmod_opaque" : "libs/python/test/crossmod_opaque.py" "libs/python/test/crossmod_opaque_a .cpp" "libs/python/test/crossmod_opaque_b.cpp" boost-test(RUN_PYD) "python/opaque" : "libs/python/test/opaque.py" "libs/python/test/opaque.cpp" boost-test(RUN_PYD) "python/voidptr" : "libs/python/test/voidptr.py" "libs/python/test/voidptr.cpp" boost-test(RUN_PYD) "python/pickle1" : "libs/python/test/pickle1.py" "libs/python/test/pickle1.cpp" boost-test(RUN_PYD) "python/pickle2" : "libs/python/test/pickle2.py" "libs/python/test/pickle2.cpp" boost-test(RUN_PYD) "python/pickle3" : "libs/python/test/pickle3.py" "libs/python/test/pickle3.cpp" boost-test(RUN_PYD) "python/pickle4" : "libs/python/test/pickle4.py" "libs/python/test/pickle4.cpp" boost-test(RUN_PYD) "python/nested" : "libs/python/test/nested.py" "libs/python/test/nested.cpp" boost-test(RUN_PYD) "python/docstring" : "libs/python/test/docstring.py" "libs/python/test/docstring.cpp" boost-test(RUN_PYD) "python/pytype_function" : "libs/python/test/pytype_function.py" "libs/python/test/pytype_function.c pp" boost-test(RUN_PYD) "python/vector_indexing_suite" : "libs/python/test/vector_indexing_suite.py" "libs/python/test/vecto r_indexing_suite.cpp" boost-test(RUN_PYD) "python/pointer_vector" : "libs/python/test/pointer_vector.py" "libs/python/test/pointer_vector.cpp" boost-test(RUN_PYD) "python/map_indexing_suite" : "libs/python/test/map_indexing_suite.py" boost-test(RUN) "python/import_" : "libs/python/test/import_.cpp" boost-test(RUN_PYD) "python/calling_conventions" : "libs/python/test/calling_conventions.py" "libs/python/test/calling_c onventions.cpp" boost-test(RUN_PYD) "python/calling_conventions_mf" : "libs/python/test/calling_conventions_mf.py" "libs/python/test/cal ling_conventions_mf.cpp" boost-test(COMPILE) "python/indirect_traits_test" : "libs/python/test/indirect_traits_test.cpp" boost-test(RUN) "python/destroy_test" : "libs/python/test/destroy_test.cpp" boost-test(RUN) "python/pointer_type_id_test" : "libs/python/test/pointer_type_id_test.cpp" boost-test(RUN) "python/bases" : "libs/python/test/bases.cpp" boost-test(RUN) "python/if_else" : "libs/python/test/if_else.cpp" boost-test(RUN) "python/pointee" : "libs/python/test/pointee.cpp" boost-test(RUN) "python/result" : "libs/python/test/result.cpp" boost-test(COMPILE) "python/string_literal" : "libs/python/test/string_literal.cpp" boost-test(COMPILE) "python/borrowed" : "libs/python/test/borrowed.cpp" boost-test(COMPILE) "python/object_manager" : "libs/python/test/object_manager.cpp" boost-test(COMPILE) "python/copy_ctor_mutates_rhs" : "libs/python/test/copy_ctor_mutates_rhs.cpp" boost-test(RUN) "python/upcast" : "libs/python/test/upcast.cpp" boost-test(COMPILE) "python/select_holder" : "libs/python/test/select_holder.cpp" boost-test(RUN) "python/select_from_python_test" : "libs/python/test/select_from_python_test.cpp" "libs/python/src/conve rter/type_id.cpp" boost-test(COMPILE) "python/select_arg_to_python_test" : "libs/python/test/select_arg_to_python_test.cpp" boost-test(COMPILE_FAIL) "python/raw_pyobject_fail1" : "libs/python/test/raw_pyobject_fail1.cpp" boost-test(COMPILE_FAIL) "python/raw_pyobject_fail2" : "libs/python/test/raw_pyobject_fail2.cpp" boost-test(COMPILE_FAIL) "python/as_to_python_function" : "libs/python/test/as_to_python_function.cpp" boost-test(COMPILE_FAIL) "python/object_fail1" : "libs/python/test/object_fail1.cpp" error: at /var/boost/run/boost_bb/src/kernel/modules.jam:107 error: Unable to find file or target named error: '/boost/python//boost_numpy' error: referred to from project at error: '../libs/python/test' Hope that helps, Tom

4 8

[gsoc17]Getting interests in uBLAS
by Ruoyun Jing 06 Mar '17

06 Mar '17

Hi, I am Ruoyun, I'm back again.:) In these few days, I'm getting start with boost by [link](https://github.com/boostorg/boost/wiki/Getting-Started), and got something wrong with developing/checking out a particular branch that in Ubuntu, I can not find the file called"modular-boost",but when I tried to "cd libs/geometry",it went run. When I tried to contact the devs of geometry in gitter, IRC, and email, there is only a reply for me. So I'm pretty interested in math about any aspects, because during my life of algorithm competition, I was good at algorithms in geometry, number theory, linear algebra and etc. I am really want to contact with mentor more frequently to learn more knowledge and provide more contributions to boost. I'm also interested in uBLAS and willing to learn knowledge about that !!! Looking forward from you! Thanks. Ruoyun Jing -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

4 4

Insanely slow download speeds from SourceForge
by Louis Dionne 06 Mar '17

06 Mar '17

I've been getting very slow downloads of Boost from SourceForge during my Travis builds for the past week or so. It goes as low as 40K/s: Resolving downloads.sourceforge.net (downloads.sourceforge.net) 216.34.181.59 Connecting to downloads.sourceforge.net (downloads.sourceforge.net)|216.34.181.59|:443... connected. HTTP request sent, awaiting response... 302 Found Location: https://svwh.dl.sourceforge.net/project/boost/boost/1.63.0/boost_1_63_0.tar… [following] --2017-03-05 21:08:35-- https://svwh.dl.sourceforge.net/project/boost/boost/1.63.0/boost_1_63_0.tar… Resolving svwh.dl.sourceforge.net (svwh.dl.sourceforge.net) 72.5.72.15, 2606:c680:0:b:3830:34ff:fe66:6663 Connecting to svwh.dl.sourceforge.net (svwh.dl.sourceforge.net)|72.5.72.15|:443... connected. HTTP request sent, awaiting response... 200 OK Length: 81984414 (78M) [application/octet-stream] Saving to: `STDOUT' 33% [============> ] 27,795,206 40.4K/s eta 21m 34s Is anyone else having the same issue? It's causing many of my builds to time out. Louis -- View this message in context: http://boost.2283326.n4.nabble.com/Insanely-slow-download-speeds-from-Sourc… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 2

[safe_numerics] The review is ongoing
by Andrzej Krzemienski 06 Mar '17

06 Mar '17

Hi Everyone, This is to remind you about the ongoing review of safe_numerics library by Robert Ramey. The review will run till March 11th. Even if you find the format of the full review too demanding, a partial review, or simply your perception of whether the library should be given a place in Boost, will be of value, and may have an impact on the final decision. safe_numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey /safe_numerics/master/doc/html/index.html Formal Review comments can be posted publicly on the mailing list or Boost Library Incubator <http://blincubator.com>, or sent privately to the review manager, that is myself. Here are some questions you might want to answer in your review: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And most importantly: Do you think the library should be accepted as a Boost library? For more information about Boost Formal Review Process, see: http://www.boost.org/community/reviews.html Your review is needed!

1 0

[metal] Feature Complete - Request for Feedback
by Bruno Dutra 05 Mar '17

05 Mar '17

Dear community, As some of you might be aware through sporadic discussions on this mailing list throughout the last couple of years, I've been working for quite a while on a modern template metaprogramming library called Metal, that I advocate as a direct replacement for the aging Boost.MPL. I believe my work is finally complete now and so I come to you to request for feedback and ask whether you think that Metal would be a valuable addition to the Boost distribution. My intention is to request a formal review in the next days / weeks, depending on your preliminary feedback. In a glimpse, Metal is a pure template metaprogramming that explores all modern features available to C++14 to overcome the limitations of Boost.MPL, most notably: * vastly improved performance [1]; * terser syntax [2]. Repository: https://github.com/brunocodutra/metal Documentation: http://brunocodutra.github.io/metal/ Boost Incubator: http://blincubator.com/bi_library/metal-2/?gform_post_id=1566 I appreciate your feedback and opinion on whether Metal is a good fit for Boost! - Previous discussions About a year ago I came to this list to discuss a proposal of merging Metal into MPL as a new API built from ground up, while at the same time serving as a backend for the previous API on modern compilers. At that time, Metal was lazy and very similar to MPL, but since then it underwent great simplification and embraced the all-eager design, so I don't think this would be a good idea anymore. Besides, it soon became clear that this would be a huge undertaking with potential to inadvertently breaking a lot of good code to little gain, so I decided instead to tackle the problem migration from MPL by providing a handy adaptor [3]. [1]: http://metaben.ch/ [2]: http://brunocodutra.github.io/metal/index.html#in_a_glimpse [3]: http://brunocodutra.github.io/metal/group__external.html#gaede6847ad3e0bb64… Regards, Bruno Dutra

13 35

[builds] broken
by Raffi Enficiaud 05 Mar '17

05 Mar '17

Hi all, On develop, I have the following error for gcc/linux and clang/osx: 01-Mar-2017 23:58:05 libs/python/build/Jamfile:155: in lib_boost_numpy 01-Mar-2017 23:58:05 *** argument error 01-Mar-2017 23:58:05 * rule lib ( names + : sources * : requirements * : default-build * : usage-requirements * ) 01-Mar-2017 23:58:05 * called with: ( : numpy/dtype.cpp numpy/matrix.cpp numpy/ndarray.cpp numpy/numpy.cpp numpy/scalars.cpp numpy/ufunc.cpp : <link>static:<define>BOOST_NUMPY_STATIC_LIB <define>BOOST_NUMPY_SOURCE <library>/python//python_for_extensions <include>/System/Library/Frameworks/Python.framework/Versions/2.7/Extras/lib/python/numpy/core/include <library>boost_python <python-debugging>on:<define>BOOST_DEBUG_PYTHON <python>2.7 -<tag>@Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>%Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>.tag <tag>@Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>%Jamfile</Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library>.python-tag <conditional>@python.require-py : <link>shared : <link>static:<define>BOOST_NUMPY_STATIC_LIB <python-debugging>on:<define>BOOST_DEBUG_PYTHON ) 01-Mar-2017 23:58:05 * missing argument names 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/tools/builtin.jam:506:see definition of rule 'lib' being called 01-Mar-2017 23:58:05 libs/python/build/Jamfile:168: in modules.load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:325: in load-jamfile 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:64: in load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:89: in load-used-projects 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:75: in load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build/project.jam:145: in project.find 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/build-system.jam:535: in load 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/kernel/modules.jam:295: in import 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/tools/build/src/kernel/bootstrap.jam:139: in boost-build 01-Mar-2017 23:58:05 /Users/bambooagent/bamboo-agent-home/xml-data/build-dir/SW-BCB108-O1C/library/boost-build.jam:17: in module scope 01-Mar-2017 23:58:05 Failing task since return code of [/bin/sh /Users/bambooagent/bamboo-agent-home/temp/SW-BCB108-O1C-3-ScriptBuildTask-4580193904098485274.sh] was 1 while expected 0 Best, Raffi

5 9

[heap] tests failing
by Raffi Enficiaud 05 Mar '17

05 Mar '17

Hi, The latest commit (1c061c9) on boost.heap has failing tests. The previous commit (7aa8f90) works fine. Raffi PS: I am using boost.heap as one of the boost.test checks.

2 1

[outcome] Tutorial third rewrite finished (I hope)
by Niall Douglas 05 Mar '17

05 Mar '17

I know the Safe Numerics review is currently happening and almost straight thereafter comes the final Stacktrace review so people are probably a bit tired of reviewing stuff, however I believe the third rewrite of the Outcome tutorial is now finished at long last. Expected<T, E> in Context: https://ned14.github.io/boost.outcome/md_doc_md_02-tutorial_a.html Expected<T, E> in Practice: https://ned14.github.io/boost.outcome/md_doc_md_03-tutorial_b.html Refining Expected<T, E>: https://ned14.github.io/boost.outcome/md_doc_md_04-tutorial_c.html Feedback is once again very welcome, indeed this tutorial looks so very different from the previous two editions because of your feedback, so thank you. In case anyone is interested, the biggest showstopper remaining before this goes into the Boost review queue is the reference docs: doxygen chokes badly on the preprocessor metaprogramming Outcome uses and generate rubbish docs. I didn't find much success with Standardese or Doxypress either, so I'm currently working with my shiny new Python C99 conforming preprocessor (https://github.com/ned14/pcpp) to partially preprocess Outcome into a form doxygen can cope with. I expect a few weeks remain on that, it may pass most of the C11 preprocessor torture test suite but the partial preprocessor pass through implementation has bugs I'm still nailing down :) Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 1

[gsoc17]Getting started with Project 2 in Boost.Geometry : R-tree serialization
by Jing Rylynnn 05 Mar '17

05 Mar '17

Hi Everyone: My name is Ruoyun Jing, I am an undergraduate student in Northwest University(China) of Software Engineering.Although i am a girl,i really love coding and algorithms!!! I've coded many algorithms problems with C++ and Python,and got Bronze Metal in ACMICPC Asia Shenyang Regional contest. GSoC is really a precious chance for me to get in touch with open source software. After reading all the organizatuions and their projects, I'm pretty interested in R-tree serialization. Despite my lack of project experience,i will try my best to learn ,code and communicate with mentor!!! Looking forward from you.:) Thank. -- Northwest University of China Software Engineering jingry0321(a)gmail.com

1 0

Re: [boost] [MPL][vector] Is there interest in mpl::vector using variadic templates?
by Bruno Dutra 04 Mar '17

04 Mar '17

On Mar 3, 2017 17:58, "Peter Dimov via Boost" <boost(a)lists.boost.org> wrote: Bruno Dutra wrote: OTOH the void* trick requires that a pack of M void pointers be > instantiated when the element at position M is retrieved from a list, so, > for a list of N elements, the compiler must instantiate N *distinct* packs > of void pointers, because each of these packs have a different size and is > thus a distinct type. > Not just that, but the helper function that is required to obtain the Mth element is a template instantiation as well. Saying that we shouldn't use map_from_list because it consumes memory for the instantiation is misleading; the alternatives consume memory for instantiations as well. Except for __type_pack_element, of course. Right, the trick is usually to figure out what consumes less memory, i.e. what leads to the least amount of distinct template instantiations. Alias templates help a lot with that, since they are not actually instantiated, but there is only so much one can do with alias templates alone. Bruno

2 1

test message
by Michael Caisse 04 Mar '17

04 Mar '17

-- Michael Caisse Ciere Consulting ciere.com

1 0

[gsoc17]Some problems Project 2 in Boost.Geometry : R-tree serialization
by Ruoyun Jing 04 Mar '17

04 Mar '17

Hi ! I'm Ruoyun Jing,and I'm back.:) I have many problems about these projects. And I begin to configure the development environment of these project, and decided to fix some issue about Boost.Geometry. It will be many problems to ask, how could i communicate with mentor more quickly? I join in the gitter of Boostorg/geometry,but there might not be very active, could you please tell me how to get in touch with devs more convenient? Looking forward from you.:) Thanks. -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

cross-compilation: building boost on linux targetting osx
by Frédéric Bron 04 Mar '17

04 Mar '17

Hi, I am trying to cross-build boost on linux targetting osx. I am using a cross compiler based on the linux clang 3.8.1 (osxcross). You can find below the process I use to build boost. My problem is that apparently b2 cannot find iconv, zlib and bzip2. Also apprently it says that clang does not support C++11 features (which is not true): - Boost.Config Feature Check: cxx11_auto_declarations : no - Boost.Config Feature Check: cxx11_constexpr : no - Boost.Config Feature Check: cxx11_defaulted_functions : no - Boost.Config Feature Check: cxx11_final : no - Boost.Config Feature Check: cxx11_hdr_mutex : no - Boost.Config Feature Check: cxx11_hdr_tuple : no - Boost.Config Feature Check: cxx11_lambdas : no - Boost.Config Feature Check: cxx11_noexcept : no - Boost.Config Feature Check: cxx11_nullptr : no - Boost.Config Feature Check: cxx11_rvalue_references : no - Boost.Config Feature Check: cxx11_template_aliases : no - Boost.Config Feature Check: cxx11_thread_local : no - Boost.Config Feature Check: cxx11_variadic_templates : no - zlib : no - bzip2 : no - iconv (libc) : no - iconv (separate) : no - Boost.Locale needs either iconv or ICU library to be built. I identified potential issues: 1. I give toolset clang to bootstrap.sh which sets the toolset to clang in project-config.jam but clang-linux is used: common.mkdir bin.v2/libs/system/build/clang-linux-3.8.1/release Should it be clang-darwin instead? However, if I set it myself to clang-darwin with bootstrap.sh, it says that clang-darwin toolset does not exist. By the way, there is nothing about clang in getting started: http://www.boost.org/doc/libs/1_63_0/more/getting_started/unix-variants.html 2. when looking for the iconv library (same issue with zlib and bzip2), there are unknown linker options (--start-group or -R) and the iconv library path I gave to b2 is not given to the compiler/linker. Here is part of the output in config.log: clang-linux.compile.c++.without-pth bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_obj.o "x86_64-apple-darwin13-clang++-libc++" -c -x c++ -std=c++14 -O2 -DNDEBUG -O0 -g -fno-inline -Wall -g -fPIC -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_LOG_WITHOUT_EVENT_LOG -DBOOST_THREAD_USE_LIB -I"." -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_obj.o" "libs/locale/src/../build/has_iconv.cpp" "x86_64-apple-darwin13-clang++-libc++" -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv" -Wl,--start-group "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_obj.o" -Wl,-Bstatic -Wl,-Bdynamic -Wl,--end-group -g -m64~ ld: unknown option: --start-group clang-linux.compile.c++.without-pth bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_ext.o "x86_64-apple-darwin13-clang++-libc++" -c -x c++ -std=c++14 -O2 -DNDEBUG -O0 -g -fno-inline -Wall -g -fPIC -m64 -DBOOST_ALL_NO_LIB=1 -DBOOST_LOG_WITHOUT_EVENT_LOG -DBOOST_THREAD_USE_LIB -I"." -I"/softs/osx64-clang-3.8.1/release/iconv/include" -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_ext.o" "libs/locale/src/../build/has_iconv.cpp" "x86_64-apple-darwin13-clang++-libc++" -L"/softs/osx64-clang-3.8.1/release/iconv/lib" -Wl,-R -Wl,"/softs/osx64-clang-3.8.1/release/iconv/lib" -Wl,-rpath-link -Wl,"/softs/osx64-clang-3.8.1/release/iconv/lib" -o "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_external_iconv" -Wl,--start-group "bin.v2/libs/locale/build/clang-linux-3.8.1/debug/target-os-darwin/has_iconv_libc_ext.o" -Wl,-Bstatic -Wl,-Bdynamic -liconv -Wl,--end-group -g -m64~ ld: unknown option: -R Any idea? Frédéric Currently, I am using the following commands to build boost: CC="x86_64-apple-darwin13-clang" CFLAGS="-O2 -DNDEBUG" CXX="x86_64-apple-darwin13-clang++-libc++" CXXFLAGS="-O2 -DNDEBUG -std=c++14" CPPFLAGS="-I/softs/osx64-clang-3.8.1/release/iconv/include -I/softs/osx64-clang-3.8.1/release/bzip2/include -I/softs/osx64-clang-3.8.1/release/zlib/include" LDFLAGS="-L/softs/osx64-clang-3.8.1/release/iconv/lib -L/softs/osx64-clang-3.8.1/release/bzip2/lib -L/softs/osx64-clang-3.8.1/release/zlib/lib" AR="x86_64-apple-darwin13-ar" AS="x86_64-apple-darwin13-as" RANLIB="x86_64-apple-darwin13-ranlib" ./bootstrap.sh --without-icu --prefix=/softs/osx64-clang-3.8.1/release/boost --with-toolset=clang then I write a user-config.jam: using clang : : x86_64-apple-darwin13-clang++-libc++ : <cxxflags>-std=c++14 <cxxflags>-O2 <cxxflags>-DNDEBUG <archiver>x86_64-apple-darwin13-ar <ranlib>x86_64-apple-darwin13-ranlib ; and run b2: CC="x86_64-apple-darwin13-clang" CFLAGS="-O2 -DNDEBUG" CXX="x86_64-apple-darwin13-clang++-libc++" CXXFLAGS="-O2 -DNDEBUG -std=c++14" CPPFLAGS="-I/softs/osx64-clang-3.8.1/release/iconv/include -I/softs/osx64-clang-3.8.1/release/bzip2/include -I/softs/osx64-clang-3.8.1/release/zlib/include" LDFLAGS="-L/softs/osx64-clang-3.8.1/release/iconv/lib -L/softs/osx64-clang-3.8.1/release/bzip2/lib -L/softs/osx64-clang-3.8.1/release/zlib/lib" AR="x86_64-apple-darwin13-ar" AS="x86_64-apple-darwin13-as" RANLIB="x86_64-apple-darwin13-ranlib" ./b2 -d2 -j8 boost.locale.iconv=on boost.locale.icu=off boost.locale.std=off -sICONV_PATH=/softs/osx64-clang-3.8.1/release/iconv -sBZIP2_INCLUDE=/softs/osx64-clang-3.8.1/release/bzip2/include -sBZIP2_LIBPATH=/softs/osx64-clang-3.8.1/release/bzip2/lib -sZLIB_INCLUDE=/softs/osx64-clang-3.8.1/release/zlib/include -sZLIB_LIBPATH=/softs/osx64-clang-3.8.1/release/zlib/lib --layout=system --user-config=user-config.jam --without-mpi --without-python --without-context --without-coroutine link=static threading=multi runtime-link=shared target-os=darwin threadapi=pthread address-model=64 define=BOOST_THREAD_USE_LIB define=BOOST_LOG_WITHOUT_EVENT_LOG variant=release install

2 2

[nowide] Library Updates
by Artyom Beilis 04 Mar '17

04 Mar '17

Hello, Disclaimer: --------------- I recently discovered that virtually all e-mails sent from Yahoo account to any mailing lists go to user's spam due to recent Yahoo's DMARC policy. So I'm sending some important stuff from GMail account that almost certainly was missed: What is Boost.Nowide: -------------------------------- Boost.Nowide is a library that make cross platform Unicode aware programming easier. The library provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. It was inspiration and inspired by http://utf8everywhere.org/ development ideas and policy. Some updates regarding Boost.Nowide ------------------------------- 1. Library moved to github and its format is converted to modular boost layout: https://github.com/artyom-beilis/nowide 2. Fixed unsupported std::ios::ate flag by boost::nowide::fstream 3. Added some C++11 interfaces to boost::nowide::fstream 4. Added integration functionality with boost::filesystem: https://github.com/artyom-beilis/nowide/blob/master/include/boost/nowide/in… Note: that the links to the source code on review schedule aren't relevant, it should be: - Code: https://github.com/artyom-beilis/nowide - Documentation: http://cppcms.com/files/nowide/html/ Also the library is still looking for review manager. Artyom Beilis P.S.: I'm sorry if you are getting this as "duplicate"

2 1

[Boost-users] Unbounded integers and shared memory
by Antony Polukhin 04 Mar '17

04 Mar '17

Hello, One of the ISO WG21 C++ Study Groups is investigating the usecases of shared memory usage with wide arithmetics (Boost.Interprocess, Boost.Multiprecision, in-house solutions?). Particularly interesting: * Are there users that store unbounded numbers in shared memory? * Will bounded integers satisfy need of those users? Informal glossary: * "unbounded numbers" - numbers (integral, relational, floating point and others) that can store and operate on any huge value by dynamically allocating memory as necessary to maintain a representation of operation results. * "bounded types" - Numbers (integral, relational, floating point and others) which bounds are specified in number of bytes/bits/words at compile time and that do not allocate memory. Please, response if you are one of such users. Great thanks in advance! -- Best regards, Antony Polukhin

1 0

[gsoc17]Getting started with Project 2 in Boost.Geometry : R-tree serialization and Project 1:static map
by Ruoyun Jing 03 Mar '17

03 Mar '17

Hi Everyone: My name is Ruoyun Jing, I am an undergraduate student in Northwest University(China) of Software Engineering.Although i am a girl,i really love coding and algorithms!!! I've coded many algorithms problems with C++ and Python,and got Bronze Metal in ACMICPC Asia Shenyang Regional contest. GSoC is really a precious chance for me to get in touch with open source software. After reading all the organizatuions and their projects, I'm pretty interested in R-tree serialization and static map. Despite my lack of project experience,i will try my best to learn ,code and communicate with mentor!!! Looking forward from you.:) Thank -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

[MPL][vector] Is there interest in mpl::vector using variadic templates?
by Михаил Максимов 03 Mar '17

03 Mar '17

Dear community, I've recently started contributing to boost::variant. To speed up variant's compilation I'm implementing mpl::vector on variadic templates. For now status of new vector implementation is: 1) it passes all mpl/test tests on gcc 4.9 and 6.3 2) it is decoupled from mpl::vectorN, simultaneously making mpl::vectorN visible, so libs like Boost.Geometry, which rely on mpl::vectorN compile nicely 3) There are several compilation errors during full build on gcc 4.9 and 6.3 4) I fix problems on mpl/tests stage for clang 3.4 and latest MSVS2017 compiler Bruno's introduction of new shiny Metal library and Sergey's comment in the same thread: > The biggest and most useful feature of "new" TMP libraries is variadic > templates that increase performance by a really huge factor. The problem > with MPL is that vector type sequence must derive from vectorN-s, which are > documented and can be used in template specialization. So it is impossible > or pointless to remplement mpl::vector in terms of variadic parameters > because of that. The other problem that I can quickly recall is recursive > iterator-based approach, which also kills performance. made me wonder, is there interest in variadic templates implementation? Are there limitations for it's usefulness, which I did not see? Regards, Mike Maximov

7 14

Review Request: poly_collection
by Joaquin M López Muñoz 03 Mar '17

03 Mar '17

Hello, I'd like to ask for formal review of (candidate) Boost.PolyCollection, a library providing fast containers of polymorphic objects: https://github.com/joaquintides/poly_collection http://blincubator.com/bi_library/polycollection/?gform_post_id=1643 http://rawgit.com/joaquintides/poly_collection/website/doc/html/index.html Typically, polymorphic objects cannot be stored directly in regular containers and need be accessed through an indirection pointer, which introduces performance problems related to CPU caching and branch prediction. Boost.PolyCollection implements a novel data structure that is able to contiguously store polymorphic objects without such indirection, thus providing a value-semantics user interface and better performance. Three polymorphic collections are provided: * boost::base_collection * boost::function_collection * boost::any_collection dealing respectively with classic base/derived or OOP polymorphism, function wrapping in the spirit of std::function and so-called duck typing as implemented by Boost.TypeErasure. The library compiles and runs succesfully in Visual Studio 2015, GCC 5.2.1 and Clang 3.7. Ion Gaztañaga has kindly volunteered to act as the review manager for (candidate) Boost.PolyCollection. Best regards, Joaquín M López Muñoz

3 6

[GSoC 17] Getting started with Project Idea 1 : Static Map
by Govind Sahai 02 Mar '17

02 Mar '17

Hi to all, I am Govind Sahai student at Indian Institute of Technology BHU Varanasi, India. I would like to work on 'Project 1: Static Map'. I am already contributing to different open source projects from past two years. I have read the project description on page https://svn.boost.org/trac/boost/wiki/SoC2017., I have looked at toy static_map implementation and would like to know more details about the project. Thanks, -- ------------------------------------------------------------------------------------ Govind Sahai Indian Institute of Technology Varanasi Mathematical Sciences Part-IV Varanasi-221005

2 1

Getting Started
by mohammad sharique 02 Mar '17

02 Mar '17

Hello boost community! I want to work on 'PROJECT 2 : Data.Frames in boost.uBlas' under GSOC'17 (https://svn.boost.org/trac/boost/wiki/SoC2017) I have setup the boost library and had taken overview of uBLAS library from here : <https://github.com/boostorg/ublas/tree/develop/doc>. As I am new to open source, I need some help to get started on above mentioned lines. Thank you

1 0

[release] 1.64.0 closed for major changes
by Rene Rivera 02 Mar '17

02 Mar '17

The master branch is now closed for new libraries and breaking changes, and will be closing for major changes in a week and closed for the beta in two weeks. Also, if you're ready, you can also add your libraries' changes to the release notes at: < https://github.com/boostorg/website/blob/master/feed/history/boost_1_64_0.q… > Thanks, -- The Boost Release Team

1 0

Re: [boost] [Boost-testing] Much longer linux regression run times
by Tom Kent 01 Mar '17

01 Mar '17

On Tue, Feb 28, 2017 at 9:08 PM, Rene Rivera <grafikrobot(a)gmail.com> wrote: > On Tue, Feb 28, 2017 at 8:55 PM, Tom Kent via Boost-Testing < > boost-testing(a)lists.boost.org> wrote: > >> >> I'm not really sure how to trace this down. Is there any way to log the >> time it takes the various libraries to complete their test suites? >> > > Not currently. The individual tests can run in parallel. To give you that > number we would have to save the information as part of the regression data > and sum it up as part of the regression reports. > > >> I'm guessing that will show one library that is using 3+ hours. Although, >> it is possible that a change went in to a higher level library that just >> adds a few seconds to each call and is used across many of the libraries. >> >> Thoughts? >> > > Binary search manually? You can limit what tests you run on the command > line by using the "--include-tests" b2 option < > https://github.com/boostorg/boost/blob/develop/status/Jamfile.v2#L18>. So > start off by only running tests for [a-m] or [n-z], then [a-g], and so on. > Until you find the time hog. > That sounds tough. As a shortcut, I've looked at the libraries that had commits to develop on the 18th: https://github.com/boostorg/boost/commits/develop?after=Y3Vyc29yOudbdLMAs4G… It looks like hana, chrono, ratio, and thread (with wave and core/winapi the previous day). If I get a chance tonight I'll start checking through those. Meanwhile, if those authors could look at those and see if there is anything that might be causing this, it would be appreciated. > > Other than that, maybe it's one of the libraries tested on Travis < > https://travis-ci.org/boostorg/boost>. And maybe check the length of > those first if they are long on Travis perhaps they are also long on > regular tests. > I could find the travis scripts for the superset repo (no change in build time), but I'm not clear on what that is doing. Is it testing individual libraries? Tom

3 2

[smart_ptr][thread] Build failures
by Raffi Enficiaud 01 Mar '17

01 Mar '17

Hi all, I have the following compilation issues on master and develop, failing the VS2008, VS2012, VS2013 builds for boost.test (VS2015 ok): 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static\threading-multi 01-Mar-2017 09:57:43 common.mkdir ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static\threading-multi\win32 01-Mar-2017 09:57:45 compile-c-c++ ..\..\..\bin.v2\libs\thread\build\msvc-11\debug\link-static\threading-multi\win32\thread.obj 01-Mar-2017 09:57:45 thread.cpp 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/thread/detail/thread.hpp(486) : warning C4067: unexpected tokens following preprocessor directive - expected a newline 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(355) : error C2059: syntax error : ')' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(358) : see reference to class template instantiation 'boost::detail::sp_less_align<T,U>' being compiled 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2143: syntax error : missing ')' before ';' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2143: syntax error : missing '}' before ')' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2059: syntax error : ')' 01-Mar-2017 09:57:45 D:\bamboo_build_dir\SW-BCB108-VC2012W64\library\boost/smart_ptr/allocate_shared_array.hpp(357) : error C2238: unexpected token(s) preceding ';' Can those be quickly fixed? Thanks, Raffi

3 4

[thread]Forever sleeping
by Niklas Angare 01 Mar '17

01 Mar '17

Recent runs of my regression test runner NA-QNX660-x86 leave a lot of Boost.Thread test executables stuck in nanosleep, waiting for a condition variable, or both. Commit 544eda [1] which switched from CLOCK_REALTIME to CLOCK_MONOTONIC seems suspicious to me. If the returned timespec is ever compared to values based on the CLOCK_REALTIME epoch, such as system_clock, the results will be quite undesirable. Are you sure the return values of timespec_now() are only ever compared to each other and values based on the CLOCK_MONOTONIC epoch? [1] https://github.com/boostorg/thread/commit/544eda51bdf0c62b2f29dea6fe1cf935a… Regards, Niklas Angare

3 9

boost exception to_string()
by Olaf van der Spek 28 Feb '17

28 Feb '17

Hi, Is to_string() here supposed to match to_string() in boost\exception\to_string.hpp? class shared_array2 : public boost::iterator_range<T*> {}; typedef shared_array2<unsigned char> shared_data; to_string(shared_data()); I really didn't expect this to_string() to be found here.. is it a feature or is it a bug? -- Olaf

1 0

[config] [atomic] Problem with placement of BOOST_ALIGNMENT - requesting opinions/suggestions
by Groke, Paul 28 Feb '17

28 Feb '17

While preparing a pull request for my Boost.Atomic extensions for the z/OS compiler, I noticed that I have a slight problem there. To get the code to work on z/OS, I changed the placement of the BOOST_ALIGNMENT macro in atomic/detail/storage_type.hpp from... BOOST_ALIGNMENT(16) unsigned char data[Size]; to unsigned char data[Size] BOOST_ALIGNMENT(16); ...because unfortunately the z compiler doesn't understand the __attribute__ ((__aligned__(x))) when it's at the beginning of a variable/data member definition. (For the GNU __attribute__ ((__aligned__(x))) the new location is also the only documented location, although GCC doesn't seem to mind.) While reviewing my changes I now realized that this won't do, because BOOST_ALIGNMENT can also be defined as __declspec(align(x)) or alignas(x), both of which are legal at the beginning but not at the end of a variable/data member definition. (I'm not 100% sure about valid positions of alignas (x) - the examples I can find use alignas (x) at the beginning, but the compilers we currently use - which include MSVC, GCC and Clang, also seem to accept it at the end. __declspec(align(x)) definitely is a problem though.) And now I'm wondering what to do about this. One way to fix this would obviously be to introduce two additional macros, e.g. BOOST_ALIGNMENT_DECLSPEC and BOOST_ALIGNMENT_ATTRIBUTE. Only one of those would then expand to something non-empty, and both would have to be used in variable definitions. The BOOST_ALIGNMENT macro would remain as is for type declarations and for compatibility. The code in storage_type.hpp would then have to be re-written as BOOST_ALIGNMENT_DECLSPEC(16) unsigned char data[Size] BOOST_ALIGNMENT_ATTRIBUTE(16); Which of course is very very ugly. Another option would be a BOOST_ALIGNED_VARIABLE(alignment, variable_definition) macro. This would be nice in definitions like BOOST_ALIGNED_VARIABLE(16, unsigned char data[Size]); but much less nice in definitions like BOOST_ALIGNED_VARIABLE(16, some_template<foo BOOST_PP_COMMA bar BOOST_PP_COMMA baz>); And since not all compilers support variadic macros, this is probably the best one could do. The third option I can think of would be to leave things as they are, which of course would mean that I can't submit my Boost.Atomic implementation for z/OS... hm. I realize that making things uglier for a single compiler that almost nobody uses isn't something many people will cheer for. But then again I'd really like to have my Boost.Atomic implementation for z/OS in the official Boost releases :) So I'm calling out to you for suggestions/opinions/comments. Is there another way to combine the above mentioned square peg + round hole? And which option would you deem favorable/acceptable? Thank you for taking the time to read this wall of text, Cheers, Paul Groke The contents of this e-mail are intended for the named addressee only. It contains information that may be confidential. Unless you are the named addressee or an authorized designee, you may not copy or use it, or disclose it to anyone else. If you received it in error please notify us immediately and then destroy it. Dynatrace Austria GmbH (registration number FN 91482h) is a company registered in Linz whose registered office is at 4040 Linz, Austria, Freistaedterstrasse 313

3 8

[gsoc17] Boost will be participating in Google Summer of Code in 2017
by Niall Douglas 27 Feb '17

27 Feb '17

I am very pleased to inform the Boost community that Google accepted us into their Summer of Code programme this year. This was especially welcome after we were given "a year off" last year which could have caused substantial disruption to the multi year student projects had it not been due to the timely action of the steering committee and generous sponsorship of a stop gap Boost Summer of Code in 2016 by IMC Financial Markets. Last year Google completely rebuilt the Summer of Code website so it no longer is anything like it was before. Now we must individually invite those who vote on student projects, so *anyone willing to rank student project proposals* can you please email us with your details: 1. Your email address matching your Google Account so we can invite you onto the GSoC programme. 2. (Optional) your email address matching your Github Account so we can invite you onto the Boost GSoC github org for 2017 as a potential mentor. Our thanks to those who have already added project ideas to https://svn.boost.org/trac/boost/wiki/SoC2017, but we need MORE ideas and MORE potential project mentors. Follow the project idea template at https://svn.boost.org/trac/boost/wiki/GSoCIdeaTemplate and either add it straight to the wiki page or email it to us so we can add it for you. Our thanks to all in advance.

1 0

ABI navigator for Boost libraries
by Andrey Ponomarenko 26 Feb '17

26 Feb '17

Hello, I'd like to present a new project called "ABI Navigator" to search for binary symbols (functions, methods, global data, etc.) in the Boost and other open-source libraries: https://abi-laboratory.pro/index.php?view=navigator The project allows to find out in which versions of the library and in which particular objects of the library some symbol is defined, added or removed. The project is based on the ABI report for Boost: https://abi-laboratory.pro/tracker/timeline/boost/ Examples: 1. symbol "boost::system::system_category()" from libboost_system.so: https://abi-laboratory.pro/index.php?view=navigator&selected=_ZN5boost6syst… 2. symbol _ZnwmPv21boost_container_new_t from libboost_container.so: https://abi-laboratory.pro/index.php?view=navigator&selected=_ZnwmPv21boost… The project aims to help library users and maintainers to resolve issues with missed symbols and navigate through the ABI reports. Have you ever encountered the "undefined reference" error or want to know whether the symbol is _stable_ enough to use in your code? Try to find it in the ABI Navigator! Enjoy!

1 0

[release] 1.64.0 closed for major changes
by Rene Rivera 23 Feb '17

23 Feb '17

The master branch is now closed for new libraries and breaking changes, and will be closing for major changes in a week and closed for the beta in two weeks. Also, if you're ready, you can also add your libraries' changes to the release notes at: < https://github.com/boostorg/website/blob/master/feed/history/boost_1_64_0.q… > Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[mpi] Merging a PR fixing auto_ptr usage
by Andrey Semashev 22 Feb '17

22 Feb '17

Hi, Could someone take a look at this PR and hopefully merge it? https://github.com/boostorg/mpi/pull/38 It should be safe to merge, and I would really like to see it in 1.64. I'm surprised noone fixed it earlier, actually. Thanks.

2 1

Status of Visual Studio 2017 support
by Mateusz Loskot 22 Feb '17

22 Feb '17

Hi, In the mid of 2016, PR "Add support for Visual Studio 15" [1] was merged into develop and eventually into master branch. Although the patch was released in Boost 1.63.0, the release notes [2] are silent about that update. That is about Boost.Build, which I assume is the first to be updated to support a new toolkit. I haven't checked current commits history of individual libraries. Status of VS2017 support in individual libraries may be at different stages. Could anyone clarify any of these points: - Does Boost.Build in Boost 1.63.0 officially support VS2017? - Is there any schedule to fully support VS2017 in Boost 1.64.0? - Or, is that left at discretion of maintainers of individual libraries and VS2017 support might be reached gradually over several releases instead of in a single shot? [1] https://github.com/boostorg/build/pull/132 [2] http://www.boost.org/users/history/version_1_63_0.html Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

16 46

[config] [atomics] Support for z/OS XL C/C++
by Groke, Paul 21 Feb '17

21 Feb '17

Hi, we're using several Boost libraries in a large cross-platform project. One of the platforms we need to support is z/OS, using the IBM z/OS XL C/C++ compiler (which BTW is a completely different beast from the XL C/C++ compilers for other IBM platforms, which Boost.Config already seems to support). To be able to use Boost we had to write some patches and we'd very much like to contribute them. In more detail: * A minor patch to make the configure script work * Patches to some of the configure tests to fix incorrect feature detections * Compiler-, library- and platform-config header files * A Boost.Atomic implementation * An implementation of Boost.SmartPtr atomic operations This won't result in full support for all Boost libraries, not even close, but it's enough to make an appreciable subset usable on z/OS. I've never contributed code to any open source project so far, so I'd appreciate your help. Where should I start? Do I have to talk to the maintainers of Config/Atomic/SmartPtr? Is there even a maintainer for every specific project? Or should I just fork the Git repos and create pull requests? I'm pretty much lost here, sorry :) Regards, Paul Groke The contents of this e-mail are intended for the named addressee only. It contains information that may be confidential. Unless you are the named addressee or an authorized designee, you may not copy or use it, or disclose it to anyone else. If you received it in error please notify us immediately and then destroy it. Dynatrace Austria GmbH (registration number FN 91482h) is a company registered in Linz whose registered office is at 4040 Linz, Austria, Freistaedterstrasse 313

4 6

Re: [boost] Status of Visual Studio 2017 support
by Nat Goodspeed 20 Feb '17

20 Feb '17

On Feb 20, 2017 5:25 AM, "Olaf van der Spek" <ml(a)vdspek.org> wrote: On Fri, Feb 17, 2017 at 2:57 PM, Nat Goodspeed <nat(a)lindenlab.com> wrote: > In a (non-Boost) project with which I've helped, there's a script that > does the following: > > ... Wouldn't it be much simpler if you let the user pick the right dev environment prompt from the start menu and have all stuff available without having to call extra scripts? It's a command-line build tool. The command-line equivalent to what you suggest is making the user discover, and then type, the correct pathname of the desired VS version.

4 3

Mail List Migration - Update
by Michael Caisse 19 Feb '17

19 Feb '17

The Boost mail lists are now migrated to a new set of servers. This change affected all mail lists and web resources (signing up, changing passwords, moderator access, archives...) that were associated with the domain lists.boost.org . If you are having difficulties, please drop me an email. (Oh the irony) Happy coding! michael -- Michael Caisse Ciere Consulting ciere.com

9 15

Variadic append for std::string
by Olaf van der Spek 19 Feb '17

19 Feb '17

Hi, One frequently needs to append stuff to strings, but the standard way (s += "A" + "B" + to_string(42)) isn't optimal due to temporaries. A variadic append() for std::string seems like the obvious solution. It could support string_view (boost and std), integers, maybe floats but without formatting options.. It could even be extensible by calling append(s, t); append(s, "A", "B", 42); Would this be useful for the Boost String Algo lib? -- Olaf

16 104

Interprocess mutex & condition variable at process termination
by Phil Endecott 18 Feb '17

18 Feb '17

Dear Experts, I've just been surprised by the behaviour of the interprocess mutex and condition variable on abnormal process termination, i.e. they are not automatically released. Google tells me that I'm not the first to be surprised by this; there have been previous posts here, stack overflow questions etc. One often-valid observation is that if a process crashes - or otherwise terminates without executing its destructors - while it holds a lock on a shared data structure then the data is probably now corrupt, so unlocking the mutex that protects it is not very useful. I think there is an important case where that does not apply - when the process that crashes is only reading the shared data. In my case, I had written a "monitor" utility that loops forever, waiting on a shared condition, taking the corresponding mutex, and then dumping the shared data to stdout. I had been running this and stopping it by pressing ctrl-C and it had not occurred to me that this might not work as I expected. My attempt at debugging using this utility was making my problems worse, not better! Modifying this code to run destructors on ctrl-C is non-trivial. I am aware that the SysV shared semaphore is able to undo on process termination (see SEM_UNDO in man semop), and I had assumed that Boost.Interprocess was using this or something like it. I now see that it is using pthreads, which I didn't even realise could work between processes, and I don't think this API has any way to specify process termination behaviour. Anyway, I'd like to suggest that the interprocess docs should make some mention of the behaviour of the synchronisation primitives on process termination, e.g. somewhere near the beginning of http://www.boost.org/doc/libs/1_63_0/doc/html/interprocess/synchronization_… I may now try to implement some primitives that use semop() and unlock automatically. I haven't yet looked at what's involved to implement a condition variable on top of a semaphore, so I may not get very far! Has anyone else ever tried this? Also, I note that Interprocess is using "old style" times, not std::chrono like the std::mutex/condition do. Are there any plans to update this? Thanks, Phil.

5 6

Missing link for Boost.Algorithm documentation
by Alexander Zaitsev 17 Feb '17

17 Feb '17

3 2

Scheduled Outage : Web sites / Trac
by Michael Caisse 17 Feb '17

17 Feb '17

We are planning the final move of services from IU this week. Expect service outages for all web sites including Trac on 17-February-2017 between 16:00 UTC - 00:00 UTC. The mail lists will continue to operate during this time; however, all other sub-domains for boost.org will be affected. Sync'ing bandwidth with IU has been low recently and has caused us to increase the outage window. We will notify these lists when services are available again. Thank you for your patience during the move. -- Michael Caisse Ciere Consulting ciere.com

1 1

Boost.Python sandox or multiple interpreters
by David Bellot 17 Feb '17

17 Feb '17

Hi, I'm using Boost.Python to load and use plugins in Python. Each plugin can define a few functions which are are pre-determined, so that my C++ software knows what to call. However, the mistake I've made was to think that the Python interpreter could be initialized many times, so that each plugins was existing and running into a separate interpreter. It's of course not the case and therefore, each time I load a new plugin, its functions overwrite the functions of the same name from the previous plugin (the one which was loaded just before), and so on. Is there a possibility to either : - have as many independent Python interpreters at the same time ? - or encapsulate each plugin in an independent "environment" ? - or any other solution which would elegantly solve this problem ? :-D Thanks for your help, David

3 6

[trac] how close trac for bug reports
by Oliver Kowalke 17 Feb '17

17 Feb '17

Hello, how can I close boost trac for a specific library? Users should report issues only at github. ty, Oliver

1 0

[teeks] Missing winerror.h for MSVC-9
by Andrey Semashev 17 Feb '17

17 Feb '17

Hi, I see lots of tests failing on teeks99-09b-win2012R2-64on64, MSVC-9.0 because winerror.h is missing. Here's an example: http://www.boost.org/development/tests/develop/developer/output/teeks99-09b… I can see that the file is present in Windows SDK 6.0A, which is supposed to be used with this compiler. The tests are passing on my machine. Could this be a tester configuration issue? Also, all MSVC-15 tests are failing on teeks99-09o-win2012R2-64on64 with the error of 'cl' not being found.

3 14

Functional programming in boost
by Abhishek Kumar 16 Feb '17

16 Feb '17

Hello I am a Computer Science senior from India. I have been doing functional programming for quite some time and have also used C++ for different projects. I recently came across BOOST libraries for supporting functional programming in C++. I want to contribute to one of the BOOST libraries maybe PHOENIX. Are there any open issues or plans in this direction, in which I might help? Thanks Abhishek Kumar

1 0

[release] 1.64.0 deadline for new libraries approaching
by Rene Rivera 16 Feb '17

16 Feb '17

One week from today master will close for commits of new libraries. Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

1 0

[safe_numerics] Review coming in March
by Andrzej Krzemienski 15 Feb '17

15 Feb '17

Hi Everyone, This is to inform you ahead of time that the formal review of Robert Ramey's Safe Numerics library will be held in about two weeks: March 2 - March 11. Boost Numerics is a set of drop-in replacements for the built-in integer types, which make the guarantee that the results of operations are either correct according to the rules of integer arithmetic or report a diagnosable error (rather than offering modulo arithmetic results, or resulting in undefined behavior, or returning incorrect results as in the case of signed vs. unsigned comparisons). The library can be found on GitHub: https://github.com/robertramey/safe_numerics/ Online docs: http://htmlpreview.github.io/?https://github.com/robertramey/safe_numerics/… Even before the formal review starts, you can provide your review on Boost Library Incubator: http://blincubator.com/reviews/?library_id=426 It will also be included in the final verdict. I will be making the official announcement on March 2. Andrzej Krzemienski, review manager.

1 0

Is there any interest in non-owning pointer-like types?
by Joseph Thomson 14 Feb '17

14 Feb '17

For some time, I have been developing a pair of non-owning pointer-like types that I am currently calling `observer_ptr` and `observer`. I had planned to propose their addition to the C++ standard library, but I have been informed by the author of the original `observer_ptr` proposal <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4282.pdf> that the ISO C++ committee has rejected his proposal and made clear that it feels there is no place in the standard library for such types, believing that this role is filled to a satisfactory degree by regular pointers. I wholeheartedly disagree with this assessment, so I am bringing my proposal here instead. The `observer_ptr<T>` class template is a pointer-like type that does not do any resource management, and is intended to be used in place of `T*` wherever `T*` is used as a non-owning reference to an object of type `T`. `observer_ptr<T>` has three main advantages over `T*`: 1. `T&` is implicitly convertible to `observer_ptr<T>` which, unlike `T*`, makes it *type-safe*. `T*` can represent things that are not conceptually objects of type `T`: arrays, strings, iterators. No implicit conversion from `T*` means that these things cannot implicitly convert to `observer_ptr<T>`. Pointers aren't even required to point to valid objects (e.g. a past-the-end iterator). Conversely, in a well-formed program, `T&` is *always* a valid object of type `T`. 2. `observer_ptr<T>` documents its purpose. This is really a side-effect of it being type-safe (a type should have a single, specific purpose), but it's worth mentioning. Conversely, when you see `T*`, it may not be immediately obvious what it represents. 3. `observer_ptr<T>` has a minimal interface, which makes it harder to misuse than `T*`; for example, `observer_ptr<T>` has no pointer arithmetic operators, no array subscript operator, no conversion to `void*`. The `observer<T>` class template is a counterpart to `observer_ptr<T>` that has *no null state*; it cannot be default constructed, constructed from `nullptr_t` or constructed from `T*`, and it does not contextually convert to `bool`. The only way to create an `observer<T>` is from `T&`. This allows a "not null" precondition to be enforced at compile-time, rather than having to worry about pointers being null at run-time. Just to give you an idea of the current syntax, here is a simple tree node type (where the nodes do not own their children) implemented using `observer_ptr` and `observer`: class node { public: node() = default; node(node const&) = delete; node& operator=(node const&) = delete; node(node&&) = delete; node& operator=(node&&) = delete; void set_parent(observer_ptr<node> new_parent) { if (parent) parent->remove_child(*this); parent = new_parent; if (parent) parent->add_child(*this); } observer_ptr<node> get_parent() const { return parent; } size_t get_child_count() const { return children.size(); } observer<node> get_child(size_t index) const { return children[index]; } private: observer_ptr<node> parent; vector<observer<node>> children; void add_child(observer<node> child) { children.push_back(child); } void remove_child(observer<node> child) { children.erase(find(begin(children), end(children), child)); } }; And a contrived usage example: node a, b, c; b.set_parent(a); // conversion from `T&` c.set_parent(b); observer_ptr<node> x = c.get_parent(); if (x) // conversion to `bool` { observer<node> y = x->get_child(0); assert(y == c); // comparison with `T&` y->set_parent(a); b.set_parent(y); // conversion from `observer<T>` to `observer_ptr<T>` } A project with a working implementation <https://github.com/hpesoj/cpp-observer/blob/master/api/observer.hpp> and full test suite <https://github.com/hpesoj/cpp-observer/blob/master/tests/observer_tests.cpp> can be found here <https://github.com/hpesoj/cpp-observer>. Regards, Joseph

16 35

What is http://downloads.sourceforge.net/boost/boost_1_63_0.tar.bz2 ?
by Jonathan Wakely 14 Feb '17

14 Feb '17

The link http://downloads.sourceforge.net/boost/boost_1_63_0.tar.bz2 redirects to http://downloads.sourceforge.net/project/boost/boost/snapshots/master/boost… which seems to be a snapshot from master, and VERY different to the boost_1_63_0 release (which makes it a VERY misleading URL). How often is that snapshot updated? Shouldn't it have a different name if it's not boost_1_63_0.tar.bz2 but some completely different set of sources (which currently don't even build)? The Fedora Linux packages have been using that URL, for several years by the look of things. So I have no idea what arbitrary collection of changes we've been shipping instead of a proper release.

9 21

[test]redefinition of boost::unit_test::ut_detail::auto_test_unit_registrar
by Takatoshi Kondo 14 Feb '17

14 Feb '17

Hello, I'm using Boost.Test. When I define BOOST_AUTO_TEST_SUITE, I got a compile error 'redefinition of boost::unit_test::ut_detail::auto_test_unit_registrar' if the all following conditions are satisfied: 1. The test suite names are the same. 2. BOOST_AUTO_TEST_SUITE are defined in different files. 3. The files are included by one file. 4. BOOST_AUTO_TEST_SUITE are defined at the same line number. For example, main.cpp #define BOOST_TEST_MODULE test #include <boost/test/unit_test.hpp> #include "one.ipp" #include "two.ipp" one.ipp BOOST_AUTO_TEST_SUITE(a) BOOST_AUTO_TEST_CASE(tc1) { } BOOST_AUTO_TEST_SUITE_END() two.ipp BOOST_AUTO_TEST_SUITE(a) BOOST_AUTO_TEST_CASE(tc2) { } BOOST_AUTO_TEST_SUITE_END() Here is a live demo: http://melpon.org/wandbox/permlink/R459VQ6apnQfapyw If I insert a line the top of two.ipp, no errors are occurred. http://melpon.org/wandbox/permlink/jPRTstNDVb7agjXl According to the following document http://www.boost.org/doc/libs/1_63_0/libs/test/doc/html/boost_test/tests_or… "The same test suite can be restarted multiple times inside the same test file or in a different test files." The compile error is caused by the following line: https://github.com/boostorg/test/blob/develop/include/boost/test/unit_test_… If I replace BOOST_JOIN( BOOST_JOIN( test_name, _registrar ), __LINE__ ) \ with BOOST_JOIN( BOOST_JOIN( test_name, _registrar ), __COUNTER__ ) \ , then the error is disappeared. However, __COUNTER__ is not portable. I know that I can compile one.ipp and two.ipp separately, but I also want to have the option that include them from one file. Is there any good way to solve the error? Thanks, Takatoshi Kondo

2 2

Lazy Spirit Generators?
by Christof Donat 14 Feb '17

14 Feb '17

Hi, In a hobby project, I am using Spirit Karma generators. As far as I have understood Spirit Karma, it is not designed to work lazily in the iterator based interface. It takes an output iterator and writes to it until it has finished. What I am thinking of is a kind of generating range. E.g.: for(auto& char: generator_range(double_ << " + " << double_ << "i", context, c.real(), c.imag())) { // do whatever with the single characters returned by the generator } Is there something like that, which I simply have not found? Christof

3 2

Fit - Request for formal review
by Paul Fultz II 13 Feb '17

13 Feb '17

Hi, So I’ve made a lot of updates to the Fit library since last review. There are a few more changes I would like to make, but most of the work has been done. So, I would like to request for a formal review, and get it on the schedule soon. Vicente Botet was the review manager last time, I don’t know if he would be interested in being the review manager again. Is there perhaps someone else that would be interested in being review manager? https://github.com/pfultz2/Fit Thanks, Paul

1 1

boost::aligned_storage is not a POD.
by Vicente J. Botet Escriba 11 Feb '17

11 Feb '17

Hi, boost::aligned_storage is not a POD. I suspect it is because of the declared constructors private: // noncopyable aligned_storage(const aligned_storage&); aligned_storage& operator=(const aligned_storage&); public: // structors aligned_storage() { } ~aligned_storage() { } Was this intentional? Why aligned_storage is not copyable? Best, Vicente

2 2

[exception] error: looser throw specifier
by Niklas Angare 11 Feb '17

11 Feb '17

On QNX 6.6.0 with GCC 4.7.3 and Dinkumware library in -std=gnu++0x mode, I get the following error: ../libs/exception/test/throw_exception_test.cpp:21:1: error: looser throw specifier for 'virtual exception2::~exception2()' In file included from ../libs/exception/test/helper2.hpp:9:0, from ../libs/exception/test/throw_exception_test.cpp:6: ../boost/exception/exception.hpp:303:5: error: overriding 'virtual boost::exception::~exception() throw ()' libs/exception/test/throw_exception_test.cpp has these definitions: struct exception1: std::exception {}; struct exception2: std::exception, boost::exception {}; There is no error for exception1. Is the bug in the Boost library, the test, the compiler or the Dinkumware library? Other regression runners with GCC 4.7 don't get the error. My regression test runner is NA-QNX660-x86 so you can see all details in the result matrix. Regards, Niklas Angare

1 0

Re: [boost] invalid access to stack memory?
by alexc 11 Feb '17

11 Feb '17

Original Message Sender:Bjorn Reese via Boostboost(a)lists.boost.org Recipient:boostboost@lists.boost.org Cc:Bjorn Reesebreese(a)mail1.stofanet.dk Date:Saturday, Feb 11, 2017 19:39 Subject:Re: [boost] invalid access to stack memory? On 02/11/2017 08:47 AM, alexc via Boost wrote: followed detail of the case, an object constructor store this pointer to a static variable. could it be a problem? From a quick look at the code, I do not think that it poses a problem. The idea, as I understand it, is to use RAII to push and pop a "stack frame" (call_stackT::context) onto a thread-local static "stack" (call_stackT::top_.) The context destructor will remove itself from the "stack". Oh, context class “recover” thecall_stackT::top_ indestructor, I miss this in the first place, thank you, Bjorn, it’s a very cool idea to me. _______________________________________________ Unsubscribe other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] invalid access to stack memory?
by Bjorn Reese 11 Feb '17

11 Feb '17

On 02/11/2017 08:47 AM, alexc via Boost wrote: > followed detail of the case, an object constructor store this pointer to a static variable. could it be a problem? From a quick look at the code, I do not think that it poses a problem. The idea, as I understand it, is to use RAII to push and pop a "stack frame" (call_stack<T>::context) onto a thread-local static "stack" (call_stack<T>::top_.) The context destructor will remove itself from the "stack".

1 0

invalid access to stack memory?
by alexc 11 Feb '17

11 Feb '17

Hi all, followed detail of the case, an object constructor store this pointer to a static variable. could it be a problem? detail/call_stack.hpp explicit context(Key* k) : key_(k), next_(call_stackKey, Value::top_) { value_ = reinterpret_castunsigned char*(this); call_stackKey, Value::top_ = this; // == store this to a static variable } detail/impl/strand_service.ipp void strand_service::do_complete(io_service_impl* owner, operation* base, const boost::system::error_code ec, std::size_t /*bytes_transferred*/) { if (owner) { strand_impl* impl = static_caststrand_impl*(base); // Indicate that this strand is executing on the current thread. call_stackstrand_impl::context ctx(impl); // == local variable ctx, its this pointer will be stroed in a static variable. Regards, Alex

1 0

Review Request : Boost.SIMD
by Joel FALCOU 10 Feb '17

10 Feb '17

Can Boost.SIMD please be added to the review queue? Michael Caisse has volunteered to act as the review manager. Boost.SIMD is an efficient modern C++ wrapper for SIMD instructiosn sets and computations that aims at providing a standard way to write code taking advantages of SIMD enabled hardwares. Boost.SIMD repository https://github.com/NumScale/boost.simd Documentation https://developer.numscale.com/boost.simd/documentation/develop/ Thanks in advance Joel Falcou - CTO @ NumScale

6 8

Testing DMARC spam binning
by Niall Douglas 10 Feb '17

10 Feb '17

Dear Boost, You all probably noticed that boost-dev now sends you emails from "Your Name via Boost <boost(a)lists.boost.org>" with your original email listed as CC. This should finally mean that DMARC protected email addresses are no longer flagged as Spam by many email services, including this email from me, as boost-dev is no longer sending email with a protected From: address. The list should be made aware that fixing this has taken nine months or so for good reason. A whole ton of work went into making this happen, not least relocating Boost's mailing list services from wowbagger where it had been for almost forever to new hosting partially donated to us for free. What wasn't obvious here was that there were problems of ownership transfer, arranging service donation and the change over and getting many, many long seized up cogs to turn, ones indeed I have failed to turn in many years of trying myself. The fact it all happened without service interruption is an amazing achievement. I'd like to ask the list to formally thank Michael Caisse and his team of many diligent workers who did all of this just to get mail posted here to not get flagged as Spam (there were other motivating factors too of course, but the Spam issue got the ball rolling). It was an awful lot of work for not a very obvious gain here on boost-dev. So thank you. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

2 1

Re: [boost] Requirements: min and max macros
by Bjorn Reese 07 Feb '17

07 Feb '17

On 02/05/2017 06:15 PM, Vinnie Falco wrote: > From > http://www.boost.org/development/requirements.html#Naming > > "Make sure your code compiles in the presence of the min() and max() > macros. Some platform headers define min() and max()macros which cause > some common C++ constructs to fail to compile. Some simple tricks can > protect your code from inappropriate macro substitution:..." Is this guideline still relevant?

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

[interprocess] Fix doc build ASAP
by Rene Rivera 07 Feb '17

07 Feb '17

This commit < https://github.com/boostorg/interprocess/commit/936afb13f0c106728bcf36c1ce1…> seems to have broken the release archive documentation build: Generating Output File: /home/ubuntu/build/boost/bin.v2/libs/interprocess/doc/docbook/gcc-4.9.2/debug/interprocess.xml /home/ubuntu/boost/libs/interprocess/doc/interprocess.qbk:7421: error: Mismatched [endsect] near column 9. Error: Error count: 1. Please fix ASAP. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

2 1

[GIL] Bringing old bug fixes on development branch into regular boost releases
by Marcel Metz 06 Feb '17

06 Feb '17

Hello boost devs, I'm a user of the Boost.GIL library and maintained a fork inside inside another project because GIL lacked some features at that time this project needs. This GIL fork happened with boost release 1.37. After reviewing the changes recently it turned out that those can be implemented without maintaining a dedicated GIL fork. However when building the project with the upstream GIL library some compiler specific build bugs popped up. It seems like the forked GIL version already had fixes for those whereas the upstream Boost.GIL doesn't. Further investigation showed that some of those were fixed years ago in the GIL development branch, but never made it back into the master branch (and as far as I understand master is used for release tags). All of those were reported: #3908 - using boost::gil fails when upgrading to libpng-1.4.0 #7270 - C++11 narrowing problem in gil #8896 - image_view compile error under clang 3.1 #9517 - boost gil compile error because of type narrowing (dup of #7270) Is it possible for the maintainer to cherry-pick the corresponding commits from development onto master and put them into the next boost release or are there other steps involved that prevent the bug fix inclusion? Regards Marcel

2 1

[Fit] Update: Request for feedback
by Paul Fultz II 06 Feb '17

06 Feb '17

Hi, I have made a lot of updates to the Fit library based on the changes suggested during the review earlier this year. I have also improved the documentation. I have expanded on the introductory materials and have add a lot more cross-referencing. The documentation can be found here: http://fit.readthedocs.io <http://fit.readthedocs.io/> Let me know of any feedback about the library either here on the mailing list or on Github issues. Thanks, Paul

4 9

Requirements: min and max macros
by Vinnie Falco 05 Feb '17

05 Feb '17

From http://www.boost.org/development/requirements.html#Naming "Make sure your code compiles in the presence of the min() and max() macros. Some platform headers define min() and max()macros which cause some common C++ constructs to fail to compile. Some simple tricks can protect your code from inappropriate macro substitution:..." There is one case not addressed. What to do with this: std::min<std::size_t>(a, b); ?

3 2

[build] Pre-built libraries and targets
by Edward Diener 04 Feb '17

04 Feb '17

In a jamfile I have: lib user32 ; lib gdi32 ; exe test1 : main.cpp user32 gdi32 ; According to the Boost Build documentation the 'lib' syntax above refers to pre-built libraries, and not libraries I mean to build as a shared or static library. When I run b2 with a particular toolset, and use the --debug-building option to see what targets are being built, I see results of: Building target '../../../libs/test_local/build/user32'... and Building target '../../../libs/test_local/build/gdi32'... Furthermore the build of the test1.exe does not add the user32 or gdi32 pre-built libraries to the linker command line. Can anyone tell me why Boost Build is attempting to build a target for a library which I specify as a pre-built library ?

1 0

Call for Submissions: International Conference on Information Society (i-Society 2017) || July 17-19, 2017, Dublin, Ireland
by David Brown, i-Society 2016 03 Feb '17

03 Feb '17

1 0

Mail Lists Migrate at 00:00 UTC Feb 3
by Michael Caisse 02 Feb '17

02 Feb '17

The following mail lists will be switched to new infrastructure at 00:00 UTC on February 3rd. There will be a small interruption while the DNS/MX records propagate. * Boost - Boost developers' mailing list * Boost-announce - Boost announce-only mailing list * Boost-bugs - Bugs reported/updated through Boost's Trac * Boost-build - Boost.Build developer's and user's list * Boost-cmake - Discussion of the CMake-based build system for Boost * Boost-commit - Boost Subversion commit messages * Boost-docs - Discussion of Boost Documentation * Boost-Interest - Moderated announcements of interest to the Boost community. * Boost-maint - Boost community maintenance mailing list * Boost-mpi - Discussion of Boost.MPI development * Boost-test - Test list for the boost mailing lists * Boost-Testing - Running Boost regression tests * Boost-users - Boost Users mailing list * Geometry - Boost.Geometry library mailing list * glas - Generic Linear Algebra Software * proto - Discussions about Boost.Proto and DSEL design * threads-devel - Discussions about the boost.thread library * ublas - ublas mailing list -- Michael Caisse Ciere Consulting ciere.com

1 0

[factory][bind] C2664 with MSVC 2015 & 1.63
by Jens Weller 02 Feb '17

02 Feb '17

Hello Boost, I'm having this Problem: http://lists.boost.org/boost-users/2015/04/84176.php That message already describes pretty much what I see, except that I use 1.63 and the latest 2015 VC++. Errormessage: D:\cpp\libraries\boost_1_63_0\boost\bind\bind.hpp:388: error: C2664: 'ListsModuleWidget *boost::factory<ListsModuleWidget *,void,boost::factory_alloc_for_pointee_and_deleter>::operator ()(void) const': cannot convert argument 1 from 'Module *' to 'Module *&' bind.hpp code: > template<class R, class F, class A> R operator()(type<R>, F & f, A & a, long) > { > >>this line return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]); > } Compiler says: ..\..\..\..\cpp\libraries\boost_1_63_0\boost/bind/bind.hpp(388): error C2664: 'ListsModuleWidget *boost::factory<ListsModuleWidget *,void,boost::factory_alloc_for_pointee_and_deleter>::operator ()(void) const': cannot convert argument 1 from 'Module *' to 'Module *&' ..\..\..\..\cpp\libraries\boost_1_63_0\boost/bind/bind.hpp(1342): note: see reference to function template instantiation 'R *boost::_bi::list3<boost::arg<1>,boost::arg<2>,boost::arg<3>>::operator ()<ListsModuleWidget*,F,boost::_bi::rrlist4<A1,A2,A3,A4>>(boost::_bi::type<ListsModuleWidget *>,F &,A &,long)' being compiled with [ R=ListsModuleWidget *, F=boost::factory<ListsModuleWidget *,void,boost::factory_alloc_for_pointee_and_deleter>, A1=Module *, A2=const QString &, A3=const QString &, A4=QWidget *, A=boost::_bi::rrlist4<Module *,const QString &,const QString &,QWidget *> ] cheers, Jens Weller

2 4

[outcome] Feedback on parts A and B of Tutorial mk III requested
by Niall Douglas 02 Feb '17

02 Feb '17

Dear Boost, I am truly hoping that this will be the last time I ask for feedback on Outcome's tutorial as this is the third complete rewrite. Many thanks for all the feedback so far, this Mk. III tutorial wouldn't look like this without all your help. Part A is 100% on pure expected<T, E> as currently before the standards committee. It has nothing to do with Outcome, but places Outcome in context. Part B is a polemic on why people should not use arbitrary type E in expected<T, E> and instead should restrain themselves to either E = std::error_code or E = std::exception_ptr. I'm requesting feedback on parts A and B of the tutorial which I think are mostly complete now. Specific feedback on these topics is particularly welcomed: 1. I've tried to make some of the code examples in Part A less contrived. Are there any obviously specific additional things I can do (note Parts B and C have more realistic programs)? 2. Are you convinced by the end of Part B that using arbitrary types for type E is a bad idea? If not, what did I fail to do in my explanation? Many thanks in advance. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

2 5

filtering_streambuf: Compressing a character buffer
by Adlai Shawareb 02 Feb '17

02 Feb '17

Hi, I have a character buffer ( "buffer" ) of known size ( "size_in_bytes" ), and would like to compress it using gzip_compressor and then get a pointer to the compressed buffer along with the compressed size. I've put together the following, but it says the first counter is 0 and the second counter is 2. Any help that can be offered is appreciated. namespace io = boost::iostreams; boost::asio::streambuf sb; std::ostream os(&sb); os.write( buffer, size_in_bytes ); io::filtering_streambuf<boost::iostreams::output> out; out.push(io::counter()); out.push(io::gzip_compressor()); out.push(io::counter()); out.push(os); io::close(out); // Needed for flushing the data from compressor std::ostream output(&out); // Maybe I can use rdbuf() to get the pointer to the stream?

1 0

[type_erasure] Inefficient extra shared_ptr copy when passing parameter of type _self
by Yuanchen Zhu 01 Feb '17

01 Feb '17

Hi List, I have been using boost::type_erasure a bit. I found that in the case of implementing equality_comparable, when it passes into operator== a placeholder argument corresponding to some any<C, T>, it always wraps it in a param<C, T>, which internally instantiates an any<C, T&>. While this instantiation does not cause the actual content to be copied, it always clone the share_ptr pointing to the dispatch table, causing an extra shared_ptr construct/destruct invocation whenever I do an equality comparison. This source of inefficiency seems unnecessary to me. Is it possible to modify param<C, T> such that it only stores non-ref counted raw reference to the original argument? Of course the functions in type_erasure::detail::access need to be updated accordingly. Will this modification break some grander scheme underlying type_erasure that I am unaware of, being new to the code base? It seems to me that when param<C, T> wraps a temporary, the temporary is guaranteed to live past the lifetime of the invocation. Can people vet this idea before I take a stab at changing the code? Thanks, Yuanchen

1 0

[serialization][uBlas] Serialization still breaking anything that uses uBlas?
by John Maddock 01 Feb '17

01 Feb '17

See for example: http://www.boost.org/development/tests/develop/developer/output/teeks99-02-… I'd really like to get these failures off my radar if possible... Thanks, John.

2 1

[testing] Need optimization help!!!
by Rene Rivera 01 Feb '17

01 Feb '17

If someone is interested in an optimization challenge here's your opportunity. Currently the program(s) that generate the test results take a long time to run. In both the live setup of a 4 core 16 GB ram VM it takes about 40 minutes to generate the reports for master and develop branches. On my 4 core 16 GB ram real hardware SSD HD machine it also takes about 40 minutes. If some brave soul could look into why it's so terribly slow the Boost community would be very grateful. As it would make it possible to move the processing to a CI service and improve results reliability and frequency. Unfortunately the only price I can promise for such a task is to buy you a meal and/or some drinks if I see you :-) If you are interested all that's needed to run the results is: a) A good chunk of disk space.. At least 27GiB. b) A bash shell, and Python, and git, and C++ tools (but you probably already have all that). b) An empty directory to run the reports. c) Download this script < https://github.com/boostorg/regression/blob/develop/reports/src/build_resul… >. d) Comment out the upload commands on lines 220-223. e) Run the script, and wait. And then the fun part of finding out what programs get run and what is slow :-) FYI.. The source for the processing is downloaded by the script. But you can find it here < https://github.com/boostorg/regression/tree/develop/reports>. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

5 10

Re: [boost] Is there any interest in non-owning pointer-like types?
by Joseph Thomson 01 Feb '17

01 Feb '17

On 1 Feb 2017 7:51 p.m., "Olaf van der Spek" <ml(a)vdspek.org> wrote: On Wed, Feb 1, 2017 at 12:39 PM, Oswin Krause <Oswin.Krause(a)ruhr-uni-bochum.de> wrote: > On 2017-02-01 12:02, Olaf van der Spek wrote: >> >> On Wed, Feb 1, 2017 at 11:24 AM, Oswin Krause >> <Oswin.Krause(a)ruhr-uni-bochum.de> wrote: >>> >>> For me, the biggest problem of the proposal is that observer_ptr<T> is >>> implicitely constructed from T&. In my code I often use: >>> >>> Foo a; >>> Bar b(&a);//&a signals that b only references to a, but does not copy it. >>> >>> Now, when I write >>> >>> Bar b(a); //so is a now copied? >>> >>> While the interface is clearer in documentation, the usage is less clear! >> >> >> IMO using pointers instead of references to indicate something isn't >> copied is bad practice.. the language is C++, not C. > > > > This is not a C vs C++ thing. > > But assume it was. How would you indicate that in C++? It should be clear > without looking at the reference whether it is okay for a to go out of scope > before b or not. There's no way to indicate that, AFAIK. The way to indicate it is to require explicit conversion from `T&` to your pointer-like type. `make_observer` can play the role of a type-safe `&`. I would be happy to remove implicit conversion from `T&` if it is agreed to be undesirable. Joseph

1 0

Re: [boost] Boost XML Serialization Stability across library versions
by Adlai Shawareb 01 Feb '17

01 Feb '17

Thanks Robert, Regarding your suggestion to use text serialization. Since, over time, we will be adding and deleting data from the data set that we serialize, would the following be the right approach to managing the changes in the data that is de/serialized. I'm thinking that we would set the BOOST_CLASS_VERSION before de/serializing. { ar & mInt; If(version >= 2) ar & mFloat; If(version >= 3) ar & mInt2; ar & mFloat2; } Regards, Adlai On 1/25/17 12:04:00, Robert Ramey wrote: > Right. No one as under taken that task. Should be fairly straight > forward using spirit v3. > Robert Ramey

2 3

[container] ::flat_map function force_copy break strict-aliasing on gcc < 4.4
by Владислав Щапов 31 Jan '17

31 Jan '17

Hello! On function: template<class D, class S> BOOST_CONTAINER_FORCEINLINE static D force_copy(S s) { D *vp = reinterpret_cast<D *>(&s); return D(*vp); } gcc 4.3.4 (SLE 11) produced wrong code. It seems that the compiler does not create a copy of an object "s" and returns an object of D(). If I change the signature of function on "BOOST_CONTAINER_FORCEINLINE static D force_copy(const S& s)" the code works and the tests pass. But then does not create a copy of an object "s" in a function call. I'm not sure that this change is correct. Is there any other workaround for this problem with a compiler gcc 4.3 or better disable strict-aliasing? -- Best regards, Vladislav

2 2

C++Now 2017 Registration is Open
by Jon Kalb 31 Jan '17

31 Jan '17

Boost Devs, Registration for C++Now 2017 is now open: http://bit.ly/CppNow2017IsOpen The conference will be in Aspen, Colorado from May 15th to 20th. The deadline for submissions is this Friday: http://cppnow.org/2017-conference/announcements/2017/01/06/call-for-submiss… Jon

1 0

[CallableTraits] Still seeking Review Manager
by Barrett Adair 31 Jan '17

31 Jan '17

Hi, I'm still seeking a review manager for my CallableTraits library. I have spent hundreds of hours on this library, most of which went toward documentation and cross-platform testing. I think a small subset of the features in CallableTraits belong in the C++ standard. Occasionally at work, I have wished this were in Boost already. In short, this library eliminates the need to specialize templates for function signatures, and accounts for the *many* corner cases and cross-platform quirks that most users never care to do thoroughly themselves. I have 9 issues remaining on the GitHub page that would be resolved before an eventual acceptance, and I'd like to write some additional tests and documentation, but I think this library is ready for a review manager. Would anyone like to volunteer? https://github.com/badair/callable_traits Thanks, Barrett

1 0

[regression] Are tests not running?
by Andrey Semashev 31 Jan '17

31 Jan '17

Hi, Looking at the regression tests table, it looks like the latest regression tests were run last Saturday, November 26th. It seems inlikely that all testers decided to stop running 4 days ago or are running tests for that long. Is there some problem with the regression infrastructure?

6 16

Re: [boost] [sort] pdqsort
by Orson Peters 30 Jan '17

30 Jan '17

Hi, Orson here, I'm the original author of pdqsort. As discussed in this long github issue ( https://github.com/boostorg/sort/issues/11) I have full copyright on the pdqsort implementation (which is freely available under the zlib license on https://github.com/orlp/pdqsort) and am willing to provide it to Boost free of charge under the Boost license. @Marc Glisse, since your 2015 experiment the code has changed, and pdqsort now uses a technique called block quicksort. It's substantially faster for branchless comparisons (50-80%), but it seems that on some systems it also give significant (5-15%) slowdowns for branchful code. I will revert pdqsort's default implementation to the old version, except when the passed in type is built-in, and the comparison operator is std::less / std::greater, then I will use the branchless code. I will provide the branchless code explicitly as well, under a different function name, for experienced users that know their comparison function is branchless. The old implementation was never slower than std::sort in my experiments, for the record. If any of you have further questions, please do let me know.

2 1

[rational] Compilation issues on VS2013+
by Raffi Enficiaud 30 Jan '17

30 Jan '17

Hi Boost, I am having the following issues when compiling boost.test on develop: http://www.boost.org/development/tests/develop/developer/output/teeks99-09e… It seems that the problem is related to rational (worked for the 1.63 release), but I am not sure. Thanks! Raffi

1 0

[Beast] WebSocket is now feature-complete!
by Vinnie Falco 29 Jan '17

29 Jan '17

I'm pleased to announce that Beast 1.0.0-b24 has been pushed to the master branch, making Beast's WebSocket implementation feature complete with respect to RFC 6455 ("The WebSocket Protocol") and draft-ietf-hybi-permessage-compression-28 ("Compression Extensions for WebSocket). The latest version adds support for the "permessage-deflate" extension, which allows WebSocket messages to be compressed using the deflate algorithm. Beast comes with a header-only port of ZLib to modern C++11, no additional library is necessary to use the extension. The library now passes every test in the Autobahn TestSuite including compression tests. Official Repository https://github.com/vinniefalco/Beast/ Documentation http://vinniefalco.github.io/beast/index.html Autobahn TestSuite results http://vinniefalco.github.io/autobahn/index.html Thanks! -- Follow me on Github: https://github.com/vinniefalco

3 2

[Boost.Lockfree] Interest in a ringbuffer class
by Raphaël Londeix 27 Jan '17

27 Jan '17

Hi everyone, Is there any interest in having a lower level ringbuffer type in Boost.Lockfree ? The containers provided today in the library can only store homogeneous types of fixed size. At work, we have refined many implementations of ringbuffer classes that allow one to push/pop raw buffers. Before investing some time into a pull request, I wanted to know if there's some interest in such a type. The interface looks like this: template<typename Self, typename... Policies> class basic_ringbuffer { public: typedef ... buffer; public: buffer* start_write(size_t); void commit_write(size_t); void commit_write(buffer const*); buffer const* start_read(); void commit_read(size_t); void commit_read(buffer const*); public: void reader_reset(); void writer_reset(); private: buffer* _ring() { return static_cast<Self>(*this).ring(); } }; Of course, these are only the lowest level methods, one could implement push()/pop() or other higher level methods. Beyond the fact that this API provides by default zero-copy semantics, this interface is also agnostic to the actual owner of the memory, which allow users to implement custom ringbuffers easily (shared memory, mmap trick to map the beginning at the end, etc.), for example: class custom_ringbuffer : basic_ringbuffer<custom_ringbuffer, SomePolicies...> { buffer* ring() { return some_memory; } }; The usage would look like: custom_ringbuffer rb; // the write side if (auto buf = rb.start_write(100)) { memcpy(buf.data, "some data", 9); rb.commit_write(9); } // the read side if (auto buf = rb.start_read()) { std::cout << std::string_view(buf.data, buf.size) << std::endl; rb.commit_read(buf); } What do you think ? Did I miss something in boost itself ? Should I give a more complete overview of the API ? Cheers, -- Raphaël Londeix http://hotgloupi.fr

6 13

[outcome] Requesting second pre-review of Boost.Outcome tutorial
by Niall Douglas 27 Jan '17

27 Jan '17

Dear Boost, Last November you gave me some valuable feedback on rewriting the tutorial for Boost.Outcome, a C++ 14 library providing a factory and family of policy driven lightweight monadic value-or-error transports. I recently came out of employment contract and so have had the time to rewrite Outcome's Tutorial (anyone interested in employing a remote working C++ consultant please do get in contact). I'd appreciate feedback on https://ned14.github.io/boost.outcome/: 1. Is this rewritten tutorial too simple, too detailed or about right? 2. Do you feel you could use Outcome in your own code without difficulty after reading it? If not, what information is missing? 3. Are you persuaded of the merits of using Outcome after reading it? If not, what else do I need to say? The first FOUR sections at https://ned14.github.io/boost.outcome/ have been rewritten by me to hopefully reflect the feedback you gave me last November, so these have been refactored so far: * Description, Prerequisites and Support * Installing, building and testing Outcome * Quick start for the expert * Tutorial The package repo install methods haven't been implemented yet, these are marked in the docs as todo. These sections have yet to be refactored: * Frequently Asked Questions * Advanced usage: Outcome as a Monad * Outcome and the upcoming std::expected<T, E> Many thanks in advance for any feedback received. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

7 20

Why is this message in Spam?
by Olaf van der Spek 26 Jan '17

26 Jan '17

Hi, > Why is this message in Spam? It has a from address in microsoft.com but has failed microsoft.com's required tests for authentication. Learn more I think this list isn't configured properly.. and this causes some messages to end up in Spam consistently.. Who's responsible for the mailing list infrastructure? Gr, -- Olaf

7 12

[sort] pdqsort
by Steven Ross 26 Jan '17

26 Jan '17

I've been reviewing a proposed addition to Boost.Sort called pdqsort. When using a general-case partitioning algorithm, it performs comparably to std::sort in my testing (Windows and Linux). When used as a replacement for the std::sort fallback in spreadsort, using a branch-reducing optimization it is ~20% faster on ints and floats, and ~40% slower on strings. The concerning part is that any comparison operator that involves a branch may have a comparable slowdown to the string case. pdqsort is also significantly faster than std::sort on mostly-sorted data and some other (relatively common) special cases. This makes little difference when used as a fallback by spreadsort, but does make a difference when used on its own. I see these possible things to do with pdqsort: 1) Reject it completely as too similar to std::sort, which is already highly optimized. 2) Add it as another optional library in the Boost.Sort library. 3) Add it to Boost.Sort, and only use it as a fallback for ints and floats. 4) Add it to Boost.Sort, use it as a fallback for all of spreadsort, and have pdqsort itself only use its branch-reduction optimization on ints and floats. 5) #4, except eliminate the branch-reduction optimization completely from pdqsort for simplicity. Does anyone have a strong preference, advice, or comments on how they use Boost.Sort? Should I run a mini-review for pdqsort?

5 9

bad include guards
by Steven Watanabe 26 Jan '17

26 Jan '17

AMDG The following pairs of files have identical include guards ./boost/concept_check/general.hpp ./boost/concept/detail/msvc.hpp ./boost/concept_check/msvc.hpp ./boost/concept/detail/msvc.hpp ./boost/filesystem/cerrno.hpp ./boost/cerrno.hpp ./boost/interprocess/containers/tree.hpp ./boost/interprocess/containers/detail/tree.hpp ./boost/mpl/min_max.hpp ./boost/mpl/max.hpp ./boost/mpl/vector/aux_/front.hpp ./boost/mpl/list/aux_/front.hpp ./boost/multi_index/identity_fwd.hpp ./boost/multi_index/identity.hpp ./boost/python/pointee.hpp ./boost/python/detail/pointee.hpp ./boost/spirit/phoenix/closures.hpp ./boost/lambda/closures.hpp ./boost/xpressive/proto/v1_/proto_typeof.hpp ./boost/xpressive/proto/proto_typeof.hpp ./libs/config/test/boost_no_dep_nested_class.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_mem_templates.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_std_allocator.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/conversion/test.hpp ./libs/any/test.hpp ./libs/interprocess/example/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/expand_bwd_test_template.hpp ./libs/interprocess/test/allocation_test_template.hpp ./libs/interprocess/test/printcontainer.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/iostreams/test/detail/utf8_codecvt_facet.hpp ./boost/detail/utf8_codecvt_facet.hpp ./libs/regex/test/regress/test_regex_search.hpp ./libs/regex/test/regress/test_partial_match.hpp ./libs/serialization/test/C.hpp ./libs/serialization/test/A.hpp ./libs/xpressive/perf/regex_comparison.hpp ./libs/regex/performance/regex_comparison.hpp ./tools/inspect/time_string.hpp ./tools/common/time_string.hpp In Christ, Steven Watanabe

5 8

Boost XML Serialization Stability across library versions
by Adlai Shawareb 26 Jan '17

26 Jan '17

Hi, We want to generate an Serialized XML archive now, and be able to deserialize it and get the same data it in the future. Is Boost XML Serialization guaranteed to be compatible across versions of the library? The XML serialized archive would be stored in a memory chip and, in the future, read back and deserialized. I don't believe that would impact the answer, but want to offer that. Adlai

6 12

Moving away from SourceForge
by Louis Dionne 26 Jan '17

26 Jan '17

Hi, I know this has been discussed in the past, but I would like to revive the discussion about moving away from SourceForge as Boosts' release hosting provider. SourceForge has at least the following issues: - There is no way of controlling the format when downloading an archive of the latest release. This can break people that rely on this in their CI scripts. For example, Metabench's[1] CI was broken for a while when the archive changed from .bz2 to .zip. - SourceForge has been in the middle of some controversies[2]. - Their reliability has not been so great. In the past year, I've had quite a few of my Travis jobs fail due to SourceForge being unresponsive. There are most likely other concerns, but these are the ones that really bite me as a user right now. Am I the only one? If there's some push to do the move, the two main candidates I see would be - GitHub's native hosting - Bintray Thoughts? Louis [1]: https://github.com/ldionne/metabench [2]: https://en.wikipedia.org/wiki/SourceForge#Controversies -- View this message in context: http://boost.2283326.n4.nabble.com/Moving-away-from-SourceForge-tp4691184.h… Sent from the Boost - Dev mailing list archive at Nabble.com.

9 17

Boost.Endian - endian_buffer requirements
by Vicente J. Botet Escriba 26 Jan '17

26 Jan '17

Hi, I wanted to put an Int wrapper inside a endian_buffer and I have some compiler errors depending on whether it is aligned ort not. http://melpon.org/wandbox/permlink/k52wH2A7yagL2vMP I was expecting that the endian_buffer would make abstraction of the wrapped type and consider it just as a sequence of bytes, but it seems that it instead works only for some builtin integral. Am I missing something? Was this restriction intended? Could this restriction be removed and if yes, how? Best, Vicente

1 2

[program_options] implicit value and non-adjacent tokens
by Vladimir Prus 25 Jan '17

25 Jan '17

Hi, some time ago, program_options was modified so that options with implicit value would only take value from the same token. Previously, one could have: ./program -a foo -b # uses 'foo' as value for 'a' ./program -a -b # uses some default value for 'a' ./program -b # has no value for 'a' Now, the first syntax interprets 'foo' as positional option, and one has two write ./program -a=foo Ever since, I hear concerns from users about this behavior. Maybe not very loud, but quite consistent. Maybe, the new behavior is not very good, indeed, because it now mixes syntax matter (whether value is in the same token) with semantic matter (whether an option has implied value). I am considering reverting this change for next version of Boost. Does anybody have opinions either way? Thanks, Volodya

3 5

C++Now / BoostCon 2017 -- Call For Submissions
by Michael Caisse 23 Jan '17

23 Jan '17

This is a quick reminder that the C++Now 2017 Call For Submissions is *open*. All submissions must be made by February 3rd. For more information, see http://cppnow.org/

1 0

boost build with emscripten
by Emil Dotchevski 23 Jan '17

23 Jan '17

I see that there is now emscripten support in boost build but it doesn't seem to work for me. After installing emscripten on Windows, adding using emscripten ; in my site-config.jam, then running b2 from the emscripten command prompt, I get the output below. Any help greatly appreciated! Emil boost-build/src/build\property.jam:743: in class(a)property-map.find from module object(property-map)@26 error: Ambiguous key boost-build/src/build\type.jam:333: in generated-target-ps from module type boost-build/src/build\type.jam:270: in type.generated-target-suffix from module type boost-build/src/build\virtual-target.jam:509: in virtual-target.add-prefix-and-suffix from module virtual-target boost-build/src/build\virtual-target.jam:468: in _adjust-name from module object(file-target)@3764 boost-build/src/build\virtual-target.jam:253: in abstract-file-target.__init__ from module object(file-target)@3764 boost-build/src/build\virtual-target.jam:561: in class(a)file-target.__init__ from module object(file-target)@3764 boost-build/src/kernel\class.jam:90: in class.new from module class boost-build/src/build\generators.jam:558: in generated-targets from module object(C-compiling-generator)@138 boost-build/src/build\generators.jam:453: in construct-result from module object(C-compiling-generator)@138 boost-build/src/build\generators.jam:412: in run-really from module object(C-compiling-generator)@138 boost-build/src/build\generators.jam:386: in class(a)generator.run from module object(C-compiling-generator)@138 boost-build/src/build\generators.jam:994: in try-one-generator-really from module generators boost-build/src/build\generators.jam:1056: in try-one-generator from module generators boost-build/src/build\generators.jam:1294: in construct-really from module generators boost-build/src/build\generators.jam:1378: in generators.construct from module generators boost-build/src/build\targets.jam:1553: in construct from module object(typed-target)@3554 boost-build/src/build\targets.jam:1353: in class(a)basic-target.generate from module object(typed-target)@3554 boost-build/src/build\targets.jam:774: in generate-really from module object(main-target)@3735 boost-build/src/build\targets.jam:746: in class(a)main-target.generate from module object(main-target)@3735 boost-build/src/build\targets.jam:895: in targets.generate-from-reference from module targets boost-build/src/build\targets.jam:1266: in generate-dependencies from module object(typed-target)@2173 boost-build/src/build\targets.jam:1323: in class(a)basic-target.generate from module object(typed-target)@2173 boost-build/src/build\targets.jam:774: in generate-really from module object(main-target)@2988 boost-build/src/build\targets.jam:746: in class(a)main-target.generate from module object(main-target)@2988 boost-build/src\build-system.jam:714: in load from module build-system NT\..\..\munch\boost-build\src\kernel\modules.jam:295: in import from module modules NT\..\..\munch\boost-build\src\kernel\bootstrap.jam:139: in boost-build from module NT\..\..\munch\boost-build.jam:6: in module scope from module

3 8

Re: [boost] [interprocess] Getting boot-up time is unreliable on Windows
by Ion Gaztañaga 23 Jan '17

23 Jan '17

On 22/12/2016 10:01, Thomas Dahms wrote: > Dear developers, dear Ion, > > We are experiencing issues on Windows where boost::interprocess relies > on a certain event in the system event log to get the system's boot-up > time. This has proven to be unreliable, because that event is not always > present in the log. In that case, initialization of boost::interprocess > fails. > Several bug reports exist for that issue, e.g. [1, 2]. > > Report [1] contains a proposed fix to use GetTickCount64() and there is > an open PR with an alternative fix to fall back to WMI mechanisms [3]. I > understand that the fix [1] would need some polishing, because > GetTickCount64() is not available in pre-Vista. > > Nevertheless, both proposed fixes have been uncommented and unconsidered > for a while now. Is there any chance that the maintainers could look > into this? Thanks for the ping. I don't think GetTickCount64 is very reliable, as other methods also have problems with time correction, hibernation, fast bootup, etc. In [1] one the last bootup log is lost new processes won't be able to communicate with others. The same happens with [3] In http://www.boost.org/doc/libs/1_63_0/doc/html/interprocess/acknowledgements… there are some instructions to give up on kernel persistence and define the directory at compile time or run-time. This is the best workaround so far. I've trying to find a solution with no luck. I tried: HKLM\SYSTEM\CurrentControlSet\Control\Session Manager\Memory Management\PrefetchParameters\BootId in modern Windows systems but hybrid shutdown (default since Windows 8) does not seem to update it as kernel is suspended. Searching for a unique bootup id in windows that does not suffer when hibernating or correcting the RTC is really complicated. Any suggestion welcomed. Best, Ion

2 1

[serialization][test] failures in serialization causing regressions
by Barend Gehrels 21 Jan '17

21 Jan '17

Hi, The regression matrix in develop of Boost.Geometry contains many new compilation failures due to: 1) : D:\t08\run\boost_root\boost/serialization/array.hpp(25) : error C2039: 'array' : is not a member of 'std' 2): ../boost/numeric/ublas/storage.hpp: In member function ???void boost::numeric::ublas::unbounded_array<T, ALLOC>::serialize(Archive&, unsigned int)???: ../boost/numeric/ublas/storage.hpp:331:18: error: ???make_array??? is not a member of ???boost::serialization??? ar & serialization::make_array(data_, s);and a The master is still OK. Can this be solved? Regards, Barend

6 9

Boost Cmake Modules
by Paul Fultz II 20 Jan '17

20 Jan '17

Hi All, So I would like to start work with adding support for cmake to boost libraries. To make the boilerplate needed to write some of the cmake, I wrote BCM(Boost Cmake Modules), here: https://boost-cmake.github.io/bcm/doc/html/ Of course, the documentation is still a WIP. The core part is bcm_boost_package. So to write cmake for a library, you would just write something like this: bcm_boost_package(core VERSION 1.0 DEPENDS config ) It also provides a mechanism to add tests as well. My goal at first would be to update libraries on per-module level(one PR at a time). So to use cmake, the user wold build and install each library individually with cmake. Later, we can update the cmake modules to support superproject building(which may be necessary for libraries that have circular dependencies). Right now, there are no modules for building documentation. This can be added later, as well. So does anyone have any feedback on this setup? If you had ideas, or would like to help update boost libraries, contributions are welcome. Thanks, Paul

6 13

Testing issues
by Belcourt, Kenneth 19 Jan '17

19 Jan '17

Hi, Tests seem to have stopped cycling, and I see this error in the nightly testing output: error: Cannot create link ../../../boost_root/boost/process.hpp to ../../../boost_root/libs/process/include/boost/process.hpp. error: Link previously defined to another file, ../../../boost_root/libs/proccess/include/boost/process.hpp. # Searching for "process_jam_log" in "/scratch/kbelco/boost_testing/boost_regression/stage/bin"... Traceback (most recent call last): File "run.py", line 71, in <module> runner(root) File "/scratch/kbelco/boost_testing/boost_regression_src/regression.py", line 287, in __init__ self.main() File "/scratch/kbelco/boost_testing/boost_regression_src/regression.py", line 624, in main getattr(self,action_m)() File "/scratch/kbelco/boost_testing/boost_regression_src/regression.py", line 581, in command_regression self.command_setup() File "/scratch/kbelco/boost_testing/boost_regression_src/regression.py", line 352, in command_setup self.build_if_needed(self.process_jam_log,self.pjl_toolset) File "/scratch/kbelco/boost_testing/boost_regression_src/regression.py", line 715, in build_if_needed tool[ 'build_path' ] = self.tool_path( tool ) File "/scratch/kbelco/boost_testing/boost_regression_src/regression.py", line 740, in tool_path , '\n'.join( [ name_or_spec[ 'path' ], build_dir ] ) Exception: Cannot find "process_jam_log" in any of the following locations: Does this problem look familiar to anyone? —- Noel

3 3

[asio] doc format changed?
by Vinnie Falco 19 Jan '17

19 Jan '17

Why did the formatting for Boost.Asio documentation change from 1.61 to 1.63? Compare: http://www.boost.org/doc/libs/1_61_0/doc/html/boost_asio.html http://www.boost.org/doc/libs/1_63_0/doc/html/boost_asio.html This looks like it was unintended, and its screwing up search engines (try searching for "Boost Asio 1.63.0 Reference" -- Follow me on Github: https://github.com/vinniefalco

4 9

[Interprocess] move semantics for intrusive_ptr
by Mikolaj Krzewicki 19 Jan '17

19 Jan '17

Dear all, would it be possible to add the rvalue operators to interprocess::intrusive_ptr akin to what is already available in "regular" boost::intrusive_ptr: // Move support #if !defined( BOOST_NO_CXX11_RVALUE_REFERENCES ) intrusive_ptr(intrusive_ptr && rhs) BOOST_NOEXCEPT : px( rhs.px ) { rhs.px = 0; } intrusive_ptr & operator=(intrusive_ptr && rhs) BOOST_NOEXCEPT { this_type( static_cast< intrusive_ptr && >( rhs ) ).swap(*this); return *this; } #endif many thanks, Mikolaj

2 1

[outcome] "sea of noexcept, islands of throwing"
by Andrzej Krzemienski 18 Jan '17

18 Jan '17

Niall, I moved this to another thread, as I believe it is quite independent of the documentation review. I am trying to understand the concept of "sea of noexcept, islands of throwing", and its significance. First, is this programming technique the primary motivation for Boost.Outcome? In the docs, I only saw a small mention of it, but from your replies it looks like this is an important part of the library. But I might be wrong. This "sea and islands" are quite similar to what is described in P0364R0 ("Report on Exception Handling Lite (Disappointment) from SG14"). The authors argue that if the exception control flow is indicated explicitly, the compiler has a better chance of performing optimizations. I understand that your goal (with the Outcome library) is to offer something more modest, but implementable in C++. You are saying, that the C++ compiler can implement similar optimizations, provided that all the try-catch-throw flows are confined to one translation unit. Did I get it right? The authors of P0364R0 claim that in some business domains, like video games, if you encounter a failure to acquire resources, you might as well terminate the program. For this reason RAII is not really that important there: you want to shut down the app rather than clean up and continue. Is it also what you are saying? Do you also intend to support something like 'panic mode' in Rust? I do not know Rust, but I understand that this 'panic mode' is shut down the program but with resource cleanup. Sorry, my questions are quite random. But I am trying to understand the idea. Regards, &rzej;

3 7

Generating Boost documentation with pandoc
by Vinícius dos Santos Oliveira 18 Jan '17

18 Jan '17

Has anyone tried to generate Boost-styled documentation using pandoc? I never fully liked PDF documentation because I never actually print documentation. However, a few weeks ago I got an ebook reader and I've been fascinated by the ePUB format. I'm using it to read even the IETF's RFCs and it's very pleasant. I'm using ePUB to read files even on my usual laptop. Anyway, I was wondering how nice would be to have an ePUB file containing the whole Boost documentation. pandoc has docbook support as one of its input formats and is capable of generating great ePUB output. -- Vinícius dos Santos Oliveira https://vinipsmaker.github.io/

7 27

[outcome] Added LEWG expected<T, E> implementation, what about the tutorial?
by Niall Douglas 17 Jan '17

17 Jan '17

Quite a bit of feedback from here, from SG14 and from Reddit expressed disappointment that Outcome doesn't implement the LEWG expected<T, E>. basic_monad makes implementing a fully compliant expected<T, E> just a few hours of work, so I went ahead and added one today and you can see its reference docs at https://ned14.github.io/boost.outcome/group__expected.html. These are the known deviations from the LEWG proposal: * P0323R1 doesn't yet specify what will be done if you try accessing an expected which is valueless due to exception. We throw a bad_expected_access<void> in this situation as that seemed sensible. If the LEWG proposal decides on something different, this implementation will change to track the LEWG proposal. * unexpected_type<E> is implemented as an expected<void, E> and it lets the basic_monad machinery do the implicit conversion to some expected<T, E>. * Types T and E cannot be constructible into one another. * expected<T, E> defaults E to error_code_extended. If you don't like this, predefine the BOOST_OUTCOME_EXPECTED_DEFAULT_ERROR_TYPE macro. * The ordering operators are not implemented due to https://akrzemi1.wordpress.com/2014/12/02/a-gotcha-with-optional/ So now you get in Outcome expected<T, E>; option<T>, result<T> and outcome<T>. And the Expected implementation ought to be drop in compatible with any future C++ 20 standard. How would people prefer the Outcome tutorial to now go? Should it mention expected<T, E> at all? Or should it get its own tutorial page (which will look very similar to the tutorial for result<T>). Which order should they be in? Is expected<T, E> easier than outcomes or the other way round? Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 0

docs for hana broken on webpage (boost 1.63)
by Hans Dembinski 17 Jan '17

17 Jan '17

Hi, the current docs for Hana are still broken: http://www.boost.org/doc/libs/1_63_0/libs/hana/doc/html/index.html yields "404 Not Found". Best regards, Hans

5 8

[function] Problem with simple pointer to function
by Fu ji 17 Jan '17

17 Jan '17

Hello all, I have a problem with boost::function, when I try to assign function to pointer I have a crash. It is simple void function(); boost::function <void (void)> m_Wakeup; and the code where crush occurs looks like: Wakeup = &function; Here is also the dump: Program terminated with signal 6, Aborted. *#0 0x03c4a092 in _dl_start () from /lib/ld-linux.so.2* *#0 0x03c4a092 in _dl_start () from /lib/ld-linux.so.2* *#1 0x03d0eca5 in raise () from /opt/vmware/cimpdk-6.0.0-2768847/debug/build-3825889/lib/libc.so.6* *#2 0x03d104e3 in abort () from /opt/vmware/cimpdk-6.0.0-2768847/debug/build-3825889/lib/libc.so.6* *#3 0x03ca2aec in handleSigSegv () from /opt/vmware/cimpdk-6.0.0-2768847/debug/build-3825889/usr/lib/libsfcBrokerCore.so.0* *#4 0x00310002 in ?? ()* *#5 0x025c060a in move_assign () at /workspace/raid0/src/boost/function/function_template.hpp:998* *#6 swap () at /workspace/raid0/src/boost/function/function_template.hpp:870* *#7 operator=<void (*)()> () at /workspace/raid0/src/boost/function/function_template.hpp:1126* *#8 create_interface () at /workspace/raid0/src/CppWrapper.cpp:298* Do anyone have a clue what was wrong ? Best regards

2 2

Interest in updated expression template library?
by Zach Laine 17 Jan '17

17 Jan '17

I'm trying to gauge interest in submitting a library to the review queue, It's an expression template library called Yap using C++14 and C++17 features, built on top of Hana. It does not work quite the same as Proto, though of course it covers the same problem domain. My goal for the library was to cover the Proto functionality (while allowing the user to write less code than she would have had to with Proto) plus more functionality made easier by the new language features. In the examples you will find nearly all of the Proto examples reproduced, each in a-bit-less to dramatically-less code. The only Proto examples that were left out were ones that are now trivial using Yap due to differences in design. Online docs: https://tzlaine.github.io/yap GiHub page: https://github.com/tzlaine/yap Zach

7 32

BGL Algo Contribution
by Robert R. McCune 17 Jan '17

17 Jan '17

Hello, I'd like to contribute to the Boost Graph Library I've written code for Lexicographic Breadth-First Search (LexBFS) How may I best contribute? Thanks, Ryan

2 1

Re: [boost] Boost 1.64 release date
by Rene Rivera 16 Jan '17

16 Jan '17

On Tue, Jan 10, 2017 at 4:16 AM, Raffi Enficiaud < raffi.enficiaud(a)mines-paris.org> wrote: > Dear all, > > I would like to know in advance (approximately) the release date of 1.64. > > Would it be possible to date of the next release at each new release? > Release Dates Spring release on the second Wednesday of April. Summer release on the second Wednesday of August. Fall/Winter release on the second Wednesday of December. <https://svn.boost.org/trac/boost/wiki/ReleaseSchedule> -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

5 8

[SmartPtr] alternative to enable_shared_from_this
by Roberto Hinz 16 Jan '17

16 Jan '17

Dear Boost Community, I've been following this list for a time with the desire of contributing to Boost. It seems to me a good idea to start with small and easy to review proposals, before attempting anything big. So my first shot is shared_handle class, an alternative to enable_shared_from_this that doesn't suffer from multiple inheritance issues. It also provides the capability of instantiating a shared_ptr to a member object. doc: https://robhz786.github.io/smart_ptr/shared_handle.html source: https://github.com/boostorg/smart_ptr/compare/develop... robhz786:develop Unfortunately, the implementation produces at least one regression: clang 3.1 crashes when it compiles cpp11_pointer_cast_test.cpp with -std=c++11. There may be others since I couldn't test in all compilers used in the regression tests. Nevertheless, is there any interest? Kind regards, Roberto Hinz

9 11

Logging Documentation issue
by jack nade 13 Jan '17

13 Jan '17

There is no visible Design Figure in the Design Overview at http://www.boost.org/doc/libs/1_63_0/libs/log/doc/html/log/design.html using Chrome or IE. The Design Overview refers to it 4 times.

3 3

shutdown ticket-system on svn.boost.org
by Oliver Kowalke 13 Jan '17

13 Jan '17

Hi, I encountered that the ticket system at svn.boost.org is not up-to-date: components coroutine2 and fiber are missing. At least the reports created for coroutine2 and fiber do not know the components (not in drop-down list). I would vote for shutdown of the ticket-system in favour of github - for me it makes no sense to manage two bug reporting systems. best regards, Oliver

9 19

Stringify
by Olaf van der Spek 13 Jan '17

13 Jan '17

On Wed, Jan 11, 2017 at 8:03 PM, Roberto Hinz <robhz786(a)gmail.com> wrote: > On Wed, Jan 11, 2017 at 3:40 PM, Roberto Hinz <robhz786(a)gmail.com> wrote: > > > > > Hi, > > > > I've been working in a format library that contains a function template > > called appendf that can do this: > > > > std::string str("blabla"); > > boost::stringify::appendf(str) () (" AAA ", 25, " BBB ", {255, "x"}); > > assert(str == "blabla AAA 25 BBB ff"); // ( 255 formated in > > hexadecimal ) > > > > This library - I call it Boost.Stringify - is in very early stage of > > development and I though it would be to premature to mention it now. But > > given the repercussion in this thread so far, I changed my mind. So I > will > > soon publish it in github and I will start to write a brief documentation > > so that I can soon present here to gauge interest. > Hi, I think your library deserves it's own thread. ;) How does it compare to for example fmtlib? Gr, Olaf

2 1

gregorian::date limited to years 1400 - 9999
by Viacheslav Usov 12 Jan '17

12 Jan '17

Conceptual question: why is the Gregorian calendar's time range limited to years 1400 - 9999? If this or any of the below has already discussed in some public forum (which I have failed to found, gmane's rebuild being possibly the culprit), kindly point me it to it. I am specifically interested in 1400. It seems completely arbitrary to me. It predates the time the calendar was introduced by almost two centuries, so that cannot be the reason why it cannot support earlier times. ISO 8601 allows the entire 0 - 9999 range, even though dates earlier than 1582-10-15 are subject to an agreement among the parties involved. Extending the proleptic Gregorian calendar all the way back to year 0 seems like one of the very few things that make sense. So my question is, is there any technical problem in supporting the entire 0 - 9999 range? If not, then my next question would be, what else would speak against supporting the 0 - 9999 range? If you expect some compatibility could be broken by that, then perhaps the low end could become a template parameter with the default at 1400? Cheers, V.

5 7

Tagged pointer library?
by Hans Dembinski 11 Jan '17

11 Jan '17

Hi all, I recently learned about tagged pointers, https://en.m.wikipedia.org/wiki/Tagged_pointer. Over the weekend, I was working on a tiny_string implementation which has a width of only one pointer. Essentially it's a null-terminated char* array managed by std::unique_ptr. On my system, std::string is four times larger (probably 8 byte for the pointer, 8 byte for the length, 8 byte for the allocator and 8 byte for … good measure?). With a tagged pointer, I could even implement a small-string optimisation in that tiny_string, by storing small strings with up to 7 bytes in the memory that otherwise holds the address to the char* array. The tag then allows you to discriminate between the two uses of the memory. You may rightfully question whether it is really practical to do this, but it is certainly one possible application of a tagged pointer. Looking into boost, I found that the lockfree library has a tagged pointer implementation in its "detail" namespace. The implementation is nice, because it falls back to a safe version with a separate tag field on systems which do not follow the required alignment conventions. Wouldn't it make sense to make the tagged pointer accessible by users, i.e. place it in a separate library (or in the existing smart_ptr library)? Best regards, Hans

3 3

tensor library
by Paulo Pereira 09 Jan '17

09 Jan '17

Hello everyone, I am new in the community. I would like to ask, how interesting would be to have in boost a new container with multiple indices (tensor) using variadic templates. I know that Boost.MultiArray library already exists in boost. However I think it does not fulfill the readability and friendliness of something like: newlib::tensor<3,double> t(2,2,3); t(0,0,0)=1; also with extra possibilities similar to Matlab/Octave t(newlib::all,1)=0; I would also like to add mathematical operations t1=t2+t3; using lazy evaluation like in armadillo package or in the David Abrahams and Aleksey Gurtovoy book (C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond). I fell that something similar to this is very important for numerical calculations and somehow it is not a standard in C++ (maybe I am missing something). Best regards, Paulo

4 3

Interested in contributing
by vivekroyandroid＠gmail.com 09 Jan '17

09 Jan '17

Sir, I would like to contribute in whichever way possible. I have a decent amount of knowledge in C/C++, but I am new to contributing to open-source. If someone might guide me and tell me how to proceed, I would appreciate it. Thank You. Vivek Roy --- This email has been checked for viruses by Avast antivirus software. https://www.avast.com/antivirus

2 1

Crosscompiling context and fiber without multithreading
by Vitaly Osipov 09 Jan '17

09 Jan '17

Dear all, I am developing for a PowerPC target under real-time os und studying a possibility to employ fibers. They seem to be a good fit, since we have a single thread but several entities, which could in fact be considered parallel. Data exchange through channels also is relevant for the project. The problem is, that though we are provided with a quite recent compiler gcc 4.7.4 with c++11 support, the multithreading part of std is missing, since the OS has its own implementation of multithreading functionality different from pthreads and std::thread. Is there any chance to compile context and fiber without multithreading support? Or it is used under the hood and can not be avoided? Best, Vitaly

2 3

Boost 1.63 vs GCC 5.4.0
by Andrzej Krzemienski 06 Jan '17

06 Jan '17

Hi Everyone, I am trying to determine if Boost 1.63 (or 1.62) will work on GCC 5.4.0 on Linux. I can see in release notes that Boost 1.62 was tested on Linux with "GCC 5.4.1" (I am not aware that v 5.4.1 even exists). However in release notes for 1.63 there is no GCC 5.4 listed for Linux (only for Android). Does anyone know if there is any reason to suspect that Boost 1.63 may have problems on Linux with GCC 5.4.0 ? Regards, &rzej;

4 3

Re: [boost] [root_ptr] Into consideration by Qt & QtQuickCompiler
by Mathias Gaunard 03 Jan '17

03 Jan '17

On 28 Dec 2016 2:32 pm, "Phil Bouchard" <philippeb8(a)gmail.com> wrote: Greetings, I did my homework and the Qt Project is considering root_ptr despite the fact that there is no paper written on it: http://lists.qt-project.org/pipermail/development/2016-December/028222.html So there is a big demand out there. I am not sure what else is required to find a review manager but everything is on a silver plate now. I don't understand how you can possibly interpret that reply as "big demand".

2 3

bad boost_1_63_0.tar.bz2 sha256sum
by jack nade 03 Jan '17

03 Jan '17

Expect beae2529f759f6b3bf3f4969a19c2e9d6f0c503edcb2de4a61d1428519fcb3b0 for https://sourceforge.net/projects/boost/files/boost/1.63.0/boost_1_63_0.tar.… Get a9eec759dd97798b06eb258a1c6ad4a39ff43b483594a22298ccdfae8116ce16

3 3

[trac] Boost v1.64 in the milestones?
by Raffi Enficiaud 03 Jan '17

03 Jan '17

Dear all, Since 1.63 is (almost) out, would it be possible to have 1.64 in the milestones of trac? Thanks, Raffi

7 15

Review quality (was: [stacktrace] review (changing vote to NO))
by Andrey Semashev 03 Jan '17

03 Jan '17

On Mon, Dec 26, 2016 at 3:58 AM, Vladimir Batov <Vladimir.Batov(a)constrainttec.com> wrote: > On 2016-12-26 10:41, Andrey Semashev wrote: >> >> Acknowledging the need for a particular functionality is not the same >> as accepting a particular implementation. > > Put bluntly users do not care about implementation. Please, don't speak for others. I, personally, very much care about implementation, and I can see other reviewers did take a look at the implementation as well. I think, making judgment on the library quality without regard to the implementation quality is irresponsible and short sighted. That kind of approach tend to result in "5 minute hack" solutions of obviously poor quality. But that's just my opinion. > They care about > functionality provided. I advocate giving the lib a "foot in the door". That > and far better feedback from the users will be a strong incentive for the > author to keep working and improving the lib. You seem to prefer > all-or-nothing approach. I believe it's unrealistic and bad. You might > disagree. First, nowhere in my message I advocated for "all-or-nothing approach". What I advocated for is a fair review, outlining all ups and downs of the library, and if the reviewer feels downs are significant enough, he would be right to vote for rejection. Second, it's not like the library does not exist before it is accepted. Users and the author have every opportunity to try the library in the field, if they want to. There is blincubator.com as well. >> By >> turning a blind eye on a design flaw of a presented library you're >> doing a disservice to the library author and the library users. >> Instead, by giving constructive feedback (positive and negative), >> especially if supported by real world experience, you help the library >> improvement. In fact, this (the feedback) is the most valuable reward >> for the author from the review. And let me say, there's nothing >> humiliating in having a library rejected during a review. > > Well, I do not get scolded often these days. So, it is quite "refreshing" to > learn that I am "turning a blind eye on a design" and "doing a disservice". > I thought I was merely expressing my humble opinion... but probably I got it > all wrong. Well, maybe you shouldn't have taken my message personally then. It wasn't meant to scold anyone. If anything, it was written with the intent to provide another (mine) perspective on what a review is and object to your notion of library review as being a humiliation. The last part, actually, was kind of offending from your side and what triggered my reply in the first place. > As for the feedback, then I do not see voting something useful "no" to be > much of a feedback. Indeed, the author does get initial feedback during a > review. However, not all of that feedback is constructive. Some valid, some > subjective, some capricious. After it's voted out the feedback is no more. The review entails a discussion. Some reviewers get convinced. Some review points get refined, and the author gets convinced. Sometimes review votes get changed. And it's not like the votes are final - the actual decision is taken by the review manager, and he can weigh the points made in reviews and discussion at his discretion. And it's not like the library disappears after the review. If it's interesting and useful, it'll have its users, and they will no doubt provide feedback. > Real valuable feedback will come when the lib is in Boost. People'll start > using the lib (I would) in their real projects asking for this and that. Real world usage produces valuable feedback, no doubt about that. But Boost acceptance is not a pre-requisite for real world usage. >> There are things that can be fixed post-review. >> ... >> There are other things that cannot be fixed easily and would probably >> require changing library design. Those changes often affect library >> API and usage patterns, which warrants the need of a new review of the >> reworked library. > > Yes, all that sounds wonderful... on paper. In real life as a user I'll take > what's available first. Then, if that is improved in the next version, I'll > take it gladly. If design changes and gives me more or fixes something, I'll > accept that. I doubt you'd be so easy to accept the changes if that required you to rewrite half of your code. :) > I do not remember Spirit transitioning from V1 to not > backward-compatible V2 being re-reviewed. I can be wrong though. I don't remember the review either. But Spirit v2 was added in addition to Spirit Classic (aka v1), which is still available in Boost. It was more like a new library was added. Should it have been reviewed? In my opinion, at least a mini-review should have been performed. Luckily, Boost.Spirit dev team has rich experteese in the domain and a lot of experience gained with v1, so v2 was a success. >> In those cases it's better to reject the library so >> that the new, improved version is presented later. > > Again, wonderful.. in theory. The reality IMO is different because 1) > "improving" is better with real user feedback that you deny to the author by > voting "no"; 2) "later" might never come as the review process is quite > exhausting/draining; not everyone wants to experience it again; you might > say "too bad for him"; I'll say it's bad for the user as well as they end up > with your good intentions and no library; 3) "later" might be too late as by > that time the user'll have something else in place. Again, it's not like the library doesn't exist outside Boost. If it fits you, go right ahead, so 1 is not true. But Boost does set a certain bar of quality, and the review process exists precisely to maintain that bar. And I'll take your 2 and 3 any time if it results in a high quality library in Boost. >> Consider also that whenever a library is accepted into Boost, the >> matter of backward compatibility appears. If the accepted library is >> somehow seriously flawed, that flaw may be difficult and painful to >> fix in the future. > > "difficult", "painful", "backward compatibility"... Come on. I am sure > you've been in the industry for a while, have "survived" many > upgrades/updates, etc. We all know it's not an issue. We update, adjust, > move on. Let's just say it can be an issue. On Mon, Dec 26, 2016 at 3:54 AM, Robert Ramey <ramey(a)rrsd.com> wrote: > On 12/25/16 3:41 PM, Andrey Semashev wrote: >> >> Consider also that whenever a library is accepted into Boost, the >> matter of backward compatibility appears. > > How so? Certainly there is no requirement that boost libraries support older > versions of C++ and/or compilers - and indeed many don't. I don't think I > see what you're referring to here. I think you misunderstood. I wasn't speaking of C++ versions backward compatibility. I was speaking of the library backward compatibility. AFAIK, making backward incompatible changes is still considered an undesirable practice. >> If the accepted library is somehow seriously flawed, > > Then of course it should be rejected. Of course reaching a concensus as to > whether it's flawed might not be so easy. Right, that was my point. >> [1]: http://www.boost.org/community/reviews.html > > I checked this page and don't see where it says anything relevent to your > points. Maybe you missed this section: http://www.boost.org/community/reviews.html#Comments <quote> Your comments may be brief or lengthy, but basically the Review Manager needs your evaluation of the library. If you identify problems along the way, please note if they are minor, serious, or showstoppers. The goal of a Boost library review is to improve the library through constructive criticism, and at the end a decision must be made: is the library good enough at this point to accept into Boost? If not, we hope to have provided enough constructive criticism for it to be improved and accepted at a later time. The Serialization library is a good example of how constructive criticism resulted in revisions resulting in an excellent library that was accepted in its second review. </quote>

8 16

[sandia] Sandia-intel-16.0-c++11 is running in C++14 mode
by Andrey Semashev 02 Jan '17

02 Jan '17

Hi, Despite what the name implies, Sandia-intel-16.0-c++11 is actually running in C++14 mode. You can see there is -std=c++14 in the compiler command line: http://www.boost.org/development/tests/develop/developer/output/Sandia-inte… Could this inconsistency be fixed?

2 1

[Stacktrace] Review Manager report
by Niall Douglas 02 Jan '17

02 Jan '17

Firstly happy new year to everyone, and many thanks to all those who participated in the peer review of proposed Boost.Stacktrace before Christmas. I received the following formal reviews: 1. Vladimir Batov (YES) 2. Klemens Morgenstern (YES) 3. Andrey Semashev (NO) 4. Nat Goodspeed (YES) 5. Artyom Beilis (NO) 6. Barrett Adair (YES) Extensive comments without a formal acceptance recommendation were also made by: 1. Peter Dimov 2. Edward Diener There was a very noticeable lack of consensus on the strengths and weaknesses of the proposed library which has made summarising all these reviews into a coherent report with concrete conditions for acceptance very difficult. Antony also responded to many of the concerns throughout the review, agreeing with some points, disagreeing with others. I think this lack of consensus stemmed from multiple opinions on what a stacktrace library ought to provide: Minimum viable product: A portable backtrace() and backtrace_symbols() implementation with a C++ STL idiomatic API. The stack backtrace capture implementation must not allocate memory and be "fast". Note that backtrace_symbols() does NOT symbolise into strings containing source file name and line number. It also allocates memory (backtrace_symbols_fd() does not). Opinion 1: Portable serialisation of the stacktrace with instruction pointers converted to offsets into SO/DLL binary paths so a later external process can use those in combination with their debug symbols to retrieve source file names and line numbers. Ideally the serialisation formats supported would include those consumable by well known tooling for this purpose e.g. addr2line or llvm-symbolizer. Opinion 2: That Stacktrace can in process use debug symbols to retrieve source file names and line numbers. This could be implemented by invoking addr2line or equivalent as a child process which has the enormous advantage of being async safe, but has disadvantages in almost every other area. Or it could be implemented by one's own DWARF parser but with the huge caveat that memory could be badly corrupted by now. Opinion 3: That Stacktrace be "async safe" in that backtraces can be safely captured and parsed from a signal handler or SEH/TEH handler callback or point of C++ exception throw. *This implies no memory allocation during the execution of the handler*. >From the reviews, I think there is consensus that the minimum viable product is achieved in Stacktrace though many mentioned that improvements are needed to the documentation and most of the negative feedback was on features not in the minimum viable product described above. I therefore recommend the ACCEPTANCE of proposed Boost.Stacktrace into Boost with the following conditions: 1. That the documentation more clearly set out what Stacktrace does and especially does not do, and that the default facilities provided are those of the Minimum Viable Product described above i.e. no source file nor line number discovery, no external dependencies on libraries not always provided on the target platform, no invocation of child processes, no async safety during stacktrace parsing. Stacktrace ought to be pared back to the minimum viable product featureset with no external dependencies at all. 2. That suitable predefined macros opt in to additional functionality such as serialisation of offset translated backtraces, retrieval of source code path and line number etc. Enabling these may introduce dependencies on third party libraries not always present on a system such as libunwind, or on third party helper utilities such as addr2line. I would recommend that the APIs the use of which are dependent on such third party items are entirely compiled out of Stacktrace when the macro enabling them is not defined. 3. That the documentation describe ONLY the default minimum viable product functionality in its tutorial and quick start. All extra functionality enabled by macros is to be relocated into a separate documentation section away from the main documentation e.g. "Advanced/optional features". 4. That APIs made available only when a given macro has turned them on are documented as such in the API reference docs. I'd like to congratulate Antony on getting yet another library of his into Boost. I hope some of his magic rubs off on me when I bring Outcome to review later this year! Regards, Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

3 3

Re: [boost] documentation 1.63 not up to date
by Oliver Kowalke 02 Jan '17

02 Jan '17

Hello Daniel, I'm referring to http://www.boost.org/doc/libs/1_63_0/libs/fiber/doc/html/fiber/performance.… . The page should contain three tables (the one related to threads is missing) - my modification s date from end of November. Oliver Am 27.12.2016 1:35 nachm. schrieb "Daniel James" <dnljms(a)gmail.com>: On 27 December 2016 at 08:59, Oliver Kowalke <oliver.kowalke(a)gmail.com> wrote: > Hi, > could you update the documentation of boost-1.63 please - it is not up to > date. > For instance in boost.fiber commit 648de6a66544c5d03e5595cb25ed76 5ee0cd40d2 > (17.12.2016) is missing. > Thank you in advance, > Oliver The documentation on the website should just be whatever is in the release. It's a bit hard to know without a link to the page where that change is meant to be. I think what you're seeing on the website are the html files that are checked into git. I guess the documentation build isn't replacing them. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost

3 4

Re: [boost] [Bulk] Voronoi
by ayse 30 Dec '16

30 Dec '16

Thank you, I will watch it. Belowing code gives "floating point divide by zero" error std::vector<Segment>segments; segments.push_back(Segment(40, 0, 40, 100)); segments.push_back(Segment(40, 0, 100, 0)); segments.push_back(Segment(40, 100, 100, 100)); segments.push_back(Segment(100, 0, 100, 30)); segments.push_back(Segment(70, 30, 100, 30)); segments.push_back(Segment(70, 30, 70, 70)); segments.push_back(Segment(70, 70, 100, 70)); segments.push_back(Segment(100, 70, 100, 100)); // Construction of the Voronoi Diagram. voronoi_diagram<double>vd; * construct_voronoi(segments.begin(), segments.end(), &vd); // it gives floating point divide by zero error* My drawing, [image: Inline image 2]

1 1

[sandia] Intel compiler testers fail
by Andrey Semashev 29 Dec '16

29 Dec '16

Hi, Most of the Sandia-intel-* testers currently fail with the error saying /tmp is full. See here, for example: http://www.boost.org/development/tests/develop/developer/output/Sandia-inte… Could this be fixed? Thanks.

2 1

Voronoi
by ayse 29 Dec '16

29 Dec '16

Hi, Is boost-voronoi able to calculate voronoi diagram of closed polygons, if yes how? When I insert segments connected , it gives "floating point dividing by zero" error. Any help would be appreciated. Best regards, Ayşe.

3 2

Boost 1.63.0 is released!
by Marshall Clow 29 Dec '16

29 Dec '16

Release 1.63.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains numerous enhancements and bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1.63.0 You can also download directly from SourceForge: https://sourceforge.net/projects/boost/files/boost/1.63.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks to everyone who participated in this release. Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

4 3

Re: [boost] Variadic append for std::string
by Nat Goodspeed 29 Dec '16

29 Dec '16

On Dec 28, 2016 7:20 PM, "Yakov Galka" <ybungalobill(a)gmail.com> wrote: On Tue, Dec 27, 2016 at 4:47 PM, Olaf van der Spek <ml(a)vdspek.org> wrote: > One frequently needs to append stuff to strings, but the standard way > (s += "A" + "B" + to_string(42)) isn't optimal due to temporaries. > Can't we already write it through (((s += "A") += "B") += to_string(42))? This is the time I think that assignment operators, other than =, should have had left associativitiy... pity they don't. I think what's desired here is a two-pass approach in which append() or concat() or whatever first figures out the final length required, allocates that much storage, then appends into it with no further expansion. When we say it should understand two kinds of string_view, etc., I assume that the catch-all case for each arg would be "anything that can be treated as a range of char_type."

2 1

[conversion] Release build error..
by Rene Rivera 29 Dec '16

29 Dec '16

Please fix this ASAP: error: Unable to find file or target named error: 'conversion' error: referred to from project at error: '/home/ubuntu/boost/libs/conversion/doc' Failed: 'b2' '--debug-configuration' '-j2' '-q' '-d0' '--build-dir=/home/ubuntu/build' '--distdir=/home/ubuntu/build/dist' '--release-build' 'auto-index=off' ERROR = 1 -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

2 2

[root_ptr] Into consideration by Qt & QtQuickCompiler
by Phil Bouchard 28 Dec '16

28 Dec '16

Greetings, I did my homework and the Qt Project is considering root_ptr despite the fact that there is no paper written on it: http://lists.qt-project.org/pipermail/development/2016-December/028222.html So there is a big demand out there. I am not sure what else is required to find a review manager but everything is on a silver plate now. Sincerely, -Phil

1 0

[Beast] Implementing the Asio deallocation guarantees
by Vinnie Falco 27 Dec '16

27 Dec '16

A user wrote up this detailed bug report on Beast. The problem is that Beast does not guarantee that all temporary memory allocations will be freed before the handler is invoked during the upcall. I'd like to fix it, but all the fixes are quite ugly. I am wondering if anyone has any experience, suggestions, or advice to add to the conversation before I try to pick the least distasteful option: https://github.com/vinniefalco/Beast/issues/215 Thanks

1 0

Merging superproject fb83378 to master
by Peter Dimov 27 Dec '16

27 Dec '16

Can we please merge https://github.com/boostorg/boost/commit/fb8338770e930bca5ba24dbb9240f5c2e4… to master? Without it, Boost.Build requires the tools/inspect submodule to be present, which is otherwise unnecessary in partial Travis checkouts.

1 1

documentation 1.63 not up to date
by Oliver Kowalke 27 Dec '16

27 Dec '16

Hi, could you update the documentation of boost-1.63 please - it is not up to date. For instance in boost.fiber commit 648de6a66544c5d03e5595cb25ed765ee0cd40d2 (17.12.2016) is missing. Thank you in advance, Oliver

3 4

Re: [boost] documentation 1.63 not up to date
by Oliver Kowalke 27 Dec '16

27 Dec '16

OK, thank you - I'll test your suggestions. Am 27.12.2016 2:12 nachm. schrieb "Daniel James" <dnljms(a)gmail.com>: On 27 December 2016 at 12:45, Oliver Kowalke <oliver.kowalke(a)gmail.com> wrote: > Hello Daniel, > I'm referring to > http://www.boost.org/doc/libs/1_63_0/libs/fiber/doc/html/ fiber/performance.html > . > The page should contain three tables (the one related to threads is > missing) - my modification s date from end of November. > Oliver The change you referred to before was from the 17th, but the html file in git was last updated on the 10th. https://github.com/boostorg/fiber/blob/master/doc/html/ fiber/performance.html I guess that's what you're seeing. I'm not sure how the build is set up now, but I'm guessing it wasn't set up to build the fiber documentation because there's already html files there. To build the documentation, I think you need to change the end of your documentation jamfile to something like: alias boostdoc ; explicit boostdoc ; alias boostrelease : fiber ; explicit boostrelease ; Although, I can't test that now, so it might be wrong. I'd also delete the html documentation from the repo, as a broken link is a better indicator that the documentation isn't being built. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost

1 0

Boost Fiber & ASIO CPU spinning
by Daniel Larimer 27 Dec '16

27 Dec '16

I am attempting to combine Boost Fiber with Boost ASIO and am having very poor results. Code: int main() { boost::asio::io_service io; boost::fibers::use_scheduling_algorithm< boost::fibers::asio::round_robin > ( io ); io.run(); return 0; } This code should startup and then sleep, but instead it pegs the CPU at 100%. The code I used for boost::fibers::asio::round_robin can be found here: http://www.boost.org/doc/libs/1_62_0/libs/fiber/examples/asio/round_robin.h… When I inspect the round_robin scheduler it appears to be switching back and forth between two different fibers. If I put a print statement inside asio_rr_service_lambda then it constantly reports that it has ready fibers. I'm looking for a working example. Dan

2 1

PHP error in string_ref docs
by Olaf van der Spek 27 Dec '16

27 Dec '16

Hi, Got a PHP error in the docs.. http://www.boost.org/doc/libs/master/libs/utility/doc/html/string_ref.html /home/www/live.boost.org/common/code/boost.php:16: htmlentities(): Invalid multibyte sequence in argument -- Olaf

2 3

Re: [boost] [stacktrace] review (changing vote to NO)
by Artyom Beilis 26 Dec '16

26 Dec '16

> > 1. use of -rdynamic/-export-dynamic should be noted in "bold face" regarding > > the use of the library. > > Those flags are not required because addr2line can extract information > from debug sections of the binary. Yes.. this is exactly the issue - I don't think that addr2line should be used by default. Getting the stack trace using dladdr works very well - so no need to use add2line unless absolutely required. I also want to hear regarding inefficiency of add2line use - creating the process for each stack frame you wanted to trace. It is very inefficient so I suggest not to use one. Finally reviewing your code once again I realized following: 1. Instead of using adde2line to get the object name you can just call add2line with /proc/12345/exe (works with dynamically loaded shared objects as well - i tested it) 2. Use of addr2line for every each frame must be fixed But what is most important that I understood that you don't even use dladdr to get function names even if you can - which is very bad decision. Additionally I realized that with_trace and traced aren't parts of the library! These should be built in there by default. -------------------------- After using the library and running couple of tests on Linux with GCC.. I have to revoke my "Conditional YES" vote and change it to "NO": And the reason is following: 1. Linux/*nix backend is poor - instead of using dladdr to get function names easily as I do in the backend I written and use on CppCMS [1] you call external exe in very inefficient way. 2. I realized that the library does not provide the basic functionality like collecting strack trace on throw (what I thought was built in but I was mistaken) 3. No answer for non MSVC compilers built in. But the most important reason that the library does not feel mature enough in terms of both backends and frontends. I strongly strongly strongly recommend to continue the work on the library as it provides important functionality. The frontend should be adjusted a little to couple with common cases. The backend must be modified to not to fork/exec by default and optimize one significantly. I clearly understand you to want to use addr2line as it gives more power but it can't be used by default. I searched for a long time for a lightweight solution for converting addresses to the function names for CppCMS including trying to use debug information but couldn't find anything suitable besides dlfunc. However addr2line is by no means can be accepted as "default" solution. I also recommend to take a look on cppcms's backtrace library it is very simple and provides critical information in production environment. Regards, Artyom Beilis [1] https://sourceforge.net/p/cppcms/code/HEAD/tree/framework/trunk/booster/lib… _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

6 11

[root_ptr] Potential support from Qt & QtQuickCompiler
by Phil Bouchard 25 Dec '16

25 Dec '16

Greetings, As you know the WebKit project has a very complex memory manager that cannot be swapped easily but The Qt Project might be interested for a faster alternative than the garbage collector: http://lists.qt-project.org/pipermail/development/2016-December/028199.html This is just a head's up in case anybody is interested into the subject and is aware of Qt. I know by experience garbage collectors will always let you down for complex projects so I think there is no other solution. Thanks & Merry Christmas, -Phil

1 0

Boost 1.63.0 Release Candidate 2
by Marshall Clow 25 Dec '16

25 Dec '16

The second release candidate for the 1.63.0 release is now available at: https://sourceforge.net/projects/boost/files/boost/1.63.0/ The only changes are in Boost.Config, Boost.Context, and Boost.Fiber. The SHA256 checksums are as follows: 25db3956a8d58187ac7a0702cc917e9bab47ff90baafc35e4e789dca1ce5f423 boost_1_63_0_rc2.7z beae2529f759f6b3bf3f4969a19c2e9d6f0c503edcb2de4a61d1428519fcb3b0 boost_1_63_0_rc2.tar.bz2 fe34a4e119798e10b8cc9e565b3b0284e9fd3977ec8a1b19586ad1dec397088b boost_1_63_0_rc2.tar.gz 97ce6635df1f44653a597343cd5757bb8b6b992beb3720f5fc761e3644bcbe7b boost_1_63_0_rc2.zip As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. -- The release managers

5 6

Re: [boost] Boost 1.63.0 Release Candidate 2
by Stephan T. Lavavej 24 Dec '16

24 Dec '16

[Marshall Clow] > The second release candidate for the 1.63.0 release is now available at: > https://sourceforge.net/projects/boost/files/boost/1.63.0/ > As always, the release managers would appreciate it if you download > the candidate of your choice and give building it a try. Please report > both success and failure, and anything else that is noteworthy. 1.63.0 RC2 successfully built for mingw-w64, without any workarounds. (Boost.Fiber is detecting my lack of std::mutex and simply not building, which is fine by me.) Notably, this is the first time that I've ever been able to build Boost without patches or workarounds. This is after bootstrap.sh was fixed for mingw-w64/msys2, Context/Coroutine/Coroutine2 were fixed to build for mingw-w64, and Python auto-detection started working again. Yay! Thanks, STL

2 1

Stacktrace review: concern, probable solution and review news
by Antony Polukhin 23 Dec '16

23 Dec '16

Hi, The biggest concern with the stacktrace library is it's usability in async-signal-handlers. Here are some facts: * users definitely want to use the library in async-signal-handlers to print stacktraces on SIGSEGV/SIGBUS/SIGABRT * the only cross-platform async-signal-safe thing that can be done - is to print function addresses (without names and source line locations) * reviewers wish to have a smaller size of the `stacktrace` class, want to avoid template parameter and have a std::vector<frames> like interface (this is async unsafe because vector does dynamic allocations). So, the solution: * Change `basic_stacktrace<size_t>` to `basic_stacktrace<class Allocator = std::allocator<void*>>` and make it's constructor async-unsafe and add additional runtime parameter for stack depth. * Provide async-safe functions that dump addresses separated by whitespace (format also acceptable by addr2line and atos): * `void dump_stacktrace(int fd)` * `void dump_stacktrace(HANDLE fd)` * `void dump_stacktrace(const char* filename)` * Provide an example with dumping callstack to a file and printing it on program restart Does it seem reasonable? Does it satisfy your needs? Review news: * User named LogicalKnight tested the library on MacOS and it works well. A few issues in examples must be fixed: https://github.com/apolukhin/stacktrace/issues/10 My list of TODOs for the library: * Fix the async unsafe code in signal catching example * ? Provide a low-level API for getting stacktrace as array of void pointers * MinGW fails to compile, because of missing "Dbgeng.h" headers. This must be fixed by manyally forward declaring required functions using the boost.winapi way. * Add a note about the Boost.Exception usage to the example with embedding stack into exception. * Take a look at the llvm-symbolizer, atos and libdwraf; try hard to produce a non-forking solution * ? Deserialization/inspection of stacktrace on other machine * BOOST_NOINLINE inline trick to avoid printing internals in the stacktrace + fix Intel warnings * At github one of the users was complaining about the performance of ostreaming operations. There is a way to significantly speedup ostreaming without changing the interface of the library. I'll do the optimization after the Boost Review. * Improve docs for the "Build, Macros and Backends" sections (say that library is using system headers, no 3rd party libraries must be installed or manually linked; backtrace() is LINUX specific, not POSIX) * Add a note to the docs that library is header only by default and usable in C++98/C++03. Things NOT to do ever: * Integration with BOOST_THROW_EXCEPTION and Boost.Exception - those ideas are out of the library scope * Callbacks to do things on stacktraces - no way to satisfy all the needs and make them optimal on all the platforms. Do some caching instead -- Best regards, Antony Polukhin

5 11

Re: [boost] [Stacktrace] review
by Barrett Adair 23 Dec '16

23 Dec '16

On Wed, Dec 14, 2016 at 2:43 AM, Niall Douglas <s_sourceforge(a)nedprod.com> wrote: > The formal review of the Stacktrace library by Antony Polukhin starts > today 14th Dec and will conclude before Christmas. I appreciate we > are likely a bit tired out from the many library reviews recently and > of course it's Christmas, but given the lack of a portable way to > work with stack backtraces, which you inevitably need to do > eventually in any non-toy production application, Stacktrace needs > your review! > > For your review you may wish to consider the following questions: > > What is your evaluation of the design? I like it. > What is your evaluation of the implementation? I've never implemented a stacktrace reader, so I don't have much to add. The code did not raise any red flags for me, though. > What is your evaluation of the documentation? Documentation is solid. > What is your evaluation of the potential usefulness of the library? Very useful. I will likely use this at work. > Did you try to use the library? With what compiler? Did you have any problems? Yes, GCC 5.3, no problems. This stacktrace made me smile: 0# boost::stacktrace::detail::backend::backend(void**, unsigned long) 1# s::~s() 2# void __gnu_cxx::new_allocator<s>::destroy<s>(s*) 3# void std::allocator_traits<std::allocator<s> >::destroy<s>(std::allocator<s>&, s*) 4# std::_Sp_counted_ptr_inplace<s, std::allocator<s>, (__gnu_cxx::_Lock_policy)2>::_M_dispose() 5# std::_Sp_counted_base<(__gnu_cxx::_Lock_policy)2>::_M_release() 6# std::__shared_count<(__gnu_cxx::_Lock_policy)2>::~__shared_count() 7# std::__shared_ptr<s, (__gnu_cxx::_Lock_policy)2>::~__shared_ptr() 8# std::shared_ptr<s>::~shared_ptr() 9# hello()::{lambda()#1}::~hello() 10# std::_Function_base::_Base_manager<hello()::{lambda()#1}>::_M_destroy(std::_Any_data&, std::integral_constant<bool, false>) 11# std::_Function_base::_Base_manager<hello()::{lambda()#1}>::_M_manager(std::_Any_data&, std::_Function_base::_Base_manager<hello()::{lambda()#1}> const&, std::_Manager_operation) 12# std::_Function_base::~_Function_base() 13# std::function<void ()>::~function() 14# void std::_Destroy<std::function<void ()> >(std::function<void ()>*) 15# void std::_Destroy_aux<false>::__destroy<std::function<void ()>*>(std::function<void ()>*, std::function<void ()>*) 16# void std::_Destroy<std::function<void ()>*>(std::function<void ()>*, std::function<void ()>*) 17# void std::_Destroy<std::function<void ()>*, std::function<void ()> >(std::function<void ()>*, std::function<void ()>*, std::allocator<std::function<void ()> >&) 18# std::vector<std::function<void ()>, std::allocator<std::function<void ()> > >::~vector() 19# hello() 20# main 21# __libc_start_main 22# _start > How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? About 45 minutes total. I skimmed the code, the documentation, and the test cases. Then, I made a little test program. > Are you knowledgeable about the problem domain? No. > Do you think the library should be accepted as a Boost library? Yes, unequivocally. The concerns about async safety are interesting, but ultimately this library is useful to me (and likely many others) regardless of signal support. Barrett

1 0

Re: [boost] [interprocess] Getting boot-up time is unreliable on Windows
by Remi Chateauneu 22 Dec '16

22 Dec '16

Maybe the RDTSC instruction might help for x86 processors, as it returns a number of ticks which is reset at startup. It is also extremely fast. Le 22 déc. 2016 13:04, "Thomas Dahms" <thomas.dahms(a)native-instruments.de> a écrit : Dear developers, dear Ion, We are experiencing issues on Windows where boost::interprocess relies on a certain event in the system event log to get the system's boot-up time. This has proven to be unreliable, because that event is not always present in the log. In that case, initialization of boost::interprocess fails. Several bug reports exist for that issue, e.g. [1, 2]. Report [1] contains a proposed fix to use GetTickCount64() and there is an open PR with an alternative fix to fall back to WMI mechanisms [3]. I understand that the fix [1] would need some polishing, because GetTickCount64() is not available in pre-Vista. Nevertheless, both proposed fixes have been uncommented and unconsidered for a while now. Is there any chance that the maintainers could look into this? Thank you! Regards, Thomas [1] https://svn.boost.org/trac/boost/ticket/12137 [2] https://svn.boost.org/trac/boost/ticket/12232 [3] https://github.com/boostorg/interprocess/pull/18 -- Thomas Dahms Software Developer Native Instruments GmbH www.native-instruments.com _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost

2 1

[interprocess] Getting boot-up time is unreliable on Windows
by Thomas Dahms 22 Dec '16

22 Dec '16

Dear developers, dear Ion, We are experiencing issues on Windows where boost::interprocess relies on a certain event in the system event log to get the system's boot-up time. This has proven to be unreliable, because that event is not always present in the log. In that case, initialization of boost::interprocess fails. Several bug reports exist for that issue, e.g. [1, 2]. Report [1] contains a proposed fix to use GetTickCount64() and there is an open PR with an alternative fix to fall back to WMI mechanisms [3]. I understand that the fix [1] would need some polishing, because GetTickCount64() is not available in pre-Vista. Nevertheless, both proposed fixes have been uncommented and unconsidered for a while now. Is there any chance that the maintainers could look into this? Thank you! Regards, Thomas [1] https://svn.boost.org/trac/boost/ticket/12137 [2] https://svn.boost.org/trac/boost/ticket/12232 [3] https://github.com/boostorg/interprocess/pull/18 -- Thomas Dahms Software Developer Native Instruments GmbH www.native-instruments.com

1 0

Boost 1.63.0 Release Candidate 1
by Marshall Clow 21 Dec '16

21 Dec '16

The release candidates for the 1.63.0 release are now available at: https://sourceforge.net/projects/boost/files/boost/1.63.0/ The SHA256 checksums are as follows: 010699561c6011e6d97dc453d55bc5e54cdc192622434eff7b8ac559efac846c boost_1_63_0_rc1.7z d8ebf8d90b2f823f04119445ac339d704395d655907333ec0fab863040119d24 boost_1_63_0_rc1.tar.bz2 dabe29b8a60369ae7c15c20681a32717f3c37d97e5dc6d39c5b2fd0494b8e995 boost_1_63_0_rc1.tar.gz 1683942022fd63c205c48fb2155af6094c67ef67aa13ffb3e1db78fecf817efe boost_1_63_0_rc1.zip As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. -- The release managers

12 25

Please update Track config
by Antony Polukhin 21 Dec '16

21 Dec '16

Hi, Please, change the default owner for variant issues from ebf to apolukhin (it's me, I'm taking care of the library for last few years). This change will help me to react faster on variant issues. Also, please add the dll component into the list of components so that people could properly report Boost.DLL issues https://github.com/boostorg/dll. Make me (apolukhin) the default responsible for the issues. Thanks in advance! -- Best regards, Antony Polukhin

1 0

Re: [boost] [Boost] [Stacktrace] review
by Nat Goodspeed 21 Dec '16

21 Dec '16

On Wed, Dec 14, 2016 at 3:43 AM, Niall Douglas <s_sourceforge(a)nedprod.com> wrote: For your review you may wish to consider the following questions: > > - What is your evaluation of the design? > I'm generally pleased with the design. There's a documentation section "Exceptions with stacktrace" that discusses techniques for incorporating stacktrace data into your own exceptions. I see a real possibility for integration with Boost.Exception, perhaps even a mechanism to make BOOST_THROW_EXCEPTION embed the stacktrace at the throw point. This is not an objection to accepting the library, but rather a feature request for when we do. I do have a question about use of a template parameter to constrain the number of entries, rather than a runtime parameter. Presumably that's necessary to permit certain backend implementations to be async-signal-safe? (Whatever the rationale, a note in the documentation explaining it would be nice.) My objection to that is that apparently, with the present design, if I want to write a function that accepts any specialization of basic_stacktrace, that must itself be a template function. If I'm correct about the reason for using a template parameter, would it be reasonable to split the class into a non-template base class supporting all the methods, with a template subclass that provides the storage? The base class could store a (pointer, length) passed by the subclass constructor. Without having looked at the implementation, I expect that you wouldn't even need virtual-function dispatch: the only indirection would be through the data buffer pointer. That would even permit a subclass that provides dynamic storage, for async-signal-unsafe use. Then a processing function could accept reference-to-base-class and handle any stacktrace instance. > - What is your evaluation of the implementation? Sorry, I haven't looked at the implementation. > - What is your evaluation of the documentation? > Generally good. It could stand a cleanup pass; there are a few typos here and there. I do like that each method explicitly states both complexity and async signal safety. The description of the nullary frame() constructor says that source_line() will return both empty string and 0. > - What is your evaluation of the potential usefulness of the > library? > VERY! I want this. > - Did you try to use the library? With what compiler? Did you > have any problems? > No, I haven't tried to use it. (A deadline is coming up fast.) > - How much effort did you put into your evaluation? A glance? A > quick reading? In-depth study? > I read through the documentation. > - Are you knowledgeable about the problem domain? > I have occasionally used platform-specific tactics to try to achieve the same thing, on a couple different platforms. Each time it's been painful enough to make me wish that this problem were solved, once and for all. > And finally, every review should attempt to answer this question: > > - Do you think the library should be accepted as a Boost > library? > Yes I do. I would like to see the non-template base class, but that's not a showstopper: I would rather have this library without than not have it at all. As I mentioned, I would like to see integration with Boost.Exception. That just seems like a natural next step. I see further opportunities for integration with Boost.Context, Boost.Fiber...

11 121

Stacktrace library starts review today 14th Dec
by Niall Douglas 21 Dec '16

21 Dec '16

The formal review of the Stacktrace library by Antony Polukhin starts today 14th Dec and will conclude before Christmas. I appreciate we are likely a bit tired out from the many library reviews recently and of course it's Christmas, but given the lack of a portable way to work with stack backtraces, which you inevitably need to do eventually in any non-toy production application, Stacktrace needs your review! Stacktrace is an optionally header-only library providing four implementation backends, libunwind (POSIX only), windbg (Windows only), backtrace (from the C library on most POSIX implementations) and a null backend. At its very simplest it lets you capture the stack backtrace for the calling thread and to print it to a std::ostream& of your choice. The basic_stacktrace<> class quacks like a STL container of frame object instances. The rest of the API pretty much follows STL design principles for the most part. Use is therefore unsurprising. You can find the documentation at http://apolukhin.github.io/stacktrace/index.html and the github repo at https://github.com/apolukhin/stacktrace. Review guidelines ================= Reviews should be submitted to the developer list (boost(a)lists.boost.org) preferably with '[stacktrace]' in the subject. Or if you don't wish to for some reason or are not subscribed to the developer list you can send them privately to me at 's_sourceforge at nedprod dot com'. If so, please let me know whether or not you'd like your review to be forwarded to the list. For your review you may wish to consider the following questions: - What is your evaluation of the design? - What is your evaluation of the implementation? Most of my personal concerns with this library are with the implementation and I would hugely appreciate feedback from others with substantial experience of using stacktracing "in anger" in non-trivial use case scenarios. - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should attempt to answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Even if you do not wish to give a full review any technical comment regarding the library is welcome as part of the review period and will help me as the review manager decide whether the library should be accepted as a Boost library. Any questions about the use of the library are also welcome. Finally, thanks to Edward whose announcement of the Synapse library review I borrowed heavily from as I thought it very well structured. Hopefully the above is just as clear. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

6 21

Re: [boost] [EXTERNAL] Boost 1.63.0 Release Candidate 1
by Marshall Clow 21 Dec '16

21 Dec '16

On Tue, Dec 20, 2016 at 2:51 PM, Marshall Clow <mclow.lists(a)gmail.com> wrote: > On Tue, Dec 20, 2016 at 12:49 PM, Rene Rivera <grafikrobot(a)gmail.com> > wrote: > >> >> >>>>>> >> >>>>>> As I mentioned to Marshall, the results here: >> >>>>> http://www.boost.org/development/tests/develop/developer/ >> config.html >> >>>>> are >> >>>>> horribly outdated - are they actually being run and updated? >> >>>>> >> >>>>> >> >>>> It appears that all 'develop' tests are at least one week late if not >> >>>> much >> >>>> more. >> >>>> >> >>> >> >>> >> >>> I was not aware of the stalled results.. Investigating now. >> >>> >> >> >> >> I think Sandia testers on Darwin and Linux are cycling okay in both >> >> develop and master, there’s results up there from Dec 20th. Are the >> Sandia >> >> config test results wrong or unexpected? >> >> >> > >> > The latest results from Sandia that I can see are from 12th. The report >> > info[1] also says it was run last time on 12th. >> > >> > [1]: http://www.boost.org/development/tests/develop/developer/ >> index.html >> >> >> The report generation issue is now addressed. The results are current and >> show tests from today. >> >> > I see lots of new results for "master", but none for "develop". (yet) > > Interesting. This page: http://www.boost.org/development/tests/develop/developer/config.html shows new results, but this one http://www.boost.org/development/tests/develop/developer/summary.html does not. -- Marshall

3 3

[test] Really deactivate test
by Florian Lindner 19 Dec '16

19 Dec '16

Hello, I need to conditionally decativate tests and use a custom decorator for that, like that: virtual void apply(bt::test_unit& tu) { [...] if (std::find(_ranks.begin(), _ranks.end(), rank) == _ranks.end()) { std::cout << rank << " Disable, because of rank, test: " << tu.full_name() << std::endl; tu.p_default_status.value = bt::test_unit::RS_DISABLED; return; } } (i'm happy to provide full source code, if anyone is interested) As you can see it's deativated on some MPI ranks only. However, if a user uses -t "testname" it is activated again. Is there a way to really deactivate the test? Or delete it from the test tree? Thanks, Florian

2 5

[variant] gcc crash
by Igor R 18 Dec '16

18 Dec '16

Consider the following snippet (trying to compile with Boost 1.62): ///////////////////////////////////////////////////////////// #include <boost/variant.hpp> template<class Node> struct node1_type; struct var_type; using var_base = boost::variant<int, boost::recursive_wrapper<node1_type<var_type>> >; template<class Node> struct node1_type { Node child; }; struct var_type : var_base { using var_base::var_base; }; int main() { var_type v1 = 1; } /////////////////////////////////////////////////////////////////// It crashes GCC: http://melpon.org/wandbox/permlink/A6BuYqqrG4COcfFl and produces compilation error with any released version of Clang: http://melpon.org/wandbox/permlink/1JQ7OVLV3crERRJX (Although it does compile with Clang-4 trunk). I'd appreciate if Variant maintainers could take a look at it. Thanks.

3 2

Re: [boost] [Boost-users] Stacktrace library starts review today 14th Dec
by Antony Polukhin 18 Dec '16

18 Dec '16

2016-12-15 3:44 GMT+03:00 Edward Diener <eldiener(a)tropicsoft.com>: > In the documentation for stacktrace I do not see anything about what level > of C++ is required for a compiler using the stacktrace library or any > information on what compilers have been tested when using the library. It's C++98. Tested on latest clang(c++03, c++11), gcc(c++98, c++11, c++1y), msvc. > In the section of "Build, Macros and Backends" I do not think there is > enough information about using a particular backend, other than saying that > you need to link with such-and-such. Does stacktrace "automatically" find > the header files it needs from these backends ? Even so I think some > information about where it looks for the backend header files need to be > given. I also think that some information of what libraries it looks to link > with needs to be given. I am assuming it links with the static versions of > these backend libraries unless I define either BOOST_STACKTRACE_LINK and > BOOST_ALL_DYN_LINK, or BOOST_STACKTRACE_DYN_LINK. What if I want to use the > header-only version but I want to link with the shared library backend ? I > also assume that if I link with the static library backend I should probably > be linking with the RTL static library, while if I link with the shared > library backend I should also be linking with the RTL shared library. > > What about 32-bit versus 64-bit use of stacktrace ? Do they both work as > advertised with the correct backends, whether static or shared ? I think the > "Build, Macros and Backends" need rto be expanded to cover alol these > topics. All the headers are found automatically and the library is header only if you do not define BOOST_STACKTRACE_LINK or BOOST_STACKTRACE_DYN_LINK. Backend is chosen automatically in header only mode. You need to do nothing, unless you encounter some problems on default setup (like you OS is POSIX but not LSB Core Specification 4.1) or unless you wish to disable stacktraces. If you define BOOST_STACKTRACE_LINK or BOOST_STACKTRACE_DYN_LINK you have to manually link with one of the backends. I'll try to improve the "Build, Macros and Backends" section to be more clear. -- Best regards, Antony Polukhin

3 3

[iterator][type_traits] A test is failing with gcc in c++03 mode
by Edward Diener 17 Dec '16

17 Dec '16

The zip_iterator_test_std_pair is failing with gcc in c++-03 mode. The problem reduces viqa Boost type traits to the fact that in gcc c++03 mode the expression: __is_abstract(std::pair<int&, std::string&>) where __is_abstract is a compiler intrinsic, gives an error of: error: forming reference to reference type 'std::__cxx11::basic_string<char>&' pair(const _T1& __a, const _T2& __b) ^~~~ Is this a valid error according to the C++ 2003 standard ? The test works in c++11 or c++14 mode.

4 8

Synapse library review result
by Edward Diener 14 Dec '16

14 Dec '16

The Decision --- -------- There were a total of 9 people, outside of the library author Emil Dotchevski, who reviewed/commented about the Synapse library during the review period and the Monday following where I accepted a late review and people's responses to that late review. The voting in the Synapse review is: 0 for YES 2 for NO, with one of the two a provisional NO. Among the other people who commented but did not vote I have 2 people who said they definitely liked the library and 2 people who said they definitely did not like the library. Among other commenters I interpreted 2 other people as probably approving of the library as it now is and 1 other person as probably not approving of the library as it now is. Given the actual YES or NO vote, and the small amount of people who took part in the review, and the even smaller amount of people who decided to vote YES or NO for the library, the Synapse library is NOT accepted into Boost. My decision as review manager is based on the review of the library by others and not on my own personal view of whether the library should be accepted or not. Issues ------ I want to use the next part of this decision to summarize the issues brought up largely, but not exclusively, by those who did not see the Synapse library as currently being worthwhile to become a part of Boost. This issues I summarize below may or may not be seen as relevant or not by others but they do represent the areas of criticism of the library made during the review. All the issues were answered by Emil during the review, and I think he did an excellent job of answering reviewers based on how he sees these issues. Some of these issues may be seen as unimportant or trivial or already well answered, but I want to list them all nonetheless. The issues are presented in no particular order of importance. I will refrain from making my own comments about these issues until my own general summary at the end of this review decision: 1) The current Boost signals/signals2 library is adequate for signal/slot processing and another signal/slot library such as Synapse does not provide enough of a usage argument to be added to Boost along with what already exists. 2) The documentation needs to be more expansive on the difference between Boost signals/signals2 and the Synapse library. 3) The end-user should have some sort of control where Synapse stores its information regarding the connection between signal emitters and slots ( signals handlers ). 4) Since Synapse is a C++11 library it should use C++11 standard library constructs across the board rather than their Boost equivalents. 5) There should be some "natural" way in which slots can return a value, ala the signals2 library. 6) A more flexible way of handling the slot lifetimes should be created as an addition to the shared_ptr/weak_ptr way the library currently employs. 7) A means by which a particular thread can be specified ( thread-affinity ) for a particular slot when connected should be created; or a dispatching mechanism, perhaps using asio, for connecting a slot to an emitter. 8) The ability to have signals emitted with more than four parameters should be created. 9) The fact that emitters are identified strictly by address was seen as a weakness in the design since at least theoretically, if not very often practically, it is possible for two different variables to have the same address. Connected to this is that the address of emitters is noted with a "void *" in the public interface, and that was criticized as not C++-like. 10) Connection objects should be movable rather than using shared_ptr. 11) The central dispatching mechanism is too slow for large scale continuous changes which emit signals to be handled by slots in some systems ( a stock market changes type of application was brought up as such an example ). 12) The use of only Boost function as a callable slot is too inflexible. 13) The signal type ( pointer to function whose return type identifies signals ) was seen both as cryptic and inflexible, and a deduced signal type was suggested. 14) Having more than one signal type in Boost in general was seen as a bad situation. 15) More specific information on which compilers should work with Synapse. Summary ------- First of all, thanks to everyone who participated in the review and for Emil for answering and providing explanations for his design and coding decisions. I cannot say it enough but I really hope that more people can be encouraged to look at libraries up for review and make comments, even if they do not want to make an official vote or comment on any particular area in which they do not feel they have adequate knowledge. All comments and personal or technical evaluations are important and help a review manager make a final decision, as well as telling a library author what others think of what he has done. With that said I will not try to hide the fact that I personally view the Synapse approach to signal/slot processing as different enough, and useful enough due to its non-intrusive nature, from signals/signals2 to be a valuable addition to Boost, even while I recognize that there was not enough of a consensus or enough of an interest among others during the review to have that happen now. Among the issue brought forth by others my personal view for possibly improving Synapse to where it might be more acceptable to reviewers and might draw more people's interest as a possibly Boost library in the future pending another review, lies mainly in these numbered issues above: 2), 4), 5), 7), 8), 12), 15). I also feel having the documentation discuss in more detail the major concepts of the library, as a bridge between the Tutorial and the Synopsis, would be very helpful for interesting programmers In Synapse. Of course other people's views may vary greatly, and further discussion of Synapse on the Boost developers mailing list or the Boost users mailing list is, I am sure, welcome to the author of Synapse Emil Dotchevski.

1 0

[root_ptr] documentation fix
by Phil Bouchard 14 Dec '16

14 Dec '16

Greetings, I just realized that root_ptr is "container-oriented" and therefore I added this information to the documentation: http://philippeb8.github.io/root_ptr/root_ptr/intro.html#root_ptr.intro.roo… I think this summarizes it all with these few keywords and at some point people will get tired of the garbage collectors and "click" ;) Sincerely, -Phil www.fornux.com www.finitetheory.com www.loaapu.com (in progress)

1 0

[synapse] Review
by David Sankel 14 Dec '16

14 Dec '16

On Fri, Dec 2, 2016 at 9:19 AM, Edward Diener <eldiener(a)tropicsoft.com> wrote: > > For your review you may wish to consider the following questions: > > - What is your evaluation of the design? > The design looks reasonable. > - What is your evaluation of the implementation? > I found the use of typedef's to functions returning inline struct definitions to be overly clever and cryptic to new C++ developers. I also found the lack of static type checking in certain places to be objectionable. The unusual formatting is an important subjective turnoff to potential users. Presumably the goal of the library is to enable users to get the functionality they've been missing. The hurdle of a new formatting style to get used to goes against this goal. Fortunately, this is something easily remedied. > - What is your evaluation of the documentation? > Looked reasonable. > - What is your evaluation of the potential usefulness of the > library? > Given the prior existence of Boost.Signals I wouldn't find this library to be useful. There is an important aspect to this review that I want to call out. A signal is a "vocabulary type" in that it is pervasive through systems and frequently used in public interfaces. One of the most important qualities of a vocabulary type is that there be only one of them. Imagine the confusion if we had one thread-safe shared pointer class and another one optimized for single threaded usage, or if we had an suite of different variant types with different tradeoffs. No, there should only be one signal type and Boost.Signal made the correct choice of using a so-called intrusive design. - Did you try to use the library? > Nope. > - How much effort did you put into your evaluation? A glance? A > quick reading? In-depth study? > I spent a few hours on the review. A small amount of time was reading the documentation and a much longer amount of time was spent pondering the implications of incorporating the library into Boost. - Are you knowledgeable about the problem domain? > Yes. I've used Qt signals, Boost.Signals1, and Boost.Signals2 extensively in various projects. > - Do you think the library should be accepted as a Boost library? > No. -- David Sankel

4 6

[algorithm] split_copy
by Chambers, Matthew 13 Dec '16

13 Dec '16

I like the simplicity and flexibility of boost::algorithm::split, but whenever I do some one-off, trivial split with it where performance isn't an issue, I find myself wishing that I didn't have to predeclare the result container. That is, I want a split_copy which returns the result container by value, analogous to the many other *_copy functions in boost::algorithm. This turns the split into an easy to read one-liner. Is there a technical reason that this doesn't exist, or just something the boost::algorithms developer didn't think was sufficiently sweet (syntactic-sugar-wise) to add? Thanks, -Matt

2 2

Synapse library review starts today December 2
by Edward Diener 13 Dec '16

13 Dec '16

The formal review of the Synapse library by Emil Dotchevski starts today, December 2, and is scheduled to continue through December 11. This gives two full weekends and the week in between for the formal review. Synapse is a signal programming library, similar to Boost Signals2 and the signals-slots system in Qt. The main difference is that Synapse is non-intrusive: the address of any object of any static type whatsoever can be passed to synapse::emit to emit a signal. This makes it possible to emit Synapse signals from objects of third-party types as well as system objects (e.g. standard FILE pointers, HWNDs, etc.) or any other object that can be converted to a pointer. The library has been formatted to fit the Boost directory and namespace structure. To get Synapse, clone 'https://github.com/zajo/boost-synapse.git' into a directory called 'synapse' under your boost/libs directory. See the tutorial at 'http://zajo.github.io/boost-synapse/Tutorial.html', or read full documentation at 'http://zajo.github.io/boost-synapse/index.html'. You can also view the documentation locally from your clone of the library at boost/libs/synapse/doc/index.html. Review guidelines ================= Reviews should be submitted to the developer list (boost(a)lists.boost.org) preferably with '[synapse]' in the subject. Or if you don't wish to for some reason or are not subscribed to the developer list you can send them privately to me at 'eldiener at tropicsoft dot com'. If so, please let me know whether or not you'd like your review to be forwarded to the list. For your review you may wish to consider the following questions: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should attempt to answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Even if you do not wish to give a full review any technical comment regarding the library is welcome as part of the review period and will help me as the review manager decide whether the library should be accepted as a Boost library. Any questions about the use of the library are also welcome. I encourage all programmers with an interest or knowledge of signal/slot processing to be part of the review or discussion of the Synapse library as your time permits.

8 27

[spirit] [qi] What's the differences between qi::uint_parser<int>() and qi::uint_parser<unsigned int>()?
by Han Wang 13 Dec '16

13 Dec '16

Both of them are the same as qi::uint_(parsing integers from 0 to UINT_MAX). For qi::uint_parser<int>, the required maximum value of numeric base type int is not used at all.

2 1

[release 1.63] required bugfixes
by Oliver Kowalke 13 Dec '16

13 Dec '16

Hi, during the test of boost-1.63 rc 1 some problems occurred (see Marshall's and Stephan's postings). I request to merge my last commits (on branch master) from boost.context and boost.fiber into boost-1.63 (rc 2?) - as well as commit 13f5d9c88ae5363fe547f04c1d272b2a772a8b4d from boost.config. Otherwise the build will fail for gcc-7.1, clang-4.0 and mingw64. best regards, Oliver

1 0

[fiber] Boost.Fiber 1.63.0 RC1 tries to use std::mutex which MinGW doesn't have
by Stephan T. Lavavej 13 Dec '16

13 Dec '16

In both 1.62.0 and 1.63.0 RC1, building Boost.Fiber with my MinGW-w64 distro fails. That's because libstdc++ doesn't natively support the Clause 30 multithreading headers (std::mutex etc.) on Windows, and I make no attempt to build wrappers between the Windows and POSIX APIs (which is my personal choice). Boost's build system should detect this, and use the perfectly valid Boost.Thread implementation. Indeed, "C++11 mutex : no" is printed during the build's configuration, but Fiber's build fails anyways. My configuration output, and the errors emitted by a typical translation unit, are recorded here: https://github.com/StephanTLavavej/mingw-distro/issues/28 Thanks, STL

1 0