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

[regex] BOOST_REGEX_MATCH_EXTRA not working?
by Christian Henning 28 Oct '10

28 Oct '10

Hi there, pretty new to boost::regex and though I'm just toying around with the documentation and some basic test code. The following code crashes when setting the BOOST_REGEX_MATCH_EXTRA symbol. #include <iostream> #include <boost/regex.hpp> void print_captures( const std::string& regx , const std::string& text ) { boost::regex e( regx ); boost::smatch what; std::cout << "Expression: \"" << regx << "\"\n"; std::cout << "Text: \"" << text << "\"\n"; // crash occurs in the next statement if( boost::regex_match( text, what, e, boost::match_extra )) { unsigned int i,j; std::cout << "**Match found ** \n Sub-Expressions:\n"; for( i = 0; i < what.size(); ++i ) { std::cout << " $" << i << " = \"" << what[i] << "\"\n"; } std::cout << " Captures:\n"; for( i = 0; i < what.size(); ++i ) { std::cout << " $" << i << " = {"; for( j = 0; j < what.captures(i).size(); ++j ) { } } } } int _tmain(int argc, _TCHAR* argv[]) { print_captures( "(.*)bar|(.*)bah", "abcbar" ); return 0; } I'm using MSVC10 express. Am I doing something wrong? Regards, Christian

2 2

Are memory leaks reported by Boost.Test Microsoft Memory Leak Detection Enabling spurious or real?
by Paul A. Bristow 28 Oct '10

28 Oct '10

I've just added some code (ready for Inverse Gaussian distribution in preparation for Boost.Math). When I added one new section of kosher-looking C++ code, I started to see memory leaks reported: For example: *** No errors detected Detected memory leaks! Dumping objects -> {3485} normal block at 0x003611B0, 42 bytes long. Data: <class boost::mat> 63 6C 61 73 73 20 62 6F 6F 73 74 3A 3A 6D 61 74 {3484} normal block at 0x003635A0, 8 bytes long. Data: < 6 46 > B0 11 36 00 F8 34 36 00 ... But no filename is given as promised by http://msdn.microsoft.com/en-us/library/e5ewb1h3%28v=VS.80%29.aspx So I'm puzzled if/where I should look for a problem. (occurs for both debug and release) Or is this spurious? Should I just suppress the warnings? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

3 3

Checking if a stand-alone function exists
by Ioannis Papadopoulos 28 Oct '10

28 Oct '10

Hi, Is there a way of checking if a stand-alone function exists? Thanks

4 4

Serialization to human-readable formats
by Mateusz Loskot 28 Oct '10

28 Oct '10

Hi, I have a library reading/writing data from binary files. The library defines collection of type representing schema and data stored in the files. Definition of those elements is versioned, so one file can be slightly different than other. The de-/serialization from/to those files is implemented, so it's not part of my problem. I'm looking for recommendation of tools to based implementation of serialization of those objects to/from human-readable format like XML, JSON, other text-based formats. I'm looking for non-intrusive solution with degree of extensibility, so new formats can be added if needed. Ideally, if the mechanism could be aware of the versions of objects being serialized. I have never used the Boost Serialization library, but reading its documentation suggests it may fit the problem well. UDT can be instrumented with serialization mechanism in non-intrusive way. There are some archivers provided and, as far as I understand, new can be added. There are also other tools like Boost Property Tree or even Spirit Qi/Karma which technically could do the job, I think. There is also this naive option dangling around, which is implementation of << and >> operators for my types. Hoping I've described what I need fairly well, I'd like to ask for some suggestions which option sounds better. Perhaps I've missed some details or possibilities, thus any brainstorming is welcome. Best regards, -- Mateusz Loskot, http://mateusz.loskot.net Charter Member of OSGeo, http://osgeo.org Member of ACCU, http://accu.org

1 0

[serialization] compile error on Mac OSX Tiger
by Philipp Münzel 27 Oct '10

27 Oct '10

Hi folks, after successfully deploying boost 1.44 on Windows and Linux, I now fail bitterly on Mac OSX. It is a Power PC with OSX 10.4 and gcc 4.0.1 When building boost with the following command: ./bjam --layout=system --with-serialization link=static variant=release threading=multi I get the following error: darwin.compile.c++ bin.v2/libs/serialization/build/darwin-4.0.1/release/link-static/threading- multi/basic_xml_archive.o darwin.compile.c++ bin.v2/libs/serialization/build/darwin-4.0.1/release/link-static/threading- multi/binary_iarchive.o ./boost/archive/basic_binary_iarchive.hpp:74: error: invalid application of 'sizeof' to incomplete type 'boost::STATIC_ASSERTION_FAILURE<false>' "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/serialization/build/darwin-4.0.1/release/link-static/threading- multi/binary_iarchive.o" "libs/serialization/src/binary_iarchive.cpp" ...failed darwin.compile.c++ bin.v2/libs/serialization/build/darwin-4.0.1/release/link-static/threading- multi/binary_iarchive.o... ...failed updating 1 target... ...updated 74 targets... I did NOT set architecture=combined. I want a PPC only build. Any help is greatly appreciated. Regards Philipp

3 2

[mpl] Accessing the nested value of an invoked placeholder
by Nathan Crookston 27 Oct '10

27 Oct '10

All, I'm writing some code to filter a vector_c of enum values. I have some existing structs which are templatized on those enum types and I'm having some trouble accessing those structs using placeholders. Following is code which hopefully clarifies: #include <boost/cstdint.hpp> #include <boost/mpl/assert.hpp> #include <boost/mpl/copy_if.hpp> #include <boost/mpl/vector_c.hpp> #include <boost/type_traits.hpp> #include <iostream> using boost::mpl::placeholders::_; enum MyEnum { val1, val2, }; template <MyEnum me> struct trait; template <> struct trait<val1> { typedef boost::uint16_t type; }; template <> struct trait<val2> { typedef boost::uint8_t type; }; //PROBLEM: The 'T' passed in is _, not what it substitutes for. template <typename T> struct traitMeta : trait<T::value> {}; typedef boost::mpl::vector_c<MyEnum, val1, val2> Vec; //For each item in Vec, determine if trait<_>::type matches T. If so, add it. template <typename T> struct TypeIs : boost::mpl::copy_if<Vec, boost::is_same<typename traitMeta<_>::type, T> > {}; BOOST_MPL_ASSERT((TypeIs<boost::uint16_t>::type, boost::mpl::vector_c<MyEnum, val1>)); int main() { return 0; } //END CODE I would assume from reading the book and documentation that mpl::apply or mpl::lambda would be best to use here, but my attempts to do so haven't been successful. I'd appreciate any guidance. Thanks, Nate

2 2

[thread] recursive shared mutex
by JOAQUIN M. LOPEZ MUÑOZ 27 Oct '10

27 Oct '10

Hi, Boost.Threads provides a recursive mutex and a shared mutex, but no recursive *and* shared mutex. Would it be a good idea to add this to the library? How hard is it to construct a recursive shared mutex from boost::sahred_mutex (i.e. adding reentrancy to boost::shared_mutex)? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

load a serialized object into Matlab?
by James C. Sutherland 27 Oct '10

27 Oct '10

I am just looking into the serialization library. It seems really nice for archiving using C++. Is there a way to import an archive generated by that library into another language (e.g. matlab)? I guess that one would need the rules for IO that the serialization archives use? Thanks, James

6 11

Boost::Log named_scope issue
by Kieran Parsons 27 Oct '10

27 Oct '10

Can someone give me a working example of using named_scope for Boost::Log? I have tried something like: boost::shared_ptr< boost::log::core > logCore = boost::log::core::get(); logCore->add_global_attribute("Scope", boost::make_shared< boost::log::attributes::named_scope >()); boost::shared_ptr< boost::log::sinks::synchronous_sink< boost::log::sinks::text_file_backend > > sink = boost::log::init_log_to_file("myfile.txt"); sink->locked_backend()->set_formatter ( boost::log::formatters::stream << boost::log::formatters::named_scope( "Scope", keywords::iteration = boost::log::formatters::reverse, keywords::delimiter = " | ") ); logCore->add_sink(sink); BOOST_LOG_FUNCTION(); BOOST_LOG_NAMED_SCOPE("MyScope"); boost::log::sources::logger lg; BOOST_LOG(lg) << "TEST"; But it fails with an exception during the BOOST_LOG (I think due to missing attribute). As a general comment, the fact that none of the tutorial examples in the documentation work as-is makes it extremely difficult for a newbie to use (namespaces undefined, lack of include files etc). Thanks for your help.

1 0

Function pointer to in/out_degree in BGL
by langermatze 27 Oct '10

27 Oct '10

Hi, I have a question regarding the boost graph library. I'd like to write a set of depth first search visitors to determine the maximum in/out-degree of a graph. The code should look pretty similar for both cases except for the function call to get the property of the visited node. boost:in_degree(node_id, graph) vs. boost:out_degree(vertexId, graph) At first glance the function signature pretty much the same, maybe: template<class Graph> graph_traits<Graph>::degree_size_type function(graph_traits<Graph>::vertex_descriptor u, const Graph &g) When looking at the BGL headers however, things seem to be a bit more complex, though. I tried to implement a generic dfs_visitor taking a general function pointer to get the in/out degree property of the visited node but I couldn't work out the type of the function pointer to be passed. All my attemtps failed badly. Hopefully, there is anybody on this list who has a better understanding of this business and could provide some help. Any hints/comments are appreciated! Thank you so much, Matthias -- View this message in context: http://boost.2283326.n4.nabble.com/Function-pointer-to-in-out-degree-in-BGL… Sent from the Boost - Users mailing list archive at Nabble.com.

3 4

boost::thread within a dll
by Matheus Araújo Aguiar 27 Oct '10

27 Oct '10

Hello list, I'm facing some problems with a dll that uses boost::thread, boost::mutex and boost::condition_variable. Currently i am clueless about what is causing the problem and wanted to know if it is ok to use boost::thread and the others aforementioned within a dll. Basically, in a singleton in the dll, some threads are created and consume tasks (wrapped with boost::bind) from a queue, using boost::mutex to avoid concurrency problems and boost::condition_variable to sleep and wake, depending on emptiness of the task queue. Sorry for the brief and rapid description of my problem. Could anyone point to me if using these might cause problems with dlls? Thank you all, -- Matheus Araújo Aguiar Computer Scientist matheus.pit(a)gmail.com

2 3

Boost XML compile problem XML_SAVE_FORMAT
by Kraus Philipp 27 Oct '10

27 Oct '10

Hello, I would like to use the Boost XML structure. Is the package within the SVN compatible under OSX, Linux and MS Windows? I'm using it at the moment under OSX, but I must use the code later under Linux and Windows. Under OSX I use the libxml2 Library, but in the boost/xml/dom/io.hpp I get an compile error on line 36 "xmlSaveCtxt *ctx = xmlSaveToIO (detail::stream_write_callback, detail::stream_close_callback, sb, enc, XML_SAVE_FORMAT);" the XML_SAVE_FORMAT isn't defined (message: not declared in this scope). My problem is at this time, that I must parse XML data of a stream objekt on-fly and extract some nodes (and this with a cross-plattform library). Is this the correct way to do the parsing with Boost XML? Thanks Phil

1 0

[geometry][ggl] boost array adapted mechanism
by alfC 27 Oct '10

27 Oct '10

The documentation of GGL (Generic Geometry Library) is still scattered and hard to follow. As usual the first test I do on a library is to see how well it can be adapted to existing code. GGL seems to be able to adapt c_arrays and tuples as nD points. I was wondering if boost::array and fusion::vector can be adapted as well. The manual says it is but the header file boost/geometry/geometries/adapted/boost_array_as_ring.hpp doesn't seem to have that purpose. In the following example, p4 doesn't work as a point #include<boost/geometry/geometry.hpp> #include<boost/geometry/geometries/cartesian3d.hpp> #include<boost/geometry/geometries/adapted/boost_array_as_ring.hpp> #include <boost/geometry/geometries/adapted/c_array_cartesian.hpp> #include <boost/geometry/geometries/adapted/tuple_cartesian.hpp> #include<iostream> int main(){ using namespace boost::geometry; point<double, 3, cs::cartesian> p1(1,2,3); double p2[3] = {4,5,6}; boost::tuple<double, double, double> p3(7,8,9); boost::array<double, 3> p4={{10,11,12}}; std::clog << distance(p1,p2) << std::endl; std::clog << distance(p2,p3) << std::endl; std::clog << distance(p3,p4) << std::endl; return 0; } In other words, why there is not boost/geometry/geometries/adapted/boost_array_cartesian.hpp ? And it indeed this adaptation of boost::array is not included in the library, what steps should I follow to make a boost::array adapted to GGL? Thank you, Alfredo

3 3

[boostbook+quickbook] : A way to write latex math
by Bo Jensen 27 Oct '10

27 Oct '10

This is just some info, that might interest others : I just recently discovered : http://www.mathjax.org which is quite nice for writing math equations. I use quickbook for my documentation. Fortunately it is very easy to incorporate MathJax into quickbook, so you can write : ''' <my-latex-math>some formula in latex</my-latex-math> ''' I just added the following to the stylesheet : <xsl:template name="system.head.content"> <script type="text/javascript" src="somepath/MathJax/MathJax.js"></script> </xsl:template> <xsl:template match="my-latex-math"> <xsl:value-of select="."/> </xsl:template> I should say I am a totally newbie to xsl stylesheets, so I might be doing something bad, never the less it works fine :-)

5 9

[math] round to fraction
by gast128 27 Oct '10

27 Oct '10

Hello all, I couldn't find a functionality like 'round to fraction', which would try round a floating point value to its nearby fraction portion: round2fraction(1.4, 0.5); -> 1.5 round2fraction(1.8, 0.5); -> 2.0 round2fraction(1.0, 0.5); -> 1.0 round2fraction(1.25, 0.5); -> 1.5 round2fraction(-1.6, 0.5); -> -1.5 We have here a private implementation, but this is probably not as optimised as those numerical guru's can come up with. Is this a good suggestion to add to Boost.Math or overkill?

4 4

boost with Visual Studio 2005 (VC8) and 2010 (VC10)
by andrew.marlow＠uk.bnpparibas.com 27 Oct '10

27 Oct '10

I am using boost 1.42 and am considering moving to 1.44.0. I see from the release notes that 1.44.0 has improved support for VC10 especially with the TR1 parts. That's good because I would also like to move to VC10, I am currently on VC8 (i.e. 2005). Please don't laugh. The move to boost 1.44.0, if it happens, will most likely happen before the move to VC10. So does boost 1.44.0 work with VC8? It is not in the supported compilers list. Regards, Andrew Marlow ___________________________________________________________ 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 2

getting started tutorial: link your program to a boost library
by Oliver Adams 27 Oct '10

27 Oct '10

Hi, I've just installed boost and have been going through the getting started guide (for unix variants). I am having problems with the section that discusses how to link your program to a boost library, using boost.regex as an example. $ c++ -I path/to/boost_1_44_0 example.cpp -o example \ ~/boost/stage/lib/libboost_regex-gcc34-mt-d-1_36.a That file does not exist. In fact there is no boost directory in my home directory. I'm not sure if running ./bjam install worked. It did build for a while, but the last few lines of output were: ...failed updating 60 targets... ...skipped 12 targets... ...updated 8866 targets... there seem to be a bunch of object files in /usr/local/boost_1_44_0/bin.v2/libs/regex/build/gcc-4.4.5/release/threading-multi unfortunately, when I try and use those files I end up getting: collect2: ld returned 1 exit status Any help's appreciated, Oliver

3 2

[variant] assignment with possible casting
by Brian Budge 26 Oct '10

26 Oct '10

Hi all - I have a struct which holds parameter name/value pairs. The incoming data is not always exactly the same, as it's read from different sources, so sometimes I might have a parameter named "scale" which is a uint8_t, and other times "scale" is a uint32_t or int32_t. When I try to get() the data, I grab it as uint32_t, but it may be stored in the variant as an int32_t. We're using get<uint32_t> in that case, and this fails if the variant holds int32_t. On the other hand, since the variant can contain vector and matrix values, we can't simply use operator = for automatic casting (compile time errors). We don't expect to do any non-trivial casts (i.e. matrix to float or vice-versa). Are there any helper visitors or anything in the boost::variant library to assist with this, or do we need to write our own visitor? Code below. Thanks, Brian struct ParameterDesc { typedef boost::variant<bool, int32_t, uint32_t, float, Vec2f, Vec3f, Vec4f, Mat2f, Mat3f, Mat4f, std::string> ParamValue; typedef google::dense_hash_map<std::string, ParamValue> ParamMap; typedef ParamMap::iterator ParamMapIter; typedef ParamMap::const_iterator ParamMapCIter; std::string type; std::string name; ParamMap params; template <typename T> bool get(const std::string &name, T &val, const T &defaultValue) const { ParamMapCIter p_it; if( (p_it = params.find(name)) == params.end() ) { val = defaultValue; return false; } val = boost::get<T>(p_it->second); return true; } template <typename T> void get(const std::string &name, T &val) const { ParamMapCIter p_it; if( (p_it = params.find(name)) == params.end() ) { throw ParamException("couldn't find parameter with field name: " + name); } val = boost::get<T>(p_it->second); } ParameterDesc() { params.set_empty_key("__EMPTY__"); } };

1 0

[asio] Error running as Windows service; runs fine from console
by Evan Burkitt 26 Oct '10

26 Oct '10

I have a Windows application that uses ASIO to implement a server that listens on a TCP port. When I run it from the console it starts and operates without error. When I start the same application as a Windows service (it's written to be run either way) my call to boost::asio::ip::tcp::acceptor::async_accept() immediately calls the passed accept handler to report error 995: "The I/O operation has been aborted because of either a thread exit or an application request". This occurs even when I run the service under the same account as the logged-in user. I know I'm a bit sketchy with the details of my implementation, but I think this is at least as likely to be some Windows weirdness as an ASIO problem per se. I'm hoping someone else has encountered and fixed this problem before. Thanks. -evan

4 8

Re: [Boost-users] General design question about threading/concurrency
by Julien Martin 26 Oct '10

26 Oct '10

Hello Steve, Thanks for your post. Can you please tell me where to look for information about TBB tuning in the documentation? Julien. 2010/10/25 McKay, Steve F. <Steve.F.McKay(a)ssa.gov> > We have used Intel TBB in a situation similar to yours. We simulate the > U.S. population on 0.1 percent basis (about 300,000 people). We had > attempted to use raw threads before the TBB package became available, but it > was just too hard. The TBB package more or less automatically figures out > how many threads to use, creates the threads, and doles the work out to the > threads, using parallel_for. The biggest hurdle for us was learning how to > create function objects, since that is what parallel_for is set up to use. > But once you get the hang of it, writing your code that way actually helps > you write good code. You may have to do some things differently, or break > things down into smaller steps. > > > > Once you start using TBB, you will find other parts of it that are also > useful, such as parallel_reduce. Also note that, even though TBB is mostly > automatic, you should do some tuning because TBB may not have set the block > size well (how many people, or whatever you are simulating, it allocates to > a thread at one time). It may appear that TBB is not helping to reduce run > time, until you do some tuning. Read the tutorial. > > > > Steve McKay > > Steve.F.McKay(a)ssa.gov > > Social Security Administration > > Baltimore, Maryland 21235 > > > > *From:* boost-users-bounces(a)lists.boost.org [mailto: > boost-users-bounces(a)lists.boost.org] *On Behalf Of *Julien Martin > *Sent:* Monday, October 25, 2010 10:25 AM > *To:* boost-users(a)lists.boost.org > *Subject:* Re: [Boost-users] General design question about > threading/concurrency > > > > Ok. I will try that! > Thank you, > J. > > 2010/10/25 gast128 <gast128(a)hotmail.com> > > Julien Martin <balteo <at> gmail.com> writes: > > > Thanks gast128,I just installed TBB. Can you please tell me what to look > for > (which class, method or concept) in TBB? It is pretty vast...J. > > > 2010/10/25 gast128 <gast128 <at> hotmail.com>If u stay on the same > computer > > (i.e. plain x86 PC with multi cores or multi > > processors), I would recommend Intel's TBB, which splits up tasks > > automatically and tries to keep the processor busy. > > It would be nice if Boost / std C++ would have such a parallellism > library > > because it is an addition to using threads. > > Hello, > > tbb::parallel_for is probably where u will be interested in if the > individual > tasks are truely independent. > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > >

1 0

General design question about threading/concurrency
by Julien Martin 26 Oct '10

26 Oct '10

Hello, I am writing a program that needs to run N simulations with N >10 000. Obviously, I cannot instantiate N threads at the same time but I cannot run the simulations sequentially either. Can anyone please advise me how to design my program using the boost threading library and concepts please? Thanks in advance, Julien.

9 15

[OT] Permuting graphs
by Cedric Laczny 26 Oct '10

26 Oct '10

Hi, of course, this general topic is off-topic as it is not directly relatod to the Boost Graph Library. And I want to apologize for that in the first place. However, I think that many using the BGL may also have to deal sometimes with such problems. Therefore, I am addressing this question here and hope to find some answers ;) The question is about permuting a graph in order to assess the statistical significance of a certain aspect of the original graph. Sometimes, it is enough to randomly re-wire the existing edges, but other times, more elaborate techniques are necessary. Do you have some literature or references addressing this fact? I am especially interested in topology-conserving permutations (of tripartite graphs). Thank you. Best reagards, Cedric Laczny

2 1

Boost 1.44 compilation on AIX
by jessica.alfonsi＠unipd.it 25 Oct '10

25 Oct '10

Hello, I'm trying to compile without results the Boost 1.44 package embedded with the ALPS libraries (http://alps.comp-phys.org/mediawiki/index.php/Main_Page) on AIX version 6.1, Visual Age C++ compiler 10.1. Soon after launching, compilation stops with the following error messages: subprogram boost::date_time::gregorian_calendar_base<boost::date_time::year_month_day_base<boost::gregorian::greg_year,boost::gregorian::greg_month,boost::gregorian::greg_day>,unsigned int>::end_of_month_day(year_type, month_type) could not be inlined into boost::gregorian::date::date(year_type, month_type, day_type). 1500-029: (W) WARNING: subprogram std::basic_string<char,std::char_traits<char>,std::allocator<char> >::_Assign<std::_Ptrit<char,long,const char *,const char &,char *,char &> >(_Ptrit<char,long,const char *,const char &,char *,char &>, _Ptrit<char,long,const char *,const char &,char *,char &>, input_iterator_tag) could not be inlined into boost::char_separator<char,std::char_traits<char> >::operator() <std::_Ptrit<char,long,const char *,const char &,char *,char &>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >(_Ptrit<char,long,const char *,const char &,char *,char &> &, _Ptrit<char,long,const char *,const char &,char *,char &>, basic_string<char,std::char_traits<char>,std::allocator<char> > &). 1500-029: (W) WARNING: subprogram std::basic_string<char,std::char_traits<char>,std::allocator<char> >::_Assign<std::_Ptrit<char,long,const char *,const char &,char *,char &> >(_Ptrit<char,long,const char *,const char &,char *,char &>, _Ptrit<char,long,const char *,const char &,char *,char &>, input_iterator_tag) could not be inlined into boost::char_separator<char,std::char_traits<char> >::operator() <std::_Ptrit<char,long,const char *,const char &,char *,char &>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >(_Ptrit<char,long,const char *,const char &,char *,char &> &, _Ptrit<char,long,const char *,const char &,char *,char &>, basic_string<char,std::char_traits<char>,std::allocator<char> > &). 1500-029: (W) WARNING: subprogram std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >::_Assign<wchar_t *>(wchar_t *, wchar_t *, input_iterator_tag) could not be inlined into boost::detail::lexical_cast<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,const wchar_t *,0,wchar_t>(param_type, wchar_t *, size_t). 1500-029: (W) WARNING: subprogram std::basic_string<char,std::char_traits<char>,std::allocator<char> >::_Assign<char *>(char *, char *, input_iterator_tag) could not be inlined into boost::detail::lexical_cast<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,const char *,0,char>(param_type, char *, size_t). 1500-029: (W) WARNING: subprogram boost::filesystem2::basic_directory_entry<boost::filesystem2::basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem2::wpath_traits> >::replace_filename(const string_type &, file_status, file_status) could not be inlined into boost::filesystem2::basic_directory_iterator<boost::filesystem2::basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem2::wpath_traits> >::increment(). 1500-029: (W) WARNING: subprogram boost::filesystem2::basic_directory_entry<boost::filesystem2::basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem2::wpath_traits> >::assign(const path_type &, file_status, file_status) could not be inlined into boost::filesystem2::basic_directory_iterator<boost::filesystem2::basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem2::wpath_traits> >::m_init(const basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem2::wpath_traits> &). 1500-029: (W) WARNING: subprogram boost::filesystem2::basic_directory_entry<boost::filesystem2::basic_path<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::filesystem2::path_traits> >::replace_filename(const string_type &, file_status, file_status) could not be inlined into boost::filesystem2::basic_directory_iterator<boost::filesystem2::basic_path<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::filesystem2::path_traits> >::increment(). 1500-029: (W) WARNING: subprogram boost::filesystem2::basic_directory_entry<boost::filesystem2::basic_path<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::filesystem2::path_traits> >::assign(const path_type &, file_status, file_status) could not be inlined into boost::filesystem2::basic_directory_iterator<boost::filesystem2::basic_path<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::filesystem2::path_traits> >::m_init(const basic_path<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::filesystem2::path_traits> &). "/gpfs/scratch/userexternal/jalfonsi/alps-2.0.0b4-r4959-src-with-boost/boost/boost/filesystem/v3/path.hpp", line 476.7: 1540-0716 (S) The template argument "boost::iterator" does not match the template parameter "class Derived". make[2]: *** [src/boost/CMakeFiles/boost.dir/__/__/boost/libs/filesystem/v3/src/operations.cpp.o] Error 1 make[1]: *** [src/boost/CMakeFiles/boost.dir/all] Error 2 make: *** [all] Error 2 Can someone tell me please if the compiler version could be the issue ? I see on Boost main page that 1.44 has been tested with Visual Age 11.1. I didn't have such problem with Boost 1.43 . Best regards Jessica

2 1

boost MPI about finalize problem
by Jack Bryan 25 Oct '10

25 Oct '10

Hi I got a problem of MPI. I donot know whether it can be resolved in boost MPI. My program has 5 processes. All of them can run MPI_Finalize() and return 0. But, the whole program cannot be completed. In the MPI cluster job queue, it is still in running status. If I use 1 process to run it, no problem. Why ? My program: int main (int argc, char **argv) { MPI_Init(&argc, &argv); MPI_Comm_rank(MPI_COMM_WORLD, &myRank); MPI_Comm_size(MPI_COMM_WORLD, &mySize); MPI_Comm world; world = MPI_COMM_WORLD; if (myRank == 0) { do some things. } if (myRank != 0) { do some things. } cout << " I am rank " << rank << " I am before MPI_Finalize()" << endl; MPI_Finalize(); cout << " I am rank " << rank << " I am after MPI_Finalize()" << endl; return 0; } I can get the output " I am rank 0 (1, 2, ....) I am before MPI_Finalize() ". and " I am rank 0 I am after MPI_Finalize() " But, other processes do not printed out "I am rank ... I am after MPI_Finalize()" . It is weird. The process has reached the point just before MPI_Finalize(), why they are hanged there ? Are there other better ways to check this ? Any help is appreciated. And, some output files get wrong codes, which can not be readible. In 1-process case, the program can print correct results to these output files . Any help is appreciated. thanks Jack Oct. 24 2010

2 1

Variadic Max Function
by Hossein Haeri 25 Oct '10

25 Oct '10

Dear all, Is there any variadic max function in Boost? I mean something which returns the max of all the arguments it takes -- no matter how many they are. (Feel free to correct me if this use of 'variadic' is not the correct terminology.) Please note that I'm not after working on ranges of arguments. I'm rather looking for a max function which is applicable in all the examples below: int m1 = max(a1, a2); int m2 = max(a1, a2, a3); ... int mk = max(a1, a2, ..., ak); TIA, --Hossein

4 5

order of headers with Boost.Serialization and Boost.MPI
by Riccardo Murri 25 Oct '10

25 Oct '10

Hello, I'm writing a code that uses Boost.MPI to send some GMP (http://gmplib.org/) datatypes around. Since I do not want to change GMP, I'm using the "non-intrusive" serialization support (code in attached file "gmpxx_boost_serialization.hpp"). However, I'm running into a strange include-order mess: * If I include first my "gmpxx_boost_serialization.hpp" and _then_ "boost/mpi.h", then I get a slew of errors (attached file "errors.txt") * If I reverse the include order, and include "boost/mpi.h" _first_, then everything compiles fine. Is this to be expected, or am I doing something wrong in my code? For the record, I'm compiling on Ubuntu 10.10, gcc 4.4.5, arch. amd64. Thanks for any hint! Best regards, Riccardo Murri -- Riccardo Murri, Hadlaubstr. 150, 8006 Zürich (CH)

2 7

General question about C++ [slightly off topic, sorry]
by Julien Martin 25 Oct '10

25 Oct '10

Hello, I am a beginner in C++. I learn using the Linux platform. What is the best place to look for general help about C++ please? Thanks in advance, J.

2 2

Changes breaking behavior of operators /, /= and << in filesystem v3?
by Roel Vanhout 25 Oct '10

25 Oct '10

Hello, I enabled filesystem v3 after upgrading to 1.44. The api changes that caused the compiler to signal errors were rather easy to fix. However when running my program, it behaves differently from the way it used to. I narrowed it down to the following: char buf[MAX_PATH]; HRESULT res = ::SHGetFolderPath(NULL, CSIDL_APPDATA, NULL, SHGFP_TYPE_CURRENT, buf); boost::filesystem::path result(buf); // 'result' is after this "C:\Documents and Settings\rvanhout\Application Data" result /= "MyCompany"; At this point, 'result' *still* contains "C:\Documents and Settings\rvanhout\Application Data" whereas with v2 it used to contain "C:\Documents and Settings\rvanhout\Application Data\MyCompany\MyProduct". (environment: Windows (obviously) with VS 2008 (vc9)) There seem to be two way to get the desired behaviour: - initialize the path with a trailing slash, like this: boost::filesystem::path result(buf + std::string("/")); - convert 'buf' into a std::string first: std::string str(buf); boost::filesystem::path result(str); So I guess my code broke because the path is not initialized with the platform's native path encoding (although std::string is char also and it does work). Is this by design? It seems quite unintuitive to me. Second thing I was bit by is that the io streaming operator now seems to add quotes to a path with spaces in it when streaming a path object to an ostringstream. The string that is returned with .string() isn't quoted, of course, so my 'fix' is to not stream path objects anymore but add the .string() call. What's more important, is there a way to let the compiler signal these situations in my code? The way it is now, everything compiles but I have no way to know if it will actually work as it used to/should. Otherwise, it might be an idea to add #pragma warning statements to those parts for a release or two, to give people a heads up. Thanks. regards, Roel Vanhout

2 2

32 bit time stamp to date and time
by Lloyd 25 Oct '10

25 Oct '10

Hi, I am writing a simple NTP client. NTP retuns the time as a 32bit value, as the seconds since 1900. using boost date time library is it possible to convert it to a date and time (year,month,day of week,day,hour,minute,second) ? Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

4 8

this_thread::sleep hangs on local clock change
by Goldshmidt, Mark 25 Oct '10

25 Oct '10

Hello, We're using boost::thread library in a consumer application. Part of the requirements for the application is to continue operation when the user changes local time. Our problem is that if local time is set backwards X minutes during a call to this_thread::sleep(duration) the thread sleeps for X minutes+duration. This happens on MacOS in release build, but not in debug. On Windows behavior is correct. I didn't have a chance to check other platforms. I believe that the intention of this_thread::sleep(duration) is to suspend thread execution for <duration> period regardless of local clock setting, and provide consistent behavior across all platforms and build configurations. Looking into the code of libs/thread/src/pthread/thread.cpp I see that problematic flow may occur in case of detail::get_current_thread_data() is returning null. Apparently this is what causes different behavior in debug and release. The "offendinng" code tries to make sure that absolute point in time (current time + requested delay) is reached using 5 attempts and calculating necessary sleep duration each time. So if during the first sleep local clock is set backwards, second sleep will try to "compensate" for the new difference. The simplest workaround for the problem I could think of is to replace the first statement of the sleep(...) function: detail::thread_data_base* const thread_info= detail::get_current_thread_data(); with this one: detail::thread_data_base* const thread_info= get_or_make_current_thread_data(); Would it create any unwanted side effects? Is there a better way to deal with is problem? Thanks in advance, Mark This message is confidential and intended only for the addressee. If you have received this message in error, please immediately notify the postmaster(a)nds.com and delete it from your system as well as any copies. The content of e-mails as well as traffic data may be monitored by NDS for employment and security purposes. To protect the environment please do not print this e-mail unless necessary. An NDS Group Limited company. www.nds.com

1 0

extents
by Alle Meije Wink 25 Oct '10

25 Oct '10

Dear all, I am trying to load data from a file, where they are (obviously) stored as a 1D contiguous block, to a N-dimensional array. For the type of files I use N could be 1 through 8. I have code to for a 1..8-dimensional container (as a class template), but how to load in the data from the file? The multi_array_ref way to do it looked ideal, eg for a 3D float-image something like im = image_ref< float, 2 >( image->data, boost::extents[512][512] ) might work. But to code the different dimensionalities in a neat way would mean to store the extents in a variable (or something), like boost_extents_type e; switch ndim { // ndim=dim[0] 1: int dim1=dim[1]; e=boost::extents[dim1]; break; 2: int dim1=dim[1],dim2=dim[2]; e=boost::extents[dim1][dim2]; //etc } Is something like this possible with extents? Many thanks, Alle Meije

1 1

[program_options] How to use "notifier" in options_description with member functions?
by Carlos Franke 25 Oct '10

25 Oct '10

Hello! I am looking for advice about the use of the "notifier" function in program_options::options_description with class methods. My problem seems very basic to mee, yet I wasn't able to find the (any) related documentation. Here is a minimal example of what I cannot get to work: struct test { void function(int i) {std::cout << i << std::endl;} void does_not_compile() { po::options_description desc; desc.add_options() ("option", po::value<int>()->notifier(&test::function), "Option") ; } }; Compilation fails with: […] test.cpp:62:82: instantiated from here /usr/include/boost/function/function_template.hpp:225:11: error: no match for call to '(boost::_mfi::mf1<void, test, int>) (const int&)' /usr/include/boost/bind/mem_fn_template.hpp:163:7: note: candidates are: R boost::_mfi::mf1<R, T, A1>::operator()(T*, A1) const [with R = void, T = test, A1 = int] /usr/include/boost/bind/mem_fn_template.hpp:184:7: note: R boost::_mfi::mf1<R, T, A1>::operator()(T&, A1) const [with R = void, T = test, A1 = int] Sorry if this is trivial. Your help is all the more appreciated! Carlos

2 2

[asio] udp sendto performance bottleneck
by Hajo Kirchhoff 25 Oct '10

25 Oct '10

Hi all, I am porting an application from linux (suse 11) to windows. This application is sending 75.000 UDP Pakets per second, 1416 bytes each. It uses sendto. IOW: the application is calling sendto approx 75.000 times per second. The GBit LAN utilization is in the 80-90% range. This works fine under linux, but the sendto call under windows takes way longer than under linux. The overhead is so high that throughput drops from about 100MB/s to less than 20MB/s. This seems to be a known problem with the windows sendto call, as cygwin has a rather complex sendto implementation/emulation and does not suffer from this problem. They are using WSASendMsg internally and pass multiple buffers with one system call. WSASendMsg passes an array of buffers to the networking stack and my impression is that it allows sending several packets with one system call. My question: Is it possible to send multiple udp pakets with one asio::sendto call? asio::sendto accepts multiple buffers but seems to combine all them into one udp paket. Is there a way to prevent that? Specifically I want to do the following: vector<array<char, 1416> > b; b.push_back(paket1); b.push_back(paket2); b.push_back(paket3); ... m_socket.sendto(b); This should send three udp pakets with 1416 bytes each instead of one udp paket with 3*1416 bytes. How can I do that? Is this possible? Regards Hajo (Sidenote to all people with dropped udp pakets under windows Vista and 7: Have you set the network throttling index to 0xffffffff? Its a registry key and without it you'll never reach maximum throughput. Another important aspect is to set the receive buffer count in your network driver to maximum - usually 512 or more - and to use a good network card. It _is_ possible to receive close to one Gigabit/sec UDP pakets if done right. Thanks to asio it is also rather easy :-)

1 0

[1.44 MSM meta state machine] accessing objects from actions
by Hajo Kirchhoff 25 Oct '10

25 Oct '10

Hi all, what is the recommended way to use objects with an MSM state machine? I've written a state machine that handles sending data via UDP (asio). I'm using the functor front end and I have a 'send' action: struct a_send { template <typename Event, typename Fsm, typename S, typename T> void operator()(Event const& evt, Fsm &fsm, S&, T&) { // get next object from queue and post it to asio } }; My question is, how are actions supposed to access the objects that the state machine should work with? Currently my queue object is a member of the state machine itself, so I can write struct Send_ : public msm::front::state_machine_def<Send_> { string m_next_line_to_send; socket m_socket; string get_next_send_line(); }; and in my a_send action void operator()(Event &const &evt, Fsm &fsm, S&, T&) { fsm.m_next_line_to_send=fsm.get_next_send_line(); fsm.m_socket.async_write(fsm.m_next_line_to_send); } This works well as long as I am not using sub-statemachines. Here is my problem: I would like to use a substate machine for the actual sending. The main state machine has the states Disconnected, Working, Error, Shutdown. The Working state should actually be a substate machine. The problem is, when a_send gets called by the substate machine Working, the fsm object is of type Working. How can I access the member variables of the parent of a substate machine? Or is there a better way of accessing the objects the state machine should work with from actions? The tutorial explains state machines very nicely with the example of a CD player. But all the actions are empty and nowhere is explained, how you would actually access a CD player member variable or other such object so that you could actually manipulate the player to do something. Regards and thanks Hajo

1 0

[OT] Can I count on order of template matching of array dimensions
by Patrick Horgan 24 Oct '10

24 Oct '10

Off topic. Feel free to ignore. About baby template meta-programming. Working my way through "C++ Template Metaprogramming" by Abrahams and Gurtovoy, and am doing exercise 2-3/4. This: template<typename T,size_t D> struct type_descriptor<T[D]> { static std::ostream& print(std::ostream& os) { os << type_descriptor<T>() << '[' << D << ']'; return os; } }; When asked to deal with a type, for example, char[7][8][9] results in the reversal of the indices and prints char[9][8][7]. I can deal with that, (see the p.s. at the end), but it made me curious. That implies that the compiler is seeing it like ((char[9])[8])[7] which makes sense. It's an array of length 7 of arrays of length 8 of arrays of length 9 characters. That's C/C++ row-major order. It has 7 tables each of which has 8 rows of 9 characters. My question is this. Can I count on this? I don't mean row-major order, I mean that the compiler will always match in this order. Is this matching BECAUSE of row-major order, or is it compiler dependent? Wait, never mind. I just thought it through. The implication, if it had done it textually as I expected, is that T would have had type char[7][8], and the second time, T would have had type char[7] which would have been a completely different beast. Well. I'm not really asking the question now after all, just throwing this out in case it helps anyone else's understanding. Please feel free to ignore. lol! I'm also implementing all of the is_char, is_array, remove_reference etc. metafunctions instead of using the boost or c++0x ones. I figure that way by the time I get through the book I'll have more understanding. That has given me questions, because after I implement each one, I look at the boost implementation, and I look at the the gcc libstdc++ implementation of the c++0x ones and generally they are, in order of reducing complexity, boost, gcc, me. Some of the difference in complexity is that boost needs to work with different compilers on different architectures, and gcc has to work with different architectures, and I just have to get it to compile on my machine (ubuntu maverick meercat on a dell inspiron 1420 laptop) with the gcc compiler (last night's pull from trunk) that I'm using. Other times, though, it LOOKS to me like there's extra complexity for nothing (I think brought about by the desire for maximal code reuse, i.e. don't include something in your template when you can invoke another cool metafunction to do it for you, but at the expense of higher compile-time complexity). I'll hold off on questions like that, though, until I finish the book in case the answers are in there. ;p Patrick p.s. if anyone cares, here's what I came up with (with the char base type type_descriptor so you can do std::cout << type_descriptor[7][8][9]). Any comments, improvements, critiques, and alternate implementations welcome: template<typename T> struct print_dimensions { // handles exit condition for recursive print_dimensions static std::ostream& print(std::ostream&os) { return os; } }; template<typename T,size_t D> struct print_dimensions<T[D]> { static std::ostream& print(std::ostream&os) { // print our dimension and invoke ourselve recursively to do the next os << '[' << D << ']'; print_dimensions<T>::print(os); return os; } }; template<typename T> struct remove_all_dimensions { // when no more dimensions this is the stop condition for the recursion typedef T type; }; template<typename T, size_t D> struct remove_all_dimensions<T [ D ]> { // recurse to ask our type with one less dimension to define the type for us typedef typename remove_all_dimensions<T>::type type; }; template<typename T> struct type_descriptor<char> { static std::ostream& print(std::ostream& os) { os << " char"; return os; } }; template<typename T,size_t D> struct type_descriptor<T[D]> { static std::ostream& print(std::ostream& os) { // pull off all the dimensions, print the base type, then ask print_dimensions to print the dims. os << type_descriptor<typename remove_all_dimensions<T>::type>(); print_dimensions<T[D]>::print(os); return os; } }; p.p.s This is really fun! p.p.p.s Does anyone know of a mailing list to discuss beginning TMP? Patrick again ;p

2 1

asio nntp reading data
by Kraus Philipp 24 Oct '10

24 Oct '10

Hello, I try to read the newsgroup list with aiso, but I've got some problems with terminate the reading. I send the "list" command to my nntp server and get a status 200, after that I read the data with boost::asio::streambuf l_response; std::istream l_response_stream( &l_response ); boost::system::error_code error; while (boost::asio::read(m_socket, l_response, boost::asio::transfer_at_least(1), error)) std::cout << &l_response; and I see on cout the list (excerpt): xs4all.ipv6 0000000481 0000000001 y de.comp.lang.vbclassic 0000000257 0000000001 y de.comp.office-pakete.ms-office.word 0000000013 0000000001 y it.comp.dotnet 0000000074 0000000001 y free.timothy.sutter 0000000003 0000000001 y free.soc.religion.christian 0000000006 0000000001 y free.fan.taylor-momsen 0000000000 0000000001 y . After the dot, my program doesn't terminate, because the while loop doesn't break. I understand the loop in that way: I read some bytes into my stream from the socket and write them to the std::cout, if there more bytes the loop will continue otherwise (like EOF) the look should be break. I use the example at http://www.boost.org/doc/libs/1_44_0/doc/html/boost_asio/example/http/clien… because I'm new on asio, so I hope someone can explain me, the problem. Thanks for help Phil .

4 5

Finite State Filters
by Kraus Philipp 24 Oct '10

24 Oct '10

Hi, I've found http://www.boost.org/doc/libs/1_44_0/libs/iostreams/doc/tutorial/finite_sta… for filtering stream data. I've got a stream which I would filter with a state filter, because I must check some data and substitute them. Now I try to create a state struct, but I can't compile it, because the headers on the page seems to be not correct. I use a a istream, in which the data saved, now I would send them through the state machine filter for get my output data. My first try was to create the states with a boost::mpl::vector, but the example on the page doesn't work because the compiler can't find the "row" deklaration. Is there an example for a full state filter, that works? Or should I use the boost spirit? I would like to filter my stream data. Thanks for help Phil

1 0

[thread] unlock
by gast128 23 Oct '10

23 Oct '10

Hello all, When using unique_lock in combination with mutex, one should only lock / unlock thru the unique_lock, otherwise its managment gets corrupted. However the unlock fct. is also offered in the mutex, which makes it vunerable for small typo errors like (code simplified): void foo() { boost::mutex mtx; for (size_t n = 0; n != 2; ++n) { boost::unique_lock<boost::mutex> lck(mtx); //mtx.unlock(); //hang in next lock attempt lck.unlock(); //ok } } Not sure if something can be done about this; mail only meant to share information.

1 0

[date-time] Getting time from midnight in nanoseconds
by ppatel＠efs-us.com 22 Oct '10

22 Oct '10

I am resending this with proper subject line. Thanks From: Priyank Patel Sent: Friday, October 22, 2010 8:47 AM To: boost-users(a)lists.boost.org Subject: Getting time from midnight in nanoseconds Hi, Can you please tell me if there is a way to get current time in nanoseconds using boost date_time library? I have tried following but it doesn't seems to be returning values in nanoseconds. I know I have used microsec_clock and that might be the problem but not sure what alternate to use. Any help will be appreciated. hrtime_t getCurrentTime() { boost::posix_time::ptime recvTime = boost::posix_time::microsec_clock::local_time(); boost::posix_time::time_duration duration( recvTime.time_of_day() ); return duration.total_nanoseconds(); // This call returns values in microseconds (last three digits are always zero in returned value) } Thanks Priyank

3 3

Re: [Boost-users] [Pool] Problems using Boost.Pool with the Eigen matrix library
by lfrfly＠icqmail.com 22 Oct '10

22 Oct '10

>2010/10/14 <lfrfly(a)icqmail.com>: >> Since Eigen matrices and vectors use SSE and therefore require a particular >> alignment, Eigen requires that when these types (specifically, the >> compile-time sized versions) are within a struct or class, that struct be >> given the EIGEN_MAKE_ALIGNED_OPERATOR_NEW macro. > >What we do require is that e.g. Vector4f's be created at 16 byte >aligned locations. EIGEN_MAKE_ALIGNED_OPERATOR_NEW is just one way of >doing that. > >> >> But here's the problem. What if that struct is allocated by a >> boost::pool_allocator<T>? Is there any way to enforce alignment then? > >That's a question for boost::pool_allocator, not for us; if this >allocator doesn't give you 16 byte alignment, then you need a >different allocator (or just modify this allocator to meet this >criterion). > >The allocator is what gives you an address. If it's giving >non-16-byte-aligned addresses, then it can't be used. > >Benoit It's now clear that this question belongs firmly on the Boost.Pool side of the fence, so here it is---I'm wondering why boost::pool_allocator isn't designed to work with a standard-compliant allocator as its second template parameter? I tried creating a boost::fast_pool_allocator<T, Eigen::aligned_allocator<T>>, but this failed with a compile error----apparently fast_pool_allocator has an unusual notion of what concept a UserAllocator should satisfy, requiring the methods malloc() and free(). Why does it not accept any standard allocator, which will instead provide allocate() and deallocate()? This seems like a serious shortcoming.

1 0

building boost with the windows sdk 7.1
by Sean Farrow 22 Oct '10

22 Oct '10

Hi: I need to build boost with the windows sdk v7.`1. I've got vs2010 (10.0) instaloled and the sdk. If there anything specific I need to do to build with 7.1 as aposed to 7.0? Cheers Sean.

4 3

Re: [Boost-users] [boost] What's so cool about Boost.MPI?
by Brian Wood 22 Oct '10

22 Oct '10

>At Thu, 21 Oct 2010 14:25:38 -0500, >Brian Wood wrote: >> >> David Abrahams: >> > Which yields huge performance benefits and makes practical some >> > computations that might otherwise not be, due to resource constraints >> >> I've been exploring this further here - >> http://www.gamedev.net/community/forums/topic.asp?topic_id=585405 >> >> Also, from what I can tell, MPI messages are composed of one >> data type or an array of one type. > > Maybe, but the library lets you easily make arbitrarily complex data > types (described to MPI as MPI type maps). Right, I don't deny that. > >> If that's the case, I'd argue there's room for more coolness. > >What more do you want? Here's an example from my work. I have a three-tier architecture: C++ Middleware Writer (server) | C++ Middleware Writer Ambassador (server) | command line program that exits I'll introduce a struct that I don't currently use, but that might make this easier to follow. struct RequestData { uint32_t accountNumber; uint32_t transactionNumber; std::vector<File> includeFiles; std::auto_ptr<File> middleFile; uint32_t userOptions; }; I could use that to send a message, but being forced to receive those fields as a unit would be detrimental to the implementation of the C++ Middelware Writer. The account number is used to determine how the files are received. A directory is associated with each account. If I couldn't break the account number out of there, I'd have to receive the files into a temporary directory and then move them into the right directory later and get rid of the temporary directory. So I do it something like this: struct TransactionData { uint32_t transactionNumber; std::vector<File> includeFiles; std::auto_ptr<File> middleFile; uint32_t userOptions; }; That's the same as RequestData, but the account number field has been removed. This middle code describes how the message is sent (@out) and received (@in): (uint32_t, TransactionData) @out @msg_id_direct (uint32_t) @in (TransactionData) @in The sending process sends 2 items as one message. The receiving process receives the message in two steps. First it gets the account number as a uint32_t which it uses to receive the balance of the message. I believe accomplishing the same thing with MPI would involve two message ids (tags) and would require more work to be certain that the messages are sent and received in the correct order. There's needless overhead associated with the additional message id and the programming is more involved to make sure everything is kosher. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

2 1

Printer Friendly Proto
by Hossein Haeri 22 Oct '10

22 Oct '10

Dear all, How can I get a printer friendly version of the complete Proto documentation? http://boost.org/doc/libs/1_44_0/doc/html/proto.html A PDF version say? (I'm going to read it in bus, bus-stop, etc etc. So, the webpage is not very useful without internet connection. Furthermore, I take it that Chapter 15 of the Boost book is now completely outdated...) TIA, --Hossein

2 1

asio UDP message packet loss even on localhost?
by Ákos Maróy 22 Oct '10

22 Oct '10

Hi, I'm having a very basic issue: when sending a large number of UDP messages in short succession via boost::asio, even to localhost, after a few hundred messages, there seems to be a serious loss. please see a sample code here: http://pastebin.com/Bq0DnkeG the output I get is the following: $ ./async_asio 0 1 2 3 ... 939 940 941 942 943 944 958 983 1013 1049 1093 1151 1234 1363 1576 1943 b sent 2000 messages a received 955 messages so, basically while 2000 messages were sent over, only up to 944 were received so that all of them are, an then there are only sporadic messages received afterwards - a total of 955. while I understand UDP is not guaranteed to be sent over, such a level of unreliability to the localhost interface seems to be quite troublesome.. what am I doing wrong? Akos

7 14

Boost.MPI build problem: auto-configuration fails
by Kondov, Ivan 22 Oct '10

22 Oct '10

Hi, I would like to build boost.mpi from boost/1.43.0 with gcc/4.4.4, openmpi/1.4.2 on GNU/Linux 2.6.18-128.1.14.el5.8hp.2sp SMP x86_64 bjam always skips the MPI section (see below). Adding a line in user-config.jam "using mpi : /software/all/openmpi/1.4.2/bin/mpiCC ;" or "using mpi : /software/all/openmpi/1.4.2/bin/mpic++ ;" does not change the result: username@host:~/boost/boost_1_43_0$ bjam -v Boost.Jam Version 3.1.18. OS=LINUX. username@host:~/boost/boost_1_43_0$ bjam --with-mpi warning: No toolsets are configured. warning: Configuring default toolset "gcc". warning: If the default is wrong, your build may not work correctly. warning: Use the "toolset=xxxxx" option to override our guess. warning: For more configuration options, please consult warning: http://boost.org/boost-build2/doc/html/bbv2/advanced/configuration.html Building the Boost C++ Libraries. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. Component configuration: - date_time : not building - filesystem : not building - graph : not building - graph_parallel : not building - iostreams : not building - math : not building - mpi : building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : not building - system : not building - test : not building - thread : not building - wave : not building ...found 1 target... The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: ......................../username/boost/boost_1_43_0 The following directory should be added to linker library paths: ......................../username/boost/boost_1_43_0/stage/lib username@host:~/boost/boost_1_43_0$ which mpic++ /software/all/openmpi/1.4.2/bin/mpic++ username@host:~/boost/boost_1_43_0$ mpic++ -v Using built-in specs. Target: x86_64-linux-gnu Configured with: ../gcc-4.4.4/configure --enable-threads=posix --enable-shared --prefix=/software/all/gcc/4.4.4 --enable-languages=c,c++,fortran,java --enable-checking=release --with-tune=generic --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu --with-gmp=/software/all/gcc_infrastructure/gmp/4.3.2 -with-mpfr=/software/all/gcc_infrastructure/mpfr/2.4.2 --with-ppl=/software/all/gcc_infrastructure/ppl/0.10.2 --with-cloog=/software/all/gcc_infrastructure/cloog-ppl/0.15.9 Thread model: posix gcc version 4.4.4 (GCC) Many thanks in advance for any help! Best regards, Ivan

2 4

[boost] What's so cool about Boost.MPI?
by Brian Wood 22 Oct '10

22 Oct '10

David Abrahams: >At Tue, 19 Oct 2010 16:26:04 +0200, >Thorsten Ottosen wrote: >> >> The semi-automatic, but very easy to maintain, way of >> creating/maintaining the MPI type maps (via Boost.Serialization), >> IIUC. > Which yields huge performance benefits and makes practical some > computations that might otherwise not be, due to resource constraints I've been exploring this further here - http://www.gamedev.net/community/forums/topic.asp?topic_id=585405 Also, from what I can tell, MPI messages are composed of one data type or an array of one type. If that's the case, I'd argue there's room for more coolness. Brian Wood Ebenezer Enterprises http://webEbenezer.net

3 2

Re: [Boost-users] foreach question
by Pete Bartlett 21 Oct '10

21 Oct '10

Rob Riggs wrote: > On 10/15/2010 12:27 PM, Neal Becker wrote: >> The following loop iterates over strings in result (which >> comes from boost::split). Is there a way to include the integer >> enumerator 'col' into the FOREACH loop? >> >> In python that would be spelled >> for col,s in enumerate (result): >> ... >> >> int col = 0; >> BOOST_FOREACH (std::string s, result) { >> H(row, col) = boost::lexical_cast<int> (s); >> ++col; >> } >> > > >Something like: > >template <typename Range> >auto make_counting_range(Range& range, size_t start = 0 >[..] > >would then give you: > > BOOST_FOREACH(auto t, make_counting_range(result)) > { > using boost::tuples::get; > H(row, get<0>(t)) = boost::lexical_cast<int>(get<1>(t)); > } > >(Compiled with GCC 4.4.) Even without C++0x, you can wrap this up into a reasonable interface to get e.g. std::vector<std::string> data = boost::assign::list_of("foo")("bar")("baz"); BOOST_INDEXED_EACH( std::size_t i , std::string const& s , data ) std::cout << "\n" << i << " " << s; if you tinker a little bit with BOOST_FOREACH internals - see code below, compiled on vc10 with Boost.ForEach code as in 1.43. However for the same reasons that BOOST_REVERSE_FOREACH exists (rather than just using BOOST_FOREACH( ... , make_reverse_range(r) ) - see http://lists.boost.org/boost-users/2007/07/29101.php ) this approach doesn't play well with rvalue ranges. Instead you'd have to duplicate the guts of FOREACH, as Eric did for REVERSE_FOREACH, to get a library-quality version. Pete #include <boost/range/begin.hpp> #include <boost/range/end.hpp> #include <boost/range/distance.hpp> #include <boost/range/iterator_range.hpp> #include <boost/iterator/zip_iterator.hpp> #include <boost/iterator/counting_iterator.hpp> template< typename Range > struct indexed_range { typedef boost::counting_iterator<std::size_t> it0_type; typedef typename boost::range_iterator< Range >::type it1_type; typedef boost::tuple< it0_type , it1_type > tuple_type; typedef boost::zip_iterator< tuple_type > zip_type; typedef boost::iterator_range< zip_type > type; }; template< typename Range > typename indexed_range<Range>::type make_indexed_range(Range& range , std::size_t start = 0) { return make_iterator_range( boost::make_zip_iterator( boost::make_tuple( boost::counting_iterator<size_t>(start), boost::begin(range))), boost::make_zip_iterator( boost::make_tuple( boost::counting_iterator<size_t>( boost::distance(range) + start), boost::end(range)))); } #include <boost/foreach.hpp> #define BOOST_INDEXED_EACH_IMPL(VAR1, VAR2 , COL) \ BOOST_FOREACH_PREAMBLE() \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_col) = BOOST_FOREACH_CONTAIN(COL)) {} else \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_cur) = BOOST_FOREACH_BEGIN(COL)) {} else \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_end) = BOOST_FOREACH_END(COL)) {} else \ for (bool BOOST_FOREACH_ID(_foreach_continue) = true; \ BOOST_FOREACH_ID(_foreach_continue) && !BOOST_FOREACH_DONE(COL); \ BOOST_FOREACH_ID(_foreach_continue) ? BOOST_FOREACH_NEXT(COL) : (void)0) \ if (boost::foreach_detail_::set_false(BOOST_FOREACH_ID(_foreach_continue))) {} else \ for (VAR1 = boost::tuples::get<0>( BOOST_FOREACH_DEREF(COL) ); !BOOST_FOREACH_ID(_foreach_continue);)\ for(VAR2 = boost::tuples::get<1>( BOOST_FOREACH_DEREF(COL) ); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true) #define BOOST_INDEXED_EACH(VAR1,VAR2,COL) BOOST_INDEXED_EACH_IMPL(VAR1,VAR2,make_indexed_range(COL)) //test scaffolding #include <vector> #include <iostream> #include <boost/assign/list_of.hpp> int main() { std::vector<std::string> data = boost::assign::list_of("foo")("bar")("baz"); BOOST_INDEXED_EACH( std::size_t i , std::string s , data ) std::cout << "\n" << i << " " << s; std::cout << "\n\n"; return 0; }

1 0

exception type thrown by ip::address::from_string()
by Alan Vella 21 Oct '10

21 Oct '10

Hi all, I've started working with the Boost ASIO library and came across a problem. I'm trying to catch exceptions thrown by boost::asio::ip::address::from_string(const std::string & str) but I don't know what the type of the exception that I should catch is. I can find no mention of this in the boost reference. Any help would be appreciated. Many thanks, Alan _______________________________________________________ Unlimited Disk, Data Transfer, PHP/MySQL Domain Hosting http://www.doteasy.com

2 1

Can't link subgraphs because remove_vertex is a TODO
by Trevor Harmon 21 Oct '10

21 Oct '10

Hi, I have two directed subgraphs that I want to link together in a particular way. To illustrate: BEFORE 1 ---> 2 ---> 3 4 ---> 5 ---> 6 AFTER 1 ---> 2 ---> 3 \---> 5 ---> 6 Note that vertex 4 is removed, and the edge that was linking 4 to 5 now links 1 to 5. Seems simple enough, but there are two problems, one minor and one major: 1) To rewire the edge's source from 4 to 1, I'd like to simply change the edge's source. But that doesn't seem possible in Boost. It appears I must remove the edge and add a new one with the desired source. This can get complicated when it comes to preserving the edge's properties, index maps, and such, but hey, at least it's doable. 2) This one I can't work around. Calling remove_vertex on a subgraph gives an assertion failure: Assertion failed: (false), function remove_vertex, file /usr/local/ boost_1_43_0/boost/graph/subgraph.hpp, line 733. It turns out that subgraph's remove_vertex method is not implemented at all, which is quite the showstopper for my project. I don't know enough about Boost to implement it myself. Any suggestions? Thanks, Trevor

2 6

[thread] documentation complaints
by Robert Ramey 21 Oct '10

21 Oct '10

I had occasion to look into the thread documentation after many years. It was in the course of explaining the benefits of using boost libraries to a programmer who was unfamiliar with them. Somehow I remember the old documentation as being much more helpful. I think I remember tutorials and a faq explaining things why semaphores weren't inlcuded etc. I remember finding this to be very helpful. My original interest in boost was sparked by reading this documentation. The current system seems more complete and the documention more formal and correct. But it needs tutorials which explain how to use the library to solve problems and to explain the examples. It also needs a section to explain the design decisions. Robert Ramey

2 1

foreach question
by Neal Becker 21 Oct '10

21 Oct '10

The following loop iterates over strings in result (which comes from boost::split). Is there a way to include the integer enumerator 'col' into the FOREACH loop? In python that would be spelled for col,s in enumerate (result): ... int col = 0; BOOST_FOREACH (std::string s, result) { H(row, col) = boost::lexical_cast<int> (s); ++col; }

4 4

[Variant] Tree like structure with variant
by dariomt＠gmail.com 21 Oct '10

21 Oct '10

Hi all, I need a tree-like structure like the following boost::variant< int, std::vector<tree>, std::map<std::string, tree> > tree; So, my tree can have an int, or a list of trees, or a map of trees. Of course this is not possible, and I've been trying to use boost::recursive_wrapper. I have looked at the example in the documentation, but and I'm not able to achieve what I want. My feeling is that I'm missing an extra 'node' level somewhere, but since all the types I'm using are typedefs, I cannot forward delcare it to break the cyclic reference... I would appreciate help with this. Thanks in advance.

4 3

Passing a boost::unordered_set as the result map to boost::split
by Jeremy Stribling 21 Oct '10

21 Oct '10

Anyone here know the answer to this question? http://stackoverflow.com/questions/3981123/passing-a-boostunordered-set-as-… Thanks, Jeremy

2 2

[PropertyTree] Adding comments to existing property tree object
by René Perlberg 21 Oct '10

21 Oct '10

Hello to everyone, I wonder whether it is possible to add comments to an existing property tree object. To be more specific: I read in some XML files and change some attribute values (both relaized using property tree). In addition to that I would like to add some comments to a specific path in the property tree. Looking inside the code of property tree I found a function 'write_xml_comment', but I'm not sure whether and how this function may be used to address my problem. With kind regards, René.

1 0

[ASIO] Problem with reading of serial ports using ASIO
by Jim Donaldson 20 Oct '10

20 Oct '10

Hi All, I'm having some problems using Boost ASIO on Windows XPSP3, 32 bit. I'm trying to set-up an asynchronous read from a serial port on the computer (actually a USB port masquerading as a serial port). The code is at http://gist.github.com/634618 We regularly call the function PCTimeoutUart::wait( iseSize_t len, uint32 timeoutInMS ) which wraps the calls to the boost asio libraries. This creates a deadline_timer, and binds it to our timeout callback (PCTimeoutUart::finishedTimer) It also calls async_read_some on the boost::asio::serial_port object m_port to read the required length, and binds that to the PCTimeoutUart::finishedRead callback. We call the runone() function on m_io, which is declared in the header as a boost::asio::io_service and has been passed to both the timer and serial port's constructors. We continually call this in a loop until either m_timedOut has been set by the asynchronous call back to PCTimeoutUart::finishedTimer or m_finishedRead has been set via the call back to PCTimeoutUart::finishedRead Normally, this works well. However, there are certain scenarios when it fails to write anything to the buffer, despite the fact that finishedRead() is called with error = 0 and the correct length . I've checked by initializing the buffers with a couple of different values and each time, it's clear that the buffer is being passed back without those values being altered. Strangely, it is always when the string sent by the external device is '\r\nNACK:XX\r\n' where XX is a 2 character ascii number. I've got portmon running on the serial port and it confirms that the data has been correctly received from the external device. We've debugged it as far as putting a break-point on line 71 and at that point can see that the system thinks that a read is complete, n bytes have been returned, but only some of those bytes are in buffer. If anyone could offer any views on why we may be having problems, or places that we could look, then that would be very much appreciated. Thanks in advance, Jim

2 2

Methods prefixed by cdecl?
by Ven Tadipatri 20 Oct '10

20 Oct '10

Hi, I'm using Windows 7 (64 bit) and I'm trying to compile and link my code against the regex libraries. It compiles fine, but at link time, it can't find any of the methods in the regex library. But the methods it's looking for are prefixed by "__cdecl". I've tried compiling my code with the /Gd and /Gz options, and neither seemed to work. Here's what the error looks like: [ERROR] ResourceURI.obj : error LNK2019: unresolved external symbol "private: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __cdecl boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::do_assign(char const *,char const *,unsigned int)" (?do_assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@AEAAAEAV12@PEBD0I@Z) referenced in function "public: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __cdecl boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::assign(char const *,char const *,unsigned int)" (?assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@QEAAAEAV12@PEBD0I@Z) [ERROR] ResourceService.obj : error LNK2001: unresolved external symbol "private: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __cdecl boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::do_assign(char const *,char const *,unsigned int)" (?do_assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@AEAAAEAV12@PEBD0I@Z) [ERROR] AtomicParsingExpression.obj : error LNK2001: unresolved external symbol "private: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __cdecl boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::do_assign(char const *,char const *,unsigned int)" (?do_assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@AEAAAEAV12@PEBD0I@Z) [ERROR] AbstractLoopingVariable.obj : error LNK2001: unresolved external symbol "private: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __cdecl boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::do_assign(char const *,char const *,unsigned int)" (?do_assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@AEAAAEAV12@PEBD0I@Z) When I do a dumpbin /symbols on the regex library I built, it does contain the methods above (as far as I can tell) 26F 00000000 SECT92 notype () External | ?assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@QAEAAV1 2@PBD0I@Z (public: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __thiscall boost: :basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::assign(char const *,char const *,unsigned int)) CB4 00000000 SECT40D notype () External | ?do_assign@?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@boost@@AAEAAV12@PBD0I@Z (private: class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > & __thiscall boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::do_assign(char const *,char const *,unsigned int)) Any ideas on how to get my programs to link against the methods in the regex library? Thanks, Ven

5 5

Boost Fiber Compile error -- Boost task
by Glenn Macgregor 20 Oct '10

20 Oct '10

Hi All, I am in the process of trying to get boost task compiled and working with Boost 1.43.0. As far as I can tell it relies on boost fiber and boost context as well so I got them from the boost vault. I am using: * boost.context-0.2.0 * boost.fiber-0.5.1 * boost.task-0.4.2 I have copied these into my boost 1.43.0 build area and have run bjam as normal: Component configuration: - context : not building - date_time : not building - fiber : building - filesystem : not building - graph : not building - graph_parallel : not building - iostreams : not building - math : not building - mpi : not building - program_options : not building - python : not building - random : not building - regex : not building - serialization : not building - signals : not building - system : not building - task : not building - test : not building - thread : not building - wave : not building Below is the first couple errors I get but all of the following errors are of the same type: .\boost/fiber/strategy.hpp(123) : error C2492: 'boost::fibers::strategy::active_ fiber' : 'thread' data may not have dll interface .\boost/fiber/strategy.hpp(123) : error C2492: 'protected: static boost::fibers: :fiber * boost::fibers::strategy::active_fiber' : 'thread' data may not have dll Interface This seems to have to do with the __declspec(thread) but I am not very familiar with that so I can't really do much debugging. My build environment is: Windows XP64 VisualStudio 2008 Thanks in advance for any help. Glenn

1 0

DLL Load Failed
by Monde, John 20 Oct '10

20 Oct '10

Hi, I am having a problem moving my boost python extension to a different machine than my development machine. On my development machine everything works great, I can access my C++ classes through python without any problems but when I copy my .pyd (Python_ext.pyd) to my target machine I get the error "DLL Load failed The specified module could not be found" in my Python program when I attempt to import the .pyd (import Python_ext) I am using Boost_1_42. The .pyd was built using BJAM and my compiler is MSVS 2003 and python26. Python26 is on both the development and the target machine. I had similar problem when I moved my python .pyd extension module to a different directory on my development machine but I fixed that by copying the boost dll boost_python-vc71-mt-gd-1_42.dll to the directory with my .pyd module and it ran great there. I tried to do the same thing on my target machine. I copied my python program, the .pyd extension module and the boost DLL (boost_python-vc71-mt-gd-1_42.dll) to the same directory on my target machine and still get the same error. Both machines are windows XP. To test this I am using a simple test C++ class that just receives two numbers and prints out there sum so I do not believe I am bringing in any other dlls. I am sure this is a simple problem and I am just missing it. Any help would be greatly appreciated. Thanks John

2 2

[spirit::qi] assertion during parsing
by Ovanes Markarian 20 Oct '10

20 Oct '10

Hello *, I have a strange problem. When parsing some output boost::spirit::qi parser aborts the application stating the following error message: /local/include/boost/spirit/home/support/char_encoding/ascii.hpp:256: static int boost::spirit::char_encoding::ascii::isspace(int): Assertion `isascii_(ch)' failed. Indeed my input sequence is: ~B"þ¯Þº~N But is it really a reason to assert the parser and crash the app? This input would not match my grammar, so from my point of view (as library user) it is just fine: not to match the input, without any assertions. And I should be able to decide what to do next. I use boost 1.44 with gcc (GCC) 3.4.6 20060404 (Red Hat 3.4.6-11) Many thanks for support, Ovanes

2 5

How to run boost.Test iteratively?
by Gaurav N Shah 20 Oct '10

20 Oct '10

void test1() { BOOST_CHECK(2 == 1); } bool init_test() { boost::unit_test::test_suite* ts1 = BOOST_TEST_SUITE( "test_suite1" ); ts1->add(BOOST_TEST_CASE(&test1)); ::boost::framework::master_test_suite().add(ts1); return true; } int main(int argc, char* argv[]) { boost::unit_test::unit_test_main(&init_test, argc, argv); //1st attempt sleep(1 mins) boost::unit_test::unit_test_main(&init_test, argc, argv); //2nd attempt } On first attempt test case runs fine. However, on second attempt I get below error: *** 1 failure detected in test suite "Master Test Suite" Test setup error: Fail to process runtime parameters: Definition of parameter auto_start_dbg conflicts with defintion of parameter auto_start_dbg Usage: TestProject.exe [{--auto_start_dbg=|-d }[yes|y|no|n]] [--break_exec_path=<value>] [{--build_info=|-i }[yes|y|no|n]] [{--catch_s ystem_errors=|-s }[yes|y|no|n]] [--detect_fp_exceptions=[yes|y|no|n]] [--detect_memory_leaks=<value>] [{--log_format=|-f }<value>] [{--log_level=|-l }<value>] [{--output_format=|-o }<value>] [{--random=|-a }[<value>]] [{--report_format=|-m }<value>] [{--report_l evel=|-r }<value>] [{--result_code=|-c }[yes|y|no|n]] [{--run_test=|-t }<value>] [--save_pattern=[yes|y|no|n]] [{--show_progress=|- p }[yes|y|no|n]] [--use_alt_stack=[yes|y|no|n]] [{--help=|-? }[yes|y|no|n]] Why this occurs and How this can be avoided? Thank You, Gaurav This communication is for informational purposes only. It is not intended as an offer or solicitation for the purchase or sale of any financial instrument or as an official confirmation of any transaction. All market prices, data and other information are not warranted as to completeness or accuracy and are subject to change without notice. Any comments or statements made herein do not necessarily reflect those of JPMorgan Chase & Co., its subsidiaries and affiliates. This transmission may contain information that is privileged, confidential, legally privileged, and/or exempt from disclosure under applicable law. If you are not the intended recipient, you are hereby notified that any disclosure, copying, distribution, or use of the information contained herein (including any reliance thereon) is STRICTLY PROHIBITED. Although this transmission and any attachments are believed to be free of any virus or other defect that might affect any computer system into which it is received and opened, it is the responsibility of the recipient to ensure that it is virus free and no responsibility is accepted by JPMorgan Chase & Co., its subsidiaries and affiliates, as applicable, for any loss or damage arising in any way from its use. If you received this transmission in error, please immediately contact the sender and destroy the material in its entirety, whether in electronic or hard copy format. Thank you. Please refer to http://www.jpmorgan.com/pages/disclosures for disclosures relating to European legal entities.

2 1

[Boost.Spirit] Synthesised attributes and sub-rules
by Vitaly Budovski 20 Oct '10

20 Oct '10

Hi, Please have a look at the code below. I would like to be able to split up the start rule into several sub-rules (currently commented out). The problem is, I'm not sure how to reference the synthesised attribute from the grammar in these sub-rules? Is it possible? I would like to do this so that the grammar is more readable, as the actual rules have a bit more complexity than in this simple example. Thank you, Vitaly ---------------- #include <boost/spirit/home/phoenix/bind/bind_function.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/tuple/tuple.hpp> #include <algorithm> #include <iterator> #include <string> #include <vector> using namespace boost::spirit; using namespace boost::spirit::qi; struct a_: qi::symbols<char, int> { a_() { add ("A", 0) ("B", 1) ("C", 2) ; } } a; struct b_: qi::symbols<char, boost::tuple<int, int> > { b_() { add ("x", boost::make_tuple(3, 2)) ("y", boost::make_tuple(4, 0)) ("z", boost::make_tuple(5, 1)) ; } } b; struct c_: qi::symbols<char, int> { c_() { add ("E", 6) ("D", 7) ("J", 8) ; } } c; void insert_a(const int &value, const boost::optional<unsigned int> &count, std::vector<int> &result) { unsigned int c = 1; if(count) { c += *count; } for(unsigned int i = 0; i < c; ++i) { result.push_back(value); } } void insert_b(const boost::tuple<int, int> &value, const boost::optional<unsigned int> &count, std::vector<int> &result) { unsigned int c = 1; if(count) { c += *count; } for(unsigned int i = 0; i < c; ++i) { result.push_back(value.get<0>()); result.push_back(value.get<1>()); } } void insert_c(const int &value, const boost::optional<unsigned int> &count, std::vector<int> &result) { unsigned int c = 1; if(count) { c += *count; } for(unsigned int i = 0; i < c; ++i) { result.push_back(value); } } template<typename Iterator> struct test_grammar: qi::grammar<Iterator, std::vector<int>()> { test_grammar(): test_grammar::base_type(start) { using boost::phoenix::bind; /*a_rule = ( +(a >> -uint_)[bind(insert_a, _1, _2, _val)] ) ; b_rule = ( +(b >> -uint_)[bind(insert_b, _1, _2, _val)] ) ; c_rule = ( +(c >> -uint_)[bind(insert_c, _1, _2, _val)] ) ;*/ start = ( +(a >> -uint_)[bind(insert_a, _1, _2, _val)] | +(b >> -uint_)[bind(insert_b, _1, _2, _val)] | +(c >> -uint_)[bind(insert_c, _1, _2, _val)] ) ; } qi::rule<Iterator> a_rule; qi::rule<Iterator> b_rule; qi::rule<Iterator> c_rule; qi::rule<Iterator, std::vector<int>()> start; }; int main() { std::string s("A3BAC6"); typedef std::string::iterator string_iterator; string_iterator first = s.begin(); string_iterator last = s.end(); typedef test_grammar<string_iterator> test_grammar; test_grammar test_parser; std::vector<int> v; bool result = parse(first, last, test_parser, v); if(result && first == last) { std::copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " ")); std::cout << std::endl; } else { std::cerr << "Failed to parse expression\n"; v.clear(); } std::string s2("xy2z3"); string_iterator first2 = s2.begin(); string_iterator last2 = s2.end(); bool result2 = parse(first2, last2, test_parser, v); if(result2 && first2 == last2) { std::copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " ")); std::cout << std::endl; } else { std::cerr << "Failed to parse expression\n"; v.clear(); } std::string s3("EDJ"); string_iterator first3 = s3.begin(); string_iterator last3 = s3.end(); bool result3 = parse(first3, last3, test_parser, v); if(result3 && first3 == last3) { std::copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, " ")); std::cout << std::endl; } else { std::cerr << "Failed to parse expression\n"; v.clear(); } return 0; }

2 3

boost.MPI dynamic data structure error
by Jack Bryan 20 Oct '10

20 Oct '10

Hi , I need to design a data structure to transfer data between nodes by boost.MPI. Some elements of the the structure has dynamic size. For example, typedef struct{ double data1;vector<double> dataVec; } myDataType; The size of the dataVec depends on some intermidiate computing results. If I only declear it as the above myDataType, I think, only a pointer is transfered. When the data receiver try to access the elements of vector<double> dataVec, it got segmentation fault error. But, I also need to use the myDataType to declear other data structures. such as vector<myDataType> newDataVec; I cannot declear myDataType in a function , sucjh as main(), I got errors: main.cpp:200: error: main(int, char**)::myDataType; uses local type main(int, char**)::myDataType; Any help is really appreciated. thanks Jack Oct. 19 2010

2 3

Question about Boost License and commercial software
by marc_elias＠terra.es 20 Oct '10

20 Oct '10

Hi, I'm working in a company that want to use boost libraries to a commercial software. I have a pair of questions: 1. Is it possible to distribute under the boost license a commercial software (so the source code won't be exposed) programmed with static boost libraries? 2. And with linked libraries to an executable? Thanks in advance! MARC

6 6

[Regex] This pattern compiles fine for Perl and PCRE but not for Boost Regex
by David Dawe 20 Oct '10

20 Oct '10

Boost Regex fails to compile a regular expression such as "{abc}" with the error "Invalid content of repeat range". However, both Perl and PCRE accept the regular expression, treating the "{" as a literal character. The PCRE man page at http://www.pcre.org/pcre.txt clearly states: An opening curly bracket that appears in a position where a quantifier is not allowed, or one that does not match the syntax of a quantifier, is taken as a literal character. The Perl regular expression man page at http://perldoc.perl.org/perlre.html is similar, though not quite as clear: If a curly bracket occurs in any other context, it is treated as a regular character. In particular, the lower bound is not optional. Nevertheless, the behaviour of both PCRE and Perl are the same. I am currently using Boost 1.39, but I have seen no mention of a change in this area for more recent versions of Boost Regex. And finally ... my question ... Is there a way in Boost Regex to interpret a "{" as a literal character in the above context in a Perl regular expression, while still allowing the "{n,m}" bounded repeat in places where it is syntactically valid? Thanks.

4 4

boost::thread_resource_error
by Julien Martin 19 Oct '10

19 Oct '10

Hello, I am encountering the following error: ********************************** terminate called after throwing an instance of 'boost::thread_resource_error' what(): boost::thread_resource_error Abandon ********************************** trying to run a threadgroup of 500 threads as follows: thread_group * thgrp = new thread_group(); for (int i = 0; i < NUMTHREADS; i++) { thgrp->create_thread(bind(&simulate, i, 100, 0.05, 0.2, 1.0, 100, 100, endPrices)); } thgrp->join_all(); Can anyone please help. I don't understand why I get this error as I have no resource problems with my machine. Julien.

2 2

dynamic_bitset: request to add find_last() function
by Hicham Mouline 19 Oct '10

19 Oct '10

Hello As there is a find_first() function, is there a way to get a find_last() which returns the index of the most significant bit that is on? Regards,

1 0

[boost] [serialization] Braking change with BOOST_CLASS_EXPORT
by petke himself 19 Oct '10

19 Oct '10

Hi, I noticed a breaking change / bug with boost serialization. (I hope this is the right mailinglist for bug reports) Upgrading from boost-1.35.0 to boost_1_44_0.. and I got compilation errors with the BOOST_CLASS_EXPORT macro. I did not write the user code so i dont know anything about the library, but it turns out BOOST_CLASS_EXPORT was called from inside several user namespaces. This meant the macro would try and specialize the template 'somens1::somens2::somens3::boost::serialization::guid_defined', which obviously does not exist. Placing the BOOST_CLASS_EXPORT macro outside of any user namespace solved the compile error. Im not sure why this worked in the old version of boost. But maybe it would be an idea to change the BOOST_CLASS_EXPORT macro, if possible, so that it jumps back into the root namespace. Should be as simple as replacing any "boost::serialization" with "::boost::serialization", right? The error message on VS2008 was: [exec] 1>xxx.h(67) : error C2143: syntax error : missing ';' before '<' [exec] 1>xxx.h(67) : error C2913: explicit specialization; 'somens1::somens2::somens3::boost::serialization::guid_defined' is not a specialization of a class template [exec] 1>xxx.h(67) : error C2059: syntax error : '<' [exec] 1>xxx.h(67) : error C3083: 'mpl': the symbol to the left of a '::' must be a type [exec] 1>xxx.h(67) : error C2039: 'true_' : is not a member of 'somens1::somens2::somens3::boost' [exec] 1>xxx.h(67) : error C2470: 'true_' : looks like a function definition, but there is no parameter list; skipping apparent body [exec] 1>xxx.h(67) : fatal error C1903: unable to recover from previous error(s); stopping compilation Regards, Patrik

2 1

Beginner needs help with Boost thread class
by Julien Martin 19 Oct '10

19 Oct '10

Hello, I am completely new to Boost and I would like to know in which method to put the business logic (work) of my thread class (which inherits from boost::thread). When you do that in Java you implement Runnable and put the business logic in the run() method. How do I do that with boost? Thanks in advance, Julien.

3 3

Fwd: [Graph] Problem with dynamic_properties
by fokenrute 19 Oct '10

19 Oct '10

Hi everybody, I'm new to BGL and very frustrated beacause I can't make a proper use of dynamic_properties. I'm just trying to read a graphviz dot file with read_graphviz and I found a sample which make use of dynamic_properties in order to make a proper call to read_grahviz. Here is the slightly modified sample: typedef boost::adjacency_list < boost::listS, boost::vecS, boost::undirectedS > Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; typedef boost::graph_traits<Graph>::vertex_iterator Iterator; int main(int argc, char **argv) { Graph g; std::ifstream input(argv[1]); boost::dynamic_properties dp; dp.property("node_id", boost::get(boost::vertex_name, g)); dp.property("weight", boost::get(boost::edge_weight, g)); boost::read_graphviz(input, g, dp, "id"); return 0; } When I try to compile it, g++ returns lots of cryptic template related error messages but I suspect the most relevant part is : no match for 'operator<<' in 'out << boost::get...' I must be doing something wrong, but I can't get it; expect you'll point me out my mistake so that I could re-focus on the algorithms instead of these annoying technical details.

3 2

[review result] mini-review of update to Boost.Assign
by Thorsten Ottosen 19 Oct '10

19 Oct '10

Dear all, Here follows the result of the result of Erwann Rogard's update to Boost.Assign: **************************** The update is not accepted **************************** This is not because the new functioanlity/interface was not seen as an improvement, but because Erwann has chosen to implement a full replacement (or Assign v2) based on the feedback he got during the review. The feedback meant that the new "update" would be much larger than what was present in the mini-review, and the new library should therefore be subject of its own full review. I would like to thank Erwann for his hard work so far, and hope he submits a Boost.Assign v2 in the near future. I would also like to thank the following people who participated in the mini-review: Christopher Jefferson Diederick C. Niehorster John Bytheway kind regards Thorsten, review manager

3 3

Changing the priority of a thread
by Jean-Sebastien Stoezel 19 Oct '10

19 Oct '10

Hello, Is it possible to change the priority of the boost::thread in windows? How do you do it? Thanks, Jean

2 1

Tokenizing UTF-8
by Roshan Naik 19 Oct '10

19 Oct '10

I was looking around to see if Boost has support for tokenizing UTF-8 strings. I don't see any mention of UTF-8 or Unicode in the Boost.Tokenizer documentation. If not Boost.Tokenizer . any other ideas ? I am also looking into ICU. Thanks. - Roshan

2 1

[fusion][mpl] Generating a fusion sequence type from an MPL sequence
by Gabriel Redner 19 Oct '10

19 Oct '10

Hi all, I am unexpectedly stuck looking for some functionality which I assumed would be present. Given an MPL sequence, I want to generate the type of a corresponding fusion sequence, which I can then use to store things: mpl::vector<int, string> mpl_vec; typedef some_metafunction<mpl_vec>::type fusion_vec; // equivalent to fusion::vector<int, string> fusion_vec vec(5, "foo"); Does some_metafunction exist? I'm not sure if I'm just not seeing it (or perhaps thinking wrongly about the problem), or if it really is not present. I was looking at the fusion/mpl bridge at [1], but its functionality seems orthogonal to what I want. Thanks, -Gabe [1] http://www.boost.org/doc/libs/1_44_0/libs/fusion/doc/html/fusion/adapted/mp…

2 1

[serialization] linker error with static build of serialization on Mingw gcc 4.4.0
by Philipp Münzel 18 Oct '10

18 Oct '10

Hi fellow users, I build boost 1.43 on windows, using mingw with gcc 4.4.0: Using built-in specs. Target: mingw32 Configured with: ../gcc-4.4.0/configure --enable-languages=c,ada,c++,fortran,java,objc,obj-c++ --disable-sjlj-exceptions --enable-shared --enable-libgcj --enable-libgomp --with-dwarf2 --disable-win32-registry --enable-libstdcxx-debug --enable-version-specific-runtime-libs --prefix=/mingw --with-gmp=/mingw/src/gmp/root --with-mpfr=/mingw/src/mpfr/root --build=mingw32 Thread model: win32 gcc version 4.4.0 (GCC) with the following command: bjam.exe install -q --layout=system --with-system --with-thread --with-python --with-serialization toolset=gcc variant=release link=static threading=multi runtime-link=static When I now build a shared library, itself linking statically the libboost_serialization.a, I get the following linker error: Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_iarchiveEEE12get_instanceEv: symbol not found Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_iarchiveEEE12is_destroyedEv: symbol not found Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_iarchiveEEE18get_const_instanceEv: symbol not found Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_iarchiveEEE20get_mutable_instanceEv: symbol not found Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_oarchiveEEE12get_instanceEv: symbol not found Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_oarchiveEEE12is_destroyedEv: symbol not found Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_oarchiveEEE18get_const_instanceEv: symbol not found Cannot export _ZN5boost13serialization9singletonINS_7archive6detail12_GLOBAL__N_ 13mapI24portable_binary_oarchiveEEE20get_mutable_instanceEv: symbol not found collect2: ld returned 1 exit status Am I missing some build step? Regards, Philipp

2 5

VS Debugging Filter [WAS: boost.foreach overhead]
by Dominique Devienne 18 Oct '10

18 Oct '10

On Sun, Oct 17, 2010 at 6:29 PM, OvermindDL1 <overminddl1(a)gmail.com> wrote: > On Sun, Oct 17, 2010 at 3:47 PM, Eric Niebler <eric(a)boostpro.com> wrote: >> What debugger do you use? Visual Studio doesn't give me this grief. > > Ditto, but even if it did I could setup a debugging filter in it to > ignore the extra steps in the VS debugger, can you not do that in GDB? Would someone be kind enough to provide pointers or expand on these debugging filters? I've used in the past a registry key to avoid stepping into some functions/methods. Is this it? Thanks, --DD

2 1

How to improve property_tree performance
by Bo Jensen 18 Oct '10

18 Oct '10

Hi, I have a fairly easy record structure which I am writing to xml using property_tree. I am trying to figure out how to do it better, since the current time spend building the tree is too high. I do the following : wiptree pt; wiptree &tvars = pt.add(L"some.recordname",L""); for( int i = 0; i < somenumber /*say 60K*/; ++i ) { wiptree &curtree = tvars.add(L"someitem",L""); curtree.add(L"<xmlattr>.name",L"some_attribute"); ... } To me this seems reasonable. Is there a faster way to do this ? Since I just want to write it out and it's quite simple, I could avoid using property_tree and write the xml file manually. But since I read it in later with property_tree, then for maintainability I would like to read and write with the same method. Thanks Bo

4 9

Re: [Boost-users] [serialization] can I serialize concrete types that are not acessible where the archive is created
by Massaro Alessio 18 Oct '10

18 Oct '10

I eventually managed to get everything to work nicely Just one essential bit that seems to be missing in the docuemntation...at least I missed it :-) **** Use the ***DLL version*** of boost serialization (#define BOOST_ALL_DYN_LINK or BOOST_SERIALIZATION_DYN_LINK in your build) Otherwise, afaict, every DLL gets a separate static extended type-info singleton container. **** And, to anwer my own question, the documentation does say explicitly that non-rtti and rtti implementations of extended type-info can coexist. Hopefully, this will help other newbies!

1 0

Set time boost::date_time
by Lloyd 18 Oct '10

18 Oct '10

Hi, How can I set the system time using boost? I have gone through boost date_time, but could not find a method to set the time. The time is in UTC. Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

1 0

[Test] Seeking advice for writing effective performance tests
by Bryce Lelbach 18 Oct '10

18 Oct '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 How do I write accurate, empirical and reproducible performance tests? I realize this is a very broad question, but my knowledge on this subject is lacking, so I'd appreciate a comprehensive answer (e.g. I'm not looking to benchmark a particular program/library, just looking for a strategy for designing good performance tests). I have read up on the subject, but I'm interested in what you guys (e.g. Boost users/developers) do. - -- Bryce Lelbach aka wash http://groups.google.com/group/ariel_devel -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAky4yvsACgkQO/fqqIuE2t4WFQCcDXQWdg2Dr4WXialrZWMnSnii 2PAAoK8BbHS42t6utnzjSWxlMWYKXh+O =qJFv -----END PGP SIGNATURE-----

2 3

[OT] Calling Overmind
by John Phillips 18 Oct '10

18 Oct '10

Overmind, Would you please contact either me (John Phillips) or Ron Garcia off list? Thanks. John

1 0

boost asio: repeated reading to delimiter
by Cattus Cerebrum 17 Oct '10

17 Oct '10

A very newbie question from a beginner user of boost::asio. I have used BSD socket interface a lot in the past, and would like to start using boost::asio for my networking code. I have a server that is providing data through a network socket. The data is a continuous stream of bytes, with different data elements separated from each other by a zero byte. Would reading into a streambuf with the help of async_read_until() be a good way of handling this situation? The code I am thinking of replacing uses select() to wait for arriving data, and then reads it into a circular buffer. Thanks.

1 0

Forward declarations and iterator_facade<>
by Phil Endecott 17 Oct '10

17 Oct '10

Dear Experts, I have code something like this: struct S; class iter: public boost::iterator_facade<iter,S,......> { ... }; struct S { ... }; This used to work, but stopped recently; I believe it may have been after upgrading gcc, not after upgrading Boost itself, but I'm uncertain about that. The problem is that something inside iterator_facade calls boost::is_POD<S>, which (not unreasonably) doesn't seem to work for the forward-declared S. I've never been entirely sure what you're allowed to do with forward-declared types like that. Was I just lucky that it worked before, or is this a regression? Re-ordering the code to remove the circular dependencies will be painful, so if anyone has any other hints I would love to hear them. Thanks, Phil.

3 3

link error on serialization demo.cpp
by jiryih.tsaur＠nomura.com 16 Oct '10

16 Oct '10

Tried to compile demo.cpp and getting link error below. Any suggestions? g++ -c -I. -I/usr/include -I/usr/include/c++/4.1.2 -I/usr/include/boost -I/home/jitsaur/usr/include -g -D_DEBUG -o demo.o demo.cpp g++ -I. -I/usr/include -I/usr/include/c++/4.1.2 -I/usr/include/boost -I/home/jitsaur/usr/include -g -D_DEBUG -o demo demo.o demo.o: In function `archive_exception': /home/jitsaur/usr/include/boost/archive/archive_exception.hpp:45: undefined reference to `vtable for boost::archive::archive_exception' ... PLEASE READ: This message is for the named person's use only. It may contain confidential, proprietary or legally privileged information. No confidentiality or privilege is waived or lost by any mistransmission. If you receive this message in error, please delete it and all copies from your system, destroy any hard copies and notify the sender. You must not, directly or indirectly, use, disclose, distribute, print, or copy any part of this message if you are not the intended recipient. Nomura Holding America Inc., Nomura Securities International, Inc, and their respective subsidiaries each reserve the right to monitor all e-mail communications through its networks. Any views expressed in this message are those of the individual sender, except where the message states otherwise and the sender is authorized to state the views of such entity. Unless otherwise stated, any pricing information in this message is indicative only, is subject to change and does not constitute an offer to deal at any price quoted. Any reference to the terms of executed transactions should be treated as preliminary only and subject to our formal written confirmation.

2 1

[CfP] 5th Annual BoostCon, Aspen (CO, USA), May 15-20, 2011
by Hartmut Kaiser 16 Oct '10

16 Oct '10

Please distribute. ------------------ 5TH ANNUAL BOOST CONFERENCE 2011 Aspen CO, USA, May 15 - 20, 2011, www.boostcon.com CALL FOR PARTICIPATION We invite you to submit session proposals to the 5th Annual Boost Conference: BoostCon 2011 (Aspen CO, USA, May 15 - 20, 2011). Traditionally the main face-to-face event for all things Boost (www.boost.org) BoostCon 2011 will present leading speakers from the whole C++ community. >From using the Boost libraries to writing and maintaining them, from evangelizing to deploying Boost within your organization, from infrastructure and process to vision and mission, and the new C++ Standard, BoostCon brings together the sessions, the colleagues, and the inspiration to support your work with C++ and Boost in particular for the next year. To reflect the breadth of the Boost community, the conference includes sessions aimed at three constituencies: Boost end-users, hard-core Boost library and tool developers, and academics focusing on researcher. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. SESSION TOPICS Topics of interest include, but are not restricted to, the following: * General tutorial sessions introducing one or more Boost libraries * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * C++0x and how it changes life for users and library writers * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to Boost users and developers Interactive and collaborative sessions are encouraged, as this is the nature of both the on-line Boost community and the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. SESSION FORMATS Presentations ------------- Presentations focus on a practitioner's ideas and experience with anything relevant to Boost and Boost users. Panels ------------- Panels feature three or four people presenting their ideas and experiences relating to Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials ------------- Tutorials are sessions at which instructors teach conference participants specific Boost-relevant skills. Workshops ------------- Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. SUBMITTING A PROPOSAL Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned 90 minute, three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). SUBMISSION DETAILS All submissions have to be done through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=boostcon2011. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the BoostCon website and will be available to attendees. For general information on the BoostCon 2011 paper submission or the scope of technical papers solicited, please refer to the conference website at www.boostcon.com. For any other questions about the submission process or paper format, please contact the Program Committee at boostcon2011(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to BoostCon. IMPORTANT DATES Proposal submissions due: December 10th, 2011. Proposals decisions sent (tentative program available): January 17th, 2011. Fully scheduled program available: February 7th, 2011. Session materials due: April 15th, 2011. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) David Abrahams, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

[Boost.MPI] question about serializing custom object
by Cristobal Navarro 16 Oct '10

16 Oct '10

hello everybody, this is first post i have some questions after reading the Boost documentation of serialization and MPI, is it possible to serialize my custom objects with Boost.serialize and then send/receive them using plain openMPI as MPI_BYTE type?? the other question is on the tutorials i only found examples of serializing objects to archive and saving to file, but i didnt find any example where they serialize it to a binary form and send them through mpi, is there any example of this type on the documentation? best regards Cristobal

7 54

[MPI, serialization] Segmentation fault in heterogeneous cluster
by Francesco Biscani 16 Oct '10

16 Oct '10

Hello, I'm getting a segfault when using Boost.MPI on a cluster of heterogeneous machines (x86_64 and ppc64). The problem arises when the "slave" machine, ppc64, receives its payload from the "master" machine, x86_64, and tries to unpack the archive. Tracing down the issue with valgrind and in debug mode, the problem arises here: ==28632== Invalid write of size 8 ==28632== at 0x10429DDC: boost::archive::detail::basic_iarchive_impl::load_pointer(boost::archive::detail::basic_iarchive&, void*&, boost::archive::detail::basic_pointer_iserializer const*, boost::archive::detail::basic_pointer_iserializer const* (*)(boost::serialization::extended_type_info const&)) (basic_iarchive.cpp:453) ==28632== by 0x1042772F: boost::archive::detail::basic_iarchive::load_pointer(void*&, boost::archive::detail::basic_pointer_iserializer const*, boost::archive::detail::basic_pointer_iserializer const* (*)(boost::serialization::extended_type_info const&)) (basic_iarchive.cpp:564) ==28632== by 0x10468707: void boost::archive::detail::load_pointer_type<boost::mpi::packed_iarchive>::invoke<pagmo::population*>(boost::mpi::packed_iarchive&, pagmo::population*&) (iserializer.hpp:518) ==28632== by 0x104683EF: void boost::archive::load<boost::mpi::packed_iarchive, pagmo::population*>(boost::mpi::packed_iarchive&, pagmo::population*&) (iserializer.hpp:586) ==28632== by 0x10468223: void boost::archive::detail::common_iarchive<boost::mpi::packed_iarchive>::load_override<pagmo::population*>(pagmo::population*&, int) (common_iarchive.hpp:68) ==28632== by 0x10468023: void boost::archive::basic_binary_iarchive<boost::mpi::packed_iarchive>::load_override<pagmo::population*>(pagmo::population*&, int) (basic_binary_iarchive.hpp:67) ==28632== by 0x10467E27: void boost::mpi::packed_iarchive::load_override<pagmo::population*>(pagmo::population*&, int, mpl_::bool_<false>) (packed_iarchive.hpp:98) ==28632== by 0x10467C27: void boost::mpi::packed_iarchive::load_override<pagmo::population*>(pagmo::population*&, int) (packed_iarchive.hpp:115) ==28632== by 0x1046798F: boost::mpi::packed_iarchive& boost::archive::detail::interface_iarchive<boost::mpi::packed_iarchive>::operator>><pagmo::population*>(pagmo::population*&) (interface_iarchive.hpp:60) ==28632== by 0x104676BB: void boost::serialization::nvp<pagmo::population*>::load<boost::mpi::packed_iarchive>(boost::mpi::packed_iarchive&, unsigned int) (nvp.hpp:87) ==28632== by 0x104674AF: void boost::serialization::access::member_load<boost::mpi::packed_iarchive, boost::serialization::nvp<pagmo::population*> >(boost::mpi::packed_iarchive&, boost::serialization::nvp<pagmo::population*>&, unsigned int) (access.hpp:101) ==28632== by 0x104672CF: boost::serialization::detail::member_loader<boost::mpi::packed_iarchive, boost::serialization::nvp<pagmo::population*> >::invoke(boost::mpi::packed_iarchive&, boost::serialization::nvp<pagmo::population*>&, unsigned int) (split_member.hpp:54) ==28632== Address 0x4b65d98 is not stack'd, malloc'd or (recently) free'd The issue is in the method basic_iarchive_impl::load_pointer, around line 450: int i = cid; cobject_id_vector[i].bpis_ptr = bpis_ptr; Indeed, a printf confirms that i == 512 while cobject_id_vector.size() == 3. This also provokes the assertion new_cid == cid to fail one line below (where new_cid == 2). The same code, run locally on the ppc64 acting both as slave and master with mpirun -np 2, runs ok. Boost version is 1.42.0, MPI implementation is openMPI 1.4.2. Can this be related to some endianness issue? Is Boost.MPI expected to work on heterogeneous clusters? Thanks, Francesco.

7 29

[serialization] check_object_versioning(), STATIC_ASSERTION_FAILURE
by Витя Истомин 15 Oct '10

15 Oct '10

Please help, or point me where should i read about it. What is this versioning and why my code was compiled with boost 1.39 will get compilation errors in 1.43? Code: #include <list> #include <boost/serialization/access.hpp> #include <boost/serialization/level.hpp> #include <boost/serialization/split_member.hpp> #include <boost/serialization/tracking.hpp> #include <boost/serialization/list.hpp> #include <boost/serialization/variant.hpp> #include <boost/serialization/version.hpp> ... typedef boost::variant <__int32, unsigned __int32, std::string, std::wstring > param_t; // note: I've tried to use boost::int32_t and others, result is the same typedef std::list< param_t > params_list_t; ... class instruction { public: ... private: friend class boost::serialization::access; /**< Make accessible private members for boost serialization */ void save (boost::archive::xml_oarchive& ar, unsigned int version) const; void load (boost::archive::xml_iarchive& ar, unsigned int version); BOOST_SERIALIZATION_SPLIT_MEMBER() private: ... params_list_t m_params; /**< List of parameters */ }; BOOST_CLASS_IMPLEMENTATION(instruction, boost::serialization::object_serializable); BOOST_CLASS_TRACKING(instruction, boost::serialization::track_never) BOOST_CLASS_IMPLEMENTATION(nvp<instruction>, boost::serialization::object_serializable) BOOST_CLASS_TRACKING(nvp<instruction>, boost::serialization::track_never) BOOST_CLASS_VERSION(instruction, 1); BOOST_CLASS_IMPLEMENTATION(param_t, boost::serialization::object_serializable); BOOST_CLASS_TRACKING(param_t, boost::serialization::track_never) BOOST_CLASS_IMPLEMENTATION(nvp<param_t>, boost::serialization::object_serializable) BOOST_CLASS_TRACKING(nvp<param_t>, boost::serialization::track_never) BOOST_CLASS_VERSION(param_t, 1) BOOST_CLASS_VERSION(params_list_t, 1) BOOST_CLASS_IMPLEMENTATION(nvp<params_list_t>, boost::serialization::object_serializable) BOOST_CLASS_TRACKING(nvp<params_list_t>, boost::serialization::track_never) BOOST_CLASS_IMPLEMENTATION(params_list_t, boost::serialization::object_serializable); BOOST_CLASS_TRACKING(params_list_t, boost::serialization::track_never) BOOST_CLASS_IMPLEMENTATION(nvp<instructions_list_t>, boost::serialization::object_serializable) BOOST_CLASS_TRACKING(nvp<instructions_list_t>, boost::serialization::track_never) BOOST_CLASS_IMPLEMENTATION(instructions_list_t, boost::serialization::object_serializable) BOOST_CLASS_TRACKING(instructions_list_t, boost::serialization::track_never) CPP file: void instruction::save (boost::archive::xml_oarchive& ar, unsigned int version) const { // ... ar << BOOST_SERIALIZATION_NVP(m_params); // error is here, all other lines commented // ... } Error (MS VS2008): 1>d:\Work\manager\third_party\boost\include\boost/archive/detail/check.hpp(78) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' 1> with 1> [ 1> x=false 1> ] 1> d:\Work\manager\third_party\boost\include\boost/archive/detail/oserializer.hpp(307) : see reference to function template instantiation 'void boost::archive::detail::check_object_versioning<T>(void)' being compiled 1> with 1> [ 1> T=const params_list_t 1> ] 1> d:\Work\manager\third_party\boost\include\boost/archive/detail/oserializer.hpp(525) : see reference to function template instantiation 'void boost::archive::detail::save_non_pointer_type<Archive>::invoke<const T>(Archive &,const T &)' being compiled 1> with 1> [ 1> Archive=boost::archive::xml_oarchive, 1> T=const params_list_t 1> ] 1> d:\Work\manager\third_party\boost\include\boost/archive/detail/common_oarchive.hpp(69) : see reference to function template instantiation 'void boost::archive::save<Archive,T>(Archive &,T &)' being compiled 1> with 1> [ 1> Archive=boost::archive::xml_oarchive, 1> T=const params_list_t 1> ] ... This is a first error message place: template<class T> inline void check_object_versioning(){ typedef BOOST_DEDUCED_TYPENAME mpl::or_< BOOST_DEDUCED_TYPENAME mpl::greater< serialization::implementation_level<T>, mpl::int_<serialization::object_serializable> >, BOOST_DEDUCED_TYPENAME mpl::equal_to< serialization::version<T>, mpl::int_<0> > > typex; // trap attempts to serialize with objects that don't // save class information in the archive with versioning. BOOST_STATIC_ASSERT(typex::value); } I have understanding about what is BOOST_STATIC_ASSERT, but I haven't any ideas about what I'm doing wrong. Changelog reading between 1.39 and 1.43 hasn't clarified anything. -- реклама ----------------------------------------------------------- Три новые линейки хостинг-планов - всё что нужно Вашему сайту! 6 месяцев хостинга бесплатно и домен в подарок. http://Hvosting.ua

1 0

[fusion] proposal BOOST_FUSION_ADAPT_FUNCTION, BOOST_FUSION_DEFINE_FUNCTION, etc
by alfC 15 Oct '10

15 Oct '10

Hi, I am using Boost.Fusion lately. Sometimes one has a function with several parameters, int f(double d , int i , std::string s){ ...bla bla ... } the logic of the program says that sometimes that same funcion will be called by generic code and in such case it is better if "f" where defined as taking a fusion::vector as argument. int f(fusion::vector<double, int, std::string>) // another function, could be an overload even since there is only one why to define this adaptor function, e.g. int f(fusion::vector<double, int, std::string> x){ return f(at_c<0>(x), at_c<1>(x), at_c<2>(x));\ } and it is pretty mechanical. I was wondering if it would be a good idea to have, with consistency with the BOOST_FUSION_ADAPT_STRUCT, something called BOOST_FUSION_ADAPT_FUNCTION BOOST_FUSION_ADAPT_FUNCTION( int, f, double, int, std::string ) (or something like that) that defines the second / fusion-compatible version of f. It could be even a BOOST_FUSION_DEFINE_FUNCTION( int, f, (double, d), (int, i), (std::string, s), ( ... code using variables d, i, s or at_key<d_>, at_key<i_>, at_key<s_> ... ) ) that defines simultaneously the raw-C function, f(double, int, string) *and* the fusion friendly version f(vector<...>). I could probably program these macro for specific cases but not a general one since I don't know enough macro syntax to make it work. Do you think it is a good idea or it is already doable with existing Fusion features? Thank you, Alfredo

2 6

[iostreams] changing char_type of bzip2_compressor
by Matthias Vallentin 15 Oct '10

15 Oct '10

I am having trouble with typedef'ing a custom bzip2_compressor that works with unsigned char instead of plain char. This is the pipeline: typedef boost::uint8_t uint8 typedef boost::iostreams::filtering_stream< boost::iostreams::input, uint8> filtering_istream; typedef boost::iostreams::filtering_stream< boost::iostreams::output, uint8> filtering_ostream; typedef boost::iostreams::basic_bzip2_compressor< std::allocator<uint8>> bzip2_compressor; // FIXME: The bzip2_compressor as defined above does not fit in // the pipeline, what is the correct way to typedef it? std::vector<uint8> raw; auto range = boost::make_iterator_range(start, end); // args of type uint8*. filtering_istream in(range); filtering_ostream out; -> out.push(bzip2_compressor()); out.push(boost::iostreams::back_inserter(raw)); boost::iostreams::copy(in, out); The line with the arrow causes the following errors below, presumable due to an incorrect typedef of the basic_bzip2_compressor. I could not find the correct way to typedef it by crawling through the bzip2.hpp header file of the iostreams library. Any ideas? I am using g++ 4.6 with -std=gnu++0x for C++0x support. Matthias Error subset: [..] ../boost/iostreams/chain.hpp:258: error: no matching function for call to 'std::list<boost::iostreams::detail::linked_streambuf<unsigned char, std::char_traits<unsigned char> >*, std::allocator<boost::iostreams::detail::linked_streambuf<unsigned char, std::char_traits<unsigned char> >*> >::push_back(std::auto_ptr<boost::iostreams::stream_buffer<boost::iostreams::basic_bzip2_compressor<std::allocator<unsigned char> >, std::char_traits<unsigned char>, std::allocator<unsigned char>, boost::iostreams::output> >::element_type*)' [..] /opt/local/include/gcc46/c++/bits/streambuf.tcc:89: error: invalid conversion from 'std::basic_streambuf<char, std::char_traits<unsigned char> >::char_type*' to '__gnu_cxx::char_traits<unsigned char>::char_type*' [-fpermissive] /opt/local/include/gcc46/c++/bits/char_traits.h:188: error: initializing argument 1 of 'static __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::copy(__gnu_cxx::char_traits<_CharT>::char_type*, const char_type*, std::size_t) [with _CharT = unsigned char, __gnu_cxx::char_traits<_CharT>::char_type = unsigned char, std::size_t = long unsigned int]' [-fpermissive] /opt/local/include/gcc46/c++/bits/streambuf.tcc:89: error: invalid conversion from 'const char_type*' to 'const char_type*' [-fpermissive] /opt/local/include/gcc46/c++/bits/char_traits.h:188: error: initializing argument 2 of 'static __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::copy(__gnu_cxx::char_traits<_CharT>::char_type*, const char_type*, std::size_t) [with _CharT = unsigned char, __gnu_cxx::char_traits<_CharT>::char_type = unsigned char, std::size_t = long unsigned int]' [-fpermissive] /opt/local/include/gcc46/c++/bits/streambuf.tcc: In member function 'std::streamsize std::basic_streambuf<_CharT, _Traits>::xsgetn(std::basic_streambuf<_CharT, _Traits>::char_type*, std::streamsize) [with _CharT = char, _Traits = std::char_traits<unsigned char>, std::streamsize = long int, std::basic_streambuf<_CharT, _Traits>::char_type = char]': [..] .._client.cc:170: instantiated from here /opt/local/include/gcc46/c++/bits/streambuf.tcc:55: error: invalid conversion from 'std::basic_streambuf<char, std::char_traits<unsigned char> >::char_type*' to '__gnu_cxx::char_traits<unsigned char>::char_type*' [-fpermissive] /opt/local/include/gcc46/c++/bits/char_traits.h:188: error: initializing argument 1 of 'static __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::copy(__gnu_cxx::char_traits<_CharT>::char_type*, const char_type*, std::size_t) [with _CharT = unsigned char, __gnu_cxx::char_traits<_CharT>::char_type = unsigned char, std::size_t = long unsigned int]' [-fpermissive] /opt/local/include/gcc46/c++/bits/streambuf.tcc:55: error: invalid conversion from 'std::basic_streambuf<char, std::char_traits<unsigned char> >::char_type*' to 'const char_type*' [-fpermissive] /opt/local/include/gcc46/c++/bits/char_traits.h:188: error: initializing argument 2 of 'static __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::copy(__gnu_cxx::char_traits<_CharT>::char_type*, const char_type*, std::size_t) [with _CharT = unsigned char, __gnu_cxx::char_traits<_CharT>::char_type = unsigned char, std::size_t = long unsigned int]' [-fpermissive]

1 0

math: combinations of i amongst n elements
by Hicham Mouline 15 Oct '10

15 Oct '10

Hi, Is there an available function to generate all the i-tuples among a sequence of size n (runtime) and 1<= i <=n For e.g. in a vector of 3 ints 1 2 and 3 we want to get all of the singletons: 1 2 3 all the pairs 1 2 1 3 2 3 and all the triplets 1 2 3 If not and I were to write one (n known at runtime only), what signature should I use? template <typename iterator> .... combinations(iterator begin, iterator end) { } what return type would hold all of the singletons, pairs, triplets, ... n-tuples Perhaps a better signature is template <typename iterator> .... combinations(iterator begin, iterator end, int i) { } but then the return type is still not easy to define. I'm thinking a 2D multi_array where not all the space is used (dim1 size is 2^n and dim2 size is n), and pass it by ref template <typename iterator> void combinations(multi_array& out, iterator begin, iterator end) { } regards,

3 2

Determine 32 vs 64 architecture
by Ryan McConnehey 15 Oct '10

15 Oct '10

Is there a library that lets me determine on what architecture my code is compiled? I needed to redefine a couple of typedef for fundamental types. Ryan

3 2

build failed for mpi on homogeneous platform
by Alain Miniussi 14 Oct '10

14 Oct '10

Hi, I am trying to build 1.44 on linux systems and the MPI component fails when I uncomment the #define BOOST_MPI_HOMOGENEOUS line in boost/mpi/config.hpp It is failing with both intel 11 and g++ compilers, here is the first error message for gcc 4.4.3: gcc.compile.c++ bin.v2/libs/mpi/build/gcc-4.4.3/release/threading-multi/broadcast.o In file included from ./boost/mpi/packed_iarchive.hpp:26, from ./boost/mpi/communicator.hpp:27, from ./boost/mpi/collectives.hpp:21, from ./boost/mpi/collectives_fwd.hpp:19, from ./boost/mpi/collectives/broadcast.hpp:11, from libs/mpi/src/broadcast.cpp:9: ./boost/mpi/detail/binary_buffer_iprimitive.hpp: In member function ‘void boost::mpi::binary_buffer_iprimitive::load(T&) [with T = boost::archive::version_type]’: ./boost/archive/detail/iserializer.hpp:107: instantiated from ‘static void boost::archive::load_access::load_primitive(Archive&, T&) [with Archive = boost::mpi::packed_iarchive, T = boost::archive::version_type]’ ./boost/archive/detail/iserializer.hpp:356: instantiated from ‘static void boost::archive::detail::load_non_pointer_type<Archive>::load_primitive::invoke(Archive&, T&) [with T = boost::archive::version_type, Archive = boost::mpi::packed_iarchive]’ ./boost/archive/detail/iserializer.hpp:433: instantiated from ‘static void boost::archive::detail::load_non_pointer_type<Archive>::invoke(Archive&, T&) [with T = boost::archive::version_type, Archive = boost::mpi::packed_iarchive]’ ./boost/archive/detail/iserializer.hpp:586: instantiated from ‘void boost::archive::load(Archive&, T&) [with Archive = boost::mpi::packed_iarchive, T = boost::archive::version_type]’ ./boost/archive/detail/common_iarchive.hpp:66: instantiated from ‘void boost::archive::detail::common_iarchive<Archive>::load_override(T&, int) [with T = boost::archive::version_type, Archive = boost::mpi::packed_iarchive]’ ./boost/mpi/packed_iarchive.hpp:101: instantiated from ‘void boost::mpi::packed_iarchive::load_override(T&, int, mpl_::false_) [with T = boost::archive::version_type]’ ./boost/mpi/packed_iarchive.hpp:118: instantiated from ‘void boost::mpi::packed_iarchive::load_override(T&, int) [with T = boost::archive::version_type]’ ./boost/archive/detail/interface_iarchive.hpp:60: instantiated from ‘Archive& boost::archive::detail::interface_iarchive<Archive>::operator>>(T&) [with T = boost::archive::version_type, Archive = boost::mpi::packed_iarchive]’ ./boost/archive/detail/common_iarchive.hpp:45: instantiated from ‘void boost::archive::detail::common_iarchive<Archive>::vload(boost::archive::version_type&) [with Archive = boost::mpi::packed_iarchive]’ libs/mpi/src/broadcast.cpp:151: instantiated from here ./boost/mpi/detail/binary_buffer_iprimitive.hpp:87: error: no matching function for call to ‘assertion_failed(mpl_::failed************ boost::serialization::is_bitwise_serializable<boost::archive::version_type>::************)’ ./boost/mpi/detail/binary_buffer_iprimitive.hpp: In member function ‘void boost::mpi::binary_buffer_iprimitive::load(T&) [with T = boost::archive::object_id_type]’: Regards, -- Alain Miniussi ---- mail: alain.miniussi(a)oca.eu SIT https://sitweb.oca.eu tel: +33 4 92 00 30 09 CRIMSON https://crimson.oca.eu web: http://www.oca.eu/alainm

2 1

[Pool] Problems using Boost.Pool with the Eigen matrix library
by lfrfly＠icqmail.com 14 Oct '10

14 Oct '10

Since Eigen matrices and vectors use SSE and therefore require a particular alignment, Eigen requires that when these types (specifically, the compile-time sized versions) are within a struct or class, that struct be given the EIGEN_MAKE_ALIGNED_OPERATOR_NEW macro. But here's the problem. What if that struct is allocated by a boost::pool_allocator<T>? Is there any way to enforce alignment then? I'm trying it and it just isn't working. I keep getting breakpoints hit inside of Eigen calls, presumably due to unaligned accesses. Has anyone investigated this, and are there any reasonable options? Perhaps a way to force the pool's start to be aligned, and a way to make sure the sizeof() my type as a whole is aligned? (But what about allocator conversion, eg, std::allocate_shared<T> may take an allocator<T> but it converts it internally to an allocator<somewrapper<T>>?)

2 1

bzip2_compressor help
by Bryan S 14 Oct '10

14 Oct '10

I know that I'm doing something stupid but it isn't obvious to me what. I'm trying to write a compressed file using: namespace BI = boost::iostreams; BI::filtering_ostream out; std::fstream mfile("test.gz", std::ios::binary|std::ios::out); out.push(BI::bzip2_compressor()); out.push(mfile); out << "This is a gz file" << endl; but when I do so, the file is always empty. Commenting out the push of the bzip2_compressor works like I'd expect. Any help for a newbie? Thanks B

2 1

Re: [Boost-users] [Boost.Spirit] Synthesised attributes and sub-rules
by Hartmut Kaiser 14 Oct '10

14 Oct '10

> On 14 October 2010 22:36, Hartmut Kaiser <hartmut.kaiser(a)gmail.com> wrote: > > That should be easy, see below. > > > > start = a_rule | b_rule | c_rule; > > > > qi::rule<Iterator, std::vector<int>()> a_rule; > > qi::rule<Iterator, std::vector<int>()> b_rule; > > qi::rule<Iterator, std::vector<int>()> c_rule; > > > I think I tried something like that, but it didn't work. Unless I'm > mistaken, each of those rules will create their own std::vector<int> > instance, so the values will not end up inserted into the vector specified > in the grammar parameter. No, it should work. The vector attribute is propagated to the alternatives, where it is filled. > I was able to eventually achieve my goal by specifying each of the rules > like so: > > qi::rule<Iterator, std::vector<int> &> a_rule; > > and in the main grammar I passed the _val into them. > > start = a_rule(_val) | b_rule(_val) | c_rule(_val) > > Then I referenced the arguments with _r1 in the sub-rules. > > Does that look correct? Is there a better way? That should work as well. This might be a tick better in terms of performance, even. But I'm guessing here, I have not done any measurements. Regards Hartmut --------------- http://boost-spirit.com

1 0

where is lexical_cast.hpp?
by alapex0310＠gmail.com 14 Oct '10

14 Oct '10

Hi, I want to use boost::lexical_cast but cannot find lexical_cast.hpp in the boost tree. I am using VS2008. Has it been moved somewhere? I am trying to use boost 1.44. Thanks a lot in advance, -Al

3 3

[fusion] memory layout of fusion::vector vs boost::tuple/boost::array
by alfC 14 Oct '10

14 Oct '10

Hi, I am trying to convert a boost::array into a fusion::vector. reinterpreting the memory from boost::array. It works for tuples but not fusion::vector, why is that. Is there a way to make it work? ( I was hoping that the memory layout is the same to make conversion from one to the other very easy.) #include <boost/fusion/container.hpp> #include <boost/fusion/include/container.hpp> #include<boost/array.hpp> #include<iostream> #include<boost/tuple/tuple.hpp> using std::clog; using std::endl; int main(){ boost::array<double, 3> ba={{1.0, 2.1, 3.2}}; clog << "ba: " << ba[0] << ", " << ba[1] << ", " << ba[2] << endl; using namespace boost::fusion; vector<double, double, double> bfv( reinterpret_cast<vector<double, double, double>&>(ba) ); //doesn't work as expected clog << "bfv: " << at_c<0>(bfv) << ", "<< at_c<1>(bfv) << ", " << at_c<2>(bfv) << endl; using boost::tuple; tuple<double, double, double> btt(reinterpret_cast<tuple<double, double, double>&>(ba) ); // works! clog << "btt: " << btt.get<0>() << ", "<< (btt).get<1>() << ", " << (btt).get<2>() << endl; return 0; } outputs: ba: 1, 2.1, 3.2 //original data bfv: -9.25597e+61, -2.35344e-185, 4.87507e-270 //not expected btt: 1, 2.1, 3.2 //works! Let me give some context, the reason I am doing this is that I need to interface fusion::vector of boost::quantities (all have the sizeof double) and adimensionalize the list of quantities into an array of doubles and vise-versa In reality, the final goal is to get this to work: boost::array<double, 3> ba={{1.0, 2.1, 3.2}}; vector<quantity<si::length>, quantity<si::time> , quantity<si::mass> > bfv( reinterpret_cast<vector<quantity<si::length>, quantity<si::time> , quantity<si::mass> >&>(ba) ); (or other generic option to go from array<double, N> to vector<quantity<T1>, quantity<T2>, ... quantity<TN> >) but since I can't make it work with simple 'doubles' I am asking why this could be done. Thank you again, Alfredo

9 20

Re: [Boost-users] [serialization] Deserialize by pointer withoutcalling new/constructor
by averigin 14 Oct '10

14 Oct '10

> It's not the most common scenario. It can be addressed, but requires > some more complete understanding of the library. The library "just works" > for the common cases. > > Think about why you have a base class pointer in your class which will > "never change". That is, if you recover it with out re-creating it, > you're > assuming that in the meantime the following statement has not been > executed. > > my_base_ptr = some_derived_ptr; > > That is, you're writing code on an assumption which you can't enforce. > If someday, in some other code module, far, far, away .. someone > executes the above, you'll have some unrecoverable mess to deal with > with no clear idea of what the source of the problem is. > > Sooo - my suggestion is to replace > > struct my_thing { > Base *m_ptr > ... > }; > > with > > struct my_thing > Base &m_b > ... > }; > > This will "just work" as far as serialization is concerned. > > Now if making the above change in your program is hard to do, you should > think about it a little bit more before you insert a booby trap into your > program. > Usually, this will entail some refactoring to get things back together > again. > But the result will be something more robust, less likely to contain bugs, > easier to test and aintain. Here's an attempt to further explain and (hopefully) clarify what's happening and why. 4 pieces of background to start, then I'll try to tie it all together. 1. In OMNeT, there are two main components to a simulation: Simple Modules, which have associated functionality (i.e., code), and Compound Modules, which are containers for simple modules and have no associated code. Note, for reference, the module types are termed cSimpleModule and cCompoundModule, both derived from cModule. All simple modules are derived from cSimpleModule and all compound modules are derived from cCompoundModule. 2. In a simulation it's possible to lookup another module (M_i) from the active module (M_a) and invoke methods on M_i. The lookup functions return a cModule pointer to M_i, which then must be dynamically cast to M_i's most-derived type to invoke its methods. However, that cast requires including M_i's header file in the code for M_a, which can result in ugly dependency trees. Thus, serializing by a looked-up cModule (base-class) pointer keeps things 'nice'. 3. When dynamically generating modules, they are created using a module factory which configures some internal state information which is not publicly accessible. Also, note that the factory method returns a cModule pointer. 4. When I run simulations, serialization and deserialization never occur during the same simulation; either the simulation starts fully configured and eventually serializes its state immediately before terminating, or it starts with a minimal skeleton and constructs the rest of the modules based upon a previously stored state. Now to put all the pieces together. When saving a simulation state, it's necessary to serialize a number of compound modules. So far, I've done this by adding a simple "archiver" module to them. I lookup the "archiver" module using the lookup functions and try to serialize the resulting cModule pointer. This causes the "archiver" module to save what information is publicly accessible (i.e., there is some internal state information it cannot access). When loading a saved state, the minimal skeleton includes one of the above mentioned "archiver" modules. It creates the input archive and then tries to create the other modules in the simulation. This is where I run into problems. What I wanted to do was have the "archiver" module create the other modules using their associated factories and then deserialize the rest of their state via the cModule pointers returned by the factories. This way the factory configures the module's private internal state information and the everything else is loaded from the archive, and this minimizes file dependencies (i.e., including header files for derived types). (I realize this isn't true (de)serialization, so I refer to it as partial-serialization.) However, this conflicts with the normal method for pointer deserialization, which would allocate memory for a new module, initialize it and then deserialize the information from the archive into that new object, which (in my case) is then promptly deleted or leaked. The only alternative I can see would be to dynamically cast the cModule pointers and directly call their serialize() or save()/load() methods directly. However, this seems like an ugly hack since that requires making the serialization methods public and including derived-class headers all over the place. Thus, I would like to stick with my partial-serialization method. I'm just not sure if it's possible to "easily" implement what I need for the loading portion. > > Of course if you're working in an environment whose controlling principle > is "just make it work right now", you're out of luck. You'll just have to > bury the bomb in your program and hope you're not in the immediate > vicinity when it blows up. > While I don't quite see it as a bomb, I know that probably just indicates short-sightedness on my part. Regardless, I am in the "just make it work right now" boat, so any help you can offer would be much appreciated. Regards, Adam Verigin P.S.: I did manage a temporary hack of archive/detail/iserializer.hpp pointer_iserializer::load_object_ptr() that (badly) assumed that if the passed pointer is not NULL, then it is a pointer to an allocated object so there's no need to create a new object. Coupled with a do-nothing load_construct_data() method this worked great for partial-deserialization, but causes memory corruption for normal deserialization since the assumption is not always true (nor is it a good assumption to try an force on other users).

1 1

[Smart Ptr] Why is weak_ptr a _ptr?
by Szymon Gatner 13 Oct '10

13 Oct '10

Hi, Is it just me or is it really the worse naming in whole boost library? It is nothing like any other smart pointer. No initialization / construction from raw pointer. No operator * or -> (the very least one would expect from _ptr class). No get(). And many more which I now forgot. My point is that is is not a pointer at all, not even a bit. It only happens to have a member variable returning one and that is hardly a reason to call type pointer-like. It should rather be called shared_tracker or shared_listener or something in that taste ;) Regards, Szymon

6 6

Proto domains shenanigans
by joel falcou 13 Oct '10

13 Oct '10

OK, I have a situation in which proto domain/subdomain could help me but i can't wrap my head around a proper solution. Here is the deal, i have various sub EDSL that goes like: - constants EDSL provides named consatnts (like zero_, one_, pi_ etc) that are meant to be terminal usable in any other EDSL en provide a type based way to know which constant is beging used and provide optimization in came it helps (e.g detecting x < zero_ in SIMD EDSL to replace with the SSSE3 corresponding fused operation) - a SIMD vector EDSL - various container based EDSL : table (multidim array), vector, matrix and tensor, polynom and rigid_transform. The rules I want to have is : - constant can mix with any other EDSL - SIMD don't mix with anybody - table mix with every other container and make them evaluates as table (e.g matrix * table == elementwise product and not matrix product) - vector, matrix, tensor can mix - polynom can mix with table but not with vector, matrix, tensor - rigid_transform van mix with table and matrix However i can't find any combination of domain definition that satisfy all. Is there some systematic methodologies to not fail at that ?

2 3