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

Adding more than 20 rows in transition table for Boost::MSM
by Yechiel Levi 23 Sep '14

23 Sep '14

Hi, I tried defining: #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_VECTOR_SIZE 30 // or whatever you need #define BOOST_MPL_LIMIT_MAP_SIZE 30 // or whatever you need /// Boost-MSM Includes // back-end #include "boost/mpl/vector/vector30.hpp" #include <boost/msm/back/state_machine.hpp> //front-end #include <boost/msm/front/state_machine_def.hpp> #include <boost/msm/front/functor_row.hpp> #include <boost/any.hpp> // for And_ operator #include <boost/msm/front/euml/operator.hpp> And i still get the following errors: builder1: In file included from /usr/local/include/boost/mpl/erase.hpp:19, builder1: from /usr/local/include/boost/fusion/mpl/erase.hpp:10, builder1: from /usr/local/include/boost/fusion/mpl.hpp:20, builder1: from /usr/local/include/boost/fusion/include/mpl.hpp:11, builder1: from /usr/local/include/boost/msm/back/state_machine.hpp:30, builder1: from File_Meta_FSM.h:18, builder1: from Open_Files_Mng.h:5, builder1: from Open_Files_Mng.cpp:1: builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: template argument 1 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:56: error: template argument 2 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:57: error: template argument 3 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: ‘_’ was not declared in this scope builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: template argument 1 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:62: error: template argument 2 is invalid builder1: /usr/local/include/boost/mpl/aux_/erase_impl.hpp:63: error: template argument 3 is invalid and more of the same errors.. -- Kind regards, Yechiel Levi

5 7

Graph concepts for Dijkstra shortest-path searches
by Clayton Davis 22 Sep '14

22 Sep '14

Hi, I am somewhat uncertain on which concepts are required for the Dijkstra searches in the BGL and parallel BGL. For the sequential BGL, documentation at http://www.boost.org/doc/libs/1_56_0/libs/graph/doc/dijkstra_shortest_paths… would seem to indicate that a VertexListGraph is required, even when the no_init version is used. Looking at the code, I think that is accurate - use of the index map at https://github.com/boostorg/graph/blob/master/include/boost/graph/dijkstra_… seems to require vertex list traversal - but I would also think that defeats the purpose of the no_init option. Conversely, for the parallel BGL documentation at http://www.boost.org/doc/libs/1_56_0/libs/graph_parallel/doc/html/dijkstra_… says only that DistributedGraph is required, which is a refinement of Graph but not VertexListGraph or IncidenceGraph. However, just a little bit of searching seems to show that the parallel Dijkstra search requires both, along with perhaps PropertyGraph (see for instance https://github.com/boostorg/graph_parallel/blob/master/include/boost/graph/… and https://github.com/boostorg/graph_parallel/blob/master/include/boost/graph/…) I won't pretend to understand the code; but I would expect these functions to require something stronger than the documentation indicates. Could someone please clarify what the requirements are for these functions? Any help is greatly appreciated. Thanks, Clayton

1 0

BOOT_PP_REPEAT simple nesting problem
by Colin Fowler 22 Sep '14

22 Sep '14

Hi all, I'm trying to use BOOST_PP to generate some code. I can generate the sequence int x_0 to int x_4 using the code below. #include <boost/preprocessor/repetition/repeat.hpp> #define DECL1(z, n, text) text ## _ ## n = n; #define decl1(text, count) BOOST_PP_REPEAT(count, DECL1, text) decl1 (int x, 5) What I'd like to do is write a decl2 that can be used something like this: decl2 (int x, 5, 2) to generate int x_0_0 to int x_4_1 I've tried nesting BOOST_PP_REPEAT but so far I've been unable to produce the desired behaviour unless I hardcode one of the iteration counts. I'd like to also eventually write a decl3(int x, 5, 3, 4) when I understand how a decl2 would work. Any help much appreciated! Regards, Colin

4 6

[assign][cref_list_of] Creating anonymous list of pairs
by Aaron Levy 22 Sep '14

22 Sep '14

Is there a way to generate a list of value pairs using ref_list_of or cref_list_of. Maybe such a list could be assigned to a map. Something like: ref_list_of<size, std::pair<std::string, std::string>>("foo", "bar")("foo1", "bar1")...; or std::map<string, string> names = ref_list_of<size, std::pair<std::string, std::string>>("foo", "bar")("foo1", "bar1")...; -- Aaron Levy aaron.levy(a)yandex.com

3 2

[ptr_container][ptr_map]
by Aaron Levy 22 Sep '14

22 Sep '14

Consider the following code: class Base { public: virtual ~Base() = 0 {}; virtual double get() = 0; }; class D1 : public Base { public: D1(double n) : val_(n) {} double get() const { return val_; } private: double val_; }; class D2 : public Base { D2(double n) : val_(n) {} double get() const { return val_; } private: double val_; }; bool operator < (const Base& left, const Base& right) { return (left.get() < right.get()); } I can create a ptr_set of Base like this: boost::ptr_set<Base> set; But I can't create a ptr_map with Base as key, like this: boost::ptr_map<Base, Base> map; The problem is that Base is abstract and so the key cannot be instantiated by ptr_map. What is the cause for this distinction between ptr_set and ptr_map. -- Aaron Levy aaron.levy(a)yandex.com

2 1

Boost.Test multiple linkage question
by Rob Harris 22 Sep '14

22 Sep '14

All, I've been ripping out my hair all day, and I can't seem to determine a straight answer from the Googles. Can I link _multiple_ boost unit test dynamic libraries into a single binary and have all of them detected? For instance... src lib liba foo.cpp liba_unittests.cpp libb bar.cpp libb_unittests.cpp libd baz.cpp libd_unittests.cpp lib liba.so liba_ut.so libb.so libb_ut.so libd.so libd_ut.so bin ut unittest_driver When I build this infrastructure out, everything compiles. I've checked the compilation command and it looks like everything is on the command line, but there's explicit indication that unittest_driver actually read or linked any of the lib*_ut.so files. If I make individual unit test drivers in, say, liba, the driver works fine. If I link everything into a single unittest_driver binary, I keep getting the dreaded empty test tree. I have -DBOOST_ALL_DYN_LINK set in my CXXFLAGS so that shouldn't be the problem. And I only have BOOST_TEST_MAIN set in the driver; still no joy. Any help (or a definitive, "no you idiot, you can't do that!") would be greatly appreciated. Thanks. -RMH

2 1

Utah C++ User Group started
by legalize+jeeves＠mail.xmission.com 22 Sep '14

22 Sep '14

[Please do not mail me a copy of your followup] I'm booting up a C++ User Group in Utah. We're bootstrapping out first meeting to decide a regular meeting time and location. Join the Utah C++ Programmers MeetUp group to hear about meetings: <http://www.meetup.com/Utah-Cpp-Programmers/> Follow related evens on the Utah C++ Users Group blog: <http://utahcpp.wordpress.com> -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

1 0

[lockfree] stack needs undocumented trivial assignment
by Norbert Wenzel 21 Sep '14

21 Sep '14

I'm trying to replace some computation intensive loops in legacy code with parallel loops and thus tried to store the results in a lockfree stack. I've chosen stack over queue because of the requirements stated in the documentation, where stack only needs a copy ctor and queue additionally needs trivial assignment and trivial dtor. My result struct I want to store in the stack is *not* trivially assignable. When trying to compile the code containing my lockfree::stack the static assertion in line 75 of stack.hpp because it requires trivial assignment and trivial dtor. My question would be if this is simply an error in the documentation ie. if the requirements section should be copied over from lockfree::queue or if these static assertions should only be checked in some special case, eg. where the stack is of fixed size? thanks, Norbert

1 0

[context] How to set stack pointer in a platform-independent way?
by TONGARI J 21 Sep '14

21 Sep '14

Hi, The problem had been discussed here: https://groups.google.com/forum/#!topic/boost-devel-archive/cl8B1oUPrVM But it's still not clear how to set the stack pointer portably, even after examining the code of Boost.Coroutine. For now, Boost.Context only supports downward stack, and Boost.Coroutine, which happened to be written by the same author, just assumes that the stack always grows downward, which is not really a portable implementation, if future Boost.Context supports upward stack, Boost.Coroutine has to be changed as well. Even than that, what does "beginning of the stack" really means? Suppose we have a stack of size 3, starting at [s]: [s-1][s][s+1][s+2][s+3] Why the beginning of a downward stack is [s+3], not [s+2]? If it's a upward stack, is beginning [s] or [s-1]? Thanks.

5 12

from: giridhar
by giridhar 20 Sep '14

20 Sep '14

Salutations boost http://ariasking.com/morning.php/ttqhx3144vcfnpry/ giridhar

1 0