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

Re: [boost] [graph] out_edges sort
by fabien.castan＠free.fr 09 Sep '10

09 Sep '10

> There is no way to do a sort in place ? >> Not using the "official" interfaces, AFAIK. What are you trying to do? >> Maybe there's a different algorithm in BGL that might do what you want. I compute some values on each node, depending on connected vertices, etc. Next I need to visit my graph in a dfs but going first into out_edges with the biggest precomputed value.

2 1

Re: [boost] As a side note about source control
by Eric Hopper 09 Sep '10

09 Sep '10

Christoph Heindl wrote: > > As a side note, and I'm sure I'm opening a can of worms by even saying > > this... I find working on projects that do not use distributed source > > control to be really irritating nowadays. > > Could you explain why? What kind of projects (organizational structure). Well, the organizational structure of the project doesn't matter at all in my answer to the question. I will describe to you what I did with the Boost library in order to explain. I wanted to generate a whole ton of small random numbers quickly and found the smallint distribution. When I looked at the code, I was certain I could make something a lot faster that was very specific to my need, so I did, tested it and discovered that it was indeed much faster. Then I realized that by carefully using templates I could make it work for a much more general case. Now I want to make something that's a library module. I morph my special case into a more general case as a proof of concept. When that works, I then consider how to integrate the library module into Boost because that's where it belongs. There are lots of different versions of Boost that have been released and are installed on the various systems I work on. Not only that, but regardless of whether or not Boost ever accepts my changes I want to keep them locally so I will always be able to have a version of Boost with my changes. If I simply check out one of the tags for a version of Boost I have, I can certainly make my changes there, but I can never check them in or effectively track them against Boost itself as it moves forward. I could check out trunk, but trunk does not correspond to any version of Boost installed on my system and means I would be testing all kinds of changes that may or may not be ready for use. I'm not interested in being a Boost tester. And again, I really couldn't check my changes in or effectively integrate them with later versions of Boost. I eventually settle on doing an svn export of several successive versions of Boost and checking each into Mercurial. This is complicated by the need to undo Subversion's keyword replacement with a small perl script. And actually converting the Boost Subversion tree to Mercurial isn't very feasible because Subversion's idea of branching is so dissimilar. For example, there are a few cases of a tag being removed and replaced with a fresh copy of trunk, and this is very hard to model in any other source control system. Once I've done this conversion, things are pretty smooth. I can check in all my changes to my local Mercurial clone. I can play around with things, do code cleanup and various other things while still being able to track my source. I can also do development on my desktop and laptop and move changes smoothly between them even though the changes are checked in when the laptop may not be connected to the Internet. Later I discover Boost 1.44 has been released, so I repeat the process I used before to convert 1.44.0.beta1 and 1.44.0 to Mercurial revisions. Then I use Mercurial's merge feature to merge my changes back in. Poof, I have a version of Boost that has my changes, and I can publish a patch against Boost 1.44 as opposed to 1.43 if need be. If Boost had used a distributed version control system from the very beginning, that previous 6 paragraphs could've been condensed down to a couple of paragraphs. And future merges with Boost would generally be pretty trivial unless the random library changed significantly. This is true of any project I want to make a change to. I do not want to have to interact especially with the community for a one off change to a project I'm not really interested in becoming a regular contributor to. A centralized source system makes it hard to make changes except on active branches which frequently contain changes I'm not interested in testing. It makes it hard to track my changes locally regardless of the decisions of the community running the project. And it makes it hard to contribute a change back to the community when I don't want to become a full member, which in turn raises a barrier to entry to me being inexorably sucked into a community I didn't think I was going to participate in. All of these are regardless of the organizational structure of a project. They have everything to do with my ability to control and use the source code I download. Simply put, distributed source control is what fits the Open Source development model. I do not consider this an opinion so much as a flat statement of fact. The ability to fork is absolutely central to Open Source. It's harder to fork when you lose the history and ability to track changes against the original because a project's history and ability to track your changes to it is as important as a dump of the source code at a moment in time, if not more so. Distributed source control avoids these problems and makes forking easier, almost trivial. Distributed source control therefor fits the Open Source model better. In my opinion, distributed source control is the best fit for almost any development. But that's just my opinion, and I don't have nearly as much in the way of hard logical argument to back that up. I just know that I've used source control for nearly (and I'm rather embarassed that the word 'nearly' is there, but a 17 yr old in 1988 isn't likely to have heard of source control) as long as I've been a professional programmer. And distributed source control systems are the first source control systems I've used where I didn't feel like I was spending a lot of time fighting the source control system because it didn't work the way I needed it to. Discipline does not always require pain. -- A word is nothing more or less than the series of historical connotations given to it. That's HOW we derive meaning, and to claim that there is an arbitrary meaning of words above and beyond the way people use them is a blatant misunderstanding of the nature of language. -- Anonymous blogger -- Eric Hopper (hopper(a)omnifarious.org http://www.omnifarious.org/~hopper)--

5 4

Re: [boost] Status of FSM viewer
by Michal Sojka 09 Sep '10

09 Sep '10

Hi Andreas, thanks for the prompt answers. See my comments bellow. On Thu, 09 Sep 2010, Andreas Huber wrote: > > we are looking for a solution to visualize FSMs in our robotic > > applications. Before starting the development of our own tool I'd > > like to ask whether there exists something able to visualize > > Boost.Statecharts FSMs. > > No, as far as I know. > > > I was only able to find the > > following GSOC > > project: > [snip links] > > but in my quick tests it produced only empty figures. I > > believe that > > after some debugging I could make it work. > > Personally I wouldn't bother. IIRC, the project depends on GCC_XML, > the latest release of which is still 0.6, from 2004. There is activity > in source control but I'm not sure it has anything to do with the > tool. > > > My question is whether the development of this tool continues or > > whether there are some other tools. In case of negative answers, do > > you have any suggestions for the development of the new tool? > > Currently, we consider the development of a GCC plugin which will > > generate dot (graphviz) source. > > I don't know anything about GCC plugins, but I guess that is certainly > an option. Personally, I'd also check out clang, which presumably can > provide you with a much more C++-like representation of the parsed > source code. I had also thought about using clang but I was not able to compile even simple FSMs with it. I produced a lot of strange errors. I guess that clang's C++ support is not as mature as of GCC. Do you have more positive experience with clang++? > P.S. If you make your tool public, I'd love to be informed when you > have a first version to check out. Thanks! A student of mine will work on this in his bachelor thesis so the tool will definitely be public. If we have something that works, I'll let you know. Cheers, -Michal

4 3

[iostreams][1.44] file_descriptor constructor deprecated
by Hartmut Kaiser 09 Sep '10

09 Sep '10

Hey, Why has the iostreams::file_descriptor constructor taking a file descriptor (OS handle) being deprecated (BOOST_IOSTREAMS_USE_DEPRECATED)? This seems to be somewhat counter-intuitive to me. Even more as our code depends on this functionality and I see no way to rewrite it in order to accommodate for this change (we're wrapping a pipe handle here). The worst is that defining BOOST_IOSTREAMS_USE_DEPRECATED while compiling our application makes the compilation succeed, but linking fails as this function has not been compiled by default into the iostreams library. Regenerating the boost libraries is not an option for us, as we need to rely on pre-installed libraries most of the time (HPC systems have their own weird rules...). Any ideas? Regards Hartmut --------------- http://boost-spirit.com

2 2

[filesystem][v3] Fixed-size char array constructor
by Richard Hazlewood 09 Sep '10

09 Sep '10

The v3 path has a constructor/converter that takes a fixed-size char array. It uses the size of the array to determine the characters to use in the path. This can have unintended consequences for use cases like the following (common with Windows system calls): namespace bfs = boost::filesystem; bfs::path GetTemporaryPath() { // (Okay, it may be tidier to use allocated char* buffers for // these type of calls, but this approach is not unusual.) char buf[MAX_PATH]; GetTempPath(sizeof(buf) / sizeof(buf[0]), buf); return bfs::path(buf); //return bfs::path(&buf[0]); //work-around } The path that is returned contains all of the MAX_PATH characters, even though the system call does not fill all of these. It appears that the constructor assumes the array is null-terminated because it subtracts one. I presume this is to work with cases such as: char const buf[] = "mypath/myfile"; return bfs::path(buf); However, the null-terminator may not be the last char, as in the case given.

1 0

Status of FSM viewer
by Andreas Huber 09 Sep '10

09 Sep '10

Hi Michal > we are looking for a solution to visualize FSMs in our > robotic > applications. Before starting the development of our own > tool I'd like > to ask whether there exists something able to visualize > Boost.Statecharts FSMs. No, as far as I know. > I was only able to find the > following GSOC > project: [snip links] > but in my quick tests it produced only empty figures. I > believe that > after some debugging I could make it work. Personally I wouldn't bother. IIRC, the project depends on GCC_XML, the latest release of which is still 0.6, from 2004. There is activity in source control but I'm not sure it has anything to do with the tool. > My question is whether the development of this tool > continues or whether > there are some other tools. In case of negative answers, do > you have any > suggestions for the development of the new tool? Currently, > we consider > the development of a GCC plugin which will generate dot > (graphviz) > source. I don't know anything about GCC plugins, but I guess that is certainly an option. Personally, I'd also check out clang, which presumably can provide you with a much more C++-like representation of the parsed source code. HTH, -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header.

1 0

[graph] dfs depending on VertexList container
by fabien.castan＠free.fr 09 Sep '10

09 Sep '10

Hi, We can't use the easiest syntax of dfs, if we use another container than vecS as VertexList container. boost::depth_first_search( graph, boost::visitor( vis ) ); So the only way is to initialize the colormap ourself and give it to the depth_first_search function. The problem is that the dfs use operator[]. I looked at the code and if I understand correctly, it seems that this operator is only use to init the colormap. Best regards, Fabien Castan

3 3

[graph] out_edges sort
by fabien.castan＠free.fr 09 Sep '10

09 Sep '10

Hi, I would like to visit my graph in a particular order using a dfs visitor. To do this I tried to order the out_edges of each node. I use the std sort function, like this: GraphContainer::out_edge_iterator oe_it, oe_itEnd; boost::tie( oe_it, oe_itEnd ) = boost::out_edges( vd, graph ); std::sort( oe_it, oe_itEnd, OrderEdge<GraphContainer>(graph) ); But it does nothing. It seems that there is an empty operator= on out_edge_descriptor. So, how can I sort the out_edges ? Best regards, Fabien Castan

3 3

What about a Spirit-powered C++ syntax analysis library in Boost?
by Florian Goujeon 08 Sep '10

08 Sep '10

Hi Boosters, I've written a C++ syntax analysis library using Boost.Spirit. (This 'library' is actually a subset of the Scalpel library. I talked about it in the Boost mailing list here: http://article.gmane.org/gmane.comp.lib.boost.devel/208217 ) For the sake of brevity, let's call it Salsa (for Stand-ALone Syntax Analysis). While most C++ compilers need semantic information to perform the syntax analysis, Salsa is a standalone syntax analyzer. Its Spirit grammar doesn't run any semantic action. Consequently, you can use it to parse some C++ code without having to analyze a whole translation unit (i.e. without processing #include directives). At this point, you may wonder how syntax ambiguities are managed. In most cases, there's always an interpretation which is more obvious than the other one(s). In all cases, you may reasonably ask the programmer to disambiguate its code. Whatever the case, Salsa (predictably) chooses one of the interpretations. Here are some examples: The following statement…: a * b; … may be either a multiplication or a pointer declaration. The default interpretation is the pointer declaration. You can reasonably ask the programmer to disambiguate the code by putting parenthesis if he wants the syntax analyzer to interpret it as the former: (a * b); Trickier. In the following declaration…: bool bool_ = a< b || c> (d&& e); … the right-hand side expression may be either a boolean expression (where 'a', 'b', 'c', 'd' and 'e' are variables of type bool) or a function template call (whose name is 'a', which takes one bool template parameter and where 'b', 'c', 'd' and 'e' are all variables of type const bool). The default interpretation is the boolean expression. Once again, you can reasonably ask the programmer to disambiguate the code by putting parenthesis if he wants Salsa to interpret it as the latter: bool bool_ = a< (b || c)> (d&& e); (Actually, I wonder why the standard allows such ambiguities.) Note: Salsa isn't finalized yet, but it successfully parses Apache's implementation of the C++ standard library. I'd like to know: is there a reasonable chance that such a library will be accepted into Boost?

3 2

[preprocessor] missing IS_EMPTY documentation?
by Lorenzo Caminiti 08 Sep '10

08 Sep '10

Hello all, Is there a reason why `BOOST_PP_IS_EMPTY()` is not part of Boost.Preprocessor reference documentation? 1) I think this macro is part of the library public API because it is in <boost/preprocessor/facilities/is_empty.hpp> (outside the "detail/" directory and same location as `BOOST_PP_EMPTY` which is documented). 2) Is it OK to use `PP_IS_EMPTY()` to check if a macro expansion is actually empty or not? For example: #include <boost/preprocessor/facilities/empty.hpp> #include <boost/preprocessor/facilities/is_empty.hpp> #define X /* expand to nothing */ #define Y BOOST_PP_EMPTY #define Z a b c BOOST_PP_EMPTY BOOST_PP_IS_EMPTY(X) // expand to 1 BOOST_PP_IS_EMPTY(Y()) // expand to 1 BOOST_PP_IS_EMPTY(Y) // expand to 0 BOOST_PP_IS_EMPTY(Z()) // expand to 0 Thank you for the clarification. -- Lorenzo

3 5

Status of FSM viewer
by Michal Sojka 08 Sep '10

08 Sep '10

Dear Andreas and others, we are looking for a solution to visualize FSMs in our robotic applications. Before starting the development of our own tool I'd like to ask whether there exists something able to visualize Boost.Statecharts FSMs. I was only able to find the following GSOC project: http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summe… http://www.boost.org/community/gsoc_2006_boost_overview.html#accepted_proje… and its result: http://svn.boost.org/svn/boost/sandbox/SOC/2006/fsm-viewer/trunk/src/ but in my quick tests it produced only empty figures. I believe that after some debugging I could make it work. My question is whether the development of this tool continues or whether there are some other tools. In case of negative answers, do you have any suggestions for the development of the new tool? Currently, we consider the development of a GCC plugin which will generate dot (graphviz) source. Best regards, Michal Sojka

1 0

Adam/Eve DSEL - Re: De Bruijn Bind (alternate bind syntax) Interest?
by Gottlob Frege 08 Sep '10

08 Sep '10

On Tue, Sep 7, 2010 at 1:24 PM, Smith, Jacob N <jacob.n.smith(a)intel.com> wrote: > > For an Adam/Eve DSEL in C++ we used this syntax: > > sheet save_file = > "save_file" == sheet > { > interface == section > { > var{"file_name"} == [](arg_map args){ return any(""); }, > var{"file_type"} == "txt", > (var{"password"} <= (var{"file_type"}, var{"password1"})) == > [](arg_map args) > { > return args.get<string>("file_type") == "txt" ? any("") : args["password1"]; > } > // more constraints > }, > output == section > { > // more constraints > }, > invariant == section > { > // more constraints > } > }; > Interesting. At Adobe we had a DSEL that looked something like (from memory): dialog(name = "Clipping Path") [ column(child_horizontal = align_fill) [ popup(name = "Path:", bind = &path, items = list [ item(name = "None", value = empty), item(name = "Path 1", value = 1), item(name = "Path 2", value = 2) ]), edit_number(name = "Flatness:", digits = 9, bind = &flatness) ], button(name = "OK", dephault = true, bind = &result) ]; Or something like that. Of course we didn't have C++0x at the time. Tony

1 0

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

07 Sep '10

>Here is a little example I use favor_compile_time, (see attachment) > >But msm still tries to fold recursively all sub state machines states >in to 1 big mpl vector. > >As you said in your last mail : > >>Yes, it would work but I think I remember you mentioning boost::any >>not being an option. If boost::any and the performance loss are >>acceptable for you then it would probably help. > >It would be possible to overcome this problem by using >favor_compile_time but it seems apparently not :(. It seems I didn't read correctly and thus gave an unclear answer. The problem I was talking about was the compile-time. So, if you allow, 2nd try: The favor_compile_time policy will still fold all the transitions inside a big mpl::vector, at least for the moment. I already started a new version of the policy improving this too but didn't finish it yet as the problem I was trying to improve (Jeff Flinn's exploding compile-time) went away so there was not a big demand for it. So, again, yes, the policy still makes one big vector, but it's not so much of a problem any more because the compile-times are greatly reduced by the policy. So, increasing the mpl::vector size does not hurt so much any more. Sorry for the confusion. Regards, Christophe

1 0

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

07 Sep '10

>> I personally defined myself headers up to 100. It's pretty easy actually. > Can you provide us the files that we don't have to do it ? We did it for 60 now. Sure (provided this is not rejected). I tried with 1.42. > We have problems that the compiler runs out of heap if we include too > many transitions as well. Juraj told me not long ago (but too late to make it into the 1.44 doc) that specifying LESS heap for VC (I think it is the Zm option) actually works better than increasing it. You could try it and see if that helps. > But our state machines are complex in our interfaces we have over 100 > different events. > We have several main state machines whit 3 level deep substate > machines and around 10 substate machines altogether at the moment, > but actually as our feature list is growing with the current design > we are planning to add more and more substate machines to the system. > So we run out of 50 transitions in the main state machine pretty fast.:(. > > If we would split the implementation to several main sate machines we > would loose the nice features we gain with hierarchical approach. > > Is it not possible to use favor_compile_time feature or something > similar as described in > http://www.boost.org/doc/libs/1_44_0/libs/msm/doc/HTML/ch03s05.html#d0e3642 > to avoid using the performance improvement and have the substate > machines to dispatch all events again in them this would allow as to > continue with our implementation because none of our transaction table > contains more than 50 entries alone. Yes, it would work but I think I remember you mentioning boost::any not being an option. If boost::any and the performance loss are acceptable for you then it would probably help. Regards, Christophe

2 3

Status of Python 3 support for Boost.MPI?
by Steve M. Robbins 07 Sep '10

07 Sep '10

Hi, I just tried to build boost 1.44 using Python 3.1 and two files in mpi failed to compile. Is this easy to fix? "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -g -D_REENTRANT -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_MPI_DYN_LINK=1 -DBOOST_MPI_PYTHON_DYN_LINK=1 -DBOOST_PYTHON_DYN_LINK=1 -DNDEBUG -I"." -I"/usr/include/python3.1" -I"/usr/lib/openmpi/include" -I"/usr/lib/openmpi/include/openmpi" -c -o "bin.v2/libs/mpi/build/gcc-4.4.5/release/debug-symbols-on/python-3.1/threading-multi/python/datatypes.o" "libs/mpi/src/python/datatypes.cpp" In file included from ./boost/python/detail/wrap_python.hpp:50, from ./boost/python/detail/prefix.hpp:13, from ./boost/python/ssize_t.hpp:9, from ./boost/python/object.hpp:8, from ./boost/mpi/python/serialize.hpp:25, from libs/mpi/src/python/datatypes.cpp:13: /usr/include/python3.1/pyconfig.h:1117:1: warning: "_POSIX_C_SOURCE" redefined In file included from /usr/include/c++/4.4/x86_64-linux-gnu/bits/os_defines.h:39, from /usr/include/c++/4.4/x86_64-linux-gnu/bits/c++config.h:243, from /usr/include/c++/4.4/bits/stl_algobase.h:60, from /usr/include/c++/4.4/bits/stl_tree.h:62, from /usr/include/c++/4.4/map:60, from /usr/lib/openmpi/include/openmpi/ompi/mpi/cxx/mpicxx.h:36, from /usr/lib/openmpi/include/mpi.h:1886, from ./boost/mpi/config.hpp:20, from ./boost/mpi/python/config.hpp:15, from ./boost/mpi/python/serialize.hpp:23, from libs/mpi/src/python/datatypes.cpp:13: /usr/include/features.h:158:1: warning: this is the location of the previous definition In file included from ./boost/python/detail/wrap_python.hpp:50, from ./boost/python/detail/prefix.hpp:13, from ./boost/python/ssize_t.hpp:9, from ./boost/python/object.hpp:8, from ./boost/mpi/python/serialize.hpp:25, from libs/mpi/src/python/datatypes.cpp:13: /usr/include/python3.1/pyconfig.h:1139:1: warning: "_XOPEN_SOURCE" redefined In file included from /usr/include/c++/4.4/x86_64-linux-gnu/bits/os_defines.h:39, from /usr/include/c++/4.4/x86_64-linux-gnu/bits/c++config.h:243, from /usr/include/c++/4.4/bits/stl_algobase.h:60, from /usr/include/c++/4.4/bits/stl_tree.h:62, from /usr/include/c++/4.4/map:60, from /usr/lib/openmpi/include/openmpi/ompi/mpi/cxx/mpicxx.h:36, from /usr/lib/openmpi/include/mpi.h:1886, from ./boost/mpi/config.hpp:20, from ./boost/mpi/python/config.hpp:15, from ./boost/mpi/python/serialize.hpp:23, from libs/mpi/src/python/datatypes.cpp:13: /usr/include/features.h:160:1: warning: this is the location of the previous definition libs/mpi/src/python/datatypes.cpp: In function ‘void boost::mpi::python::export_datatypes()’: libs/mpi/src/python/datatypes.cpp:20: error: ‘PyInt_Type’ was not declared in this scope In file included from ./boost/function/detail/prologue.hpp:17, from ./boost/function/function_template.hpp:13, from ./boost/function/detail/maybe_include.hpp:13, from ./boost/function/function0.hpp:11, from ./boost/python/errors.hpp:13, from ./boost/python/handle.hpp:11, from ./boost/python/converter/arg_to_python_base.hpp:7, from ./boost/python/converter/arg_to_python.hpp:14, from ./boost/python/call.hpp:15, from ./boost/python/object_core.hpp:14, from ./boost/python/object.hpp:9, from ./boost/mpi/python/serialize.hpp:25, from libs/mpi/src/python/datatypes.cpp:13: ./boost/function/function_base.hpp: In static member function ‘static void boost::detail::function::functor_manager_common<Functor>::manage_small(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<bool>]’: ./boost/function/function_base.hpp:360: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, mpl_::true_) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<bool>]’ ./boost/function/function_base.hpp:406: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, boost::detail::function::function_obj_tag) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<bool>]’ ./boost/function/function_base.hpp:434: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manage(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<bool>]’ ./boost/function/function_template.hpp:913: instantiated from ‘void boost::function3<R, T1, T2, T3>::assign_to(Functor) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<bool>, R = void, T0 = boost::mpi::packed_oarchive&, T1 = const boost::python::api::object&, T2 = const unsigned int]’ ./boost/function/function_template.hpp:722: instantiated from ‘boost::function3<R, T1, T2, T3>::function3(Functor, typename boost::enable_if_c<boost::type_traits::ice_not::value, int>::type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<bool>, R = void, T0 = boost::mpi::packed_oarchive&, T1 = const boost::python::api::object&, T2 = const unsigned int]’ ./boost/mpi/python/serialize.hpp:276: instantiated from ‘void boost::python::detail::direct_serialization_table<IArchiver, OArchiver>::register_type(const T&, PyTypeObject*) [with T = bool, IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive]’ ./boost/mpi/python/serialize.hpp:389: instantiated from ‘void boost::python::register_serialized(const T&, PyTypeObject*) [with IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive, T = bool]’ ./boost/mpi/python/serialize.hpp:534: instantiated from ‘void boost::mpi::python::register_serialized(const T&, PyTypeObject*) [with T = bool]’ libs/mpi/src/python/datatypes.cpp:21: instantiated from here ./boost/function/function_base.hpp:321: warning: dereferencing type-punned pointer will break strict-aliasing rules ./boost/function/function_base.hpp:325: warning: dereferencing type-punned pointer will break strict-aliasing rules ./boost/function/function_base.hpp: In static member function ‘static void boost::detail::function::functor_manager_common<Functor>::manage_small(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<bool>]’: ./boost/function/function_base.hpp:360: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, mpl_::true_) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<bool>]’ ./boost/function/function_base.hpp:406: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, boost::detail::function::function_obj_tag) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<bool>]’ ./boost/function/function_base.hpp:434: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manage(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<bool>]’ ./boost/function/function_template.hpp:913: instantiated from ‘void boost::function3<R, T1, T2, T3>::assign_to(Functor) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<bool>, R = void, T0 = boost::mpi::packed_iarchive&, T1 = boost::python::api::object&, T2 = const unsigned int]’ ./boost/function/function_template.hpp:722: instantiated from ‘boost::function3<R, T1, T2, T3>::function3(Functor, typename boost::enable_if_c<boost::type_traits::ice_not::value, int>::type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<bool>, R = void, T0 = boost::mpi::packed_iarchive&, T1 = boost::python::api::object&, T2 = const unsigned int]’ ./boost/mpi/python/serialize.hpp:276: instantiated from ‘void boost::python::detail::direct_serialization_table<IArchiver, OArchiver>::register_type(const T&, PyTypeObject*) [with T = bool, IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive]’ ./boost/mpi/python/serialize.hpp:389: instantiated from ‘void boost::python::register_serialized(const T&, PyTypeObject*) [with IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive, T = bool]’ ./boost/mpi/python/serialize.hpp:534: instantiated from ‘void boost::mpi::python::register_serialized(const T&, PyTypeObject*) [with T = bool]’ libs/mpi/src/python/datatypes.cpp:21: instantiated from here ./boost/function/function_base.hpp:321: warning: dereferencing type-punned pointer will break strict-aliasing rules ./boost/function/function_base.hpp:325: warning: dereferencing type-punned pointer will break strict-aliasing rules ./boost/function/function_base.hpp: In static member function ‘static void boost::detail::function::functor_manager_common<Functor>::manage_small(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<double>]’: ./boost/function/function_base.hpp:360: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, mpl_::true_) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<double>]’ ./boost/function/function_base.hpp:406: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, boost::detail::function::function_obj_tag) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<double>]’ ./boost/function/function_base.hpp:434: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manage(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<double>]’ ./boost/function/function_template.hpp:913: instantiated from ‘void boost::function3<R, T1, T2, T3>::assign_to(Functor) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<double>, R = void, T0 = boost::mpi::packed_oarchive&, T1 = const boost::python::api::object&, T2 = const unsigned int]’ ./boost/function/function_template.hpp:722: instantiated from ‘boost::function3<R, T1, T2, T3>::function3(Functor, typename boost::enable_if_c<boost::type_traits::ice_not::value, int>::type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_saver<double>, R = void, T0 = boost::mpi::packed_oarchive&, T1 = const boost::python::api::object&, T2 = const unsigned int]’ ./boost/mpi/python/serialize.hpp:276: instantiated from ‘void boost::python::detail::direct_serialization_table<IArchiver, OArchiver>::register_type(const T&, PyTypeObject*) [with T = double, IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive]’ ./boost/mpi/python/serialize.hpp:389: instantiated from ‘void boost::python::register_serialized(const T&, PyTypeObject*) [with IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive, T = double]’ ./boost/mpi/python/serialize.hpp:534: instantiated from ‘void boost::mpi::python::register_serialized(const T&, PyTypeObject*) [with T = double]’ libs/mpi/src/python/datatypes.cpp:22: instantiated from here ./boost/function/function_base.hpp:321: warning: dereferencing type-punned pointer will break strict-aliasing rules ./boost/function/function_base.hpp:325: warning: dereferencing type-punned pointer will break strict-aliasing rules ./boost/function/function_base.hpp: In static member function ‘static void boost::detail::function::functor_manager_common<Functor>::manage_small(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<double>]’: ./boost/function/function_base.hpp:360: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, mpl_::true_) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<double>]’ ./boost/function/function_base.hpp:406: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manager(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type, boost::detail::function::function_obj_tag) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<double>]’ ./boost/function/function_base.hpp:434: instantiated from ‘static void boost::detail::function::functor_manager<Functor>::manage(const boost::detail::function::function_buffer&, boost::detail::function::function_buffer&, boost::detail::function::functor_manager_operation_type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<double>]’ ./boost/function/function_template.hpp:913: instantiated from ‘void boost::function3<R, T1, T2, T3>::assign_to(Functor) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<double>, R = void, T0 = boost::mpi::packed_iarchive&, T1 = boost::python::api::object&, T2 = const unsigned int]’ ./boost/function/function_template.hpp:722: instantiated from ‘boost::function3<R, T1, T2, T3>::function3(Functor, typename boost::enable_if_c<boost::type_traits::ice_not::value, int>::type) [with Functor = boost::python::detail::direct_serialization_table<boost::mpi::packed_iarchive, boost::mpi::packed_oarchive>::default_loader<double>, R = void, T0 = boost::mpi::packed_iarchive&, T1 = boost::python::api::object&, T2 = const unsigned int]’ ./boost/mpi/python/serialize.hpp:276: instantiated from ‘void boost::python::detail::direct_serialization_table<IArchiver, OArchiver>::register_type(const T&, PyTypeObject*) [with T = double, IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive]’ ./boost/mpi/python/serialize.hpp:389: instantiated from ‘void boost::python::register_serialized(const T&, PyTypeObject*) [with IArchiver = boost::mpi::packed_iarchive, OArchiver = boost::mpi::packed_oarchive, T = double]’ ./boost/mpi/python/serialize.hpp:534: instantiated from ‘void boost::mpi::python::register_serialized(const T&, PyTypeObject*) [with T = double]’ libs/mpi/src/python/datatypes.cpp:22: instantiated from here ./boost/function/function_base.hpp:321: warning: dereferencing type-punned pointer will break strict-aliasing rules ./boost/function/function_base.hpp:325: warning: dereferencing type-punned pointer will break strict-aliasing rules ...failed gcc.compile.c++ bin.v2/libs/mpi/build/gcc-4.4.5/release/debug-symbols-on/python-3.1/threading-multi/python/datatypes.o... and "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -g -D_REENTRANT -pthread -fPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_MPI_DYN_LINK=1 -DBOOST_MPI_PYTHON_DYN_LINK=1 -DBOOST_PYTHON_DYN_LINK=1 -DNDEBUG -I"." -I"/usr/include/python3.1" -I"/usr/lib/openmpi/include" -I"/usr/lib/openmpi/include/openmpi" -c -o "bin.v2/libs/mpi/build/gcc-4.4.5/release/debug-symbols-on/python-3.1/threading-multi/python/py_environment.o" "libs/mpi/src/python/py_environment.cpp" libs/mpi/src/python/py_environment.cpp: In function ‘bool boost::mpi::python::mpi_init(boost::python::list, bool)’: libs/mpi/src/python/py_environment.cpp:53: error: cannot convert ‘char**’ to ‘wchar_t**’ for argument ‘2’ to ‘void PySys_SetArgv(int, wchar_t**)’ ...failed gcc.compile.c++ bin.v2/libs/mpi/build/gcc-4.4.5/release/debug-symbols-on/python-3.1/threading-multi/python/py_environment.o... Thanks, -Steve

1 0

Re: [boost] Domagoj Saric: "Re: [function] invoking without requiring boost::throw_exception"
by Peter Myerscough-Jackopson 07 Sep '10

07 Sep '10

From: "Peter Myerscough-Jackopson" <peter.myerscough-jackopson_at_[hidden]> Sent: Thursday, September 02, 2010 5:36 PM > I am using boost::function on an embedded platform, which requires me to > not use exceptions, and as commented in the thread associated with > > http://article.gmane.org/gmane.comp.lib.boost.devel/195351 > > I am checking that the function object contains a function before > calling it. There is therefore no need for the invocation of the > function to check if it is valid, but also there is no method circumvent > this checking, and therefore my program requires the definition of > boost::throw_exception, when really it is not needed. This is a concern > because I intend on compiling my code into a library and do not wish to > require the user to define boost::throw_exception, especially when I am > guaranteeing it isn't going to be called from this site. I liked the > idea of a templated NOP for the function library, but at the very least > an unchecked invocation method would be great, or a nop-if-empty > invocation method would be useful. If you are certain that neither you nor your users use or will use boost::throw_exception (to actually handle some other cases 'exceptional' cases in other parts of boost) then you can provide the definition yourself. I cannot know whether my users will invoke other parts of boost that may make use of boost::throw_exception because my code is being compiled up and provided as a (application support) library. Also, since I know that I will never call the function object when it is null, I don’t want to burden my users by requiring them to define a function that will never be called from my code. As it is currently I am resorting to mimicking the code that occurs after the check and I have put a check in to ensure the library is compiled with an exact version of boost, a poor/bad/nightmare work around, but it means my users don’t have to define throw_exception. As others have noted, a common idiom for using a boost function object is to check if it is non-empty prior to calling it, is it an unreasonable extension to add this call? I am aware TR1 has subsumed “function” and so it is probably not possible remove the if-clause, but adding an unchecked invoke has significant benefits, [unchecked_invoke(), might be a better name than purely invoke()]. Peter Dr Peter Myerscough-Jackopson - Principal Engineer Tel: +44 (0)23 8076 7808 Fax: +44 (0)23 8076 0602 Web: http://www.macltd.com/ <BLOCKED::http://www.macltd.com/> Email: peter.myerscough-jackopson(a)macltd.com <mailto:peter.myerscough-jackopson@macltd.com> MULTIPLE ACCESS COMMUNICATIONS LIMITED is a company registered in England at Delta House, The University of Southampton Science Park, Southampton, SO16 7NS, United Kingdom with Company Number 1979185 and VAT Number GB 411942866

4 3

[testing] strange failure
by Emil Dotchevski 06 Sep '10

06 Sep '10

Anyone has any idea how to interpret this log? http://www.boost.org/development/tests/trunk/developer/output/Sandia-darwin… Should I also file a ticket for the testing framework? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

3 2

[array] Invalid data: accessing 'elems'
by Mateusz Loskot 06 Sep '10

06 Sep '10

Hi, I compile a small test program using Visual C++ 10.0 (Visual Studio 2010 Premium) with static code analysis turned on (option /analyze): #include <boost/array.hpp> int main() { typedef int T; // short, char, etc. boost::array<T, 2> x; T a = x[0]; } and whichever integer type I use for T, the analyser throws similar reports every time: 1>------ Build started: Project: boost_array_test, Configuration: Debug Win32 ------ 1> boost_array_test.cpp 1>g:\workshop\boost\boost_test\array\boost_array_test.cpp(5): warning C4189: 'a' : local variable is initialized but not referenced 1>g:\dev\boost\_svn\trunk\boost\array.hpp(111): warning C6385: Invalid data: accessing 'elems', the readable size is '8' bytes, but '12' bytes might be read: Lines: 110, 111 1> G:\dev\boost\_svn\trunk\boost/array.hpp(109) : while compiling class template member function 'int &boost::array<T,N>::operator [](boost::array<T,N>::size_type)' 1> with 1> [ 1> T=int, 1> N=0x2 1> ] 1> boost_array_test.cpp(4) : see reference to class template instantiation 'boost::array<T,N>' being compiled 1> with 1> [ 1> T=int, 1> N=0x2 1> ] 1> boost_array_test.vcxproj -> G:\workshop\boost\boost_test\array\Debug\boost_array_test.exe ========== Build: 1 succeeded, 0 failed, 0 up-to-date, 0 skipped ========== Shall I report a ticket? No warnings are reported for the std::array provided with Visaul C++ 10.0. Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 3

[program options] msvc warning suppression
by Jürgen Hunold 06 Sep '10

06 Sep '10

Hi Volodya, I've finally started using Boost.ProgramOptions and found some annoying msvc warnings. Okay to apply the attached patch ? Those warnings are totally useless, as templates can not have a "dll- interface". Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! Ingenieurgesellschaft für * voice: ++49 511 262926 57 ! Verkehrs- und Eisenbahnwesen mbH * fax : ++49 511 262926 99 ! Lister Straße 15 * juergen.hunold(a)ivembh.de ! www.ivembh.de * * Geschäftsführer: ! Sitz des Unternehmens: Hannover * Prof. Dr.-Ing. Thomas Siefer ! Amtsgericht Hannover, HRB 56965 * PD Dr.-Ing. Alfons Radtke !

3 3

[multi_index] Multi-Index as fast running median solver
by Ryan Fogarty 05 Sep '10

05 Sep '10

I'm hoping to use multi-index' ordered_index (non-unique) to do a fast running median. Given a set of M numbers and a window size of N compute the medians (for each of M - N + 1 solutions). Here is my solution: template<typename T> class FastMedianSolver { private: // boost::multi_index does most of the heavy lifting for this FastMedianSolver. // This index is given both "sequence" and "tree" semantics. typedef typename boost::multi_index_container< T,indexed_by<sequenced<>,ordered_non_unique<identity<T> > > > SortedList; typedef typename SortedList::template nth_index<0> SeqIndex; typedef typename SeqIndex::type SIndex; typedef typename SortedList::template nth_index<1> TreeIndex; typedef typename TreeIndex::type TIndex; SortedList mQueue; const size_t mSize; const size_t mHalfSize; public: typedef typename SIndex::iterator iterator; /** * Create a FastMedianSolver with queue size as argument * * @param size - size of the queue. */ // Note: fast divide by 2 is: X >> 1 FastMedianSolver(size_t size) : mSize(size), mHalfSize(size >> 1) {} /** * insert a value into the median queue */ void insert(const T& value) { mQueue.push_front(value); if(mQueue.size() > mSize) mQueue.pop_back(); } /** * Get the median for the elements within the queue. Note: * the algorithm requires a full queue, o.w. may throw an exception. */ const T& getMedian() { // Ensure queue is filled up before we ask for median! assert((mQueue.size() >> 1) == mHalfSize); typename TIndex::iterator tNdx(mQueue.get<1>().begin()); // Now grab the median element // Note that unfortunately the root() node is not exposed so the only way to get the central node // is to iterate to it :( (this will incur a O(N) operation on this function which is a little unfortunate for(int i = 0; i < mHalfSize; ++i,++tNdx); // This would be better if it were available and accurate! // typename TIndex::iterator tNdx(mQueue.get<1>().beginAtRoot()); // TODO: Check if we need to average the output of 2 positions if mSize is even return *tNdx; } }; Note, that to get to the central node I just iterate the ordered list half way through set: for(int i = 0; i < mHalfSize; ++i,++tNdx); However, what I was hoping was that I could get the root node directly. ordered_index doesn't expose an iterator to root() so I put it in ordered_index.hpp as: iterator beginAtRoot(){return make_iterator(root());} However, this isn't working out because the tree isn't always balanced. My question is 2-fold is there any way to force the internal red-black tree to stay balanced; and secondly, would that have an appreciable performance penalty. Thank you, Ryan

2 1

[gsoc] mentor summit
by Andrew Sutton 05 Sep '10

05 Sep '10

If you weren't a mentor for the 2010 Google Summer of Code, you can stop reading now. It looks like the mentor summit will be on October 23-24. If you are interested in attending, now is the time to speak up. Boris Schaeling has already expressed interest in going, and I would also like to attend. Anybody else? Google will only reimburse two trips (up to $2000, I think). If you happen to live in the Mountain View/San Jose area, you could probably just show up (with registration). Andrew Sutton asutton(a)cs.tamu.edu

1 0

[function] invoking without requiring boost::throw_exception
by Peter Myerscough-Jackopson 05 Sep '10

05 Sep '10

Dear all, I am using boost::function on an embedded platform, which requires me to not use exceptions, and as commented in the thread associated with http://article.gmane.org/gmane.comp.lib.boost.devel/195351 I am checking that the function object contains a function before calling it. There is therefore no need for the invocation of the function to check if it is valid, but also there is no method circumvent this checking, and therefore my program requires the definition of boost::throw_exception, when really it is not needed. This is a concern because I intend on compiling my code into a library and do not wish to require the user to define boost::throw_exception, especially when I am guaranteeing it isn't going to be called from this site. I liked the idea of a templated NOP for the function library, but at the very least an unchecked invocation method would be great, or a nop-if-empty invocation method would be useful. A simple addition of the following would assist to some extend : result_type invoke(BOOST_FUNCTION_PARMS) const { return get_vtable()->invoker (this->functor BOOST_FUNCTION_COMMA BOOST_FUNCTION_ARGS); } With maybe a comment next to result_type operator()(BOOST_FUNCTION_PARMS) const; suggesting the use of invoke() when the function is pre-checked, or more importantly you are trying to avoid exception usage. Thanks in advance, and I hope I am not opening a new/old can of worms..... Peter Dr Peter Myerscough-Jackopson - Principal Engineer Tel: +44 (0)23 8076 7808 Fax: +44 (0)23 8076 0602 Web: http://www.macltd.com/ <BLOCKED::http://www.macltd.com/> Email: peter.myerscough-jackopson(a)macltd.com <mailto:peter.myerscough-jackopson@macltd.com> MULTIPLE ACCESS COMMUNICATIONS LIMITED is a company registered in England at Delta House, The University of Southampton Science Park, Southampton, SO16 7NS, United Kingdom with Company Number 1979185 and VAT Number GB 411942866

3 2

[fusion] VC8 specific error
by John Maddock 05 Sep '10

05 Sep '10

I'm getting the following error from fusion only when using VC8: ..\..\..\boost/fusion/sequence/intrinsic/at.hpp(59) : error C2504: 'boost::fusion::extension::at_impl<Tag>::apply<Sequence,N>' : base class undefined with [ Tag=boost::fusion::non_fusion_tag ] and [ Sequence=const boost::tuples::tuple<double,double>, N=boost::mpl::int_<0> ] ..\..\..\boost/fusion/sequence/intrinsic/at.hpp(64) : see reference to class template instantiation 'boost::fusion::result_of::at<Sequence,N>' being compiled with [ Sequence=const boost::tuples::tuple<double,double>, N=boost::mpl::int_<0> ] ..\..\..\boost/math/tools/roots.hpp(47) : see reference to class template instantiation 'boost::fusion::result_of::at_c<Sequence,N>' being compiled with [ Sequence=const boost::tuples::tuple<double,double>, N=0 ] ..\..\..\boost/math/tools/roots.hpp(225) : see reference to function template instantiation 'void boost::math::tools::detail::unpack<boost::tuples::tuple<T0,T1>,T,T>(const Tuple &,T &,U &)' being compiled with [ T0=double, T1=double, T=double, Tuple=boost::tuples::tuple<double,double>, U=double ] compile_test\tools_roots_concept_test.cpp(115) : see reference to function template instantiation 'T boost::math::tools::newton_raphson_iterate<F2t,double>(F,T,T,T,int,boost::uintmax_t &)' being compiled with [ T=double, F=F2t ] The code is simply calling boost::fusion::get<N>() on a fusion tuple, and after including <boost/fusion/tuple.hpp>. Any ideas? This is with Trunk BTW. Cheers, John.

2 2

[NVL++]: new library and utilities
by Manfred Doudar 04 Sep '10

04 Sep '10

Hello List, Have recently released a series of libraries aimed at facilitating computer-vision tasks - taking out much of the boiler-plate associated with connecting to multiple cameras, and image streams generally. Work that is largely the product of almost 1.5 years work, using OpenCV as a back-end, but thread-safe, and all in modern C++, and largely header-file only. For those not particularly interested in computer-vision, there are libraries and miscellaneous utilities that may be of interest, in particular: - a library wrapper over Boost.Thread (not entirely complete, but covers majority of use-cases); and makes threading less error-prone - a library for parsing delimited strings (csv, etc) - a library for parsing command-line options (expresses intent better than Boost.Program_options, betters in some areas, lacks in others) - a library that with a bit more of effort can be made stand-alone for streaming ("chaining") of algorithms, though binders are common-place, some work herein presents alternative approaches. [[Documentation]]: is available, but not of Boost quality, however it is sufficient. Depending upon reaction, what I do with these libraries, depends largely upon feedback I get. [[License]]: largely C++ Boost license, with the exception of a few 3rd-party libs included in the package. [[Platform]]: developed & tested on Linux; compiles with GCC-4.4.2 [[Where to get it]]: for the time being can be found here (until comms at work can get their act together and put up on their open-website) - http://users.cecs.anu.edu.au/~manfredd ..there's only one file there: nvl++.tar.bz2 Cheers, -- Manfred

2 3

Re: [boost] [gil] Who has a big-endian machine?
by Belcourt, Kenneth 03 Sep '10

03 Sep '10

On Sep 1, 2010, at 1:24 PM, Belcourt, Kenneth wrote: > > On Sep 1, 2010, at 12:05 PM, Christian Henning wrote: > >> Hi there, could someone with a big-endian machine run the following >> code with the latest gil code from the trunk? > ./ibm.hw purple.sandia.gov: 31488 MB 8 CPU PowerPC_POWER5 model IBM, 9118-575 > xlC -g -I./boost-trunk gil.cpp > ./a.out Assertion failed: v1 == 6, file gil.cpp, line 47 Abort (core dumped) Same source code. -- Noel

2 6

Towards a Warning free code policy proposal
by vicente.botet 03 Sep '10

03 Sep '10

Hi all, Last year there where two long threads about Boost Warning policy. If I'm not wrong nothing was concluded. I think that we can have two warning policies: one respect to the Boost users and one internal for Boost developement. We can consider that Boost headers can be used by the users as system headers, so no warning is reported for these files. The main advantage I see is that it allows the users to don't mix the warnings comming from Boost and their own warnings. Next follows a way to disable completly warnings for 3 compilers: Any Boost header file could be surrounded by #if defined __GNUC__ #pragma GCC system_header #elif defined __SUNPRO_CC #pragma disable_warn #elif defined _MSC_VER #pragma warning(push, 1) #endif and #if defined __SUNPRO_CC #pragma enable_warn #elif defined _MSC_VER #pragma warning(pop) #endif As we want the developer to be able to catch and eliminate as many warning as possible we need some conditional compilation that allows us to enable the warning reporting internally. These could also be useful for users that prefer to see the Boost warnings. Boost.Exception uses already this policy, sourronding some of its files with #if defined(__GNUC__) && !defined(BOOST_EXCEPTION_ENABLE_WARNINGS) #pragma GCC system_header #endif #if defined(_MSC_VER) && !defined(BOOST_EXCEPTION_ENABLE_WARNINGS) #pragma warning(push,1) #endif and #if defined(_MSC_VER) && !defined(BOOST_EXCEPTION_ENABLE_WARNINGS) #pragma warning(pop) #endif I propose to extend this to a 2-level enabling warning system BOOST_ENABLE_WARNINGS: If defined, enable warnings for all the Boost libraries BOOST_<LIB>_ENABLE_WARNINGS: If defined, enable warnings for a specific library <LIB> Regression testers should run with BOOST_WARNING_ENABLED defined. Developers of a library should run with BOOST_<LIB>_WARNING_ENABLED defined at least. Users could enable warnings at any level just by defining the appropriated macro. With this 2-level enabling policy, the preceding surrounding code becomes: #if !defined(BOOST_ENABLE_WARNINGS) && !defined(BOOST_LIB_ENABLE_WARNINGS) #if defined __GNUC__ #pragma GCC system_header #elif defined __SUNPRO_CC #pragma disable_warn #elif defined _MSC_VER #pragma warning(push, 1) #endif #endif and #if !defined(BOOST_ENABLE_WARNINGS) && !defined(BOOST_LIB_ENABLE_WARNINGS) #if defined __SUNPRO_CC #pragma enable_warn #elif defined _MSC_VER #pragma warning(pop) #endif #endif Due to the nature of the GCC solution, this does not work directly within the source (.cpp) file, only within a header (.hpp) file. So if we want to remove the warnings also from the .cpp files we need to move the code to a .hpp file. // a.cpp #include "warning_free_wrapper/a.hpp" Of course this policy don't mean that the developer should not take care of the warnings. Please, let me know if this policy could satisfy the needs of the Boost users and the developers. Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

24 64

[itl] status?
by Jeff Flinn 03 Sep '10

03 Sep '10

What is the current status of the interval template library? Where can I get the latest version? Thanks, Jeff

4 3

nvcc config and mpl_assert
by Andrey Asadchev 03 Sep '10

03 Sep '10

recent boost distribution introduced nvcc as compiler which results in failed compilation when using mpl assert (and components of mpl which do so) here is the fix (it produces warnings, but allows for compile) --- config/compiler/nvcc.hpp 2010-09-02 18:43:46.000000000 -0500 +++ config/compiler/nvcc.hpp~ 2010-09-02 16:40:32.000000000 -0500 @@ -17,8 +17,8 @@ // Boost support macro for NVCC // NVCC Basically behaves like some flavor of MSVC6 + some specific quirks -//#define BOOST_NO_INCLASS_MEMBER_INITIALIZATION -//#define BOOST_MSVC6_MEMBER_TEMPLATES +#define BOOST_NO_INCLASS_MEMBER_INITIALIZATION +#define BOOST_MSVC6_MEMBER_TEMPLATES #define BOOST_HAS_UNISTD_H #define BOOST_HAS_STDINT_H #define BOOST_HAS_SIGACTION --- mpl/aux_/config/gcc.hpp 2010-09-02 18:49:14.000000000 -0500 +++ mpl/aux_/config/gcc.hpp~ 2010-09-02 19:03:39.000000000 -0500 @@ -14,7 +14,7 @@ // $Date: 2008-10-11 02:19:02 -0400 (Sat, 11 Oct 2008) $ // $Revision: 49267 $ -#if defined(__GNUC__) && !(defined(__EDG_VERSION__) || defined(__CUDACC__)) +#if defined(__GNUC__) && !defined(__EDG_VERSION__) # define BOOST_MPL_CFG_GCC ((__GNUC__ << 8) | __GNUC_MINOR__) #else # define BOOST_MPL_CFG_GCC 0 I think nvcc compiler must be differentiated whenever it uses Microsoft (Windows) or GCC(linux) compiler

2 1

[Locale] MS-LCID's table from MSDN site and Copyrights
by Artyom 03 Sep '10

03 Sep '10

Hello, I need a table for conversion of Windows LCIDs to ISO-639 Language and ISO-3199 Country codes and back. I need this for creation Win32 API based backend for Boost.Locale and ability to convert locale names like en_US to LCID 0x0409. Such table can be found here (link to PDF of this page): <http://msdn.microsoft.com/en-us/library/cc233965.aspx> It contains all I need. Now I want to insert such table to the cpp file and include it to the Boost.Locale library. I've read the Copyright notice on this page but I don't clearly understand: - Can I do this? It seems that this notice allow to copy the data but not sure. - Can I release a file that includes such table under Boost License? I need some advice from people who had already deal with such documents or stuff like this or know to read "lowers language" a little bit better and point me to specific line that would make it clear for me. Thank you Artyom P.S.: I can create a workaround based on iterating over all installed LCID's in runtime and querying their ISO-639 and ISO-3199 codes using GetLocaleInfo first time I need to use such table, but integrating static table would be much simpler and faster solution.

3 3

Re: [boost] Thoughts for a GUI (Primitives) Library
by Ralf Globisch 02 Sep '10

02 Sep '10

>>> Giorgio Zoppi 09/01/10 2:17 PM >>> I don't know if there's enough space for this. There are a plenty of GUIs Framework, like Qt or wxWindows, which are more advanced. -- Quiero ser el rayo de sol que cada día te despierta para hacerte respirar y vivir en me. "Favola -Moda". I concur, it would be difficult to match QT for any cross platform GUI development. It is an extensive, mature framework available under the LGPL and in terms of boost there are workarounds to make boost and QT signals co-exist. I'm not so familiar with wxWindows, but both of these GUI libs have been under development for some time and it would be difficult to compete with them, which is what any new library would have to do. -- This message is subject to the CSIR's copyright terms and conditions, e-mail legal notice, and implemented Open Document Format (ODF) standard. The full disclaimer details can be found at http://www.csir.co.za/disclaimer.html. This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean. MailScanner thanks Transtec Computers for their support.

14 19

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

[iostreams] filtering_ostream does not flush std::cout.
by Duncan Smith 01 Sep '10

01 Sep '10

I'm using Boost 1.43.0, and I've found that filtering_ostream does not flush "std::cout". I found a relevant (and recent) ticket against Boost 1.44.0, but my issue is slightly different. https://svn.boost.org/trac/boost/ticket/4590 I'm using GCC 4.3.4 on Gentoo Linux. I'm hoping that I'm just doing something wrong, but if you think there's a bug, I'll add my testcase to the ticket. The basic recipe: filtering_ostream out; out.push(any_filter_at_all()); out.push(std::cout); out << "Hello World!" << std::flush; sleep(10); // Observe an empty console. std::cout << std::flush; sleep(10); // Observe printed text on console. This problem is quite bad for me when doing the following on the command-line (for a more complicated program): ./program 2>&1 | tee some-file.log Because stdout is not getting flushed, the stdout and stderr get intermingled strangely. However, disabling buffering on stdout works around the problem: stdbuf --output=0 ./program 2>&1 | tee some-file.log Please tell me if you think there's a bug in my code. If it's a bug in Boost.Iostreams (or I'm expecting the wrong behaviour), I would appreciate any ideas for workarounds (I tried cout.setf(unitbuf), and that doesn't seem to do the trick). Here's the full text of my code: ------------------ // Test case for flushing a filtering_ostream based on the // boost_iostreams_filtering_ostream.cpp attached to ticket #4950: // https://svn.boost.org/trac/boost/ticket/4590 // https://svn.boost.org/trac/boost/attachment/ticket/4590/boost_iostreams_fil… // changed to use "cout" as the sink. // // Flushing a filtering_ostream using the flush() global function does not work // in Boost 1.43. I suspect it also does not work in Boost 1.44. // // Using GCC-4.3.4 on Gentoo Linux. // #include <cassert> #include <string> #include <boost/iostreams/categories.hpp> #include <boost/iostreams/operations.hpp> #include <boost/iostreams/filtering_stream.hpp> #include <iostream> // Included for "sleep()" call below. #include <unistd.h> namespace io = boost::iostreams; // Simple output filter forwarding just forwarding the put chars to // the sink. struct transparent_output_filter { typedef char char_type; typedef io::output_filter_tag category; template <typename Sink> bool put(Sink& snk, char c) { return io::put(snk, c); } }; int main(int argc, char *argv[]) { using namespace std; io::filtering_stream<io::output> out; // Transparent filter just forward the characters to the sink. // // Note: I observe this behaviour with and without this line. out.push(transparent_output_filter()); // Sink appends characters to "cout". out.push(cout); // Write test string to filtering_ostream. out << "Hello World!"; // On my system, this will flush the buffer iff I'm on an // interactive console. "\n" and endl have the same effect. I believe // that my shell sets "stdout" to be line-buffered if it's interactive. // out << "\n"; bool wasFlushed = false; // The flush does *not* work in Boost 1.43. wasFlushed = io::flush(out); // This assertion does not go off, though. assert(wasFlushed); // This also doesn't work. wasFlushed = out.flush(); assert(wasFlushed); // This also doesn't work. out << std::flush; // Demonstrate that none of the above flush calls had any effect on "cout". sleep(10); // Now we finally get the characters on the console. cout << flush; // Demonstrate that the direct flush call works when called directly on // "cout". sleep(10); return 0; }

1 0

[msm] on_entry must be implemented for every initial events for every states in substatemachines.
by Richard Szabo 01 Sep '10

01 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

1 0

Re: [boost] [msm] Boost MPL vector limit size exceeded
by Michael.Herchel＠rohde-schwarz.com 01 Sep '10

01 Sep '10

Hi, thanks for the answers. >> I also tried the define "BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS" >> with and without specifying the define "FUSION_MAX_VECTOR_SIZE". > I used the #defines > BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS > BOOST_MPL_LIMIT_VECTOR_SIZE=60 Sorry, this was a mistake. Of course I used "BOOST_MPL_LIMIT_VECTOR_SIZE" instead of "FUSION_MAX_VECTOR_SIZE"

1 0

[msm] Boost MPL vector limit size exceeded
by Michael.Herchel＠rohde-schwarz.com 01 Sep '10

01 Sep '10

Hi, 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. 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? Thanks for your help, Michi

4 3