September 2010 - Boost - lists.boost.org

Re: [boost] [msm] on_entry must be implemented for every initial events for every states in substatemachines.
by Christophe Henry 02 Sep '10

02 Sep '10

> Hi All > > In the following little example see attachment, > I have a problem that in the RunningStateMachine::State2 the on_entry > function must be implemented with event1 and with event3 as well > but from the logic point of view there is no possibility to call > on_entry in RunningStateMachine::State2 with event1. > > actually at runtime there is no call is happening to to the function : > void on_entry(event1 const&,FSM& ) {std::cout << "entering: > State2:Event1" << std::endl;} > but it must be defined and even implemented ( if no implementation > provided linker error occurs). > Is it a restriction/bug or I'm missing something ? > It is only happening with initial events for substatemachines ? > Or is there a kind of pattern to know what events can enter exit a > state in a top of the ones present in the transition tables ?. Hi, Well, we don't want to go into the implementation details (we really don't ;-) ) but to make it short, msm tries the entry event with every state to see which state is active at run-time. And this means that every state's entry and exit behavior must be able to process this event. Of course it'd be possible to know in advance that some states are wrong candidates but this requires some compile-time graph analysis. And I do plan to start working on this using the metagraph library which is in construction. But for the moment I don't have this tool in msm. And even when I do, there will be a compile-time cost. Back to the example, when you write: template <class FSM> void on_entry(event3 const&,FSM& ) {std::cout << "entering: State2:Event3" << std::endl;} You are hiding the default on_entry, which provides you with an empty implementation for all events. The solution is not incredibly beautiful but will save us some compile-time. We need to tell the compiler we have a version for event3 and one for all others: template <class Event,class FSM> typename boost::enable_if< typename boost::is_same<Event,event3>::type,void >::type // version for event3 on_entry(Event const&,FSM& ) {std::cout << "entering: State2:Event3" << std::endl;} template <class Event,class FSM> typename boost::disable_if< typename boost::is_same<Event,event3>::type,void >::type // version for events != event3 on_entry(Event const&,FSM& ) {std::cout << "entering: State2:Event1" << std::endl;} Now it compiles :) HTH, Christophe

1 0

[quickbook] QUICKBOOK_CYGWIN_1_5 undefined
by vicente.botet 02 Sep '10

02 Sep '10

Hi, I have moved to v1.44, and while I try to build quickbook on cygwin-1.5 I get the following error $ bjam ...patience... ...found 1304 targets... ...updating 5 targets... gcc.compile.c++ ../../../bin.v2/tools/quickbook/gcc-3.4.4/debug/link-static/deta il/input_path.o C:\cygwin\boost\v44\tools\quickbook\detail\input_path.cpp: In function `void qui ckbook::detail::validate(boost::any&, const std::vector<std::string, std::alloca tor<std::string> >&, quickbook::detail::input_path*, int)': C:\cygwin\boost\v44\tools\quickbook\detail\input_path.cpp:80: error: `cygwin_con v_path_t' undeclared (first use this function) C:\cygwin\boost\v44\tools\quickbook\detail\input_path.cpp:80: error: (Each undec lared identifier is reported only once for each function it appears in.) C:\cygwin\boost\v44\tools\quickbook\detail\input_path.cpp:80: error: expected `; ' before "flags" C:\cygwin\boost\v44\tools\quickbook\detail\input_path.cpp:87: error: `flags' und eclared (first use this function) C:\cygwin\boost\v44\tools\quickbook\detail\input_path.cpp:87: error: `cygwin_con v_path' undeclared (first use this function) "g++" -ftemplate-depth-300 -O0 -fno-inline -Wall -g -g0 -DBOOST_ALL_NO_LIB= 1 -DBOOST_SYSTEM_STATIC_LINK=1 -I"../../.." -c -o "C:\cygwin\boost\v44\bin.v2\t ools\quickbook\gcc-3.4.4\debug\link-static\detail\input_path.o" "C:\cygwin\boost \v44\tools\quickbook\detail\input_path.cpp" ...failed gcc.compile.c++ ../../../bin.v2/tools/quickbook/gcc-3.4.4/debug/link-s tatic/detail/input_path.o... ...skipped <p../../../bin.v2/tools/quickbook/gcc-3.4.4/debug/link-static>quickbo ok.exe for lack of <p../../../bin.v2/tools/quickbook/gcc-3.4.4/debug/link-static >detail/input_path.o... See on the code I see that there is a test on QUICKBOOK_CYGWIN_1_5 which is not defined in any file. When I define it everything works as before. Should the user define QUICKBOOK_CYGWIN_1_5 when working on cygwin-1.5 ? Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 3

Re: [boost] [msm] on_entry must be implemented for every initial events for every states in substatemachines.
by Christophe Henry 02 Sep '10

02 Sep '10

> Hi All > > In the following little example see attachment, > I have a problem that in the RunningStateMachine::State2 the on_entry > function must be implemented with event1 and with event3 as well > but from the logic point of view there is no possibility to call > on_entry in RunningStateMachine::State2 with event1. > > actually at runtime there is no call is happening to to the function : > void on_entry(event1 const&,FSM& ) {std::cout << "entering: > State2:Event1" << std::endl;} > > but it must be defined and even implemented ( if no implementation > provided linker error occurs). > > Is it a restriction/bug or I'm missing something ? > It is only happening with initial events for substatemachines ? > Or is there a kind of pattern to know what events can enter exit a > state in a top of the ones present in the transition tables ?. > > Br. > Richie Hi, I don't find this entry function or a State2. Am I missing something or did you attach the wrong file? Regards, Christophe

2 2

Re: [boost] [msm] Boost MPL vector limit size exceeded
by Christophe Henry 01 Sep '10

01 Sep '10

Hi, Sorry for my late answer. > while building a state machine that also includes submachines, we exceeded > the possible max number of MPL vector entries (which is to 50 to my > knowledge) for transition tables. > Is there an easy way to solve that? > How to increase the max possible number of MPL vector entries? > > Do I have to manually create vector60.hpp and vector60_c.hpp? Or is there > something that generates all those files (also for larger vectors)? > > I also tried the define "BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS" with and > without specifing the define "FUSION_MAX_VECTOR_SIZE". > I tried the "favor_compile_time" vs "favor_runtime_speed" as well. > In both cases the MPL vector size was to small. I personally defined myself headers up to 100. It's pretty easy actually. I didn't try the scripts. Erik Nelson wrote: >I used the #defines > >BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS >BOOST_MPL_LIMIT_VECTOR_SIZE=60 > >For my whole project and it worked for me. I wasn't using MSM, though I just tried it and it seems to work. Thanks Erik :) BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS will only help you up to 50. FUSION_MAX_VECTOR_SIZE is only to increase the number of states defined in a state machine (under the hood, a fusion::set is used to contain all the states). > Does it actually mean, in case we use submachines, that MSM generates a > flat transition table including everything in one MPL vector? > Example: > Main state machine consiting of 10 transitions + 1 submachine consiting of > 5 transitions. > Do we than have a transition table with around 15 entries that are stored > somehow in an MPL vector of size 15? You should get a look at http://www.boost.org/doc/libs/1_44_0/libs/msm/doc/HTML/ch05.html MSM generates an entry inside the main table for every event found in the submachines. This avoids forwarding events which a submachine will never be able to process (performance improvement). Juraj Ivančić wrote: >Finally I gave up and used the kludge described in the post referenced >above. Meanwhile I managed to trim down the number of transitions in my >state machine and got back into vector50 bounds. I also think that you might want to see if you can reduce the number of transitions if you can, because soon the compile-time will start hurting. Regards, Christophe

2 1

[gil] Who has a big-endian machine?
by Christian Henning 01 Sep '10

01 Sep '10

Hi there, could someone with a big-endian machine run the following code with the latest gil code from the trunk? #include <cassert> #include <vector> #include <boost/gil/gil_all.hpp> using namespace boost; using namespace gil; int main() { typedef bit_aligned_image1_type< 3, gray_layout_t >::type gray3_image_t; typedef gray3_image_t image_t; typedef image_t::view_t view_t; typedef view_t::reference ref_t; typedef bit_aligned_pixel_iterator< ref_t > iterator_t; std::vector< unsigned char > buf( 4 ); // bit pattern is: 1011 0110 0110 1101 1101 1011 // each byte is read right to left buf[0] = 182; buf[1] = 109; buf[2] = 219; iterator_t it( &buf[0], 0 ); ref_t p1 = *it; it++; ref_t p2 = *it; it++; ref_t p3 = *it; it++; ref_t p4 = *it; it++; ref_t p5 = *it; it++; ref_t p6 = *it; it++; ref_t p7 = *it; it++; ref_t p8 = *it; it++; unsigned char v1 = get_color( p1, gray_color_t() ); unsigned char v2 = get_color( p2, gray_color_t() ); unsigned char v3 = get_color( p3, gray_color_t() ); unsigned char v4 = get_color( p4, gray_color_t() ); unsigned char v5 = get_color( p5, gray_color_t() ); unsigned char v6 = get_color( p6, gray_color_t() ); unsigned char v7 = get_color( p7, gray_color_t() ); unsigned char v8 = get_color( p8, gray_color_t() ); // all values should be 110b ( 6 ); assert( v1 == 6 ); assert( v2 == 6 ); assert( v3 == 6 ); assert( v4 == 6 ); assert( v5 == 6 ); assert( v6 == 6 ); assert( v7 == 6 ); assert( v8 == 6 ); return 0; } Thanks ahead, Christian

2 1

Re: [boost] [gsoc] Boost.Process done
by Adam Merz 01 Sep '10

01 Sep '10

Boris Schaeling <boris <at> highscore.de> writes: <snip> > If there are other ideas how to generate a unique name I can update the code > (Windows provides an API to generate UUIDs but unfortunately it requires COM; > on POSIX systems I'm not aware of any system function which could generate > UUIDs). > > Boris For Windows, Neither UuidCreate nor UuidCreateSequential require COM. Are these not generally suitable for your needs?

3 5

[function_types]howto rebuild components_impl/arityXX_Y.hpp?
by Larry Evans 01 Sep '10

01 Sep '10

trunk/boost/function_types/detail/components_impl has several arityXX_Y.hpp files which use vectorN templates. I want to replace vectorN with just vector. >From looking at libs/function_types/build/Jamfile, I guessed that replacing that with the attached Jamfile and attached master.hpp file would do the job; however, All I get is: [CUT_HERE] -*- mode: compilation; default-directory: "~/prog_dev/boost-svn/ro/boost_1_44_0/sandbox/rw/variadic_templates/libs/function_types/build/" -*- Compilation started at Wed Sep 1 13:01:38 bjam sh: icpc: not found BOOST_ROOT=/home/evansl/prog_dev/boost-svn/ro/boost_1_44_0 ...found 1 target... Compilation finished at Wed Sep 1 13:01:40 {/CUT_HERE] How do I replace vectorN with vector in the arityXX_Y.hpp files? -regards, Larry

1 0

[phoenix3] Conflict with fusion::at and stl::at
by Denis Taniguchi 01 Sep '10

01 Sep '10

Hi, The following code doesn't seem to compile, with phoenix3 trunk (revision 65168): #include <boost/phoenix/stl/container.hpp> #include <boost/phoenix/fusion/at.hpp> int main() { return 0; } Since it's a design issue (both fusion::at and stl::at are visible in boost::phoenix), I'm not submitting a patch. Best regards, Denis

1 0

Re: [boost] Is Boost-CMake Dead or Alive?
by Vladimir Prus 01 Sep '10

01 Sep '10

Eric Niebler wrote: [moving to -devel, where it really belongs] > On 8/28/2010 3:12 AM, Vladimir Prus wrote: >> David Abrahams wrote: >>> At Thu, 26 Aug 2010 13:41:46 -0400, Eric Niebler wrote: >>>> >>>> Even if we achieve our vision, it's not clear that Boost as an >>>> organization will adopt it. >>> >>> <ahem> >>> >>> A small correction: even *when* we achieve our vision, there's no >>> *guarantee* that Boost will adopt it. >>> >>> [But Boost will adopt it. Just promise not to sue us in case they >>> don't :-)] >> >> I find the above statement to be a very interesting advertisement approach >> for a project that addresses requirements that were never discussed on >> this list, and which itself was never discussed much. In fact, this statement >> sounds like you have made some secret arrangements (*), or even that you had >> some revelation from supernatural powers -- which is probably not what you >> was going to communicate. >> >> I think Eric statement is much more balanced. >> >> - Volodya >> >> (*) In fact, ryppl gave an impression of some secret arrangements from the >> very start. > > Dave was expressing confidence about the value of our work, no more. > There have been no secrets and no back-room negotiations. Eric, unfortunately, I must have been taught either wrong English or wrong logic, because surely "I am confident that XXX will YYY" conveys quite a different meaning than "XXX will YYY". While now and here, you can clarify the meaning, I doubt you'll be around when any given person reads such statements in his email client. And of course, when a representative of a third party having commercial interest in the matter makes public statements to the effect "XXX will YYY" (without any "I am confident" qualifier (*), this surely makes the matter look even more suspicious. > Boost's > scalability problems have been discussed endlessly here and in open > sessions at BoostCon, I think "endlessly" is a very accurate word here. The discussions have failed to clarify, prioritize, or even list the issues. Say, recently Dave has announced that he'll no longer maintains his libraries (**) because SVN is slow and library organization is a "mess". While other folks agree that there are some issues, they don't seem to have that drastic effects in general. That thread has died, and we still don't know why SVN performance (and other issues) is enough to make one person stop maintaining his libraries completely, while another person is happy to have extra latte while SVN does one-a-quarter merge to release branch. > but no decisions about Boost's future were made or > will be made by fiat. Boost doesn't work that way. > > It's true that the requirements of, or even the need for, ryppl was not > debated here on this list. But that's how most Boost libraries start. > Someone has a vision and builds a thing. Then they bring it to Boost and > it's improved and accepted or rejected. Trying to get quorum on a thing > that isn't built yet is just hard. "If you build it, they will come" -- > so we hope. It is clear that each project involves a vision (very hard to share), design (somewhat shareable) and review (share as you like). And it's perfectly fine to have a vision that involves fixing all issues with Boost development that you are aware of. However, saying "Boost will adopt ryppl, no we won't bother to even list the issues it will fix" sound bizarre -- because it's an attempt to share a vision -- which is not shareable. - Volodya (*) Check recent boost-cmake postings for an example. In fact, said party even has marketing materials which *already* mentions Boost. (**) http://old.nabble.com/Maintenance-suspended-td29100510.html

2 1

[PropertyTree] i18n Bug in the build-in rapidxml XML parser
by 卓强 ZHUO Qiang 01 Sep '10

01 Sep '10

Hi All, I have encounter an bug in Boost.PropertyTree and submit a patch to fix this bug 3 month ago: https://svn.boost.org/trac/boost/ticket/4340 Below is a brief description: ---------------------------------------------------------- boost::property_tree::read_xml(wistream&, wptree&) throw exception if tag/value/attribute has a unicode with '\0' inside, for example, for unicode char L'\u4E00', an exception will be throw because the parser treat L'\u4E00' as '\0'. The following test case reproduce the bug: BOOST_AUTO_TEST_CASE(test_i18n_xml_tag_name) { wistringstream in(L"<\u4E00>abc</\u4E00>"); property_tree::wptree pt; BOOST_REQUIRE_NO_THROW(property_tree::read_xml(in, pt)); BOOST_CHECK(L"abc" == pt.get<wstring>(L"\u4E00")); } ---------------------------------------------------------------- This ticket have been sleeping for 3 month, I'm wondering if someone could help review it and apply the patch to the trunk or just fix it in another way. More generally, what's the boost policy for maintain the existing library, especially regarding for the bug fix. Best Regards, Qiang http://zhuoqiang.me

1 0