March 2017 - Boost - lists.preview.boost.org

[stacktrace] Review
by Bjorn Reese 25 Mar '17

25 Mar '17

I vote for the unconditional acceptance of Boost.Stacktrace. The design is sound. The separation of stacktrace and frame is just right, and safe_dump_to is an elegant solution to handle async-safety (much better than the fork-exec alternative.) The implementation (I did not look at the Windows parts) looks solid. There are details that looks platform-specific -- e.g. "/proc/self/exe" in detail/addr2line_impls.hpp is not Posix -- but I did not notice anything that cannot be ported if needed. The documentation is well-structured. I appreciate that the reference documentation contains both complexity and async-handler-safety comments. This library is very useful to developers. I spent a couple of hours going through the documentation and source for the review. Prior to that I have followed the development of this library, and used an earlier version in a commercial product. I have in-depth knowledge of the Posix side (having once implemented an async-safe stacktrace.) Wishlist: Make throw_with_trace of the API. Put it in a separate header so there is no dependency on Boost.Exception unless this header is included. In order to be consistent with Boost.Exception I suggest that the throwing function is called stacktrace::throw_exception(). Add an example with basic_stacktrace that uses a custom allocator. Add a simpler example that uses std::terminate(). The current one is rather overwhelming. Notice that I am not asking for the current example to be removed. Minor comments: Add a note to Getting Started that the stored backtrace.dump only is valid if the program has not be re-compiled between runs, as this is what developers do all the time. I have no opinion about windows.h.

1 0

[stacktrace] library review
by Artyom Beilis 25 Mar '17

25 Mar '17

Hello, There is my review. Note: I reviewed the library in previous round and voted no. So the current review was mostly review of the problems I found. - What is your evaluation of the design? The design is solid and minimalist as it suppose to be for such a library. Good separation for different backends. I still lack the out of the box "throw exception with stacktrace"/catch and print trace as I written in previous review but I don't think it is show stopper. i.e. "throw_with_trace" as shown in examples should be part of the library as it is one of most useful features. - What is your evaluation of the implementation? The implementation is OK but there are several issues (mostly in backend) I need to point out: I used this trivial program for run time testing #include <boost/stacktrace.hpp> #include <iostream> void foo() { std::cout << boost::stacktrace::stacktrace() << std::endl; } void bar() { foo(); } int main() { bar(); } Addr2Line Backend: --------------------------- In order to get the stacktrace the addr2line is called for each frame - i.e. stack of 4 functions results in 4(!!!) forks need to be fixed This is sample of stace output for trivial example, it can be reduced to 2 fork/exec at most [pid 7985] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040AFC2"], [/* 75 vars */]) = 0 [pid 7986] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040B02D"], [/* 75 vars */]) = 0 [pid 7987] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040B039"], [/* 75 vars */]) = 0 [pid 7988] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "/lib/x86_64-linux-gnu/libc.so.6", "0x00007EFD582A6830"], [/* 75 vars */]) = 0 [pid 7989] execve("/usr/bin/addr2line", ["addr2line", "-Cpe", "./a.out", "0x000000000040AEB9"], [/* 75 vars */]) = 0 This is something easy to fix and I expect it to be fixed before library is delivered to the official release. Libbacktrace Backend: ------------------------------ Linux: using libbacktrace without debug information results core dump - seems, the dump happens in ::backtrace_pcinfo happens for both g++ 4.8 and 5.4 Please make sure you can workaround this problem. This MUST be fixed. Windows/MinGW I build libbacktrace for mingw (tested it to make sure I can get traces using its API) However when I used boost.stacktrace with libbacktrace the program crashed every time in any configuration I used (with or without debug information) it worked with default build (without) but its usability is limited. This MUST be fixed (or if impossible mark as libbacktrace unusable for MINGW32) OS Support FreeBSD ------------------------------- FreeBSD - 100% unusable at this point - also I must say for FreeBSD it may be tricky due to : I needed to do some changes in CppCMS's backtrace library recently due to shift of latest freebsd to clang Take a look: https://github.com/artyom-beilis/cppcms/commit/18c3f05bfa9e4008aeac39322e8a… https://github.com/artyom-beilis/cppcms/blob/master/booster/lib/backtrace/s… It also may say that you WILL have problems with Mac OS X. $ c++ -v FreeBSD clang version 3.8.0 (tags/RELEASE_380/final 262564) (based on LLVM 3.8.0) Target: x86_64-unknown-freebsd11.0 Thread model: posix InstalledDir: /usr/bin $ uname -a FreeBSD freebsd11 11.0-RELEASE-p1 FreeBSD 11.0-RELEASE-p1 #0 r306420: Thu Sep 29 01:43:23 UTC 2016 root@releng2.nyi.freebsd.org:/usr/obj/usr/src/sys/GENERIC amd64 $ c++ -I ../boost_stacktrace/include/ -I ../boost_1_63_0/ -Wall -O0 -g st.cpp In file included from st.cpp:1: In file included from ../boost_stacktrace/include/boost/stacktrace.hpp:15: In file included from ../boost_stacktrace/include/boost/stacktrace/frame.hpp:205: In file included from ../boost_stacktrace/include/boost/stacktrace/detail/frame_unwind.ipp:36: ../boost_stacktrace/include/boost/stacktrace/detail/safe_dump_posix.ipp:36:63: error: use of undeclared identifier 'S_IFREG' const int fd = ::open(file, O_CREAT | O_WRONLY | O_TRUNC, S_IFREG | S_IWUSR | S_IRUSR); ^ ../boost_stacktrace/include/boost/stacktrace/detail/safe_dump_posix.ipp:36:73: error: use of undeclared identifier 'S_IWUSR' const int fd = ::open(file, O_CREAT | O_WRONLY | O_TRUNC, S_IFREG | S_IWUSR | S_IRUSR); ^ ../boost_stacktrace/include/boost/stacktrace/detail/safe_dump_posix.ipp:36:83: error: use of undeclared identifier 'S_IRUSR' const int fd = ::open(file, O_CREAT | O_WRONLY | O_TRUNC, S_IFREG | S_IWUSR | S_IRUSR); ^ In file included from st.cpp:1: In file included from ../boost_stacktrace/include/boost/stacktrace.hpp:15: In file included from ../boost_stacktrace/include/boost/stacktrace/frame.hpp:205: ../boost_stacktrace/include/boost/stacktrace/detail/frame_unwind.ipp:75:7: error: no member named '_Unwind_Backtrace' in the global namespace ::_Unwind_Backtrace(&boost::stacktrace::detail::unwind_callback, &state); ~~^ st.cpp:3:14: warning: treating Unicode character as whitespace [-Wunicode-whitespace] void foo() { std::cout << boost::stacktrace::stacktrace() << std::endl; } ^ st.cpp:3:17: warning: treating Unicode character as whitespace [-Wunicode-whitespace] void foo() { std::cout << boost::stacktrace::stacktrace() << std::endl; } ^ st.cpp:4:14: warning: treating Unicode character as whitespace [-Wunicode-whitespace] void bar() { foo(); } ^ 3 warnings and 4 errors generated. I have another suggestion regarding testing. I didn't run them but since you didn't catch crash with libbacktrace without debug mode you probably have all compiled with debug information I suggest to modify the set of tests that you run on entire matrix: {backend}x{debug mode on/off/external PDB/debug information}x{rdynamic on/off} - What is your evaluation of the documentation? Documentation is fairly good - What is your evaluation of the potential usefulness of the library? VERY useful one the bugs are fixed. - Did you try to use the library? With what compiler? Yes: I tested on Linux gcc 5.4/4.8/clang++ Windows MinGW 5.x; FreeBSD clang 3.8 > Did you have any problems? Lots - see notes above. - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? Several hours running code reading backeds code. - Are you knowledgeable about the problem domain? Yes I had written one for CppCMS that runs on many platforms. And finally, every review should attempt to answer this question: - Do you think the library should be accepted as a Boost library? Yes, Subject to: - Fix of build/run issues on all major platforms including MINGW and FreeBSD - it was too easy to find issues I really concerns me - it is show stopper for the library to be released as part of boost. - FIx crashes with libbacktrace - Fix of addr2line performance - no need to fork/exec for each frame Note: I understand that it is hard for the author to fix all stuff on all platforms - but stacktrace by definition is doing something non portable in portable way. Best Regards, Artyom Beilis

1 0

Boost MSM parallel behavior with delayed self-transitions?
by Christophe Henry 24 Mar '17

24 Mar '17

Hi Danylo, >Hi Christophe, > >Thanks for your input. I'm going to use std::thread for the parallel >functionality, I think. it will work with synchronization. For simple cases it's manageable. >How stable/complete is Asynchronous? Can I rely on >it, or would I still have a moderate chance of running into bugs? It's very stable and used intensively in production code (in the industry) since 2 years. You might find some bug of course, but no stability problem has been found since a long time. > >Best, > >Danylo. > >PS. I love your documentation! What do you use for state machine diagrams - >MagicDraw? Enterprise Architect. Regards, Christophe

2 4

[Stacktrace] - review comments
by mbartosik 24 Mar '17

24 Mar '17

There are a few major uses of a stack trace library which have differing needs. 1) Fast signal-safe gathering of the stack frames the current thread (something that can run in either a Windows VectoredExceptionHandler or a unix Signal handler). 2) Gather of the stack frames for an exception in the current thread. 3) Gathering of stack frames for the current thread even if it means remote loading of symbol files. 4) Gathering of the stack frames for a paused thread (could even be in a different process). 5) Resolving symbols which is a VERY heavy weight task, potentially resolving symbols long after the target process for which the stack trace was made has exited. e.g. deserializing a stack trace from a log file and creating an annotated version with symbols added. In the case where I what to gather a stack trace for the current thread while handing a seg-fault or first-chance exception call I want to gather a code pointer for each stack frame efficiently (meaning no more than one pointer per frame, and no unnecessary calls or remote symbol loads) I believe that the library does address this, however, I am unsure of whether it can be requested to be more or less aggressive in what it does to walk the stack of highly optimized code, for example, in the most aggressive case it could cause symbols to be remotely downloaded from a webserver (e.g. http://msdl.microsoft.com/download/symbols) to download Microsoft .PDB files which contain information necessary to walk the stack of highly optimized code. I would like to see some control over how aggressive it is in walking the stack. On x86 the least aggressive would be walking the ESP / EBP+retaddr singly linked chain, the most aggressive would be to remote download .PDB files and use one of the Microsoft APIs to do the walking. I am unsure that it can gather a stack trace from a different thread. This is admittedly a less common case, and possibly not worth holding up the library for, although it would be good to hear how the author thinks such a library interface would look. Is there / should there be, any control over what is included in the frame to_string() e.g. should all arguments be included, should full path of source file be included? If so how is this to be controlled? If not then should what going in there be documented? Now for the major issue. I asked earlier at what point does symbol resolution happen, and I was told it is on-demand and that the storage per frame is a single pointer, implying that there is no caching. Since resolving symbols is very very expensive it is desirable to have caching of function/frame names. I can certainly image a developer streaming a frame to the a log file multiple times and then being surprised when his/her program slows down orders of magnitude. Caching of frame names is contrary to the idea of having just one pointer stored per frame. This makes me wonder if the underlying OS or library calls provide sufficient caching to avoid the cost of a second call to boost::stacktrace::frame::to_string being too great? Resolving of the symbols requires not just an absolute address, but if symbols are to be resolved 'after exit'/post mortem by another process it requires the RVA (relative virtual address) and the module for code (e.g. path to shared library / dll, etc.) This can be deduced from the absolute virtual address in the process, plus the module load address (which maybe different each time the module loads). What I would like to see is the ability to have an efficient stack trace object that requires only one pointer per frame. Plus something that is able to resolve symbols,* including post-mortem after a process has exited*. These two goals I think result in multiple classes. A light weight stacktrace class, in here to_string() would yield a pointer value. A symbolic_stacktrace class, in here to_string() would yield a human readable symbol resolved string. For the case of creating a symbolic_stacktrace from a serialized stacktrace post-mortem a module_list would also be required, in the case that the same process is used a symbolic_stacktrace would be creatable only from a stacktrace. Whether boost::stacktrace::frame stores a void * or a function pointer is a little interesting -- as technically the pointers are not function pointers but usually code pointers as they do not point to the beginning on a function. Having said all this, the current design does cover a simple case. Summary: * Control of how aggressive stack walking is. * Ability to walk stack of another thread including in another process. * boost::stacktrace::frame::to_string should be efficient for 2nd and 3rd and multiple calls, but not require more than a single pointer to be stored in the boost::stacktrace::frame. This implies either a different class for symbol resolution or external caching. * Control over what boost::stacktrace::frame::to_string includes (or define it). * Ability to work with post-mortem data. e.g. serialize a boost::stacktrace plus other information (a list of modules) and then deserialize and resolve symbols after the process has exited. * Work with boost serialization - Mark -- View this message in context: http://boost.2283326.n4.nabble.com/Stacktrace-review-comments-tp4692904.html Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Using clang 4.0.0 with b2/bjam fails missing cstddef in boost/config/select_stdlib_config.hpp
by Paul A. Bristow 24 Mar '17

24 Mar '17

I have installed the shiny new Clang at c:\llvm\ with MS Visual Studio 2015 update 3 I have added Clang to my user-config.jam thus using clang ; or in full detail: using clang : # version 4.0.0 : # location Clang compiler .exe location. # from http://llvm.org/releases/download.html dated 9Mar2017 c:\\LLVM\\bin\\clang++.exe : # options <warnings>on <cxxflags>-v ; and tried to invoke it thus I:\modular-boost\libs\hello_boost\example>b2 toolset=clang-4.0.0 -d2 --debug-configuration > clang40_24Mar17.log (.log file attached in case that helps). It starts well but comes to a terminal halt missing cstddef in boost/config/select_stdlib_config.hpp clang version 4.0.0 (tags/RELEASE_400/final) Target: x86_64-pc-windows-msvc Thread model: posix InstalledDir: c:\LLVM\bin "c:\\LLVM\\bin\\clang++.exe" -cc1 -triple x86_64-pc-windows-msvc19.0.24123 -emit-obj -mrelax-all -mincremental-linker-compatible -disable-free -main-file-name hello_boost.cpp -mrelocation-model pic -pic-level 2 -mthread-model posix -fmath-errno -masm-verbose -mconstructor-aliases -munwind-tables -target-cpu x86-64 -momit-leaf-frame-pointer -v -dwarf-column-info -debug-info-kind=limited -dwarf-version=4 -debugger-tuning=gdb -coverage-notes-file "I:\\modular-boost\\libs\\hello_boost\\example\\..\\..\\..\\bin.v2\\libs\\hello_boost\\example\\hello_boost.test\\clang-linux-4.0.0\ \debug\\hello_boost.gcno" -resource-dir "c:\\LLVM\\bin\\..\\lib\\clang\\4.0.0" -D BOOST_ALL_NO_LIB=1 -I "..\\..\\.." -internal-isystem "c:\\LLVM\\bin\\..\\lib\\clang\\4.0.0\\include" -internal-isystem "C:\\Program Files (x86)\\Windows Kits\\10\\Include\\10.0.10586.0\\ucrt" -O0 -Wno-unused-local-typedef -Wno-dll-attribute-on-redeclaration -Wall -fdeprecated-macro -fdebug-compilation-dir "I:\\modular-boost\\libs\\hello_boost\\example" -ferror-limit 19 -fmessage-length 0 -fms-extensions -fms-compatibility -fms-compatibility-version=19.0.24123 -std=c++14 -fdelayed-template-parsing -fno-inline -fobjc-runtime=gcc -fcxx-exceptions -fexceptions -fdiagnostics-show-option -o "..\\..\\..\\bin.v2\\libs\\hello_boost\\example\\hello_boost.test\\clang-linux-4.0.0\\debug\\hello_boost.obj" -x c++ hello_boost.cpp clang -cc1 version 4.0.0 based upon LLVM 4.0.0 default target x86_64-pc-windows-msvc #include "..." search starts here: #include <...> search starts here: ..\..\.. c:\LLVM\bin\..\lib\clang\4.0.0\include C:\Program Files (x86)\Windows Kits\10\Include\10.0.10586.0\ucrt End of search list. In file included from hello_boost.cpp:15: In file included from ..\..\..\boost/config.hpp:44: ..\..\..\boost/config/select_stdlib_config.hpp:18:12: fatal error: 'cstddef' file not found # include <cstddef> I have two versions of cstddef C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\include\cstddef exists and refers to other files. contains // cstddef standard header #pragma once #ifndef _CSTDDEF_ #define _CSTDDEF_ #include <yvals.h> and another at C:\programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\6.3.0\include\c++; My PATH has (amongst other items) C:\Programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\bin; C:\programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\6.3.0\include; C:\programfiles\mingw-w64\x86_64-6.3.0-win32-seh-rt_v5-rev1\mingw64\lib\gcc\x86_64-w64-mingw32\6.3.0\include\c++; C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\include; Is this expected (rather than clang-msvc-14.0)? notice: will use 'clang++' for clang-linux, condition <toolset>clang-linux-4.0.0 Anyone can give a clue as to what I am doing wrong? Thanks Paul --- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830

1 0

[build] VC++ 2017 version number?
by Beman Dawes 24 Mar '17

24 Mar '17

Boost.build in develop is treating VC++2017 RTW (aka RTM) as msvc-14.1. Yet the Visual Studio 2017 RTW Help "About Microsoft Visual Studio" shows the version as "15.0.0-RTW+26228.4" Shouldn't boost.build follow Microsoft's numbering? Seems like calling 2017 RTW anything except 15.0 is a recipe for confusion. --Beman

12 15

Re: [boost] Constructing string_ref from rvalue string
by Mathias Gaunard 24 Mar '17

24 Mar '17

On 23 Mar 2017 7:02 am, "Jonathan Müller via Boost" <boost(a)lists.boost.org> wrote: I've just blogged about this topic: http://foonathan.net/blog/2017 /03/22/string_view-temporary.html (Planned that post before this thread) In my opinion I think `boost::string_ref` and `std::string_view` are two different things, They're not. They were always supposed to be the same thing. There is a lot of code out there that uses std::string_view and boost::string_ref interchangeably depending on which is available.

3 2

Re: [boost] [partly OT] Re: [review queue] What to do about the library review queue?
by Glen Fernandes 24 Mar '17

24 Mar '17

peterkochlarsen wrote: > Also an unmaintained library should be marked as such as should > libraries that are deprecated, replaced by standard C++ features > (shared_ptr comes to mind) shared_ptr (or Boost.SmartPointers in general) is not unmaintained, and is not deprecated. It actually has been evolving past the C++11 std::shared_ptr. For example, boost::shared_ptr supported array forms in 1.53 and this was eventually added to C++ in C++17. (Interesting aside: That functionality above was even, and still is used, in certain Microsoft projects, where boost::shared_ptr is used instead of std::shared_ptr). The same goes for other Boost libraries like Boost.Thread. They: - May have features not in the C++ standard library equivalent - May be evolving past the current C++ standard - Are in use by actual projects and shouldn't be removed Glen -- View this message in context: http://boost.2283326.n4.nabble.com/review-queue-What-to-do-about-the-librar… Sent from the Boost - Dev mailing list archive at Nabble.com.

15 51

Is there any interest in type-safe container of bool flags with noexcept guarantees?
by Роман Орлов 23 Mar '17

23 Mar '17

Hello Boost community, I'd like to determine interest in this kind of container. Motivation For managing sets of bool flags developers often use std::bitset or c-like manual bit manipulations. Each approach brings problems. Some disadvantages of using std::bitset: * unpredictable and greedy allocation of bit storage; * setters/getters can throw exceptions; * it operates in low-level terms like "a bit number"; * we can easily assign one instance of std::bitset to another with the same number of bits but semantically they may differ. Proposal Instead of managing bits via numbers let's manage them via types. So start by declaring some types class eats_meat; class eats_grass; class has_tail; Then bind these types to flag identifiers typedef typed_flags<eats_meat, eats_grass, has_tail> animal; Unlike std::bitset the 'animal' instance allocates a minimal possible storage (in this case sizeof(animal) == 1). Create flags from scratch animal wolf; wolf.set<eats_grass>(false); wolf.set<eats_meat, has_tail>(); wolf.set(flag<has_tail>{1}, flag<eats_meat>{1}); Create flags with a flexible human-readable constructor wolf = animal{flag<has_tail>{1}, flag<eats_meat>{1}, flag<eats_grass>{0}}; I have implemented a minimal working prototype in my github repo https://github.com/compmaniak/typed_flags If you're interested you can try it online here http://melpon.org/wandbox/permlink/55g1czUjwSFO8LS1 Expected benefits * delegating calculation of a bit position for a certain type to compiler gives us a strong type safety and prevents typos; * noexcept guarantee of setting and getting bit values; * we shouldn't take care of bits because we work in terms of typed properties; * great readability, taking a short glance on a type definition tells you what this type is about. Some people on reddit (https://redd.it/601upg) found this library useful. Any thoughts on the idea of the container would be much appreciated. -- Roman

8 13

[release] 1.64.0 please test master snapshot
by Rene Rivera 23 Mar '17

23 Mar '17

Looks like 14.1/141 won out the version hysterics. And I've merged in the PRs for that change. Please give the latest master snapshot archives a try. And report both failures and success: <https://dl.bintray.com/boostorg/master/> If nothing Earth shattering comes up this will become the beta on Wednesday 22 (before 24:00 CDT). -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

5 5

Re: [boost] [release] 1.64.0 please test master snapshot
by Rene Rivera 22 Mar '17

22 Mar '17

On Tue, Mar 21, 2017 at 12:36 PM, Tom Kent <lists(a)teeks99.com> wrote: > It looks like the boostorg/boost:master commit this snapshot was based off > doesn't have the latest boostorg/config:master submodule commit. I think > updating this is a manual process at this point in the release cycle? (Thus > the autolink file is still looking for vc150). > Grr.. Forgot to do that for config. I did it for build though :-) It's done now.. Just need to wait again for the new archives. > As an aside, I had a difficult time figuring out what the snapshot I > downloaded referred to. I was able to use the boost_1_64_0_snapshot.tar.bz2.json > file to determine that I had the correct boost_1_64_0_snapshot.tar.bz2, but > bintray doesn't make it super clear what git commit this snapshot download > refers to. > > Would it be possible to add a file to snapshots/releases that contains the > git commit hash? > Can't promise I'll do it right this second... But I'll add the commit hash to the json data for the archives. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

7 14

Boost MSM parallel behavior with delayed self-transitions?
by Christophe Henry 22 Mar '17

22 Mar '17

Hi Danylo, >Hi community, > > I am using Boost MSM (basic and functor front-ends) and am trying to >implement the following state machine (https://i.stack.imgur.com/K79qk.png ): Ok, State1 is itself a state machine (also called composite). See: http://www.boost.org/doc/libs/1_63_0/libs/msm/doc/HTML/ch02s02.html#d0e151 and: http://www.boost.org/doc/libs/1_63_0/libs/msm/doc/HTML/ch03s02.html#d0e529 Then you have 2 active states, which are called orthogonal regions. See: http://www.boost.org/doc/libs/1_63_0/libs/msm/doc/HTML/ch03s02.html#d0e577 >I am using Boost MSM (basic and functor front-ends) and am trying to >implement the following state machine: enter image description here > >In words: < snip > > >I would like to know the way to create this state machine in Boost MSM. The above link has an example. >There are two tricks here which I cannot figure out how to do: > > - Execution in parallel (i.e. running action_A does not stop running >action_B at the same time) It depends what you mean with "in parallel". Having 2 active states means that the actions execute only logically at the same time, meaning within the same process_event call. But as you have just one thread, they will execute after each other. If you mean in different threads, then no, the library does not support this. But my next library, Asynchronous does ( https://github.com/henry-ch/asynchronous) I have examples with state machines, timer, etc. >- Delayed transition (i.e. the transitions which happen after 2 >seconds for state A and after 5 seconds for state B). Neither delay >should be blocking! The transitions should just "fire" after this time. Sorry, this is out of scope of the library as it would involve threads. You can do one of the following: - use your own timer (Boost.Asio offers one) and handle thread safety yourself. - have a look at Asynchronous. Sorry if it looks like advertising, but the library was written for this kind of things. >Thank you very much for helping, > >Danylo. HTH, Christophe

3 4

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

22 Mar '17

Hi, In the last few days I finished a toy implementation with continuous integration at https://github.com/htfy96/gsoc-static-map, which has been tested on g++5/6 and clang++3.8/3.9. Current test failure is as expected due to g++-5's incomplete constexpr optimization. Besides, my proposal draft has been submitted which includes a very tiny benchmark with boost::hana on compile-time lookup performance on map<int, int> structure. Any kind of suggestion is welcomed at https://gist.github.com/htfy96/0bd9b3200d9a0e67f449edc40bfa43b5*. * Thanks,* * -- --------------------------------- Vic Luo Shanghai Jiaotong University Key fingerprint 0x98809ca08bf5662a

1 0

Re: [boost] [release] 1.64.0 please test master snapshot
by Olaf van der Spek 22 Mar '17

22 Mar '17

On Wed, Mar 22, 2017 at 12:45 PM, Andrey Semashev <andrey.semashev(a)gmail.com> wrote: >> Right, boostorg doesn't have tickets enabled though.. where should I >> open a ticket? > > > Probably, in Trac: I hate Trac. > https://svn.boost.org/trac/boost/newticket?component=algorithm;version=Boos… > > Although since it's fixed in develop and there is a PR for merge to master, > I'm not sure there's much point in a ticket. I meant in general. -- Olaf

1 0

Re: [boost] [release] 1.64.0 please test master snapshot
by Andrey Semashev 22 Mar '17

22 Mar '17

And once again, this went to Olaf directly instead of the list. Re-sending. On 03/22/17 14:45, Andrey Semashev wrote: > On 03/22/17 13:45, Olaf van der Spek wrote: >> On Wed, Mar 22, 2017 at 11:05 AM, Andrey Semashev via Boost >> <boost(a)lists.boost.org> wrote: >>> On 03/22/17 11:59, Olaf van der Spek via Boost wrote: >>>> >>>> VC2015 /std:c++latest: >>>> >>>> struct to_lowerF : public std::unary_function<CharT, CharT> >>>> >>>> boost\algorithm\string\detail\case_conv.hpp(33): error C2143: syntax >>>> error: missing ',' before '<' >>> >>> >>> This seems to be fixed in develop but not merged to master. I've >>> created a >>> PR to do the merge: >>> >>> https://github.com/boostorg/algorithm/pull/34 >>> >>>> https://github.com/mclow/String-Algo/issues/7 >>> >>> >>> That ticket is for a fork, not the boostorg repo. >> >> Right, boostorg doesn't have tickets enabled though.. where should I >> open a ticket? > > Probably, in Trac: > > https://svn.boost.org/trac/boost/newticket?component=algorithm;version=Boos… > > > Although since it's fixed in develop and there is a PR for merge to > master, I'm not sure there's much point in a ticket. >

1 0

Re: [boost] GSoC proposal
by Vissarion Fisikopoulos 22 Mar '17

22 Mar '17

Hi Rasul, thanks for your interest in Boost.Geometry. I guess you have already read this https://svn.boost.org/trac/boost/wiki/SoC2017 There are two possibilities: either you provide a library (with some standards described in the webpage) or you do the test. My opinion is that doing the test (even if not needed) will first strengthen your application and second will give you a good overview of the problem you are going to work on, if selected. >From your repo what is the library that you propose for your application and meets the requirements described in the webpage above (e.g. no coursework, more than 6 months old etc)? The tests are described here: https://svn.boost.org/trac/boost/wiki/SoC2017#a3.Boost.Geometry Depending on what (?) project you prefer to pursue there is a corresponding test. Best, Vissarion ps. I copy the message to boost list so the community can follow and provide feedback if needed On 22 March 2017 at 12:00, Rasul Kerimov <rkerimov(a)std.qu.edu.az> wrote: > Hey Mr. Fysikopoulos, > > I'm really interested in Boost GSoC 2017 project proposal, but I don't > know how to pass Programming competency Test. > > I have a github repo with all my codes that I wrote in C++, but I > don't know if it's enough to pass test. > > Github page: https://github.com/CoderINusE/ > Github repo: https://github.com/CoderINusE/Algorithms-data-structues > > I will be grateful for any response. Thank you!

1 0

[release] 1.64.0 Delayed because of Microsoft (version numbers)
by Rene Rivera 21 Mar '17

21 Mar '17

Sorry to say the beta release of 1.64.0 is hereby going to be delayed for at least another week. The confusion of VS2017 version numbers and the communities inability to address this issue after the beta is to blame. To address the situation the beta release will be published when one of the two tasks below are completed: (A) Boost Config changes to use 1410 as the autolink version to match what the currently working generated libs are taggeg with. Or: (B) The community decides what version number we should be using and the appropriate PRs are filed and applied and tested for all the repos involved. Which means: 1. The community has until 12:00 CDT US March 18 to decide on what the vc version number and tag should be. 2. The community must post PRs for the places where we reference VS2017 version numbers to the new number. Those are at least: <https://github.com/boostorg/config> <https://github.com/boostorg/build> <https://github.com/boostorg/boost> <https://github.com/boostorg/website> People have until 17:00 CDT Monday March 20 to submit those PRs. 3. The community can test the resulting master snapshot when available at the latest 24:00 Monday March 20. 4. If all goes well we can have a beta release on Wednesday March 22 (ie one week late). -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

17 26

[stacktrace] Review
by Peter Dimov 21 Mar '17

21 Mar '17

I think that the Stacktrace library should be ACCEPTED. The design is good. It's unfortunate that to get a stacktrace class that stores the capture internally in a fixed-size array, as the first iteration did, one has to write a special allocator, more so because such an allocator isn't readily available (we don't have one in Boost, for instance). This could easily be addressed by templating basic_stacktrace on a container (default std::vector<frame>) instead, which would allow boost::container::static_vector to be used. The implementation is good. The main problem here, as already discussed in detail, is that under Windows clients of the library that don't make use of the facilities that require windows.h and COM headers to be included still suffer the penalty of this inclusion. Fixing this will be a significant increase in usability. The documentation is adequate, although it could use some editing by a native speaker. The library is potentially very useful. Assert handlers, exceptions and termination handlers can (and should) all make use of it. Wide use under Windows is however hampered by the limitation described above. I tested the library under Windows with msvc-14.0, 14.1, Cygwin g++/clang++. Under Cygwin there is no libbacktrace, but defining BOOST_STACKTRACE_USE_ADDR2LINE worked. I invested a fair chunk of time into my evaluation of the library, and am reasonably knowledgeable about the problem domain.

1 0

Re: [boost] [smart_ptr] Is there any interest in unique_ptr with type erased deleter?
by Andrey Davydov 21 Mar '17

21 Mar '17

On Tue, Mar 21, 2017 at 4:11 PM, Andrey Semashev <andrey.semashev(a)gmail.com> wrote: > On 03/21/17 14:54, Andrey Davydov wrote: > >> On Tue, Mar 21, 2017 at 2:15 PM, Andrey Semashev via Boost >> <boost(a)lists.boost.org <mailto:boost@lists.boost.org>> wrote: >> >> On 03/21/17 12:54, Andrey Davydov via Boost wrote: >> >> On Tue, Mar 21, 2017 at 12:00 PM, Richard Hodges >> <hodges.r(a)gmail.com <mailto:hodges.r@gmail.com>> wrote: >> >> What is required, more than simply creating a type-erased >> deleter? >> >> >> Also deleter must capture pointer, because pointer which was >> passed to >> constructor can differ from the pointer which will be deleted. >> For example, >> >> struct Base { /* ... */ }; >> struct Derived : Base { /* ... */ }; >> >> ptr<Derived> p1(new Derived); >> void * raw_p1 = p1.get(); >> ptr<Base> p2 = std::move(p1); >> void * raw_p2 = p2.get(); >> assert(raw_p1 != raw_p2); >> >> >> The above piece of code strikes me as very unsafe and better be >> avoided in the first place. Designing new tools to handle this case >> is IMHO misguided. >> >> Why this code is very unsafe? If change `ptr` to `shared_ptr` this will >> become perfectly valid and widely used pattern. >> > > Because comparing the void pointers is not safe in general. The above code > in particular will probably work (although not sure if even that's > guaranteed, depending on whether Base and Derived qualify as standard > layout classes), but if the class hierarchy is different, that code will > silently break. I agree, I wrote this code just to demonstrate that deleter must capture pointer because it can be changed due to upcasting. > But, of course, nothing stops you from saving the state in the deleter. > > struct poly_deleter > { > template< typename T > > poly_deleter(T* p) : m_p(p), m_delete(&poly_deleter::do_delete< T >) > { > } > > void operator() (void*) const noexcept > { > m_delete(m_p); > } > > private: > template< typename T > > static void do_delete(void* p) noexcept > { > delete static_cast< T* >(p); > } > > void* m_p; > void (*m_delete)(void*); > }; > > This will work even if you form std::unique_ptr<void, poly_deleter> (i.e. > don't have a universal base class). > Your poly_deleter implementation is the same as I used inside my smart pointer implementation, but there is an issue with std::unique_ptr<T, poly_deleter>, namely it is not constructible from std::unique_ptr<T, std::default_delete<T>> because poly_deleter must capture pointer and so it is not constructible from std::default_delete. -- Andrey Davydov

4 5

[smart_ptr] Is there any interest in unique_ptr with type erased deleter?
by Andrey Davydov 21 Mar '17

21 Mar '17

It is widely known that deleter type is part of std::unique_ptr type. It is the most effective decision, but sometimes not very convenient. The most important use cases (for me) when std::unique_ptr<T, std::default_delete<T>> doesn't work are following: 1. unique_ptr to incomplete class struct MyClass; unique_ptr<MyClass> create(); auto ptr = create(); // compilation error 2. upcast to base without polymorphic destructor struct Base { // ... // no virtual ~Base() here }; struct Derived : Base { // ... }; unique_ptr<Base> ptr = make_unique<Derived>(); // compiles by leaks! 3. unique_ptr with non-default deleter unique_ptr<FILE, int (FILE *)> open_file(std::string const & path) // works but looks ugly, why should the fact that fclose returns `int` be visible from the signature of the function `open_path`? { return { std::fopen(path, "r"), &std::fclose }; } Of course, all this examples could be fixed if unique_ptr would be replaced by shared_ptr, but the semantic of the shared ownership is not desirable often. I have implemented smart pointer with semantics of unique ownership and type erased deleter (https://github.com/AndreyG/unnamed) It has size of 3 pointers and it doesn't require additional memory allocations for the case when deleter is empty class (for example, std::default_delete or non-capturing lambda) and for the case when deleter is known at compile time function (for instance, fclose). The are some simple examples of usage and tests in the repo. Why don't just use unique_ptr<T, function<void (void *>>? The main reason is that due to the small object optimization std::function has rather big size. For instance, sizeof(unique_ptr<T, function<void (void *>>) == 72 for MSVC x64! Results for the other platforms can be found in the repo README. Does it seem useful? -- Andrey Davydov

5 11

[GSOC17] Regarding project Boost.uBLAS
by SHIVAM MITTAL 21 Mar '17

21 Mar '17

Hi, I am *Shivam Mittal*, a sophomore student of *Computer Science & Engineering *discipline of *Indian Institute of Technology, Ropar, India.* I wish to contribute to *Boost.uBLAS*, and develop cool and useful things with the community in GSOC 17. While going through the ideas list, I found the project *Data.Frames in boost.uBlas *very interesting and suitable for me. I think I am well prepared for the task as described in the requirement section. I am very comfortable in C/C++ and fairly comfortable in MATLAB, Python, HTML, CSS, PHP, SQL. I have more than 6 years of experience coding in C++. I have been developing data structures, algorithms, hardware simulators, artificial intelligence programs, and miscellaneous things in C++. The coursework (relevant to this project) which I have completed is : 1. Introduction to computing (in C++) 2. Data structures (in C++) 3. Linear Algebra Some of my selected projects are uploaded on github: https://github.com/shivam5 Please have a look at them. Some projects which I have implemented in C++ are: 1. Simple_RISC plagiarism checker 2. Simple_RISC functional and pipeline simulator 3. Pattern matching system by implementing hash tables. 4. Implementing graphs 5. Implementing AVL and Red black trees 6. Solcvng combinatorial auctions 7. Room booking system 8. Sudoku Solver I have implemented the programming competency test and sent the mentor on personal mail. Can you guide me further on how should I proceed and increase my chances of getting selected. Thank You, Shivam Mittal B.Tech Computer Science & Engineering, IInd Year Indian Institute of Technology Ropar Phone: +91-9888927245, +91-9899461223

1 0

Boost MSM parallel behavior with delayed self-transitions?
by Danylo Malyuta 21 Mar '17

21 Mar '17

Hi community, This is my first post, so I'm sorry for any mistakes in style. I have also posted this question on StackOverflow: http://stackoverflow.com/questions/42920777/boost-msm-parallel-behavior-wit…. I am using Boost MSM (basic and functor front-ends) and am trying to implement the following state machine (https://i.stack.imgur.com/K79qk.png) enter image description here I am using Boost MSM (basic and functor front-ends) and am trying to implement the following state machine: enter image description here In words: 1. Enter state State1 2. Enter state A and execute action_A. After 2 seconds, print "Trying again..." and re-execute state A (i.e. call its entry action). This loops forever... 3. At the same time as 2 (i.e. "in parallel"), enter state B and execute action_B. After 5 seconds, print "Trying again..." and re-execute state B (i.e. call its entry action). This loops forever... I would like to know the way to create this state machine in Boost MSM. There are two tricks here which I cannot figure out how to do: - Execution in parallel (i.e. running action_A does not stop running action_B at the same time) - Delayed transition (i.e. the transitions which happen after 2 seconds for state A and after 5 seconds for state B). Neither delay should be blocking! The transitions should just "fire" after this time. Thank you very much for helping, Danylo.

2 1

Fwd: [gsoc17] Regarding Boost.Geometry
by Aditya Gupta 21 Mar '17

21 Mar '17

Hi I am Aditya Gupta, IInd Yr. B. Tech. Computer Science at IIT Ropar and I wish to work on Project 3 of Boost.Geometry (Nearly antipodal points distance accuracy improvement.) I have completed the competency test <https://github.com/adityagupta1089/earth-geometry>, but I think maybe it was too small or have I misinterpreted, anyways. I have an initial draft of my [GSoC proposal](https://gist.github. com/adityagupta1089/39863577e1716c55d86c98ff57623893) I have also attached my CV.

2 1

Re: [boost] [smart_ptr] Is there any interest in unique_ptr with type erased deleter?
by Andrey Semashev 21 Mar '17

21 Mar '17

For some reason my email went directly to Andrey instead of the mailing list. I'm re-sending the message below. PS: This has happened to me multiple times now after we moved the ML infrastructure. Is there a way to protect oneself from such mistakes? Am I the only one so inattentive to have this problem? On 03/21/17 16:11, Andrey Semashev wrote: > On 03/21/17 14:54, Andrey Davydov wrote: >> On Tue, Mar 21, 2017 at 2:15 PM, Andrey Semashev via Boost >> <boost(a)lists.boost.org <mailto:boost@lists.boost.org>> wrote: >> >> On 03/21/17 12:54, Andrey Davydov via Boost wrote: >> >> On Tue, Mar 21, 2017 at 12:00 PM, Richard Hodges >> <hodges.r(a)gmail.com <mailto:hodges.r@gmail.com>> wrote: >> >> What is required, more than simply creating a type-erased >> deleter? >> >> >> Also deleter must capture pointer, because pointer which was >> passed to >> constructor can differ from the pointer which will be deleted. >> For example, >> >> struct Base { /* ... */ }; >> struct Derived : Base { /* ... */ }; >> >> ptr<Derived> p1(new Derived); >> void * raw_p1 = p1.get(); >> ptr<Base> p2 = std::move(p1); >> void * raw_p2 = p2.get(); >> assert(raw_p1 != raw_p2); >> >> >> The above piece of code strikes me as very unsafe and better be >> avoided in the first place. Designing new tools to handle this case >> is IMHO misguided. >> >> Why this code is very unsafe? If change `ptr` to `shared_ptr` this will >> become perfectly valid and widely used pattern. > > Because comparing the void pointers is not safe in general. The above > code in particular will probably work (although not sure if even that's > guaranteed, depending on whether Base and Derived qualify as standard > layout classes), but if the class hierarchy is different, that code will > silently break. > >> Now, I can understand the need to perform casts on smart-pointers, >> but they should still provide some level of safety, at least the >> same level that is provided by pointer casts in the core language. >> But supporting casts should not require a new smart-pointer. And >> indeed it doesn't: >> >> template< typename U, typename T, typename D > >> std::unique_ptr< U, D > static_pointer_cast( >> std::unique_ptr< T, D >&& p) >> { >> D d = p.get_deleter(); >> return std::unique_ptr< U, D >( >> static_cast< U* >(p.release()), >> std::move(d)); >> } >> >> What is `D`? If it is std::default_delete<T> then function result type >> will be std::unique_ptr<U, std::default_delete<T>> and unlikely this >> type is very useful (even if it compiles). > > Ok, that won't work with std::default_delete<T>. But it will work with > this deleter: > > struct static_polymorphic_deleter > { > template< typename T > > void operator() (T* p) const noexcept > { > std::default_delete<T>()(p); > } > }; > > And it should work with a runtime polymorphic deleter that can be > written to implement your proposal (see below). > >> The other part of your proposal, which is polymorphic behavior with >> a deleter knowing the type to call the destructor on, can be solved >> by a custom deleter. I'm not sure a generalized version of such >> deleter would have a large demand, given that there is the >> alternative TONGARI J suggested, but I'm not opposed to a proposal. >> >> May be I doesn't understand what TONGARI J suggested, but >> how can `unique_ptr<T, void(*)(T*)>` hold stateful deleter? > > It doesn't, unless the required state is contained within the object > itself. But just to implement runtime polymorphism, no additional state > is required. > > struct base > { > protected: > ~base() = default; > }; > > struct derived : base > { > }; > > template< typename T > > void poly_deleter(base* p) noexcept > { > delete static_cast< T* >(p); > } > > template< typename T > > using poly_unique_ptr = std::unique_ptr< T, void(*)(base*) >; > > template< typename T > > poly_unique_ptr< T > make_poly_unique() > { > T* p = new T(); > return poly_unique_ptr< T >{ p, &poly_deleter< T > }; > } > > poly_unique_ptr< derived > pd1 = make_poly_unique< derived >(); > poly_unique_ptr< base > pb1 = std::move(pd1); > poly_unique_ptr< derived > pd2 = > static_pointer_cast< derived >(std::move(pb1)); > > But, of course, nothing stops you from saving the state in the deleter. > > struct poly_deleter > { > template< typename T > > poly_deleter(T* p) : m_p(p), m_delete(&poly_deleter::do_delete< T >) > { > } > > void operator() (void*) const noexcept > { > m_delete(m_p); > } > > private: > template< typename T > > static void do_delete(void* p) noexcept > { > delete static_cast< T* >(p); > } > > void* m_p; > void (*m_delete)(void*); > }; > > This will work even if you form std::unique_ptr<void, poly_deleter> > (i.e. don't have a universal base class). >

1 0

Problem with using matrix library with unit test library
by SHIVAM MITTAL 21 Mar '17

21 Mar '17

Hi everyone, I have been developing something, and basically it requires the two boost libraries - the matrix library and unit test library. I have a file test.cpp : #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/io.hpp> #include <boost/test/included/unit_test.hpp> #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE test BOOST_AUTO_TEST_SUITE(Integer_matrices) BOOST_AUTO_TEST_CASE(Constructors) { BOOST_CHECK(2 == 2); } BOOST_AUTO_TEST_SUITE_END() I am compiling this with: g++ -I <path to boost_1_63_0> test.cpp I'm getting the following error: /tmp/ccnxRzsf.o: In function `main': test.cpp:(.text+0x18aa1): undefined reference to `init_unit_test_suite(int, char**)' collect2: error: ld returned 1 exit status Any help will be greatly appreciated. Thanks.

2 1

[Convert] std::isspace requires unsigned #28
by Olaf van der Spek 21 Mar '17

21 Mar '17

Hi, > boost\convert\base.hpp(112): warning C6330: 'const char' passed as _Param_(1) when 'unsigned char' is required in call to 'isspace'. > boost\convert\base.hpp(115): warning C6330: 'const char' passed as _Param_(1) when 'unsigned char' is required in call to 'isspace'. https://github.com/boostorg/convert/issues/28 IMO the code should be fixed and it's not a documentation issue. What do you think? -- Olaf

6 17

Re: [boost] [release] 1.64.0 Delayed because of Microsoft (version numbers)
by Tom Kent 20 Mar '17

20 Mar '17

Sorry all, I meant to send this to the list but only replied to Daniel. This adds an option 4 and 5. On Sun, Mar 19, 2017 at 3:58 PM, Tom Kent <lists(a)teeks99.com> wrote: > > > On Sun, Mar 19, 2017 at 10:17 AM, Daniel James <dnljms(a)gmail.com> wrote: > >> On 19 March 2017 at 13:10, Tom Kent via Boost <boost(a)lists.boost.org> >> wrote: >> > >> > Option 1 - 14.10 Use microsoft toolset version based on cl.exe version >> -5. >> > This is the official version of the c++ toolset that microsoft has been >> > pushing (somewhere). The new $(VCToolsVersion) macro is "14.10.25017", >> this >> > macro is not available in previous versions of visual studio. >> > >> > build bootstrap would use bootstrap.bat vc1410 >> >> [snip] >> >> > Option 2 - 14.1 Use the abbreviated toolset version that microsoft uses >> for >> > their toolset version. The $(PlatformToolsetVersion) macro is "141". In >> > VS2015 this was "140". >> >> [snip] >> >> > I *think* that is all the reasonable options. Let the consensus form! >> >> I disagree, I think we should limit ourselves to values that Microsoft >> actually uses. As far as I'm aware, they don't use 1410, and they >> don't use 14.1. There are already too many ways of writing the version >> number, adding more will just add to the confusion. >> > > So 2-a would meet these requirements. However, I did overlook the mixed > options: > > Option 4 (141 and 14.10) - > build bootstrap would use bootstrap.bat vc141 > build of source would use b2 toolset=msvc-14.10 > build would generat libraries of the format libboost_NAME_vc141-OPTIONS-1_ > 64.lib > config would auto-link libraries of the same format > (4-a is the same as 2-a) > > Option 5 (1410 and 14.1) - > build bootstrap would use bootstrap.bat vc1410 > build of source would use b2 toolset=msvc-14.1 > build would generat libraries of the format libboost_NAME_vc1410-OPTIONS- > 1_64.lib > config would auto-link libraries of the same format > (5-a is the same as 1-a) > > Tom > >

1 0

About all these metaprogramming libraries
by Louis Dionne 20 Mar '17

20 Mar '17

Dear Boost, We've seen two metaprogramming libraries ask for a formal review on the list recently. I expect a third (Brigand) might join the party soon, and maybe even a fourth (Eric Niebler's meta). I think it would be wise to have a plan for how we're going to deal with this. Before going further, I'd also like to clear something out. Some people have asked whether "classic" metaprogramming libraries still had their place given that we now have Hana. As the author of Hana, I think the answer is yes. While Hana is (IMHO) easier to use and more powerful, it also has an important shortcoming. Hana is too slow when dealing with very large inputs. This is due to the fact that it can also handle values, which is much heavier than dealing with types only. This can be alleviated to some extent, but the truth is that our execution model (the compiler) simply has to do more work when handling values. Hence, I think Boost does need a modern classic TMP library to handle these cases where a library writer needs to handle gigantic type lists. I think marketing such a library as an advanced tool for library writers would be a service to the overall C++ community, but that's an orthogonal concern. However, Boost needs one such library, not four. I think we can't just do 4 reviews and include all the libraries that pass in Boost; that would be a huge disservice to our users, who will be left with the burden of choosing. Heck, if we can't even make our mind, how can they? So, how do we pick? Have we ever been in a similar situation where we have multiple competing libraries solving _exactly_ the same problem? Louis -- View this message in context: http://boost.2283326.n4.nabble.com/About-all-these-metaprogramming-librarie… Sent from the Boost - Dev mailing list archive at Nabble.com.

16 39

Newcomer Contributor to Boost C++ Libraries
by Aman Gupta 20 Mar '17

20 Mar '17

Hello everyone, I am Aman Kumar Gupta, an undergraduate 1st year student from International Institute of Information Technology, Bhubaneswar, India. I'm a newcomer to Boost C++ community. I have ,what i think, medium to good C++ coding background as i've been coding in C++ since past 5-6 years and have won some coding competitions as well. I have a good C++ STL knowledge and am very keen and interested in contributing to Boost's STL libraries. But as i'm a newbie to this community, i'm little confused where and how to start. I would be very glad and thankful if anyone would please help me and guide me through.

2 1

Re: [boost] [gsoc17]The implement of Programming competency test From Ruoyun Jing
by Ruoyun Jing 20 Mar '17

20 Mar '17

Hi Vissarion, 2017-03-20 20:29 GMT+08:00 Vissarion Fisikopoulos <fisikop(a)gmail.com>: > Hi Ruoyun, > > > - The main work I should do during GSoC about project 1 is just to > improve > > the algorithms of compare two distances of two point pairs or try to > > consider different situations which used compare distance predicates to > > avoid calculation? > > the project is about algorithms that does not compute the actual distance > but an approximation (as rough as possible) that suffices to accurately > compare the lengths of two geodesic segments on the ellipsoid > > Thanks for your answer, I have the correct point of these project and will continue to write my proposal. > > - Do "In some algorithms there is the need to compare two distances of > two > > point pairs" this means compare two points distances on Earth? Or on > every > > ellipsoid model? > > the later (see answer above) > > > - Do I need to find the approaches of filter by myself? Could you please > > help me get more information about these? Like the implement detail about > > the predicate compare_distance function, mathematical calculation papers > > about compare distance on ellipsoid? > > Well we give one approach on the website (there is another proposal of > another > candidate on the list). My opinion is that if you understand these > approaches > (pos and cons, differences etc) that will help you towards a solid > application. > Having another idea for an approach will definitely strengthen you > application. > Thanks for your help. I can get the point of those approaches and will try to have new ideas. :) > > - In my view, just like compute the shortest distance between two given > > points on Earth, the background approach can be used. And I used > cartisian > > coordinate to avoid many trigonometric function calculation, but I can > not > > find more improve with my lacking knowledge, could you give me some > aspects > > to get more approaches? > > Please see answer above > > At this point I think it is better to jump to boost list because our > discussion > could interest more people. I will not copy anything of our private > conversation > there but feel free to do the jump and I will continue answering there. > > Btw, any news from you test and comparison with Boost.Geometry. > > I reply you and jump to boost with your advice. Hope this will help more people. :) Vissarion > > ps. you can send questions whenever you want, I will answer them a.s.a.p. > my zone is UTC+2 > > Thanks for your answer. Best regards. Ruoyun -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

1 0

Re: [boost] [geometry] [gsoc17] boost.geometry
by Vissarion Fisikopoulos 20 Mar '17

20 Mar '17

Hi Aman, thanks for your interest in Boost.Geometry and projects 1, 3 in particular. Do you have particular preference between 1 and 3? I think you should specify in your application. Regarding you idea, indeed that could be an option. Do you expect that would be faster or more accurate than the one proposed in the boost GSoC ideas webpage? How would you compare the two approaches? To be clear, I am not testing you but answering that questions could lead to a stronger application. Regarding application there are two options, either you do the competency test or you send a link of a project of you. Please read https://svn.boost.org/trac/boost/wiki/SoC2017 (and links therein) also for details on how to proceed, that is on how to write your proposal. Best, Vissarion. ps. I copy to the boost list for potential feedback from the community On 20 March 2017 at 13:07, Aman Gupta via Geometry <geometry(a)lists.boost.org > wrote: > Respected sir/ma'am > I, Aman Gupta, want to contribute in Boost.Geometry; mainly in Project 1(Filtering > of compare distance predicates) and Project 3( Nearly antipodal points > distance accuracy improvement) . > I have good knowledge in geometry and want to learn more . > > For the problem given in Project 1, another approach I can suggest is to > get 2 intersections of plane (which would be ellipse) with the help given > points and compute the respective distances using those ellipses. > > I hope to get selected for the project work. > > Thanking You. > AMAN GUPTA > resume: https://drive.google.com/open?id=0B9HCqOWnVVvDcm9PQkYtczFjVmM > > _______________________________________________ > Geometry mailing list > Geometry(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/geometry > >

1 0

[gsoc17] boost.geometry
by Aman Gupta 20 Mar '17

20 Mar '17

Respected sir/ma'am I, Aman Gupta, want to contribute in Boost.Geometry; mainly in Project 1(Filtering of compare distance predicates) and Project 3( Nearly antipodal points distance accuracy improvement) . I have good knowledge in geometry and want to learn more . For the problem given in Project 1, another approach I can suggest is to get 2 intersections of plane (which would be ellipse) with the help given points and compute the respective distances using those ellipses. I hope to get selected for the project work. Thanking You. AMAN GUPTA resume: https://drive.google.com/open?id=0B9HCqOWnVVvDcm9PQkYtczFjVmM

1 0

Formal Review Request: mp11
by Peter Dimov 19 Mar '17

19 Mar '17

I'd like to request a review for mp11, a simple C++11 metaprogramming library. The library implements the approach outlined in my two articles http://pdimov.com/cpp2/simple_cxx11_metaprogramming.html http://pdimov.com/cpp2/simple_cxx11_metaprogramming_2.html and is available at https://github.com/pdimov/mp11/ It supports g++ 4.9 and above, clang 3.6 and above, msvc-12.0, 14.0, 14.1. The library is in Boost format and is intended to be placed in libs/mp11 in a Git clone of Boost. There is documentation in doc/html/mp11.html, it can be viewed locally, or with https://htmlpreview.github.io/?https://github.com/pdimov/mp11/master/doc/ht… Please excuse the lack of .css in that link. Thanks in advance for any interest, comments or suggestions.

4 9

[safe_numerics] review results
by Andrzej Krzemienski 19 Mar '17

19 Mar '17

Hi Everyone, This is to inform you that safe_numerics library by Robert Ramey is *CONDITIONALLY ACCEPTED* to Boost. The list of conditions can be found down below. I would like to congratulate Robert for getting the library into Boost, and thank him for the effort to develop a useful library for the community. I also would like to thank everyone who participated in the review and shared their useful feedback. I recorded five reviews with a yes/no vote: - Paul A. Bristow (yes with conditions) - Steven Watanabe (yes with conditions) - John Maddock (yes with conditions) - Antony Polukhin (yes) - Barrett Adair (yes) And three without a vote: - Vicente J. Botet Escriba - John McFarlane - Peter Dimov We also got some feedback from an individual nicknamed "scatters" at Reddit (https://www.reddit.com/r/cpp/comments/5x1z67/boostsafe_ numerics_formal_review_starts_today/deew1kq/), and from Tomasz Kaminski in private conversation. There was a general consensus that the problem of surprises with C++ ints deserves a solution. Some people observed that there are other ways to approach the same problem, but it was agreed that the approach taken by safe_numerics is sound. The acceptance conditions mostly revolve around documenting micro-decisions made by the library, and fixing bugs. They apply to the reviewed GIT commit 3bcfabe1cafb8ef6edf08d3bd8730a1555b1c45d, but I know Robert is already working on fixing them, and has most of them fixed locally. *Acceptance conditions:* - Comply with Boost formal requirements: 1. index.html in root directory that redirects to doc/. 2. all headers in folder include/boost/numeric/. 3. Macro safe_literal: either remove it or let it follow Boost macro naming conventions: BOOST_NUMERIC_SAFE_LITERAL(). - Automatic promotion policy: either just remove it, or fix it so that: - it can see the range of safe_base in order to allow for slower increase in sizeof(), - it is clear from documentation how the promotion mechanism works. - in particular, what type gets selected for bit-wise operators &, | - The division bug (see below) is fixed. - Decide and document up front how the library addresses each of the following different situations: - overflow upon arithmetical operation, - unexpected promotion to unsigned when comparing signed with unsigned number, - arithmetic operation on unsigned int with negative value versus a signed value (-1 + 1u). - bit-wise operation on negative signed integers (unless they are removed), or that would produce one as the result. - division by zero, - operations upon default-constructed int type with indeterminate value, - conversion from float to int, when float contains non-integral value. - conversion from float to int, when float contains an integral value that would overflow upon native conversion - operator% where one operand is negative (for native ints it is implementaiton-defined) - leftshift by 32 bits (on 32-bit int) - Decide and document what safe's default constructor does. - Document upon which operations safe<> throws exceptions (or, signals arithmetic error at run-time). IOW, document in which cases safe<> never throws exceptions (signals run-time failure) because it is able to say that the operation will always succeed. - Document what happens when you invoke an operation on two instances of safe<> with different policies. - Resolve name conflict with interval, which already exists in namespace boost::numeric::interval. Either use a different namespace or a different name. - Remove anonymous namespaces from the header files. Use namespace detail and inline functions instead. - Improve test cases, so that they also check if numeric values of computations are correct (not only whether an operation throws or not). - Use enable_if (or similar) tricks to constrain the overload resolution for your arithmetical operations, so that they only work for numeric types rather than "any type T". - Fix the division bug: safe<signed, automatic> a {-1}; safe<unsigned, automatic> b {2}; auto c = a / b; // this returns 2147483647 <%28214%29%20748-3647> - Either document that safe<T> only works for scalar types (rather than any T that models concept Integer<T>), or provide alternate implementation of safe_base, as described in https://github.com/robertramey /safe_numerics/issues/44 - Fix linker errors when building a program from two cpp files that include safe_numerics headers. The error is caused by non-inline full specializations of operator<<. - Either entirely remove the support for bit-wise ops on signed types (make it a compiler error), or provide a consistent implementation that detects any UB or surprising results. - `++i` should return by reference; `i--` should return by value. *Other important issues* The following are *not *conditions for library acceptance, but I still recommend addressing them before the initial release. - Concepts: what do you need them for? Any other type except built-in scalars does not work anyway. Do you want to show how close safe<T> resembles T? In this case, they need to be changed. If you want to extend safe<T> to other T's, they need to be fixed: https://github.com/robertramey/safe_numerics/issues/46 <https://github.com/robertramey/safe_numerics/issues/46> - IOStreams interoperability needs fixes: - Move to a separate header, so that it does not affect compilation times when not needed (but provide forward declarations, so that implicit conversions to int do not make IOStreams work with unintended semantics) - Fix other problems as per https://github.com/robertramey /safe_numerics/pull/35 - safe<>'s interface is not documented - Make the library compile with -fno-exceptions: https://github.com/robertramey/safe_numerics/pull/31 <https://github.com/robertramey/safe_numerics/pull/31> - Some people fail to see how this library is better than just using rar ints but compiling with a UB-sanitizer. Address this in the documentation. - Prevent inadvertent ADL by putting safe into a nested namespace boost::numeric::save_types, and then in boost::numeric import: `using boost::numeric::save_types::safe`. This way boost::numeric::safe still works, but inadvertent ADL of everything inside namespace boost::numeric is prevented. - Does it make sense to apply bitwise operations on two different types? If so, document the semantics. - Fix header names and paths in documentation. - Consider adding support for saturation policy upon overflow. - Expression `safe<int>{4} ^ 1` does not compile due to overload resolution ambiguity. - Fix constexpr usages. - If possible, make workarounds in order to make the library work with MSVC. - Document that operations on safe<> do not thorw exceptions other than these thrown by exception policy. *Suggestions* The following summarizes other useful suggestions for improving the library in the future. - operation `safe<signed>{INT_MIN} + safe<unsigned>{UINT_MAX}` throws even though the mathematical result would fit in either signed or unsigned int. This is correct according to what policies describe, but is at the same time surprising, given that comparison `safe<signed>{INT_MIN} < safe<unsigned>{UINT_MAX}` just gives a mathematically correct answer rather than throwing an exception. Document this behavior explicitly. - Remove underflow_error from the policies: it sends the wrong message, that som form of an underflow is checked in this library. - Expose functions like add(), divide() in public interface, they might be useful on their own. - Expose the constructor with check disabled in the public interface, like `safe<int>{1, checks_sisabled{}}` this helps to locally disable the checks where the user knows that certain chain of operaitons will not overflow, and checks are redundant, but the library cannot see it. - Issues reported with bit-shift operators - unary operator- on unsigned type with pormotion policy `automatic` could return a signed type. - Use BOOST_NORETURN wherever possible, e.g. in throwing policies. - Use BOOST_LIKELY, BOOST_UNLIKELY for the policy tests. - Add support for statful policies. - Maybe drop the support for automatic type widening, to simplify the interface and the scope of the library, and let some other library handle the widening, maybe BigInt. Regards, Andrzej Krzemienski

3 3

[release] 1.64.0 Decision on VS2017 version number?
by Rene Rivera 19 Mar '17

19 Mar '17

> (B) The community decides what version number we should be using and the > appropriate PRs are filed and applied and tested for all the repos > involved. Which means: > 1. The community has until 12:00 CDT US March 18 to decide on what the vc > version number and tag should be. > It's now past that time.. Is there consensus on what version number Boost should use for identifying the VS2017 toolset? If there is.. People need to start submitting PRs for the changes ASAP.. > 2. The community must post PRs for the places where we reference VS2017 > version numbers to the new number. Those are at least: > <https://github.com/boostorg/config> > <https://github.com/boostorg/build> > <https://github.com/boostorg/boost> > <https://github.com/boostorg/website> > People have until 17:00 CDT Monday March 20 to submit those PRs. Thanks. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

4 4

Project R-tree Serialisation
by Kabir Sahni 19 Mar '17

19 Mar '17

Hi everyone, I am midway through my competency test.I wanted to know whether working of serialisatjon for n dimensional point is the only thing to be demonstrated in main.cpp file. Thanks

3 2

Re: [boost] Advanced find() for associative containers
by Bjorn Reese 19 Mar '17

19 Mar '17

On 03/16/2017 06:18 PM, Boris Rasin via Boost wrote: > 2. Where exactly should it fit in the boost? The most appropriate place would be Boost.Algorithm, so that is Marshall's domain. > Public interface consists of a single free function template: > > template <typename C> > auto find(C& c, const typename C::key_type& key); Your find() function deviates on several accounts from std::find() so it should probably be renamed, e.g. to find_key. Can you elaborate on why you have a specialization that uses lower_bound()? What is the minimal C++ version required? Looks like C++14 from the auto return type.

2 1

Visual Studio multi-toolset support (was: [release] 1.64.0 please test master snapshot)
by Mateusz Loskot 18 Mar '17

18 Mar '17

On 18 March 2017 at 14:27, Peter Dimov via Boost <boost(a)lists.boost.org> wrote: > Mateusz Loskot wrote: > >>> No, VS 2015 can build with v140, v120, v110, v100, v90, as long as you >>> have the earlier versions installed. (VS 2017 can build with v140 even if >>> you don't have VS 2015 installed.) >> >> >> I understood VS2017 is first version with multi-toolset support. > > > The first version with multi-toolset support is VS 2012, although the only > two toolsets supported are v110 and v110_xp, which share the same version. > VS 2013 supports v90 - v120. VS 2015 supports v90 - v140. I always used the 'default' toolset of particular VS version, hence fostered ignorance about that multi-toolset support. > Wait, no, VS 2010 supports v100 and v90. :-) :-) Thank you for the enlightenment. Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 0

[release] 1.64.0 please test master snapshot..
by Rene Rivera 18 Mar '17

18 Mar '17

After help from various sources to get the VS2017 building working the latest master snapshot should at least try and build with VS2017. Assuming nothing horrible shows up today we will release the first beta tonight. Hence, please smoke test the latest master snapshot found at: <https://dl.bintray.com/boostorg/master/> -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

10 34

[review process] candidate library maintenance disturbs the review
by Andrzej Krzemienski 17 Mar '17

17 Mar '17

Hi Everyone, In the context of the discussion around review process improvements, I wanted to report another problem that I do not know how to solve. But maybe you do. Extending the review period by allowing the review on the BLIncubator looks like a good idea, but it also comes with a problem. The review applies to a particular commit (if we use GItHub terms), that is, to the state of the library on a particular branch at a particular point in time. If I see a review on BLIncubator (not that I see many of them), how do I know what commit it applies to and if it is even irrelevant. It might be partially relevant, but it puts me in an uncomfortable situation, that I will be investing my time in something that is likely to turn out to be useless. Also, I might consider submitting a review into BLIncubator, but what chances I have that it will be considered in the formal review, given that the formal review may work on a different commit: possibly on a quite different library by now? Regards, &rzej;

3 3

[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