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

Re: [boost] proposal a movable_initializer_list
by 何子杰Hzj_jie 16 Sep '14

16 Sep '14

sorry, my fault of the mistake of for-range usage, you are correct, I am using iterator in my implementation. The efficiency I am taking care is the difference between copy-construction and move-construction. It will be significant if we are using lambda expression. Surely we still have something else to improve, say, provide the size of the vector at construction. The way using movable_initializer_list in the test case is not typical, indeed I am trying another not related issue. <the order of the move-constructions are not expected, i.e. line 46 will throw errors by g++, but no problem by msvc> Usually if a class A accept movable_initializer_list<T> as the parameter of a constructor, we only need A({T(), T()}), i.e. same as initializer_list. You properly would like to have a look at the event class, which is the typical scenario of movable_initializer_list, at https://github.com/Hzj-jie/osi/blob/master/delegates/event.hpp, with a test at https://github.com/Hzj-jie/osi/blob/master/utt_cases/delegates/event_test.h…. briefly it uses movable_initializer_list to avoid a copy of std::function instances, but can provide a way to call constructor with { } syntax. .Hzj_jie From: Sebastian Redl Sent: ‎Monday‎, ‎September‎ ‎15‎, ‎2014 ‎8‎:‎09‎ ‎PM To: boost(a)lists.boost.org On 15 Sep 2014, at 9:39, 何子杰Hzj_jie <hzj_jie(a)hotmail.com> wrote: > hi, all, > > So I proposal a movable_initializer_list, it accepts two ways to construct, with an initializer_list<T*> or initializer_list<T>, the prototype is, > > The implementation of T* overloads is something like > > movable_initializer_list<std::initializer_list<T*> x) > > { > > for(auto it : x) > > { > > assert((*it) != nullptr); > > v.push_back(std::move(**it)); > > delete *it; > > } > } Should be for (auto p : x) { v.push_back(std::move(*p)); delete p; } because of how for-range works. Seems an incomplete manual change from your published source. However, this is highly problematic because: - There is absolutely no way to make this exception-safe. The intended usage is obviously: SomeType st = { new Foo(123), new Foo(456), new Foo(789) }; But if any constructor here throws, a lot of memory is leaked, and destructors are not called. - If efficiency is your goal, I somehow doubt that an additional dynamic allocation per element for the initial list, then building a vector element by element, is the best way to achieve it. - The interface to this is just horrible. Looking at your test case, there is an absurd amount of boilerplate. Here’s what we really want: SomeType st{ Foo(123), Foo(456), Foo(789) }; Here’s what your thing forces me to do: auto pointers = { new Foo(123), new Foo(456), new Foo(789) }; SomeType st(pointers); // Absolute best case: no ambiguity in overload resolution - actually rather doubtful. If you do it that way, you might as well do it this way: Foo[] foos = [ Foo(123), Foo(456), Foo(789) }; // No dynamic allocation SomeType st(make_move_iterator(begin(foos)), make_move_iterator(end(foos))); More efficient, and you could make helpers that combine the make_move_iterator and begin/end calls to reduce boilerplate. > > While the implementation of T overloads is something like > > moveable_initializer_list<std::initializer_list<T> x) > { > > for(auto it : x) v.push_back(move(*it)); > } Again, that’s not how for-range works. What you want is for (auto&& e : x) v.push_back(std::move(e)); But that doesn’t actually work, because a std::initializer_list never gives you non-const access to its elements. I notice that your test case doesn’t test this constructor. Sebastian _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Darwin Clang Config failures.
by John Maddock 15 Sep '14

15 Sep '14

Does anyone understand why these all fail: http://www.boost.org/development/tests/develop/developer/output/marshall-ma… Is <functional> really broken on that platform? Surely not? Thanks, John.

4 3

proposal a movable_initializer_list
by 何子杰Hzj_jie 15 Sep '14

15 Sep '14

hi, all, the initializer_list in c++11 does not support the inner objects to be moved, so in some scenarios the performance will be significant impacted. say, an event class, which stores several std::function objects, and execute them later. the prototype is template <typename Args…> class event { private: std::vector<std::function<void(Args…)>> v; public: event(std::initializer_list<std::function<void(Args…)>>); void bind(std::function<void(Args…)>&&); }; When calling the constructor of event with a set of lambda expressions, the std::function objects will be copied instead of moved, and cause performance impact. Though pointer can resolve the issue, the syntax is not friendly, and the user needs to delete the instances manually. So I proposal a movable_initializer_list, it accepts two ways to construct, with an initializer_list<T*> or initializer_list<T>, the prototype is, template <typename T> class movable_initializer_list { private: std::vector<T> v; public: movable_initializer_list(std::initializer_list<T*>); movable_initializer_list(std::initializer_list<T>); // other functions same as initializer_list }; The implementation of T* overloads is something like movable_initializer_list<std::initializer_list<T*> x) { for(auto it : x) { assert((*it) != nullptr); v.push_back(std::move(**it)); delete *it; } } While the implementation of T overloads is something like moveable_initializer_list<std::initializer_list<T> x) { for(auto it : x) v.push_back(move(*it)); } Surely end-users need to aware the implementation of movable_initializer_list will move the objects instead of copy. The full implementation is at https://github.com/Hzj-jie/osi/blob/master/formation/movable_initializer_li…, and the test is at https://github.com/Hzj-jie/osi/blob/master/utt_cases/formation/movable_init…. Please feel free to give me some suggestions about this proposal. Thank you in advanced. .Hzj_jie

2 1

[vmd] Library Review
by Paul Mensonides 15 Sep '14

15 Sep '14

(apologies for the late review) -- Design -- Many of the utility components of the library have decent design. There are, however, a couple of aspects of the design that I dislike, and they touch on a large chunk of the library. These concerns all revolve around the registration, recognition, parsing, and limitations of various "v-types" and "v-sequences". I do not yet see a strong use case for the "v-key"/"v-identifier" recognition scenario, as opposed to just registering a "v-identifier". For example, #define BOOST_VMD_MAP_<v-key><v-identifier> // ... BOOST_VMD_IS_IDENTIFIER(<v-seq>, <tuple-of-v-keys>) Perhaps Edward can enlighten me about the use-cases for which this is ideal. I do see some use-cases, but in most cases it requires dispatch based on what the particular "v-identifier" it is anyway. One could do better for this low-level part with registrations such as (without a BOOST_VMD_ prefix for brevity) #define IDENTIFIER_CIRCLE (CIRCLE), #define IDENTIFIER_SQUARE (SQUARE), #define IDENTIFIER_TRIANGLE (TRIANGLE), #define IDENTIFIER_RECTANGLE (RECTANGLE), These definitions don't allow one to directly test for specific "v-identifiers", but they do allow one to extract registered "v-identifiers" from a "v-sequence". If all such registrations are required to be the same, there is no need for separate per-library prefixes. Macros can be defined multiple times if they are defined the same way. Similarly, the "v-numbers" could be pre-registered by the library as #define NUMBER_0 (0), #define NUMBER_1 (1), #define NUMBER_2 (2), // ... Tests for specific "v-identifiers" can be done via extraction from the above and using macro definitions such as #define COMPARE_CIRCLE_CIRCLE () #define COMPARE_SQUARE_SQUARE () // ... In many cases this sort of comparison is not needed, as one would directly dispatch off of the "v-identifier" itself. In any case, one could "parse" a "v-sequence" into "v-types" without many of the limitations of the current design. The following example uses Chaos, but I do not think there is anything in the design that fundamentally cannot be made to work on (e.g.) VC++. #include <chaos/preprocessor.h> #define NUMBER_1 (1), #define NUMBER_2 (2), #define NUMBER_3 (3), #define NUMBER_4 (4), #define NUMBER_5 (5), // ... // parser implementation... #define PARSE(vseq) PARSE_S(CHAOS_PP_STATE(), vseq) #define PARSE_S(s, vseq) \ CHAOS_PP_SPLIT(0, CHAOS_PP_EXPR_S(s)(CHAOS_PP_WHILE_S( \ s, PARSE_P, PARSE_O,, vseq \ ))) \ /**/ #define PARSE_P(s, seq, vseq) \ CHAOS_PP_COMPL(CHAOS_PP_IS_EMPTY_NON_FUNCTION(vseq)) \ /**/ #define PARSE_O(s, seq, vseq) \ seq CHAOS_PP_IIF(CHAOS_PP_IS_VARIADIC(vseq))( \ PARSE_O_A, PARSE_O_B \ )(vseq) \ /**/ #define PARSE_O_A(vseq) PARSE_O_A_A vseq #define PARSE_O_A_A(...) (3, (__VA_ARGS__)), #define PARSE_O_B(vseq) \ CHAOS_PP_IIF(CHAOS_PP_IS_VARIADIC(NUMBER_ ## vseq))( \ PARSE_O_B_A, \ CHAOS_PP_IIF(CHAOS_PP_IS_VARIADIC(IDENTIFIER_ ## vseq))( \ PARSE_O_B_B, PARSE_O_B_C \ ) \ )(vseq) \ /**/ #define PARSE_O_B_A(vseq) \ (1, CHAOS_PP_REM_CTOR( \ CHAOS_PP_SPLIT(0, NUMBER_ ## vseq) \ )), \ CHAOS_PP_SPLIT(1, NUMBER_ ## vseq) \ /**/ #define PARSE_O_B_B(vseq) \ (2, CHAOS_PP_REM_CTOR( \ CHAOS_PP_SPLIT(0, IDENTIFIER_ ## vseq) \ )), \ CHAOS_PP_SPLIT(1, IDENTIFIER_ ## vseq) \ /**/ #define PARSE_O_B_C(vseq) (0, vseq), // registrations... #define IDENTIFIER_CIRCLE (CIRCLE), #define IDENTIFIER_SQUARE (SQUARE), #define IDENTIFIER_TRIANGLE (TRIANGLE), #define IDENTIFIER_RECTANGLE (RECTANGLE), PARSE( CIRCLE RECTANGLE (a, b, c) TRIANGLE 3 (xyz) UNREGISTERED SQUARE ) (Apologies for any mistakes in the above. I wrote it up quickly.) This particular example results in key-value pairs of the form: (0, <unrecognized>) (1, <v-number>) (2, <registered-identifier>) (3, <tuple>) (2, CIRCLE) (2, RECTANGLE) (3, (a, b, c)) (2, TRIANGLE) (1, 3) (3, (xyz)) (0, UNREGISTERED SQUARE) There are a number of things that could be done instead of producing a binary sequence like this (which Boost.Preprocessor cannot handle). One could fold the results via a user-supplied macro, for example. Aside from the massive amount of clutter introduced by workarounds, many of the pieces of the above are already available either in Boost.Preprocessor or in other parts of the VMD library. For example, BOOST_VMD_IS_EMPTY is essentially CHAOS_PP_IS_EMPTY_NON_FUNCTION. -- Implementation -- I have not looked closely at the implementation, but I do know what a herculean effort it is to get this type of stuff working with VC++ in particular. -- Documentation -- There are few inaccuracies in the documentation related to motivations for various Boost.Preprocessor things, but those could be fixed. The documentation for BOOST_VMD_IS_EMPTY is decent except that essentially any input that ends with a function-like macro name will cause weird results or errors. So much so that the documentation should just disallow input that ends with a function-like macro name across the board. Other than that, the documentation needs some clean-up and organization (particularly of definitions), but does a reasonable job of documenting the library. I do feel that a lot of documentation complexity comes from the way that v-keys/v-identifiers (etc) are handled. -- Usefulness -- There is a definite use-case for many of the utilities in the library, and the fundamental concept v-sequence parsing. -- Testing -- I tested the library with GCC and everything functioned as advertised. -- Effort -- I did a fairly significant study of the design and interface of the library. -- Domain Familiarity -- I had my skull opened up and had "preprocessor metaprogramming" tattooed directly onto my brain. -- There are many good parts of the library--including the herculean effort to make it work on sub-par preprocessors such as VC++. However, at this point I would be hesitant to recommend acceptance based on the design of the v-type recognition and v-sequence parsing part. I am open to argument about why the current design is superior based on use-cases or technical limitations introduced by (e.g.) VC++ or, if it is not superior, a further review at a later date after a redesign because the underlying concept is sound. -- Regards, Paul Mensonides

3 14

Intel C++ Linux non-commercial software development license updated information
by Edward Diener 15 Sep '14

15 Sep '14

Just a quick note to tell anyone interested that evidently Intel has discontinued their free Intel C++ Linux compiler for developers based on their non-commerical software development license. If you look at their non-commercial software development license page at https://software.intel.com/en-us/non-commercial-software-development you will see that it only potentially offers a license for academics and the response I received on their online forum for Intel C++ is that they have discontinued their non-commercial software development license for developers, although they seem loth to make an announcement about it or publicize it. I have some recent versions of Intel C++ Linux with which I can still test but I will not be able to test the latest version(s) of Intel C++ on Linux. The isocpp Get Started page at https://isocpp.org/get-started still mentions the free Intel C++ version, but this evidently is no longer the case.

1 0

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

14 Sep '14

Hi, Library authors that have no review manager and feel ready for review please contact me via this mailing list. -- Best regards, Antony Polukhin

7 14

[serialization] [libstdc++] [detail] utf8_codecvt_facet fixes broke serialization test_array_xml_warchive
by Beman Dawes 13 Sep '14

13 Sep '14

The specific crash message is: *** Error in `../../../bin.v2/libs/serialization/test/test_array_xml_warchive.test/clang-linux-libstdcpp/debug/test_array_xml_warchive': double free or corruption (!prev): 0x00000000015f6f90 *** It occurs for clang, gcc, and intel compilers, using libstdc++. It does not occur with clang using libc++. It does not occur with msvc 10.0, 11.0, or 12.0. None of the other libraries (filesystem, log, program_options, property_tree) that use utf8_codecvt_facet are failing on develop. This is mainly a heads up to let people know that the serialization problem in develop is being worked on, but it may be a day or two before I have a fix. --Beman

4 10

[asio] RFC on new reliable UDP library
by Niall Douglas 12 Sep '14

12 Sep '14

Dear Boost and ASIO users, CC: boost(a)lists.boost.org, asio-users(a)lists.sourceforge.net I am writing to ask for comments on the design of and interest in a generic reliable messaging library based on ASIO. Such a library could bring to ASIO very considerably improved data transfer performance over TCP, plus the ability to ignore NAT firewalls. The design imperatives for such a library are proving tricky to reach consensus upon, so perhaps the community might be able to help. Firstly, what features should such a reliable messaging library have? Here are some for you to consider: * Should it have wire transport backends with an abstraction from wire transports, so a UDT backend could be interchangeable with TCP for example with just a recompile needed? Upper level code need therefore not consider what format the wire transport takes, just that messages are reliably delivered or we are told of the connection failure. Some mechanism for dealing with out of order messages, and message expiry in case congestion control excessively delays outbound messages would also be included. You should be aware that congestion control for a reliable messaging library means one has no choice but to pace message construction (i.e. block/EWOULDBLOCK handing out new message send templates), otherwise one ends up buffering more data for sending than potentially can ever be delivered. This is because we cannot drop reliable messages, nor can we pace writes, so pacing new message construction is the only alternative. * Should it be zero copy for both receipt and send? If so, we'll have to break with the existing ASIO API somewhat - namely that MutableBufferSequence will need to now become MutableFileOffsetBufferSequence so one can supply scatter/gathers of user space buffers and kernel side buffers. We'll also have to templatise the buffer management so client code can supply the virtualisation (e.g. an iterator) which remaps inbound message fragments into apparently contiguous regions. By the time we have done these, the API looks quite different. * Should it be written using C++ 14 idioms instead of the existing 03 idioms ASIO uses? If so, basing read and write handlers on the C++ 17 proposed experimental::expected<T, E> (http://www.hyc.io/boost/expected-proposal.pdf) makes much more sense than the fixed ASIO handler prototype void (*handler)(const boost::system::error_code& ec, std::size_t bytes_transferred) - it is more powerful, more expressive, optionally integrates cleanly with no-alloc future-promise and the rest of the C++ 11/14 STL, and lets handlers use any mix of error reporting mechanism they choose. It also opens the door to a much cleaner and tighter integration of the future C++ 17 Networking TS with Concurrency TS. Equally, especially if combined with the earlier changes, it goes further and further away from the present ASIO design. * How concurrent should it be capable of? Unlike TCP where it makes not much sense to have concurrent writers, UDP allows enormous parallelism, potentially into queue depths of thousands on decent NICs, sufficiently so where a strand based design may simply not scale. We believe that with some effort a completely lock free design which can make full use of the batch datagram send and receive APIs on Linux and Windows is possible - we believe that such a design would scale close to linearly to CPU cores available. Unfortunately, as batch datagram send/receive is not supported by ASIO and on POSIX the main dispatcher appears to be locked by a mutex, this would require a custom code path and i/o service. If combined with all of the above, it starts to look like a rewrite of the core of ASIO which seems very big just to implement reliable messaging. I guess that is good for now for starting discussion. My thanks for your time in advance. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

9 17

[core/noncopyable][test/boost::unit_test::singleton] massive test failures
by Joaquin M Lopez Munoz 11 Sep '14

11 Sep '14

Hi, There's a problem with noncopyable and boost::unit_test::singleton in Intel 13 for Linux in C++11 compatibility mode that's rippling through many Boost libs. To list a few: date_time: http://tinyurl.com/lkeakab geometry: http://tinyurl.com/n3rajyn regex: http://tinyurl.com/kxkqo4c tuple: http://tinyurl.com/oz3vlct The error messages go like protected function "boost::noncopyable_::noncopyable::noncopyable()" [...] is not accessible through a "boost::noncopyable_::noncopyable" pointer or object[...] protected function "boost::unit_test::singleton<Derived>::singleton()" [...] is not accessible through a "boost::unit_test::singleton<boost::unit_test::unit_test_log_t>" pointer or object[...] which are manifestations of the following compiler bug: https://software.intel.com/en-us/forums/topic/404755 The report also indicates a simple workaround consisting of replacing BOOST_CONSTEXPR noncopyable() = default; with noncopyable() {} (seemingly, this would also fix boost::unit_test::singleton automatically.) Maybe the maintainer of boost:noncopyable can try a fix for ICC 13 along these lines? This can potentially clear a ton of yellow cells. I'd volunteer a pull request but alas I don't have local access to that compiler. Thank you, Joaquín M López Muñoz Telefónica

8 38

[build] clang objective c support?
by Emil Dotchevski 11 Sep '14

11 Sep '14

Hello, It seems like building with the clang-darwin toolset silently ignores .m and .mm files What is the status of Objective C support in this toolset? Is this a configuration problem on my part or is it just not supported? -- Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

3 6

ICL space and running complexity
by Kenneth Adam Miller 11 Sep '14

11 Sep '14

With regards to the ICL data structure, can anybody tell me what the space and time complexity is of the various interval_map types (split and regular)? http://www.boost.org/doc/libs/1_56_0/libs/icl/doc/html/index.html

2 1

[git] Problem after deleting submodule
by Edward Diener 10 Sep '14

10 Sep '14

Git is starting to get to me. I did a git pull from the latest master only to get a bunch of conflicts from the latest align submodule. I have never touched the align submodule locally so having conflict errors with it is absurd. After trying to straighten out the errors via a 'git reset --hard' for the align submodule, and still getting conflicts, I deleted the submodule locally just so I could get the latest master. Now I can't seem to get back the submodule. No matter what I do the submodule is no longer recognized at the top level. What do I do ? Yes git is powerful but it is also a VCS from hell. About the only intelligent thing I have ever heard Linux Torvalds say.

1 1

Trac spam report
by Joaquin M Lopez Munoz 09 Sep '14

09 Sep '14

I got this one: https://svn.boost.org/trac/boost/ticket/10437 Joaquín M López Muñoz Telefónica

5 6

_MSVC_VER - variadic_slot_invoker.hpp
by Anders Dalvander 09 Sep '14

09 Sep '14

There appears to be two predefined macro spelling mistakes in signals2/detail/variadic_slot_invoker.hpp. It says _MSVC_VER where it should say _MSC_VER. #if defined(_MSVC_VER) // <-- Here # pragma warning(push) # pragma warning(disable:4100) // unreferenced formal parameter #endif ... #if defined(_MSVC_VER) // <-- ... and here # pragma warning(pop) #endif Regards, Anders Dalvander

1 0

[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

Finite state machine
by arcolight 07 Sep '14

07 Sep '14

Hi all. I have a question about participation in boost libraries. In my embedded project I'm using finite state machine and I tried to use one of the boost implementations of FSM, but they are too big and complex. Main disadvantage of them is usage of dynamic memory allocation, that I can't afford on my CPU and many dependencies, that I can't use on my CPU. CPU is ARM Cortex-M4 with 128K memory, I've no operating system in my project. I have write my own FSM implementation without dynamic memory and dependencies, it's more simple, than boost libraries, but, of course, not so powerful. I've used C++11 standard, specifically variadic templates. My question - Is there some interest in such FSM implementation for boost developers? I'll be very grateful for advice. P.S.: I'm sorry for my english, it's not my native language.

4 3