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

[lambda] lambda member access
by Michał Nowotka 29 Jan '09

29 Jan '09

In function: void clean_data (MyMap& map) { remove_if(map.begin(), map.end(), (&lambda::_1 )->*(&pair< X* const, double >::second) <= m_epsilon); } where: typedef std::map<const X*,double> MyMap; I get error: c:\program files\microsoft visual studio 9.0\vc\include\algorithm(1240) : error C2582: 'operator =' function is unavailable in 'std::pair<_Ty1,_Ty2>' with [ _Ty1=const hapl::Haplotype *const , _Ty2=double ] c:\program files\microsoft visual studio 9.0\vc\include\algorithm(4949) : see reference to function template instantiation '_OutIt std::_Remove_copy_if<std::_Tree<_Traits>::iterator,_OutIt,_Pr>(_InIt,_InIt,_OutIt,_Pr,std::_Range_checked_iterator_tag)' being compiled with [ _OutIt=std::_Tree<std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>>::iterator, _Traits=std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>, _Pr=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::relational_action<boost::lambda::lessorequal_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::other_action<boost::lambda::member_pointer_action>>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::addressof_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,double std::pair<hapl::Haplotype *const ,double>::* const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const double,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>, _InIt=std::_Tree<std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>>::iterator ] c:\program files\microsoft visual studio 9.0\vc\include\algorithm(1309) : see reference to function template instantiation '_OutIt stdext::unchecked_remove_copy_if<std::_Tree<_Traits>::iterator,_FwdIt,_Pr>(_InIt,_InIt,_OutIt,_Pr)' being compiled with [ _OutIt=std::_Tree<std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>>::iterator, _Traits=std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>, _FwdIt=std::_Tree<std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>>::iterator, _Pr=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::relational_action<boost::lambda::lessorequal_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::other_action<boost::lambda::member_pointer_action>>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::addressof_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,double std::pair<hapl::Haplotype *const ,double>::* const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const double,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>, _InIt=std::_Tree<std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>>::iterator ] c:\users\kott\documents\visual studio 2008\projects\mbi\implementation\src\main.cpp(631) : see reference to function template instantiation '_FwdIt std::remove_if<std::_Tree<_Traits>::iterator,boost::lambda::lambda_functor<T>>(_FwdIt,_FwdIt,_Pr)' being compiled with [ _FwdIt=std::_Tree<std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>>::iterator, _Traits=std::_Tmap_traits<const hapl::Haplotype *,double,std::less<const hapl::Haplotype *>,std::allocator<std::pair<const hapl::Haplotype *const ,double>>,false>, T=boost::lambda::lambda_functor_base<boost::lambda::relational_action<boost::lambda::lessorequal_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::other_action<boost::lambda::member_pointer_action>>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::addressof_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,double std::pair<hapl::Haplotype *const ,double>::* const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const double,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>, _Pr=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::relational_action<boost::lambda::lessorequal_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<2,boost::lambda::other_action<boost::lambda::member_pointer_action>>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::other_action<boost::lambda::addressof_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,double std::pair<hapl::Haplotype *const ,double>::* const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,const double,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>> ] I don't get it because i found somewhere (http://www.lukaszczerwinski.pl/boost_lambda_member_access.html) similar example that (should) work fine: std::map< std::string , int > someMap; using boost::lambda::_1; std::for_each( someMap.begin(), someMap.end(), std::cout << ( & _1 ) ->* ( & std::pair< std::string const, int >::first ) << std::endl ); -- Michał Nowotka

2 1

[Thread] How to invoke a memory fence?
by Radosavljevic, Branko 29 Jan '09

29 Jan '09

I have a newbie question about using Boost.Thread to invoke a memory fence operation. What are the memory fence guarantees associated with the synchronization concepts in Boost.Thread? My specific use case involves one writer and several readers. For example, something like: bool available = false; int value; // Writer thread value = getValue(); available = true; // A reader thread while (!available) yield(); doSomething(value); In other words, the write to available should have release semantics, and the read from available should have acquire semantics. I realize I can use platform-specific commands, but I'd rather not. I assume that if I want to use Boost.Thread, I'll need to use a mutex, but I don't see any discussion of memory fence issues in the documentation. Thanks, Branko Any information contained in or attached to this e-mail is intended solely for the use of the intended recipient(s), is confidential and may contain information that is legally privileged. If you are not an intended recipient of this e-mail, please notify the sender of the delivery error and then please delete and destroy all copies and attachments, and be advised that any review or dissemination of, or the taking of any action in reliance on, the information contained in or attached to this e-mail is expressly prohibited. See http://www.bankofamerica.com/emaildisclaimer (if this link is not clickable, please copy and paste the link into your browser address bar) for further important information on confidentiality, the risks inherent in electronic communication (including the possibility that e-mail messages cannot be guaranteed to be secure or free of errors or viruses), some of our policies regarding transactions and pricing and certain other matters.

3 3

BOOST_NO_EXCEPTIONS problem when C++ Exceptions are disabled
by rroc 29 Jan '09

29 Jan '09

Hi, I 'm trying to create a msvc project with C++ Exceptions disabled, as well as defined BOOST_NO_EXCEPTIONS and _HAS_EXCEPTIONS=0. This requires me to define a custom exception routine. All of this goes smoothly, but there is a problem with boost. Even when the BOOST_NO_EXCEPTIONS is set, the following boost files: exception\diagnostic_information.hpp exception_ptr.hpp ...are using try-catch blocks and because of this give a warning: warning C4530: C++ exception handler used, but unwind semantics are not enabled. Am I using this somewhat wrong or should I just modify the files to for example always ::boost::throw_exception()? Thanks, Johannes Rajala -- View this message in context: http://www.nabble.com/BOOST_NO_EXCEPTIONS-problem-when-C%2B%2B-Exceptions-a… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[partly: Boost.Function] typesafe (templated) wrapper around class with void* API
by Christoph Duelli 29 Jan '09

29 Jan '09

[This question has a Boost.Function relation later on. Sorry if too off topic.] I have a class that works on some data structures. This class' API uses void* to be general and avoid code duplication that using a template here would incur. Basically: class A // simplification { // Assume A to be a "fat" class there are more methods // working on void* // and lots of code put away into a .cpp file. We don't // want that duplicated by many template instantiations. public: // Most of the work is generic and independent from the // data types worked on. void do_something(void*); protected: // some work has to be done be the subclass virtual bool help_me(const void*) =0; }; I do not like using void* all that much. Thus I would like to create a type-safe (generic) thin wrapper class. Using inline functions,the idea is that the run time penalty (at least for do_something) is low and casts from/and to void are all 'hidden' here. template<typename T> class B : public A { public: void do_something(T* t) { A::do_something(t); } protected: // Force user to provide a correctly typed callback. virtual bool help_me(const T*) =0; private: // call the user's safe callback bool help_me(const void* t) { return help_me(static_cast<const T*>(t)); } }; and finally class C : public B<MyStruct> { bool help_me(const MyStruct* ms) { ... } }; Is this a good way to do that? More specific questions: i) I assume the penalty for my callback "help_me" is one more indirection. Can't see that optimized away. ii) Assuming A's interface gets passed a real callback function (a Boost.Function) instead: class A { public: typedef boost::function<bool(const void*)> helper_func; void do_something(void*, helper_func); }; is it somehow possible to get a typesafe templated B such that template<typename T> class B : public A { public: typedef boost::function<bool(const T*)> helper_func; void do_something(T* t, helper_func hf) { // this makes my compiler unhappy (when instanced). // I do understand that... can it be worked around somehow? A::do_something(t, hf); } }; I would like to be able to pass a function working on T* rather than void*. While writing this posting have found the following to compile: template<typename T> struct ToVoidWrapper { typedef boost::function<bool(const T*)> helper_func; helper_func hf_; ToVoidWrapper(const helper_func &hf) : hf_(hf) {} bool func(const void *t) const { return hf_(static_cast<const T*>(t)); } }; with do_something in B: void do_something(T* t, helper_func hf) { ToVoidWrapper<T> vw(hf); A2::do_something(t, boost::bind(&ToVoidWrapper<T>::func, &vw, _1)); } I am not really looking forward to writing such "forwarding to void*" functions. Are there alternatives? Maybe something in Boost that I have overlooked? Or a standard C++ idiom I am not aware of? I have attached compilable code that sums up the above code snippets so far. Thank you for looking into this and best regards Christoph

2 2

Help with (possibly MPL) pattern for a viewer that may contain a copy of statically allocated data
by Jesse Perla 29 Jan '09

29 Jan '09

I am wondering what the best pattern/approach for a data structure that may contain either a reference or a copy of some data used in a constructor. I would love the opportunity to have the data structure capable of conditionally storing the data for the data copy on the stack. Are there any fancy generic tricks/patterns to do this using boost::mpl, etc.? So to put in some pseudocode notes for discussion to get the point across of what I think I want: boost::array< boost::array<double, M>, N> myaxis; //creates axis in a stack allocated data structure. regular_grid<M, N, COPYDATA> my_grid(axis_values); regular_grid<M, N, REFDATA> my_grid(axis_values); template<int M, int N, int ConstructionPolicy> class regular_grid { boost::array< boost::array<double, M>, N>& axis_ref_; //Reference to the axis, either static or actual reference. All code in the class would use this, not axis_ STATIC_IF(ConstructionPolicy == COPYDATA) { boost::array< boost::array<double, M>, N> axis_; regular_grid(const boost::array< boost::array<double, M>, N>& axis) : axis_(axis), axis_ref_(axis_) //constructor makes copy, sets ref to copy. { } } STATIC_ELSE(ConstructionPolicy == REFDATA) { regular_grid(const boost::array< boost::array<double, M>, N>& axis) : axis_ref_(axis) {} //constructor just uses the ref. } }; Is this possible? any ideas on code to look at to see how to do it?

7 7

[lambda] newbie: lambda to help in std::accumulate
by Michał Nowotka 29 Jan '09

29 Jan '09

I want to compute sum of logarithms so i wrote: #include <cmath> double evaluate(const vector<double>& win_probabls) { return accumulate (win_probabls.begin(), win_probabls.end(), 0, lambda::_1 + log(lambda::_2) ); } but this code doesn't compile. Does anyone know why? -- Michał Nowotka

3 4

RBGL use with BGL minCut() function
by Gianni Loiacono 29 Jan '09

29 Jan '09

Hi all, sorry for my poor english. I want to use RBGL http://bioconductor.org/packages/2.3/bioc/html/RBGL.html into my project (I use BGL) for to use the function minCut() for to obtain the minimum cut and **the list of two subsets (S and V-S) cutted from the algorithm** (for me this is an import "thing"). I have readed all pdfs all docs, but I don't understand how I can use this library/dll in my project. Also, I have tried to add the sources files to my project (mincut.cpp, mincut.hpp, RBGL.hpp) and rebuild all, but the compiler don't find the Rdefines.h include file :°(. Please, somebody can help me with some example? I use C++ Mingw compiler and Code::block editor. Thanks a lot :-)

2 1

Simple serialization of int*
by Sahrah 29 Jan '09

29 Jan '09

Hi all, I am looking for a solution to do this: int p1 = 5; int* test; test = &p1; std::ofstream out("test.bin"); boost::archive::binary_oarchive ar(out); ar << test; it does not compile. I get: Error 9 error C2228: left of '.serialize' must have class/struct/union c:\...\boost_1_37_0\boost\serialization\access.hpp I am using MSVC9. Boost 1.37.0 thanks, Sahrah -- View this message in context: http://www.nabble.com/Simple-serialization-of-int*-tp21713482p21713482.html Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

Boost.Asio 1.37 - can't compile with VC++ 2003 (version 1.35 is fine)
by lipik 29 Jan '09

29 Jan '09

Hi, I just upgraded my Boost distribution, and have immediately run into a compilation problem: both Intel and VC++ compilers complain that: - 'QueueUserAPC' : is not a member of 'operator``global namespace''' - 'QueueUserAPC': identifier not found, even with argument-dependent lookup 1.35 compiles fine. I checked and this API is available in Winbase.h. Can't figure out why it is not being found - there don't seem to be be any C++ version directives hiding it inside winbase. I am on XP, and _WIN32_WINNT is set to 0x0501, so this is not the culprit either. Pre-compiled headers are turned off, and I have defined WIN32_LEAN_AND_MEAN (to avoid winsock conflict). Any help greatly appreciated. Thanks Amit

2 1

Function for Replace NaN with Zero and Vector2Vector Concordance
by Gundala Viswanath 29 Jan '09

29 Jan '09

Dear all, I have two questions: 1. What's the way in Ublas to replace Nan with Zero, be it in Vector or Matrix? 2. What's the way to check vector 2 vector concordance. E.g. vector <int> V1 += 1,2,3; vector <int> V2 + =1,2,3; if we do that_func(V1,V2), it will returns true. - Gundala Viswanath Jakarta - Indonesia

1 0