- Boost - lists.preview.boost.org

[hash] Type trait for hash functions that are well distributed.
by Daniel James 23 Feb '14

23 Feb '14

Hi, I'm thinking about adding a type trait for hash functions to indicate if it's appropriate to use them with a "power of 2" hash table. This would let hash tables be more efficient when using an appropriate hash function, especially when compiling for 64 bit. Any thoughts on how this should be designed? I have a rough design in mind (similar to the allocator_traits propagation traits), but would like to hear other's ideas first. thanks, Daniel

1 0

[testing] No test results?
by Andrey Semashev 23 Feb '14

23 Feb '14

Hi, I'm trying to see test results, but see this error instead: Error extracting file: The specified zipfile was not found. The page is: http://www.boost.org/development/tests/develop/developer/summary.html The same error is for the master branch. Is this a known problem?

2 1

[regression] Where's boost/assert.hpp ??
by Rene Rivera 22 Feb '14

22 Feb '14

While making changes to the regression testing tools to deal with the new locations I ran into a severe blocker. It seems that nothing compiles any more because somehow "boost/assert.hpp" is no longer around and just about all Boost code depends on that one file. Where did the file go? And if was intentionally removed, why wasn't all the uses fixed by now? What's going on? -- -- 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

Review Request: Boost.Align
by Glen Fernandes 22 Feb '14

22 Feb '14

I'd like to request a formal review of Boost.Align Description: Boost.Align is a tiny library that provides alignment related utilities that several Boost libraries (Boost.Log, Boost.Smart_Ptr, etc.) re-implement themselves. Specifically it provides a function for pointer alignment (boost::align, as many vendors do not provide the C++11 std::align), functions for aligned allocation (boost::aligned_alloc, and boost:: aligned_free), and a class template for a C++ allocator that respects type (or minimum) alignment (boost::aligned_ that can serve as a replacement for std::allocator that works with over-aligned types). Source code: https://github.com/glenfe/align Documentation: http://glenfe.com/align/doc/align.html Satisfies following requirements for a fast-track review: 1. The component must be small. 2. The technique must be already in use in Boost libraries and the new component provides a common implementation. 3. A full Boost-conformant implementation is available. Thanks, Glen

1 0

Developing a (nearly new) library possibly to be proposed for Boost
by Paul A. Bristow 22 Feb '14

22 Feb '14

I'm revisiting https://svn.boost.org/trac/boost/wiki/StartModDev to try set up a new library. I've started by trying to use the simple 'library' I created over a year ago using a previous version of this document. Is it intended that users should place their 'Boost-Wannabe' libraries in the modular-boost in /libs/mylibrary as other real Boost libraries ? When I assumed this, I found it impossible to GIT clone my existing 'simple' library into the /libs folder as it is not empty, so the 2nd line git clone <mailto:git@github.com:Beman/simple.git> git@github.com:Beman/simple.git fails. This feels the right place for Or is recommended to use some folder like sandbox/libs/mylibrary/ for one's stuff, including of course a sandbox/libs/mylibrary/include/boost/mylibrary/ to hold my .hpp files? Either way I presume I need a link from modular-boost/boost to point to sandbox/libs/mylibrary/include/ Should I provide a symbolic link /D or a hardlink (as b2 headers creates)? C:\Windows\system32>mklink /D I:\modular-boost\boost\ mylibrary I:\sandbox\libs\ mylibrary \include\boost\ mylibrary symbolic link created for I:\modular-boost\boost\ mylibrary <<===>> I:\sandbox\libs\ mylibrary \include\boost\ mylibrary seems to work. Or do I add this folder to the Include directory list? (Tiresome) Suggestions? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

5 20

Gsoc project discussion
by Abhishek Kumar 21 Feb '14

21 Feb '14

Hi, I am interested in participating gsoc (google summer of code) this year with Boost. I went through the ideas page and at the bottom section i found some ideas related to data-structures and algorithms. But the page said that students have to propose their own project using the ideas listed there. I need to discuss what things i can do related to the ideas as my gsoc project..? Frankly, at present i dont have any idea on what to propose, how to propose etc.. any help on this would be appreciated..! Thanks! Abhishek Kumar

1 0

Project Idea for 2014 GSoC
by Prabhat Kumar 21 Feb '14

21 Feb '14

Hello, In forthcoming google summer of code I'm thinking of implementing *Suffix Array* data structure. As a data structure, it is widely used in areas such as data compression, bioinformatics and, in general, in any area that deals with strings and string matching problems. So I think It would be very cool to add this data structure in Boost Libraries. Here is some brief description of some method which I have planned so far :- 1) Creation of Suffix array in O(n log n ), there is a relatively easy implementation in O(n (log n)^2) using STL's sort function, but radix sort we can achieve O(n log n) .... :) 2) Longest common prefix of any two suffix in O (log n) 3) Total distinct substring of given string in O(n log n) I'll be glad to hear some suggestion. Prabhat Kumar Indian Institute of Information Technology, Allahabad , India

2 2

[log] Default logging configuration for trivial logger
by Ben Pope 21 Feb '14

21 Feb '14

Hi, I'm using the trivial logging interface, but I need to tweak the default configuration. I want to be able to flush after every log entry, and I also want to be able to do file rolling. As far as I can tell, in order to configure it this way, I pretty much need to configure the whole thing from scratch including formatters, but I can't find the code that sets up the default logger to replicate it. Any pointers? Cheers, Ben

2 4

[move] interest: the pass-by-value and swap idiom, and explicit copy constructors
by Krzysztof Czainski 20 Feb '14

20 Feb '14

Hello, I would like to ask about interest in an idea of mine. I described it in detail [1] and implemented it as part of my cz libraries [2]. In short, the idea presents: - an alternative to implicitly copyable and movable types: making them explicitly copyable; - a protocol for explicitly stating in code, where a copy is to be made (boost::copy()), which compliments the protocol for explicitly stating in code, where a move is allowed (std::move() or boost::move()); - a Boost.move extension for implementing movable types with use of the pass-by-value and swap idiom, backwards-compatible with C++98, which allows to choose copying policies (and eases changing between these policies during maintenance): - movable but not copyable, - movable and explicitly-copyable, - movable and copyable; - an example, showing how simply a CloneablePtr can thereby be implemented. This extension to Boost.move is hosted and developed as part of my cz libraries [2], but it isn't tied to them at all. It only consists of two headers. I extracted the two headers together with samples and docs, and they are available as a zip archive [3]. I would be most excited if there was interest in adding this functionality to Boost.move, but in any case, all comments are much appreciated. Regards, Kris [1] http://kristoczaj.bitbucket.org/cz/copy_move_types.html [2] http://kristoczaj.bitbucket.org/cz/index.html [3] http://bitbucket.org/kristoczaj/cz/downloads/move-0.7.1.zip

5 10

[build] Headers rule does both too much and too little
by John Maddock 20 Feb '14

20 Feb '14

Folks I don't think the headers rule is working very well at present - it seems to both do too much and too little depending on the context: Too much: If I build the type_traits tests so everything is up to date, and then touch say type_with_alignment.hpp, then in libs/type_traits/test do: bjam add_const_test And for some strange reason bjam thinks there's a dependency on type_with_alignment.hpp from add_const_test, and there really isn't. In fact *every* test seems to be out of date now. Too little: The headers under boost/config/ are included via macros so aren't placed in the dependency graph. I can fix this easily enough in the Boost.Config tests, but ideally this should be fixed at the top level by making everything under boost/config/ a dependency of boost/config.hpp. This is currently causing some Boost.Config tests to fail in the online matrix, I bet there are others as well. Anyone any ideas? Thanks, John.

7 17

[move] [range] move algorithm (was: interest: the pass-by-value...)
by Krzysztof Czainski 20 Feb '14

20 Feb '14

2014-02-15 1:05 GMT+01:00 Adam Wulkiewicz <adam.wulkiewicz(a)gmail.com>: > Hi, > > Krzysztof Czainski wrote: > >> 2014-02-14 18:16 GMT+01:00 Lars Viklund <zao(a)acc.umu.se>: >> >> On Fri, Feb 14, 2014 at 05:52:53PM +0100, Krzysztof Czainski wrote: >>> >>>> - a protocol for explicitly stating in code, where a copy is to be made >>>> (boost::copy()), which compliments the protocol for explicitly stating >>>> in >>>> >>> Note that boost::copy already exists as the widely used Range-based >>> complement of std::copy algorithm. >>> >>> I just want to get this out of the way so people can focus on the actual >>> proposal and not parrot this over and over again. >>> >>> Good point, thanks Lars. >> >> Note, that an algorithm boost::move also exists: >> http://www.boost.org/doc/libs/1_55_0/doc/html/move/move_algorithms.html >> And I'm not sure how a Range-based complement to the move algorithm could >> look like, but it may also turn out useful. >> > > Probably like this: > boost::move(range, out_it) ; > > Regards, > Adam Hmm, how about: boost::copy( range | movable, out_it ); Regards, Kris

6 22

[Boost.Test] Assertion changes in trunk? [WAS: Call for Review: Boost.Test documentation rewrite]
by Dominique Devienne 19 Feb '14

19 Feb '14

On Wed, Jan 22, 2014 at 11:25 AM, Alexander Lamaison <awl03(a)doc.ic.ac.uk>wrote: > [...] As for as I'm aware, the only change is > to the assertion macros, which move to a more natural syntax: > > BOOST_CHECK_EQUAL(a, b) becomes BOOST_TEST(a == b) > BOOST_CHECK_LT(a, b) becomes BOOST_TEST(a < b) > ... etc. > BOOST_REQUIRE_EQUAL(a, b) becomes BOOST_TEST_REQUIRE(a == b) > ... etc. > BOOST_WARN_EQUAL(a, b) becomes BOOST_TEST_WARN(a == b) > But don't we then miss better messages which actually show the values themselves when the assert fails? I do BOOST_CHECK(a == b) only when a and b lack the op<<, but otherwise greatly prefer BOOST_CHECK_EQUAL(a, b). And what's the point of going from BOOST_REQUIRE(expr) to BOOST_TEST_REQUIRE(expr), i.e. make it longer / more typing? What am I missing? --DD

11 17

Meeting C++ 2014 - Call for Papers
by Jens Weller 19 Feb '14

19 Feb '14

Hello boost community, Meeting C++ 2014 has been announced today, it will be in Berlin on the 5th and 6th December! More details on the conference in the official announcement: http://meetingcpp.com/index.php/newsreader/items/announcing-meeting-c-2014-… With the announcement, also the call for paper is now again open till April 20th. This years theme track of the conference is "Scientific Programming with C++". I'm looking for a diverse set of talks about C++, talks about boost, Qt, STL, any libraries, testing, the C++ language (C++11/14/1y) or any other C++ related topic. More details on the call for papers: http://meetingcpp.com/index.php/newsreader/items/call-for-papers-meeting-c-… Kind regards, Jens Weller

1 0

[GSoC 2014] [ B-tree + Trie ]
by Cosmin Boaca 19 Feb '14

19 Feb '14

Hello, I am a second year BS student at Politehnica University of Bucharest and I am interested in contributing to boost during GSoC 2014. I would like to work at implementing the B-Tree data structure and continuing the work at the Trie data structure implemented in last year's gsoc. I would like to hear your opinion about this project and I would be glad to discuss with someone that is willing to be a mentor for it. Thank you, Cosmin Boaca

3 2

[type_traits] Should namespace boost::align be namespace boost::detail::align?
by Glen Fernandes 18 Feb '14

18 Feb '14

I was working on a tiny library, Boost.Align, which would provide (among other things) a boost::align (that would be std::align if BOOST_NO_CXX11_STD_ALIGN is not defined, or a reasonably non-portable implementation otherwise) and found that type_with_alignment.hpp uses the identifier 'align' for a namespace within namespace 'boost'. Was this namespace intended to not be within boost::detail? If it can be, I'll send a pull request; if not, I'll choose a different identifier over 'align'. Glen

2 3

Release script module
by Daniel James 18 Feb '14

18 Feb '14

Now that we have a separate module the release scripts we should remove them from the super project. I'll do that if there are no objections. Do we want to keep it as a submodule, or just completely separate? A lot of the scripts seem to be subversion specific, so can they just be deleted?

4 5

[trac] Resolving tickets
by Ahmed Charles 18 Feb '14

18 Feb '14

https://svn.boost.org/trac/boost/ticket/9415 I've never used trac before and I'm trying to resolve this ticket, but I don't think I can. Do I need a 'trac id' to be able to resolve tickets? Or am I simply missing something?

2 1

Re: [boost] Just another GSoC project idea: Create a Bjam clone based on the Boost libraries
by Brian Wood 17 Feb '14

17 Feb '14

Niall Douglas writes: > (My only request is that if you do do this, please stick a great big > auto-generated warning on the top of every bjam file output. I've got > nobbled by my build script changes getting eaten too many times in my > life!) I'm not sure. I generate both headers and source files. Currently in the headers, I have such a warning. But all of the generated files have a "zz." prefix. I could either put the big warning also in the source files or remove it from the header files. It seems to me that the naming convention might be enough of a warning. Also, I've liked the prefix since it groups the generated code together. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

[Boost] [Config] Macros for the absence of a full C++11 <memory> implementation
by Glen Fernandes 17 Feb '14

17 Feb '14

Macros to determine the availability of C++11 functions in <memory> like std::align would be useful to me. (I know that declaration begs the inquiry "What conforming code would you write if std::align is not present?" but that is separate e-mail...) Would a BOOST_NO_CXX11_HDR_MEMORY be generally useful? Glen

5 13

[graph] named_graph
by Jan Hudec 17 Feb '14

17 Feb '14

Hello, Looking for a way to add index of vertices by some id to adjacency_list graph I notices it derives from maybe_named_graph that should support this. However I didn't find any example nor really usable description of how to use it (I'd need to define boost::graph::internal_vertex_name, but I don't know what the typedef is supposed to be). Is there any code that uses this, anywhere? -- - Jan Hudec <bulb(a)ucw.cz>

1 0

[sync] Included file not found
by Edward Diener 17 Feb '14

17 Feb '14

When I build boost libraries from the top with the latest modular-boost master with MingW/gcc-4.8.1 on Window I get thi error in sync: In file included from libs\sync\src\tss_windows_pe.cpp:9:0: ./boost/sync/detail/config.hpp:32:42: fatal error: boost/detail/winapi/config.hp p: No such file or directory #include <boost/detail/winapi/config.hpp> ^ I do not see this file anywhere. What is the issue and can this be corrected ?

5 8

[thread] Errors when building wave
by Edward Diener 17 Feb '14

17 Feb '14

When building the Wave tool on the 'master' branch with gcc-4.8.1/MingW on Windows I am seeing these errors" ..\..\..\..\libs\thread\src\win32\thread.cpp: In static member function 'static unsigned int boost::thread::physical_concurrency()': ..\..\..\..\libs\thread\src\win32\thread.cpp:425:51: error: 'GetLogicalProcessor Information' was not declared in this scope GetLogicalProcessorInformation(NULL, &size); ^ ..\..\..\..\libs\thread\src\win32\thread.cpp:429:21: error: 'SYSTEM_LOGICAL_PROC ESSOR_INFORMATION' was not declared in this scope std::vector<SYSTEM_LOGICAL_PROCESSOR_INFORMATION> buffer(size); ^ ..\..\..\..\libs\thread\src\win32\thread.cpp:429:57: error: template argument 1 is invalid std::vector<SYSTEM_LOGICAL_PROCESSOR_INFORMATION> buffer(size); ^ ..\..\..\..\libs\thread\src\win32\thread.cpp:429:57: error: template argument 2 is invalid ..\..\..\..\libs\thread\src\win32\thread.cpp:429:65: error: invalid type in decl aration before '(' token std::vector<SYSTEM_LOGICAL_PROCESSOR_INFORMATION> buffer(size); ^ ..\..\..\..\libs\thread\src\win32\thread.cpp:430:52: error: request for member ' front' in 'buffer', which is of non-class type 'int' if (GetLogicalProcessorInformation(&buffer.front(), &size) == FALSE) ^ ..\..\..\..\libs\thread\src\win32\thread.cpp:436:25: error: invalid types 'int[s ize_t {aka unsigned int}]' for array subscript if (buffer[i].Relationship == RelationProcessorCore) ^ ..\..\..\..\libs\thread\src\win32\thread.cpp:436:43: error: 'RelationProcessorCo re' was not declared in this scope if (buffer[i].Relationship == RelationProcessorCore) ^ Does anybody know what I have to do to get this working ?

2 2

Just another GSoC project idea: Create a Bjam clone based on the Boost libraries
by Boris Schäling 17 Feb '14

17 Feb '14

Create a Bjam clone based on the Boost libraries 1. Write a parser for the most important rules (exe, lib and so on) based on Boost.Spirit 2. Use the parser's actions to create a dependency tree based on Boost.Graph 3. Attach Python functions to the nodes in the dependency tree based on Boost.Python 4. Implement Python functions for one toolset (like g++) The project promises a lot of variety as different Boost libraries have to be used. It's also an opportunity to get familiar with various Boost libraries. As it can be broken down into tasks it shouldn't be that difficult to make a realistic plan for a summer project. If there is anyone interested have a look at <https://github.com/boostcon/2011_presentations/raw/master/mon/Boost.Build.p…> and <http://www.highscore.de/cpp/boostbuild/> for more information about the build system. And of course the idea is not to create a fully featured Bjam clone in a few months. If there is a binary at the end of the project which can build a software based on a simple Jamfile the project is a success. It's more important to have all the required components in place even if they are far from complete (but once they are in place it shouldn't be too difficult to extend them later and add support for another rule for example). Boris

12 19

[container] Experimental support for memory expansion in vector and burst allocation in node containers
by Ion Gaztañaga 16 Feb '14

16 Feb '14

Hi to all, Some years later than I expected, I've committed to the master branch (after regression tests in develop were ok) a new feature for Boost.Container: new experimental allocators that support memory expansion and burst allocation in order to improve insertion and erasure times in most containers. The interface of these allocators is a variation of the interface I proposed in N2045. The interface is still experimental and not ready to be used by other containers as it's quite complex to handle and I think it can be further improved. Nevertheless, Boost.Container users can benefit from improved performance just using these allocators. The first experiment using this approach can be found in my old article "Applying classic memory allocation strategies to C++ containers" (http://www.drivehq.com/web/igaztanaga/allocplus/) In that article, Boost.Interprocess containers were modified to support N2045 and DLMalloc was version 2.8.3. In the new version the extended system allocator is based on DLMalloc version 2.8.6 (I've noticed a performance improvement in DLMalloc in the new version) and requires linking a new Boost.Container library. Boost.Container is still header-only if extended allocators are not used. DLMalloc is known to be size and speed efficient for non heavily multithreaded environments, but Boost.Container DLMalloc extension is *not* a replacement for multithreaded allocators (say ptmalloc2, ptmalloc3, nedmalloc, tcmalloc, jemalloc...). Your default system allocator will be more efficient than Boost.Container for highly multithreaded environments. On the other hand, at least in Windows and Linux, the allocator seems to be very efficient in non-multithreaded programs. The following extended allocators are provided: * boost::container::allocator: This extended allocator offers expansion, shrink-in place and burst allocation capabilities implemented as a thin wrapper around the modified DLMalloc. It can be used with all containers and it should be the default choice when the programmer wants to use extended allocator capabilities. * boost::container::node_allocator: It's a Simple Segregated Storage allocator, similar to Boost.Pool that takes advantage of the modified DLMalloc burst interface. It does not return memory to the DLMalloc allocator (and thus, to the system), unless explicitly requested. It does offer a very small memory overhead so it's suitable for node containers that allocate very small value_types and it offers improved node allocation times for single node allocations with respect to boost::container::allocator. * boost::container::adaptive_pool: It's a low-overhead node allocator that can return memory to the system. The overhead can be very low (< 5% for small nodes) and it's nearly as fast as boost::container::node_allocator. It's also suitable for node containers. More details on the implementation of this allocator can be found in http://www.drivehq.com/web/igaztanaga/allocplus/#Chapter3. The goal of these extended allocators in Boost.Container is to start building widespread existing practice in regularly requested features from container users (realloc-like behaviour in vector, amortizing several node allocation in range insertions, etc...). I'm not an allocator expert, nor a HPC guru. These new allocators are just the first step of an experiment that I hope real experts will improve. I will appreciate any comment, bug report or suggestion. Thanks, Ion

1 0

Lost the Gmane interface
by Edward Diener 16 Feb '14

16 Feb '14

Normally I post to this list using the Gmane newsgroup interface. The last message I tried to send via this interface received the response from Gmane: "You have tried posting to gmane.comp.lib.boost.devel, which is a unidirectional mailing list. Gmane can therefore not send this message to that mailing list. " Does anybody know what is happening ? I sent a message to a Gmane administrator but so far no response. Edward Diener

2 1

[intrusive] intrusive/detail/has_member_function_callable_with.hpp(74) : fatal error C1189: #error : "BOOST_PP_ITERATION_START() must be zero (0)"
by Vicente J. Botet Escriba 15 Feb '14

15 Feb '14

Hi, there is an issue in has_member_function_callable_with.hpp that make a lot of test fail. See for example the following compiler errors. Could this be fixed? Thanks, Vicente Test output: teeks99-02j-win2008-64on64 - thread - shared_future__copy_assign_p / msvc-12.0 Rev 085b21ee6f062cfc538438496cc5f6ac2da9217f / Fri, 14 Feb 2014 21:34:08 +0000 Compile [2014-02-15 04:21:38 UTC]: fail call "C:\Program Files (x86)\microsoft visual studio 12.0\vc\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"C:\local\teeks99-02\j\results\boost\bin.v2\libs\thread\test\shared_future__copy_assign_p.test\msvc-12.0\debug\threading-multi\sync\futures\shared_future\copy_assign_pass.obj.rsp" copy_assign_pass.cpp C:\local\teeks99-02\j\boost_root\boost/intrusive/detail/has_member_function_callable_with.hpp(74) : fatal error C1189: #error : "BOOST_PP_ITERATION_START() must be zero (0)" and Test output: teeks99-05f-Ubuntu12.04-64 - thread - async__async_p / clang-linux-3.0 Rev 91a3fc2ca12c3dfdf088383f8b60fb476e222039 / Fri, 14 Feb 2014 23:21:25 +0000 Compile [2014-02-15 02:19:03 UTC]: fail "clang++-3.0" -c -x c++ -Wextra -Wno-delete-non-virtual-dtor -Wno-long-long -Wunused-function -pedantic -O0 -g -fno-inline -Wall -pedantic -g -pthread -fPIC -Wextra -Wno-delete-non-virtual-dtor -Wno-long-long -Wunused-function -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_DYN_LINK=1 -DBOOST_SYSTEM_DYN_LINK=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_THROW_IF_PRECONDITION_NOT_SATISFIED -DBOOST_THREAD_USE_DLL=1 -I".." -o "/mnt/teeks99-05/f/results/boost/bin.v2/libs/thread/test/async__async_p.test/clang-linux-3.0/debug/threading-multi/sync/futures/async/async_pass.o" "../libs/thread/test/sync/futures/async/async_pass.cpp" In file included from ../libs/thread/test/sync/futures/async/async_pass.cpp:34: In file included from ../boost/thread/future.hpp:54: In file included from ../boost/thread/detail/memory.hpp:18: In file included from ../boost/thread/csbl/memory/allocator_arg.hpp:16: In file included from ../boost/container/scoped_allocator.hpp:28: In file included from ../boost/container/allocator_traits.hpp:29: In file included from ../boost/container/detail/memory_util.hpp:30: In file included from ../boost/preprocessor/iteration/detail/iter/forward1.hpp:57: ../boost/intrusive/detail/has_member_function_callable_with.hpp:74:5: error: #error "BOOST_PP_ITERATION_START() must be zero (0)" #error "BOOST_PP_ITERATION_START() must be zero (0)" ^ ../boost/intrusive/detail/has_member_function_callable_with.hpp:305:44: error: no template named 'has_member_function_callable_with_allocate_impl'; did you mean 'intrusive::detail::has_member_function_callable_with_pointer_to_impl'? struct BOOST_PP_CAT( BOOST_PP_CAT(has_member_function_callable_with_ ^

3 2

[GSOC] '14 web page minor typo
by zlynus 15 Feb '14

15 Feb '14

Hi all. I'm Lingyu Zhu, a student working on a GSOC proposal. First of all,Thanks to the admin that 2014 GSoC web page has so many great idea and they are all well-documented, especially the section describing the idea of improving boost.afio,which draw my special attention. However, there is a conspicuous typo in the header line: GGoogle Summer of Code 2014 =\ I wonder if the minor typo will effect google's judgement and thus the acceptance of boost org application. So here I am --this is my first 'bug report' ;) Best regards, Lingyu

2 1

[utility] Missing current_function.hpp
by Edward Diener 15 Feb '14

15 Feb '14

From modular boost: switch to develop git pull git submodule update b2 headers No current_function.hpp anywhere switch to master git pull git submodule update b2 headers No current_function.hpp anywhere What am I missing ?

3 2

NT² 3.0 and Boost.SIMD - Stable release
by Joel Falcou 15 Feb '14

15 Feb '14

The first stable release of the 3.x series of MetaScale’s open-source software is available: NT² 3.0. It also includes its spin-off project, Boost.SIMD (not yet a Boost library). Many Issues have been closed since last beta. The main focus of this release cycle was to fix performances issues and to stabilize some parts of the API. Next step will be to separate NT2 and Boost.SIMD into separate repositories, thus making one more step toward Boost.SIMD submission into review. [ http://www.metascale.org/nt%C2%B2-3-0-and-boost-simd ] *Changes & Bug Fixes:* - Major performance improvements in both libraries - Added experimental support for the HPX runtime for parallelization on shared memory systems - Optimizations of many elemental functions, in particuler log/ex, frexp/ldexp and cbrt - More advanced shuffle pattern recognition for SIMD - Fixed issues with Visual Studio 2013 - More functions are force-inlined to ensure good performance - New functions for conversion between types and mixing of vectors of different sizes - Demo applications usable as benchmarks - Better handling of errors when an unsupported function is called - New API for custom memory allocators Full changelog is available at https://github.com/MetaScale/nt2/releases/tag/3.0.0. *How to get it ?* - Source and binary packages can be downloaded here: http://nt2.metascale.org/downloads - The release is also available on Github : https://github.com/MetaScale/nt2/releases - The main master branch is still under development : https://github.com/MetaScale/nt2

1 0

Refactoring tools/regression and tools/release into separate sub-modules
by Beman Dawes 14 Feb '14

14 Feb '14

The tools used by regression testers and regression reporting, and the tools used by release managers are currently part of the boost-super project. As we gain experience with Git and submodules, it is becoming clear these need to be decomposed into two separate submodules. Among other advantages, that would speed work on these tools as we could better utilize volunteers without having to hand out excessive super-project write permissions. We would like one or two volunteers to do the refactoring. You don't need to be a library maintainer or release manager, although that's fine if you are. You do need git skills, as we do want to preserve history. Comments? --The release managers

5 22

Introducing Boost.Optional co-mantainer
by Fernando Cacciola 14 Feb '14

14 Feb '14

Hello, I am pleased to announce that Andrzej Krzemienski will be a co-mantainer for Boost.Optional His goal is to (finally!) implement: 1. Move semantics emulation (C++-3 compatible). 2. Function value() from tr2::optional that either returns a value or throws. For those of you who don't know Andrzej, he is the main force behind the standarizaztion of std::optional Once again, thank you very much Andrzej ! -- Fernando Cacciola SciSoft Consulting, Founder http://www.scisoft-consulting.com

1 0

General Advice Thankyou - now I need a Trac login
by Fletcher, John P 14 Feb '14

14 Feb '14

Thank you for the helpful responses and a lot of new information. I now need a trac login and to be assigned as the maintainer for Phoenix. I have not found instructions for getting a Trac login. Please help. John

3 4

path of test-binary
by dib 14 Feb '14

14 Feb '14

Hi, within the tests of a (not-yet) boost-library, how can I find out the path where b2 placed the binaries of the tests? Problem is the following: Some of the tests need the path to a shared library, which is built together with the tests. In the lib/mylib/tests/Jamfile.v2 I have the following: [...] # our test lib for shared library tests lib test_library : test_library.cpp ; test-suite mylib : # # shared library # [ run shared_library_load_test.cpp ] [ run shared_library_get_symbol_test.cpp ] # # [...] Inside shared_library_*_test.cpp I need something like this: boost::filesystem::path tstlib("bin.v2/libs/mylib/test/mycompiler/test_library.so"); As boost.build decides by itself where to put the binary, i cannot hardcode the path in the source-files.. Is there a way to get the path from boost.build? If not, how could I solve this problem? -- regards dib

2 1

[git] automated update of superproject master branch
by Peter A. Bigot 14 Feb '14

14 Feb '14

I realize there are several email threads about how the super-project branch should be managed, but most pre-date live experience with boost on git and go deep into other aspects of the issue, so I still want to call this out specially: https://svn.boost.org/trac/boost/wiki/ModBigPicture specifies that the master branch on each module should be stable at all times, which is the right policy. Currently, the master branch on the super-project is automatically updated twice(?) per hour selecting all updates to the master branches of modules. Consequently, super-project master is the exact opposite of stable. This divergence is confusing. I'm unconvinced that waiting a few days will demonstrate a significant decrease in churn on the super-project master branch. Some is due to multiple updates to specific modules, which might decrease as maintainers become more familiar with git and only push once, but interoperability issues will still arise and there will be no way to tell which master branch commits produce a working Boost installation. There is value in having a branch with automated-update semantics, but IMO regardless of what the final policy will be, "master" is not the right choice for this, and automated updates of it should stop ASAP. Perhaps the update script can simply be moved to occur on latest/master and latest/develop. Leave master untouched until whatever gets committed to it has undergone cross-toolchain integration validation, and make develop available for changes to superproject content that are not just submodule updates. Peter

4 4

General advice needed for new maintainers.
by Fletcher, John P 14 Feb '14

14 Feb '14

I have been maintaining Boost Phoenix for several weeks. To start with I was mainly attempting to fix as many bugs as possible and also sorting out things like missing copright and licence. I am now up to the more difficult bugs which take longer to fix. I also need some more information and some actions which I cannot take myself. I have asked about a number of these on this list and I am lacking answers to a good many of them, so I am going to summarise them here. I think it would be a great help to people undertaking maintenance for the first time, without having first been an originator of a library if some guidelines were in a document. 1. General guidelines on the responsibilities of a maintainer and who is responsible for the elements outside the developer's control. In particular, what happens when there is a release of boost? 2. General guidelines on the responsibilities for bugs and who to contact if a bug seems to be due to a different library. 3. Guidelines on the use of trac and how to get given the ability to record bugs as now fixed. 4. Where is the archive for boost-bugs? It would be useful to look at past fixes to find out what has gone on. Someone suggested searching but I cannot search until I know what is there. 5. A list of who is maintaining what. 6. Documentation. I am trying to get to grips with boostbook and quickbook. Some libraries are included in a section with indexed chapters and some are not. Is there a policy about this. When I asked how Phoenix could join the only reply I had was not to bother. Is there a documentation policy? It would be good to be able to generate the web pages myself to check them when I am making changes, which may be substantial. 7. More technical. How are things to be handled in relation to C++11. (a) Things which used to work which now don't with C++11? (b) Things which only work with C++11? (c) and what about C++14? I am fixing things in an adhoc way but it would be good to have a uniform approach. 8. Boost predef for version numbers. I have introduced this into Phoenix alongside the existing method. 9. Changelog. As a user I have found this useful in libraries I have used elsewhere, so I have put one into Phoenix following the style I found in wave. There is quite a lot here, but it has been building up for some time as I find I need more information to work effectively. John Fletcher P.S. Thanks to all those who have helped me get this far.

3 3

Interested in working with Boost C++ Libraries
by Arpit Sharma 13 Feb '14

13 Feb '14

Hello, My name is Arpit Sharma. I'm a 3rd year Computer Science student. I'm very much interested to work for Boost C++ Libraries in Gsoc 2014 and would like to work after that also. Any pointers on how to proceed. -Thank you, Arpit Sharma

2 1

Contributing to Boost as a part of GSoC 2014
by Kamal Gurala 13 Feb '14

13 Feb '14

Hi All, My name is Kamal Gurala, I am currently pursuing a B.tech in CSE from IIIT-Hyderabad ( India ). I have a good knowledge of C++, Data Structures, and Algorithms. I want to get started with contributing towards Boost. I would be obliged if any one could help me in this regard. Regards, Kamal Gurala

2 1

[fusion.adapted.std_tuple] bug
by Hui Li 13 Feb '14

13 Feb '14

Looks like 2 files share the same include guard macro definitions. This makes it very hard to use Boost.Fusion for std::tuple's, especially if both boost::tuple and std::tuple need to be adapted. mbpro:fusion huil$ find . -type f |xargs grep -w BOOST_FUSION_CATEGORY_OF_IMPL_09272006_0726 ./adapted/boost_tuple/detail/category_of_impl.hpp:#if !defined(BOOST_FUSION_CATEGORY_OF_IMPL_09272006_0726) ./adapted/boost_tuple/detail/category_of_impl.hpp:#define BOOST_FUSION_CATEGORY_OF_IMPL_09272006_0726 ./adapted/std_tuple/detail/category_of_impl.hpp:#if !defined(BOOST_FUSION_CATEGORY_OF_IMPL_09272006_0726) ./adapted/std_tuple/detail/category_of_impl.hpp:#define BOOST_FUSION_CATEGORY_OF_IMPL_09272006_0726

2 1

How to add a library to the BoostBook Documentation Subset?
by Fletcher, John P 12 Feb '14

12 Feb '14

I have taken over the task of maintaining Boost Phoenix. I want to start expanding the documentation which already uses Quickbook. The BoostBook Documentation Subset here includes a lot of libraries but not Boost Phoenix. http://www.boost.org/doc/libs/1_55_0/doc/html/index.html How do I get Boost Phoenix added, and are there any requirements for the documentation which need to be observed? Thanks John Fletcher

2 1

Building a new boost library in Google summer program!
by Khaled Ammar 12 Feb '14

12 Feb '14

Hi everyone, I'm new to this list so please excuse my lack of experience. I'm interested to build a boost library as part of Google Summer of Code ( http://www.google-melange.com/gsoc/homepage/google/gsoc2014) Could you please advice me who should I contact? -- Thanks, -Khaled Ammar PhD student at Uwaterloo www.khaledammar.com

3 2

Warning.. Regression testing changes forthcoming..
by Rene Rivera 12 Feb '14

12 Feb '14

We, mostly Ahmed Charles, will be moving the regression and release script code to independent git repos (i.e. moving the out of the boost super-repo). The first step is to copy the git histories. This requires that NO ONE make changes to the regression and release code. This first step will happen tonight at 8-12 pm PST. Further actions for testers to take will follow in the next 2-3 days. -- -- 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

Where is boost/detail/limits.hpp used?
by Peter Dimov 12 Feb '14

12 Feb '14

I'm playing with a dependency checker I wrote that tells me what Boost module depends on what. Starting with the basics: Dependencies for config: detail: boost/detail/endian.hpp A dependency from config to detail is not a good thing because detail depends on too much. boost/detail/endian.hpp is now only a forwarding header to predef, so it could and probably should be moved to predef, which seems to depend on nothing. But I was wondering what in config uses endian.hpp. Turns out the only use is in boost/detail/limits.hpp, a file that has been put into config for some reason. I can't find anything in config or in Boost that uses this file. What is its purpose?

5 11

[Boost-users] User/Owner Information And in Boost File System
by MANTOSH KUMAR 12 Feb '14

12 Feb '14

Hi All, Point::1 ====== boost::filesystem library is great. However I found that boost::filesystem has no interface to fetch about the owner(userid/groupid) of a particular file. "stat()" system call has been provided by POSIX compliance system to fetch this information. I am pretty sure that this must have been thought by boost community while designing boost::filesystem library and there would be valid reason not to provide such interface. However I just wanted to know the thought of boost community. Point::2 ====== The following is the code snippet: std::vector<boost::filesystem::path> vec; boost::filesystem::recursive_directory_iterator rbgnitr(p); boost::filesystem::recursive_directory_iterator renditr; for(boost::filesystem::recursive_directory_iterator itr = rbgnitr; itr != renditr; ++itr) { v.push_back(*itr); } In the above "rbgnitr" does represent the starting node in a directory. However It looked bit strange while "renditr" for end node(one beyond end). The end node renditr" is basically empty instance of class "recursive_directory_iterator"......Just wanted to know why this was designed in this way..... Thanks & Regards, Mantosh Kumar India

2 1

Boost.Log crash - question on consequences of misconfiguration
by Pieter 12 Feb '14

12 Feb '14

LS, My question regarding Boost.Log is the following: could anything been said on what to expect when asking Boost.Log to write to a non-existing directory on a read-only drive? Does it keep trying to write or give up when the directory cannot be created, and would the user be informed in such a case? Background: today I ran into a problem using Boost.Log. I configured both a Console and a TextFile backend (both autoflushing) but happened to configure the latter wrongly- setting the location of the file on a not-existing directory on a read-only drive. This caused a program crash under certain circumstances - but no problems under other circumstances (related to the configuration of the application which should not be relevant here) - when it did crash, this happened after a few messages were logged. Crash happened shortly before program termination but before the main() function was terminated (for a while I thought I was seeing the problem described in the docs regarding the boost.filesystem related problem and it took me a while to learn this was not the case). Pieter

2 1

GSOC 2014
by Petru Trimbitas 12 Feb '14

12 Feb '14

Hello, I saw that boost took part in gsoc 2013, will it take part also in 2014? Thanks

2 1

Boost.Mixin library preliminary reviews
by Borislav Stanimirov 11 Feb '14

11 Feb '14

Hello, Boost.Mixin is a library I'm developing and I intend to submit it for review by the end of the month (most likely on Feb, 23). Source is here: https://github.com/iboB/boost.mixin Docs are here: http://ibob.github.io/boost.mixin/ There have already been two discussion on the subject: here: http://lists.boost.org/Archives/boost/2013/01/200598.php and here: http://lists.boost.org/Archives/boost/2013/07/205184.php They showed at least moderate interest in the library. Also I had a lecture about the library back in November on Open Fest 2013 Bulgaria (Unfortunately it's in Bulgarian. If you understand Bulgarian, you can find it here http://www.youtube.com/watch?v=3sTX8lUdp1c ) The feedback from the lecture has been very positive. I'm going to complete the documentation in the following day or two (it's 90% done as of now) and then focus on docs polish, like typos, structure, etc, and fixing any bugs that might arise. The library is being used in two active closed source projects, so any major bugs are highly unlikely. Currently, apart from jamfiles, there are project files for Visual Studio 2008 and 2012, QtCreator, and Code::Blocks in the repo for your convenience. Before I submit it for a formal review, It would be great if I could have some preliminary ones. Anyone is welcome with questions, suggestions, tips, and comments Thanks, -- Borislav

2 7

[predef] Error in sparc.h
by Adam Wulkiewicz 11 Feb '14

11 Feb '14

Hi, There is an error in predef/architecture/sparc.h (http://github.com/boostorg/predef/blob/develop/include/boost/predef/archite…) in line 40 the operand of && is missing. Should there be something added there or should the operator be deleted? Should I create a ticket? Regards, Adam

3 3

[githelp] git pull --recurse-submodules equivalent?
by Rene Rivera 11 Feb '14

11 Feb '14

In trying to set up my ISP account to do testing report generation I ran into a rather old git version, 1.7.2.5. Which doesn't support the "--recurse-submodules" option of pull. What is the equivalent for a pre 1.7.3 git? -- -- 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

Fwd: possible bug: retrieve data using associative property maps with boost::bimaps - failed
by Aniket Pugaonkar 10 Feb '14

10 Feb '14

Hi, I am not sure whether this email got sent to the list because I received an email that I have to subscribe to the list before asking any question through email. Apologies for sending it again. thanks! I am facing compilation error in the following code. I do understand why the error is, but I could not find a good solution. Here is my code and question explained in detail *What I want to do:* I want to store a key- value pair where both key and its respective values is unique. But After I create a map, I want to use the VALUE and get the corresponding key. Essentially the best way is a bimap. So I do the following using associative property maps. *What I did:* 1. define a bimap (my_bimap ) 2. define associative property map for left view of bimap ( right_asso_bimap ) 3. define associative property map for right view of bimap ( left_asso_bimap ) 4. fill the bimap using *left* view associative property map. i.e. *use boost::put( left_asso_bimap, key, value )* 5. Now using *right* view associative property map, retrieve key for given value i.e. use *boost::get( right_asso_bimap, value )* My main motive is to use GET and PUT helper functions for insertion and retrieval from a bimap. Use PUT to insert in LEFT BIMAP. and Use GET to retrieve from RIGHT BIMAP. I know the error is because of non-const-ness of the iterators because of which I cannot de-reference using iterators. But what would be the alternative to this ? This link here explains how to define parameters for bimap in order for iterators to be mutable. http://www.boost.org/doc/libs/1_55_0/libs/bimap/doc/html/boost_bimap/the_tu… *But I get the error below: * In file included from main.cpp:2:0: /usr/local/include/boost/property_map/property_map.hpp: In instantiation of 'boost::associative_property_map<UniquePairAssociativeContainer>::value_type& boost::associative_property_map<UniquePairAssociativeContainer>::operator[](const key_type&) const [with UniquePairAssociativeContainer = boost::bimaps::views::list_map_view<boost::bimaps::relation::member_at::right, boost::bimaps::detail::bimap_core<int, boost::bimaps::list_of<long unsigned int>, mpl_::na, mpl_::na, mpl_::na> > boost::associative_property_map<UniquePairAssociativeContainer>::reference = const int&; boost::associative_property_map<UniquePairAssociativeContainer>::value_type = const int; boost::associative_property_map<UniquePairAssociativeContainer>::key_type = long unsigned int]': /usr/local/include/boost/property_map/property_map.hpp:357:54: required from 'Reference boost::get(const boost::put_get_helper<Reference, PropertyMap>&, const K&) [with PropertyMap = boost::associative_property_map<boost::bimaps::views::list_map_view<boost::bimaps::relation::member_at::right, boost::bimaps::detail::bimap_core<int, boost::bimaps::list_of<long unsigned int>, mpl_::na, mpl_::na, mpl_::na> > > Reference = const int&; K = int]' main.cpp:41:35: required from here /usr/local/include/boost/property_map/property_map.hpp:502:20: error: no match for 'operator[]' (operand types are 'boost::associative_property_map<boost::bimaps::views::list_map_view<boost::bimaps::relation::member_at::right, boost::bimaps::detail::bimap_core<int, boost::bimaps::list_of<long unsigned int>, mpl_::na, mpl_::na, mpl_::na> > >::C {aka boost::bimaps::views::list_map_view<boost::bimaps::relation::member_at::right, boost::bimaps::detail::bimap_core<int, boost::bimaps::list_of<long unsigned int>, *mpl_::na, mpl_::na, mpl_::na> >}' and 'const key_type {aka const long unsigned int}')* *return (*m_c)[k];* ^ Here my code. You can also see the code here on this website link:* http://coliru.stacked-crooked.com/a/59cbf2c564bf22b2 <http://coliru.stacked-crooked.com/a/59cbf2c564bf22b2>* #include <boost/bimap.hpp> #include <boost/property_map/property_map.hpp> #include <boost/bimap/property_map/set_support.hpp>#include <boost/bimap/list_of.hpp>#include <iostream> using namespace boost; int main() {typedef int vertex_descriptor_t;namespace bm = boost::bimaps;typedef bm::bimap< vertex_descriptor_t, bm::list_of<size_t> > vd_idx_bimap_t;typedef boost::associative_property_map<vd_idx_bimap_t::left_map> Lasso_vd_idx_bimap_t;typedef boost::associative_property_map<vd_idx_bimap_t::right_map> Rasso_vd_idx_bimap_t; // define bimap and assoc prop map for itvd_idx_bimap_t my_bimap;Lasso_vd_idx_bimap_t Lmy_asso_bimap(my_bimap.left );Rasso_vd_idx_bimap_t Rmy_asso_bimap(my_bimap.right); typedef typename vd_idx_bimap_t::value_type value_type; my_bimap.insert( value_type( 1, 100 ) ); my_bimap.insert( value_type( 2, 200 ) ); int z = 1; std::cout << "value = " << get ( my_bimap.left, z ) << std::endl; // prints correctly value = 100 // use left asso bimap for inserting to bimap boost::put( Lmy_asso_bimap, 3, 300 ); // correct // print bimap using *left view*for(auto t = my_bimap.left.begin(); t != my_bimap.left.end(); ++t) std::cout << t->first << " " << t->second << "\n"; int y = 2;*z **= boost::get( Lmy_asso_bimap, y ); // CORRECT OUTPUT for left view * std::cout << "value = " << z << std::endl; // Use right asso bimap to get key based on supplied value y = 100;*z = boost::get( Rmy_asso_bimap, y );* *// -->> ERROR HERE for right view* std::cout << "value = " << z << std::endl; // print map again. (*right view*)for(auto t = my_bimap.right.begin(); t != my_bimap.right.end(); ++t) std::cout << t->first << " " << t->second << "\n"; } Please let me know whether this is a potential bug, or the code semantics is incorrect. Or the current library cannot support this. ? Regards, Aniket Pugaonkar -- Thanks and regards, Aniket Pugaonkar -- Thanks and regards, Aniket Pugaonkar -- Thanks and regards, Aniket Pugaonkar

1 0

[GSOC] Generalized Hypergeometric Functions.
by Anton Bikineev 10 Feb '14

10 Feb '14

Hi all. I just added a quick and naive implementation of Pade approximation for 1f1 and 2f1 hypergeometric functions based on Luke's book. You can find code here: https://github.com/AntonBikineev/math/blob/hypergeometric/ include/boost/math/special_functions/detail/hypergeometric_pfq_pade.hpp I also want to thank Christopher Kormanyos for many advices and help. Best regards, Anton.

2 1

Attn: We need GSoC 2014 mentors for Boost!
by Niall Douglas 10 Feb '14

10 Feb '14

Dear Boost community, We are now just five days away from the closing date for Google Summer of Code 2014 registration. Last year's GSoC was a huge success, with Google funding work on Boost to the tune of $35,000 and paying over $8,000 in costs for three representatives of Boost to attend the GSoC mentor's summit at Google HQ. As part of filling in our application for 2014, we must supply to Google a list of potential GSoC mentors and potential GSoC projects for summer 2014. We do NOT want a repeat of 2012 when our application was rejected due to an insufficiently long list of prospective mentors and projects! At the time of writing, we have just *eight* prospective mentors, and we need more to be sure of being approved by Google! Therefore, 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 at https://svn.boost.org/trac/boost/wiki/SoC2014. 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. Thank you in advance for your time. Niall Douglas (Boost Google Summer of Code admin) Boris Schäling (Boost Google Summer of Code backup admin)

8 22

[program_options] comma separated options
by Alain Miniussi 10 Feb '14

10 Feb '14

Hi, Someone asked me if it was possible to "easily" specify an option that would allow to specify a vector of values. The first options that came in mind was to use "multitoken". But that solution had to drawback in that situation: - ambiguous with respect to positional parameters - clumsy when you want to allow options to be specified in files, since you have to write: option 12 option 42 ... instead of: option 12 42 19 So I though about using a custom validator, which implies introducing a new type too, if I understand correctly. Something along the lines of: ======================= ... template<typename T> struct option_sequence { std::vector<T> values; }; template<typename T> void validate(boost::any& v, const std::vector<std::string>& values, option_sequence<T>* target_type, int) { namespace po = boost::program_options; namespace alg = boost::algorithm; std::vector<T> result; typedef std::vector<std::string> strings; for ( strings::const_iterator iter = values.begin(); iter != values.end(); ++iter ) { strings tks; alg::split(tks, *iter, alg::is_any_of(":")); for( strings::const_iterator tk = tks.begin(); tk != tks.end(); ++tk) { result.push_back(boost::lexical_cast<T>(*tk)); } } v = option_sequence<T>(); boost::any_cast<option_sequence<T>&>(v).values.swap(result); } int main(int argc, char* argv[]) { .... desc.add_options() ("values,v", po::value<option_sequence<int> >(), "a vector of ':' separated values as in \"12:42:-20\"."); =================== Obviously, one could think that some flexibility could be added (separators for starters) but you get the idea. Is that the right way to go (the intermediate option_sequence template seems clumsy for the user (but you need to distinguish from std::vector's) and if yes, could such a thing be added to the library ? (if yes a could propose a patch for consideration). Cheers -- ===================================== Alain Miniussi DSI/Pôle Génie Logiciel Scientifique Observatoire de la Côte d'Azur

1 0

[Fibers] Performance
by Hartmut Kaiser 10 Feb '14

10 Feb '14

Oliver, Do you have some performance data for your fiber implementation? What is the (amortized) overhead introduced for one fiber (i.e. the average time required to create, schedule, execute, and delete one fiber which runs an empty function, when executing a larger number of those, perhaps 500.000 fibers)? It would be interesting to see this number when giving 1..N cores to the scheduler. Thanks! Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

14 92

GSoC 2014 - Full Text Search
by Nikhar Agrawal 09 Feb '14

09 Feb '14

Hi everyone, I'm Nikhar Agrawal, currently pursuing my B.Tech. in Computer Science and Engineering from IIIT-H. I was a GSoC student last time for Boost C++ under the mentorship of Christopher Kormanyos and advisory mentorship of John Maddock and Paul Bristow for the Boost.Math Bernoulli numbers project. It was a wonderful experience to have successfully managed to contribute to Boost. And it was a great learning process. I would love to participate this year as well. I was going through the ideas page and saw 'Full Text Search' listed in tiny letters near the bottom of the page. As part of our coursework on Information Retrieval and Extraction in college, we have built a project on searching for queries on a 42 gb wikipedia xml dump. So, I got a little excited at seeing 'Full Text Search' being listed. I skimmed through the Boost mailing list archives but couldn't find any information on this. Could someone kindly elaborate what exactly is expected from this? And if there's any interest from anyone in mentoring this project? Thanks.

2 2

GSoC
by Utsav Tiwary 09 Feb '14

09 Feb '14

Are there existing libraries for the implementation of finite difference method to solve boundary value problems ? I've been working on it lately using MPI.

8 28

[Move] BOOST_NO_RVALUE_REFERENCES - or so it thinks
by John M. Dlugosz 08 Feb '14

08 Feb '14

Real-world software projects don't always get to use the latest stuff in a timely manner. I'm working on some code that needs to work across several platforms, which generally means programming to the least-common-denominator. What I want to bring up in particular is the issue that the compiler may be more up to date with C++11 than the libraries. Someone trying to use Boost on Android (IIRC) trying to change the Boost config to tell it that C++11 support is available said it was like playing "Whack-a-Mole", in that each change caused more problems elsewhere. It seems that the overall issue is Compiler vs Library. Saying that rvalue references are available doesn't mean that std::move, std::forward, etc. are available. I threw together a move.h file that contains forward, move, and a few others taken exactly from the standard â all one-liners. That lets people who know that the compiler really does know what to do with && write code that uses them, just so long as they remember to use the project's namespace and not std, or the multi-platform build coughs it back out. I also successfully crossbred the unique_ptr implementation from libcxx-3.4 with Boost + my own move.h namespace. Now try putting a (real) move-only object into a boost::container::vector when Boost is built with BOOST_NO_RVALUE_REFERENCES. Might I convince the powers-that-be to reconfigure Boost with that #define removed? That could be done when upgrading Boost anyway, but it seems to not work! Whack-a-mole. I didn't do it personally, but it appears that at the very least Boost would need its own move.h and whatever odds and ends it assumes are present. That would be quite easy since these little functions are just fancy casts and you can mix code that calls different "implementations" of them. So Boost could always use boost::move which turns into static_cast<typename boost::remove_reference<T>::type&&>(t); (as opposed to just 'using' the std::move) and other code doesn't care. That is, it would not be necessary to configure "has std::move vs not have std::move" but just don't rely on std::move at all. In short, I don't know if it's just me, but most of the company jobs I've worked have lagged behind, with upgrading the compiler and/or libs being a Big Deal, especially if using outside code that's already compiled. So, I want to raise the possibility that making Boost work with native rvalue references but legacy (C++03) standard library would be useful to some significant population of developers. #undef'ing BOOST_NO_RVALUE_REFERENCES in the config ought to just work, at least on a lib by lib basis. I mean, it might be fine if some libs didn't handle that as many people don't use every single lib in every project. Boost.Container is interesting though because it is used to overcome legacy std::map etc. as one of its stated goals. It's also good for avoiding platform compatibility issues when all platforms use the same map class (e.g. the master build doesn't spit out failures as erase is void on some platform but returned an iterator on the platform used to try the code before checking it in). The current version of Clang as used for Mac and iPhone/iPad development has && working even if you don't enable the C++11 dialect. So sneaking in some &&'s in a program doesn't require any reconfiguration of the projects. âJohn

1 0

Fwd: [Boost-users] Attn: We need GSoC 2014 mentors for Boost!
by Antony Polukhin 08 Feb '14

08 Feb '14

2014-02-08 7:15 GMT+04:00 Niall Douglas <s_sourceforge(a)nedprod.com>: <...> Therefore, 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 at > https://svn.boost.org/trac/boost/wiki/SoC2014. > I'm in! How about the following projects: * Running regression tests on Android/RaspberyRI/Qemu, writing a documentation about crosscompiing Boost libraries. + Adding automated TravicCI testing scripts to all the Boost libraries * Library for basic integration with spreadsheet applications Excel/LibreOfficeCalc/OpenOfficeCalc and OfficePrograms (Modifying cell, getting results from cells, saving documents, saving in PDF) * Program protection and obfuscation tools (marking part of assembly at compilation, encrypting/decrypting part of the binary on-the-fly, detecting debuggers, detecting emulators and virtual machines, computer identification and gathering hardware specific identifiers...) If there is an interest in those projects, I'll add some description to the GSOC wiki page. -- Best regards, Antony Polukhin

1 0

Odd regression test results
by Peter Dimov 08 Feb '14

08 Feb '14

Something's not right with this result (among others): http://www.boost.org/development/tests/develop/developer/output/teeks99-02e… It says "Rev 906385497d1f3de04bb8391c5af87e563fd4c0f7". Revision 906385 updates config, and the preceding revision that updates smart_ptr is https://github.com/boostorg/boost/commit/891371e4ba8edf7dd21dc828841f5eab56… which brings it up to +Subproject commit e1f170cd494d2e7ce5e6e7d3f0fe016aceb88048 Rev. e1f170 of smart_ptr is a relatively recent one, as can be seen here: https://github.com/boostorg/smart_ptr/commits/develop The error messages in the report, however: C:\local\teeks99-02\e\boost_root\boost/smart_ptr/detail/shared_count.hpp(276) : error C2903: 'rebind' : symbol is neither a class template nor a function template C:\local\teeks99-02\e\boost_root\boost/smart_ptr/make_shared_object.hpp(174) : see reference to function template instantiation 'boost::shared_ptr<int>::shared_ptr<T, ... seem to suggest that neither shared_count.hpp nor make_shared_object.hpp have been updated to e1f170.

1 1

Cairo and ISO C++ for GSoC proposed?
by Mateusz Łoskot 08 Feb '14

08 Feb '14

Hi, I haven't been monitoring the GSoC discussions closely, just looked at the final https://svn.boost.org/trac/boost/wiki/SoC2014 I'm wondering, has anyone proposed for GSoC to kickstart initial work on Cairo for ISO C++ according to the papers posted by Herb Sutter? Here is Herb's post: http://lists.cairographics.org/archives/cairo/2013-December/024858.html Best regards, -- Mateusz Łoskot, http://mateusz.loskot.net

2 2

[testing] More failed test results with no meaningful content
by John Maddock 08 Feb '14

08 Feb '14

For example: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… leads to a successfully compiled file if you follow the links. Anyone any idea what's going on here, and is there any way to make this reporting more reliable? Frankly the results will get widely ignored if no one can see what's actually going on. Thanks, John.

8 13

Gsoc chrono::date Library
by Arun Sori 08 Feb '14

08 Feb '14

Hey All, I am interested in contributing to the chrono::date library project.I have read the paper given in the link and need some ideas on how to start. I am a new contributor so please guide me to the initial phase and spare no details. As a start the paper seems to propose a new library based on boost::date. Should I first familiarize with the boost::date code ( try to compile it. Read the documentations etc.). The project also has a prototype available. Are we trying to build the library further upon it ? What extra do we need to built in this project ? What are some mandatory prerequisites for the project ? Thanks, Arun

2 1

[boost-bugs] Where is the archive, please?
by Fletcher, John P 08 Feb '14

08 Feb '14

I am maintaining Boost phoenix and whenever I put comments onto the bug trac I get an email with a copy from boost-bugs. I would like to look at the archive of this but it is not listed on the gmane lists. http://news.gmane.org/index.php?prefix=gmane.comp.lib.boost It must be somewhere else. Please help. John Fletcher

2 3

[testing] Strange Darwin test failures
by John Maddock 08 Feb '14

08 Feb '14

Does anyone know why this would happen: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… program exits with: libc++abi.dylib: terminate called throwing an exception Googling around finds: http://apple.stackexchange.com/questions/103649/macports-dylib-failure-with… which suggests some sort of toolset misconfiguration? Thanks, John.

2 1

Phoenix 3.0.4 on master. Fixes include silent bugs.
by Fletcher, John P 07 Feb '14

07 Feb '14

Phoenix 3.0.4 is now on master and will I hope be included in the next release of Boost. There are many fixes to bugs which are documented in libs/phoenix/ChangeLog In particular there are fixes for #5715 and #5824. These are important as they were silent bugs which meant that code did not work correctly. This means that it is possible that there is code using phoenix where the results could change when adopting this release. There are many fixes still to be done which are documented in the TODO section of the changelog. Please report any concerns or bugs either through trac or by responding to this message. John Fletcher

4 3

[modular-boost] /boost//headers error
by Thomas Suckow 07 Feb '14

07 Feb '14

I am seeing a strange discrepancy between building the headers target from the command line vs including it as a dependency in another target. In our own projects we 'use-project /boost : $(PATH_TO_BOOST) ;' and use the headers target. But as a reproducible example, if I add /boost//headers to tools/quickbook/src/Jamfile.v2 I get: http://pastebin.com/KMcMSLZW I tried to debug it, but alas my skills at boost-build seem to be insufficient. It is interesting to note however that when looking at 'b2 -d5' output 'sequence.join library-name-headers .' seems to be invoked when it fails, yet that does not occur when it succeeds. If anyone has any ideas on how to get this working again, I would be happy to look into this more. -- Thomas I for one welcome our new git overlords.

2 5

GSoC Hypergeometric functions (Pratyaksh Sharma)
by Pratyaksh Sharma 07 Feb '14

07 Feb '14

Hello I'm interested in the Boost.Math Generalized Hyper geometric Functions project. Can anyone give some pointers on where to begin? I have sufficient experience with hypergeometric functions, but don't know exactly how to contribute to Boost. Just to start the discussion: Does everyone agree that a variety of methods need to employed for calculating the functions for different ranges of parameters? I'm familiar with methods that utilize the Gauss-Jacobi quadrature to solve the differential equation of concern, and also the Taylor series methods for smaller values of |a| and |z|. Any other ideas? Cheers, Pratyaksh

4 4

Regression tests for 'develop'
by Edward Diener 06 Feb '14

06 Feb '14

Are the regression tests for 'develop' for any particular library running the 'develop' branch of that library against the 'master' branch of all other libraries ? Or is the regression test for 'develop' for any particular library running against the 'develop' branch of all other libraries ?

3 2

sqlpp11: SQL for C++
by Roland Bock 06 Feb '14

06 Feb '14

Hi, over the last four or five years I developed several SQL libraries for C++. With C++11 I was finally able to create an SQL library that meets my own expectations and requirements. It is being used in production, I recently put it on github, and I would really like to hear from you guys whether this is something that could be interesting for you personally or for boost? https://github.com/rbock/sqlpp11 https://github.com/rbock/sqlpp11/wiki sqlpp11 is a template library representing an embedded domain specific language (EDSL) that allows you to * define types representing tables and columns, * construct type safe queries checked at compile time for syntax errors, type errors, name errors and even some semantic errors, * interpret results by iterating over query-specific structs with appropriately named and typed members. This results in several benefits, e.g. * the library user operates comfortably on structs and functions, * the compiler reports many kinds of errors long before the code enters unit testing or production, * the library hides the gory details of string construction for queries and interpreting string based results returned by select calls. I.e. you don't need to use strings in query construction where you wouldn't use them in SQL and there is no need to use positional arguments or to parse strings when obtaining fields from a result row (the latter being true unless you do not know which columns to select at compile time). The library supports both static and dynamic queries. The former offers greater benefit in terms of type and consistency checking. The latter makes it easier to construct queries on the flight. Specific traits of databases (e.g. unsupported or non-standard features) are known at compile time as well. This way, the compiler can tell the developer at compile time if a query is not accepted by the database (e.g. if a feature is missing). And the library can form the query in the correct manner, for instance if the engine uses concat instead of operator|| to concatenate strings. Two Examples: ============= Static Select: -------------- // selecting zero or more results, iterating over the results for (const auto& row : db.run( select(foo.name, foo.hasFun) .from(foo) .where(foo.id > 17 and foo.name.like("%bar%")))) { if (row.name.is_null()) std::cerr << "name will convert to empty string" << std::endl; std::string name = row.name; // text fields are implicitly convertible to string bool hasFun = hasFun; // bool fields are implicitly convertible to bool } Dynamic Select: ---------------- auto s = dynamic_select(db, tab.foo).dynamic_columns().from(tab); if (userWantsBar) s.add_column(tab.bar); for(const auto& row : run(s)) { std::cerr << "row.foo: " << row.foo; if (userWantsBar) std::cerr << "row.bar" << row.at("bar"); std::cerr << std::endl; }; Please let me know your questions/thoughts/suggestions/rants. Contributions welcome, of course :-) Regards, Roland

22 88

[config] BOOST_NO_CXX11_ALLOCATOR and template aliases
by Peter Dimov 06 Feb '14

06 Feb '14

VC11 appears to not define BOOST_NO_CXX11_ALLOCATOR. However, as std::allocator_traits contains two template aliases, rebind_alloc and rebind_traits, and VC11 doesn't support template aliases, it has nonstandard definitions of these two. This is obviously a problem for code that wants to use std::allocator_traits. One way to fix that is for the user code to check BOOST_NO_CXX11_TEMPLATE_ALIASES and if so, refrain from using std::allocator_traits. Another is to just not define BOOST_NO_CXX11_ALLOCATOR for VC11. (VC12 is conforming.) I tend to be in favor of the second option, as the effect would essentially be the same.

4 11

What is trac doing and how do I stop it doing it??
by Fletcher, John P 06 Feb '14

06 Feb '14

I am attempting to update a ticket and I am getting this: ------------------ Captcha Error Submission rejected as potential spam (Content contained 1 blacklisted patterns) Trac thinks your submission might be Spam. To prove otherwise please provide a response to the following. ------------------- I would not mind but there is nothing to respond to and what I have typed seems to be lost. Where is there guidance on how to avoid this problem, please? John

3 3

Re: [boost] SQL: next iteration of sqlpp11
by Sebastian Theophil 06 Feb '14

06 Feb '14

> On 2014-02-03 16:03, Roland Bock wrote: > In most usecases I encountered so far, it is totally OK to interpret NULL > values like default values, e.g. NULL strings and empty strings, or NULL > foreign keys or 0LL. For those usecases it would be quite annoying to have to > check if there really is a value, or always use get_optional_value_or... Hi Roland, while I can very well imagine that these "use-cases" exist, I would not like the library to make this the default. I think using boost::optional is the canonical solution that is also impossible to misinterpret. Treating non-existent values the same as default-initialized values seems error-prone if not wrong in general. The library should not prevent me from treating string "" differently from NULL, which currently it does. On the other hand, if the library did return optionals, implementing the behaviour you describe on top of it is trivial: boost::optional<T> t; t.get_value_or( T() ); If it helps my argument, both Scala Anorm and Scala Slick represent nullable columns as optional types: http://www.playframework.com/documentation/2.0/ScalaAnorm http://slick.typesafe.com/doc/2.0.0/schemas.html Regards Sebastian PS: I hope to look at your library in more detail in the coming weeks and I am really looking forward to that. Great work so far. -- Dr. Sebastian Theophil | stheophil(a)think-cell.com Senior Software Engineer think-cell Sales GmbH & Co. KG | Chausseestr. 8/E | 10115 Berlin | Germany http://www.think-cell.com | phone +49 30 666473-10 | US phone +1 800 891 8091 Amtsgericht Berlin-Charlottenburg, HRA 44531 | European Union VAT Id DE815233792 General partner: think-cell Operations GmbH | Amtsgericht Berlin-Charlottenburg HRB 129917 Directors: Dr. Markus Hannebauer, Dr. Arno Sch?dl

7 19

Large Bitset to download?
by Aleksey Yakovlev 05 Feb '14

05 Feb '14

Dear List, This is my first post to the list. I’ve subscribed to get some info about Zachary Turner project “Large Bitset” (based on Joachim Faulhaber ICL). What’s the status of this project? It looks promising for us, so I’d like to download sources and take a dig into them – to test, to estimate limits, performance etc. Please help, Thanks, Aleksey This message contains confidential information. If you are not the intended recipient you are hereby notified that disclosing,copying, distributing or taking any action in reliance on the contents of this information is strictly prohibited. Please notify the sender immediately and delete this e-mail from your system.

1 0

GSoC: Who is taking on the responsibility as organization admin for Boost this year?
by Hartmut Kaiser 04 Feb '14

04 Feb '14

Sorry if I missed this information... Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

1 0

[modular-boost] Questions about development procedures and more
by Gennadiy Rozental 04 Feb '14

04 Feb '14

Hi, Trying to start using modular boost (and git for that matter). I have several questions about this. These are in no particular order: 1. Why does ./b2 headers on windows creates hardlink for each file instead of directories? The process takes forever. 2. What the story about cmake based build? What state is it in? Can I try it now? How? Can I help with anything to push this further? I got a bit of experience with cmake since last time I see n this discussed. 5. What the status of testing of the new tree? How is it setup? Where can I read it? Specifically I am interested in what being tested against what. 4. First command to switch to develop branch produces warning(?) ...\modular-boost\libs\test>git checkout develop Previous HEAD position was 954d3ab... Thread: merge [81791]-tools dir missing Branch develop set up to track remote branch develop from origin. Switched to a new branch 'develop' Should I worry? 5. After I switched to development branch headers directory still "points to" master branch files. Actually I am not sure what it points to now since master files are nowhere anymore. How should I switch headers? 6. What the corresponding action with git, which does what svn up from root of tree did before? What I am after is comamnd(s) which updates other libs, but keep my lib as is (maybe merge changes from other developers). If "git submodule update" is one of these commands, why does it takes forever on fresh just cloned boost tree? 7. How do I run the test which will check how my changes affect other libraries (their master branch at least). Should I just run the test from root in my local copy? How do I test against develop branch of other libs and develop branch of other libs against me? 8. Dependency specification. This actually a big question, which can be split into several: 8.1 Is there place where I can see "released versions" for particular library/submodule? 8.2. Is there way to tell which other boost submodules I depend on? 8.3 Can I specify specific release version I want to depend on (per submodule)? 8.4 Can I somehow only checkout/pull the submodules I depend on? 8.5 Can I check which submodules depend on me and checkout only those? 8.6 Is there place where I can see which submodule version constitute specific boost release? 9. One of the wiki pages refers to "git submodule summary" command. I do not understand what this command supposed to do. 10. How do I create private branch? IOW branch which is not publicized on github, but one I can share with the team? 11. This page is not clear to me: https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint What do I need to do to merge my development branch into master, given that it is significantly differ now (at the time of svn->git conversion)? Thank you. Gennadiy

8 36

SQL: next iteration of sqlpp11
by Roland Bock 04 Feb '14

04 Feb '14

Dear boosters, after the lively discussion about sqlpp11 in November 2013 (http://lists.boost.org/Archives/boost/2013/11/208388.php) sqlpp11 has evolved quite a bit and I want to give you an update. https://github.com/rbock/sqlpp11 *) sqlpp11 now supports prepared statements. For instance auto ps = db.prepare(select(all_of(tab)) .from(tab) .where(tab.alpha != parameter(tab.alpha))); ps.params.alpha = 42; for (const auto& row: db.run(ps)) { std::cerr << "alpha: " << row.alpha << std::endl; std::cerr << "beta: " << row.beta << std::endl; std::cerr << "gamma: " << row.gamma << std::endl; } *) Binding of parameters and results for binary transport is now supported. Both, parameters of prepared statements and results can be bound to in-memory data of the database now. In the example above, using the provided mysql connector, neither parameters nor the non-text results are converted to/from string. *) Support for multi-row insert: //First, you create an insert: auto i = insert_into(tab).columns(tab.alpha, tab.beta); //Then you add values (one or more times): i.values(tab.alpha = 7, tab.beta = "seven"); // Then you run the insert db.run(i); There is no support for array binding in sqlpp11, since this is highly vendor specific afaict. But it would be fairly easy to add support for this in the vendor-specific connector library. I'd be happy to support you if you wanted to give it a try. *) New interpreter for SQL expression trees: This has changed and improved a lot. sqlpp11 has been stripped of all vendor specific code and will serialize standard SQL. The connector libraries can specialize an interpreter template to change the representation of certain aspects. For instance, mysql would represent the concatenation of strings as CONCAT(a,b) instead of a||b. But of course, the connector libraries are not required to turn the expression into a string. They can interpret it any way they like. I strongly believe that this is going to allow for writing connectors to XML, input streams, maps, etc. (think LINQ). *) I added a sample code generator (in python) that generates table representations from a DDL Todo-List: ---------- *) More thorough documentation *) More thorough and easier to comprehend tests *) Some of you mentioned that Boost.Fusion or Boost.Preprocessor might do be able to do the job of code generation very elegantly. I won't do that myself but I'd be interested to see such solutions. Since code generation is not integral part of the library it would make sense to have such solutions as support libraries. *) Look into cursors FYI, I am going to give a talk about sqlpp11 and some template patterns used inside of it on February 27 in Munich, see http://www.meetup.com/MUCplusplus/events/160688442/ Please let me know your questions/thoughts/suggestions/rants. Contributions welcome, of course :-) Regards, Roland PS: Given enough interest, I intend to officially propose the library to boost (after several more iterations, of course). This is why I hope it is OK to discuss sqlpp11 on this mailing list every now and then.

8 29

Regarding GSoC 2014
by shubhv＠iitk.ac.in 04 Feb '14

04 Feb '14

Hey, I am a sophomore student of Computer Science Department, IIT Kanpur, India. I have been going through the boost libraries for quite some time now, and also have read through the proposed GSoC projects in 2014. I am especially interested in the Boost.Math Generalized Hyper geometric Functions. Though I have gone through the links provided under that project and am trying to become versed with Boost's Math library, I am finding it difficult to find a starting point to contributing. I would be really glad if someone could help me in the initial phase by directing me to the right starting point and guide me through. Thanks Shubhangee Verma

2 1

Trying modular Boost
by Paul A. Bristow 04 Feb '14

04 Feb '14

FWIW here are some things I didn't understand or did wrong. (And, of course, playing Devil's Decidedly Dumb Advocate ;-) 1 How do I know if I have the right version of Git? Open GitHub icon and check Tools/About? 2 Windows hint: If you install TortoiseGIT, avoid incompatibilities by using the command line version of Git that TortoiseGIT installs. I.E. place C:\Program Files (x86)\Git\cmd in your path ahead of any other git binaries, such as cygwin. Huh? Am I Shelling, Bashing, Batting or Powershelling? How do I do that? How do I check that I have done this right? Open a Windows command window? Many Windowers will not know how to find/edit their path (and should not need to know?). A link would help. If you have dozens of items in the path, this is pretty awkward to edit? But (after a frustrating failure to get SSH access to work - in a separate post) I got to the main course using https: https://github.com/boostorg/boost.git Submodule 'io' (https://github.com/boostorg/io.git) registered for path 'libs/io' Submodule 'iostreams' (https://github.com/boostorg/iostreams.git) registered for path 'libs/iostreams' <big snip> Cloning into 'tools/quickbook'... Submodule path 'tools/quickbook': checked out '340c65150d175ffc20a9a877247928b3ed5eba1b' Success (4040769 ms @ 31-Dec-2013 17:00:21) Just over an hour (using my nominal 10 mbps living-in-the-boondocks but line-of-sight radio link) - something that should be noted in the docs (along with a strong recommendation to send to a log file)? Other you would miss/lose this very useful info? Building the Boost C++ Libraries. Performing configuration checks - symlinks supported : no - hardlinks supported : yes - 32-bit : yes . And I could test system library OK J Phew! Paul PS I had an existing (luckily current) b2.exe at c:\program files\Boost and this is implicitly in my PATH. Do we need to be more specific about how b2 is stored and accessed? Some check that b2.exe vcvars32.bat etc are all set up correctly would be good? --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 <mailto:pbristow@hetp.u-net.com> pbristow(a)hetp.u-net.com

7 14

Process for the Community Maintenance Team
by Marshall Clow 04 Feb '14

04 Feb '14

I’ve put up a set of procedures for the Boost Community Maintenance Team (CMT) on the wiki at: https://svn.boost.org/trac/boost/wiki/CommunityMaintenance Comments welcomed. — Marshall

4 6

Udp Socket
by •°o.O sαмι O.o°• 04 Feb '14

04 Feb '14

Asalam-o-Aliakum and Hi all, I am having a problem with boost udp socket. My program terminates after throwing exception "host unreachable". My questions: 1). why udp socket cares for host it should just send data out of its own port and its job is done? 2). And how it knows that host is not available if udp is connection less protocol? 3). And another simple question how to avoid program termination on this exception? Best Regards; Sami Ul Haq

5 6

Building with clang for Windows/MingW
by Edward Diener 03 Feb '14

03 Feb '14

When trying to test clang under Windows which is built with MingW, Boost Build runs with the options: -c -x c++ -O0 -g -fno-inline -Wall -g -mthreads However clang does not recognize -mthreads and flags it as an error. Is there anything I can do to remove this option from the clang++.exe command line when invoking Boost Build ?

2 5

named_condition_any not working.
by Marius Adrian DOBRESCU 02 Feb '14

02 Feb '14

Hello! I tried to use into my code an interprocess mechanism like producer/multiple consumers with named_sharable_mutexes. I found out that named_condition_any is not working with any kind of scoped locks. Neither with sharable_mutex or simple named_mutex. It takes the lock successful but cannot unblock another process when notify is called. I used linux, gcc 4.8, just basic build, linking with pthreads. Is this a known issue to you because I couldn't find any info related on the Internet? Maybe I can take a look next week what is in there... Adrian

2 1

http://lists.boost.org/Archives/boost/2014/01/211169.php
by Gilbert Polo 02 Feb '14

02 Feb '14

Thank you for the simple explanation. Somehow I lost sight of the forest for the trees or its a lot easier to see when the obvious is pointed out.

1 0

[C++11] Is conditional code allowed?
by Fletcher, John P 02 Feb '14

02 Feb '14

I am working on bugs in boost phoenix. I have found some problems eg. #7624 which run fine with C++11 with either Clang 3.4 or gcc 4.8.2. I also have a patch which has been suggested for bug #8704 which uses C++11. Is there a way to incorporate C++11 only code into tests or the actual headers. If so, is there an example of how to do it in Boost? Thank you John Fletcher

3 3

RTG Graph Generator
by Khaled Ammar 02 Feb '14

02 Feb '14

Hi everyone, I noticed that boost has RMAT and Erdös-Renyi graph generator but it does not include a (more) recent and realistic graph generator like RTG. RTG is based on this paper from CMU: http://www.cs.cmu.edu/~lakoglu/pubs/RTG_GraphGenerator.pdf. -- Thanks, -Khaled

1 0

[modular] and status/explicit-failures-markup.xml
by Joachim Faulhaber 01 Feb '14

01 Feb '14

Dear modularists, I've just tried to make changes to modular-boost/status/explicit-failures-markup.xml. Since I have only write permission to my own library libs/icl in modular boost, trying to push my changes failed. What is the right way to change the regression test markups in modular-boost? Best, Joachim -- Interval Container Library [Boost.Icl] http://www.joachim-faulhaber.de

3 4

[offtopic] user-defined raw string literals
by Adam Wulkiewicz 01 Feb '14

01 Feb '14

Hi, I have some idea related to the usage of UDLs in Boost.Geometry library but the way I'd like to handle it is AFAIK not supported. A little introduction first. There are many text-based languages of defining data. One of them is WKT (http://en.wikipedia.org/wiki/Well-known_text) which allows to define vector data e.g. a polygon like this: |POLYGON((30 10, 40 40, 20 40, 10 20, 30 10))| So my thought was: why not use C++11 UDLs for this purpose? There are operators in the WKT language so I should probably use string literal, put WKT in it and be happy with it. The use case could look like this: |auto ||polygon = "POLYGON((30 10,40 40,20 40,10 20,30 10))|"_wkt; Ok so now the tricky part. It should be parsed in compile-time, the type of the geometry retrieved from the string literal and proper type returned (bg::polygon<> in this case). Unfortunately string literals can't be handled as raw literals, e.g. using the variadic-template version of operator"": template <char...> void operator "" () Why? Is there a reason for this? If we had the ability to use the compile-time version with string literals it would be possible to implement various compile-time parsers, not only for the mentioned WKT. So what do you think about it? Regards, Adam

2 2

[docs][website] Can the docs on the website be xhtml + svg?
by John Maddock 01 Feb '14

01 Feb '14

I've been investigating getting better equations and graphs into the Math lib docs and one prerequisite seems to be serving up pages as XHTML rather than HTML: without that SVG's simply do not display correctly (or at all) in IE. The docbook xhtml generation seems to be working OK, but would the pages get served correctly on the current website? Thanks, John.

3 6

[conversion] Need a help with MSVC failures
by Antony Polukhin 01 Feb '14

01 Feb '14

Hi, Some of the tests for Boost.LexicalCast fail on any MSVC compiler. Unfortunately currently I have no access to Windows. Could someone please investigate the failures and tell me were to search the bug? -- Best regards, Antony Polukhin

3 8

[range] Can iterator_range also model Random Access Range?
by Mostafa 01 Feb '14

01 Feb '14

It seems that iterator_range can properly model any refinement of the Forward Range concept. Is that right? The reason I ask is that this is not very clear from the documentation, and I had to deduce this from both the iterator_range API and the Random Access Range concept definition. (See documentation at: range/reference/utilities/iterator_range.html) Thanks, Mostafa

3 6

Range Adapters (map_keys, map_values) cause undefined behavior (segv, etc) when applied to R-Values, especially in the context of BOOST_FOREACH
by Igor Lubashev 01 Feb '14

01 Feb '14

Hi! I've filed a ticket (https://svn.boost.org/trac/boost/ticket/9578) for this issue two weeks ago, but I see no action there. Does anyone else think that this (see subj) is a problem? To spare the trouble of following the link, here is the essence of the problem, as I see it. (The ticket has a simple test case attached.) When applied to r-values (for example, maps returned by value from a function), adapters do not make a copy of the r-value but just capture a reference to it. This makes the returned range_iterator dangerous, if it is used after the r-value (the temporary) is destroyed. In particular, the following use causes undefined behavior on all compilers I'd tested on: g++ (4.1.2, 4.4.3, 4.6.3) and Visual Studio (15 [VC9], 16 [VC10]). BOOST_FOREACH(const string &s, return_map_by_value() | map_keys) ... Note that the following works fine (since BOOST_FOREACH takes care of differentiating between l-values and r-values and does the right thing to r-values): BOOST_FOREACH(const MapType::value_type &v, return_map_by_value()) ... It seems that boost::range::adapters need to do a similar thing to what BOOST_FOREACH is does to identify r-values and make a copy (which the compiler is likely to optimize away). Any comments are welcome! Thanks, - Igor

3 3

Re: [boost] Participation in GSOC 2014
by Vineet Kumar, Indian Institute of Technology, BHU, Varanasi (INDIA) 31 Jan '14

31 Jan '14

Hello Everyone, I want to participate in GSOC 2014, and boost C++ is looking me the most appropriate place where I can contribute efficiently. So how to get started with boost C++ libraries ? I have an Idea of implementing a library in boost. So what I do then , concentrate on library or something else With Regards Vineet Kumar, Indian Institute of Technology, BHU

5 5

GSoC
by Utsav Tiwary 31 Jan '14

31 Jan '14

My idea for GSoC involves implementation of advanced maths libraries for boost which involve the solving of boundary value problems using finite difference method. Language to be used is C. Are there any existing implementations ?

2 2

boost::pool nextof method
by Gilbert Polo 31 Jan '14

31 Jan '14

I am currently learning how to use the boost pool library. However, I have a question regarding the nextof of method found in the class simple_segregated_storage.hpp. How does the increment of the void pointer work. How does it know how much to increment the void pointer by in order to get to the next chunk?

2 1

[type_traits] type_traits for types with operator().
by Anton Bikineev 31 Jan '14

31 Jan '14

Hello. Recently I looked for type_traits for callable classes. It so strange, I didn't find such traits. Most likely, I just missed them or something like them. I actually don't know is there a real need for them. Anyway I tried to write such traits at least for practice and metaprogramming training. I tested them with gcc, clang and msvc2010. I would appreciate if you looked at the code. Here is the link<https://github.com/AntonBikineev/is_functional/> to my github repository. It's cool that they can see hidden generated operator() of lambdas closure type. Best regards, Anton.

5 5

Trouble with constructors boost::graph::directed_graph from boost::adjacency_list in C++
by Matthias Beste 31 Jan '14

31 Jan '14

Dear Boost-Users, Related to: boost::graph::directed_graph I've trouble with the Constructors of above as a simple example shows: <<<<<<<<<<<<<<<<<<< using namespace boost; typedef directed_graph<> Directed_Graphtype; class Mywrapper { private: Directed_Graphtype g; public: Mywrapper() : g() {}; }; >>>>>>>>>>>>>>>>>> I got the following Error while compiling: <<<<<<<<<<<<<<<< HOME/svn_repos/collab_cntfet/trunk/STA_signalintegrity/circuitGraph.h|78| instanziiert von hier| /usr/include/boost/graph/directed_graph.hpp|96|Fehler: keine passende Funktion für Aufruf von »boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property<boost::edge_index_t, unsigned int, boost::no_property>, boost::no_property, boost::listS>::adjacency_list(const boost::directed_graph<>&)«| /usr/include/boost/graph/directed_graph.hpp|96|Anmerkung: Kandidaten sind:| /usr/include/boost/graph/adjacency_list.hpp|451|Anmerkung: template<class EdgeIterator, class EdgePropertyIterator> boost::adjacency_list::adjacency_list(EdgeIterator, EdgeIterator, EdgePropertyIterator, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type, const GraphProperty&)| /usr/include/boost/graph/adjacency_list.hpp|443|Anmerkung: template<class EdgeIterator> boost::adjacency_list::adjacency_list(EdgeIterator, EdgeIterator, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::edges_size_type, const GraphProperty&)| /usr/include/boost/graph/adjacency_list.hpp|435|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type, const GraphProperty&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::vertices_size_type = long unsigned int]| /usr/include/boost/graph/adjacency_list.hpp|435|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »long unsigned int«| /usr/include/boost/graph/adjacency_list.hpp|418|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(const boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS, boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS> = boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property, boost::no_property, boost::listS>]| /usr/include/boost/graph/adjacency_list.hpp|418|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »const boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, boost::property<boost::edge_index_t, unsigned int, boost::no_property>, boost::no_property, boost::listS>&«| /usr/include/boost/graph/adjacency_list.hpp|414|Anmerkung: boost::adjacency_list<OutEdgeListS, VertexListS, DirectedS, VertexProperty, EdgeProperty, GraphProperty, EdgeListS>::adjacency_list(const GraphProperty&) [with OutEdgeListS = boost::listS, VertexListS = boost::listS, DirectedS = boost::bidirectionalS, VertexProperty = boost::property<boost::vertex_index_t, unsigned int, boost::no_property>, EdgeProperty = boost::property<boost::edge_index_t, unsigned int, boost::no_property>, GraphProperty = boost::no_property, EdgeListS = boost::listS]| /usr/include/boost/graph/adjacency_list.hpp|414|Anmerkung: keine bekannte Umwandlung für Argument 1 von »const boost::directed_graph<>« nach »const boost::no_property&«| ||=== Build finished: 11 errors, 0 warnings ===| >>>>>>>>>>>>>>>>>>>>>>>>>> I would really like to know, where the problem is with this templates. The default constructor exists of course for boost::directed_graph and boost::adjacency_list a.s.o. ... however the compiler don't like them. This is confusing. Can someone help me out? Kind Regards Matthias -- Dipl.-Ing. Matthias Beste Wissenschaftlicher Mitarbeiter Lehrstuhl für Dependable Nano Computing (CDNC) Institute für technische Informatik (ITEC) Karlsruhe Institute of Technology (KIT) Haid-und-Neu Str.7 (Bldg 07.21) 76131 Karlsruhe, Germany Phone: +49 721 608-45009; Fax: +49 721 608-43962 Email: matthias.beste(at)kit.edu <mailto:matthias.beste@kit.edu> web: http://cdnc.itec.kit.edu/

1 0

[cmake] Plans/status
by Ruslan Baratov 31 Jan '14

31 Jan '14

Hello everyone! I want to ask few questions about this project: https://github.com/boost-cmake/boost-cmake I start with simple one, what is the current status of this project and are there any plans to apply it to the mainline?

1 0

Boost Phoenix 3.0.1 - version numbers and ChangeLog
by Fletcher, John P 31 Jan '14

31 Jan '14

Boost Phoenix 3.0.1 is now on master. I am fixing the bugs previously reported for Boost Phoenix. I have started a file libs/phoenix/ChangeLog (following the example in wave) to log changes made. I am incrementing the lowest number of the version when I merge changes to master and origin/master and also changing the version number in Phoenix and reporting this in the ChangeLog. I hope this will make it easier in the future to keep track of exactly which version it is which is causing a problem. I would welcome any comments on the TODO list in the ChangeLog, in particular where there are problems caused by phoenix for other libraries. I am aware that this applies to boost/log. I am hopeful that some fixes of early bug reports will help with later bugs as well. I have just fixed 5715 which related to the comma operator in statement blocks, and can be fixed with the addition of a header. This fixes a silent error in the execution as compared with phoenix V2 and may well fix other problems. That fix is still in develop and not master until some tests have been done. John Fletcher

1 0

Ownership of tickets for Boost Phoenix
by Fletcher, John P 31 Jan '14

31 Jan '14

I have taken over as maintainer of Boost Phoenix and have started to fix the reported bugs. How do I get to be the owner of the bugs so that I can change their status when they have been fixed and tested? Also how can I be sure to get notification of new bug reports? John Fletcher

1 0

[program_options] documentation for validators
by Alain Miniussi 30 Jan '14

30 Jan '14

Hi, I have a question regarding the validators namespace of program_options documentation. That namespace is referenced in the tutorial in http://www.boost.org/doc/libs/1_55_0/doc/html/program_options/howto.html and some of its functions are used but there is no documentation related with that namespace. Actually, it does not even appears in the reference manual of the lib. Is that intended ? Regards Alain

2 1

[spirit.lex] 9580
by Vyacheslav Andrejev 30 Jan '14

30 Jan '14

Hi All, Can somebody take a look at bug #9580? It's a C++ puzzle. Two as if equivalent expressions demonstrate different behavior. This one auto expr = (this->self("SOME_STATE") += someTokenDef); calls boost::proto::detail::exprns_::operator +=. However this auto lex_def = this->self("SOME_STATE"); auto expr = (lex_def += someTokenDef); calls boost::spirit::lex::detail::operator +=. My guess is that it changes templates instantiaon order, but still I can't explain it and thus can't fix it. -- -- Vyacheslav Andrejev

2 3

Help please with Boost Discussion Policy
by Fletcher, John P 30 Jan '14

30 Jan '14

It has been pointed out to me that I need to change my habits from top posting to be conformant to the Boost Discussion Policy http://www.boost.org/community/policy.html I accept this fully and I am seeking some guidance how to achieve this. At my place of work our email client is Microsoft Outlook 2010 and the normal practice is top posting. When I am at home I can access the same system via a web email client which does the same thing. The Boost policy document reffers to Quote-Fix (http://home.in.tum.de/~jain/software/oe-quotefix/ ) which was last updated in 2006 and does not work with current versions of Outlook. There is also this: http://sourceforge.net/apps/mediawiki/macros4outlook/index.php?title=QuoteF… I am doing most of my Boost work from home and want to be able to communicate freely. Ideally what I want to do is to switch between the styles so that only my Boost and related work is in quoted style. Any help will be much appreciated. Thank you John Fletcher

11 15

[config] Removing support for old compilers: do we have a consensus yet?
by John Maddock 30 Jan '14

30 Jan '14

Folks, As you know Boost.Config has had it's support for old compilers stripped out, and this is a controversial change. We're now at the point where I'd really like to get the routine changes/updates into release, but to do that we need a final decision on whether to keep (and release) Steven Kelly's changes in develop. So do we have a final decision? Thanks, John.

6 8

[fusion] preprocess target pull request
by Eric Niebler 29 Jan '14

29 Jan '14

https://github.com/boostorg/fusion/pull/1 I'm not sure who gets notified of pull requests, if anybody. Sending mail for good measure. -- Eric Niebler Boost.org http://www.boost.org

6 14

[offtopic] C++Now 2014 - hotel room available
by Hartmut Kaiser 29 Jan '14

29 Jan '14

I apologize for posting off-topic. Hey all, Unfortunately I will not be able to come to C++Now this year. However I already booked my hotel room at the Aspen Meadows (at the early bird rate!). If anybody is interested in using the hotel reservation, please get in contact with me offline. Thanks! Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

2 1

[git][predef] Pull fails
by Andrey Semashev 27 Jan '14

27 Jan '14

Hi, I checked out Boost on my Windows machine quite some time ago and today I tried to update it. I did: git submodule foreach git checkout develop git submodule foreach git pull The last command failed on Boost.Predef (log attached). I did not change it and I don't understand why there is conflict. I tried 'git reset --hard' and pull again, but it fails again the same way. How can I fix it?

7 10

Interest in Base2/16/32/64 Encoding Library?
by Thomas Kemmer 27 Jan '14

27 Jan '14

Dear Boost Developers, I would like to know if there is interest in incorporating a generic Base2/16/32/64 encoding library into Boost. I am the author of such a libray, hosted at http://code.google.com/p/stlencoders/ and would be willing to contribute and make the effort of "Boostifying" it, if the Boost community is interested in such a thing. There have been several suggestions for a Base64 encoding library on this mailing list in the past. Most of them have been dismissed, since Boost already provides a Base64 implementation with Boost.Serialization's "Dataflow Iterators". Though I appreciate the dataflow iterator's design, from personal experience I think that for the basic task of encoding/decoding, a higher-level interface, e.g. one that takes padding and intermittent whitespace (MIME) into account, would benefit many developers. Currently, the stlencoders library - implements the Base16, Base32 and Base64 encoding schemes as defined in RFC 4648. Base2, i.e. binary encoding, is also supported. - implements encoding and decoding operations as generic algorithms that operate on STL-style iterators - supports different encoding alphabets using custom traits classes - supports different character types - lets the user define if/which non-alphabet characters should be ignored via predicates - provides reasonable performance that matches most "plain C" implementations stlencoders is currently designed as a stand-alone library with no dependencies on Boost (or anything but C++03); it would therefore take some effort and guidance from the community to properly integrate it with the rest of Boost. I would therefore appreciate any feedback regarding your interest in this. Kind Regards, Thomas

7 11

Boost candidate similar to asyncplusplus
by Rodrigo Madera 27 Jan '14

27 Jan '14

Hello, I was wondering if there is anything similar to asyncplusplus [1] here in Boost land. I just found out about the library and I specially liked the task chaining syntax [2]: --- async::spawn([] { return 42; }).then([](int result) { return result; }).then([](task<int> parent) { std::cout << parent.get() << std::endl; }); --- This is something I would love to see in Boost. So I ask: 1) Are there any similar Boost candidates for task scheduling? 2) If not, is ASIO up to this with some adaptation? I felt specially inclined to ask this here because of all the discussion taking place over the recently reviewed Fibers library and the fundamentals of asynchronous processing. Very interesting thoughts being discussed there. And something more higher level (but not necessarily IO bound) might be helpful. Best regards, Rodrigo Madera [1] https://github.com/Amanieu/asyncplusplus [2] https://github.com/Amanieu/asyncplusplus/wiki/Tutorial

4 4

[github] boostorg/boost not listed?
by Joaquin M Lopez Munoz 26 Jan '14

26 Jan '14

Hi, After some recent aesthetic changes to https://github.com/boostorg , the repository boostorg/boost does not get listed in either of https://github.com/boostorg https://github.com/boostorg?page=2 https://github.com/boostorg?page=3 https://github.com/boostorg?page=4 https://github.com/boostorg?page=5 https://github.com/boostorg?page=6 even though it certainly exists and can be searched and found through the "Find a repository..." editbox. Before these latest changes to the web, boostorg/boost usualliy appeared #1 in the list as it quickly autoupdated after any subproject did. Thank you, Joaquín M López Muñoz Telefónica Digital

2 1

[atomic] Probable documentation issue: how do we know atomic is safe and/or efficient?
by John Maddock 26 Jan '14

26 Jan '14

I'm looking to use Boost.Atomic for the double-checked-locking-idiom, but I'm having trouble discovering a) Whether the library is correctly implemented. b) How efficient (or otherwise) the library is on various platforms. I'm sure the answer to (a) is that it is correct, but I was surprised that atomic<int> relied on the volatile modifier for thread safe load/stores on MSVC, I had assumed that something more than that would have been required, but I know I'm out of date on this stuff! I can't help thinking that questions like this could be allayed by better documentation - specifically what operations are used to ensure correctness on each supported platform, plus rationale and/or link to reference material. My apologies if this has been covered already in the review, and I realize that documentation is a lot of work, but I can see no way to ensure correctness other than through code inspection, so proper documentation is essential in that case. Regards, John.

5 10

[predef] Suggestion for Boost itself to start using this.
by Fletcher, John P 25 Jan '14

25 Jan '14

I have started to use the Boost predef library. I think it will be a good idea for this to be used within Boost. This is actually contained in the Future Work section of the Boost predef manual. http://www.boost.org/doc/libs/1_55_0/libs/predef/doc/html/predef/introducti… * And obviously there's lots of work to do in reformulating the existing Boost libraries to use the Predef library once it's accepted. I have been attempting to make use of it and one of the problems is that BOOST_VERSION itself is not consistent with it. It would I think break a lot of existing code to change BOOST_VERSION. Instead I suggest having another define a longside it which is consistent with Boost predef. I wnt to make the following suggestions to go into the definition of the version. First check that the version of Boost is recent enough. 1.55.0 is the first to have Boost predef. #include <boost/version.hpp> #if BOOST_VERSION >= 105500 #include <boost/predef.h> #define BOOST_HAVE_BOOST_PREDEF #endif #include <iostream> #include <string> #include <sstream> Then if that is true then construct a new defintion: #ifdef BOOST_HAVE_BOOST_PREDEF #ifdef BOOST_VERSION // The following translates BOOST_VERSION to a BOOST_VERSION_NUMBER!! // BOOST_VERSION % 100 is the patch level // BOOST_VERSION / 100 % 1000 is the minor version // BOOST_VERSION / 100000 is the major version #define BV BOOST_VERSION #define BVN BOOST_VERSION_NUMBER(BV / 100000,BV / 100 % 1000,BV %100) #define BOOST_VERSION_VERSION BVN #undef BVN #undef BV #endif Other libraries can also construct new version codes. John Fletcher

1 1

Re: [boost] [Boost-testing] DrWeb regression test server is going down
by Beman Dawes 25 Jan '14

25 Jan '14

On Thu, Jan 23, 2014 at 5:24 PM, Sergey Cheban <s.cheban(a)drweb.com> wrote: > Dear subscribers, > > Unfortunately, DrWeb regression test server (Visual C++ 9-12, Windows > server 2012) is going down. > Sorry to hear that, but thanks for all your past runs! Is this permanent or will it come back up at some point? --Beman

2 1

inter thread communication with message queues
by Kenneth Adam Miller 25 Jan '14

25 Jan '14

I was reading about message queues with respect to inter thread communication, and I have a specific use case that I want to describe. It's rather complex, so I want to be careful that I design it so that there are no race conditions. Pool A is a buffer (of type 1) handle manager, that feeds buffer handles into thread set 1, and receives old handles from thread set 2. There is only one thread running pool A. Thread set 1 is a set of N threads that fill up buffers of type 1 with regular data. It pushes full buffers to thread set 2. Thread set 2 is a set of M threads that compress buffers of type 1 into data buffers of type 2. Once the buffer of type 1 has be used up, it is cleared and sent back to Pool A. It pulls fresh data buffers of type 2 from Pool B, and sends freshly filled compressed buffers to Pool C. Pool C does something with the buffer, clears it and hands it to Pool B. Can this be done safely using an implementation like what I see here: http://www.justsoftwaresolutions.co.uk/threading/implementing-a-thread-safe… ? Note 1: -= denotes a 1-to-N connect and =- a N-to-1 connect RR = Request reply relationship +--------------------------------------------------------------------+ | | v | Pool A RR Thread Set 1 Router X | PULL-PUSH --==> PULL-read-PUSH ==--> PULL-PUSH --==> PULL Thread Set 2 PUSH \ / +-compress-+ Pool B RR / \ PULL-PUSH --==> PULL PUSH ^ || | || +----------- PUSH-write-PULL <--==++ Pool C Questions: how do I have a separate thread poll on multiple shared message queues? Like, I have a thread pool that both receives requests for buffer handles and that receives old buffer handles to recycle.

2 1

boost condition_variable internals
by Kenneth Adam Miller 25 Jan '14

25 Jan '14

I need to know that boost does not use any kind of locking, mutex or semaphore mechanism within the boost::condition_variable class. I don't know where it is in source, or I would check to make certain. Can someone provide me a yes no verification?

2 1

Re: [boost] Compile time reflection for IPC using
by Brian Wood 25 Jan '14

25 Jan '14

> Ok. I would like to ask you about next > When we should use the RPC architect should we serrialize the call Oleg, Sorry, but I have no idea what you're talking about in your posts. I have some serialization related software on my website that you may be interested in. I'm available to talk on the phone if you like. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

Announcing the Boost Community Maintenance mailing list
by Marshall Clow 24 Jan '14

24 Jan '14

The Boost Community Maintenance mailing list (boost-maint) has been created, and you can sign up here: http://lists.boost.org/mailman/listinfo.cgi/boost-maint The goal of the Boost Community Maintenance team is to maintain those libraries whose creators no longer can. The initial proposal for the group is here: https://dl.dropboxusercontent.com/u/9897665/community-maintenance.html I will be posting status and working guidelines here and on the boost-maint mailing list over the weekend. I encourage everyone who wishes to participate to subscribe to the boost-maint mailing list, and we’ll get started by Monday. Thanks in advance! -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

[testing] How do you interpret the SHA1 revision (outdated results)?
by John Maddock 24 Jan '14

24 Jan '14

So... I'm looking into Boost.Regex and I'm seeing some failures which appear to refer to outdated sources (line numbers are all wrong for current source), for example: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… But how on earth do I check this? Reported run date is yesterday, but this was fixed/changed on Dec 20th: almost a month ago. And the revision listed on the page is a SHA1 which I can't seem to relate to anything useful? Thanks, John.

6 13

Compile time reflection for IPC using
by Oleg Labutin 24 Jan '14

24 Jan '14

Do you now about one approach (for two compilers (gcc 3.7, and MSVC (last)) emulate compile time reflection with difference scope? Like struct some { META_STRUCT(some); FLD(int, a); FLD(int, b); METH(int, call_0, (int, a)); METH(int, call_1, (int, b)); }; void in() { typedef hl::reflection_extract<some>::field_accessors acc; some s; s.*hl::at<acc, a_accessor>::get() = 5; } We can see here https://github.com/ol72/hl/tree/ And you can try to compile this attached demo Use __J_ACTIVE define to see as reflection worked in json oriented part of project. For which you should install json. Without this you can see ability take meta information by query. But global goal I think we understanding Our backend can be something else. Like client server , data base oriented structures in which we can use by SQL like C++ syntax We can make (and I made it ) database like structures struct human_tables { TABLE(names) { fields((int) index, (std::string) name, .... ); }; TABLE(country) { fields((names_table::index) name, ... ); }; TABLE(human) { indexes(names_table::index_field); fields((names_table::index_field) name, (country_table::index) country...); }; };

3 11

C++03 and C++11 ABI compatibility for compiled libraries
by Andrey Semashev 24 Jan '14

24 Jan '14

Hi, I would like to raise the issue of binary compatibility of compiled Boost libraries between C++03 and C++11. I faced this problem with gcc on Linux, but other compilers and platforms may be affected as well. To summarize the problem: * Most, if not all Linux distributions build packages in C++03 mode. This is also the default in gcc. * Some Boost libraries conditionally use C++11 features in their binary interfaces (see [1] as an example). This makes C++03 and C++11 versions of the library binary incompatible. * Given that, users are unable to use C++11 in their code that uses Boost because of linker failures. I don't have the complete list of the offending C++11 features that break ABI, but it would seem that at least scoped enums and rvalue references are among them. Are there any more? I would like to hear opinions on the possible course of action to tackle this problem. Currently, I see 2 choices: 1. Avoid using C++11 features in binary interfaces. This may also mean avoiding STL types in binary interfaces, if they differ between C++03 and C++11 (I didn't verify that). This is my suggested hotfix solution for Boost.Filesystem [1] and the approach I took in Boost.Log. Obviously, this cripples code and error prone, but it keeps a single binary that can be used from any flavor of C++ on the user's side. 2. Compile different versions of Boost libraries, for each supported C++ version. The C++ version should be encoded into the library file names, so that different versions can coexist. This would require changes in Boost.Build and autolinking support code, but I think this would be a better long-term solution. Opinions? [1] https://svn.boost.org/trac/boost/ticket/6779

12 27

Boost.Fiber review January 6-15
by Nat Goodspeed 23 Jan '14

23 Jan '14

Hi all, The review of Boost.Fiber by Oliver Kowalke begins today, Monday January 6th, and closes Wednesday January 15th. ----------------------------------------------------- About the library: Boost.Fiber provides a framework for micro-/userland-threads (fibers) scheduled cooperatively. The API contains classes and functions to manage and synchronize fibers similar to Boost.Thread. Each fiber has its own stack. A fiber can save the current execution state, including all registers and CPU flags, the instruction pointer, and the stack pointer and later restore this state. The idea is to have multiple execution paths running on a single thread using a sort of cooperative scheduling (versus threads, which are preemptively scheduled). The running fiber decides explicitly when it should yield to allow another fiber to run (context switching). Boost.Fiber internally uses coroutines from Boost.Coroutine; the classes in this library manage, schedule and, when needed, synchronize those coroutines. A context switch between threads usually costs thousands of CPU cycles on x86, compared to a fiber switch with a few hundred cycles. A fiber can only run on a single thread at any point in time. docs: http://olk.github.io/libs/fiber/doc/html/ git: https://github.com/olk/boost-fiber src: http://ok73.ok.funpic.de/boost.fiber.zip The documentation has been moved to another site; see the link above. If you have already downloaded the source, please refresh it; Oliver has added some new material. --------------------------------------------------- Please always state in your review whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - 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? Nat Goodspeed Boost.Fiber Review Manager ________________________________

16 129

Volunteers needed to run regression test reporting
by Beman Dawes 23 Jan '14

23 Jan '14

We have had a long term problem with regression test reporting going offline unexpectedly. The process used XSLT processing was hard to configure, horribly slow, and very fragile, and those factors made it a pain to run. Last year, Steven Watanabe rewrote the report generation in C++, and those issues have pretty much disappeared, so the process is now far easier to run. It runs in five minutes or less. Hooray C++! Hooray Steven! And Hooray Tom Kent who runs the reports! The remaining reliability factors are local ones like system crashes. Since the reports run as cron jobs, it can be quite a while before anyone is inconvenienced enough to report it to the Boost list, and Murphy's Law ensures that it is always the day after the person running the reports left for a week-long back country hike. We can mitigate that by having several people running the reports. I've written some docs, so it shouldn't be too hard, although right now it does require a *nix-like system. I've been running them on a Windows host using a VirtualBox virtual Ubuntu system, and have found it to be easy. One possibility would be for Tom to continue to run the reports on the hour, a second person to run them twenty minutes after the hour, and a third to run forty minutes after the hour. Please volunteer to help make regression reporting more timely and reliable! --Beman

12 21

[phoenix] 7181
by Fletcher, John P 23 Jan '14

23 Jan '14

________________________________________ From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathieu Champlon [m.champlon(a)free.fr] Sent: 23 January 2014 12:11 To: boost(a)lists.boost.org Subject: Re: [boost] [phoenix] 9111 and 9113 > Hi John, >There is https://svn.boost.org/trac/boost/ticket/7181 which is also >about a warning albeit a different one. >Thanks for doing this ! >MAT. I have pushed to phoenix develop using the patch in 7181 John _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

[phoenix] 9111 and 9113
by Fletcher, John P 23 Jan '14

23 Jan '14

________________________________________ From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathias Gaunard [mathias.gaunard(a)ens-lyon.org] Sent: 21 January 2014 16:44 To: boost(a)lists.boost.org Subject: Re: [boost] [phoenix] New maintainer On 20/01/14 13:40, Fletcher, John P wrote: >> If you have any information on your problems with Phoenix, in particular any not already on the bug system, please let me know. >> > I filed bugs about warnings a while ago. (9111, 9113) > It shouldn't take much work to fix those and it would be great if I > could finally make my code compile without warnings. I have now pushed a fix for 9111 and some fixes for 9113 to the develop branch. The report on 9113 says there are others, so any other reports would be helpful. John _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

raw.github.com access from behind firewall
by Belcourt, Kenneth 22 Jan '14

22 Jan '14

Hi, When I try to run github hosted regression tests with run.py, access to raw.github.com times out even though it seems to be using the specified our proxy server. # Running regressions in /scratch/modular-boost... # Creating regression scripts at /scratch/modular-boost/tools_regression_src... # Dowloading regression scripts from https://raw.github.com/boostorg/boost/develop/tools/regression/src... --- http://wwwproxy.sandia.gov:80 What's interesting is that I'm able to clone from github.com just fine, as you can see here. -bash-4.1$ git clone https://github.com/boostorg/boost Initialized empty Git repository in /scratch/modular-boost/boost/.git/ remote: Counting objects: 180556, done. remote: Compressing objects: 100% (68339/68339), done. remote: Total 180556 (delta 111934), reused 180501 (delta 111879) Receiving objects: 100% (180556/180556), 68.21 MiB | 10.23 MiB/s, done. Resolving deltas: 100% (111934/111934), done. But we're not able to clone from raw. -bash-4.1$ git clone https://raw.github.com/boostorg/boost Initialized empty Git repository in /scratch/modular-boost/boost/.git/ error: The requested URL returned error: 403 while accessing https://raw.github.com/boostorg/boost/info/refs fatal: HTTP request failed which means this clone (https://raw.github.com/boostorg/boost/develop/tools/regression/src) will fail. Is this a known issue and / or is there a workaround for this? This is on RHE Linux with git 1.8.5.1. -- Noel Belcourt

3 9

[phoenix] bug 9111
by Fletcher, John P 22 Jan '14

22 Jan '14

From: Boost [boost-bounces(a)lists.boost.org] on behalf of Mathias Gaunard [mathias.gaunard(a)ens-lyon.org] Sent: 21 January 2014 16:44 To: boost(a)lists.boost.org Subject: (was Re: [boost] [phoenix] New maintainer > I filed bugs about warnings a while ago. (9111, 9113) > It shouldn't take much work to fix those and it would be great if I > could finally make my code compile without warnings. I have looked at the code for no 9111 and it looks like this: template <int M, typename RhsRT, typename RhsFP> bool operator==(function_ptr<M, RhsRT, RhsFP> const & rhs) const { return false; } For some reason that specialized case is always returning false, which is why rhs is unused. I need to look into why that is the case, or else do some dummy operation on rhs which will suppress the warning. John

2 2

[config] BOOST_NOINLINE on nvcc
by Mathias Gaunard 22 Jan '14

22 Jan '14

Hi, I noticed that I had some problems with some nvcc (NVIDIA CUDA) versions and BOOST_NOINLINE. The logic for defining BOOST_NOINLINE seems to be the same as that of BOOST_FORCEINLINE, which does work correctly, so it seems to be a nvcc bug that's not fully compatible with GCC despite claiming to be. What would be the correct way to fix that?

3 4

[git] boost + git flow
by Oliver Kowalke 22 Jan '14

22 Jan '14

does boost follows the git-flow schema, e.g. merging the changes from branch develop into master is not required by the library developer (this is done by the release manager)?! Oliver

5 4

[testing] Reports that lead nowhere?
by John Maddock 22 Jan '14

22 Jan '14

While we're updating and fixing testing issues, I notice the report generator is still creating content-free failures, for example this one: http://www.boost.org/development/tests/develop/developer/marshall-mac-regex… Ultimately leads nowhere :-( Thanks, John.

4 4

[regex] Need some help with msvc-11/12
by John Maddock 22 Jan '14

22 Jan '14

Can anyone with access to msvc-11 or 12 tell me what's causing this failure: http://www.boost.org/development/tests/develop/developer/output/DrWeb_vc12_… You will probably need to build and run under the debugger to find out I suspect... Many thanks in advance, John.

3 4

Support for Android
by Vicente J. Botet Escriba 22 Jan '14

22 Jan '14

Hi, I see that there are some trouble with Boost and Android: https://svn.boost.org/trac/boost/ticket/9082 http://www.boost.org/development/tests/develop/developer/output/apolukhin-A… Could someone state what is the Boost approach to support Android? Should the user build with NDK r8e? Does bjam supports a specific android platform? Best, Vicente

4 11

[wave] preprocessor directives in output
by Eric Niebler 22 Jan '14

22 Jan '14

I'm looking at automating the regeneration of Fusion's preprocess headers with the wave tool. Currently, it's impossible because of stuff like this (from container\vector\vector.hpp): #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) vector(vector&& rhs) : vec(std::forward<vector_n>(rhs.vec)) {} #endif When the wave driver is run, either BOOST_NO_CXX11_RVALUE_REFERENCES is defined, in which case the block of code gets left out, or else it isn't, in which case the block of code is left in. Both are wrong. What should happen is that the #if and #else directives should be present in wave's output. I can keep wave from expanding certain named macros with the -N switch, but there doesn't seem to be a way to selectively keep wave from evaluating #if/#else directives. Or is there? Any help appreciated. Eric

8 18

[variant] Breaking change introduced by variadic support
by Agustín K-ballo Bergé 22 Jan '14

22 Jan '14

The recent changes to introduce variadic support to `variant` introduce breaking changes in the documented macros. When variadic support is detected, `BOOST_VARIANT_LIMIT_TYPES` is not defined and `BOOST_VARIANT_ENUM_[SHIFTED_]PARAMS` uses variadic templates instead of enumerating parameters. This is a breaking change in the documented interface, and one that requires all but the simplest use cases to be rewritten. For instance, this breaks _Boost.Spirit_ support of `variant` (https://svn.boost.org/trac/boost/ticket/9238) requiring two different implementations to be provided. Is this the preferred path to take? I would suggest instead to keep the macros as documented at all times, and let the user handle the variadic case manually. This would allow users to support both variadic and non-variadic `variant`s up to a certain limit with a single code case (without breaking the documented interface), and result in cleaner code for those cases that only target compilers with variadic support. There's no point in using a macro if it won't work for both cases. Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

3 8

[phoenix] New maintainer
by Fletcher, John P 21 Jan '14

21 Jan '14

I have just agreed to play a part in the maintenance of Boost Phoenix. I am working with a lot of help from Joel, Thomas and Eric. I have been looking at the bugs logged on the system and it seems as though there are a number of reported problems which need to be tackled, in particular 9362 and 9363. Please bear with me as I learn the modular-boost system and look for fixes for the problems. If you have any information on your problems with Phoenix, in particular any not already on the bug system, please let me know. Best wishes John

3 3

Reboot the CREST server machines
by DongInn Kim 21 Jan '14

21 Jan '14

Dear All, The current CREST servers need to reboot to kick in a new kernel and to mount a NFS server with a new IP address. If things are not too critical nowadays, I would like to reboot the following server machines next Tuesday (Jan 21st). - lion.crest.iu.edu - tiger.crest.iu.edu - wowbagger.crest.iu.edu - leopard.crest.iu.edu - jaguar.crest.iu.edu Date: Jan 21st, Tuesday Time: 6:00am-6:30am Pacific US time 7:00am-7:30am Mountain US time 8:00am-8:30am Central US time 9:00am-9:30am Eastern US time 12:00pm-12:30pm GMT The list of services that may not be available: - NFS - Web services www.crest.iu.edu www.open-mpi.org www.boost.org svn.crest.iu.edu/svnmanager ... - Mailing lists - Subversion - LDAP authentication (login to the Linux workstations and cutter cluster) Please let me know if you have any questions or concerns about this booting schedule. Regards, -- - DongInn

1 1

bjamming that used to work before modular-boost
by Paul A. Bristow 20 Jan '14

20 Jan '14

I have a jamfile.v2 in a sandbox project that used to work before. I have started using modular-boost, and after some fumbling, I'm using that OK-ish. The message is: Unable to find the Boost source tree in the locations searched. Try setting the environment variable BOOST to point to your Boost tree, or else invoke bjam with the --boost=path option. The Boost include path will not be automatically set. The paths searched were I:\boost-sandbox\guild/../boost I:\boost-sandbox\guild/../Trunk But the file LICENSE_1_0.txt was not found in any of them Unable to find the Boost.Build source tree in the locations searched. Try setting the environment variable BOOST_BUILD to point to your Boost.Build tree, or else invoke bjam with the --boost-build=path option. The paths searched were i:\modular-boost\tools\build\v2 But bootstrap.jam was not found in any of these More failures will very likely follow... (And they did ;-( ) I've tried some guesses at parameters including b2 --boost=i:\modular-boost --boost-build=i:\modular-boost\tools\build -a html without success. I have boost-build.jam at I:\modular-boost Suggestions please. Paul PS I'd like to change environment variables if possible to avoid changing lots of .bat files that call b2. --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

4 8

Forthcoming Boost.Fiber review
by Nat Goodspeed 20 Jan '14

20 Jan '14

Hi all, The review of Boost.Fiber by Oliver Kowalke is scheduled from Monday, January 6th to January 12th. ----------------------------------------------------- About the library: Boost.Fiber provides a framework for micro-/userland-threads (fibers) scheduled cooperatively. The API contains classes and functions to manage and synchronize fibers similar to Boost.Thread. Each fiber has its own stack. A fiber can save the current execution state, including all registers and CPU flags, the instruction pointer, and the stack pointer and later restore this state. The idea is to have multiple execution paths running on a single thread using a sort of cooperative scheduling (versus threads, which are preemptively scheduled). The running fiber decides explicitly when it should yield to allow another fiber to run (context switching). Boost.Fiberinternally uses coroutines from Boost.Coroutine <http://ok73.funpic.de/boost/libs/coroutine/index.html>; the classes in this library manage, schedule and, when needed, synchronize those coroutines. A context switch between threads usually costs thousands of CPU cycles on x86, compared to a fiber switch with a few hundred cycles. A fiber can only run on a single thread at any point in time. docs: http://ok73.funpic.de/boost/libs/fiber/doc/html/index.html<http://ok73.ok.funpic.de/boost/libs/coroutine/doc/html/> git: https://github.com/olk/boost-fiber src: http://ok73.ok.funpic.de/boost.fiber.zip<http://ok73.ok.funpic.de/boost.coroutine.zip> --------------------------------------------------- Naturally, you need not wait until the review formally opens to start reviewing the Fiber library. Please always state in your review whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - 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? Nat Goodspeed Boost.Fiber Review Manager ------------------------------

6 8

GSoC 2014
by Bjorn Reese 20 Jan '14

20 Jan '14

Deadline for registring as a mentoring organization for GSoC 2014 is 14 Feb 2014. Should we start collecting ideas?

13 20

[build] referring to a tool from an external project
by Eric Niebler 20 Jan '14

20 Jan '14

I'm trying to write a jamfile in an external project that uses boost. The jamfile should invoke the wave tool to preprocess some code as a build action. I have this: actions do_wave { $(>[2]) -o- --config-file wave.cfg $(>[1]) } W = /boost/libs/wave/tool/build//wave ; make preprocess : preprocess.cpp $(W) : do_wave ; I get: > error: Unable to find file or target named > error: '/boost/libs/wave/tool/build//wave' > error: referred to from project at > error: '.' > error: could not resolve project reference '/boost/libs/wave/tool/build' If I use this instead: W = /boost//wave ...it builds the wave dlls, not the command-line tool. So how do I tell it to build the tool? -- Eric Niebler Boost.org http://www.boost.org

3 5

[Math] Permutations?
by Vee Kay 19 Jan '14

19 Jan '14

Hello, Would it be useful for Boost to provide a permutation class? The standard provides a couple of relevant functions (is_permutation, next_permutation) and Boost.Iterator offers a permutation_iterator adaptor. But as far as I can tell, no class that can be manipulated similarly to the mathematical object, something like this: https://gist.github.com/Kojirion/8503800 I admit I do not have many use cases in mind, just the impression this is a useful tool. As an example, once in a gui application I wished to animate the rearranging of a table; writing a permutation class made it easy to get the sequence of transpositions of rows and columns that would yield the desired result. (note though the above api doesn't include an asTranspositions() because I 'm not sure what is the most useful way to represent a transposition). I 'd be happy to hear your thoughts, Albert

2 1

STL::MAP: Printing values only once ..
by Rahul Mathur 18 Jan '14

18 Jan '14

Hi, I have a input.txt file seperator by pipe '|' as - 40147|181|ORANGE|MIKE|XX||1000397900|3500 40148|373|ORANGE|BOB|XX||1078889400|4500 40149|673|ORANGE|TREY|XX||1095159900|5500 I only wish to have all the FIRST(ID=40147) and LAST FIELD(PRICE=3500) to be printed for three lines as given above. I am reading as - -- #include <iostream> #include <fstream> #include <sstream> #include <string> #include <boost/algorithm/string.hpp> using namespace std; struct FILE_INPUT { int ID; int Asset_ID; char T_Name[]; char Symbol[]; char Series[]; char Gap; int Date; int price; }; int main() { typedef std::map<int, int> unordmap; unordmap ask; FILE_INPUT fl_inp; memset( &fl_inp, 0, sizeof(fl_inp) ); ifstream in ("input.txt"); string s; const char delimiter = '|'; while ( getline (in, s) ) { trim( s ); if ( !s.empty() ) { stringstream strm( s ); string item; getline( strm, item ); stringstream stra( item ); string tmp; getline( stra, tmp, delimiter ); { stringstream strb( tmp ); strb >> fl_inp.ID; } getline( stra, tmp, delimiter ) { stringstream strb( tmp ); strb >> fl_inp.price; } ask.insert( std::make_pair((fl_inp.ID),(fl_inp.price)) ); unordmap::iterator pos = ask.begin(); for (pos = ask.begin(); pos != ask.end(); ++pos) { std::cout << "ID: " << pos->first << "\t" << "Price: " << pos->second << std::endl; } std::cout << " " << endl; } } } -- The map is being inserted with both ID as key and price as value but while printing it prints the values thrice as - ID: 40147 Price: 3500 ID: 40147 Price: 4500 ID: 40148 Price: 5500 ID: 40147 Price: 3500 ID: 40148 Price: 4500 ID: 40149 Price: 5500 The MAP should print all values together only once as - ID: 40147 Price: 3500 ID: 40148 Price: 4500 ID: 40149 Price: 5500 -- Can I maintain some checks to print all values simply once. Thanks.

5 4

Re: [boost] Request for comments on super-project workflow doc
by Peter Dimov 18 Jan '14

18 Jan '14

Robert Ramey wrote: > John Maddox brought up the question of "bridge libraries" (?) . An > example would be the serialization library includes tests for boost > variant but doesn't use boost variant itself. So if one includes just the > modules which the serialization library uses to build - you'll get one set > of modules which won't include the ability to run the test set. If you > include all the modules which test set requires, you're going to include > half of boost. Yes, in general, there are three sets of dependencies: what the library headers depend on, what the library sources depend on, and what the library tests depend on, each a superset of the previous one. This doesn't make such a tool worthless or impossible though. And - FWIW - bridge libraries are something else, I think. The problem there is that, f.ex. a library X may not depend on the serialization library but making X's types serializable would. A bridge library XS could solve this by depending on both X and serialization and providing the necessary support. In principle, I've always argued that libraries should be designed in such a way so that adding support should not require including a header, but that's not the path of least resistance and if one doesn't specifically keep that requirement in mind, it's rare to see it satisfied. (And it's not always possible.) For example, here's how the smart pointers provide hash support without including anything: namespace boost { // hash_value template< class T > struct hash; template< class T > std::size_t hash_value( boost::intrusive_ptr<T> const & p ) { return boost::hash< T* >()( p.get() ); } } // namespace boost and this is how a type may be specified to be a (boost::bind) placeholder, again without any inclusions: namespace boost { template<class T> struct is_placeholder; template<int I> struct is_placeholder< my_placeholder > { BOOST_STATIC_CONSTANT( int, value = I ); }; } // namespace boost

3 3

Prefix Trie
by Michael Conlen 18 Jan '14

18 Jan '14

I recently discovered that there seems to be a lack of good Prefix Tries in C++. There are many basic ones and I think a C implementation ran all of 12 lines of code, but something with a nice interface and iterator seemed lacking. (Stop me if I'm missing something here) So I'm interested in developing Prefix (and possibly a Radix) Trie containers in C++. I could see a use for both sequence and map containers; however this would be a learning experience for me. If there's interest in such a creature I'm happy to go through the review process as necessary. Having said that, is there interest in having such a library and if so what are the pointers on what would be expected (particularly any boost-isms)? -- Mike

3 2

[lockfree] Faster ring-buffer queue implementation
by Alexander Krizhanovsky 16 Jan '14

16 Jan '14

Hello, some time ago I've implemented lock-free multi-producer multi-consumer queue on ring buffer and recently I've compared it's performance with current (Boost 1.55.0) boost::lockfree::queue - it shows 50% better performance. I've made just a quick glance on the Boost implementation and noticed that it uses CAS operations which is basically slower than simple RMW (atomic increment in our case) on modern x86-64 hardware. Maybe I've made some mistake in boost::lockfree::queue usage. If so then I'll be obliged for pointing me out the problem in my benchmark. Otherwise I'm wondering if it has sense to integrate the queue implementation into boost::lockfree? The algorithm description is available at http://www.linuxjournal.com/content/lock-free-multi-producer-multi-consumer… The source code of the queue with the benchmark for boost::lockfree::queue: https://github.com/krizhanovsky/NatSys-Lab/blob/master/lockfree_rb_q.cc And the benchmark results are available here: http://natsys-lab.blogspot.ru/2014/01/natsys-lock-free-queue-in-comparison.… Thanks! -- Alexander Krizhanovsky NatSys Lab. (http://natsys-lab.com) tel: +7 (916) 717-3899, +7 (499) 747-6304 e-mail: ak(a)natsys-lab.com

3 4

[Fibers] asio handler not respecting scheduler
by Eugene Yakubovich 16 Jan '14

16 Jan '14

While working on factoring out the scheduling algorithm, I noticed that when fibers are used with asio, the completion handler manually invokes the fiber: boost-fiber/include/boost/fiber/asio/detail/yield.hpp: In yield_handler<T>: void operator()( T t) { * ec_ = boost::system::error_code(); * value_ = t; fiber_->set_ready(); boost::fibers::detail::scheduler::instance()->spawn( fiber_); boost::fibers::detail::scheduler::instance()->run(); } Why does it call spawn? Shouldn't the scheduler (run method that follows) decide which fiber to run next? What happens if there's another fiber with a higher priority that's ready? A similar issue also comes up when launching a new fiber. The documentation supports the implementation in that the control immediately is transferred to the new fiber. However, shouldn't the scheduling algorithm decide when the new fiber should run? As an unrelated issue, I think this maybe a bug -- it's setting the active fiber to ready instead of waiting: void round_robin::yield() { <snip> // set active fiber to state_waiting active_fiber_->set_ready(); <snip> } Same issue in round_robin_ws and asio/round_robin. Regards, Eugene

3 4

[Boost.Sync] no master branch?
by Eric Niebler 16 Jan '14

16 Jan '14

What is Boost.Sync and why doesn't its repository have a master branch? -- Eric Niebler Boost.org http://www.boost.org

7 14

1.56 release schedule?
by Tim Blechmann 15 Jan '14

15 Jan '14

hi all, according to the website, the 1.56 beta was scheduled on dec 31st and the release date is feb 3rd ... maybe the release managers could update the release schedule? shifting the dates by a month could be realistic, or what do other people think? cheers, tim

5 7

Re: [boost] [Fibers] Performance
by Brian Wood 15 Jan '14

15 Jan '14

Oliver Kowalke wrote: 2014/1/13 Hartmut Kaiser <hartmut.kaiser(a)gmail.com> >> >> Ping? Any news? I'd make my vote depend on the outcome of the performance >> tests. >> > > I'll add performance tests but I doubt that I could finish to implement the > tests till Wednesday. > I've to look through the tests provided by the HPX-project, select some and > try to understand > what they are doing. Maybe a few weeks could be given to Oliver to do the testing. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

[graph][BGL][PBGL] Proposed patches
by bminano 15 Jan '14

15 Jan '14

Hi, I found two problems using the graph library, concretely using it in parallel. Swimming into the code I think I found possible solutions to that. I proposed two patches in boost Trac at tickets #9549 and #8250, but I had no response. I am afraid the tickets were not revised, so I think publishing here would be a good idea. Maybe the maintainers of the library want to apply that patches for future releases. I hope so, as I am working in a project that will select boost graph as a masterpiece of graph simulations. I the responsible wants to ask me about the bugs I'll be glad to answer. -- View this message in context: http://boost.2283326.n4.nabble.com/graph-BGL-PBGL-Proposed-patches-tp465789… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] GSoC 2014
by Christopher Kormanyos 15 Jan '14

15 Jan '14

> hi sir, > i m deepak, i want to apply for GSOC 2014 . i am good in c++, mathematics > and having proficient knowledge of algorithms. > i have a special interest for following boost libraries > - Boost.Math Generalized Hypergeometric Functions Well, that's a cool one for sure :-) Thank you for your interest, deepak. It's still a bit early in the game because we have not yet found an organization administrator. Nor have we formally applied as an organization for GSoC 2014. So keep an eye on the progress and base your actions accordingly. > Boost.Multiprecision > new data structures and algorithms I do not believe that we will be working on Multiprecision in this year's GSoC. Some of the things are already done, and others, quite honestly have too much novel research character for GSoC. This is an area for independent research at the moment. > i want to know if i could start early or work with boost trac or you tell me what to do As I mentioned, keep an eye on our progress. If Boost applies, and if Boost gets nominated for GSoC, then you may apply. It is a worldwide competition, so it always helps to apply early, ask questions on the board, write a good proposal, and generally do your best. Good luck. Chris. On Tuesday, January 14, 2014 8:45 PM, deepak goel <deepakgoel7514(a)gmail.com> wrote: On Monday, January 13, 2014 2:08:39 AM UTC+5:30, Christopher Kormanyos wrote: >> I have just added a page for GSoC 2014 here >> https://svn.boost.org/trac/ boost/wiki/SoC2014 > >Thank you Vicente. > >I have added "Boost.Math Generalized Hypergeometric Functions". > >Sincerely, Chris. > > > > > >On Sunday, January 12, 2014 6:45 PM, Vicente J. Botet Escriba <vicent...(a)wanadoo.fr> wrote: > >Le 12/01/14 18:20, Christopher Kormanyos a écrit : > >>> Deadline for registering as a mentoring organization for GSoC 2014 is 14 >>> Feb 2014. >>> Should we start collecting ideas? >> I believe we have several good ideas. We need to get moving. >> >> Does anyone know how to put up the skeleton of this kind >> of page? (Or can anyone point me in the right direction on >> how to do it?) >> >> https://svn.boost.org/trac/ boost/wiki/SoC2013 >> >> The hard part, I believe, will be finding one or more org admins. >> The guys did a great job last year, and set the bar pretty high. >> >> * I can probably mentor a student. >> * I can help collecting and writing the ideas on SVN trac. >> * I could also help writing the GSoC 2014 proposal and with recruiting. >> >> But org admin would potentially be too much of a commitment for me. >> >> Is anyone interested in being org admin for GSoC 2014? >> >Hi, > >I have just added a page for GSoC 2014 here >https://svn.boost.org/trac/ boost/wiki/SoC2014. > >Be free to add your projects and ideas. >Vicente > > hi sir, i m deepak, i want to apply for GSOC 2014 . i am good in c++, mathematics and having proficient knowledge of algorithms. i have a special interest for following boost libraries - Boost.Math Generalized Hypergeometric Functions Boost.Multiprecision new data structures and algorithms i want to know if i could start early or work with boost trac or you tell me what to do ______________________________ _________________ >Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost > > >______________________________ _________________ >Unsubscribe & other changes: http://lists.boost.org/ mailman/listinfo.cgi/boost >

2 1

Regression test results starting to become available
by Beman Dawes 15 Jan '14

15 Jan '14

http://beta.boost.org/development/tests/master/developer/summary.html http://beta.boost.org/development/tests/develop/developer/summary.html Only a few of the testers have cycled. Some testers are only reporting results for 15 or so libraries. That's an artifact of getting started; these testers cycle the full tests will appear. --Beman

5 6

[git] annotated SVN synchronization for boost.test (example only)
by Peter A. Bigot 15 Jan '14

15 Jan '14

Below is an annotated sequence of (bash) command-line git operations that I used in a local copy of Boost.Test to understand what was happening in it, with no intention of proposing this be what the maintainers actually do with the module. Boost.Test is particularly interesting because master has been essentially unchanged for four years, while there are significant modifications pending in develop. A few of the changes on master make the SVN synchronization step tricky. People who want to hone their git-fu might find it workwhile to follow these steps in a local workspace to see how they work. I make no claim that they're the only way the same goal could be reached. I also have not used this for further development, so there the resulting structure may be flawed or contrary to strict git-flow expectations. WARNING: DO NOT paste the entire sequence into a shell window: at a couple of places you must manually do what the comment says (e.g., edit the contents of files to resolve conflicts) in order to reach a successful state. # Revert to a clean state where local branches match the origin, and the # working branches from any previous run of the script have been # removed. git fetch origin git checkout master git reset --hard origin/master git checkout develop git reset --hard origin/develop git branch -D synch/master synch/develop basis # git-merge-base identifies the commit to be used when merging things. # We're looking for something better, so no need to go beyond that one. MERGE_BASE=$(git merge-base develop master) # 635b1e38dd643af264c2ea8f0ba08dfb58337e37 echo ${MERGE_BASE} # Examine the history along master and develop, finding the most recent # SVN revision merged from develop into master. This only works if all # previous SVN revisions were also merged; if only select ones were # merged, it's probably best to skip them and keep looking. For # example, master on Boost.Test merged 81913, 63640, 62426, and a couple # others, but the last version that incorporated most prior fixes was # 57993 merged in ${MST_MP_SHA1}. git log ${MERGE_BASE}..master MST_MP_SHA1=2e4f64197956ccb94b24be4ed32abf25ee4b9dd1 # Now find the develop commit that most recently preceded that one in # SVN history. Basically, this is reviewing the log of differences # for the last commit with a SVN revision less than the one selected in # the previous step. BEWARE: If the revision you picked above doesn't # correspond to a develop branch change (e.g., if you picked 81913 which # didn't go into develop until 82756) you will create pain for yourself. git log ${MERGE_BASE}..develop # Here it's commit 57864 in ${DEV_MP_SHA1} DEV_MP_SHA1=fd8d9b3e4e4ab9656b0d880e8c519eabd134638a # Now take a look at what's different between those versions. That's # what'll get lost in a "-s ours" merge if it subsequently appeared in # develop. git diff ${DEV_MP_SHA1}..${MST_MP_SHA1} # There's some whitespace differences, some casts and error messages, # file permission changes, and two small changes from r81913 that we'll # talk about later. # Here's where my technique differs: You could do an "-s ours" merge # from the selected develop commit into master's HEAD as recommended at # https://svn.boost.org/trac/boost/wiki/StartModMaint#Firstpost-svnconversion… # but if you do you might lose cherry-pick commits on master that are # also on develop. Instead, we'll create a new merge point on master at # the synchronization point, and merge from develop. git checkout -b basis ${MST_MP_SHA1} git merge -s ours -m 'SVN merge basis preserving master' ${DEV_MP_SHA1} # Verify that the differences are the ones we accepted earlier: git diff basis..${DEV_MP_SHA1} # Now, let's do some cleanup, and get master and develop branches that # actually fork at the merge point, rather than simply assume the merge # point is identical. This indirectly helps manage the differences that # we threw away with "-s ours". git checkout -b synch/master master git rebase basis # This should show no differences, because we just inserted a commit # that records parentage but changes no content. git diff master synch/master # Do the same at develop. Here we're going to have to resolve any # conflicts between the selected merge point git checkout -b synch/develop develop git rebase basis # 66 patches in we hit one of the differences: git stat # (MANUAL STEP) There's whitespace at the end of build/Jamfile.v2. Edit # the file to remove the diff markers, stage the changes, and tell # rebase to continue. git add -u git rebase --continue # After 204 patches there's another. git stat # (MANUAL STEP) Here you'll see everything is clean except # include/boost/test/impl/framework.ipp. Search for <<<<<< and edit to # keep the one with the upper-case TUT_SUITE. git add -u git rebase --continue # And we're done. Now let's see what changed: git diff develop synch/develop # Some of the differences between master and develop at the SVN merge # point have gone away; these are the ones I suspect but have not # confirmed would have been lost had we merged to master's HEAD instead # of to the base version. A few changes remain that were in master but # not in develop. # You have a choice at this point. If the repository wasn't already # public, I'd reset master (develop) to synch/master (synch/develop) and # move on. But since they were public, merge them; keeps history, # and makes future actions cleaner. git checkout master git merge -m 'Merge in rebased master' synch/master git checkout develop git merge -m 'Merge in rebased develop' synch/develop # Finally, what would happen if we merged develop into master now? git checkout -b test master git merge develop # Very nearly a clean merge. See what's not staged: git stat -u | grep '^.[^ ]' # ## test # UU include/boost/test/utils/runtime/cla/parameter.hpp # UU include/boost/test/utils/runtime/env/variable.hpp # # Again, open the files and look for the diff markers: one uses m!=0 and # the other !!m. Which is right? Use git-blame: git blame origin/master include/boost/test/utils/runtime/cla/parameter.hpp # The master change came in 954d3ab6 which was SVN commit r81913 by # Vicente J. Botet Escriba. Show the change: git log -p 954d3ab6^! git blame origin/develop include/boost/test/utils/runtime/cla/parameter.hpp # The develop change came in 4f7fc06c which was SVN commit r82756 by # Gennadiy Rozental. Show the change: git log -p 4f7fc06c^! # Note that if, back when selecting the SVN merge point, we'd gone with # r81913 things would be completely bolluxed at this point since the # corresponding change didn't come from the develop branch. # (MANUAL STEP) It's Rozental's project, so pick the develop solution # (!!m). Then stage the changes and commit, editing the message to # indicate how you resolved the conflict. git add -u git commit

5 7

[any] Equality
by Bjorn Reese 15 Jan '14

15 Jan '14

I noticed that boost::any does not have an operator== for comparing two boost::any objects. Is this a deliberate choice? Currently I have to (1) compare the types, and (2) convert the values with any_cast (and probably catch bad_any_cast exceptions) and compare them.

4 4

[context] compile failure
by Jürgen Hunold 15 Jan '14

15 Jan '14

Hi Oliver, Boost.Context fails to compile since commit 5f52abd82fb6fb32d7d79575e48b3f26bfff6d27 Author: Oliver Kowalke <oliver.kowalke(a)gmx.de> Date: Thu Jan 9 17:39:59 2014 +0100 add support for 'combined' architeture on MacOS X with error message: - 32-bit : no - 64-bit : no error: at /ive/hunold/src/devel/boost/tools/build/src/kernel/modules.jam:107 error: Unable to find file or target named error: '/boost/architecture//combined' error: referred to from project at error: '/ive/hunold/src/devel/boost/libs/context/build' It seems that config/ is missing the combined.cpp needed for the architecture check. Could you please add it? Tip: Use git config --global status.showuntrackedfiles all to always show new file with "git status". This is from http://qt-project.org/wiki/Setting-up-Gerrit but maybe should be in our wiki,too. Thanks! Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

2 4

Re: [boost] Prefix Trie
by Arash Partow 14 Jan '14

14 Jan '14

On Wed, Jan 15, 2014, Michael Conlen wrote: > > I recently discovered that there seems to be a lack of good Prefix Tries in C++. blah blah blah. > I highly doubt your assertion. In fact I'd go so far as to say, the only language one can find decent-to-excellent implementations of the various algorithms is C++. eg: https://code.google.com/p/patl/

1 0

Adding cstdfloat.hpp - wheres the best place?
by John Maddock 14 Jan '14

14 Jan '14

Folks, Christopher Kormanyos has coded up a version of cstdfloat.hpp for Boost.Math: https://github.com/boostorg/math/blob/bernoulli-tgamma/include/boost/math/t… This header is proposed for C++14, and the C language folks are doing something similar: it provides similar functionality for floating point types that <cstdint> does for integer types: Typedefs: floatN_t float_leastN_t float_fastN_t floatmax_t Macros: BOOST_FLOATN_C(x) // floating point constant of width N. BOOST_FLOAT_N_MIN BOOST_FLOAT_N_MAX BOOST_FLOAT_FASTN_C(x) BOOST_FLOAT_LEASTN_MIN BOOST_FLOAT_FASTN_MIN BOOST_FLOAT_LEASTN_MAX BOOST_FLOAT_FASTN_MAX BOOST_FLOATMAX_C(x) BOOST_FLOATMAX_MIN BOOST_FLOATMAX_MAX Where N is one of 16, 32, 64, 128 and correspond to the IEEE half, single, double and quad types respectively. So... the question is where to best place this? Does anyone object if it goes under boost/cstdfloat.hpp to sit alongside cstdint.hpp? Where should it best be documented and tested? We can obviously add it under the Math lib, but is there a better more "discoverable" place? cstdint.hpp is under integer BTW so it can't go there ;-) Thanks in advance, John.

2 1

[TortoiseGit] New release fixes submodule problem bothering some Boosters
by Beman Dawes 14 Jan '14

14 Jan '14

TortoiseGit release 1.8.7.0 fixes the Submodule Update... crash that was one of the few problems that forced TortoiseGit users to switch to the command line. Thanks to the TortoiseGit folks for jumping on the Boost bug report immediately, and the libgit2 folks who in turn fixed a problem with their library. --Beman

1 0

The Community Maintenance Team proposal accepted
by Beman Dawes 14 Jan '14

14 Jan '14

The Steering Committee has voted to accept the Community Maintenance Team proposal, and Marshall Clow has volunteer to act as the team's fearless leader. See https://dl.dropboxusercontent.com/u/9897665/community-maintenance.htmlfor the actual proposal. Thanks to everyone who contributed ideas and discussion. I tried to capture contributors names in the Acknowledgements section of the proposal. Apologies if I missed anyone. --Beman

14 23

[git] nit in library release documentation
by Peter A. Bigot 14 Jan '14

14 Jan '14

At https://svn.boost.org/trac/boost/wiki/StartModMaint#Lightweightlibraryrelea… there is: git tag -a mylib-1.2.0 git push --tags mylib-1.2.0 # specific tag pushed to avoid pushing all local tags As discussed in a thread on module tagging, --tags should never be used with git push as it pushes all local tags to the remote repository (adding those that did not exist there). There are cases where you might want to do that, but for the specific situation of releasing a tagged library a sufficient and less risky command is: git push mylib-1.2.0 # specific tag pushed to avoid pushing all local tags Peter

2 1

Re: [boost] Is there interest in a collection of call stack utilities?
by Aurelian Melinte 14 Jan '14

14 Jan '14

Hello, To follow up on the discussion https://groups.google.com/forum/#!topic/boost-developers-archive/PSwTBEEe0Ao I was not clear if there is interest for it or not. I went ahead and the first cut of the code is now at https://github.com/melintea/Boost-Call_stack Please feel free to take a look and comment. Regards, Aurelian

6 7

Getting Started with Modular Boost Library Maintenance
by Gly Marvellou 14 Jan '14

14 Jan '14

1 0

Removing support for old compilers
by Joaquin M Lopez Munoz 14 Jan '14

14 Jan '14

Hi Stephen As part of your initiative of removing support for old compilers, are you building somewhere a change log in the form of either a list of compiler deficiencies or compiler versions no longer supported? I understand this should be inserted in a prominent place on the Boost 1.56 release notes and can serve as a reference for lib maintainers reviewing your patches (tracking changesets is harder and commit messages are not always completely illuminating). Thank you, Joaquín M López Muñoz Telefónica Digital

16 51

[Thread] Doc bug?
by Alexander Lamaison 14 Jan '14

14 Jan '14

The docs [1] for the `scoped_thread` and `strict_scoped_thread` says > "While thread call std::terminate() on the destructor is the thread is > joinable, strict_scoped_thread<> or scoped_thread<> join the thread if > joinable. Several other places on the page say something similar. I was under in the impression that Boost.Thread had toyed with adopting this behaviour to match `std::thread` but decided against it after complaints on this list. Am I wrong? [1] http://www.boost.org/doc/libs/1_55_0/doc/html/thread/ScopedThreads.html Alex -- Swish - Easy SFTP for Windows Explorer (http://www.swish-sftp.org)

3 3

[range] flat_array_view feature request.
by Mostafa 14 Jan '14

14 Jan '14

I think having a flat_array_view adapter in boost would be helpful. Something along the lines of https://github.com/m-w-a/sandbox/blob/master/flat_array_view.cc What do the maintainer(s) of Range and others think? Mostafa

5 7

[block_ptr] & Java
by Phil Bouchard 14 Jan '14

14 Jan '14

Hello everyone, In a quest to speed up my Android applications and knowing Java is written in C++, I decided to discuss with the OS community openjdk.java.net to try to introduce them block_ptr. But the conversation was dead in the water probably due to the lack of developers. So I just have questions: - Does anybody know if Java uses Boost? - block_ptr hasn't been reviewed yet but memory management is an important subject. Are there unanswered questions about it? Sincerely, -Phil Experiment proposal to refute Special Relativity for the interested: http://finitetheory.com/files/experiment.pdf

11 39

[predef] [rfc] Mutually exclusive definitions?
by Rene Rivera 13 Jan '14

13 Jan '14

After going back and re-reading various commentaries for the review of Boost.Predef and some after the review I'm questioning a design choice of Boost.Predef. Currently Boost.Predef will define multiple symbols when, for example, a compiler "emulates" another compiler. The current common occurrence of this is the GCC compiler which many other compilers emulate by defining the GCC version macros. This is no longer the case for the OS definitions though. The OS definitions are mutually exclusive. And hence in order to make for a more consistent behavior I am considering changing the library to make not just OS defs mutually exclusive. But also making compiler, library, and architecture mutually exclusive. And I'm asking for some general feedback as to what the most useful approach, from using Boost.Predef, is likely to be. In particular I'm considering the following choices: 1. Simple mutual exclusion of BOOST_ARCH_*, BOOST_COMP_*, BOOST_LIB_C_*, BOOST_LIB_STD_*, and of course BOOST_OS_* definitions. 2. Mutual exclusion of the base/real definitions with the addition of *_EMULATED definitions when multiple defs detected. For example for GCC we would have BOOST_COMP_GCC_EMULATED indicated the version of the GCC being emulated. 3. No mutual exclusion of base definitions but with the addition of a "flag" definition when multiple defs are detected. For example with GCC it would have the usual BOOST_COMP_GCC but also have a "#define BOOST_COMP_GCC_IS_EMULATED". 4. Do nothing and live with multiple definitions and the current discrepancy in behavior for BOOST_OS definitions. -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

3 2

[TypeTraits] propose new callable-type call traits
by Hui Li 13 Jan '14

13 Jan '14

I've implemented a few traits classes (code attached below) that, for a given callable-type T, and a set of Args..., detects whether the function call T::operator()(Args...) would be (1) valid, (2) ambiguous, or (3) none is viable. where T is allowed to have arbitrary overloaded operator()'s. This could be useful for programmers who want to (1) make the function call only when it's valid, (2) generate customized error/warning messages when it's ambiguous, or handle/redirect it without getting an ambiguous compiler error, and (3) redirect non-viable calls to some default behavior, which can be different than how it's handled when the call is ambiguous. If people are interested, I suppose this could be a useful addition to TypeTraits. I would appreciate any feedback! For clarity, the implementation and demonstration attached below is written in c++11. It can be easily ported to c++98/03 compilers by using TypeTratis to replace the std type traits, BOOST_TYPEOF_KEYWORD to replace decltype, and Boost.Preprocessor to generate code for arbitrary arity. - Hui Li #include <utility> #include <type_traits> template < typename T > struct is_callable; template < typename Signature > struct has_valid_call; template < typename Signature > struct has_ambiguous_call; template < typename Signature > struct has_no_viable_call; template < typename T > struct is_callable { struct yes {}; struct no {}; struct ambiguate_seed { void operator()(); }; template < typename U, bool=std::is_class::value > struct ambiguate : U, ambiguate_seed {}; template < typename U > struct ambiguate<U,false> : ambiguate_seed {}; template < typename U, typename = decltype(&U::operator()) > static constexpr no test(int); template < typename > static constexpr yes test(...); static bool constexpr value = std::is_same<decltype(test< ambiguate<T> >(0)),yes>::value ; typedef std::integral_constant<bool,value> type; }; template < typename T, typename... Args > struct has_valid_call< T(Args...) > { struct yes {}; struct no {}; template < typename U, bool = is_callable::value > struct impl { template < typename V, typename = typename std::result_of<V(Args...)>::type > struct test_result { using type = yes; }; template < typename V > static constexpr typename test_result<V>::type test(int); template < typename > static constexpr no test(...); static constexpr bool value = std::is_same<decltype(test(0)),yes>::value; using type = std::integral_constant<bool, value>; }; template < typename U > struct impl<U,false> : std::false_type {}; static constexpr bool value = impl<T>::value; using type = std::integral_constant<bool, value>; }; template < typename T, typename... Args > struct has_ambiguous_call< T(Args...) > { struct ambiguate_seed { void operator()(...); }; template < class U, bool = is_callable::value > struct ambiguate : U, ambiguate_seed { using ambiguate_seed::operator(); using U::operator(); }; template < class U > struct ambiguate<U,false> : ambiguate_seed {}; static constexpr bool value = not has_valid_call< ambiguate<T>(Args...) >::value; using type = std::integral_constant<bool, value>; }; template < typename T, typename... Args > struct has_no_viable_call< T(Args...) > : std::integral_constant<bool, not (has_valid_call<T(Args...)>::value or has_ambiguous_call<T(Args...)>::value)> {}; #include <string> #include <vector> struct test { void operator()(int); void operator()(double); void operator()(int,double); template < typename T > typename std::enable_if< not std::is_integral<T>::value >::type operator()(const T&, int=0){} template < typename T > typename std::enable_if< std::is_integral<T>::value >::type operator()(const std::vector<T>&, T*){} template < typename T > int operator()(const std::string&, int){} }; int main(int argc, const char * argv[]) { static_assert( is_callable<test>::value , ""); static_assert( not is_callable<int>::value , ""); static_assert( has_valid_call<test(char const*,long)>::value , ""); static_assert( has_valid_call<test(std::string&,long)>::value , ""); static_assert( has_valid_call<test(std::vector<int>, int*)>::value , ""); static_assert( has_no_viable_call<test(std::vector<double>, double*)>::value , ""); static_assert( has_valid_call<test(int)>::value , ""); static_assert( has_valid_call<test(int,double)>::value , ""); static_assert( not has_valid_call<test(int,double,int)>::value , ""); static_assert( not has_ambiguous_call<test(double)>::value , ""); static_assert( has_ambiguous_call<test(unsigned)>::value , ""); static_assert( not has_no_viable_call<test(unsigned)>::value , ""); static_assert( not has_no_viable_call<test(int)>::value , ""); static_assert( has_no_viable_call<test(void)>::value , ""); return 0; }

5 16

[Macro]Test Case grouping using Traits
by Hemanth Choudary M V (RBEI/ETA1) 13 Jan '14

13 Jan '14

Hello, I have observed that in native unit test framework(c++), there is an option to group test cases using attributes which are reflected as traits in the Test Explorer window in MS VS2012. Following is a an example of the same: BEGIN_TEST_METHOD_ATTRIBUTE(TestMethod3) TEST_OWNER(L"SuperMan") TEST_PRIORITY(2) TEST_METHOD_ATTRIBUTE(L"Category",L"Slow") END_TEST_METHOD_ATTRIBUTE() TEST_METHOD(TestMethod3) { Assert::AreEqual(2,6); } How can this be achieved via Boost Unit Test Library? Are there macros to achieve the same? Mit freundlichen Grüßen / Best Regards, Hemanth Choudary MV RBEI/ETA1

2 1

[Test] Problems with debug::break_memory_alloc
by Fredrik Orderud 13 Jan '14

13 Jan '14

I have a problem with the memory-leak detection logic in boost.test. What happens when unit_test::framework::init starts up on Windows is that memory-leak detection is first explicitly activated. Secondly, debug::break_memory_alloc is called with a value (default is 1). Activation of leak detection is great, but to always override the allocation number to break on is not necessary a good idea if the user has already set a value from a debugger. In my case I am investigating a leak from a static member allocated prior to main and/or boost.test being invoked. In that case, I need to break the program early to be able to set the allocation number to break on. This works well by itself, but it's _very_ confusing when boost.test afterwards replaces my allocation number with a default value. Could it be possible to modify boost.test, so that it only modifies the allocation number to break on if the user has explicitly requested to break on a given allocation? Thanks in advance, Fredrik Orderud

2 4

[test] broken (fails to compile) with boost.timer since 1.48
by Jamie Allsop 13 Jan '14

13 Jan '14

Boost.Test fails to compile since 1.48 when Boost.Timer is included. I find that often I want to use timers when testing. I reported this back in 2012 along with a comprehensive patch that fixes the issue. On the eve of 1.55 I see the patch has still not been applied, despite an original agreement to do so. Unfortunately I don't have commit privileges so I am unable to do this myself. The original discussion from here: http://lists.boost.org/Archives/boost/2012/09/196811.php went as follows: > On 25/09/12 18:14, Gennadiy Rozental wrote: >> Jamie Allsop<ja11sop<at> yahoo.co.uk> writes: >> >>> >>> These are patches we've been using for some time locally, the recent >>> discussions highlighted the importance of pushing patches like these to >>> a wider audience. >>> >>> In summary the key changes are: >>> >>> * https://svn.boost.org/trac/boost/ticket/7410 >>> * https://svn.boost.org/trac/boost/ticket/7397 >> >> These are fine. I'll try to check it in on a weekend > > Excellent thanks! Yet https://svn.boost.org/trac/boost/ticket/7397 was never applied. With changes to Boost.Test since then it is likely that the patch needs modified to be applied but that should not be too hard. Apart from that I'd like to see the suite of 4 patches applied as a whole. So far only https://svn.boost.org/trac/boost/ticket/7410 has been applied but the patches address severe use-case short-comings in Boost.Test that make it viable for broader testing use. I've summaried them below. * https://svn.boost.org/trac/boost/ticket/7397 * https://svn.boost.org/trac/boost/ticket/7410 (applied) * https://svn.boost.org/trac/boost/ticket/7417 (small) * https://svn.boost.org/trac/boost/ticket/7419 (small) Original discussion that didn't really get very far was in these threads: * http://lists.boost.org/Archives/boost/2012/09/196811.php * http://lists.boost.org/Archives/boost/2012/09/196828.php For those who are interested I've pasted my original motivations from the year old thread below as a reminder. Basically the patches allow Boost.Test to: * compile with Boost.Timer (so not broken) * output test progress on the fly in a format other tools could parse * allows Boost.Test to be used for live test diagnostics in running systems in a 'test' mode Jamie * https://svn.boost.org/trac/boost/ticket/7410 (applied) * all test cases/suites have file and line information captured so that external tools can use the Boost.Log output to create links into the source tree, answering questions like, "What is this test case?". It is possible to simply follow the link and see. * https://svn.boost.org/trac/boost/ticket/7417 * update the Boost.Test log output to include summary status information when a test case or suite is completed. This includes the test status, assertions passed and total assertions. This allows live test status to be viewed and nicer tools to be built around this. For example each test can be shown starting, in progress and then complete with the resulting status in detail. I should note that Boost.Test reports currently output this additional test status but this is done only on *completion of all tests* and so *cannot* be used to show live progress. * this additional test status as part of the log can be easily captured using regular expressions if HRF is used and many IDEs will allow colourisation, autolinking and so on using similar approaches. * https://svn.boost.org/trac/boost/ticket/7397 * update Boost.Test to use the new Boost.Timer classes introduced in Boost 1.48. This can be suppressed through the use of a macro should the old timers be preferred. The new Boost.Timer provides much better timing information than the old Boost.Timer library. You should refer to the library itself for an explanation of why the previous timer library was deprecated: http://www.boost.org/doc/libs/1_51_0/libs/timer/doc/index.html * https://svn.boost.org/trac/boost/ticket/7419 Essentially the patch does two things: * It allows boost::unit_test_framework::init() to be called more than once. The result is to reset the test status and master test suite so that new tests can be added and new reports generated through multiple calls. The CLA parsing is also reset. Recent changes to this code may make my call to clear() redundant. I'll let Gennadiy be the judge of that. * This first change then allows the framework setup and teardown to be encapsulated in a helper class (not provided in the patch but one could be). In our systems we use a helper class that exposes a simple API that allows the user to implement a method where test units can be added directly to the master test suite - see the ticket for an example. As I said the patch focuses solely on enabling the possibility of writing such a class, not the class itself. * It provides scoped Boost.Test arguments for the commandline when BOOST_TEST_USE_QUALIFIED_COMMANDLINE_ARGUMENTS is defined. All command line arguments are then called --boost.test.<argument> for example --boost.test.log_level instead of --log_level. This of course means that all Boost.Test related arguments will not clash with any program arguments. On its own this is a generally useful feature as it allows custom main() functions to pass arguments down to other components during simple unit testing.

2 1

Boost unit test with BOOST_NO_EXCEPTIONS
by driscoll 13 Jan '14

13 Jan '14

I work on a team that uses compiles with exception support disabled. (That... is not my decision, and no value judgments on that, please. :-)) I'd kind of like to use the unit test library. However, at a surface level it has lots of uses of raw try/catch/throw instead of BOOST_TRY/BOOST_CATCH/BOOST_THROW. At a deeper level, I suspect what's doing is throwing an exception on an EXPECT or ASSERT failure -- and thus that disabling exceptions will basically mean that a test failure will cause an immediate abort in the program. (I guess I can hack around that in an ugly but somewhat-reasonable way.) How hopeless is using the library with BOOST_NO_EXCEPTIONS? Evan

3 2

(no subject)
by Gly Marvellou 13 Jan '14

13 Jan '14

Hi, I'm a CS major and new to this list. I want to contribute to Boost C++ libraries under GSOC 14. Can someone guide me through? Gly

1 0

Data-Structures, Ideas. GSoC 2014
by Ankit Vadehra 12 Jan '14

12 Jan '14

Hi, I'm Ankit Vadehra, and i was contacting to ask whether Boost is considering participation in GSoC 2014, and if it is, then are there some new ideas of some priority Data Structures Classes that are to be introduced in Boost ?? For Example, previously have worked on Trie Data Structure as well as Boom Filters and so on, but none of these advanced data-structures were merged in the main library, anyways.. Anyways, are there any new ideas?? GSoC, ain't that far away now, and Idea Page is till not up.. ?? Is someone working on it, by any chance ? Thanks.! -- Ankit.Vadehra "The Code Is free, But its Priceless" "Exactly, which way is Forward ?"

1 0

[trac] where is david_abrahams?
by Eric Niebler 11 Jan '14

11 Jan '14

Dave is still listed as the primary maintainer of several libraries, but Trac won't let me assign a new bug to him. "david_abrahams" isn't one of the choices in the Owner drop down. Where'd he go? -- Eric Niebler Boost.org http://www.boost.org

2 2

[multi_index][ann] Boost.MultiIndex 1.56 preview: major update with new hashed index implementation
by Joaquín Mª López Muñoz 11 Jan '14

11 Jan '14

Hi, Those interested can already download the preview of Boost.MultiIndex as it'll be shipped in Boost 1.56: https://github.com/boostorg/multi_index/archive/master.zip Full release notes can be read at https://rawgithub.com/boostorg/multi_index/master/doc/release_notes.html#bo… The most important change is a complete reimplementation of the internals of hashed indices, so that erasure of elements is constant-time regardless of the level of occupancy of the internal bucket array (previously, performance degraded as the bucket was being depleted.) A full description of the new data structure as compared with other popular implementations of unordered associative containers is given at: http://bannalia.blogspot.com/2013/10/implementation-of-c-unordered.html http://bannalia.blogspot.com/2013/10/implementation-of-c-unordered_25.html Along with some performance results: http://bannalia.blogspot.com/2013/11/measuring-insertion-times-for-c.html http://bannalia.blogspot.com/2013/11/measuring-insertion-times-for-c_16.html http://bannalia.blogspot.com/2013/11/measuring-erasure-times-for-c-unordere… http://bannalia.blogspot.com/2013/11/measuring-lookup-times-for-c-unordered… The new data structure has been thoroughly tested but some pre-shipping feedback is always welcome, so if you test this please report back. Thank you, Joaquín M López Muñoz Telefónica Digital ________________________________ Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra política de envío y recepción de correo electrónico en el enlace situado más abajo. This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at: http://www.tid.es/ES/PAGINAS/disclaimer.aspx

3 5

Re: [boost] Call for Review: Boost.Test documentation rewrite
by Brian Wood 10 Jan '14

10 Jan '14

Gennadiy Rozental: > I am all for working with Richard on new docs. I am just not sure this > particular version worth time people will need to spent to get used to it. > What Boost.Test really need is to document new release. And this is what we > should be targeting. New features and new docs look and feel will make it > all worth while. I'm not using this library, but I agree with Gennadiy. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

Fumbling with modular Boost and GIT
by Paul A. Bristow 10 Jan '14

10 Jan '14

I have recently been fumbling with Modular Boost to do some routine maintenance and update of documentation on Boost.Math, with generally most unhappy results. Although this is partly from my general modest familiarity with GIT, I feel that the documentation of the process of doing things is woefully thin. There are far too many vital details assumed or unsaid. I'm posting this in the hope that someone will produce a fully documented and illustrated blow-by-blow (preferably using Tortoise GIT and including its displays) description of how to work cooperatively on the develop branch, and a specific library development sub-branch. This should cover (at least) getting changes to headers in /boost and /libs made by others, making a change to a header file, making a change to tests, testing it using an IDE, and making a change to an example (containing some embedded Quickbook) in and IDE and running it, and to changing Quickbook files in the /library/doc folder, and finally pushing. And now, for a change, I'm off for a little quiet alligator wrestling ;-) Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 2

Re: [boost] [Removing support for old compilers]
by Michael H. Cox 09 Jan '14

09 Jan '14

1 0

Proposed -> Boost.Application : Article -> How to Extend Application Modes
by Renato Forti 09 Jan '14

09 Jan '14

Hi Richard, Thanks for your reviews. Based on them, You be interested in help me improve the library? You seem to have great knowledge on the side windows and your help would be great! What are the best practices to follow? In your opinion how do you think the API should be encapsulated? Thanks a lot

1 0

[Program Options] fix for #6797 breaks compilation
by Jürgen Hunold 09 Jan '14

09 Jan '14

Hi Volodya, the fix for #6797 in 4ae33ce15e5b6345e6eefa19466fdf7cd28a7bbd breaks compilation if Boost.ProgramOptions on msvc-11.0 and -12.0. See full error log with msvc-11.0 attached. It seems that the export macros changes the template evaluation somehow, so msvc now needs "decrement" and "advance" member. The short error is: E:\dev\devel\boost\boost/iterator/iterator_facade.hpp(402) : error C2039: 'decrement' : is not a member of 'boost::program_options::detail::common_config_file_iterator' E:\dev\devel\boost\boost/iterator/iterator_facade.hpp(420) : error C2039: 'advance' : is not a member of 'boost::program_options::detail::common_config_file_iterator' I'm not sure how to implement at least empty stubs or if this can be otherwise worked around. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

4 3

Once accepted, when does a library undergo further review?
by legalize+jeeves＠mail.xmission.com 08 Jan '14

08 Jan '14

[Please do not mail me a copy of your followup] Boost has a good peer review process for accepting a new library. However, once a library has been accepted, it doesn't seem to go through any more peer review. Is the maintainer just trusted to embrace the spirit of Boost's peer review acceptance process for all further changes to a library? -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

8 11

Proposed -> Boost.Application : Article -> How to Extend Application Modes
by Renato Forti 08 Jan '14

08 Jan '14

Hi All, I want to share one simple article about proposed Boost.Application! In the current version of Boost.Application, its officially supports 2 types of application: --------------------------------------------------- * Common Application [This kind of application is a usual Interactive Terminal application] * Server Application [This kind of application generates a Service (Windows), or a background process/Daemon (Unix)] In this article I try to show how user can extend the Boost.Application to support new application mode/type: --------------------------------------------------- * A Simple 'Apache Content Generator Module' http://www.codeproject.com/Articles/695937/Creating-a-New-Application-Mode Others Boost.Application Resources: --------------------------------------------------- [code] https://github.com/retf/Boost.Application [docs] http://www.dokfile.com/appbeta4/docs/libs/application/doc/html/index.html Please, let me know what you think about Boost.Application! -- Renato

2 1

[git] Some headers are executable
by Andrey Semashev 08 Jan '14

08 Jan '14

Hi, I've just checked out git and ran b2 headers and noticed that some headers have executable attribute. For example: $ find boost -executable -type f boost/pointee.hpp boost/assign.hpp boost/graph/vf2_sub_graph_iso.hpp boost/indirect_reference.hpp boost/parameter.hpp boost/detail/indirect_traits.hpp boost/detail/is_xxx.hpp boost/range.hpp This was not the case with svn. Is this the result of the transition? Can this be fixed?

2 4

[github] default PR destination
by Tim Blechmann 08 Jan '14

08 Jan '14

hi all, any opinion to change the default branch from "master" to "develop"? with the boost branching model all contributions via github's pull requests apparently have to go to "develop" rather than going directly into "master", so this should be the default destination for pull requests. github allows to set the default branch [1] ... not sure if this has any other side effects, but i'd vote for changing the default to "develop". thoughts? tim [1] https://help.github.com/articles/setting-the-default-branch

10 14

[ANN] Registration for C++Now 2014 is Open
by Boris Kolpackov 07 Jan '14

07 Jan '14

Hi, Registration is now open for the eighth annual C++Now conference (formerly BoostCon) which will be held in Aspen, Colorado, USA, May 12th to 17th, 2014. C++Now is a general C++ conference for C++ experts and enthusiasts. It is not specific to any library/framework or compiler vendor and has three tracks with presentations ranging from hands-on, practical tutorials to advanced C++ design and development techniques. In particular, one of the tracks is dedicated exclusively to tutorials. Last year the conference sold out pretty quickly and we expect it to happen again this year. As a result, we encourage anyone interested in attending to register early. Additionally, early bird hotel reservations end January 10th. For more information on registering, visit: http://cppnow.org/2014/01/2014-registration-is-open/ For early bird hotel reservations, visit: http://cppnow.org/location/lodging/ For general information about the conference, visit: http://cppnow.org/about/ Boris

1 0

[git] An ignore file for the top-level repository?
by Daryle Walker 07 Jan '14

07 Jan '14

I cloned a copy of the git version of the top-level Boost repository, which recursively added the individual libraries. The directions added two commands to run boot-strapping and build scripts. I had to set up an ".gitignore" file so the GUI GitHub app won't complain about those synthesized files. Shouldn't there already be an ignore file there that does this? (You only list the top-level files & directories; nested files automatically get ignored too.) I couldn't sync (i.e. upload) the ignore-file since I don't have write access for the top-level repository. So I'll get a conflict once someone does add an ignore file for everyone? Daryle W.

4 3

[build] Broken in develop?
by Andrey Semashev 07 Jan '14

07 Jan '14

Hi, I tried to update and recreate links to headers today and stumbled into this: $ b2 headers Unable to load Boost.Build: could not find build system. --------------------------------------------------------- /home/lastique/src/boost/boost-build.jam attempted to load the build system by invoking 'boost-build tools/build/src ;' but we were unable to find "bootstrap.jam" in the specified directory or in BOOST_BUILD_PATH (searching /home/lastique/src/boost/tools/build/src, /usr/share/boost-build). Please consult the documentation at 'http://www.boost.org'. Also, bootstrap.sh also seems to be not working: $ ./bootstrap.sh ./bootstrap.sh: 1: ./bootstrap.sh: ./tools/build/src/engine/build.sh: not found Building Boost.Build engine with toolset ... Failed to build Boost.Build build engine Consult 'bootstrap.log' for more details bootstrap.log contains: ./bootstrap.sh: 218: cd: can't cd to ./tools/build/src/engine I remember there were discussions about moving Boost.Build somewhere, and it appears that some scripts were updated for that but the actual Boost.Build code is still in tools/build/v2. I did 'git pull' in the Boost root, it's up to date.

3 3

[git] Did the user assignments carry over?
by Daryle Walker 07 Jan '14

07 Jan '14

What I mean is if the Subversion-to-Git transfer also mapped user accounts. Did any change in the Subversion repository that is blamed on me (on my Subversion/Trac account) get mapped to a change in the Git version that still blames me (on my GitHub account)? Or did all that blame information get purged? (Of course, assuming that it's possible, how would the converters know the mapping? And what happens when a Subversion user has dropped out or otherwise hasn't gotten a GitHub account (yet)?) Daryle W.

2 1

Proposed patch for Ticket #8250
by Borja Miñano 07 Jan '14

07 Jan '14

Good afternoon, I have proposed a patch for Ticket #8250 that is attached in the trac system. As I am new, I post to inform to take it into account for following versions. Hope this could help. -- Un saludo, Borja Miñano IAC3 - Universitat de les Illes Balears Mateu Orfila Building. Office F-213. Cra. Valldemossa km. 7,5 E-07122 Palma de Mallorca. Balears. Spain. Phone: +34 971 173 000 ext. 1318

4 3

[timer] conflict between tools/inspect and libs/timer
by Peter A. Bigot 06 Jan '14

06 Jan '14

A recent merge to master libs/timer includes support for inspect in the test suite, but the invocation requires support for a search-root argument in inspect. That support is not present in tools/inspect's master branch, causing the libs/timer tests to fail. The following process could help detect inter-module dependencies like this: * Initiate your workspace with the superproject checked out on branch master and all modules on the resulting commit (ignore branches). * Checkout the develop branch only for the module(s) you're working on. * Use "git submodule summary" at the superproject level to determine how your workspace differs from what would be expected in the master branch. If multiple modules show changes, there's a risk of coupling, and it might not be appropriate to push any of them to their master branch. * Use "git submodule update" to reset things when switching development between modules. Peter

6 16

graph_theory_review.html patch
by Mads Jensen 05 Jan '14

05 Jan '14

Hi, The link for the TOC of Introduction to Algorithms is broken. I've attached a patch to fix this; it now points to the page for the 3rd edition where the TOC and a sample chapter about multi-threaded algorithms can also be found. Also, the fourth author (Stein) is added. What are the rules for submission and inclusion of patches? I consider this quite trivial, but I have in mind to implement a couple of graph algorithms in order to learn the library, and get more acquainted with C++. Please CC when responding; I'm not yet a member of this mailing list. Thank you. -- Med Venlig Hilsen / Kind Regards, Mads Jensen Never laugh at live dragons. -- Bilbo Baggins [J.R.R. Tolkien, "The Hobbit"]

2 1

[develop] quickbook compile failure
by Tim Blechmann 05 Jan '14

05 Jan '14

hi all, trying to compile quickbook with apple's clang gives me the following error: > tim@moka-mac:~/dev/boost/tools/quickbook$ ../../b2 > Performing configuration checks > > - symlinks supported : yes > - hardlinks supported : yes > ...patience... > ...patience... > ...found 3129 targets... > ...updating 6 targets... > common.mkdir ../../dist > common.mkdir ../../dist/bin > darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/files.o > src/files.cpp:129:47: error: implicit instantiation of undefined template 'std::pair<boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::__1::pair<const boost::filesystem::path, boost::intrusive_ptr<quickbook::file> > > >, bool>' > boost::tie(pos, inserted) = files.emplace( > ^ > ../../boost/detail/container_fwd.hpp:145:42: note: template is declared here > template <class T1, class T2> struct pair; > ^ > src/files.cpp:257:14: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section> mapped_sections; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:287:18: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator section, > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:348:14: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator find_section( > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:269:39: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > original_pos, source().size(), > ^~~~~~ > src/files.cpp:276:51: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > pos - original->source().begin(), source().size())); > ^~~~~~ > src/files.cpp:282:51: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > pos - original->source().begin(), source().size(), > ^~~~~~ > src/files.cpp:351:18: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator section = > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:375:14: error: too few template arguments for class template 'list' > std::list<mapped_file> mapped_files; > ^ > ../../boost/detail/container_fwd.hpp:134:47: note: template is declared here > template <class T, class Allocator> class list; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:401:18: error: no viable conversion from 'intrusive_ptr<struct quickbook::mapped_file>' to 'intrusive_ptr<struct quickbook::file>' > file_ptr r = data->new_file; > ^ ~~~~~~~~~~~~~~ > ../../boost/smart_ptr/intrusive_ptr.hpp:66:5: note: candidate constructor not viable: no known conversion from 'boost::intrusive_ptr<mapped_file>' to 'quickbook::file *' for 1st argument > intrusive_ptr( T * p, bool add_ref = true ): px( p ) > ^ > ../../boost/smart_ptr/intrusive_ptr.hpp:90:5: note: candidate constructor not viable: no known conversion from 'boost::intrusive_ptr<mapped_file>' to 'const boost::intrusive_ptr<quickbook::file> &' for 1st argument > intrusive_ptr(intrusive_ptr const & rhs): px( rhs.px ) > ^ > ../../boost/smart_ptr/intrusive_ptr.hpp:76:5: note: candidate template ignored: substitution failure [with U = quickbook::mapped_file]: no type named 'type' in 'boost::detail::sp_enable_if_convertible<quickbook::mapped_file, quickbook::file>' > intrusive_ptr( intrusive_ptr const & rhs, typename boost::detail::sp_enable_if_convertible<U,T>::type = boost::detail::sp_empty() ) > ^ ~~~~ > ../../boost/smart_ptr/detail/operator_bool.hpp:52:5: note: candidate function > operator unspecified_bool_type() const BOOST_NOEXCEPT > ^ > src/files.cpp:413:16: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > return data->new_file->source().empty(); > ^~~~~~~~~~~~~~ > src/files.cpp:418:16: error: cannot initialize object parameter of type 'const quickbook::file' with an expression of type 'quickbook::mapped_file' > return data->new_file->source().size(); > ^~~~~~~~~~~~~~ > src/files.cpp:447:18: error: too few template arguments for class template 'vector' > std::vector<mapped_file_section>::const_iterator start = > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/files.cpp:457:20: error: reference to non-static member function must be called > for (++start; start != x.data->new_file->mapped_sections.end() && > ^~~~~ > src/files.cpp:458:21: error: reference to non-static member function must be called > start->our_pos < end; ++start) > ^~~~~ > src/files.cpp:458:45: error: reference to non-static member function must be called > start->our_pos < end; ++start) > ^~~~~ > src/files.cpp:461:21: error: reference to non-static member function must be called > start->original_pos, start->our_pos - begin + size, > ^~~~~ > In file included from src/files.cpp:12: > In file included from ../../boost/unordered_map.hpp:17: > ../../boost/unordered/unordered_map.hpp:295:35: error: implicit instantiation of undefined template 'std::pair<boost::unordered::iterator_detail::iterator<boost::unordered::detail::ptr_node<std::__1::pair<const boost::filesystem::path, boost::intrusive_ptr<quickbook::file> > > >, bool>' > std::pair<iterator, bool> emplace( > ^ > src/files.cpp:129:47: note: in instantiation of function template specialization 'boost::unordered::unordered_map<boost::filesystem::path, boost::intrusive_ptr<quickbook::file>, boost::hash<boost::filesystem::path>, std::__1::equal_to<boost::filesystem::path>, std::__1::allocator<std::__1::pair<const boost::filesystem::path, boost::intrusive_ptr<quickbook::file> > > >::emplace<boost::filesystem::path, quickbook::file *>' requested here > boost::tie(pos, inserted) = files.emplace( > ^ > ../../boost/detail/container_fwd.hpp:145:42: note: template is declared here > template <class T1, class T2> struct pair; > ^ > In file included from src/files.cpp:12: > In file included from ../../boost/unordered_map.hpp:17: > ../../boost/unordered/unordered_map.hpp:299:20: error: no viable conversion from 'emplace_return' (aka 'pair<iterator, bool>') to 'std::pair<iterator, bool>' > return table_.emplace( > ^~~~~~~~~~~~~~~ > fatal error: too many errors emitted, stopping now [-ferror-limit=] > 20 errors generated. > > "g++" -ftemplate-depth-300 -O3 -finline-functions -Wno-inline -Wall -gdwarf-2 -fexceptions -g0 -DBOOST_ALL_NO_LIB=1 -DBOOST_DETAIL_CONTAINER_FWD -DBOOST_FILESYSTEM_NO_DEPRECATED -DBOOST_FILESYSTEM_STATIC_LINK=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DNDEBUG -I"../.." -c -o "../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/files.o" "src/files.cpp" > > ...failed darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/files.o... > darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/id_generation.o > src/id_generation.cpp:29:18: error: too few template arguments for class template 'vector' > typedef std::vector<id_placeholder const*> placeholder_index; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:33:13: error: expected a class or namespace > placeholder_index::iterator, placeholder_index::iterator, > ^ > src/id_generation.cpp:33:42: error: expected a class or namespace > placeholder_index::iterator, placeholder_index::iterator, > ^ > src/id_generation.cpp:34:18: error: too few template arguments for class template 'vector' > std::vector<std::string>& generated_ids); > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:36:10: error: too few template arguments for class template 'vector' > std::vector<std::string> generate_ids(document_state_impl const& state, boost::string_ref xml) > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:38:14: error: too few template arguments for class template 'vector' > std::vector<std::string> generated_ids(state.placeholders.size()); > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:44:22: error: too few template arguments for class template 'vector' > typedef std::vector<id_placeholder const*>::iterator iterator; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:45:35: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > iterator it = placeholders.begin(), end = placeholders.end(); > ~~~~~~~~~~~~^~~~~~ > src/id_generation.cpp:45:63: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > iterator it = placeholders.begin(), end = placeholders.end(); > ~~~~~~~~~~~~^~~~ > src/id_generation.cpp:55:41: error: indirection requires pointer operand ('iterator' (aka 'int') invalid) > while (group_end != end && (*group_end)->num_dots == (*it)->num_dots) > ^~~~~~~~~~ > src/id_generation.cpp:55:67: error: indirection requires pointer operand ('iterator' (aka 'int') invalid) > while (group_end != end && (*group_end)->num_dots == (*it)->num_dots) > ^~~ > src/id_generation.cpp:74:14: error: too few template arguments for class template 'vector' > std::vector<unsigned>& order; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:76:34: error: too few template arguments for class template 'vector' > placeholder_compare(std::vector<unsigned>& order) : order(order) {} > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:95:14: error: too few template arguments for class template 'vector' > std::vector<unsigned>& order; > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:99:22: error: too few template arguments for class template 'vector' > std::vector<unsigned>& order) > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:124:14: error: too few template arguments for class template 'vector' > std::vector<unsigned> order(state.placeholders.size()); > ^ > ../../boost/detail/container_fwd.hpp:135:47: note: template is declared here > template <class T, class Allocator> class vector; > ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ^ > src/id_generation.cpp:128:30: error: non-const lvalue reference to type 'quickbook::xml_processor::callback' cannot bind to a value of unrelated type 'quickbook::get_placeholder_order_callback' > processor.parse(xml, callback); > ^~~~~~~~ > src/document_state_impl.hpp:143:48: note: passing argument to parameter here > void parse(boost::string_ref, callback&); > ^ > src/id_generation.cpp:131:28: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > sorted_placeholders.reserve(state.placeholders.size()); > ~~~~~~~~~~~~~~~~~~~^~~~~~~~ > src/id_generation.cpp:133:52: error: member reference base type 'placeholder_index' (aka 'int') is not a structure or union > if (order[p.index]) sorted_placeholders.push_back(&p); > ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ > fatal error: too many errors emitted, stopping now [-ferror-limit=] > 20 errors generated. > > "g++" -ftemplate-depth-300 -O3 -finline-functions -Wno-inline -Wall -gdwarf-2 -fexceptions -g0 -DBOOST_ALL_NO_LIB=1 -DBOOST_DETAIL_CONTAINER_FWD -DBOOST_FILESYSTEM_NO_DEPRECATED -DBOOST_FILESYSTEM_STATIC_LINK=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DNDEBUG -I"../.." -c -o "../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/id_generation.o" "src/id_generation.cpp" > > ...failed darwin.compile.c++ ../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static/id_generation.o... > ...skipped <p../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static>quickbook for lack of <p../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static>files.o... > ...skipped <p../../dist/bin>quickbook for lack of <p../../bin.v2/tools/quickbook/src/darwin-4.2.1/release/link-static>quickbook... > ...failed updating 2 targets... > ...skipped 2 targets... > ...updated 2 targets... compiler: > tim@moka-mac:~/dev/boost/tools/quickbook$ g++ -v > Configured with: --prefix=/Applications/Xcode.app/Contents/Developer/usr --with-gxx-include-dir=/usr/include/c++/4.2.1 > Apple LLVM version 5.0 (clang-500.2.79) (based on LLVM 3.3svn) > Target: x86_64-apple-darwin13.0.0 > Thread model: posix is this a known issue? thanks, tim

4 5

[regex] diagnosis and fix for #9544
by Peter A. Bigot 05 Jan '14

05 Jan '14

Trac rejected my comment because it has links in it, so here's the relevant information. This issue arose as of [http://gcc.gnu.org/viewcvs/gcc?view=revision&revision=197248 GCC SVN commit 197248] which implements [http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3582.html N3582]. It occurs because the [http://gcc.gnu.org/viewcvs/gcc/trunk/gcc/cp/parser.c?r1=197248&r2=197247&pa… change on line 4109] preserves parentheses at the front end (with that change reverted, gcc works correctly). This is now [http://gcc.gnu.org/bugzilla/show_bug.cgi?id=59681 PR C++/59681]. The fix in GCC is not trivial, so I've just made [https://github.com/boostorg/regex/pull/1 pull #1] so the trivial fix for boost (remove the parens) can be applied.

1 0

Request for comments on super-project workflow doc
by Beman Dawes 04 Jan '14

04 Jan '14

The release managers with help from Peter Dimov have been developing super-project workflow documentation. See https://svn.boost.org/trac/boost/wiki/SuperProjectWorkflow Comments welcome! Thanks, --Beman

6 11

Removing _1 from the global namespace (again)
by Peter Dimov 04 Jan '14

04 Jan '14

If we're going to call the next release 2.0, we'll be allowed some latitude with respect to breaking changes, so maybe this is the right time to finally remove the Bind placeholders from the global namespace. This will, however, break many things all around Boost (to say nothing about the outside world), as a quick grep can readily reveal. And, consequently, it will generate a certain amount of work for the maintainers of the affected libraries that, from their point of view, can appear unnecessary. So I'll need a certain amount of community consensus before going ahead and breaking everyone's code. :-)

14 15

[git] How to create a new submodule from existing submodule components?
by Beman Dawes 04 Jan '14

04 Jan '14

The release managers with help from Peter Dimov have been developing super-project workflow documentation. See https://svn.boost.org/trac/boost/wiki/SuperProjectWorkflow In that discussion, Peter wrote: >Hi everyone, > >As a first step of moving Boost.Assert out of Utility and into its own submodule, >I've extracted its files (along with the history) into a test repository of mine: > > https://github.com/pdimov/assert > >If you consider its contents acceptable, please let me know what should the procedure >be for moving this repository into boostorg and making it a proper submodule. I've take the liberty of moving this discussion to the main list for wider input on three questions. Please respond on this thread to the question asked in the subject line, and comment on the Proposed assert submodule and Super-project workflow on their threads. Thanks, --Beman

3 5

[git-help] Doc. Suggestion: How to setup a custom boost "distribution"
by Klaim - Joël Lamotte 04 Jan '14

04 Jan '14

This is a suggestion for documentation, that "could" not be a good idea, I'm not totally sure. The goal would be to provide a simple recipe to setup a boost super-repo fork that would contain only a specific set of libraries, chosen by the user. I believe it would be of interest to a lot of companies that consider using boost but don't want to have to use the whole package. As Ryppl isn't ready yet, I was thinking that just providing a way to do it using the fork would already be helpful. It would also allow some people to provide a well tested custom distribution that would be easy to keep up to date. I expect people to experiment such things (I think I will at some point). The goal is NOT to resolve dependencies, or detect dependencies issues. It would be only to show that you can strip down the count of libraries if you wish in your own fork. The user will have to deal with dependency issues on his own, which is ok in a lot of cases, I assume. However, I'm not a specialist and I will not have time to try my idea immediately so I would like to ask if the following process is enough to do achieve the goal: 1. fork boost super-repo (clone locally, clone on your own server, or use the github fork button); 1.1. optionally, switch to a company or project-specific branch name; 2. in the fork, to remove libraries you don't want: 2.1. go in the root directory and edit the '.gitmodules' file 2.2. in this file, you will see each library module defined as follow: [submodule "any-library"] path = libs/any-library url = ../any-library.git fetchRecurseSubmodules = on-demand 2.3. locate and remove these declarations of each library you want to remove from the fork. 2.4. save the file. 3. commit the change 4. [git pull ?] 5. compile boost as usual. I'm not sure about the 4th point, but I think an operation is necessary so that git removes the library directories in the local clone. If these instructions are correct (once 4 is confirmed) and complete and are considered useful, maybe putting them somewhere in the doc would be worthwhile. Thoughts?

3 3

[git] mode and whitespace changes remaining between develop and master
by Nathan Ridge 04 Jan '14

04 Jan '14

Hello, I am trying to follow the instructions for "Establishing a merge point after SVN Conversion" [1] for the Boost.Range library. After cherry-picking all the commits to develop that have not been merged to master, onto master (all locally, I have not pushed anything yet), I am finding that there are still some mode and whitespace differences between master and develop (see the diff at the bottom of the message). I cannot find the commits that are responsible for these changes - is it safe to just ignore them? Thanks, Nate [1] https://svn.boost.org/trac/boost/wiki/PostCvtMergePoint diff --git a/include/boost/range.hpp b/include/boost/range.hpp old mode 100755 new mode 100644 diff --git a/include/boost/range/adaptor/strided.hpp b/include/boost/range/adaptor/strided.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/adaptor/transformed.hpp b/include/boost/range/adaptor/transformed.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/algorithm_ext/is_sorted.hpp b/include/boost/range/algorithm_ext/is_sorted.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/detail/demote_iterator_traversal_tag.hpp b/include/boost/range/detail/demote_iterator_traversal_tag.hpp old mode 100644 new mode 100755 diff --git a/include/boost/range/detail/implementation_help.hpp b/include/boost/range/detail/implementation_help.hpp old mode 100644 new mode 100755 index 1f7d163..ca12fa4 --- a/include/boost/range/detail/implementation_help.hpp +++ b/include/boost/range/detail/implementation_help.hpp @@ -21,13 +21,13 @@ #include <wchar.h> #endif -namespace boost +namespace boost { namespace range_detail { template <typename T> inline void boost_range_silence_warning( const T& ) { } - + ///////////////////////////////////////////////////////////////////// // end() help ///////////////////////////////////////////////////////////////////// @@ -36,7 +36,7 @@ namespace boost { return s + strlen( s ); } - + #ifndef BOOST_NO_CWCHAR inline const wchar_t* str_end( const wchar_t* s, const wchar_t* ) { @@ -51,7 +51,7 @@ namespace boost ; return s; } -#endif +#endif template< class Char> inline Char* str_end( Char* s ) @@ -64,7 +64,7 @@ namespace boost { return boost_range_array + sz; } - + template< class T, std::size_t sz> inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz] ) { @@ -74,7 +74,7 @@ namespace boost ///////////////////////////////////////////////////////////////////// // size() help ///////////////////////////////////////////////////////////////////// - + template< class Char> inline std::size_t str_size( const Char* const& s ) { @@ -96,7 +96,7 @@ namespace boost } } // namespace 'range_detail' - + } // namespace 'boost' diff --git a/include/boost/range/iterator.hpp b/include/boost/range/iterator.hpp index 4ba9122..2966bdf 100644 --- a/include/boost/range/iterator.hpp +++ b/include/boost/range/iterator.hpp @@ -25,46 +25,46 @@ namespace boost { -#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) - - namespace range_detail_vc7_1 - { - template< typename C, typename Sig = void(C)> - struct range_iterator - { - typedef BOOST_RANGE_DEDUCED_TYPENAME - mpl::eval_if_c< is_const<C>::value, - range_const_iterator< typename remove_const<C>::type>, - range_mutable_iterator<C>>::type type; - }; +#if BOOST_WORKAROUND(BOOST_MSVC, == 1310) - template< typename C, typename T> - struct range_iterator< C, void(T[])> - { - typedef T* type; - }; - } - -#endif + namespace range_detail_vc7_1 + { + template< typename C, typename Sig = void(C)> + struct range_iterator + { + typedef BOOST_RANGE_DEDUCED_TYPENAME + mpl::eval_if_c< is_const<C>::value, + range_const_iterator< typename remove_const<C>::type>, + range_mutable_iterator<C>>::type type; + }; + + template< typename C, typename T> + struct range_iterator< C, void(T[])> + { + typedef T* type; + }; + } + +#endif template< typename C> struct range_iterator { #if BOOST_WORKAROUND(BOOST_MSVC, == 1310) + + typedef BOOST_RANGE_DEDUCED_TYPENAME + range_detail_vc7_1::range_iterator<C>::type type; + +#else - typedef BOOST_RANGE_DEDUCED_TYPENAME - range_detail_vc7_1::range_iterator<C>::type type; - -#else - - typedef BOOST_RANGE_DEDUCED_TYPENAME - mpl::eval_if_c< is_const<C>::value, + typedef BOOST_RANGE_DEDUCED_TYPENAME + mpl::eval_if_c< is_const<C>::value, range_const_iterator< typename remove_const<C>::type>, range_mutable_iterator<C>>::type type; - -#endif + +#endif }; - + } // namespace boost #endif

2 1

[MPL] true_type,false_type versus true_,false_
by Erik Erlandson 04 Jan '14

04 Jan '14

I've been using true_type and false_type in some of my interfaces, for example: https://github.com/erikerlandson/edit_distance/blob/master/include/boost/al… However it seems as though true_ and false_ are more compatible with MPL logic functions. Is there any particular reason to use one over the other? Would it be preferable to use true_ and false_?

2 1

[regression] OK to merge? Should tools/regression be a submodule?
by Beman Dawes 04 Jan '14

04 Jan '14

* The directory tools/regression/src/report was missing from svn branches/release, so it is also missing from modular boost master. Although I haven't checked, that probably means the are other unmerged changes in develop. OK to merge develop to master (after suitable testing?) * Should tools/regression be a submodule? Does anyone remember why it remains a part of the super-project? If we are going to convert tools/regression to a submodule, should we do it now or wait until the dust settles? --Beman

5 11

Re: [boost] [AFIO] Callback API
by Bjorn Reese 03 Jan '14

03 Jan '14

Moving the discussion from boost-users to boost-dev, and thus the full context is quoted. On 12/21/2013 01:53 AM, Niall Douglas wrote: > On 20 Dec 2013 at 19:16, Bjorn Reese wrote: > >>> Can you suggest something? I honestly can't think of anything simpler >>> which also provides strong write ordering guarantees. >> >> I have not given this much thought so consider the following a >> brainstorm. > > We really ought to move this off boost-users ... but we'll see how it > goes. > >> I am thinking about an API that uses handles that looks more like Asio >> sockets. Write ordering can be handled, not by batching operations >> together, but rather calling the next write operation from the callback >> of the previous operation (Asio-style.) This will not always yield good >> performance, but oftentimes that is less relevant. If you need >> performance, then the "advanced" dispatcher API is available. >> >> So there could be a file handle (and directory handle) class for file >> (directory) manipulation calls, which hides all the details of the >> dispatcher etc. >> >> class file_handle >> { >> public: >> void read(buffer, read_callback); >> void write(buffer, write_callback); >> // and so on >> }; >> >> class directory_handle >> { >> public: >> void create(name, create_callback); // uses file(single) or dir(single) >> void remove(name, remove_callback); // uses rmdir(single) >> void watch(name, watch_callback); // directory monitoring >> // and so on >> }; > > I'm struggling to see the merit in such an approach - it would be > incredibly verbose and complex to write even simple solutions, > because i/o on files is not like sockets, *especially* that you > almost never must strongly order i/o across a sequence of multiple > sockets, but that is a very common case with files e.g. during ACID. First, it follows a pattern that is familiar to Asio users. So rather than you being the only one who can write applications on top of Afio, you get a broader community who are already familiar with the callback approach. Second, you can more easily combine it with Asio socket code to create compound services that mixes socket and file access. For instance, a peer-to-peer file distribution mechanism. > AFIO tries to help users to not write callbacks except when > necessary, but if you do want a user defined callback you simply > chain a call() or completion() operation to the item whose completion > you want called back upon. > > The idea is, you see, that you subclass the async_io_dispatcher class > with additional completion handlers, and use those as building blocks > for further subclasses of async_io_dispatcher. That hopefully gets > people to break up their callbacks into reusable completion handlers, > and saves people writing and debugging code. > Before you say "this should be in the documentation", yes it should > and will be after Paul gets his directory monitoring implementation > working. I'm thinking that will form the fourth section in the > beginner's tutorial - how to modularise and make reusable the > normally bespoke glue code which makes up traditional callbacks. It > might actually be worth adding a section 3b which shows how the naïve > approach in 3a is a very stupid idea :) > > As much as this sort of operation dependency graph based design works > well for its niche, I agree there is a swathe of code which ends up > looking like the find in files implementation, and for that hopefully > fibers will make look much more sane. I am not arguing against the current API. Instead, I am arguing for the addition of a more familiar Asio-style callback API. I have no trouble with a fiber-enchanced API (similar to Asio with coroutines.)

3 5

[MSM] Additional template arguments for process_event
by Juan Carlos Franzoy 03 Jan '14

03 Jan '14

The short question is: Would it be possible/convenient that boost::msm::back::state_machine::process_event receive more template parameters? template< class Event, typename... ARGS > process_event( const Event& event, ARGS&&... args ); args been forwarded to transition actions? I've been searching in boost.development mailing list archives and didn't see this question before. The need of additional template parameters is based on the fact that ARGS may not be defined at the moment of the state_machine isntantiation. Note: I would love to notice that I am wrong, and all this is an unnecessary complication, please let me know if that is the case. Thanks for reading. The long story follows: I am trying to use MSM for the first time. I am evaluating the factibility and convenience of a library to try to make easier the construction of protocol stacks over Boost.Asio. Protocol stack layers are often Finite State Machines. The idea is that the user of the library would program reusable 'layers' and use a library facility called LayerLinker to links the layers. For example this is a simplified pseudocode: template< typename STACK, int POSITION > class LayerLinker { typedef ... layer_t; typedef LayerLinker<STACK,POSITION+1> upper_linker_t; typedef LayerLinker<STACK,POSITION-1> lower_linker_t; layer_t layer_; upper_linker_t *up_; lower_linker_t *low_; public: LayerLinker( boost::asio::io_service& ios ) : layer_{ios} {} template<class EVENT> void processUpstreamEvent( const EVENT& ev ) { layer_.processUpstreamEvent( *this /* let the layer know my type */, ev ); } // similar for processDownstreamEvent() // Called by layer_ to send an event to the upper layer template<class EVENT> void sendUpstreamEvent( const EVENT& ev ) { if ( up_ ) { up_->processUpstreamEvent( ev ); } } // similar for sendDownstreamEvent() }; struct MyTopLayer { typedef ... my_fsm_t; my_fsm_t myFsm_; public: template<class LINKER, class EVENT> void processUpstreamEvent( LINKER& linker, const EVENT& ev ) { // in transition actions the FSM can send events to upper layers. myFsm.process_event( ev, linker /* additional parameter here */ ); } // similar to processDownstreamEvent }; // similar for MyMiddleLayer and MyBottomLayer int main() { typedef boost::mpl::vector<MyTopLayer,MyMiddleLayer,MyBottomLayer> stack_t; boost::asio::io_service ios; LayerLinker<stack_t, 0> topLinker{ios}; LayerLinker<stack_t, 1> middleLinker{ios}; LayerLinker<stack_t, 2> bottomLinker{ios}; topLinker.setLowerLinker( middleLinker ); middleLinker.setUpperLinker( topLinker ); middleLinker.setLowerLinker( bottomLinker ); bottomLinker.setUpperLinker( middleLinker ); topLinker.processDownstreamEvent( InitEvent{} ); ios.run(); } // from asio callbacks borromLinker.processUpstreamEvent( ReadEvent{...} ); Although I could make it without extra parameters to process_event, it is basically a workaround. THANKS A LOT for reading 95 lines. Juan Carlos Franzoy

2 1