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

[Spirit] [bind] Compiler warning dependent on number of rules?
by Norbert Wenzel 05 Nov '09

05 Nov '09

Hello, I'm currently parsing some data using Spirit together with boost::bind to set the callbacks for Spirit. In release build I get a compiler (gcc 4.4.1) warning from bind: warning: dereferencing pointer ‘val’ does break strict-aliasing rules I was able to find the lines causing this problem by commenting them out, rebuilding and the error got away. The strange thing is, that when I copy some other parsing rules, that previously compiled without any warning, I get the same warning again. When trying to create a simple example to post here, it seemed that the actual parsing code (that is the only code that uses boost::bind) was exchangeable. It was the number of options in the parsing rule that caused the warning to appear (which I really do not understand). The parsing rule looks like this: parse(someString.c_str(), ( *( str_p('+') >> str_p('(') >> real_p[boost::bind(&Object::func_param, boost::ref(m_curObmect), _1)] >> str_p(')') | str_p('+')[boost::bind(&Object::func, boost::ref(m_curObject), _1)] /*| str_p('+') >> str_p('(') >> real_p[boost::bind(&Object::func_param, boost::ref(m_curObmect), _1)] >> str_p(')') | str_p('+')[boost::bind(&Object::func, boost::ref(m_curObject), _1)] [... to be repeated ...] */ ) ) , space_p).full; The goal is to find either "+" or "+(double)", which works as expected. causesThe signatures of the Object functions are Object::func_param(double param); and Object::func(char); The rule can be copied 7 times, leading to 14 options, without any warning. If I add one 8th copy of these lines, or if I just add a 15th option (independent of the actual line I copy) I get the warning again. My system is an Ubuntu Karmic 64bit machine, using gcc 4.4.1, boost 1.39 headers and simply including "boost/spirit.hpp", which means I get the deprecation warning for that file at the moment. I'd be thankful for any suggestions, since for now, I do not even know where to look further. I do not have any idea what might cause this warning. thanks, Norbert

2 2

multi_index and shared_ptrs
by Daniel Burrows 05 Nov '09

05 Nov '09

I'm having trouble getting multi_index's key extractors to play nicely with shared_ptr objects. I'm trying to eliminate my custom hash and equality objects in this code: class screenshot_cache_entry : /* ... */ { /* ... */ public: const screenshot_key &get_key() const; /* ... */ }; class hash_cache_entry { public: size_t operator()(const boost::shared_ptr<screenshot_c ntry> &entry) const { return boost::hash<screenshot_key>()(entry->get_key()); } }; class cache_entry_equal { public: bool operator()(const boost::shared_ptr<screenshot_cache_entry> &entry1, const boost::shared_ptr<screenshot_cache_entry> &entry2) const { return entry1->get_key() == entry2->get_key(); } }; typedef multi_index_container< boost::shared_ptr<screenshot_cache_entry>, indexed_by< hashed_unique<tag<by_screenshot_tag>, identity<boost::shared_ptr<screenshot_cache_entry> >, hash_cache_entry, cache_entry_equal>, sequenced<tag<ordered_tag> > > > cache_map; Note that all my custom hash and equality comparisons do is invoke get_key() and pass through to the corresponding operation on it. I've been back and forth over the documentation and past mailing list posts, and it seems like this "should" work: typedef multi_index_container< boost::shared_ptr<screenshot_cache_entry>, indexed_by< hashed_unique<tag<by_screenshot_tag>, const_mem_fun<screenshot_cache_entry, const screenshot_key &, &screenshot_cache_entry::get_key> >, sequenced<tag<ordered_tag> > > > cache_map; However, when I compile this, I get an error indicating that the index is attempting to apply hash() to the *shared pointer* rather than to the key object (at least it didn't just hash the pointer silently!) (...) screenshot_cache.cc:526: instantiated from here /usr/include/boost/multi_index/hashed_index.hpp:439: error: no match for call to ‘(const boost::hash<const aptitude::screenshot_key>) (const boost::shared_ptr<gui::<unnamed>::screenshot_cache_entry>&)’ With the ordered index, I get a similar problem (it tries to compare a screenshot_key to a shared_ptr). Can anyone shed some light on this problem? Thanks, Daniel

2 1

boost::pool
by Hansjoerg 05 Nov '09

05 Nov '09

Hello, In my application I have a lot of small objects. For that I thought that it is the best to use an object pool..I have read the docu of object_pool...but I don't understand really how I have to use it.. Can one give me some hints? Another thing that I don't understand..Need I to know already during compiletime the max. number of objects? Regards Hansi

10 17

multi_index with base class member
by david joeyoung 05 Nov '09

05 Nov '09

please give me some advices. I get a compile error,when to index on base class member. the codes are listed below: struct Foo { int a; }; struct Bar : public Foo { int b; }; struct idx0 {}; typedef multi_index_container< Bar, indexed_by< ordered_unique< tag < idx0 > ,member < Bar,int,&Bar::a> > > > test_type; Error 1 error C2440: 'specialization' : cannot convert from 'int Foo::* ' to 'int Bar::* ' and the codes are compiled in boost 1.40, vs 2008 sp1

2 1

[scoped_ptr] How to cast from bast type to decived type
by Mario Klebsch 05 Nov '09

05 Nov '09

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hello! I have a scoped_ptr<base_t>, which I reset() to new derived_t().: class base_t { }; class derived_t: public base_t { void Method(void) {} }; boost::scoped_ptr<base_t> Ptr; Ptr.reset(new derived_t()); Prior to using a scoped_ptr, I could write: ((derived_t*)Ptr)->Method(); I tried the following: boost::dynamic_pointer_cast< derived_t, base_t >(Ptr)>Method(); but it does not compile. :-( boost::dynamic_pointer_cast seems to only work for shared_ptr. Can anybody help me? 73, Mario P.S: I am using boost 1.38 - -- Mario Klebsch mkl(a)innodyne.de Innovative Dynamics GmbH http://www.innodyne.de Wiesenweg 9 Tel: +49 5304 91 19 410 38533 Vordorf / Rethen Fax: +49 5304 91 19 412 Geschäftsführer: Dipl. Phys. Gerhard Heidkamp Sitz: 38533 Vordorf - Rethen, Wiesenweg 9 Handelsregister beim Amtsgericht Hildesheim HRB 100553, USt-Id Nr. DE 215 876 442 SICHERHEITSHINWEIS: =================== Diese Email ist elektronisch signiert. InnoDyne versendet grundsätzlich seit dem 11.9.2006 verbindliche Dokumente nur als signierte PDF - Dateien oder elektronisch nachprüfbar signierte Emails. Juristisch und technisch verbindliche Dokumente dürfen das Haus InnoDyne nicht als andere Datei- formate verlassen. Sollten Sie ein signiertes, technisch oder kauf- männisch/juristisch verbindliches Dokument in einem anderen Dateiformat als PDF oder signierte Email von InnoDyne erhalten, so ist dies sehr wahrscheinlich ein Versehen des Versenders, eine Software - Fehlfunktion oder schlimmer noch, eine Fälschung. Wir bitten in einem solchen Fall um sofortige Information und Übermittlung solcher Dokumente an gl(a)innodyne.de -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.8 (Darwin) iEYEARECAAYFAkrywpMACgkQDwNq2neCwq7SbwCfewiXKOvyymLeWOMjkLqmmPbi 5aYAnR5FTZiuHfbQHSg21QEXOZN8j3Zc =Kz/D -----END PGP SIGNATURE-----

2 1

[BGL] How to set a complex edge property using add_edge
by Cosimo Calabrese 05 Nov '09

05 Nov '09

Hi to all, I'm trying to use the add_edge( u, v, *p*, g ) overload of this function, but I've founded only example where the edge property of the graph is a single property. // ... typedef adjacency_list<vecS, vecS, directedS, no_property, property<edge_weight_t, int> > Graph; Graph g( 10 ); // add an edge with weight = 1 property<edge_weight_t, int> edge_property( 1 ); add_edge( 0, 1, edge property, g); // ... What about if I've multiple edge property? // ... typedef property < edge_ID_t, long, property < edge_weight_t, long, property < edge_other_prop_t, bool > > > edge_prop; typedef adjacency_list<vecS, vecS, directedS, no_property, edge_prop> Graph; // ... How can I set an edge_prop variable with all the edge properties? Thanks in advance, Cosimo Calabrese.

2 1

[boost] [Review Results] Boost.Polygon library accepted into boost
by Fernando Cacciola 05 Nov '09

05 Nov '09

Dear Boosters, [first of all allow me to apology for not doing this before. My small consulting bussines suddenly grew out of proportion and now is way over my head, keeping me working/managing 16 hours a day] I am pleased to announce that the Boost.Polygon library from Lucanus Simonson has been accepted into boost provided some of the most critical concerns, detailed below, are addressed first. First of all I would like to thank Lucanus and Intel Corporation for making this work available to all C++ developers around the world. I would also like to thank all the reviewers that participated (in no particular order nor degree of participation) Thomas Klimpel Frank Mori Hess Barend Gehrels Andreas Fabri Jeffrey Hellrung Tim Keitt Markus Werle Paul A. Bristow Robert Stewart Mathias Gaunard Michael Fawcett Steven Watanabe Joachim Faulhaber John Bytheway Sebastian Redl Mika Heiskanen John Phillips Kai Benndorf Hartmut Kaiser Arash Partow Maurizio Vitale Brandon Kohn David Abrahams Gordon Woodhull Daniel James John Maddock Tom Brinkman Bo Persson Mateusz Loskot Christian Henning Jean-Sebastien Stoezel The library had 6 yes votes and 4 no votes. Those who voted no made the following major complains and remarks (they are numbered as I will refer to them back later): Barend Gehrels: (1) According to his benchmarks, intersection algorithms are unnecesarily slow as if something where fundamentally wrong in the design and/or implementation. AFAICT the implication has not been proved or disproved so far, hence I consider it a red herring and cannot take it as a reason for rejecting the library, but it is important to look at it in detail. (2) As a major complain, the library is unusable in those domains where floating point support is a requirement (like GIS). (3) The library should contain some basic polygon geometry algorithms such as convex hull and centriod Phil Endecott: (4) There is no concept checking in the code so it is difficult to adapt. (5) There where too many warnings and build errors (but Luke fixed these) (6a) The documentation needs a better overview of operations supported by the concetps. (6b) It also needs the details on the algorithms complexities. (6c) It also misses the numerical requirements for the coordinate type. (6d) And tutorials. (7) Some operators are ambiguous and it would be better to keep just one of each "flavor". (8) The polygon_data template class is parameterized by a coordiante type rather than a point type. This makes it useless for integration with existing geometric data types Michael Fawcett: (5), (6a), (6d) (9) T9he API should provide versions using output iterators in addition to output container references. (10) Theoreticall the library would be usable with a user defined coordinate type (metting certain requirements now undocumented), for example a fixed point data type, but some details in the internal design and implementation prevents this. (11) As a major complain, the library is unusable in those domains where floating point support is a requirement (like GIS). Hartmut Kaiser: (11), (1) Fernando Cacciola: (12) The name of the library should change to better indicate that is restricted to Integral coordinates and two-dimensions. (13) The documentation must contain a "credits" section acknowledging all the people that participated in the review. For the library to be effectively accepted, points (5),(6a-d),(10), (12) and (13) should properly addressed ((5) is already done AFAICT) It would be quite significant if point (1) where looked into. Once again I thank Lucanus, Intel Corporation and all the reviwers. Best regards -- Fernando Cacciola SciSoft Consulting, Founder http://www.scisoft-consulting.com _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

[1.41.0] Beta 1 available
by Beman Dawes 05 Nov '09

05 Nov '09

Boost release 1.40.1 beta 1 is available from SourceForge: http://sourceforge.net/projects/boost/files/ This release contains one new libraries and numerous bug fixes for existing libraries. For details, see http://beta.boost.org/users/news/version_1_41_0for details. To install the beta on your system, see http://beta.boost.org/doc/libs/1_40_0/more/getting_started/index.html Please report any problems with the beta on the developers or users mailing list. Unless unexpected problems arise, the plan is to ship the final 1.40.0 release in a week to ten days. Thanks, --The Boost release team

5 7

Warning while compiling asio UNDER_CE
by Carmelo Campione 05 Nov '09

05 Nov '09

I'm trying to compile my project with Asio support for Windows CE platform. I think, I don't need to define _WIN32_WINNT or _WIN32_WINDOWS but when compiling Asio headerI get this warning: "Please define _WIN32_WINNT or _WIN32_WINDOWS appropriately. For example:..." I find this warning coded in "socket_types.hpp" file. I'm using Boost library 1.40.0. How can remove this warning message? Can I ignore it? Thanks. Carmelo

1 0

[1.41.0] CMake beta of the beta
by troy d. straszheim 04 Nov '09

04 Nov '09

The CMakeable 1.41.0 Boost has gone beta. Docs: http://sodium.resophonic.com/boost-cmake/1.41.0.beta1.cmake1/doc Tarballs and zipfiles: http://sodium.resophonic.com/boost-cmake/1.41.0.beta1.cmake1 If you've been waiting to try the cmake build, this is the time. Followups on the boost-cmake list, please, contact info at the top of the docs. -t

1 0

[asio] why no random_access_handle on non-windows platforms?
by Zachary Turner 04 Nov '09

04 Nov '09

I notice there's a random_access_handle on windows, and is needed in order to use functions like async_read_some_at. Am I missing some obvious reason why there is not an analagous random access handle for posix systems? I guess I can define my own posix::random_access_handle, posix::basic_random_access_handle, posix::random_access_handle_service just like is done for windows, but i don't see why there is anything windows-specific about random access handles in the first place. Ultimately I need to be able to perform random access asynchronous file i/o on both linux and windows using a single codebase. Any advice appreciated.

1 0

boost::interprocess communication between windows service and user application
by jmpulido 04 Nov '09

04 Nov '09

Hi, I'm pretty new to boost::interprocess but I've been performing some successful communication tests between two applications, using boost::interprocess::shared_memory_object and boost::interprocess::mapped_region. But when one of those processes is a windows service, then I get a file not found exception (I've catched it and dumped it into a file), just after initializing a shared_memory_object. It seems that the shared memory is actually managed by means of a file in disk that probably the user is creating in a location and the service in a different one. I've been googling this issue for hours, but the only resource I was able to find is this conversation: http://stackoverflow.com/questions/488877/boostinterprocess-between-windows… which has not been very helpful since I have no clue on how to use boost::interprocess::managed_windows_shared_memory or even if it could serve to my purpose somehow. Thank you.

2 1

[mpl, preprocessor] Using BOOST_MPL_ASSERT in BOOST_PP_REPEAT
by Jean-Louis Leroy 03 Nov '09

03 Nov '09

Consider: #define BOOST_PP_RDB_MPL_ASSERT(z, n, t) \ BOOST_MPL_ASSERT((BOOST_PP_TUPLE_ELEM( \ 2, 0, t)<BOOST_PP_CAT(BOOST_PP_TUPLE_ELEM(2, 1, t), n)>)); // in a file passed to BOOST_PP_ITERATE() BOOST_PP_REPEAT(n, BOOST_PP_RDB_MPL_ASSERT, (is_column_container, Col)) This works with msvc9 express but not with g++ 4.4.1. When I dig it I see that BOOST_MPL_ASSERT creates an identifier based on BOOST_MPL_AUX_PP_COUNTER() which in turns uses either __COUNTER__ (with msvc9) or __LINE__ (with g++). So with g++ we get name clashes when `n` is greater than one, because the ASSERT macro attempts to create several variables with the same name in the same scope. I guess I could copy the code of BOOST_MPL_ASSERT() in my BOOST_PP_RDB_MPL_ASSERT macro and incorporate `n` in the identifier. Is there a better solution ? Thanks, J-L

1 0

ENH RQST: chdir in boost::filesystem
by Andrew Marlow 03 Nov '09

03 Nov '09

I have recently moved back to C++ from a 2 year spell with Java. The C++ code I am working on is for Windoze with Visual Studio 8. We are using boost 1.34.1. The prog I am working on has to do a few filesystem things so I have started to use boost::filesystem. However, there does not seem to be a way to change the current working directory using boost::filesystem. So I am forced to use chdir, which is _chdir on Windoze. On Unix the header for the prototype is in unistd.h, on Windoze it is in direct.h. So its back to good old ifdefs. Suddenly, java looks more attractive. Ifdefs are just so nostalgic.... Is there any chance this can be added to boost please? I realise that there may be more to it than just wrapping the chdir/_chdir call. There is the whole issue of return values versus exceptions, errno etc etc. I do not know what the current thinking is about these things in boost. Perhaps someone can enlighten me? -- Regards, Andrew M. http://www.andrewpetermarlow.co.uk

3 2

[date_time] Creating a ptime from a double
by Ryan McConnehey 03 Nov '09

03 Nov '09

A lot of the constructors of ptime deals with getting the current system time or time structures. I have a double with the seconds and fractional microseconds from midnight January 1, 1970. What is the best way to create a ptime object from this double? Ryan

2 4

Template operator() overloading for types in a mpl::vector
by Olivier Tournaire 03 Nov '09

03 Nov '09

Hi all, I am currently trying to write a simple functor, and I would like to have the same overload for the operator () for all types in a mpl::vector. // Types definitions // Gray image types typedef boost::mpl::vector< boost::gil::gray8_image_t , boost::gil::gray16_image_t , boost::gil::gray32_image_t, boost::gil::gray32F_image_t , boost::gil::gray64F_image_t > gray_image_types; // RGB image types typedef boost::mpl::vector< boost::gil::rgb8_image_t , boost::gil::rgb16_image_t , boost::gil::rgb32_image_t > rgb_image_types; // Functor to compute min / max of an image over channels struct pixel_compare_less { template <typename PixelType> bool operator()( const PixelType& p1 , const PixelType& p2 ) const { return at_c<0>(p1) < at_c<0>(p2); } }; struct any_view_min_max { typedef std::pair<float, float> result_type; template <typename View> result_type operator()(const View& v) const { typedef typename View::iterator iterator; std::pair< iterator, iterator > result = boost::minmax_element( v.begin() , v.end() , pixel_compare_less() ); return std::make_pair( *(result.first) , *(result.second) ); } }; This works fine for 'gray_image_types', but need to be specialized for types in rgb_image_types. The specialization is the same, so, I am looking for an automated way to do this. "Manually", I can write this: template <> any_view_min_max_optimized::result_type any_view_min_max_optimized::operator()<rgba8_view_t>(const rgb8_view_t& v) const { // ... } template <> any_view_min_max_optimized::result_type any_view_min_max_optimized::operator()<rgba16_view_t>(const rgb16_view_t& v) const { // ... } And so on ... Could you help me to have an efficient way to do this for all types 'rgb_image_types' without writing each specialization ? Regards, Olivier

2 4

[RegEx] Linking issues with boost 1.40.0 included directly in our tree
by Conrad Whelan 03 Nov '09

03 Nov '09

Hi, we use boost in our build, however, instead of using all of the Boost.Build and linking infrastructure, we integrate the source files directly into our build. We've always done things this way and had no problem. The implicit linking is a bit of a pain. However, now I have a strange issue. I am currently upgrading from 1.39.0 to 1.40.0, and am getting linking issues in the regex library. In particular, the linker is getting undefined references for boost::re_detail::perl_matcher in files where we create boost::regex and boost::regex_match objects. When I look through the source for the perl_matcher template, I can find it in the boost/regex/v4/perl_matcher.hpp include file, which we include within our build. I've also included the src/ and performance/ directories from boost/libs/regex in our build, and the linking still doesn't work. Perhaps someone has an incite into any preprocessor flags that I need to set in order to create an implementation for these missing functions in 1.40.0? Note, we had this working fine for 1.39.0, and I need to upgrade for a bugfix for a different boost library. thanks in advance, conrad

2 1

Re: [Boost-users] Template operator() overloading for types in a
by Tan, Tom (Shanghai) 03 Nov '09

03 Nov '09

>And so on ... Could you help me to have an efficient way to do this for all >types 'rgb_image_types' without writing each specialization ? Your situation seems similar to the one discussed here: http://stackoverflow.com/questions/1492204/is-it-possible-to-generate-ty pes-with-all-combinations-of-template-arguments. I actually refined the idea and modeled the mpl::for_each, and came up with this code pasted below for your reference.What you need to modify is to reduce the template arguments from 3 to 2 to suit your needs, hope it helps. #ifndef FOR_EACH_CARTESIAN_PRODUCT_H #define FOR_EACH_CARTESIAN_PRODUCT_H #include <boost/mpl/vector.hpp> #include <boost/mpl/begin.hpp> #include <boost/mpl/end.hpp> #include <boost/mpl/deref.hpp> #include <boost/type_traits/is_integral.hpp> #include <iostream> #include <typeinfo> /* usage 1: typedef recursive::for_each_cartesian-product< stock::map_containers, stock::shrinker_equal_filters, stock::shrinker_method_tags, RunnableBody > benchmark_type; benchmark_type::run_all(); usage 2: typedef recursive::for_each_cartesian-product< stock::map_containers, stock::shrinker_equal_filters, stock::shrinker_method_tags, RunnableBody >::each_product<> benchmark_type; benchmark_type::run(); */ namespace recursive { using boost::is_same; using boost::is_integral; using boost::mpl::begin; using boost::mpl::end; using boost::mpl::next; using boost::mpl::if_; using boost::mpl::deref; using boost::mpl::size; using boost::mpl::advance; using boost::mpl::distance; using boost::mpl::int_; using boost::mpl::eval_if_c; namespace detail { static unsigned int total_recursions = 0; } // generate a Cartesian Product of 3 type sequences and apply RunnableBody on each generated type template < class UTypes, // Forward Sequence, e.g. boost::mpl::vector class VTypes, // Forward Sequence, e.g. boost::mpl::vector class WTypes, // Forward Sequence, e.g. boost::mpl::vector class RunnableBody // class type that has a nested templated run() member function > struct for_each_cartesian_product { // forward declaration template < class UIterator, class VIterator, class WIterator > class each_product; struct end_of_recursion_tag { static void run(RunnableBody& f) { #ifndef NDEBUG std::cout << "End of " << detail::total_recursions << " recursions: RunnableBody = " << typeid(RunnableBody).name() << std::endl; #endif detail::total_recursions = 0; } }; // convenient interface to run RunnableBody on all generated types static void run_all(RunnableBody& f = RunnableBody()) { each_product<>::run(f); } // this class implements recursion body template < class UIterator, class VIterator, class WIterator > struct next_product { // u_begin is not necessary ;) // it would be cheaper not to pre-declare all of them since we force evaluation // however this dramatically increase the readability typedef typename begin<VTypes>::type v_begin; typedef typename begin<WTypes>::type w_begin; typedef typename end<UTypes>::type u_end; typedef typename end<VTypes>::type v_end; typedef typename end<WTypes>::type w_end; typedef typename next<UIterator>::type u_next; typedef typename next<VIterator>::type v_next; typedef typename next<WIterator>::type w_next; typedef typename if_< is_same<typename w_next, w_end>, typename if_< is_same<v_next, v_end>, typename if_< is_same<u_next, u_end>, end_of_recursion_tag, each_product< u_next, v_begin, w_begin > >::type, each_product< UIterator, v_next, w_begin > >::type, each_product< UIterator, VIterator, w_next > >::type type; }; // interface // this class run test on generated types in thos round and go to next*/ template < class UIterator = typename begin<UTypes>::type, class VIterator = typename begin<VTypes>::type, class WIterator = typename begin<WTypes>::type > struct each_product { // publc accessible internals of this type typedef typename each_product< UIterator, VIterator, WIterator > this_type; // types typedef typename deref<UIterator>::type UType; typedef typename deref<VIterator>::type VType; typedef typename deref<WIterator>::type WType; // index types typedef typename distance<typename begin<UTypes>::type, UIterator>::type UIndexType; typedef typename distance<typename begin<VTypes>::type, VIterator>::type VIndexType; typedef typename distance<typename begin<WTypes>::type, WIterator>::type WIndexType; // core static void run(RunnableBody& f = RunnableBody()) { // increment recursion counter ++detail::total_recursions; //f.template <this_type>(); f.operator()<this_type>(); // generate <<next>> target type and go to the next round of recursion typedef typename next_product< UIterator, VIterator, WIterator >::type next_type; next_type::run(f); } }; // alternative interface template < size_t UIndex = 0, size_t VIndex = 0, size_t WIndex = 0 > struct each_product_by_index { static_assert(UIndex <= size<UTypes>::type::value, "too large stock container index"); static_assert(VIndex <= size<VTypes>::type::value, "too large stock shrinker_group_number index"); static_assert(WIndex <= size<WTypes>::type::value, "too large stock shrinker_group_size index"); typedef typename begin<UTypes>::type u_begin; typedef typename begin<VTypes>::type v_begin; typedef typename begin<WTypes>::type w_begin; static void run(RunnableBody& f = RunnableBody()) { // delegate to iterator-version each_product< typename advance<u_begin, int_<UIndex> >::type, typename advance<v_begin, int_<VIndex> >::type, typename advance<w_begin, int_<WIndex> >::type >::run(f); } }; }; // an example test function class impl. struct print_typeid { template< class T> void operator()() const { typedef typename T::UType U; typedef typename T::VType V; typedef typename T::WType W; typedef typename T::UIndexType UIndex; typedef typename T::VIndexType VIndex; typedef typename T::WIndexType WIndex; // print the typeinfo std::cout << "this is a demo implementation.\n"; std::cout << detail::total_recursions << "[" << UIndex::value ", " << VIndex::value ", " << WIndex::value << "]" << ": " << typeid(U).name() << "," << typeid(V).name() << "," << typeid(W).name() << std::endl; } }; }// namespace recursive_test

1 0

Re: [Boost-users] Boost::Pool - Singleton_pool
by Paul Byrne 03 Nov '09

03 Nov '09

> From: Ondrej Sluciak <ondrej.sluciak(a)nt.tuwien.ac.at> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Boost::Pool - Singleton_pool > Message-ID: <4AEEFEED.7030905(a)nt.tuwien.ac.at> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Hi, > Is there a way on how to derive a class from pool::singleton_pool class? > Something like: > > template<typename T> > genericsingleton : boost::singleton_pool<boost::pool_allocator_tag, > sizeof(T)> > > If I want to do this I always get this error: > > Error 1 error C2248: > 'boost::singleton_pool<Tag,RequestedSize>::singleton_pool' : cannot > access private member declared in class > 'boost::singleton_pool<Tag,RequestedSize>' > c:\mycode\boosttest\boosttest\genericsingleton.h 23 > > Thank you for answer. > Hi Ondrej, I guess that you are getting this error when you try to construct an instance of your genericsingleton<> class. I don't believe that you will be able to do this because your base class has a private constructor. I suppose if you explain what your purpose is (by deriving from singleton_pool) then someone might be able to suggest a solution for you. Regards, Paul

1 0

Interrupting Socket connect()
by Simon Reye 02 Nov '09

02 Nov '09

If I have a socket like so: boost::asio::ip::tcp::socket tcpSocket; and call connect in a boost::thread like so: tcpSocket.connect(endPoint, error); It will 'hang' for up to 30 seconds if it can't immediately connect to the end point. If I interrupt() and join() the boost thread it has to wait for the connect() call to finish. Is there a way to cancel or interrupt the connect() call? Thanks Simon

2 1

Boost::Pool - Singleton_pool
by Ondrej Sluciak 02 Nov '09

02 Nov '09

Hi, Is there a way on how to derive a class from pool::singleton_pool class? Something like: template<typename T> genericsingleton : boost::singleton_pool<boost::pool_allocator_tag, sizeof(T)> If I want to do this I always get this error: Error 1 error C2248: 'boost::singleton_pool<Tag,RequestedSize>::singleton_pool' : cannot access private member declared in class 'boost::singleton_pool<Tag,RequestedSize>' c:\mycode\boosttest\boosttest\genericsingleton.h 23 Thank you for answer.

1 0

boost::thread on Windows CE?
by Frank Black 02 Nov '09

02 Nov '09

Hi, So I've finally succeded in building some libs I need for Windows CE, using STLPort. One of those libs is thread. It builds fine, but when I try to use it from a simple sample I get some link errors (see below). What I wonder is if threads is even possible to use under WinCE? Looking at the code, theres only a folder for pthreads and one for win32, but inside the win32 files there's some UNDER_CE switches. Anyone had success using it under wince? The link errors I get is: Error 1 error LNK2019: unresolved external symbol tss_cleanup_implemented referenced in function "void __cdecl boost::`anonymous namespace'::create_current_thread_tls_key(void)" (?create_current_thread_tls_key@?A0x78389a16@boost@@YAXXZ) libboost_thread-vc80-mt-sgdp-1_40.lib Error 2 error LNK2019: unresolved external symbol gmtime referenced in function "public: static struct tm * __cdecl boost::date_time::c_time::gmtime(unsigned long const *,struct tm *)" (?gmtime@c_time@date_time@boost@@SAPAUtm@@PBKPAU4@@Z) libboost_thread-vc80-mt-sgdp-1_40.lib Thanks!

1 0

[serialiization] Database archive
by Pascal Kesseli 02 Nov '09

02 Nov '09

Hi everyone Currently, I am planning to apply the boost serialization library to my entity objects for allowing me to serialize them to XML for transmission over SOAP. I would also very much appreciate the possibility to store these entities in a relational database, if possible without any additional effort. Thinking of this, the possibility of creating an sqlite implementation of the archive class came to my mind. Is the archive interface suitable for such a task, thinking of issues like primary key management and so on? Or does such an implementation already exist? Thank you for any recommendations and best regards Pascal

1 0

[thread] About the virtual in virtual operator()
by Richard Vock 02 Nov '09

02 Nov '09

I don't really know wether this is a Boost.Thread related question or a general c++ related, but since I couldn't decide I will disturb you first ;) Maybe you have the patience to look at this minimalistic framework (I stripped almost all functionality): http://pastebin.com/m7dcc833f This compiles well and running it gives me the expected: # starting # This is A # This is B # shutting down The problem is, that I want to run the kernels as threads. Have (again) a look at the highlighted lines (27-29): If I replace 27 by 28+29 I (expectedly) get a compile error since Kernel is abstract. However if I make it non-abstract by implementing the operator() in it, it is this function (namely Kernel::operator()) which get's called instead of TestKernel::operator(). Note that Program will not be able to know about the concrete child classes of Kernel so it cannot dynamic_cast<ConcretKernel*> the pointers and I don't want to use maschine-specific ways like __decltype. I imagine this is merely the old non-static member function pointer problem, however I tried dozens of ways to get around this and the only thing that worked was to add a ConcreteKernel::run() { thread t(*this); t.join(); } to *each* single child class of Kernel which gets rather un- managable with 50 and more descendants. I hope that made sense and that I didn't fail that hard, Richard Vock

3 4

[Spirit] xml parse tree printing double leaf node
by HT4N - 02 Nov '09

02 Nov '09

When I generating parse tree and dump it using the built-in tree-to-xml function, even from a simple grammar, I wonder why it prints out the leaf node twice. For instance: Parameter = ParameterName >> ParameterValue; The tree it prints it looks more or less like the following (note the repetition of ParameterName and ParameterValue nodes): <Parameter> <ParameterName> <ParameterName> <value>Foo</value> </ParameterName> </ParameterName> </ParameterValue> <ParameterValue> <value>Bar</value> </ParameterValue> </ParameterValue> </Parameter> I would be expecting more something like: <Parameter> <ParameterName> <value>Foo</value> </ParameterName> </ParameterValue> <value>Bar</value> </ParameterValue> </Parameter> Is there any directive or secret that I don't know ? Thanks HT _________________________________________________________________ Windows 7: I wanted more reliable, now it's more reliable. Wow! http://microsoft.com/windows/windows-7/default-ga.aspx?h=myidea?ocid=PID247…

3 4