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

[date_time] POSIX time zones
by david.mcminn＠intelligentwellcontrols.com 28 Oct '10

28 Oct '10

Hi, I'm looking at using the Boost date_time library in an upcoming project and found a few inconsistencies when handling POSIX timezones. The date_time library seems to interpret the offset in a POSIX timezone string using the opposite sign as given in the standards. It also appears to use the DST offset as an offset from it's own local time, rather than the offset from UTC as specified in the standard. And obviously when calling to_string() will output the string with the incorrect values, even if you do fudge the values before creating the object. There was another query about this previously that went unanswered: http://lists.boost.org/boost-users/2009/11/53828.php Is there anyone maintaining the library, or somewhere to report bugs? Or is it just left as an exercise to the user to change? Thanks.

1 0

[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