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

Bug in Ublas' Inner Product between Matrix and Vector?
by Gundala Viswanath 30 Jan '09

30 Jan '09

Hi all, I am trying to perform an inner product multiplication with ublas between this Matrix and Vector: ublas::matrix <double> inputMat (5,5,0); [5,5]((0.994704,0.000882587,0.000882587,0.000882587,0.00264776),(0.00527045,0.989459,0.00263523,0.00263523,0),(0,0,0.00528298,0,0),(0,0,0,1,0),(0,0,0,0,1)) ublas::vector <double> inputVec (5); [5](0.4,0.2,0.2,0.2,0.2) The result I get is this: [5](0.398941,0.201054,0.0010566*,0.2,0.2) Where as the correct one should be (using R): 0.3999707,0.1981258,0.2007013*,0.2007013,0.2005310 Note the significant discrepancy in the 3rd element (*). The product command I use is this: ublas::vector <double> Result (5); Result = ublas::prod(inputMat,inputVec); Is there anything wrong with my way of doing inner product or it is a bug? - Gundala Viswanath Jakarta - Indonesia

2 1

linking boost in a shared library using -fPIC
by jono 30 Jan '09

30 Jan '09

hi. i'm building a shared library under gcc 4.1.1 which links some boost 1.33.1 libraries. a predecessor added the -fPIC switch to the Jamfiles of boost 'thread', 'date_time' and 'regex', and i have had no problems linking them. i've added the boost 'filesystem' library to the project and similarly patched the Jamfile... . . . lib boost_filesystem : ../src/$(SOURCES).cpp : # build requirements <define>BOOST_FILESYSTEM_STATIC_LINK <include>$(BOOST_ROOT) <sysinclude>$(BOOST_ROOT) <no-warn>exception.cpp <no-warn>operations_posix_windows.cpp #******************** <gcc><*><cxxflags>"-fPIC" #******************** # common-variant-tag ensures that the library will # be named according to the rules used by the install # and auto-link features: common-variant-tag : debug release # build variants ; . . . ... and recompiled boost. but i still get the following linker error. ------------------------------------------------------------- gcc-Link-action bin/blablabla/libinterpreter.so/gcc/debug/shared-linkable-true/threading-multi/libinterpreter.so /usr/bin/ld: /home/jono/lib/boost/bin_linux/debug/libboost_filesystem.a(operations_posix_windows.o): relocation R_X86_64_32 against `a local symbol' can not be used when making a shared object; recompile with -fPIC /home/jono/lib/boost/bin_linux/debug/libboost_filesystem.a: could not read symbols: Bad value ------------------------------------------------------------- can anyone spot my deliberate mistake? cheers Jono

1 0

from range_iterator to range_value
by er 29 Jan '09

29 Jan '09

Hello, Is this, or a class that achieves the same goal, already defined somewhere in the boost? template<typename R> struct range_value{ typedef typename iterator_value<typename boost::range_iterator<R0>::type>::type type; }; Thanks.

2 2

[serialization] Support for smart pointers?
by Robert Dailey 29 Jan '09

29 Jan '09

Hi, The documentation for Boost.Serialization states that support for loading/saving pointers is fully supported out of the box. However, what if I want to use smart pointers, such a boost::scoped_ptr? Right now I believe I would have to do this: Foo* foo1; archive & foo1; boost::scoped_ptr<Foo> foo2( foo1 ); I was thinking it would be convenient to avoid the extra variable (foo1) and do this: boost::scoped_ptr<Foo> foo2; archive & foo2; Is this possible?

1 1

[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

Re: [Boost-users] Extending boost::function for mathematics?
by Jesse Perla 29 Jan '09

29 Jan '09

Thanks as always Stephen (who I still refuse to accept is either a single individual or human): Sorry to all if this is getting so long and specific, this project is justified later. Your comments generated a lot of thought about what my main problems are. I think I distracted myself by the generation of derivatives here before I had worked out some other issues. But your implementation looks very elegant. For now lets assume that people supply the gradient/jacobian directly or from their own finite_difference/autodifferentiation. So here are some, more basic, questions. Question 1: Based on your template, how do I forward a function to the boost::function's operator() in this wrapper? Why might we want to do this? Because we are trying to implement a concept with operator() and .gradient(..) with a function wrapper here. Library writers may want to write generic code that operates on any of these, not just ones wrapped in math_function... Then we may end up with true inlining of operator() and .gradient(...) when a full differentiable function object is implemented, instead of always going through an indirection pointer in boost::function. template<class Signature> class math_function { public: typedef boost::function<Signature>::result_type result_type; template<class F> math_function(const F& f, const G& f) : f_(f) : g_(g) {} result_type operator()(How to extract from the signature the input parameters? myvalues...) { return f_(myvalues....); } result_type gradient()(How to extract from the signature the input parameters???????) { return g_(myvalues...); } private: boost::function<Signature> f_; boost::function<Signature> g_; }; void test_mathfunctions() { using lambda::_1; using lambda::_2; math_function<double (double)> myfunc(_1*_1, 2* _1); //simple quadratic cout << myfunc(.1); cout << myfunc.gradient(.1); } Question 2: How can this wrapping interact with binding? void test_mathfunctions_binding() { using lambda::_1; using lambda::_2; //But you might also want a constant thrown in there... Why a separate parameter? Because you don't take the derivative over the other stuff. And you want to keep your functions pure so you can bind, not force them to be stateful, etc. math_function<double (double, double)> myfunc(_1*_1 + _2, 2* _1); //simple quadratic translated by a constant //But how would you work with bind? Would these following work immediately? boost::function<double (double)> myfunc_bound = bind(myfunc, _1, 2.0); boost::function<double (double)> myfuncderiv_bound = bind(myfunc::gradient, _1, 2.0); //or something like this... I always forget member function notation. //Any way to bind that entire structure back to a math_function? Very useful since we would bind parameters before calling optimizers, etc. With dynamic programming we usually have a grid of values and call the optimizer binding over the entire grid. math_function<double (double)> myfunc_bound = math_bind(myfunc, _1, 2.0); cout << my_func_bound.gradient(1.0); //Note that the binding can now use the gradient. } Question 3: How would we adapt a structure implementing the operator() and gradient() to be stored here? Just like boost::function accepting any function object? struct square { double operator()(double x) {return x * x;} double gradient(double x){return 2 * x;} }; math_function<double (double)> myfunc(square); Given the previous code, would we write a constructor like?: template<class F> math_function(const F& f) : f_(f), g_(bind(F::gradient, f, _1...?) //Here I don't see how to bind to the arbitrary signature, extracting the inputs from the Signature which (may) be more than 1 Question 3: What are the thoughts on whether/how this is extensible to higher dimensions? Lets start on the gradient with mapping functions: f : R^N -> R It is perfectly reasonable for these types of problems for the first parameter in the function to be the only one that the derivative is taken over. The dimensionality of the derivative/gradient/jacobian would come out of a combination of the result_type from the signature and the dimensionality of the domain. For example, something like: template<int DomainDim, class Signature> class math_function { public: typedef boost::function<Signature>::result_type result_type; typedef boost::array<DomainDim, result_type> gradient_result_type; //Note that this adds the dimensionality, the data structure could be a template parameter. template<class F> math_function(const F& f, const G& f) : f_(f) : g_(g) {} result_type operator()(How to extract form the signature the input parameters???????) { return f_(Signature); } gradient_result_type gradient()(How to extract form the signature the input parameters???????) { return g_(Signature); } private: boost::function<Signature> f_; boost::function<gradient result_type with OLD INPUT Signature> g_; }; void test_mathfunctions_multidim() { using lambda::_1; using lambda::_2; boost::array<double, 2> mygrad(boost::array<double, 2> x, double a) {boost::array<double, 2> ret; ret[0] = 2*x[0]; ret[1] = 2*x[1]; }; //I put this separately since I don't know how to construct arrays in lambda math_function<2, double (boost::array<double, 2> , double)> myfunc(pow(_1[0]*, 2) + pow(_1[1], 2) + _2, mygrad); cout << myfunc.gradient({{0.0, 0.0}}); //etc. } Question 4: Now lets say that what we really want is to manage f: R^N -> R^M functions. Here, we could potentially use ublas::matrix as a default data structure. template<class Signature, class SecondDimStructure = ublas::matrix, template <class T, int N> class NDimStructure = boost::multi_array > //We really don't need the dim's here since we are using heap based data structures. class math_function { public: typedef boost::function<Signature>::result_type result_type; typedef SecondDimStructure gradient_result_type; //This really is a jacobian, size N * M typedef NDimStructure<result_type::value_type, 4> hessian_result_type; //This really is size (N*M) ^2 if I remember my calculus.... template<class F> math_function(const F& f, const G& f) : f_(f) : g_(g) {} result_type operator()(How to extract form the signature the input parameters???????) { return f_(Signature); } gradient_result_type gradient()(How to extract form the signature the input parameters???????) { return g_(Signature); } private: boost::function<Signature> f_; boost::function<gradient result_type with OLD INPUT Signature> g_; //should add in the higher dimensional hessian of the function if I remember }; Question 5: I want to also associate information about the nature of the function. Whether it is convex/concave, increasing, strictly increasing, etc. These tend to have an inheritance structure, but it isn't absolutely necessary. I was thinking about using trait classes. But I assume that we would lose all those traits when we use type erasure? Are we better off storing a bunch of enums in this data structure? Increasing the size of the class shouldn't be an issue. Question 6: Let me justify why this is all very useful and a general problem: Right now, everyone writing non-linear algorithms in C++ has their own structures for managing mathematical functions that contain derivatives, jacobians, hessians. I am running into this right now because I am trying to wrap a bunch of other people's algorithms for my own work. A few comments: 1) Everyone is using dynamic polymorphism for these overloading a virtual operator() and some type of gradient/jacobian... I assume this is because there is no agreed upon concept for functions objects with gradients... In reality, none of these seem to require dynamic polymorphism. Why shouldn't a newton's method optimizer have inlining of the operator() and derivative through static polymorphism where possible? 2) Most of these guys have conflated functionality/settings specific to their optimizers/solves with the evaluation of the function/gradient. This makes generic code difficult without wrappers/adapters. 3) Many use their own data structures for arrays, matrices, multidim results. This may be inevitable, but means that you need to have these types parameterized in any mathematical callback routine. 4) While a lot could be gained from having people agree on a static concept for mathematical applications akin to standardizing on operator() for functors, it is also very useful to have a generic callback wrapper akin to boost;:function. The main reason for this is that you will tend to write parameterized, pure functions where you want to bind parameters. Worst case, people could write their own functions with this mathematical callback structure and adapters could be written for the different libraries. 5) Not to disparage these superb libraries, but a few examples to see what I mean: http://quantlib.org/reference/class_quant_lib_1_1_cost_function.html and http://trilinos.sandia.gov/packages/docs/r6.0/packages/didasko/doc/html/nox… and http://www.coin-or.org/CppAD/Doc/ipopt_cppad_simple.cpp.xml If anyone is interested in working with me on this very interesting and useful problem, please give me an email. I think it has a lot of potential for general use. -Jesse

11 19

Re: [Boost-users] Boost and K-Cuts
by Gianni Loiacono 29 Jan '09

29 Jan '09

Hi mr. Zeljko Vrba, I have downloaded and readed the soruce file for build the GoHu tree. It uses a different implement approch from Boost....;°( I don't understand very well the source, but I have understand that if I want to add it to my project I must "revolutionize" my source :( :( Sorry for my eng. ;) Bye.

1 0

Re: [Boost-users] top posting, was boost::proto helpful for a compiler project?
by raindog＠macrohmasheen.com 29 Jan '09

29 Jan '09

I know its a rule, but I think it is dumb. My phone does not even support botting posting for example, does that mean I'm not allowed to post to this newgroup? my guess is that it started off with a few people wanting to separate themselves from others by usage of arbitrary rules in order to obtain some form of "l33tn3$$" without having actually considering the merits or lack thereof ubtil after their motives were question in which scenario artificial ones were created to support the habbit. Modern mail clients (my phone not one of them) support threaded mail anyways and so what you get is the same email. 100 times in a thread. There has been the argument that if you were ob a forum that they go by bottom posting but again modern mail clients support threading anyways, and I don't know about you, but I can't recall the last time I was reading a forum and every post included included the entirety of the posts to the thread prior. Lastly, why would you ever want to pick up a thread by reading the middle of it? Using the forum analogy, one would be hard pressed to find someone whose month was to always read a thread by starting on page 12, so, group by thread and read from the start ------Original Message------ From: Eric Niebler Sender: boost-users-bounces(a)lists.boost.org To: boost-users(a)lists.boost.org ReplyTo: boost-users(a)lists.boost.org Sent: Jan 26, 2009 4:42 PM Subject: Re: [Boost-users] boost::proto helpful for a compiler project? Please don't top-post. See http://www.boost.org/community/policy.html#effective peter_foelsche(a)agilent.com wrote: > Eric Niebler wrote: >> peter_foelsche(a)agilent.com wrote: >>> How can boost proto help me in my compiler project? >>> >>> Is it another way to write a grammar and parse it? >> >> If by "compiler" you mean something that reads a text file, parses >> it according to a grammar and Does Something, then Proto is *not* >> what you are looking for. Use Boost.Spirit. >> > ok. Can you give me an application area for boost::proto? In short I > don't understand what DomainSpecificEmbeddedLanguage means. The term is defined in Proto's documentation, and many examples are given there. http://boost-sandbox.sf.net/libs/proto HTH, -- Eric Niebler BoostPro Computing http://www.boostpro.com _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users Sent from my Verizon Wireless BlackBerry

6 5

Boost.Parameters: are static member functions possible somehow?
by Joost Kraaijeveld 28 Jan '09

28 Jan '09

Hi, I can generate global and ordinary member functions with Boost.Parameters. But I would like to create static member functions. IS that somehow possible? I have looked at the macros of the library but I did not get any wiser :-(. So is it possible, and if so, how? TIA -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

2 1

Install on Mac OS
by rolf ngondo 28 Jan '09

28 Jan '09

Hi all! I'm developping an application using boost on MAC OS X, using CMake as system compiler. I succesfully built the same application with CMake on windows and it works fine. But on Mac OS, the build fails. It sounds like CMake failed finding boost include directory. I tried the bjam command : bjam --builddir=anydir --toolset=gcc --with-some_boost_lib install. I got libs but it skipps creating any directory on /usr/local/. If anyone succeeded on installing boost properly in /usr/loal... please help. One more thing, since I'm using CMake, I can't use boost version later than 1.36.0. Thanks to all.

3 5

[BGL] - deriving from filtered_graph
by Michael Fawcett 28 Jan '09

28 Jan '09

When using a type that I derived from filtered_graph, if I use operator[] on the instance, e.g. derived_from_filtered_graph_instance[descriptor].foo = bar; I get the following error: C:\dev\vendor\boost\1.37.0\boost/graph/graph_traits.hpp(124) : error C2039: 'edge_bundled' : is not a member of 'btra::restricted_graph<Graph>' 1> with 1> [ 1> Graph=btra::undirected_graph 1> ] 1> C:\dev\vendor\boost\1.37.0\boost/graph/graph_traits.hpp(137) : see reference to class template instantiation 'boost::edge_bundle_type<G>' being compiled 1> with 1> [ 1> G=btra::restricted_graph<btra::undirected_graph> 1> ] 1> C:\dev\btra\trunk\btra/two_way/esri_io.h(186) : see reference to class template instantiation 'boost::graph::detail::bundled_result<Graph,Descriptor>' being compiled 1> with 1> [ 1> Graph=btra::restricted_graph<btra::undirected_graph>, 1> Descriptor=boost::detail::edge_desc_impl<boost::undirected_tag,__w64 unsigned int> 1> ] and if I typedef edge_bundled in the derived class, everything seems to work okay. filtered_graph doesn't contain the typedef, the Graph type does, so does this mean that to be more correct I should specialize graph_traits for my derived type, or is just having the typedef enough? Also, in the filtered_graph documentation, it says it models VertexAndEdgeListGraph and PropertyGraph, but neither of those concepts mention edge_bundled as an associated type. Thanks in advance, --Michael Fawcett

2 3

[serialization]Runtime Exception While Loading Old Serialized XML Files w/ 1.38
by Yaser Zhian 28 Jan '09

28 Jan '09

Hello list, I have a bunch of XML files that have been serialized using Boost.Serialization (the standard XML archive) and were working fine until we upgraded to the boost trunk a few days ago (unfortunately, I can't tell exactly what repository revision were used to generate the archives, but I know they were custom builds of pre-release 1.37 trunk, and the file_version attribute in the XML is set to 4.) Also, we use MSVC9.0sp1 for building everything. As soon as we upgraded to the trunk, we started getting runtime exceptions (invalid archive format) on some of our larger files. I think I have tracked it down to an incompatibility between version 4 and version 5 files that the newer build fails to take into consideration, the details of which (as far as I could find out) follows. In our data structures there is an std::list of pointers to objects previously serialized in the same serialization operation (which means these repeated pointers are stored as a reference to the previous object and the data is not duplicated.) Using the old library, when this list was being serialized, apparently the "item_version" was not being written (only the "count" filed and the "item"s were.) The old library apparently didn't expect to read this either, so everything worked out nicely. The new library however, expects an "item_version" field and throws when it doesn't find one. As I trace into the serialization library, I can see that there is logic there for new libraries to be able to handle archive format changes through time. Now my question is whether this "discrepancy" is actually a bug in either the older or the new code, or failing to handle the format change is a bug, or this issue has already come up and been dealt with in some other way? (how?) I should also mention that it is quite probably that the problem be in our code, but I have no idea how. I would appreciate any help in locating it. Any pointers, help, clues and general wisdom is greatly appreciated. -yzt

2 3

need help building boots
by Vincenzo Calo' 28 Jan '09

28 Jan '09

Hi, my log file was scrubbed in my previous post. So I'm posting it again, sorry. I'm a newbie and I'm trying to build boost on a Mac OS X 10.4.11. I'm not able to generate the dylib files so something is going wrong. dhcp25:/usr/local/lib/boost_1_37_0 root# ./configure --with- libraries=iostreams Building Boost.Jam with toolset darwin... tools/jam/src/bin.macosxx86/ bjam Unicode/ICU support for Boost.Regex?... not found. Backing up existing Boost.Build configuration in user-config.jam.4 Generating Boost.Build configuration in user-config.jam... Generating Makefile... dhcp25:/usr/local/lib/boost_1_37_0 root# make install ./tools/jam/src/bin.macosxx86/bjam --user-config=user-config.jam -- prefix=/usr/local --exec-prefix=/usr/local --libdir=/usr/local/lib -- includedir=/usr/local/include --with-iostreams install ...patience... ...found 14372 targets... ...updating 21 targets... MkDir1-quick-fix-for-unix bin.v2/libs/iostreams MkDir1-quick-fix-for-unix bin.v2/libs/iostreams/build MkDir1-quick-fix-for-unix bin.v2/libs/iostreams/build/darwin-4.0.1 MkDir1-quick-fix-for-unix bin.v2/libs/iostreams/build/darwin-4.0.1/ release MkDir1-quick-fix-for-unix bin.v2/libs/iostreams/build/darwin-4.0.1/ release/threading-multi darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ threading-multi/file_descriptor.o /var/tmp//cc3iqlUI.s:7843:Complex expression. Absolute segment assumed. /var/tmp//cc3iqlUI.s:7845:Complex expression. Absolute segment assumed. /var/tmp//cc3iqlUI.s:7850:Complex expression. Absolute segment assumed. /var/tmp//cc3iqlUI.s:7852:Complex expression. Absolute segment assumed. /var/tmp//cc3iqlUI.s:7856:Complex expression. Absolute segment assumed. ... "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline - Wall -dynamic -no-cpp-precomp -gdwarf-2 -Wno-long-double -fPIC - DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_DYN_LINK=1 -DNDEBUG -I"." -c - o "bin.v2/libs/iostreams/build/darwin-4.0.1/release/threading-multi/ file_descriptor.o" "libs/iostreams/src/file_descriptor.cpp" ...failed darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/ release/threading-multi/file_descriptor.o... darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ threading-multi/mapped_file.o /var/tmp//ccuFxoHi.s:15391:Complex expression. Absolute segment assumed. /var/tmp//ccuFxoHi.s:15393:Complex expression. Absolute segment assumed. /var/tmp//ccuFxoHi.s:15398:Complex expression. Absolute segment assumed. /var/tmp//ccuFxoHi.s:15400:Complex expression. Absolute segment assumed. .... "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline - Wall -dynamic -no-cpp-precomp -gdwarf-2 -Wno-long-double -fPIC - DBOOST_ALL_NO_LIB=1 -DBOOST_IOSTREAMS_DYN_LINK=1 -DNDEBUG -I"." -c - o "bin.v2/libs/iostreams/build/darwin-4.0.1/release/threading-multi/ mapped_file.o" "libs/iostreams/src/mapped_file.cpp" ...failed darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/ release/threading-multi/mapped_file.o... darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ threading-multi/zlib.o darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ threading-multi/bzip2.o ...skipped <pbin.v2/libs/iostreams/build/darwin-4.0.1/release/ threading-multi>libboost_iostreams-xgcc40-mt-1_37.dylib for lack of <pbin.v2/libs/iostreams/build/darwin-4.0.1/release/threading- multi>file_descriptor.o... ...skipped <p/usr/local/lib>libboost_iostreams-xgcc40-mt-1_37.dylib for lack of <pbin.v2/libs/iostreams/build/darwin-4.0.1/release/ threading-multi>libboost_iostreams-xgcc40-mt-1_37.dylib... ...skipped <p/usr/local/lib>libboost_iostreams-xgcc40-mt.dylib for lack of <p/usr/local/lib>libboost_iostreams-xgcc40-mt-1_37.dylib... MkDir1-quick-fix-for-unix bin.v2/libs/iostreams/build/darwin-4.0.1/ release/link-static MkDir1-quick-fix-for-unix bin.v2/libs/iostreams/build/darwin-4.0.1/ release/link-static/threading-multi darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ link-static/threading-multi/file_descriptor.o /var/tmp//ccgEKwgZ.s:7843:Complex expression. Absolute segment assumed. / "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline - Wall -no-cpp-precomp -gdwarf-2 -Wno-long-double -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/darwin-4.0.1/ release/link-static/threading-multi/file_descriptor.o" "libs/ iostreams/src/file_descriptor.cpp" ...failed darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/ release/link-static/threading-multi/file_descriptor.o... darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ link-static/threading-multi/mapped_file.o /var/tmp//ccDow0aV.s:15391:Complex expression. Absolute segment assumed. /var/tmp//ccDow0aV.s:15393:Complex expression. Absolute segment assumed. /var/tmp//ccDow0aV.s:15398:Complex expression. Absolute segment assumed. /var/tmp//ccDow0aV.s:15400:Complex expression. Absolute segment assumed. /var/tmp//ccDow0aV.s:15404:Complex expression. Absolute segment assumed. /var/tmp//ccDow0aV.s:35405:Complex expression. Absolute segment assumed. "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline - Wall -no-cpp-precomp -gdwarf-2 -Wno-long-double -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/iostreams/build/darwin-4.0.1/ release/link-static/threading-multi/mapped_file.o" "libs/iostreams/ src/mapped_file.cpp" ...failed darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/ release/link-static/threading-multi/mapped_file.o... darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ link-static/threading-multi/zlib.o darwin.compile.c++ bin.v2/libs/iostreams/build/darwin-4.0.1/release/ link-static/threading-multi/bzip2.o ...skipped <pbin.v2/libs/iostreams/build/darwin-4.0.1/release/link- static/threading-multi>libboost_iostreams-xgcc40-mt-1_37.a for lack of <pbin.v2/libs/iostreams/build/darwin-4.0.1/release/link-static/ threading-multi>file_descriptor.o... ...skipped <p/usr/local/lib>libboost_iostreams-xgcc40-mt-1_37.a for lack of <pbin.v2/libs/iostreams/build/darwin-4.0.1/release/link- static/threading-multi>libboost_iostreams-xgcc40-mt-1_37.a... ...skipped <p/usr/local/lib>libboost_iostreams-xgcc40-mt.a for lack of <p/usr/local/lib>libboost_iostreams-xgcc40-mt-1_37.a... ...failed updating 4 targets... ...skipped 6 targets... ...updated 11 targets... Not all Boost libraries built properly. Thanks a lot for your help. Best, Vincenzo

1 0

help building boost
by Vincenzo Calo' 28 Jan '09

28 Jan '09

Hi, I'm a newbie and I'm trying to build boost on a Mac OS X 10.4.11. I'm not able to generate the dylib files so something is going wrong. I've attached the output log file. Thanks a lot for your help. Best, Vincenzo

2 1

[date_time] new local_date_time constuctor
by a k 28 Jan '09

28 Jan '09

Hi, This is a request to add a third constructor of the class boost::local_time::local_date_time. THE PROBLEM: The following piece of code throws an exception. date d(2008, Oct, 26); time_duration td( 2, 30, 0 ); // 2:30 a.m. time_zone_ptr tz( new posix_time_zone("CET-1CEST,M3.5.0,M10.5.0/3") ); local_date_time myLtime( d, td, tz, EXCEPTION_ON_ERROR ); // last line throws This is because the date and time I chose happens to be located in the "vulnerble" moment when the wall clock gets moved back by an hour. In human terms, time 2:30am appears twice on 26-Oct-2008 in CET time zone because at 3:00 am we go back to 2:00 am and arrive at point 2:30 once more. In terms of boost::date_time library, the following condition appears: (local_date_time::check_dst(d, td, tz) == ambiguous); I would like to be able to write something like "On creating date/time infer the DST flag; on ambiguity assume no DST". In fact I can do that currently by replacing the last line from my above example with: bool inDST = (local_date_time::check_dst(d, td, tz) == is_in_dst); local_date_time myLtime(d, td, tz, inDST); This has two drawbacks however. First, check_dst gets called twice: first by me, second by the constructor, to check it once more. Second, it is too (IMO) verbose. THE REQUEST: Would it be possible to add a third constructor of local_date_time class that would accept a hint how to solve an ambiguity (if we have one). It would read like: local_date_time myLtime( d, td, tz, ASSUME_NOT_DST_ON_ERROR ); In the boost code I found it was already thought of, but got into a TODO state. Is there any chance that it gets implemented? Regards, &rzej

1 0

[BGL] Segfaults when switching from digraph to undirected graph
by Grzegorz Slodkowicz 28 Jan '09

28 Jan '09

Hi, I ran into trouble after changing my directed adjacency_list into an undirected graph. The following code causes a segfault: for (set<Node>::iterator n = nodes.begin(); n != nodes.end(); ++n) { graph_traits<Graph>::out_edge_iterator edges_begin, edges_end; tie(edges_begin, edges_end) = out_edges(*n, g); for (graph_traits<Graph>::out_edge_iterator ne = edges_begin; ne != edges_end; ++ne) { Node nn1 = target(*ne, g); // ... K_o = out_degree(nn1, g); graph_traits<Graph>::out_edge_iterator nn1edges_begin, nn1edges_end; tie(nn1edges_begin, nn1edges_end) = out_edges(nn1, g); int k; graph_traits<Graph>::out_edge_iterator nn1e; for (nn1e = nn1edges_begin; nn1e != nn1edges_end; ++nn1e) { k = 0; if (nodes.count(target(*nn1e, g))) // !!! k++; } } } I cut out most of the stuff not directly related to accessing the graph. It segfaults in the line marked by !!!, so it would seem that out_edges returns an invalid range (I did some debugging and the this line executes quite a few times before the iterator becomes invalid. I can't seem to force gdb to recognise nn1e as a symbol so I can't tell which edge/node is causing the problem. All this is ran after the graph is initialised (it's quite large, ab. 22k nodes and 900k edges). Best regards, Greg

2 2