- Boost-users - lists.preview.boost.org

[Fit] review - github issuess
by Vicente J. Botet Escriba 06 Mar '16

06 Mar '16

Hi, we have started to create some issues in https://github.com/pfultz2/Fit/issues, and sometimes there are some interesting discussion. I will try to add post on the MLs the issues that are conflicting so that other are aware of the discussion. Anyway, if you are curious you can always take a look at and participate also. If you want to receive the updates I believe that you just need to click on watch (top right). Best, Vicente

1 0

Re: [Boost-users] [boost] [Fit] formal review - should we propose some parts to Boost.Config/Boost.Core
by Glen Fernandes 06 Mar '16

06 Mar '16

On Sat, Mar 5, 2016 at 9:21 PM, Vicente J. Botet Escriba wrote: > Others could be considered also as function.hpp, lambda.hpp and lift.hpp, as > the macros are there to workaround some missing language features, but those > are much more specialized (Boost.Core?) > Boost.Core is where we move code from existing Boost libraries that enables breaking cyclic dependencies between different Boost libraries. I'm not so sure new libraries will need to (or want to) put code there. Glen

1 0

Boost.Spirit Karma: debug() alters result
by Matwey V. Kornilov 05 Mar '16

05 Mar '16

Hello, I am using boost 1.58 and I see the following. template <class Iterator> struct test_generator: karma::grammar<Iterator, std::string()> { test_generator(): test_generator::base_type(start) { using karma::ascii::string; using boost::spirit::ascii::char_; using karma::lit; using karma::buffer; using karma::debug; value2 = +(~char_(' ')); value1 = value2; value = lit('=') << value1; start = buffer[-value]; } karma::rule<Iterator, std::string()> start; karma::rule<Iterator, std::string()> value; karma::rule<Iterator, std::string()> value1; karma::rule<Iterator, std::string()> value2; }; template <class Iterator> struct test_generator2: karma::grammar<Iterator, std::string()> { test_generator2(): test_generator2::base_type(start) { using karma::ascii::string; using boost::spirit::ascii::char_; using karma::lit; using karma::buffer; using karma::debug; value2 = +(~char_(' ')); value1 = value2; value = lit('=') << value1; debug(value); start = buffer[-value]; } karma::rule<Iterator, std::string()> start; karma::rule<Iterator, std::string()> value; karma::rule<Iterator, std::string()> value1; karma::rule<Iterator, std::string()> value2; }; template<class It> bool do_generate(It it, const std::string& x) { test_generator<It> g; return karma::generate(it, g, x); } template<class It> bool do_generate2(It it, const std::string& x) { test_generator2<It> g; return karma::generate(it, g, x); } //... std::string x2,x3; do_generate(std::back_inserter(x2), std::string("")); do_generate2(std::back_inserter(x3), std::string("")); std::cerr << "|" << x2 << "|" << std::endl; std::cerr << "|" << x3 << "|" << std::endl; //... The code prints: <unnamed-rule> <try> <attributes>[[]]</attributes> </try> <fail/> </unnamed-rule> |=| || I.e. introduction of debug() alters result of the generator. Could you please explain me where I am wrong? I am stuck now.

2 3

[Fit] upcoming formal review for Boost.Fit
by Vicente J. Botet Escriba 05 Mar '16

05 Mar '16

Dear Boost community, The formal review of Paul Fultz II's Fit library starts on Wednesday, 2nd March and ends on 13th March. Fit is a header-only C++11/C++14 library that provides utilities for functions and function objects. Fit is: - Modern: Fit takes advantages of modern C++11/C++14 features. It support both `constexpr` initialization and `constexpr` evaluation of functions. It takes advantage of type deduction, variadic templates, and perfect forwarding to provide a simple and modern interface. - Relevant: Fit provides utilities for functions and does not try to implement a functional language in C++. As such, Fit solves many problems relevant to C++ programmers, including initialization of function objects and lambdas, overloading with ordering, improved return type deduction, and much more. - Lightweight: Fit builds simple lightweight abstraction on top of function objects. It does not require subscribing to an entire framework. Just use the parts you need. Fit is divided into three components: * Function Adaptors and Decorators: These enhance functions with additional capability. * Functions: These return functions that achieve a specific purpose. * Utilities: These are general utilities that are useful when defining or using functions Fit has been tested on gcc 4.6-4.9, clang 3.4-3.7, and Visual Studio 2015. For more information see: Github:https://github.com/pfultz2/Fit/tree/boost Documentation:http://pfultz2.github.io/Fit/doc/html/ Note that, as Fit is a functional library, the semantic of the functions is given in the form of `equations` instead of the classic effects, returns schema. This is because most of the functions have no side effects. E.g. the semantic of the function flip is defined as |assert(flip(f)(x, y, xs...) == f(y, x, xs...));| and the semantic of compose as |assert(compose(f, g)(xs...) == f(g(xs...)));| We await your feedback! Best regards, Vicente J. Botet Escriba P.S. Paul, now it is time to freeze the version that will be reviewed. I suggest you to create a branch on which you could fix the review issues.

6 11

[Preprocessor] MSVC nonstandard macro expansion workaround?
by rleigh＠codelibre.net 04 Mar '16

04 Mar '16

Hi folks, I've been trying to get Boost.Preprocessor to run a nested for loop over two sequences to output nested switch blocks and case statements. This works fine with GCC and clang. Unfortunately it's broken with MSVC. If anyone had any thoughts on what I might need to tweak to enable the code to work with MSVC, I'd be very appreciative. Even if it's as nasty as a big ifdef with an alternative set of macros! This is the test case: -------- #include <boost/preprocessor.hpp> #include <iostream> #define LASERTYPE_VALUES (EXCIMER)(GAS)(METALVAPOR)(SOLIDSTATE)(DYE)(SEMICONDUCTOR)(FREEELECTRON)(OTHER) enum LaserType { BOOST_PP_SEQ_ENUM(LASERTYPE_VALUES) }; #define PP_SEQ_FOR_EACH_R_ID() BOOST_PP_SEQ_FOR_EACH_R #define PP_DEFER(x) x BOOST_PP_EMPTY() #define LT_NESTED(maR, maToplevelType, maNestedType) \ std::cout << "Test nested: first=" << LaserType(maToplevelType) << " second=" << LaserType(maNestedType) << " \n"; #define LT_TOPLEVEL(maR, maUnused, maType) \ std::cout << "Test toplevel: " << LaserType(maType) << " \n"; \ PP_DEFER(PP_SEQ_FOR_EACH_R_ID)()(maR, LT_NESTED, maType, LASERTYPE_VALUES); int main() { BOOST_PP_EXPAND(BOOST_PP_SEQ_FOR_EACH(LT_TOPLEVEL, %%, LASERTYPE_VALUES)); } -------- On MSVC, I get this: > cl /EHsc /I \path\to\boost-1_60 /Fe:test-pp.exe test-pp.cpp Microsoft (R) C/C++ Optimizing Compiler Version 18.00.40629 for x64 Copyright (C) Microsoft Corporation. All rights reserved. test-pp.cpp test-pp.cpp(22) : warning C4003: not enough actual parameters for macro 'BOOST_PP_VARIADIC_ELEM_3' test-pp.cpp(22) : warning C4003: not enough actual parameters for macro 'BOOST_PP_BOOL' test-pp.cpp(22) : warning C4003: not enough actual parameters for macro 'BOOST_PP_BOOL_I' test-pp.cpp(22) : warning C4003: not enough actual parameters for macro 'BOOST_PP_VARIADIC_ELEM_2' test-pp.cpp(22) : warning C4003: not enough actual parameters for macro 'BOOST_PP_DEC' test-pp.cpp(22) : warning C4003: not enough actual parameters for macro 'BOOST_PP_DEC_I' test-pp.cpp(22) : error C2065: 'BOOST_PP_SEQ_FOR_EACH_M' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_TUPLE_EAT_2' : undeclared identifier test-pp.cpp(22) : error C2065: 'LT_NESTED' : undeclared identifier test-pp.cpp(22) : error C2064: term does not evaluate to a function taking 1 arguments test-pp.cpp(22) : error C2146: syntax error : missing ';' before identifier 'BOOST_PP_IIF_BOOST_PP_BOOL_' test-pp.cpp(22) : error C3861: 'BOOST_PP_IIF_BOOST_PP_BOOL_': identifier not found test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_3' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_TUPLE_EAT_4' : undeclared identifier test-pp.cpp(22) : error C2059: syntax error : ',' test-pp.cpp(22) : error C3861: 'BOOST_PP_EXPAND': identifier not found test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_4' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_5' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_6' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_7' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_8' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_9' : undeclared identifier test-pp.cpp(22) : error C2065: 'BOOST_PP_FOR_10' : undeclared identifier I've spent hours tweaking the testcase to try to make this work, but so far without success. It doesn't help that I don't fully understand what specifically is broken with the MSVC preprocessor, or how to work around whatever is behaving in a non-stanadard way. Many thanks, Roger

5 5

PBGL in shared memory
by Ярослав 04 Mar '16

04 Mar '16

Hi guys, I need to write some graph parallel algorithms and I decided to use boost graph library for this. There are also PBGL. So my question is, is PBGL works great in shared memory environment. My algorithms will be used in a competition, so I know that it will be launched on a single machine, but with quite high number of cores. Is it worth to use sequential BGL with OpenMP or something, PBGL can handle shared memory and prevent overhead from copying data from one process space to another (as I get it is using MPI)?

2 1

Turning Boost.Multi-Index ordered_non_unique index into ordered_unique one, with custom comparator
by Dominique Devienne 03 Mar '16

03 Mar '16

I would like to support a slightly unusual use-case. We have a class with a integer member, and a BMI container for instances of this class. That member is supposed to be unique, *except* for a special "invalid" value (-1), which several instances can use. Right now, we use an ordered_non_unique index, because of the -1's, but that leaves the door open for other duplicate "valid" values, which should be forbidden. So my question is whether one can index this member uniquely, thanks to a custom comparator, such that the comparator does not violate the usual strict-weak-ordering requirement of ordered containers? I'm thinking kinda like SQL NULLs, which don't compare equal to each other, i.e. in this case -1 would never equal another -1, and use another arbitrary (but stable) ordering specifically for those -1's. This assumes though I can know which instance the int member is part of, i.e. will the comparator get the integer by value or reference, and if a reference, is that a reference to the "internal" element, such that the arbitrary order can be the address of the element for example? Or to avoid element movement in case of reallocs in the container, can the comparator access an iterator to project it into another random-access index of the same container, to use that index's integer-index as the arbitrary order? I'd appreciate some feedback/insights into the above. Thanks, --DD

4 7

Boost.Spirit Karma: Alternative generator
by Matwey V. Kornilov 03 Mar '16

03 Mar '16

Hello, I am construction karma::rule<OutputIterator, std::string()> which I would like to be either a string or quoted string if the string contains spaces. Now I think that the rule should be something like: rule = (&true[...] << string) | (lit("\"") << string << lit("\"")); but I've failed to write proper semantic action. How could I obtain std::string object reference to write something like: (obj.find(" ") == std::string::npos) ? Or maybe is there a better way to do the same?

2 2

[gsoc16] An update on GSoC 2016 contingency plans
by Niall Douglas 03 Mar '16

03 Mar '16

Dear Boost, We've been collecting a list of veteran Summer of Code students where "veteran" means students whom have previously done a Google Summer of Code for Boost. It /may/ be possible for us to acquire enough funding from a number of contributors to tide over ongoing GSoC projects this summer during our year off from Google funding for veteran students only. The stipend to the student would be the same as with Google, $5,500. The mentor stipend would likely need to be waived under any substitute programme. We would therefore appreciate an update from student and/or mentor as to whether they were intending to submit a continuing GSoC this summer and would be willing to continue work on their Boost library under any funding we find. If we have forgotten any students or projects, please get in touch. Extant ongoing summer of code projects known to us are (please send corrections of any mistakes): * Boost Document, mentored by Antony Polukhin. https://anuragxel.github.io/boost-document/ Student: Anurag Ghosh Status: Not peer reviewed * Boost.Compute, mentored by Kyle Lutz. https://boostorg.github.io/compute/ Student: Jakub Szuppe Status: Official Boost library * Boost.Hana, mentored by Joel Falcou. https://boostorg.github.io/hana/ Student: Louis Dionne Status: Official Boost library * Boost.Http, mentored by Bjorn Reese. https://boostgsoc14.github.io/boost.http/ Student: Vinícius dos Santos Oliveira Status: One peer review held * Boost.Fixed-Point, mentored by Paul Bristow. https://github.com/BoostGSoC15/fixed_point Student: Nikhar Agrawal Status: Not peer reviewed We are aware of the following Boost libraries who have strong but new-to-Boost potential student candidates in the pipeline for summer of code 2016: * Boost.odeint, mentored by Karsten Ahnert and Mario Mulansky There is even less chance we can find funding for these, but if any of the veteran students or mentors has to suddenly pull out before the summer, we would substitute one of these projects instead. Therefore, if mentors had a really excellent student lined up for 2016, please let us know. None of the above should be read that summer of code 2016 is going ahead. We just need some hard numbers with which to lobby for funding. We will get back to the community as soon as we know more. We need all this information requested above back BEFORE this weekend as we will be making use of the Jacksonville ISO WG21 meeting currently happening to grab the right people to ask them for donations from their corporate bodies. If YOUR corporate org would be willing to help sponsor a summer of code student, either partially or in full, PLEASE get in touch. Donations to Boost are tax deductible for US taxpayers. Thank you all very much in advance! Niall --- Boost C++ Libraries Google Summer of Code 2016 admin https://svn.boost.org/trac/boost/wiki/SoC2016

2 1

boost::asio::read_until Segmentation Fault & Third Party Signal Handler
by Craig, Tom 01 Mar '16

01 Mar '16

My Linux application sis using bool::asio::read_until() to read data from a socket. The application also uses commercial, 3rd party hardware. Occasionally my program crashes due to a SIGSEGV violation. The core dump stack trace is shown below. It indicates that the 3rd party signal handler is invoked while my thread is waiting for socket I/O, and that the crash is occurring during signal handler execution. While I recognize that this is an issue with the 3rd party vendor (and I am currently engaged in discussions with them), I'm wondering if my usage of boost is incorrect, or if there is something that I should be doing differently in performing socket I/O? I am using boost v1.43. [cid:image001.png@01D17303.98B2DD10] E. Thomas Craig Principal Software Engineer SWIFT Division KLA-Tencor Corporation 408-875-7909 (work) 650-799-4787 (cell)

3 3