- Boost - lists.boost.org

[1.60][spirit] Unmerged changes prevent compilation
by Andrey Semashev 10 Nov '15

10 Nov '15

Hi, The latest 1.60 beta RC fails to build Boost.Log because some changes in Boost.Spirit has not been merged to master. At least these patches need to be merged to master: 1. Fix the duplicate definition of strip_single_element_vector specialization: https://github.com/boostorg/spirit/commit/4d8899fdfe26237d6d983a7ac5528d00f… 2. Fix an attempt to construct an instance of none_t: https://github.com/boostorg/spirit/commit/534cf39f15ced047359ee8b6dfe434635… 3. Although it's not strictly a build breaker, this change fixes a bunch of warnings about signed/unsigned mismatch: https://github.com/boostorg/spirit/pull/140 After applying those patches to the RC Boost.Log builds successfully. These commits and the PR has been in develop for quite some time, could someone merge them to master, please?

4 7

[Range] sorted and randomized adaptors
by Mohammed El-Afifi 10 Nov '15

10 Nov '15

Hello everybody, I know this might have been raised a few times before in this mailing list, but I'd like to know if it's possible(or otherwise what would prevent) to have sorted and randomized adaptors so that I may have a sorted and randomized view of a range respectively. Something like vector<int> x; // operations to fill x x | boost::adaptors::sorted; x | boost::adaptors::randomized;// That one might also take an optional random generator as a parameter. I understand that in this case the adaptor isn't entirely lazy as the adapted(x here) must be completely consumed before producing a single element in the resulting range. I want to know however if having such adaptors may contradict any basic principles of the existing adaptors. P.S. Two other threads I found that discussed the same idea(for sorted only): - http://lists.boost.org/Archives/boost/2009/03/149247.php - http://lists.boost.org/Archives/boost/2006/05/105122.php

3 2

Seeking feedback on SegmentedTreeSeq (sequence data structure with efficient random access insert and erase)
by Chris Clearwater 09 Nov '15

09 Nov '15

Greetings, At this time I would like to solicit feedback for my library SegmentedTreeSeq. It is an implementation of a counted B+Tree that allows efficient random access insert and erase. It's an ideal data structure for an application such as a text editor. I am also seeking interested reviewers as I feel it has reached a state that is ready for formal review. Features: - Implements the union of std::vector, std::deque, and std::list interfaces. - Implements the C++11 allocator model. - Implements the full C++14 interfaces including emplacement and move semantics. - O(log n) to obtain an iterator at any position. - O(log n) insert and erase. - Amortized O(log n) iterator movement. - Strong exception guarantee for insert. - Support for incomplete types. - SCARY iterators. - Best in class performance for many operations. - Low memory overhead for data of any type. Links: - Incubator: http://rrsd.com/blincubator.com/bi_library/segmentedtreeseq-2/?gform_post_i… - Repository: https://github.com/det/segmented_tree_seq - Documentation: https://det.github.io/segmented_tree_seq Thanks, Chris

2 2

[1.60.0] Release Notes
by Daniel James 08 Nov '15

08 Nov '15

Hello everyone, If you haven't done so already, please can you add your entries to the release notes. Easiest way to do so is to create a pull request by clicking on the pencil icon at the top right of the source code at: https://github.com/boostorg/website/blob/master/feed/history/boost_1_60_0.q… Or if you prefer you can email me. thanks, Daniel

2 1

[regression] Test results unavailable
by Andrey Semashev 07 Nov '15

07 Nov '15

Hi, Is anyone able to see develop test results? I'm seeing a blank page.

3 4

[build] How do I build for windows phone?
by John Maddock 06 Nov '15

06 Nov '15

Boost.Build evidently has options for building for windows store and windows phone. The store builds work fine for me, but the phone builds fail as there is no compiler on the command line generated: ../../../bjam config_info msvc-14.0 windows-api=phone -d2 ...found 179 targets... ...updating 5 targets... file ..\..\..\bin.v2\libs\config\test\config_info.test\msvc-14.0\debug\link-static\runtime-link-static\windows-api-phone\config_info.obj.rsp "config_info.cpp" -Fo"..\..\..\bin.v2\libs\config\test\config_info.test\msvc-14.0\debug\link-static\runtime-link-static\windows-api-phone\config_info.obj" -TP /Z7 /Od /Ob0 /W3 /GR /Zc:forScope /Zc:wchar_t /MTd /wd4675 /EHs -c -DBOOST_ALL_NO_LIB=1 -DWINAPI_FAMILY=WINAPI_FAMILY_PHONE_APP -D_WIN32_WINNT=0x0602 "-I..\..\.." compile-c-c++ ..\..\..\bin.v2\libs\config\test\config_info.test\msvc-14.0\debug\link-static\runtime-link-static\windows-api-phone\config_info.obj /Zm800 -nologo @"..\..\..\bin.v2\libs\config\test\config_info.test\msvc-14.0\debug\link-static\runtime-link-static\windows-api-phone\config_info.obj.rsp" '/Zm800' is not recognized as an internal or external command, operable program or batch file. Any ideas what I'm doing wrong? BTW I can't find any docs mentioning these options - and it's something end users building Boost may well need? Finally a supplementary question: has anyone succeeded in running regression tests on either the store or phone platforms? If I run: /bjam config_info msvc-14.0 windows-api=store I get: testing.capture-output ..\..\..\bin.v2\libs\config\test\config_info.test\msvc-14.0\debug\link-static\runtime-link-static\windows-api-store\config_info.run ====== BEGIN OUTPUT ====== Access is denied. EXIT STATUS: 5 Along with a screen message saying the app can't be run on my PC. Any ideas? Many thanks, John.

3 4

[thread] boost::future::then
by Vladimir Prus 06 Nov '15

06 Nov '15

Hi, looking through docs for some other futures implementation [1], I see this: Why not use boost::future? # At the time of writing, 1.53 (the first version with the requisite features) was brand new, not well-tested, and not available to [...] developers. It is still a bit buggy/bleeding-edge They haven't fleshed out the threading model very well yet, e.g. every single then currently spawns a new thread unless you explicitly ask it to work on this thread only, and executor support was nonexistent (and now, is still experimental). Now, 1.53 is ancient. Can anybody comment on these statements regarding boost::future::thread state in 1.59? In particular, suppose I have this: // Thread 1 boost::promise<int> pi; boost::future<int> fi = pi.get_future(); // pass pi to thread 2 somehow fi.then(....); // Thread 2 pi.set_value(100); And I want continuation to be executed in thread 1, assuming that thread 1 runs Qt event loop, allowing me to use QTimer::singleShot, or queued signal, or similar mechanism. How would I go about making boost::future do it? Has anybody done so? Thanks, Volodya

4 41

The release branch will close tonight for the 1.60 beta
by Marshall Clow 05 Nov '15

05 Nov '15

Please do not merge to the release branch after tonight until the 1.60 beta is released (scheduled for next Wednesday) unless you have specific approval from the release managers. Thank you. (There will be a chance to merge bug fixes and documentation updates after the beta) -- Marshall (and the rest of the release managers)

2 2

[config] macro for portable restrict and restrict references
by Joel FALCOU 04 Nov '15

04 Nov '15

I pushed a PR that adds the macro BOOST_RESTRICT to take place of the compielr specific __restrcict/__restrict__ keyword. It also comes with an indicator if said keyword can be applied to references. https://github.com/boostorg/config/pull/81 Comments welcome.

1 0

[String Algo] Any reason the predicates don't optimize for random access iterators?
by Nevin Liber 04 Nov '15

04 Nov '15

I was looking in boost/algorithm/string/predicate.hpp and noticed that that the predicates *starts_with, *ends_with, *contains and *equals don't optimize for random access iterators. While I haven't done any benchmarks yet, it seems like it would be faster for random access iterators to do an O(1) length check at the beginning and then while looping only check one iterator against its end instead of two. Thoughts? Nevin :-) -- Nevin ":-)" Liber <mailto:nevin@c <nevin(a)eviloverlord.com>plusplusguy.com> (847) 691-1404

2 1