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

Valgrind false positive in make_shared
by Dave Steffen 01 Dec '10

01 Dec '10

> Date: Thu, 18 Nov 2010 19:51:55 +0200 > From: "Peter Dimov" <pdimov(a)pdimov.com> > > Dave Steffen wrote: > > I got this bad behavior with GCC 4.4.4. It goes away with GCC 4.2.4. > > What is the definition of std::forward in GCC 4.4.4? What happens if you > > change boost::detail::sp_forward in make_shared.hpp:150: > ::new( pv ) T( boost::detail::sp_forward<Arg1>( arg1 ), > > boost::detail::sp_forward<Args>( args )... ); > > to std::forward, do you get a compile warning on this line and does > Valgrind still warn? Hi Coming back to this issue after a week or two... trying the above made no difference: no compiler warnings, and no change in Valgrind's error messages. Any thoughts? Thanks! -- Dave Steffen, Ph.D. - Software Engineer Numerica Corporation <http://www.numerica.us> 4850 Hahns Peak Drive, Suite 200 Loveland, Colorado 80538 main (970) 461-2000 x 227 direct (970) 612-2327 Email: dave.steffen(a)numerica.us fax (970) 461-2004 This message and any attachments are intended only for the individual or entity to which the message is addressed. This is a private message and may contain privileged information. If you are neither the intended recipient nor the agent responsible for delivering the message to the intended recipient, you are hereby notified that any review, retransmission, dissemination, or taking of any action in reliance upon, the information in this communication is strictly prohibited, and may be unlawful. If you feel you have received this communication in error, please notify me immediately by returning this email to me and deleting it from your computer.

2 4

[BGL] Searching for a convenient way to combine predicates for filtered_graph
by Cedric Laczny 01 Dec '10

01 Dec '10

Hi, I was wondering if there is a convenient (and to some extent intuitive) way to combine several predicates used in filtering a graph? The idea is to have some predicates defined and arbitrarily combine them so that the filtered_graph will check for compliance of each individual predicate and either make this vertex/edge visible or not. Of course, the predicates should be specific to vertices or edges, respectively, when being combined. When using std::vector or such, they would need to be all of the same type which does not seem very nice/feasible IMHO. Also defining a "big" predicate having a multitude of "smaller" predicates as members is not really an option as this is very restricted. Something like big_predicate = predicate1 || predicate2 || predicate3 (syntax should just illustrate the idea) maybe? Best, Cedric

3 9

[ serialisation ] 1.45 portable binary archive fails for shared_ptr on AIX/v11.1
by Avi Bahra 01 Dec '10

01 Dec '10

// This file is used to show problem with the portable binary archive(1.45) // when using the AIX/v11.1 compiler // // This test passes on Linux:gcc-4.2.1/HPUX:acc but crashes on AIX. // #include <assert.h> #include <iostream> #include <fstream> #include "portable_binary_oarchive.hpp" #include "portable_binary_iarchive.hpp" #include <boost/serialization/string.hpp> #include <boost/serialization/shared_ptr.hpp> #include <boost/serialization/weak_ptr.hpp> class CLimit { public: CLimit(const std::string& name) : name_(name) {} CLimit() {} const std::string& name() const { return name_;} private: std::string name_; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & name_; } }; class InLimit { public: InLimit(const std::string& name,boost::shared_ptr<CLimit> l) : name_(name), limit_(l) {} InLimit() {} const std::string& name() const { return name_;} CLimit* limit() const { return limit_.get();} private: std::string name_; boost::shared_ptr<CLimit> limit_; friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int) { ar & name_; ar & limit_; } }; int main() { std::string fileName= "pba.txt"; { const InLimit saved; std::ofstream ofs( fileName.c_str(), std::ios::binary); portable_binary_oarchive oa(ofs); oa << saved; std::cout << "saved OK\n"; } { InLimit restored; std::ifstream ifs( fileName.c_str(), std::ios::binary); portable_binary_iarchive ia( ifs ); ia >> restored; std::cout << "restored OK\n"; } return 0; } // ---------------------------------------------------------------- Best regards, Ta, Avi

1 0

Re: [Boost-users] [Bind] Retrun-type of bind expressions (SOLVED)
by Cedric Laczny 01 Dec '10

01 Dec '10

Hi, I found out how to specify the return type using boost::function and boost::bind, basically thanks to http://stackoverflow.com/questions/1044703/how-do-you-pass-boostbind-object… to-a-function/1044732#1044732 Say we are given two function objects (DefaultConstructible, CopyConstructible and only having "bool operator()"). As a little side note, it might be necessary to include "typedef bool return_type" in the definition of the functions objects (struct, class) (s. http://www.boost.org/doc/libs/1_45_0/libs/bind/bind.html#with_function_obje…) Then the return type can be declared as follows: typedef boost::function< bool( ARG-TYPE ) > CombinedPred; CombinedPred combined_pred = boost::bind(functor1, _1) && boost::bind(functor2, _1) where ARG-TYPE is the input paramter type the operator() was defined for in the functors (e.g. int, if operator() is working on ints). The basic idea is that functors that "return" bool and have the same input argument type will also have the same type(s) when being combined, e.g. by logical operators. Other combinations are of course also possible as boost::bind provides several overloaded operators like "&&", "||", "!" etc. Best, Cedric

1 0

Re: [Boost-users] Understanding Threads: Slow on Win32 with DLL
by Simon Adler 01 Dec '10

01 Dec '10

Hello Nat, Yes - i am sure that every Thread is just computing the reduced number - i tested it more than once. They are not producing log output. I have a timer to measure the time basing on the Frequency Performance Counter. After 5 seconds of runtime I do an output of the average computation time. Will now try to eliminate the dll - have a little luck that the required class has no dependencies, so it will take not long - will show the results shorty. Simon

1 0

[BGL] reverse_graph and filter_graph does not compile on 1.45
by gast128 01 Dec '10

01 Dec '10

Hello all, we got here a situation on VS2008 which did compile on 1.44 with a reverse graph of a filtered graph. I get constantly a f*cking 'You seem to be top-posting. Don't do that.' error from gmane, so I give up to include a reproducable case. It's easy to do it urself by making a construct like 'boost::make_reverse_graph (fgraph), where fgraph is a fitlered graph.' Anyone?

2 4

program options parse string
by Lloyd 01 Dec '10

01 Dec '10

Hi, I want to parse a simple string using boost program options. Let the string to parse look like this The input string looks like this string str="ARG1=hai ARG2=long string with space ARG3=12" This is how the command should be parsed ARG1="hai" ARG2="long string with space" ARG3=12 This is how my program looks like string in="ARG1=hai ARG2=long string with space ARG3=12"; options_description desc("OPT"); desc.add_options() ("CMD",value<string>(),""), ("ARG",value<string>(),""), ("TYPE",value<int>(),"") ; variables_map vm; stringstream ss(in); store(parse_config_file(ss,desc),vm); notify(vm); if(vm.count("ARG1")) { cout<<"ARG1:"<<vm["ARG1"].as<string>()<<endl; } But it prints ARG1:hai ARG2=long string with space ARG3=12 How can I split it into different options? Thanks in advance, Lloyd

1 0

Understanding Threads: Slow on Win32 with DLL
by Simon Adler 01 Dec '10

01 Dec '10

Hello Boost-Users, I have a strange Problem and also a theorie to solve it. I do not realy understand the reason and hope for somebody how may explain the problem. I am using boost.threads to execute some algorithms in parallel. I will post source code in detail if this is required. I have some work to do which is similar for different Data. Concrete: I compute some Forces on a Deformationmodel of geometrical Edges. I create for n available Processors n-1 Threads so lets say we have 10.000 Edges 3 times 2500 are processed from boost threads and 2500 are processed by the main thread. Because this is a worker crew i join the threads and will be finished. All this is done in Win32 using Visual Studio Express and Boost. I create some wrapper Structure at the moment struct Wrappy { void operator()( EdgeProcessor * array, int count) { for (int i = 0; i < count; i++) array[i]->compute(); } } My main application is creating a EdgeProcessor Array of 10000 Elements. In boost::thread constructor I give a ptr to the elements the thread should compute and count is for every thread 2500. You'll see - everything is straight forward and worked fine in a lot of situations. Now EdgeProcessor is a class compiled in a seperate dll (Multithreaded DLL) doing a lot of calls - some recursive, Just basic C++ calls, no std contaiiners in use. If I process all Elements with the main application using no threads it takes 0,07 sec and i have 100% usage of one CPU (have an I5, so 25% in total) If I use threads, i got 0,19 sec - more than twice the time. If I use just one boost::thread - not processing in main app - again 0,07 sec. If I use all threads all four cpus are in 100% usage - they are all together working but require more than twice the time - Yes i am sure that every thread is just working on 2500 Elements. If more than one thread is calling the EdgeProcessor, the task is done very slow. The data for the EdgeProcessor is by the way parallel, so every EdgeProcessor has its own data and there are no intersections or synchronisations at all. I assume that there is a realy big overhead because of the dll. Maybe the access of the class can not be done in parallel or not as fast as in a static case. Maybe there is a hidden synchronisation. Do you have some explanation for this? I use the same approach on other parts of the application without problems. The only difference is a) using of a class Instance within a dll and b) the compute will result i a couple of recursive calls (traversing tree) I have experience in this, but this behavior is strange. I am sorry if this is a little win32 / dll / visual studio like, but i am not sure where to ask. Thanks for your ideas! Simon

2 1

Boost 1.45 compile error
by gast128 01 Dec '10

01 Dec '10

Hello all, just tried out Boost 1.45 on VStudio 2003 but I got a compile error by only including type_traits: #include <boost/type_traits.hpp> int main() { return 0; } C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : error C2027: use of undefined type '<Unknown>' C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(143) : see declaration of '<Unknown>' C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : see reference to class template instantiation '<Unknown>' being compiled C:\Work Sdk\boost_1_45_0\boost\type_traits\common_type.hpp(121) : see reference to class template instantiation '<Unknown>' being compiled C:\Work Sdk\boost_1_45_0\boost\type_traits\common_type.hpp(123) : see reference to class template instantiation 'boost::type_traits_detail::common_type_2<T,U>' being compiled C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : error C2146: syntax error : missing ';' before identifier 'wrapped_type' C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(160) : error C2501: '<Unknown>' : missing storage-class or type specifiers C:\Work Sdk\boost_1_45_0\boost\typeof\msvc\typeof_impl.hpp(161) : error C2653: 'wrapped_type' : is not a class or namespace name afaik it seems located on 121 in 'boost/type_traits/coomon_type.hpp' Anyone can help?

5 4

Usign boost::bind with a call to member function
by przemyslaw.sliwa＠uk.bnpparibas.com 30 Nov '10

30 Nov '10

Hello, I would like to replace this trivial loop for(size_t i=0; i<intersection.size(); i++) { domCcyEventPtrs.push_back(events->event(domCcy, intersection[i])); } with a call to std::transform and boost::bind. The events object is actually a boost_shared_ptr<> of a certain type. domCcyEventPtrs and intersection are std::vector<> objects. Can this be done? Cheers ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

2 1