September 2014 - Boost - lists.preview.boost.org

[range] Interest in range_call function?
by Arthur Rosenstein 09 Sep '14

09 Sep '14

Hi, I'm checking to see if there's interest in a range_call function that makes calling iterator-based algorithms with ranges a little less painful. Simply put, range_call takes a function and an argument list and forwards the arguments to the function while expanding ranges into begin/end iterator pairs. For example: range_call(std::sort, vec, std::greater<int>()); It can also transform the result a la Boost.Range: range_call(std::copy, range_call<return_begin_found>(std::unique, range_call<return_begin_end>(std::sort, vec) ), std::ostream_iterator<int>(std::cout, " ") ); Obviously, Boost.Range provides a cleaner interface for most standard algorithms. range_call, however, works with arbitrary functions and has a smaller surface area. Is there any interest in this (possibly as part of Boost.Range)? -- Cheers, Arthur

1 0

Re: [boost] [process] [sorting] [singularity] [compute] [others] Who needs review manager?
by Antony Polukhin 09 Sep '14

09 Sep '14

2014-09-08 22:52 GMT+04:00 Kyle Lutz <kyle.r.lutz(a)gmail.com>: > On Mon, Sep 8, 2014 at 9:03 AM, Antony Polukhin <antoshkka(a)gmail.com> > wrote: > > Hi, > > > > Library authors that have no review manager and feel ready for review > > please contact me via this mailing list. > > Hi Antony, > > The Boost.Compute library [1] is in need of a review manager. Also, > would it be possible to add it to the review queue listed at [2]? > > Thanks, > Kyle > > [1] https://github.com/kylelutz/compute > [2] http://www.boost.org/community/review_schedule.html > I took a quick glance at the library and it looks really interesting and promising. I'm not an expert in a problem domain, but at least I have some experience with CUDA. I'll need a few weeks to look through the sources and ask questions. If no one objects, after that we could discuss a review date and put it to the schedule. -- Best regards, Antony Polukhin

1 0

How to respond to mailing list
by Kirk Liberty 08 Sep '14

08 Sep '14

Hello, I'm sorry to have to ask this, but I've googled all around and can't figure it out. My email is set up to receive periodic digests of the mailing list. If I want to respond to an email thread, how would I do that? Thanks, Kirk

4 3

NTCTS Iterator [was: Interest in is_iterator type trait?]
by Beman Dawes 08 Sep '14

08 Sep '14

On Tue, Aug 19, 2014 at 1:56 PM, Peter Dimov <lists(a)pdimov.com> wrote: > Beman Dawes wrote: > > Source can be a iterator to a NTCTS or a container. >> > > An iterator to an NTCTS? That's an interesting invention. :-) > See http://beman.github.io/ntcts_iterator/ or https://github.com/Beman/ntcts_iterator --Beman

9 18

[Boost-users] Testers required
by Antony Polukhin 08 Sep '14

08 Sep '14

Hi, There is a big need in testers that have access to exotic platforms(zArch, MIPS) and compilers (Cray, IBM xlc ...). Could you please run `b2` in `boost/libs/type_index/test` and report results. This will help to test Boost.TypeIndex library and other libraries that depend on `demangle.hpp` I'll appreciate any help. Thanks in advance! -- Best regards, Antony Polukhin

2 2

Help identify the conversion bug in MSVC
by Andrzej Krzemienski 08 Sep '14

08 Sep '14

Hi, I found a bug in MSVC 10.0 that causes a bug in Boost.Optional. I will be trying to find a workaround for the compiler. I would like to ask people with the access to MSVC 11.0 and 12.0 to check if the bug also persist in these newer releases. The following code is expected to compile: struct A { A(int) {} A(A &&) {} }; struct B { operator A() { return A(1); } operator int() { return 0; } }; int main() { A t = B(); } The following code is expected *NOT *to compile: struct A { A(int) {} }; struct B { operator int() { return 0; } }; int main() { A t = B(); } Please let me know what your compiler says. Thanks, &rzej

2 2

Re: [boost] Finite state machine
by arcolight 07 Sep '14

07 Sep '14

> Hi, > I don't know if you're using msm or statechart but msm uses no dynamic > memory, except if you choose to use the event queue or deferred events. And > even this can be avoided by providing as template argument you own queue. > If you don't require these features, you can disable them. > > Cheers, > Christophe I'm using MSM. Yes I tried this, but I could not do so. Perhaps, I doing something wrong. Problem in that i've no OS, and even no full C library, I'm using newlib-nano. I was trying to disable everything, that I can, but this didn't help. I understand, that this situation is special and boostmust count on something. May be you can advise me how to use (and, may be,build?)boost with arm-none-eabi compiler.I've read docs and trying to build boost for arm-none-eabi, but compilation fails. Do I understand correctly, that MSM doesn't need to compile something - this is only .hpp files and it doesn't use libs, so I can try to use it without compilation? -- arcolight

2 1

[git][align][litre] git submodule update failure.
by Mostafa 07 Sep '14

07 Sep '14

$ git submodule update libs/align fatal: reference is not a tree: d32353ea7d39c0237202e3e460f3248f226db274 Unable to checkout 'd32353ea7d39c0237202e3e460f3248f226db274' in submodule path 'libs/align' $ git submodule update tools/litre fatal: reference is not a tree: 564d4d8d30b7e03ac5e25d78e14d2c19fa321c83 Unable to checkout '564d4d8d30b7e03ac5e25d78e14d2c19fa321c83' in submodule path 'tools/litre' According to this: http://stackoverflow.com/questions/13425298/git-submodule-update-fatal-erro… , this is most likely a maintainer's bug. From the above: "This is the most common problem with submodules. The commit that you are on in the outer repository has a reference to a commit in the submodule that someone did not push up yet. It's a dependency problem. Always push from the inside-out. This is most likely not something you did wrong, but someone else that's working in the repository. They were sloppy and forgot to issue push on the submodule and just pushed the containing repository. Stuff works on their machine because they made the change and those commits exist there." Is this true?

3 3

Re: [boost] Finite state machine
by arcolight 07 Sep '14

07 Sep '14

> Are you using Statechart or MSM? > -- Michael Caisse ciere consulting ciere.com I tried to use both. -- arcolight

1 0

Re: [boost] Finite state machine (arcolight)
by arcolight 07 Sep '14

07 Sep '14

> This is something that would be very interesting to me, but I wonder if the > memory allocation can be factored out in the current boost library by using > allocators or something. I'm not terrible familiar with the libraries > internals, but I'd be willing to take a look at my next free cycle. To be > clear, is there another state machine lib in boost besides > boost.statechart? That's the only one I'm familiar with from a user > perspective. > > -Greg Yes, custom allocator doesn't solve the problem, especially because current FSM-s includes many other libraries. In any case, I can't afford to use even custom allocator in my project, if I would use it, I must have sufficient size heap, it's risky in embedded system. I already have third-party code, that uses heap, and I couldn't do anything with it. :) Another FSM implementation - Boost.MSM(Meta state machine), I tried to use it in different ways, but i've failed. MSM based on MPL boost library. If you interested in code, I have small repo on github: https://github.com/arcolight/ecl, there are several small classes, one of them, in fsm.hpp - state machine. There are simple test with cd-player like in boost lib.

1 0