- Boost - lists.preview.boost.org

Setting up a test suite
by Marshall Clow 28 Feb '10

28 Feb '10

I've got two implementations of the same functionality I want to compare with Boost.Test. One's in C++ (natch), the other in Python. Currently, they're packaged as tools that take a file as a parameter, and write results to stdout. Call them "dumpinfo.cpp" and "dumpinfo.py". How would I use Boost.Test to compare the output of these tools for a selection of sample tests? Conceptually, I would do: g++ -o dumpInfo dumpInfo.cpp ./dumpInfo testFile > /tmp/c.out python dumpInfo.py testFile > /tmp/py.out diff -q /tmp/c.out /tmp/py.out But how to do this using Boost.Test? Notes: * I have several (many) test files. It would be nice to list these files in a Jamfile. * There are a couple bugs in the Python packages I am using. I need to mark some of them as "expected failures" Thanks in advance! -- Marshall

1 0

[iostreams]mapped_file bug on Win32?
by Nelson, Erik - 2 28 Feb '10

28 Feb '10

Or maybe a feature? Or maybe I'm just using it incorrectly. I'm trying to create a new file of a certain size, regardless of whether or not a file of the same name exists. If I run a test program along the lines of boost::iostreams::mapped_file file; boost::iostreams::mapped_file_params p("test.txt"); p.new_file_size = 1201; p.length = 1; p.mode = ios_base::in | ios_base::out; file.open(p); It fails with the error 'failed setting file size: Cannot create a file when that file already exists.' if file 'test.txt' already exists. It seems to me that this error is a bug caused by incorrect error checking in mapped_file.cpp in function mapped_file_impl::open_file. At the call to CreateFileA, dwCreationDisposition=CREATE_ALWAYS and a valid handle value is returned. The Win32 docs say that in this case the call to CreateFileA has succeeded and the last-error code is set to ERROR_ALREADY_EXISTS. http://msdn.microsoft.com/en-us/library/aa363858%28VS.85%29.aspx Immediately after the call to CreateFileA, the handle is checked for validity but the last-error code is not reset. Shortly thereafter is a call to SetFilePointer. The docs say that the proper way to check for an error from SetFilePointer is to compare its return value to INVALID_SET_VALUE_POINTER. http://msdn.microsoft.com/en-us/library/aa365541%28VS.85%29.aspx This isn't done in the code... Instead, GetLastError() is called, which apparently returns the ERROR_ALREADY_EXISTS code generated by CreateFileA, which wasn't an error at all. It seems to me that a couple of things need to be changed to make this correct- 1) after the check for valid handle creation by CreateFileA, call SetLastError(NO_ERROR) 2) when resizing the file the code if (::GetLastError() != NO_ERROR || !::SetEndOfFile(handle_)) should be something like if (::SetFilePointer(handle_, sizelow, &sizehigh, FILE_BEGIN) == INVALID_SET_VALUE_POINTER || !::SetEndOfFile(handle_)) Does that make sense? Or am I just setting the mapped_file_params incorrectly to force creation of a new file? Erik

2 8

[ITL] Short remarks on the lastest 3 Reviews
by Joachim Faulhaber 28 Feb '10

28 Feb '10

Hi Barend, Vicente and Thomas, thank you for your efforts to synchronize the submission of your reviews as an attack on my Sunday evening =) First and foremost I'd like to thank Barend, who obviously did a really thorough investigation of the ITL, creatively testing own applications and going into the detail of the probably bewildering possibilities to use the generalized addition, subtraction and intersection operations on interval_maps. This was extremely important for me, because I realized how much those concepts and possibilities transcend the expectations of potential users. I have spent a lot of time investigating generalized operations on interval_maps and I am fairly sure that the definitions of their semantics based on axioms (laws) are pretty sound. I think that the usefulness and flexibility of the ITL that Barend discovered comes from that base. I have tried to describe all those semantical issues in the documentation. But obviously, due to limited time resources of readers, I am afraid that this has not been well received. Also I'd like to thank to Vicente and Thomas for their reviews and the included remarks. I am going to address all of your questions, problems and objections, but probably not at once, during the next days. Best Regards, Joachim

1 0

[date_time] monotonic_time() proposal
by Dmitry Goncharov 28 Feb '10

28 Feb '10

This proposal suggests adding monotonic_time() static member function to the boost::date_time::microsec_clock and second_clock classes. usage example: #include <unistd.h> // for sleep() #include <iostream> #include <boost/date_time/posix_time/posix_time.hpp> #include "monotonic_time.hpp" int main() { namespace pt = boost::posix_time; typedef ext::microsec_clock<pt::ptime> usclock_t; // namespace ext instead of boost::date_time pt::ptime now = usclock_t::monotonic_time(); sleep(1); pt::ptime later = usclock_t::monotonic_time(); std::cout << later - now << std::endl; } Prototype implementation can be found in the attachment. If there is interest i am willing to finish the implementation and documentation. BR, Dmitry

2 4

[chrono] v0.4 New thread_clock
by vicente.botet 28 Feb '10

28 Feb '10

Hi, I'm pleased to announce the version 0.4 of the Boost.Chrono library. The implementaton is stable, I don't plan to add more features before review. I'll concentrate in improving the documentation and the tests. I know that review managers are hard to find, so if you are interested in the library, please contact me or the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. New Features since v0.3.2: * Suspendible Clock concept + template class suspendible_clock<> * Added scope_suspend which do suspend/resume if the Clock is a model of Suspendible Clock concept, and nothing otherwise. * thread_clock support on platforms providing it natively. * Added support for wide character for stopwatch_reporter, stopclock, and stopclock_accumulator. * digital_time renamed t24_hours Perf * Added performances measures. Bug Fixes * Bug on timeval_demo. time_point t(duration(xtime(0))); // this was taken as a function declaration gettimeofday((timeval*)&t, 0); return t; time_point t(duration(xtime(0))); // this was taken as a function declaration gettimeofday((timeval*)&t, 0); return t; by timeval tv; gettimeofday(&tv, 0); xtime xt( tv.tv_sec, tv.tv_usec); return time_point(duration(xt)); * Bug on run_timer_test (add a global variable to avoid optimization that removes completely the code to be measured Best regards, _____________________ Vicente Juan Botet Escribá

1 0

[vault] Can you login?
by Lorenzo Caminiti 28 Feb '10

28 Feb '10

Hi all, Can you login into the Boost Vault? I get the errors below on my browser when I try to login. I tried logging in from Linux and Windows using Firefox, Chrome, and Explorer. Regards, Lorenzo Warning: fopen(/home/rene/boost.vault/var/users/lcaminiti) [function.fopen]: failed to open stream: Permission denied in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 616 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 617 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 618 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 619 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 620 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 621 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 622 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 623 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 624 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 625 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 626 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 628 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 629 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 630 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 631 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 632 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 633 Warning: fwrite(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 634 Warning: fclose(): supplied argument is not a valid stream resource in /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php on line 635 Warning: Cannot modify header information - headers already sent by (output started at /home/rene/boost.vault/phpATM-1.30-patched/include/functions.php:616) in /home/rene/boost.vault/phpATM-1.30-patched/login.php on line 395

3 3

[log] link problems with keywords::format
by Michael Caisse 28 Feb '10

28 Feb '10

Using msvc 8 I am having a link issue with the following code snippet. Commenting out the line with blog::keywords::format will cause the link error to go away. --------------------------------------------------- #include <iostream> #include <boost/log/attributes.hpp> #include <boost/log/common.hpp> #include <boost/log/core.hpp> #include <boost/log/exceptions.hpp> #include <boost/log/filters.hpp> #include <boost/log/formatters.hpp> #include <boost/log/sinks.hpp> #include <boost/log/trivial.hpp> #include <boost/log/utility/init/to_file.hpp> #include <boost/log/utility/init/common_attributes.hpp> namespace blog = boost::log ; int main() { blog::init_log_to_file( blog::keywords::file_name = "foo_%N.log", blog::keywords::rotation_size = 10 * 1024 * 1024, blog::keywords::format = "[%TimeStamp%]: %_%", blog::keywords::open_mode = std::ios_base::app ); BOOST_LOG_TRIVIAL(trace) << "A trace severity message"; return 0; } ------------------------------------------------------ main.obj : error LNK2019: unresolved external symbol "class boost::function2<void,class std::basic_ostream<char,struct std::char_traits<char> > &,class boost::log_mt_nt5::basic_record<char> const &> __cdecl boost::log_mt_nt5::parse_formatter<char>(char const *,char const *)" (??$parse_formatter@D@log_mt_nt5@boost@@YA?AV?$function2@XAAV?$basic_ostream@DU?$char_traits@D@std@@@std@@ABV?$basic_record@D@log_mt_nt5@boost@@@1@PBD0@Z) referenced in function "class boost::function2<void,class std::basic_ostream<char,struct std::char_traits<char> > &,class boost::log_mt_nt5::basic_record<char> const &> __cdecl boost::log_mt_nt5::parse_formatter<char>(char const *)" (??$parse_formatter@D@log_mt_nt5@boost@@YA?AV?$function2@XAAV?$basic_ostream@DU?$char_traits@D@std@@@std@@ABV?$basic_record@D@log_mt_nt5@boost@@@1@PBD@Z) bin\msvc-8.0\release\threading-multi\trivial.exe : fatal error LNK1120: 1 unresolved externals ------------------------------------------------------ Any ideas? michael -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

2 1

[move] one more dumb question
by DE 27 Feb '10

27 Feb '10

how do i make a function return an object by value and other object to, say, move assign from that returned object within current C++ std? i.e. my_type foo() {/*...*/} //... my_type a; a = foo(); //move assignment is intended here -- Pavel

3 7

[Review] ITL review planned to end tomorrow, February 28th
by Hartmut Kaiser 27 Feb '10

27 Feb '10

Hey all, We're almost at the planned end of Joachim Faulhabers ITL review (see the original review announcement here: http://comments.gmane.org/gmane.comp.lib.boost.announce/253) Now would be a good time to submit your reviews. If you need more time, please let me know. Regards Hartmut --------------- Meet me at BoostCon www.boostcon.com

1 0

[Filesystem V3] file_status over-design?
by Beman Dawes 27 Feb '10

27 Feb '10

Both Filesystem V2 and V3 status() functions return an object of class file_status. file_status is just a thin wrapper around a file_type enum: enum file_type { status_error, file_not_found, regular_file, directory_file, symlink_file, block_file, character_file, fifo_file, socket_file, type_unknown }; It was designed that way on the assumption that file_status would eventually include additional state information. But that never happened, so it looks like over-design my part. The fix would be to rename the enum as file_status, and remove the current class file_status entirely. That would break a certain amount of existing code, but I suspect the C++ committee would force such a change anyhow for TR2, so better to get it over with now. Comments? Opinions? --Beman

5 6

[function] improvements/proposals
by Domagoj Saric 27 Feb '10

27 Feb '10

A while back, in various threads more or less related to the topic, I posted various ideas and/or code contributions to the effect of improving boost::function in terms of efficiency (concentrated on invocation speed, assignement performance/overhead and reducing template and RTTI bloat) and configurability, however there was no "official response" as to whether it was any good, or whether any of it would be accepted or what's wrong with it if not. IMHO the results { - 'Speed': the test presented here http://marc.info/?l=boost&m=118835709647084&w=2 modified to work with boost::signals2 (because it is a header only library/does not require a recompilation of boost if something in boost::function changes) with the dummy mutex/no threading support and a simple recompilation with the new boost::function<> code yielded a ~10% boost, changing the default policy to be nothrow the boost doubled to ~20% - 'Size': my real life project, that uses heavy metaprograming for generating function objects (that as a consequence have _very_ long type names, and thus RTTI records) to assign to boost::functions shrunk by ~10% simply by using the modified boost::function (with RTTI features disabled)...This post http://lists.boost.org/Archives/boost/2009/12/160202.php has more detailed and updated results when my project grew further (with an even bigger difference) } show/hint that there is room for improvement in boost::function and therefor warrant atleast some kind of response (even if along the lines of 'it's no good' or 'there is no time for this now')...which is the reason for (re)posting this (in a separate thread). The relevant threads with more detail are these: http://thread.gmane.org/gmane.comp.lib.boost.devel/196906 http://thread.gmane.org/gmane.comp.lib.boost.devel/194514/focus=195351 since then I've moved the modified code from the vault into the sandbox SVN (under the obvious name "function" :) -- "That men do not learn very much from the lessons of history is the most important of all the lessons of history." Aldous Huxley

6 9

Re: [boost] [Review] ITL
by Wuttke Peter 27 Feb '10

27 Feb '10

To Begin with the most important point: YES, boost::ITL should be accepted as a boost library. (Please be don't be to disappointed of my english, for i'm a developer from Germany, and this would be my first review on Boost). The ITL (interval template library) is a very valueable part of our (the Cortex Software GmbH, incidently the company i work for) daily development routine. In our industry (which is health care) sampling of Status-Informations for collections of evaluations (in time) are an essential part of our work, so we are using the ITL-Library for some years with great success. (We have to aggregate Events based on equivalent properties, eg. same admission - which diagnosis, same discharge - which diagnosis, and so on. ) . As far as I know, there is really no alternative for using the ITL do work with Intervals - I've tried is with plain SQL, and, belive me: It's possible - but really no fun - no,no,no. (I've also seen Experiments trying to implement the ITL-Solution for specific problem-domains - they aren't usefull or elegant, either. Forget them.) Until now, we only used the library for intervals of datetimes (coded as integers), but i Im sure, that its usefullness goes far beyond. Concerning the overall architecture, I think, the actual version is more than complete, I'm especially impressed withn the idea of big, sparse bitsets implmenented by the ITL - it's cool. The documentation (using samples) is clear and completly comprehensive - couldn't hope for more. So, being not a specialist in template/generics programming (or in algebraic specification), I LIKE this Library - and use it.

2 1

[random] new documentation
by Steven Watanabe 26 Feb '10

26 Feb '10

AMDG This is hopefully the final version of the work I did back in November to convert the Random docs to Quickbook/Doxygen/Boostbook. I've uploaded the generated documentation to http://www.cs.hmc.edu/~swatanabe/random_doc/libs/random/doc/html/ The patch itself is rather large, even compressed, so I uploaded it to http://www.cs.hmc.edu/~swatanabe/random.patch.zip Okay to commit? In Christ, Steven Watanabe

9 19

[exception] virtual inheritance troubles
by Eric Niebler 26 Feb '10

26 Feb '10

In xpressive, I'm trying to follow the recommended use of Boost.Exception and use virtual inheritance in my exception class, regex_error. I'm also trying to hew as closely as possible to the standard, which says that regex_error should inherit from std::runtime_error. However, this simple use of Boost.Exception does not compile: #include <string> #include <exception> #include <boost/throw_exception.hpp> #include <boost/exception/exception.hpp> struct regex_error : virtual std::runtime_error , virtual boost::exception { explicit regex_error(std::string const& what) : std::runtime_error(what) {} }; int main() { boost::throw_exception(regex_error("what")); } On VC9, I get the following: > C:\boost\org\trunk\boost/exception/exception.hpp(400) : error C2512: 'std::runtime_error::runtime_error' : no appropriate default constructor available The trouble is that std::runtime_error does not have a default constructor, and that boost::throw_exception doesn't simply throw the exception passed to it; it throws an object of type of clone_impl<regex_error>. Because of the virtual inheritance, clone_impl needs to call std::runtime_error's directly, but it doesn't. It can't know to do that in general. What is the recommended practice here? <aside> It actually doesn't seem to be particularly useful in this case to use virtual inheritance because std::runtime_error inherits from std::exception non-virtually. In order to avoid the pitfall described here <http://tinyurl.com/yb2jpns>, it seems *ever* exception type in the hierarchy needs to use virtual inheritance, and that unfortunately is not the case for the standard exception hierarchy. </aside> -- Eric Niebler BoostPro Computing http://www.boostpro.com

4 6

[forward] looking for help to keep MSVC7.1 from ICEing
by Tobias Schwinger 26 Feb '10

26 Feb '10

Hello, I'm trying to make Forward release-ready and I'd really like to support MSVC 7.1 which is currently ICEing (in msc1.cpp, line 2701). According to online research that ICE typically occurs when the ODR is violated and the compiler fails to diagnose it. Although the code should be valid, it's likely to be about name management. The code uses an inheritance chain to add call operators of different arities. IOW the class template for arity N inherits from the class template for arity N-1. A 'using base::operator();' is used to pull in the base class' overloads. A stripped-down version of this pattern compiles. When I take out the 'using' declaration the ICE disappears (and so do the base class' overloads). Ideas anyone? Anyone keen enough to look into it? In case of the latter, I recommend the simpler of the two headers: trunk/boost/functional/lightweight_forward_adapter.hpp [ link to svn: http://tinyurl.com/ydoyoa4 ] Thanks, Tobias

1 0

Boost.Polygon : How to deal with per point attributes
by philippe.lamontagne.2＠ens.etsmtl.ca 26 Feb '10

26 Feb '10

Hi Boost community, I am currently experimenting with the BOOST polygon library and I have a few questions. Question 1: For my specific application the points inside the polygons need to contain attributes in addition to their x and y coordinates. This extra information is required in a per-point basis. I need to compute intersections and differences of polygons. The operations can be performed regardless on the attributes, but it's important that the attributes be present in the polygons resulting from the operations. Does BOOST provide a mechanism for keeping such per point attributes? I followed the example to make my own point and polygon classes work with BOOST, but for what I can see, the polygons operations are performed using GTL's own data types and transferred back to my types, loosing any attributes in the process. I am missing something here? Question 2: I noticed that if I have multiple points located on the same straight line only the initial and final points will be kept in the resulting polygon and that the intermediate points will be discarded. Whereas this behavior is probably preferable in the general case, it causes me a problem if I want to maintain point attributes because the attributes are not guaranteed to be the same all over the straight line. Is there a way to change this behavior? I'm aware that polygon operations may create new points. I can deal with a few empty attributes as long as original points keep their initial attributes. We hope there are some solutions or workarounds because I strongly appreciate the library. Thanks for the excellent work.

2 2

[Boost][Container] Non mandatory template parameter not defaulted
by Mathieu - 26 Feb '10

26 Feb '10

Hi, I was reading the boost.container vector sources, and I can't figure how this vector instantiations can work : boost::container::vector<int> foo; considering that the vector definition looks like : template <typename T, typename A> vector; As the second template parameter A has no default type, I believe it's actually mandatory but it's not the case as this : boost::container::vector<Type> compiles fine. I've been reading through the whole source file but I can't find where the trick is. if anyone can enlighten me? ps : sorry for my bad english..

2 2

[filesystem] 1.40 documentation refers to wrong API version?
by Johan Nilsson 26 Feb '10

26 Feb '10

Hi, the Boost.Filesystem documentation at e.g.: http://www.boost.org/doc/libs/1_40_0/libs/filesystem/doc/reference.html#Ope… seems to refer to more recent version. As a specific example, there are no overloads of remove in 1.40 that accepts an instance of boost::system::error_code (as opposed to what the documentation indicates) - easily verifiable in e.g.: http://svn.boost.org/svn/boost/tags/release/Boost_1_40_0/boost/filesystem/o… Is the actual 1.40 documentation available online somewhere? / Johan

1 0

Re: [boost] review system in place is extremely slow? (was Re: [rfc] rcpp)
by Brian Wood 26 Feb '10

26 Feb '10

Mathias Gaunard writes: >> Currently there are a lot of libraries to review, but no review managers. >> That means that the user community don't want to spend a little bit of >> their time to manage a review. >> >> In addition, the last review didn't had too much of reviewers >> (I'm also concerned by this point) > > So you can see, indeed, that this is fairly concerning. I think this may be due to economic changes. When Boost was getting started the economy was better than today. I think Boost should work on turning traffic on it's pages into advertising revenue. That money could be used to help those who want to be involved in the project. Giving a review manager $200 for 40+ hours of work only makes sense. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

5 4

Re: [boost] review system in place is extremely slow? (was Re: [rfc] rcpp)
by Brian Wood 25 Feb '10

25 Feb '10

On 02/25/2010 11:56 AM, Nevin Liber wrote: > Then comes the "which jobs do we pay for?". If a reviewer > spends 80 hours doing a detailed review, should we pay > them too? What about all the people who tirelessly work > on getting a release out the door every quarter? Why > should they work "for free" if other people are getting paid? I thought about some of these things as well.... I think release managers should be paid as well and more than review managers. For reviewers, I would set up a system that rewarded them also. The review manager might be expected to judge who has given the best and second best reviews. It would add a little excitement to the whole process... seeing who wins the gold and silver medals. > If we don't make enough money from web advertising, you > can't just not pay the review managers. Who will make up > the deficit? Etc., etc. > The way I'd do it is to make offers based on money already collected and not based on anticipated earnings. That way you commit some income to an individual and should be able to follow through and pay them. It might take a few months before you had enough saved to begin doing this. Advertisers love to reach niche audiences, especially audiences with above average incomes. This approach would be mixed with the current approach. If there was money to pay for a review manager it would be offered. If not you would just keep going hoping some generous soul volunteers. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

1 0

Fwd: [Boost-users] [Review] ITL review starts today, February 18th
by Joachim Faulhaber 25 Feb '10

25 Feb '10

Hi, this question of Mathias was posted in both [Boost-users] and [boost] but the answer was accidentally send to [Boost-users] only. ---------- Forwarded message ---------- From: Joachim Faulhaber <afojgo(a)googlemail.com> Date: 2010/2/23 Subject: Re: [Boost-users] [Review] ITL review starts today, February 18th To: boost-users(a)lists.boost.org 2010/2/23 Mathias Gaunard <mathias.gaunard(a)ens-lyon.org>: > Hartmut Kaiser wrote: > >> Interval containers allow to access and manipulate collections of >> intervals >> on an abstract level as sets and maps (of elements), but also to exploit >> segmental information that is given by the interval borders. Interval >> containers are fairly generic. They can be instantiated with discrete >> domain >> (or key) types like integral numeric types or boost::date or time types. >> But >> they also work with continuous domain types like double, rational or >> string. >> Using the latter allows to represent infinite sets and maps. >> >> The interface of the interval containers strives to be very intuitive and >> in >> line with the stl and other boost libraries. >> >> * The set theoretic operations union, difference, intersection >> and symmetric difference are available as operators for all >> interval containers and for many useful overloads between them. > > I have no knowledge of the problem domain (nor did I actually look at the > library yet, sorry about that), but I simply have a question: how does this > compare to geometry libraries or spatial indexes that provide that kind of > facilities for arbitrary dimensions? > > I certainly wouldn't want to force over-generalization to the authors, but I > am wondering how much is gained by limiting things to one dimension. So can this library survive in a field of power called boost of an ever abstracting ever generalizing and ever optimizing bunch of thinkers? A few points: * Geometry usually is based on a numeric coordinate type that comes with a distance measure. Many algorithms in geometry libraries rely on that. Intervals and interval containers of the ITL, similar to SortedAssociativeContainers, only require a strict weak ordering on their key type. So interval containers are less restricted and allow for a larger class of instantiations. You may for example want to work with interval sets of strings. * Interval containers implement interval combining styles that can be useful in providing and manipulating certain time grids. E.g. http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/ex… I'm not aware of something like that in geometry. * There are not only interval sets but also interval maps. itl::interval_map is the real workhorse in those real world applications that already exist. interval_maps provide a general idiom of aggregation of associated values. This idiom is very useful for computing statistical data through aggregation that occur in time. * Sometimes a more simple and basic class of data structures is advantageous. It may be simpler to implement optimizations. Like Lukes Manhattan integral polygons compared to more general GGL polygons. * Transfer of geometry knowledge to the more simple models of interval sets and maps may be a step users may not come up with. * The basic set and map concepts of the ITL allow for a variety of applications that may go beyond the scope of geometry. One such example is the self compressing large bitset, which not really has the look and feel of geometry ... http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/pr… ... or the example of a system of authorisations. See the example user_groups http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/boost_itl/ex… * Well known data structures from geometry like interval_tree or spatial indices do have different focuses and different applications. An interval_tree is more space efficient than an interval_map that can computes all overlaps at once. This may be desired if you need all of them. If you don't and you have reoccurring arbitrary stabbing queries interval_trees are the better choice. * itl::Maps are defining a generalized addition, which I think is a quite powerful feature that accounts for most of the goodies in the applications that we have done. This addition function is a generalisation of the common insert function on SortedAssociativeContainers and it introduces the aggregating properties of itl::Maps. The aggregate on overlap idiom is independent of the question, if the domain_type of the map or interval_map is a scalar or a tuple (has dimensions) or something else. There are already interesting applications of aggregations using itl::maps of tuples, but this exceeds the scope of the core library. Cheers, Joachim

1 0

[date_time] int64 overflow bug with subsecond duration
by Zachary Turner 25 Feb '10

25 Feb '10

Consider the following code, very simple in nature: static const boost::gregorian::date windows_epoch_base(1601, 1, 1); date_time d(windows_epoch_base, microseconds(12908391903991608)); This should resolve to sometime in early 2010 Now, the problem is that this number is already really big, not that many factors of 10 away from the int64 overflow boundary. microseconds() is really just the subsecond_duration<> template, and on my machine it's being parameterized as subsecond_duration<boost::posix_time::time_duration, 1000000>. The code for the constructor is as follows: explicit subsecond_duration(boost::int64_t ss) : base_duration(0,0,0, ss*traits_type::res_adjust() / frac_of_second) {} res_adjust is also resolving to 1000000. So compiler is doing 12908391903991608*res_adjust first, which causes an overflow. I think it should be doing ss * (traits_type::res_adjust() / frac_of_second) instead. I don't know a whole lot about date_time internals, so I thought I would ask here before just submitting a bug. Is the proposed fix correct? I made the change locally and it does indeed appear to resolve the problem. Zach

2 3

[move] will boost::rv work with types with virtual destructor?
by DE 25 Feb '10

25 Feb '10

sorry for a dumb question i noticed boost move lib mentioned in a recent message and decided to look at it i noticed that destructor for boost::rv class is declared but not defined so it can no longer be generated automatically then if an arbitrary type has a virtual destructor and we want to parameterize the boost::rv template with it a vtable for the boost::rv<type> must be generated among other things it must hold a pointer to rv<type>::~rv which is not defined is that really a problem? -- Pavel

2 2

Spirit V1.8 to V2.1 Porting Errors
by Alireza Bemanian 25 Feb '10

25 Feb '10

Hi, Trying to port the code to V2.1, a number of redefinition errors get generated by the compiler. The first instance is the extern InterLockedIncrement variable at line 73 of the interlocked.hpp file. The code is segmented for different platforms using #if #elif and so on directives. The project is at the same time ported from Visual Studio 2008 to 2010 RC1, and the redefinition error is caused by compiler not excluding parts of that file. The define by the Visual Studio is the _WIN32_WINNT base on the use of the 32 bit development PC. This definition is not listed by the #elif chain within the interlocked.hpp code and it seems that BOOST_USE_WINDOWS_H is used instead. Knowing the segments are coded to be mutually exclusive, still the code generates errors? Regards, Reza Bemanian

2 4

Re: [boost] is review system in place is extremely slow? (wasRe:[rfc] rcpp)
by Pete Bartlett 25 Feb '10

25 Feb '10

>From Robert Ramey > > to move those 3 libraries to the 'detail' namespace > > of Boost.Task and have review as it is, as opposed to waiting. What > > do you think? >I think I caught hell for doing something similar in the serialization >library. I had to make a number of components such as >BOOST_STRONGTYPEDEF, state_saver, smart_cast, etc. >which I put into boost - (not detail) and year afterwards this >was raised as a huge problem. And this was even though the >components had been their through two reviews. So I would >be careful about doing this. This seems a little more negative than I remember. If we are thinking of the same thread (see e.g. http://lists.boost.org/Archives/boost/2007/11/130567.php ) then a lot of the discussion was about headers directly in the boost root directory rather than a subdirectory, rather the issue at hand. My opinion is that there is no overarching programming design deity that is going to come down and smite us if we be a bit pragmatic. So what if Move [*], Fiber and Atomic get "smuggled" in if Task gets reviewed and accepted first? They don't have to be documented as accepted - on the contrary the documentation could have appropriate warnings as *not* formally accepted apart for indirect use via Task. >Another issue is: if Boost.Task depends upon Boost.Fiber >and Boost.Atomic, what happens if the Boost.Fiber or >Boost .Atomic are not approved? Sometimes the laudable goal of perfection turns open source projects into games of Nomic! Again, pragmatism should play a role here else Boost will never be the rich and full set of libraries that it fantastically could be. Pete [*] Move seems so core these days - another bit of pragmatism would see that fast-tracked through.

5 5

typeof or similar
by Steffen Roeber 25 Feb '10

25 Feb '10

Hi, I have 3 classes: 1. class Base { public: virtual Base *createDerived() { return 0; } }; 2. template <class T> class BaseT : public Base { public: virtual Base *createDerived() { return new DerivedT<T>(); //nicht smart, because DerivedT must be known } }; 3. template <class T> class DerivedT : public BaseT<T> { }; So far so good. Or not. But now the problems are starting. Base *base = new BaseT<int>; This object it created at a place that is not known where I want to create: Base *derived = base->createDerived(); //base is a Base * The result is an object that has the same template type as 'base'. Finally I got my desired result, but the problem is the relation downward relation between BaseT and DerivedT. My preferred way would be something like a factory: class Factory { public: template <class T> static Base *createDerived<T>() { return new DerivedT<T>(); } }; But how can I tell the factory which type to be used. Base *derived = Factory::createDerived<sameAsBase> (base); //base is a Base * I think there is no "normal" C++ language support. But Boost has some methods that by-pass some language constraints. I took a loot at something like 'typeof'. But I don't get the things together. Has anybody any idea? Or is it impossible to do this? Kind regards Steffen

4 3

phoenix docs hidden
by Neal Becker 25 Feb '10

25 Feb '10

In 1.42, there is no link at top level docs to phoenix. It's fairly hidden under spirit. Isn't phoenix intended to be used independently?

2 1

[phoenix] typo in docs
by Neal Becker 25 Feb '10

25 Feb '10

In algorithms doc: for_each(r, c) << Shouldn't that say 'foreach(r, f)' to match this: for_each(begin(r), end(r), f)

1 0

[fusion] make_unfused_generic broken
by Rutger ter Borg 25 Feb '10

25 Feb '10

Hello, apparently the header #include <boost/fusion/functional/generation/make_unfused_generic.hpp> got broken somewhere in the upgrade process, including it yields lots of errors. Boost version 1.42. (replaced with make_unfused?) Cheers, Rutger

2 1

Re: [boost] [msm] scalability
by Christophe Henry 25 Feb '10

25 Feb '10

>Sorry for the delay. That is awesome Christoffe! I've turned off /Gm for >all my projects and my state machine now compiles in the 6-sec range, >and Incredibuild is able to keep the entire compile farm running at >capacity. You shaved >30% off my full build times. Great :) In case your state machines grow bigger, you can also give a try with the "faster compile" policy which I will further improve after inclusion. I think we should make /Gm a forbidden option. I will of course write about it in MSM's doc but it would be interesting to see which libraries also profit from disabling this option and we could add the tip to their doc too. Christophe

1 0

Re: [boost] [Review] ITL review starts today, February 18th
by Jeff Flinn 25 Feb '10

25 Feb '10

Hartmut Kaiser wrote: > Hi all, > > The formal review of the Interval Template Library (ITL) starts today, > February 18th, 2010 and will end February 27th, 2010. ITL is being developed by Joachim Faulhaber. > > ------------------------------------------------ > > About the library: > > The Interval Template Library (ITL) is a library of interval containers that > facilitates computations on collections of intervals and associated values. ... Hmm, not much discussion yet. While this is not my review I'll make a few comments. I was able to port at least my necessary portions of split interval map to CodeWarrior 9.4 and was successful in using it to generate a column coverage graph of what is effectively the columns of possibly large sparse matrices. I would have expected the containers to be templated on an interval type, negating the need for run-time determination of boundtype. With the current design, a rather heavy interval is required with it's boundtype data member. My domain type is a simple int, an index into a row of a sparse matrix. Our in-house Interval class is always right_open, so there is only the need for a begin and end value leading to minimal memory usage. The current library design requires me to convert between ITL intervals and my own application's intervals. I'd have like to be able to provide a model of an interval concept that the ITL container would use. I wasn't able to find any description of the class invariants for interval. For example in our own Interval class the upper/end value must be greater than/equal to the lower/begin value which is a precondition to the constructor taking a pair of domain values. We do provide a static makeNormalized method to produce a proper interval when the order of the domain arguments is unknown, which is not very often in our usage so you don't pay that cost. In my case I hadn't the need for 'reversed' intervals, but I could see that being required for some use cases. Does ITL handle that? Along the same lines I've found little need for the mutators. An interval really only needs default and copy constructors, and one taking the upper and lower values. All mutations merely construct a new interval using calculated values and begin/end values from source intervals. Jeff

6 15

Review of Interval Template Library (ITL) for inclusion
by Eric Jonas 25 Feb '10

25 Feb '10

At the outset, I want to say that I enthusiastically support the inclusion of this library in Boost. I also encourage others without a specific application in mind to check out the library, as there are a lot of fun examples that you might later find useful in other coding projects. My Background -------------- My background: I develop combined hardware and software systems for recording from high-throughput neural systems. One of the primary challenges we face with such systems is the aggressive demands that 10 GB/hour of time-series data places on a typical workstation when you want to visualize it -- especially in real time, with appropriate historical context, at multiple zoom levels. I wrestled with this problem for a great deal of time before settling on various rendering and caching mechanisms. But the number one challenge was efficiently representing the temporal regions that had been viewed, those that had been rendered, and those that had been cached. Then I needed to propagate this state information through a complex dataflow pipeline. ITL solved this problem for me, in a way that honestly freed me from having to think about a lot of the unsavory low-level details. Specifics ------------ All of my work has been on Linux with a modern (4.3+) gcc. I have had collaborators build and use the resulting artifacts on OS X. I originally only anticipated needing interval_sets, but interval_maps became extremely useful as I started to keep track of metadata in my timing epochs. The segregation of interval_* and split_interval_*, while not necessary for my application, provides historical context that I can imagine being useful in some scenarios. What is your evaluation of the documentation? --------------------------------------------- I'd say the documentation was "Boost-quality", but some might see that as pejorative :) The tutorial had me up and running quickly, and the extensive examples helped me map my ideas to the library's primitives. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? ------------------------------------------------------------------- I have used this library in production code that I have shipped to users, and have been working with it for several months. What is your evaluation of the potential usefulness of the library? ------------------------------------------------------------------- For my applications, it was crucial -- they would have been far less optimal (both from a software-engineering and asymptotic perspective) without ITL. The examples showcase a wider range of potential applications, especially the use of an example "Project" as a more complex example. Are you knowledgeable about the problem domain? ------------------------------------------------ As a consumer of many boost libraries for many years, from the simple (shared_tr) to more esoteric (variant) to completely crazy (fusion), I feel like I have a good sense of modern C++ API aesthetic. As someone who spends a great deal (too much) of his life working with time-series data structures, I am familiar with many of the underlying algorithms and data-structures. ...Eric Jonas Eric Jonas (jonas(a)mit.edu) PhD Candidate, MIT Brain and Cognitive Sciences

2 1

[math] long double autoconfiguration
by Vladimir Prus 24 Feb '10

24 Feb '10

Hi, at present, Boost.Math library always tries to compile long long versions of the function, unless explicit --disable-long-long is passed by the user. I have just checked in a patch that attempt to automatically determine if long long is available. Attached is a sample output of "bjam --with-math" build. The detection is done by compiling new file named libs/math/src/long_double_check.cpp -- if it compiles, it is assumed long double works. Unfortunately, I don't really know what kind of long double support Boost.Math needs. John, Paul, could either of you add some more content to that file? This change an SVN version of bjam as of today. If you use an older version, nothing should break, but no auto-detection will be performed. Also, if you need to look at compiler messages produced when compiling the test file, look at bin.v2/config.log Thanks, -- Vladimir Prus http://vladimir_prus.blogspot.com Boost.Build: http://boost.org/boost-build2 Building the Boost C++ Libraries. Configuration checks summary - long double support : yes Component configuration: - date_time : not building - filesystem : not building - graph : not building - graph_parallel : not building - iostreams : not building - math : building - mpi : not building - program_options : not building - python : not building - regex : not building - serialization : not building - signals : not building - system : not building - test : not building - thread : not building - wave : not building ...patience... ...found 1584 targets... The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: /home/ghost/Work/Boost/boost-svn The following directory should be added to linker library paths: /home/ghost/Work/Boost/boost-svn/stage/lib

4 5

virtual function templates
by strasser＠uni-bremen.de 24 Feb '10

24 Feb '10

Hi, is there interest in a boost utility to implement (pseudo-) virtual function templates? real virtual function templates are obviously not possible without a JIT-compiler, but if all derived types are known to the base type, something like the following is. I've used a non-generic form of this a couple of times: struct base : enable_vtemplate<derived1,derived2>{ template<class OutputIterator> void f(OutputIterator it){ BOOST_VTEMPLATE(f,(OutputIterator),(it)); it << "not overridden\n"; } BOOST_SUPPORT_VTEMPLATE(); }; struct derived1 : base{ template<class OutputIterator> void f(OutputIterator it){ it << "derived1\n"; } BOOST_SUPPORT_VTEMPLATE(); }; struct derived2 : base{ template<class OutputIterator> void f(OutputIterator it){ it << "derived2\n"; } BOOST_SUPPORT_VTEMPLATE(); }; the runtime overhead besides the virtual call is one switch().

6 9

shortest path between vertex A and B
by Alexandre de Morais Amory 24 Feb '10

24 Feb '10

Hi, I am starting to use BGL. I manage to read/write in dot format, add few attribs, etc. my next task is to get the set of vertex in the shortest path between vertex A and B. In a graph like this: a - b b - c c - d assuming 'a' and 'c', the result would be {a,b,c}. I know it sounds silly, but most similar examples I could find are much more complex than this. I guess breadth_first_search would solve the problem, but I am having trouble with the visitor concept... how to implement a visitor to get the set of vertex in the path between two points. Other features of the problem: I am assuming an undirected graph. all edges have unitary distances. If there are multiple shortest paths between A and B, any of the valid solutions can be returned. thanks in advance for any clue ! Regards, Alexandre Amory

2 1

[thread] compile errors on Sandia-intel-10.1/11.0/11.1
by Emil Dotchevski 23 Feb '10

23 Feb '10

The error below is detected building a couple of Boost Exception tests that use Boost Thread. Thanks Noel and Steven for helping diagnose the problem. "/opt/intel/Compiler/11.1/067/bin/intel64/icpc" -xc++ -w1 -O0 -g -inline-level=0 -vec-report0 -DBOOST_ALL_NO_LIB=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_POSIX -I".." -c -o "/Volumes/Scratch/kbelco/boost/results/boost/bin.v2/libs/thread/build/intel-darwin-11.1/debug/link-static/threading-multi/pthread/thread.o" "../libs/thread/src/pthread/thread.cpp" ../libs/thread/src/pthread/thread.cpp(385): error: identifier "get_nprocs" is undefined return get_nprocs(); ^ Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

1 0

[Regex & ICU] boost::regex & icu compilation warnings: missing #pragma pack(pop)
by Henry Tan 23 Feb '10

23 Feb '10

Wondering if this is a known issue and there is a solution to fix this build warning when you are compiling boost::regex with ICU library. >warnings in directory d:\ >d:\boost_1_41\boost\regex\v4\u32regex_iterator.hpp(25) : warning C4103: 'd:\boost_1_41\boost\regex\v4\u32regex_iterator.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) >d:\boost_1_41\boost\regex\v4\u32regex_iterator.hpp(187) : warning C4103: 'd:\boost_1_41\boost\regex\v4\u32regex_iterator.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) >d:\boost_1_41\boost\regex\v4\u32regex_token_iterator.hpp(38) : warning C4103: 'd:\boost_1_41\boost\regex\v4\u32regex_token_iterator.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) >d:\boost_1_41\boost\regex\v4\u32regex_token_iterator.hpp(368) : warning C4103: 'd:\boost_1_41\boost\regex\v4\u32regex_token_iterator.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) Cheers, HT

2 1

[exception] help needed diagnosing Sandia-intel-10.1/11.0/11.1 failures
by Emil Dotchevski 23 Feb '10

23 Feb '10

See the following logs, which seem identical, and it isn't clear to me what's wrong: http://tinyurl.com/yzjo8v4 http://tinyurl.com/ygooqj7 http://tinyurl.com/yjp3n68 Ideas? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

4 3

[thread][config] VC10RC fails compiling when using thread library (BOOST_NO_RVALUE_REFERENCES)
by Hartmut Kaiser 23 Feb '10

23 Feb '10

Hey all, the new 'un-definition' of BOOST_NO_RVALUE_REFERENCES for VC10 breaks compilation of code using the thread library. Is it a problem of VC10 or the thread library? Regards Hartmut --------------- Meet me at BoostCon www.boostcon.com

7 16

Re: [boost] Boost Graph library - r_c_shortest_paths
by Andrew Sutton 23 Feb '10

23 Feb '10

> I checked the files I sent you and they were the correct versions (all > three code files: the test file, the example file, and > r_c_shortest_paths.hpp). The test and example files both run without any > problems on my system (WIN XP 32 SP 3, MS Visual C++ 2008). > I've finally had some time to go through the resubmission. There are/were a number of issues that need to be addressed. First, property maps, functors, and visitors are virtually always passed by value. If those objects need to maintain complex state between calls, it's typically done by building a functor (visitor, etc) that has a reference to an external state object. I fixed this. Second, I removed the ks_smart_ptr class, which turned out to be not very smart. It only wrapped the pointer, but didn't manage it in any way. I also cleaned up some of the allocation/deallocation code by moving the calls to two new functions create and destroy. Inidentally, valgrind shows that this implementation leaks memory. I put cout's in create and destroy to count allocations and deletions (16646 allocs to 15994 deallocs). My guess is that one of the rarer code paths in the dispatch doesn't actually delete. This needs to be investigated. Third... just a style point... some of the identifiers are a little long. I think the readability could be improved by shortening them. Fourth, and I'm hoping to get Jeremiah's input on this... I'm not a fan of passing vector<vector<>>& or vector<>& as top-level parameters. It might be better to require a template parameter that is essentially a matrix- or vector-like object. That would simplify the call interface and allow a little more freedom w.r.t. parameter types. Thoughts? Fifth... and Final... The interface to the algorithm is changing which can break backwards compatibility. Maybe we need to give the new module a different name. Thoughts? Here's a tarball with the code ready to be dropped into Boost. You should refer to this version since its what I'm going to be merging. http://www.cs.kent.edu/~asutton/rcsp.tar.bz2 Andrew Sutton andrew.n.sutton(a)gmail.com

2 5

Re: [boost] [msm] scalability
by Christophe Henry 22 Feb '10

22 Feb '10

David Abrahams wrote: > The idea would be to do all parts that are “hard on the compiler” > at runtime. I don't see why you should have to sacrifice features. I promised to make an analysis of which feature costs how much compile-time and test your point. I hope to bring a beginning of an answer and hope you will enjoy the trip to VC++ world ;-) I took the iPod example from the last BoostCon and compile it with VC8 and VC9 in Debug and Release. I think it is an interesting example: submachines, orthogonal regions, a good number of states. I also took the MPLLimitTest example (80 transitions, 80 states) to check a wide state machine not factored into any submachines. Both can be found in the sandbox in libs/msm/doc (/iPod or directly for the MPLLimitTest). So, the results: VC9 (Release): 60s VC9(Debug): 79s VC8(Release): 64s VC8(Debug): 183s (!!!) Notice how debug takes so much longer, as rightly noticed by Jeff. Part1: we now move the submachines into different headers, simply included in the main application. Should change nothing, right? First small surprise, it helps VC8 in Debug: VC9 (Release): 65s VC9(Debug): 80s VC8(Release): 68s VC8(Debug): 166s I didn't see why Debug took so much longer, so I played a bit with the compiler options until I found the culprit. If we now deactivate the /Gm option ("Enable minimal rebuild") in Debug (not activated in Release), we now see a big difference: VC9(Debug): 58s VC8(Debug): 62s Waow! 20s better for VC9, 102 for VC8. This could explain Jeff's problems. This is what I call a successful optimization from the compiler to create a minimal rebuild. Now Debug builds are faster than Release (due to shorter link time if you ask). Part2: This is nice but we did not add any new policy for faster compiling yet. I now add one. Unfortunately, reducing the number of template instantiations proved to be a hard business as most of removed instantiations which were "hard on the compiler" were still done somewhere else and VC is clever enough not to repeat itself. On the MPLLimitTest it gives: Before: VC9(Release): 134s VC9(Debug): 135s (without /Gm. Otherwise count 275!) VC8(Release): crash :( (ok this is really a hard test) VC8(Debug): I stopped after the compiler used up 3,5GB of my 4GB... after: VC9(Release): 84s VC9(Debug): 84s VC8(Release): crash :( VC8(Debug): 153s Ok better. It can be also better for the iPod example as the policy allows you to move some of the metaprogramming for submachines to other TUs and compile with 3 cores (one fsm, 2 submachines) using /MP (available on VC8 and VC9). See in the doc the example in iPod/Part2. We now have the following compile time (using 3 cores): VC9(Release): 44s VC9(Debug): 37s VC8(Release): 50s VC8(Debug):40s This looks much better as it allows the clever user to build submachines and enjoy better compile times. For cases where performance is needed, simply omit the submachines' cpp files from build. The trick works using a boost::any to contain the event, thus allowing you to avoid instantiating a process_event inside the main machine process_event. The only feature you lose with this policy is the new possibility to make a derived event fire his basis event's transition (any can recognize only strict types). So this is the current state. But it can be better. We still pay for the instantiation of submachines into the main machine, which still costs you time. I made a test using a proxy for submachines. The proxy containing only a void* to the real submachine, instantiating it is cheap. It's not finished but we now build on 5 cores (the main fsm, 2 for each submachine, 2 submachines). Yes we can now build a submachine on 2 cores :) This gives us the possible future compile-time: VC9(Release): 34s VC9(Debug): 27s VC8(Release): 40s VC8(Debug):30s I hope this will make the compile-time problem more manageable. Again, more to come on this later. Jeff, if you could give it a try, it would be really great! Christophe PS: I am using a Q6600, 4 cores, 2.4GHz, no hyperthreading. We can soon use the new hexacore with hyperthreading :)

2 1

[geometry] Documentation prototype for review
by Mateusz Loskot 22 Feb '10

22 Feb '10

Hi, I'm working on documentation of Boost Geometry based on Quickbook and I've prepared a prototype: http://mateusz.loskot.net/tmp/ggl/qbk/ What I'm doing is manually porting the content from Doxygen-based (http://geometrylibrary.geodan.nl/) plus restructuring, reformatting and completing it with missing details. I'd like to ask everyone who is interested in Boost Geometry library for comments, impressions and suggestions of improvements. Note, nodes marked with (?) are not finished and empty, but included to give impression about the overall structure. I'd be especially interested comments about the structure, if it's accessible to new users and usable for advanced users at the same time. The Reference is one of the most important section I'd like to master, so please share your comments on the form and completeness of the concepts specification, for example: http://mateusz.loskot.net/tmp/ggl/qbk/geometry/reference/geometries/concept… types description, for example: http://mateusz.loskot.net/tmp/ggl/qbk/geometry/reference/geometries/types/p… and functions description: http://mateusz.loskot.net/tmp/ggl/qbk/geometry/reference/arithmetic/add_poi… Thanks in advance for your feedback. Best regards, -- Mateusz Loskot, http://mateusz.loskot.net Charter Member of OSGeo, http://osgeo.org

3 4

[build] summary at end
by Vladimir Prus 22 Feb '10

22 Feb '10

FYI, Previously, I've made the build process to print information as to where the headers and libraries are to be found. However, that was printed at the start of the build, and many used missed that. I've now checked in a patch to print the message at the end of the build (if there are no errors). You need trunk bjam for this to work. Older bjam will not print that message but otherwise work. The sample wording is as follows: The Boost C++ Libraries were successfully built! The following directory should be added to compiler include paths: /home/ghost/Work/Boost/boost-svn The following directory should be added to linker library paths: /home/ghost/Work/Boost/boost-svn/stage/lib Comments are appreciated, -- Vladimir Prus http://vladimir_prus.blogspot.com Boost.Build: http://boost.org/boost-build2

1 0

[exception][msvc-7.1] regression and use of member template friends
by JOAQUIN M. LOPEZ MUÑOZ 22 Feb '10

22 Feb '10

Hi, In its current state in trunk, boost/exception/exception.hpp is generating regressions with MSVC 7.1 as shown in: http://tinyurl.com/yckdxrc The problem has to do with some (correct) member template friends declarations that MSVC 7.1 is not able to handle. Lines 222 and ff. of boost/exception/exception.hpp read: #if defined(__MWERKS__) && __MWERKS__<=0x3207 public: #else private: template <class E> friend E const & exception_detail::set_info( E const &, throw_function const & ); [...] To solve the problem the nicest solution would be to replace this by: #if defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) public: #else private: template <class E> friend E const & exception_detail::set_info( E const &, throw_function const & ); [...] But exception.hpp, presumably to speed up compilation times, does not include any other header, so seems like including <boost/config.hpp> just to get this macro could be unacceptable. If this is the case, I suggest that the code be changed so as to simply go public and omit the member template friend declarations altogether. Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Status of Boost.Polygon
by Anders Dalvander 22 Feb '10

22 Feb '10

According to the announcement (http://comments.gmane.org/gmane.comp.lib.boost.announce/240) Boost.Polygon library was accepted into Boost on 5 November, provided some of the most critical concerns are addressed first. I cannot find it in the 1.42 release of Boost. When can I expect it to exist in a Boost release? Regards, Anders Dalvander

2 1

[getting started] mention boost.build options for abi tages
by Vladimir Prus 21 Feb '10

21 Feb '10

Often, users are asking how they can get "boost_whatever... mt-s ...", or something like that. The attached patch augments with ABI tags table in the getting started guide with corresponding Boost.Build options. Note that I have more suggested changed (in particular to say that naming on Unix is now different), but wanted to split into individual patches for easier review. I've also dropped stlport iostream option, since it's deprecated and in my understanding nobody uses it any longer. OK to commit? Thanks, -- Vladimir Prus http://vladimir_prus.blogspot.com Boost.Build: http://boost.org/boost-build2

2 1

sp_convertible<> on MSVC10
by Zachary Turner 20 Feb '10

20 Feb '10

I'm using 1.42, not trunk, so I don't know if this has already been addressed, but sp_convertible fails with some errors for me. 2>C:\dev\boost\1.42.0\boost/smart_ptr/detail/sp_convertible.hpp(49): error C2070: 'void': illegal sizeof operand 2> C:\dev\boost\1.42.0\boost/smart_ptr/detail/sp_convertible.hpp(68) : see reference to class template instantiation 'boost::detail::sp_convertible<Y,T>' being compiled 2> with 2> [ 2> Y=error_info_tag_t, 2> T=boost::exception_detail::error_info_base 2> ] 2> C:\dev\boost\1.42.0\boost/exception/info.hpp(159) : see reference to class template instantiation 'boost::detail::sp_enable_if_convertible<Y,T>' being compiled 2> with 2> [ 2> Y=error_info_tag_t, 2> T=boost::exception_detail::error_info_base 2> ] 2> C:\dev\boost\1.42.0\boost/exception/detail/exception_ptr.hpp(170) : see reference to function template instantiation 'const E &boost::operator <<<boost::unknown_exception,boost::tag_original_exception_type,const type_info*>(const E &,const boost::error_info<Tag,T> &)' being compiled 2> with 2> [ 2> E=boost::unknown_exception, 2> Tag=boost::tag_original_exception_type, 2> T=const type_info * 2> ] 2> C:\dev\boost\1.42.0\boost/exception/detail/exception_ptr.hpp(137) : see reference to function template instantiation 'void boost::unknown_exception::add_original_type<std::exception>(const E &)' being compiled 2> with 2> [ 2> E=std::exception 2> ] 2>C:\dev\boost\1.42.0\boost/exception/info.hpp(159): error C2664: 'boost::exception_detail::error_info_container::set' : cannot convert parameter 1 from 'boost::shared_ptr<T>' to 'const boost::shared_ptr<T> &' 2> with 2> [ 2> T=error_info_tag_t 2> ] 2> and 2> [ 2> T=boost::exception_detail::error_info_base 2> ] 2> Reason: cannot convert from 'boost::shared_ptr<T>' to 'const boost::shared_ptr<T>' 2> with 2> [ 2> T=error_info_tag_t 2> ] 2> and 2> [ 2> T=boost::exception_detail::error_info_base 2> ] 2> No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called The line it's pointing to is this: enum _vt { value = sizeof( f( static_cast<Y*>(0) ) ) == sizeof(yes) }; and in particular it's having a problem determining the return type of f( static_cast<Y*>(0) ). It's thinking that whatever overload it's finding for f() here returns type void. Which doesn't make sense neither one returns void. Any ideas? Zach

5 8

Re: [boost] [contract] Contract Programming Library
by Andrzej Krzemienski 20 Feb '10

20 Feb '10

> > The documentation lists the following sequence for executing a constructor: > > > > 1. Initialize member variables via the constructor member > > initialization list (if such a list is specified). > > 2. Check preconditions (but not invariants). > > 3. Execute constructor body. > > 4. Check invariants. > > 5. Check postconditions. > > > > I believe, one of the reasons for validating arguments of a constuctor > > is to not allow the incorrect values to initialize objest's > > sub-objects (members). I believe the sequence of the first two items > > should be inverse. Am I wrong? > The library follows Eiffel semantics for constructor which is {Default > AND Pre}Body{Post AND Inv} where Default is default initialization of > members (similar to C++ member initialization list). That said, it > would be difficult to implement a different semantics (like the one > you suggest) in C++ because of the lack of delegating constructors. The sole fact that other language implements it this way is not sufficient an argument. I can think of the situation when "Eiffel order" may cause damage that the inverse order might have prevented: Type::Type( int & counter ) precondition{ counter < MAX; } : handle( irreversibleChange(int--) ) { ; } Suppose the constructor of Type is called, and the value of counter is MAX. This value is invalid, but by the time the precondition is checked, the irreversibleChange is executed, and the value of counter is reduced, so the assertion concludes that everything is fine. Now, the argument that it is difficult to implement is convincing; it may be that it is impossible at all. But I would call not having the {Pre->Init} order a limitation of the library. Let me be clear: one tiny limitation in the great library, because out of many attempts to provide contract programming to C++ I have seen, this is the only one that really looks good. Regards, &rzej

2 1

[mpi] Documentation patch
by Number Cruncher 19 Feb '10

19 Feb '10

Attached is a patch (against 1.42) to fix a couple of minor errors with the Doxygen documentation for some headers in the boost/mpi library. The errors relate to Doxygen usage, not content. Simon.

1 0

Re: [boost] [contract] Contract Programming Library
by Andrzej Krzemienski 19 Feb '10

19 Feb '10

Hi, two other questions that came to my mind, regarding the library design. (1) Sometimes the assertions execute longer than the function itself. For example: iterator find( iterator begin, iterator end, value v ) precondition { is_sorted( begin, end ); } { return find_sorted( begin, end, v ); } find_sorted has logarithmic complexity, whereas is_sorted has linear one. If I use function find like this: sort( begin, end ); process( find(begin, end, A) ); // call is_sorted process( find(begin, end, B) ); // call is_sorted process( find(begin, end, C) ); // call is_sorted is_sorted is called many a time. Even if I am in debugging mode but use a medium size range, the performance can kill me. I would like to disable checking of this assertion, but at the same time there is no reason to disable others. Would you consider providing a way to selectively disable asserts? some assertion level? (2). Usually public member functions would be used to express DbC assertions. Do you disable assertions in public functions that are called only to evaluate other assertions in order to avoid recursive calls? Regards, &rzej

2 1

Re: [boost] [contract] Contract Programming Library
by Andrzej Krzemienski 19 Feb '10

19 Feb '10

> I am thinking to submit a library for Contract Programming (a.k.a. > Design By Contract (TM) ) for C++. > I have drafted some of the library documentation in Boost-like format: > http://dbcpp.sourceforge.net/boost/libs/contract/doc/html/ > Comments? Hi, I have a couple of questions/suggestions regarding the documentation of the library. (1) Does it execute postconditions when the function body ends with a thrown exception? Obviously it shouldn't. I can see one lie saying It is possible to describe the function postconditions. These are logical conditions that programmers expect to be true when the function has ended **normally**. So I guess it doesn't, but I believe this fact deserves some more room in the documentation, like "public member function is not required to satisfy the postcondition if it ends with exception." (2) Obviously, the expressions in assertions shouldn't change the behaviour of the program when executed. This requirement is stronger than having no side effects. You protect the object itself by allowing only const member functions. Are the function arguments (those passed by mutable reference also protected?). Is it allowed/recommended to refer to global or static data in the assertions? If you are using clever macros, perhaps there is a way to block the references to these. In C++0x lambdas you can specify a list of objects you want to refer to: [this, &max_value, &count, &cache]( int fact1, int fact2 ) {...} perhaps there is a way to do it with current C++ macros. (3) In a similar manner, what happens if one of postcondition's assertions throws an exception? I have troubles answering this question myself (I do not know what should ideally happen), but whatever your answer is, I believe it should be clearly documented. (Note that this is not only the issue of DbC; simple C-assertions also leave this question unanswered). (4) Do the assertions have access to objet's private/protected interfaces? (I believe they shouldn't). (5) Does the library allow defining preand postconditions for "free" functions or static member functions? The examples are so focused on objects/classes that I cannot tell the answer. (6) Similarly, does the library allow defining block invariants? (7) The documentation lists the following sequence for executing a constructor: 1. Initialize member variables via the constructor member initialization list (if such a list is specified). 2. Check preconditions (but not invariants). 3. Execute constructor body. 4. Check invariants. 5. Check postconditions. I believe, one of the reasons for validating arguments of a constuctor is to not allow the incorrect values to initialize objest's sub-objects (members). I believe the sequence of the first two items should be inverse. Am I wrong? (8) Since library usses macros that make the syntax a bit difficult to read/parse, perhaps it would be useful to augment every example with another one that would say how the same thing would be acomplished with fictitious "DbC C++" syntax if we had one. This was done for Boost Interface library (under construction, http://www.cdiggins.com/bil.html) and I think it helps a lot. Regards, &rzej

2 1

[type_traits] is_class not detecting C++0X lambda on Intel 11.1/Windows?
by Jesse Perla 19 Feb '10

19 Feb '10

The boost version of is_class doesn't seem to be compatible with lambdas in my target compiler. Am I missing something? Any patches/fixes you can think of? Sadly, I can't just use the tr1 version since this is being used internally within a boost library (boost::parameter in my case). BOOST_AUTO_TEST_CASE( test_is_class ) { auto f = [](double x){return x;}; // static_assert(boost::is_class<decltype(f)>::value, "Failure"); //Compiler failure line 81 of boost/type_traits/is_class.hpp static_assert(std::tr1::is_class<decltype(f)>::value, "Failure"); //Works using the built in tr1 for the compiler }

1 0

Formal review request: static size matrix/vector linear algebra library (Boost) LA
by Emil Dotchevski 18 Feb '10

18 Feb '10

Documentation and source code complete with comprehensive tests, released under the Boost Software License is available here: http://www.revergestudios.com/boost-la/ Thanks, Emil Dotchevski

18 50

[preprocessor]
by Баграт Асатрян 18 Feb '10

18 Feb '10

Hello. boost.preprocessor library is good, but it does not support in-place preprocessor metafunction composition and argument bindings. I have just implemented such a functionallity as in boost.mpl, and can say that it simplifies preprocessor metaprogramming greatly. If interested, contact me. С уважением, Баграт Асатрян. ---------------------------------------------- Тел.: +(374 94) 69-78-67, E-mail: bagrat_assatrian(a)mail.ru

6 10

[thread] Ticket #3748 ignored for boost-1.42?
by Oliver Kowalke 18 Feb '10

18 Feb '10

As I see the patch for the bug (is it?) was not applied for version 1.42. does somebody know why? Oliver

3 2

boost::property_tree is seriously outdated/incomplete
by Philippe Vaucher 18 Feb '10

18 Feb '10

Hello, Basically boost::property_tree documention is incomplete and outdated. There is simply no documentation on what a "Translator" is, only by digging the source you are able to understand it can be used to convert fetched values before returning them. Same goes for "stream_translator", still no idea what it's useful for. What's worse is that the documentation contains WRONG ways of doings things, like it says to change the default '.' separator one should use: pt.get<float>('/', "p.a.t.h/t.o/v.a.l.u.e"); But this is actually done like this: pt.get<float>(boost::property_tree::ptree::path_type("p.a.t.h/t.o/v.a.l.u.e", '/')); Then there are all the quickbook formatting bugs there and there, I made a ticket summing all I've found here https://svn.boost.org/trac/boost/ticket/3925 I hope someone will look after this because boost::property_tree has a great potential and it's a shame the documentation discourages people from using it. There's also obvious changes that ought to happen like being able to get the parent of a ptree node. My 0.02$ Philippe

3 6

Proposal for new variants of the Boost logo.
by Paul A. Bristow 18 Feb '10

18 Feb '10

After many discussions on the thread "Boost logo variants for use in unofficial or unreleased boost documentation" that many will have tired of, a few with more stamina have agreed the following proposal for wider agreement. Proposal for new variants of the Boost logo. =============================== There are many projects springing up, often with smart documentation using the Boost Logo, and there are many more products, for sale and for free, that use Boost libraries. Many are concerned at the 'Dilution of the Brand Identity': so we propose two new variant logos: 1 For projects that are written with Boost 'in mind', perhaps for submission, but are *not yet reviewed and accepted*. "For use with" - logo for projects having some association with Boost, but are *not 'official'*. (Many like red text to signal strongly that this is NOT (perhaps yet) a Boost approved library). 2 For projects that *use* Boost, and would like to acknowledge this - with thanks: "Powered by" - logo for all projects *using* Boost. (in addition to the 'Using Boost' listing on the website) To see the proposed logos: http://dbp-consulting.com/boostvariantslogo.html (produced by Patrick Hogan). (These logos will be available in bitmap, png and svg formats ready to be used in html and pdf docs). Paul PS Some were also in favour of a "Proposed for Boost" logo to be used only *for libraries in the review queue*, but not yet in a final release. Others felt this was unnecessary. So unless there is strong support for this, it does not form part of this proposal. --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

18 66

"Software Development using the C++ Boost Library", book in preparatiion Options
by Jesse Perla 17 Feb '10

17 Feb '10

Daniel: As a caveat, I am far from an expert. just a library user focused on scientific computing in economics... but here are a few more comments that I hope the experts can correct. > 2. type erasure: I looked this term up but it seems as if it is similar to interface/device independent/ programming. In the past we built homemade Function and used it in combination with OO specialisation with virtual functions, Now boost Function is so much > better. Mathematicians and engineers are used to functions and we adopt the same approach (e.g. using namespaces) boost::function certainly beats any home-spun solution. But type erasure is a way to bridge generic programming to give a common *runtime* interface. I think of it as akin to getting the benefits of dynamic polymorphism with arbitrary generic types - effectively creating a virtual function without inheritance. However, just as with dynamic polymorphism it is not without cost: The boost::function infrastructure puts in a dispatch which could drastically hurt performance if called in an inner loop (or have virtually no effect if the function itself is time consuming). The compiler can't inline the functions, etc. Also, the term "type erasure" should be taken literally. The functions which operate on the boost::function are not able to get any information on the type. For example, a common way to deal with a function and derivatives is to have a single function object with an operator() and a gradient() defined. But if you stuff this in a boost::function you lose the information and can only call a specific overload/template of operator(). You can see some old, stupid questions I had asked on this mailing list a while back about this topic: http://lists.boost.org/boost-users/2009/01/44253.php What I learned eventually was that I was trying to use type erasure when I didn't need it, and I was better off sticking with generic programming... So boost::function is very useful, but you run into the same tradeoffs and questions as static vs. dynamic polymorphism: If you don't need dynamic polymorphism, then consider sticking with compile time templates, etc. for better performance and genericity at the potential cost of code complexity. In the case of scientific computing, I find that almost everything is known at compile time and you are better off keeping the types generic/not using type erasure. If you are just using boost::function because the types of the function objects are complicated, consider the alternatives. See my comments in the previous post on the use of "auto" and "decltype" to make this manageable. > 3. Ideally, we would like TR1 and boost to be as seamless as possible. Check out: http://www.boost.org/doc/libs/1_42_0/doc/html/boost_tr1.html Just remember that boost::tr1 is intended to be used only if the vendor hasn't put in a tr1 library. > 4. Fusion: I think this is useful, especially with Any? While I have never used "any", I believe these are two different ways to deal with the problem. Using something like std::vector<boost::any> is another example of type erasure (just as std::vector<boost::function<double (double)> > would be). boost::fusion allows you to have a tuple-like vector of different types, but while retaining type information. The same types of tradeoffs apply as before... and fusion is only usable if you know the types at design-time. If you end up converting some of your code away from boost::function, you may need something like this. On the other hand, it can be pretty advanced so be careful... std::tr1::tuple is enough unless you need to apply an operation on the vector of types. For example, I have often had the case where I had a vector of functions I needed to evaluate. I was unable to use boost::function since I needed genericity so I had a boost::fusion::vector with the various function types. Then to evaluate the functions at the same point, I used a fusion::for_each, transform, or fold depending on what I was trying to do. Note that this should have very high performance: The fusion::for_each ends up doing something akin to loop unrolling at compiletime, and since I didn't lose any type information everything could be inlined. > 7. Numerical integration: I saw this extensive library in Vault. What is the status? These don't seem to be in active development. I have used http://www.coin-or.org/CppAD/ myself. When using AD you will find it extremely difficult to use boost::function because the function stops being generic when the type is removed (play with these libraries and you will understand quickly). This is a perfect example of why you should be wary of removing type information if you don't need to. I think that Robert is correct that you should make sure you study and work with type erasure/generic programming before writing those chapters, especially if you are intended this to be used for numeric computing. Efficiency is critical for these applications and dynamic polymorphism is often unnecessary. And don't be fooled by the name boost::function: Its primary purpose is to bridge dynamic polymorphism for generic callable types, and not to be a placeholder for mathematical functions. While using it can sometimes simplify code (when auto/decltype are not available), the cost should be considered. boost::phoenix, lambda, and bind do not erase type information and I believe all overhead of function adaptation could be optimized away with these. While a lot of the Template Metaprogramming book was beyond my needs, I found careful study essential reading(especially Chapter 9 which covers these topics) .... and that about exhausts my knowledge. Good luck with the book!

2 1

"Software Development using the C++ Boost Library", book in preparatiion
by Jesse Perla 17 Feb '10

17 Feb '10

Looks great to me. A few comments: ---------- Forwarded message ---------- From: "Daniel J. Duffy" <ddu...(a)datasim.nl> Date: Feb 15, 12:55 am Subject: "Software Development using the C++ Boost Library", book in preparatiion To: Boost Developers Archive > 1. Higher Order Functions I used to use boost::function a lot, but now find myself using templated classes with deduction of the function type instead and haven't used boost::function for a long time . I think when writing this section, it would be nice to have a good sense of when type erasure using boost::function is necessary. I found that the main reason I was using boost::function was not type erasure but rather that the types of the functions I was storing were complicated so it was easier to stuff in a boost::function and then have an easier way to reference the type. After I started using auto, decltype, and make_ functions, this became unnecessary. Of course, you can't count on people having "declype" or "auto", so my proposal would be to see if BOOST_AUTO, etc. should be suggested as a temporary solution for people without C++0X turned on. One other thing worth thinking about here is whether you should plan for standardizing on the tr1 namespace(and explain how to use boost::tr1). This might future proof the book as most mainstream compilers seem to have tr1 already. That said, I had a lot of problem with the tr1 library that comes with the Microsoft compiler mixing boost functional programming libraries and tr1::function/bind, so you might want to try things out before going down this route. > 6. Utilities and other Libraries I would love to see a short section on Fusion. I have found Fusion very useful and a good alternative to using type erasure for my applications. Of course, the numerical computing I do has almost everything known at compile time which may distort my view. Also consider type_traits and enable_if, and a minimalist use of MPL to support managing overloads (mpl::and, not, if, etc.). (a huge part of the superb C++ Template Metaprogramming book is about advanced features like iterators or your own sequences, which isn't necessary for most users)

3 4

define for 32/64 bitness?
by Oliver Kowalke 17 Feb '10

17 Feb '10

Does boost provide an preprocessor define telling if the boost lib is build for 32 or 64 bit? I need this info for the second parameter of posix_memalign(). regards, Oliver

5 7

"Software Development using the C++ Boost Library", book in preparatiion
by Daniel J. Duffy 17 Feb '10

17 Feb '10

Hello, We would like to announce news on our new book in preparation that is based on the Boost library. Below is a description of what the book is about and its focus. We discuss several applications such as computational finance, simulation, maths, engineering as well as examples for a wider audience. The book is pitched at intermediate level and upwards. We would be very interested in receiving feedback from Boost authors (and those who are workinng with the library) concerning the chapters in the book, especially the extensive functionality in the library and possibly examples from areas not discussed above. best regards and thank you! Daniel J. Duffy Robert Demming // Book Proposal "Software Development using the C++ Boost Library" Daniel J. Duffy (dduffy(a)datasim.nl) Robert Demming Datasim Education BV February 2010 Publisher: Datasim Press Ltd. Web site: http://www.datasimfinancial.com/ <http://www.datasimfinancial.com/> What is this book? This book introduces and elaborates the C++ boost library and applies it to creating code and applications for a range of domains such as engineering, computational finance, mathematical physics and other exact disciplines. We have written the book in such a way that the learning process is as seamless as possible; first, for each library we introduces its main features by discussing its syntax and by giving '101' examples to show to use it as quickly as possible. Second, we introduce some of the more advanced features in each library with a view to using and customizing them to suit application needs. Finally, we create small and medium-sized applications and test cases by integrating several libraries to show the usefulness and applicability of boost to support complex software systems. The book is structured into seven major categories, each one of which dealing one particular aspect of software development and its applications. For whom is this Book? We have tried to write the book in such a way that it is accessible to as wide a group of developers as possible (an impossible task!) by the appropriate use of examples at each level of developer expertise and test cases that are of direct relevance in a number of application areas. We assume that the reader has several years of experience of object-oriented and template programming in C++. Application Development using Boost Regarding the test cases and applications we try to model them in such a way that the reader understand the problem and design intent before we discuss the actual coding. To this end, we consider the use of UML class and component diagrams (in the appropriate dosage!) to be essential. In one sense, "UML is C++ in pictures". Some applications that we discuss in the book are: Using Lambda to simplify use of STL algorithms Using Signals to implement, MVC, Observer and PAC patterns (GOF, POSA) Using Bind and Function to semi-discretise partial differential equations (PDE) Random for Monte Carlo simulation, numerical integration and option pricing Any and data-independent parameter passing between modules Interval arithmetic and explicit modelling of numerical imprecision Various text-processing applications Compile-time arrays and matrices using Array Using multi_array to model n-dimensional PDEs uBLAS as data structures for numerical algebra Statistical functions and their applications Accumulators and time series applications Using Flyweight as default in applications Multi-threaded scientific applications Network programming and Asio Mapping GOF patterns to boost (i.e. using boost to implement design blueprints) /// Categories of Libraries 1. Higher Order Functions Function Bind Lambda Signals/Signals2 2. Data Types Any Integer Interval Parameter Rational Smart Pointer Tribool Tuple Variant 3. Text and String Processing Regex String Algo Tokenizer Xpressive 4. Data Structures and Searching Array Date Time Graph Multi-Array Multi-Index 5. Mathematics and Statistics Accumulators Math Common Factor Math/Special Functions Math/Statistical Distributions Random uBLAS 6. Utilities and other Libraries Conversion Dynamic Bitset Filesystem Flyweight Lexical Cast Numeric Conversion Program Options Test 7. Multithreading and Networking Asio Statechart Thread Timer Yours sincerely and thank you Daniel Duffy, PhD Ing. Robert Demming

9 14

Re: [boost] [contract] Contract Programming Library
by Andrzej Krzemienski 17 Feb '10

17 Feb '10

> > it is inevitable, etc., but.. read on. I know at least one library in > > Boost that also spoils function declarations in order to provide > > additional functionality: Concept Check library; they may be others > > too (MPL?). > > My suggestion is that if there are (or will be) libraries that require > > spoiling function declarations, they should all provide the same > > "spoiled" syntax. Otherwise I will be always asking "how do I declare > > a function in this library?". It would be very convenient if Boost > > provided one alternative function definition syntax that when used > > would enable all its libraries to work. > > I agree. However, in the past I did look into harmonizing my library > API with the ones of Boost.ConceptCheck and/or Boost.Parameter but it > did not seem feasible... I will double check it. This is not only about clarity. As a super-correct programmer I may want to apply both concept checking and pre-/post-conditions checking to my functions. Perhaps, if the 'compromise' syntax is possible, it requires changing concept-checking library. Regards, &rzej

1 0

[variadic_templates][mpl]interest in compile time matrix multiplication?
by Larry Evans 17 Feb '10

17 Feb '10

For example, with: > ***domain_matrix: > ( 11 12 13 ) > ( 21 22 23 ) the following: > typedef > outer_product_pack > < plus_times_row_column<arg<1>,arg<2> > > >::apply > < domain_matrix > , domain_matrix > >::type > outer_plus_times_rows_rows; > > std::cout<<"***outer_plus_times_rows_rows:\n"; > for_each<outer_plus_times_rows_rows>(printer); produces: > ***outer_plus_times_rows_rows: > ( 434 794 ) > ( 794 1454 ) The plus and times operations can be replaced with any compile-time binary operation. Any interest? -regards, Larry

4 4

[Boost][gsoc]Intrest - big integer library
by Kamil Witecki 17 Feb '10

17 Feb '10

Hello all, I'd like to propose new library for boost - a Big Integer library. Boost has plenty of applications build upon it and some of them has to use integers greater that those ensured by C++ standard. What is more some of them needs even Pythonlike "unbounded" integers. What I am proposing is library implementing cross-platform library supporting such integers working as standard arithmetic type. Is it a good proposal for GSoC project and who would you recommend as a possible mentor for such project? Pozdrawiam, Kamil Witecki.

10 10

[Boost.Preprocessor] FOREACH( MACRO, ... )
by Daniel Larimer 17 Feb '10

17 Feb '10

Is there a reason why Boost.Preprocessor does not have many (any?) utilities for variadic macros? I have implemented a FOREACH( MACRO, ... ) that results in the following expansion MACRO(ARG1) MACRO(ARG2) ... Implemented as such: #define FOREACH_ARRAY( ... ) (PP_NARG(__VA_ARGS__) , ( __VA_ARGS__ ) ) #define FOREACH( A, ... ) BOOST_PP_REPEAT( PP_NARG(__VA_ARGS__), A, FOREACH_ARRAY(__VA_ARGS__) ) #define CASE(z,n,data) case BOOST_PP_ARRAY_ELEM( n, data ): FOREACH( CASE, a, b, c, d, e) case a: case b: case c: case d: case e: Depends upon this macro: #define PP_NARG(...) \ PP_NARG_(__VA_ARGS__,PP_RSEQ_N()) #define PP_NARG_(...) \ PP_ARG_N(__VA_ARGS__) #define PP_ARG_N( \ _1, _2, _3, _4, _5, _6, _7, _8, _9,_10, \ _11,_12,_13,_14,_15,_16,_17,_18,_19,_20, \ _21,_22,_23,_24,_25,_26,_27,_28,_29,_30, \ _31,_32,_33,_34,_35,_36,_37,_38,_39,_40, \ _41,_42,_43,_44,_45,_46,_47,_48,_49,_50, \ _51,_52,_53,_54,_55,_56,_57,_58,_59,_60, \ _61,_62,_63,N,...) N #define PP_RSEQ_N() \ 63,62,61,60, \ 59,58,57,56,55,54,53,52,51,50, \ 49,48,47,46,45,44,43,42,41,40, \ 39,38,37,36,35,34,33,32,31,30, \ 29,28,27,26,25,24,23,22,21,20, \ 19,18,17,16,15,14,13,12,11,10, \ 9,8,7,6,5,4,3,2,1,0

3 4

[thread] thread_specific_ptr, dangerous conflation of identity and address
by Edd Dawson 16 Feb '10

16 Feb '10

Hi folks, A thread_specific_ptr appears to use its own address as a key. For example, the two tss objects created below will likely share the same key: void f() { thread_specific_ptr<int> ptr; // ... } int main() { f(); f(); } When thread_specific_ptr's destructor is called, it does a reset() which clears the data for the thread doing the destruction. However, data for other threads still remain. I find this asymmetric behaviour a little strange. Why should all threads but one see their old data? The bigger problem though, is that it might not be *their* old data. It can just as easily be someone else's old data due to coincidental alignment of different thread_specific_ptrs on the stack at entirely unrelated points in the program, or even in different libraries that each happen to use boost::thread_specific_ptr! void g() { thread_specific_ptr<float> ptr; // ... } f(); g(); It's easy to see the problem here as the calls are very close to one another. In general, however, this strikes me as being really rather dangerous behaviour. Would it be fair to call it a bug? It seems it is only safe to allocate thread_specific_ptrs in static storage. A complete example is listed at the end. It exhibits the kind of behaviour I'm talking about on my x86 systems, at least. Kind regards, Edd //#define BOOST_ALL_NO_LIB 1 #include <queue> #include <iostream> #include <boost/thread/tss.hpp> #include <boost/thread/thread.hpp> #include <boost/thread/barrier.hpp> #include <boost/thread/condition.hpp> #include <boost/thread/mutex.hpp> #include <boost/bind.hpp> using namespace boost; typedef function<void ()> task_type; // Simple multi-producer-single-consumer job queue. // Manages its own consumer thread. class jobq { public: jobq() : dying_(false), consumer_(bind(&jobq::work_loop, this)) { } ~jobq() { exit_work_loop(); consumer_.join(); } void add(const task_type &task) { unique_lock<mutex> lk(mtx_); tasks_.push(task); arrival_.notify_one(); } private: void exit_work_loop() { unique_lock<mutex> lk(mtx_); dying_ = true; arrival_.notify_one(); } bool wait_for_task(task_type &task) { unique_lock<mutex> lk(mtx_); while (!dying_ && tasks_.empty()) arrival_.wait(lk); if (dying_) return false; task = tasks_.front(); tasks_.pop(); return true; } void work_loop() { task_type task; while (wait_for_task(task)) task(); } private: bool dying_; std::queue<task_type> tasks_; mutex mtx_; condition arrival_; thread consumer_; }; template<typename T> void access_tsp(thread_specific_ptr<T> &tsp, barrier &b) { if (!tsp.get()) tsp.reset(new T(-1)); else std::cout << "Already initialized to " << *tsp << "!\n"; b.wait(); } template<typename T> void f(jobq &q) { barrier b(2); thread_specific_ptr<T> tsp; q.add(bind(&access_tsp<T>, ref(tsp), ref(b))); b.wait(); // wait until it's safe to destroy tsp } int main() { jobq q; f<int>(q); f<unsigned>(q); return 0; }

4 6

Re: [boost] [Boost][gsoc]Intrest - big integer library
by Kamil Witecki 16 Feb '10

16 Feb '10

I see that even a simple, but robust, implementaion covering each case (possibly some of them awaiting implementations of apropriate policy) would be hard, if not infeasible, to be done in such a short period of time as is given in GSoC. On the other hand I would take a deeper look in that topic and meanwhile look for another proposition. Many thanks for all your answers and clarifiyng all the infarmation and possible problems. Kamil Witecki.

1 0

Re: [boost] boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

okay, I got it. Okay, I never cared about the project-config.jam file (maybe because the user_config file is mentioned after bootsrap.sh). I just put the using intel-linux stuff inside projetc-config: if ! intel-linux in [ feature.values <toolset> ] { using intel-linux : 10.1 : /lrz/sys/intel/icc_101/bin/icpc : <compileflags>"-fPIC" <linkflags>"-fPIC" ; } instead of the user_config. That's it. Don't know why it doesn't work for intel with user_config but for the gcc. However, I hope it'll work.. Thank @all, SirAnn -- NEU: Mit GMX DSL über 1000,- ¿ sparen! http://portal.gmx.net/de/go/dsl02

1 0

Re: [boost] boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

@ Normal 0 21 false false false DE X-NONE X-NONE Volodya > Well, just do that in project-config.jam? Or, alternatively, remove project-config.jam -- and have only user-config.jam be used. Okay, but which one is that? (location?) I can see your name in the jam files very often, thus you are to be the one who can help me out, dont' ya? @Dick Normal 0 21 false false false DE X-NONE X-NONE >If you build an executable that will dynamically load (with dlopen) shared libraries, then all of its code, including whatever it gets from static libraries, has to be compiled and linked with -fPIC. >This leads us to compile and link all of our code, including boost libraries, with -fPIC. bullseye! that's the problem that we have.. thus we have to turn on the fPIC option.. But I don't get it work for the intel compiler.... Do you have a solution? -- Sicherer, schneller und einfacher. Die aktuellen Internet-Browser - jetzt kostenlos herunterladen! http://portal.gmx.net/de/go/chbrowser

3 2

boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

Hello I just try to compile boost 1.42 on the Altix-HPC in Munic. Problem is that I need to compile it with turned on -fPIC cxx-flag. Following steps I'd done: 1. run ./bootstrap.h --prefix=... --with-toolset=intel-linux 2. modify tools/build/v2/user_config.jam: ... using intel-linux : : : <cxxflags>-fPIC ; ... (according to http://www.boost.org/boost-build2/doc/html/bbv2/reference/tools.html#bbv2.r…) 3. run ./bjam --> error: error: at /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/project.jam:884 error: duplicate initialization of intel-linux with the following parameters: error: version = <unspecified> error: previous initialization at /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/project.jam:884 What's the matter? What point did I miss? Please help ;-) SirAnn -- Sicherer, schneller und einfacher. Die aktuellen Internet-Browser - jetzt kostenlos herunterladen! http://portal.gmx.net/de/go/chbrowser

4 4

Re2: boost 1.42 - compile toolsset=intel-linux with fPIC
by "Sören Freudiger" 16 Feb '10

16 Feb '10

Normal 0 21 false false false DE X-NONE X-NONE > Take a look at project-config.jam -- it already has 'using intel....'. > I suggest you remove whatever setting you've made in tools/build/v2/user-config.jam. But that's especially what I wanna to: add the fPIC flag for the gcc version it works fine!) > Further, why are you even trying to use -fPIC. When building shared libraries, -fPIC is used already. Some of our guys have to link because of certain reasons against the static libs from boost and obtain the error boost should be compiled with turned on fPIC flag... -SirAnn -----Ursprüngliche Nachricht----- Von: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] Im Auftrag von Vladimir Prus Gesendet: Dienstag, 16. Februar 2010 17:18 An: boost(a)lists.boost.org Betreff: Re: [boost] boost 1.42 - compile toolsset=intel-linux with fPIC "Sören Freudiger" wrote: > Hello > I just try to compile boost 1.42 on the Altix-HPC in Munic. Problem is > that I need to compile it with turned on -fPIC cxx-flag. > > Following steps I'd done: > > 1. run ./bootstrap.h --prefix=... --with-toolset=intel-linux 2. modify > tools/build/v2/user_config.jam: > > ... > using intel-linux : : : <cxxflags>-fPIC ; ... > > (according to > http://www.boost.org/boost- build2/doc/html/bbv2/reference/tools.html#bbv2.reference.tools.compiler.intel) > > 3. run ./bjam > > --> error: > error: at > /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/proj > ect.jam:884 > error: duplicate initialization of intel-linux with the following > parameters: > error: version = <unspecified> > error: previous initialization at > /home/hlrb2/pr95gi/lu78wol/libs/boost_1_42_0/tools/build/v2/build/proj > ect.jam:884 > > What's the matter? What point did I miss? _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost -- NEU: Mit GMX DSL über 1000,- ¿ sparen! http://portal.gmx.net/de/go/dsl02

1 0

[BGL/PM] Composition of two property maps
by Matthias Walter 16 Feb '10

16 Feb '10

Hi, I currently have a function which gets a graph plus an index-map and want's to call a BFS. Therefore it needs to build a color-map which maps vertex_descriptors to colors. As the user already gives a way to map vertex_descriptor to index, I'd like to use this mapping. What I need is a way to define a property map as a composition: composed-map (vertex_descriptor) -> color via color-map (index-map (vertex_descriptor)) -> color whereas index-map (vertex_descriptor) -> index and color-map (index) -> color Of course this should not be too difficult to implement, so I'd just like to ask whether there already exists some kind of implementation, because I neither found a hint by looking in the docs, nor by digging through some of the code. The actual reason I ask is because there might be other ways to come around the problem, e.g. making the color-map itself use vertex_descriptors as keys, so maybe my suggested solution is not the best. best regards Matthias Walter

2 1

C++0x and MSVC 10
by Zachary Turner 16 Feb '10

16 Feb '10

Playing with the release candidate of MSVC 10, and I'm noticing boost 1.42.0 is not using any C++0x features. Has this been discussed before, or is there a reason for this? Taking a peek at boost/config/compiler/visualc.hpp, I see the following: #if _MSC_VER < 1600 #define BOOST_NO_AUTO_DECLARATIONS #define BOOST_NO_AUTO_MULTIDECLARATIONS #define BOOST_NO_DECLTYPE #define BOOST_NO_LAMBDAS #define BOOST_NO_RVALUE_REFERENCES #define BOOST_NO_STATIC_ASSERT #define BOOST_NO_NULLPTR #endif // _MSC_VER < 1600 // C++0x features not supported by any versions #define BOOST_NO_CHAR16_T #define BOOST_NO_CHAR32_T #define BOOST_NO_CONCEPTS #define BOOST_NO_CONSTEXPR #define BOOST_NO_DEFAULTED_FUNCTIONS #define BOOST_NO_DELETED_FUNCTIONS #define BOOST_NO_EXPLICIT_CONVERSION_OPERATORS #define BOOST_NO_EXTERN_TEMPLATE #define BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS #define BOOST_NO_INITIALIZER_LISTS #define BOOST_NO_RAW_LITERALS #define BOOST_NO_SCOPED_ENUMS #define BOOST_NO_SFINAE_EXPR #define BOOST_NO_TEMPLATE_ALIASES #define BOOST_NO_UNICODE_LITERALS #define BOOST_NO_VARIADIC_TEMPLATES It almost appears as if the #else was simply forgotten on the first #if. Can't we safely change the first conditional to the following? #if _MSC_VER < 1600 #define BOOST_NO_AUTO_DECLARATIONS #define BOOST_NO_AUTO_MULTIDECLARATIONS #define BOOST_NO_DECLTYPE #define BOOST_NO_LAMBDAS #define BOOST_NO_RVALUE_REFERENCES #define BOOST_NO_STATIC_ASSERT #define BOOST_NO_NULLPTR #else #define BOOST_HAS_AUTO_DECLARATIONS #define BOOST_HAS_AUTO_MULTIDECLARATIONS #define BOOST_HAS_DECLTYPE #define BOOST_HAS_LAMBDAS #define BOOST_HAS_RVALUE_REFERENCES #define BOOST_HAS_STATIC_ASSERT #define BOOST_HAS_NULLPTR #endif // _MSC_VER < 1600 Zach

7 13

boost/cstdint.hpp definition of INTMAX_C conflicts with MPFR
by Vincent Lefevre 16 Feb '10

16 Feb '10

Hi, I'm a MPFR developer and the following problem with Boost has been reported in the MPFR mailing-list. As of Boost 1.42, the macros INTMAX_C and UINTMAX_C (in particular) are always defined, and on a system without <stdint.h> (Microsoft C++ compiler), the build of a program using Boost 1.42 and MPFR failed. The reason is that mpfr.h supports systems with and without intmax_t (so that it does not force <stdint.h> inclusion), thus it must have a way to determine when intmax_t is available, without requiring the user to do anything else than including <stdint.h> first. So, it has several heuristics, one of them being the test of the existence of INTMAX_C and UINTMAX_C. Indeed, in C, which does not have namespaces, it is rather intuitive that the existence of INTMAX_C and UINTMAX_C implies that the corresponding types intmax_t and uintmax_t are available. However, in C++ with Boost, intmax_t and uintmax_t are not necessarily available (in the global namespace). Even though one could specify a macro for MPFR that would allow the user to disable (u)intmax_t support explicitly, I think that Boost's behavior is rather awkward, and may break other software too (in particular libraries that would do the same kind of things as Boost). Indeed (correct me if I'm wrong, I don't know very much about C++), while types have namespaces, macros don't, but there are conventions under which using a prefix such as BOOST_ can be used in place of a namespace (to avoid conflicts with other software). So, I wonder why Boost doesn't do the following: since it defines the intmax_t and uintmax_t types in the boost namespace, it should use the BOOST_ prefix for the corresponding macros, e.g. BOOST_INTMAX_C and BOOST_UINTMAX_C. The only acceptable artifact concerning these types would be that additional types and macros be defined due to the inclusion of standard headers such as <stdint.h>; but in such a case, the behavior would remain consistent (i.e. INTMAX_C and UINTMAX_C would be defined only if intmax_t and uintmax_t are available). If, for some reason, Boost really needs to define the INTMAX_C and UINTMAX_C macros, then it should also define intmax_t and uintmax_t in the global namespace. But I don't think that's a good idea. Regards, -- Vincent Lefèvre <vincent(a)vinc17.net> - Web: <http://www.vinc17.net/> 100% accessible validated (X)HTML - Blog: <http://www.vinc17.net/blog/> Work: CR INRIA - computer arithmetic / Arénaire project (LIP, ENS-Lyon)

2 4

[thread] Moving a `recursive_lock`
by Daniel Trebbien 16 Feb '10

16 Feb '10

Hello all, I have been working on a project that uses the Boost Thread library, and I realized that there is a part of the code that needs to transfer a lock to a thread that has just been started. My idea for implementing this was to use a `boost::recursive_mutex` and pass a non-`const` reference to a `boost::recursive_mutex::scoped_lock` to the thread via `boost::ref`. Also, to ensure that the `scoped_lock` does not go out of scope until until the lock is moved, I thought to use a `boost::barrier`. After writing some test code, I find it interesting that if I use a `recursive_mutex`, then an assertion fails, but if I use a `boost::mutex`, then the code seems to work fine. Here is the test code that I have been experimenting with (the `recursive_mutex` version, which is also attached): #include <iostream> #include <boost/ref.hpp> #include <boost/thread.hpp> static boost::recursive_mutex s_mutex; static boost::barrier s_lockMoveBarrier(2); void thread_fun1(boost::recursive_mutex::scoped_lock& lock_) { //boost::recursive_mutex::scoped_lock testLock(s_mutex); // uncommenting this causes deadlock, as expected std::cout << "in `void thread_fun1(...)`: moving lock..."; boost::recursive_mutex::scoped_lock lock2(boost::move(lock_)); std::cout << "done" << std::endl; s_lockMoveBarrier.wait(); std::cout << "in `void thread_fun1(...)`: after the barrier" << std::endl; } int main() { boost::recursive_mutex::scoped_lock lock(s_mutex); std::cout << "in `int main()`: lock on `s_mutex` acquired" << std::endl; boost::thread(&thread_fun1, boost::ref(lock)); s_lockMoveBarrier.wait(); std::cout << "in `int main()`: after the barrier" << std::endl; } After compiling and running this on Debian Squeeze with Boost 1.42.0, I get: in `int main()`: lock on `s_mutex` acquired in `void thread_fun1(...)`: moving lock...done in `int main()`: after the barrier a.out: /usr/local/include/boost/thread/pthread/recursive_mutex.hpp:62: boost::recursive_mutex::~recursive_mutex(): Assertion `!pthread_mutex_destroy(&m)' failed. Aborted After replacing "boost::recursive_mutex" with "boost::mutex", however, the output is: in `int main()`: lock on `s_mutex` acquired in `void thread_fun1(...)`: moving lock...done in `void thread_fun1(...)`: after the barrier in `int main()`: after the barrier This leads me to wondering: 1. Is it correct and/or safe to move a lock to a new thread in this way? 2. Why does the `recursive_mutex` version fail and the `mutex` version succeed? Daniel Trebbien

3 3

Re: [boost] [Boost][gsoc]Intrest - big integer library
by Kamil Witecki 15 Feb '10

15 Feb '10

>Given the number of times which a big integer library has been >started, I'd be wary of suggesting it as a GSoC project. I did not thought it would be so hard to be done. >Since there are already many C big integer libraries (with various >licenses), I'd be far more interested in an expression template system >that would let me hook in the operations I need. That way if I'm ok >with LGPL I can just use GMP, for instance. Also, a naive >implementation could be provided for testing and verification. It sounds very good. And does not involve reinventing the wheel from scratch as would do a new implementation of big integers. You would recommend creating expression templates that will allow to bind operators (functions or functionals) and types(for example big integers from third party library) together using type traits and passing functional as template parameter, have I got your idea right? >I remember hearing that someone had started something like that, but I >don't know its progress. I will take a deeper look if anybody has done it already. >~ Scott -- Kamil Witecki.

2 1

[filesystem] Mac OS default codecvt facet
by Beman Dawes 15 Feb '10

15 Feb '10

On Mac OS, Boost.Filesystem currently uses std::locale() as the default, since Apple doesn't see fit to support std::locale(""). There has been a request (ticket #3928) to change the codecvt facet to UTF-8 for the Boost.Filesystem default on Mac OS. This would at least potentially be a breaking change, so I wanted to ask other's opinions before making it. Questions: * Is UTF-8 OK with Mac OS users as the Boost.Filesystem default? * Would Linux users also prefer UTF-8 as the Boost.Filesystem default? Thanks, --Beman

2 6

Downcast taking account of virtual inheritance
by vicente.botet 15 Feb '10

15 Feb '10

Hi, I have a generic class that needs to downcast from a base class to a template class. The template class can use virtual inheritance or not. When the derived class use virtual inheritance I need to use dynamic cast, but not on the other cases. I'm wondering if a new downcast function that will take in account these facts would be of interest in Boost. clase B {...}; class D : public B {...}; class DV : public virtual B {...}; B* ptr; ptr= new D(); D* dPtr = downcast<D*>(ptr); // uses static_cast as is_virtual_base_of<B,D>::type is false ptr= new DV(); DV* dPtr = downcast<DV*>(ptr); // uses dynamic_cast as is_virtual_base_of<B,DV>::type is true What would be a good name for this downcast function? Best, _____________________ Vicente Juan Botet Escribá

6 11

[config] macors with variable arguments support
by vicente.botet 15 Feb '10

15 Feb '10

Hi, is threa macro to know if the compiler supports macros with variable arguments? Best, _____________________ Vicente Juan Botet Escribá

1 0

incomplete_smart_cast: a smart_cast to incomplete types
by vicente.botet 14 Feb '10

14 Feb '10

I have another user case: template <class Final, typename Base=base_transaction_object> class deep_transaction_object : public Base { Final* final() { return static_cast<Final*>(this); } const Final* final() const { return static_cast<Final const*>(this); } public: static Final* make_cache(Final const* rhs, transaction& ) { return new Final(*rhs); } virtual base_transaction_object* make_cache(transaction& t) const { return new Final(*final()); } virtual void delete_cache() { delete this; } virtual void copy_cache(base_transaction_object const & rhs) { *final() = *smart_cast<Final const*>(&rhs); // (1) } }; deep_transaction_object is a mixin class that is be used as follows class F : public deep_transaction_object<F> {...}; At the moment we use smart_cast in deep_transaction_object (1), F is not completly defined. smart_cast is a template class that needs its class parameters to be completly defined, as is_virtual_base_of needs this. In this context I can not check if Final is_virtual_base_of base_transaction_object. As F is a deep_transaction_object<F> which is a Base, the check could be limited to see if Base is_virtual_base_of base_transaction_object. Thus I need a kind of incomplete_smart_cast which in addition has an intermidiate class used for the tests *final() = *incomplete_smart_cast<Final const *, Base const*>(&rhs); incomplete_smart_cast<Target,Intermediate, Source> works like smart_cast except that instead of testing with Target, it test with Intermediate to select the cast to apply to target incomplete_smart_cast<F*, I*>(ptr) = static_cast<F*,smart_cast<I*>(ptr)> For the case of single inheritance this seems to too much to add, but with multiple inheritance the situation we can not build it from static_cast and smart_cast, we need to check if one of the intermediate classes is_virtual_base_of the base class. For example if the mixin allows to inherit from two classes template <class Final, class Base1, class Base1> class deep_transaction_object2 : public Base1, public Base2 { ... virtual void copy_cache(base_transaction_object const & rhs) { *final() = *incomplete_smart_cast2<Final const*, Base1 const*, Base2 const*>(&rhs); // (1) } }; Please let me know if my rationale is correct and if my use case is enough common to interest the Boost community. Best _____________________ Vicente Juan Botet Escribá

1 0

boost::any_ref and boost::any_const_ref
by Daniel Larimer 14 Feb '10

14 Feb '10

I am attempting to create a library with a generic interface run-time interface and have need for something like boost::any; however, boost::any requires heap allocation. boost::variant is not acceptable either because I do not know the full set of types in advance. Has anyone seen the equivalent of a type-checked void* or const void*? Effectively I would like to create a polymorphic method like this: void myclass::method( const_any_ref p1, const_any_ref p2, const any_ref p3 ) { const uint16_t& _p1 = p1; const double& _p2 = p2; const std::string& _p3 = p3; //If any of the types do not match it should throw an exception. alternatively the follow syntax may work if you want to avoid exceptions? boost::optional<const uint16_t&> _p1 = p1; if( !_p1 ) // cast failed? } Anyone have any nifty ideas on how to accomplish this without RTTI and no heap allocation? In place of RTTI I do have a "manual" RTTI system that I could use. get_typename<T>::str will return a unique const char* pointer. I am guessing the best I can hope for is a pair of pointers, one "void*" and one const char*. I am going to write such a class unless someone here knows of an existing solution. Dan

1 1

[vault][msm] Where has the vault gone?
by Agustín K-ballo Bergé 14 Feb '10

14 Feb '10

http://www.boostpro.com/vault/ gives a 404 - Not Found I'm trying to get the latest MSM version. Is there anywhere else I can get it? Agustín K-ballo Bergé.-

3 3

Re: [boost] [vault][msm] Where has the vault gone?
by Christophe Henry 13 Feb '10

13 Feb '10

> You can find it in sandbox > http://svn.boost.org/svn/boost/sandbox/msm/ Small precision, I use it as my "trunk" version. It is stable but the documentation still lags the code state (I am in the rewriting process). The last stable version and with up-to-date documentation (the one from the vault + a few bugfixes / performance improvements) is in: http://svn.boost.org/svn/boost/sandbox/msm/tags/version-2.0/ >For SF right link is http://sourceforge.net/projects/boost-msm/ And I didn't even advertise it :) I plan to use SF so that one could request and try some features before they make it into the official code, but I need to finish the project page first, so for the moment, you will find not much there. Christophe

1 0

Re: [boost] [serialization] Can one deserialize a derived classes viapointers to the base class using polymorphic archives in aDLL context?
by Bogdan 13 Feb '10

13 Feb '10

Robert Ramey <ramey <at> rrsd.com> writes: > >> > >> Please note BOOST_CLASS_EXPORT_IMPLEMENT is used only once per class > >> (inside polymorphic_derived2.cpp), yet the serializers are inserted > >> in the same map both from the Dll and from the executable. > >> > >> Am I doing something wrong? Has anyone been able to create a similar > >> working example? I really appreciate any feedback I could get. > > It looks like polymorphic_derived2.cpp is being included in both the > mainline as well as the DLL. > > It's not clear that polymorphic_base needs to be n the DLL and probably > shouldn't be. > > Make sure that your header includes BOOST_CLASS_EXPORT_KEY and not > BOOST_CLASS_EXPORT. > > finally, make sure that the test for this facility works. > > Robert Ramey > Thank you Robert for your quick response: I appreciate a lot the generous work you put in the library. I double checked the project I previously uploaded: I downloaded it via gmane.org, changed the name back from bin to zip and verified the following: - polymorphic_derived2.cpp file is included only in dll_polymorphic_derived2.vcproj. - there are only three projects dll_polymorphic_derived2, Library and test_dll_exported plus an explicit reference to the bjam files (I removed the latter after downloading); - there is no usage BOOST_CLASS_EXPORT; - there are exactly three declarations of BOOST_CLASS_EXPORT_KEY: one in polymorphic_base.hpp, and two in polymorphic_derved2.hpp one for polymorphic_derived1 and another for polymorphic_derived2. Similarly, there are only three usages of BOOST_CLASS_EXPORT_IMPLEMENT. There was only one question mark: test_dll_exported.vcproj depended on dll_polymorphic_derived2 both via Project Dependencies option and explicitly as an input library: to be on the safe side, I removed the explicit dependency of test_dll_exported on dll_polymorphic_derived2 from the solution. I rebuild the solution from scratch. Unfortunately I got the same exception. So I am still cornered and looking for some help. Thank you again, Bogdan

1 0

[serialization] Can one deserialize a derived classes via pointers to the base class using polymorphic archives in a DLL context?
by Bogdan 13 Feb '10

13 Feb '10

Hi all, I am trying to upgrade to boost 1.42 using Visual Studio 2008 and I have difficulties using serialization with polymorphic archives in a DLL setup. I would like to encapsulate in one DLL the class serialization functionality based on a polymorphic base archive. In another place, I would like to perform the actual serialization/deserialization using a specific archive (e.g., polymorphic_text_[io]archive). The section "Special Considerations" of the documentation indicates in two paragraphs ("DLLS - Serialization and Runtime Linking" and " Plugins") that this scenario is supported by the library. However I couldn't find any example that shows how to do that. Therefore, I changed slightly the boost test that includes test_dll_exported.cpp and polymorphic_derived2.cpp as follows: 1. I moved the classes polymorphic_base and polymorphic_derived1 to the project polymorphic_derived2 This way, we have one place where those classes serialize their members (i.e., polymorphic_derived2.dll) and a separate binary where we serialize them via a derived archive (i.e., test_main() inside test_dll_exported.exe); 2. I replaced the template version of the serialization functions with the equivalent version based on boost::archive::polymorphic_[io]archives. I also removed the text-based instantiation inside the Dll. As indicated in the boost documentation, the class serialization will only have to be compiled once for all archive implementations (present or future). Therefore, the DLL should contain only the serialization functions to the base polymorphic archives. While everything builds correctly, at run time I get a C++ exception BEFORE main() in basic_serializer_map.cpp around the line 48: // if this fails, it's because it's been instantiated // in multiple modules - DLLS - a recipe for problems. // So trap this here if(!result.second){ boost::serialization::throw_exception( archive_exception( archive_exception::multiple_code_instantiation, bs->get_debug_info() ) ); } Please note BOOST_CLASS_EXPORT_IMPLEMENT is used only once per class (inside polymorphic_derived2.cpp), yet the serializers are inserted in the same map both from the Dll and from the executable. Am I doing something wrong? Has anyone been able to create a similar working example? I really appreciate any feedback I could get. Thank you, Bogdan PS For more info I attached the files describing my problem plus the .sln file (I used the configuration "Debug runtime-dynamic threading-multi")

2 1

Re: [boost] [contract] Contract Programming Library
by Andrzej Krzemienski 13 Feb '10

13 Feb '10

> I am thinking to submit a library for Contract Programming (a.k.a. > Design By Contract (TM) ) for C++. > I have drafted some of the library documentation in Boost-like format: > http://dbcpp.sourceforge.net/boost/libs/contract/doc/html/ > Comments? Hi, I would be very interested in trying such a library. I have one suggestion, which may be impossible to implement, but I think it would be worth at least looking at. The macros for defining assertions spoil function declarations. I know it is inevitable, etc., but.. read on. I know at least one library in Boost that also spoils function declarations in order to provide additional functionality: Concept Check library; they may be others too (MPL?). My suggestion is that if there are (or will be) libraries that require spoiling function declarations, they should all provide the same "spoiled" syntax. Otherwise I will be always asking "how do I declare a function in this library?". It would be very convenient if Boost provided one alternative function definition syntax that when used would enable all its libraries to work. Regards, &rzej

2 1

Interest in Remote Procedure Call Library?
by Daniel Larimer 13 Feb '10

13 Feb '10

I have been playing with some code and recently developed a very efficient, extensible, and easy to use API for performing remote procedure calls (with multiple protocols). I am writing to gauge interest and get feedback on the user API. The native "protocol" is a custom combined tcp/udp protocol using multi-cast for discovery, but it would be very easy to add a shared memory solution, a dbus, XML/RPC, CORBA, etc back end to the user api. Example: class SomeClass { public: int add( int a, int b ) { return a + b ); void sub( int a, int b, int* result ) { if(result) *result = a -b; }; void inout( int& a ) { a += 5; } }; META_INTERFACE( SomeClass, METHOD(add) METHOD(sub) METHOD(inout) ) // server SomeClass myclass; Server myserver( &myclass, "my.named.service" ); // client RemoteInterface<SomeClass> ri( "my.named.service" ); int result = ri.add(1,4); assert( result == 5 ) ri.sub( 5, 1, &result ); assert( result == 4 ); ri.inout(result); assert( result == 9 ); API can support any type that is serializable. It also supports the signal/slot paradigm. SomeClass could have any number of base-classes both virtual and non-virtual. With respect to performance, it can perform 15,000+ synchronous (invoke, wait for return) operations per-second on localhost/linux. Asynchronous operations are capable of 500,000+ invokes/sec. The library doubles as a built-in reflection system allowing run time inspection member functions, parameter types, inheritance, etc. I am working to convince my employer (small company of 25) that contributing this library would bring more benefits than "costs" to the company. The reasons I think it is a good idea include: 1) Expose the company to more people (marketing) 2) We can give our customers an "open" API for communicating with our products 2) Offload some of the development / maintenance / support to the open source community 3) I like open source and have personal reasons for wanting it free and open. So I need to get some more support to convince my employer that this will be a good move. Active interest would be a good sign. Other ideas on the positive aspects of contributing vs keeping it internal would also help me make my case. Thanks, Dan

7 33

WARNING: BoostBook build change..
by Rene Rivera 13 Feb '10

13 Feb '10

In response to the whole, using Boost logo outside of real Boost Libraries, I changed the BoostBook XSL slightly to: * Default to not including a navbar. * Default to not including the Boost logo in the navbar, when one expressly asks to include the navbar. I changed the Boost Jamroot to include the two options one needs to get back the standard Boost navbar+logo: <xsl:param>nav.layout=horizontal <xsl:param>boost.image=Boost The "boost.image" param is new and lets one specify: none (for no logo image), Boost (for the boost.png image), or anything else (for your own custom image. So.. WARNING: You may have to change your doc builds if you previously assumed that the navbar or logo would show up outside of Boost to include the above options (or some version thereof). -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org (msn) - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim,yahoo,skype,efnet,gmail

3 2

bcp utility documentation
by Jeroen Habraken 13 Feb '10

13 Feb '10

Hi, I just noticed that http://www.boost.org/doc/libs/1_42_0/tools/bcp/bcp.html which is linked to from the main boost.org page under documentation leads to a 404. The page used to exist as http://www.boost.org/doc/libs/1_41_0/tools/bcp/bcp.html. Regards, Jeroen Habraken

2 2

[property_tree] Proposal for Boost.Property_Tree put function
by Andrew Hundt 12 Feb '10

12 Feb '10

I have been using the boost::property_tree in one of our products, and have become frustrated by an inconsistency between two of the convenience functions. The basic_ptree get function allows the specification of a separate delimiter when specifying the path, such as: pt.get<float>('/', "p.a.t.h/t.o/v.a.l.u.e"); However, there is no similar way to call put to place the same value as follows: pt.put('/', "p.a.t.h/t.o/v.a.l.u.e", 3.14f); I would like propose the addition of functions to allow consistency between the use of get and put functions. The basic use of these functions is described in http://www.boost.org/doc/libs/1_42_0/doc/html/boost_propertytree/accessing.… Are there any thoughts or comments? Regards, Andrew Hundt

1 0

[1.3.9][hpux]:pthread_create syambol does not exist in boost.1.3.9 library
by gopal haldar 12 Feb '10

12 Feb '10

Hi I built both boost.1.3.2 and boost 1.3.9 in the hpux 11.23 system. I can see the pthread_create symbol in boost 1.3.2 library but not in boost1.3.9 thread library. Due to this issue, my application crashing hpux 11.11 with boost 1.3.9 system and showing message "pthead_create symbol not found" in the boost thread library but working fine with 1.3.2. Please let me know the solution. Regards Gopal

2 1

[transact] code in sandbox
by strasser＠uni-bremen.de 11 Feb '10

11 Feb '10

Hi, I haven't had much time lately, and that's not going to change to next couple of weeks, so I've uploaded what I have so far to the sandbox: https://svn.boost.org/svn/boost/sandbox/transaction/boost/transact/ what's new: *** basic_transaction_manager: - now supports all kinds of combinations of commits, like we've discussed, including one-phase/transient two-phase, persistent two-phase. no logging/recovery yet. - lazy and non-lazy transaction construction, user-configurable *** simple_transaction_manager: a transaction manager supporting only one resource. basic_tranaction_manager includes a lot of MPL/fusion and the logging infrastrucure, none of which is needed for only one resource. this is intended to be the default transaction manager when one of our libraries is used on its own. *** logging infrastructure: to be used by basic_transaction_manager for its distributed transaction log, and optionally by resource managers that need logging (so it is part of the public interface!) - olog_files: maintaining log files without knowing its contents, manual log rolling - otransaction_log_files: same as olog_files, but automatic log rolling based on transactions - olog: writes to olog_files, aware of log entries - olog_buffer: same interface as olog, but buffers log entries locally and only accesses the log when the internal buffer overflows. - TODO: ilog_files/ilog to read/recover from logs. code is there, but not migrated to "transact". - TODO: interleaved_ologs/..., providing multiple olog interfaces so different resource managers can share a log, as we've discussed. *** new syntax for transaction scopes: syntax changed from: atomic{ ... }retry; to do atomic{ }commit(); I prefer that syntax because it resembles the do{}while(...) syntax. downside is that it conflicts with transaction::commit() if the user chooses to define BOOST_TRANSACT_COMMIT to "commit" (as is done above). *** TODO object_access not migrated to "transact" yet. utility functions for resource managers to serialize/clone/compare/... objects. regards, Stefan

2 4

Re: [boost] Iterator facade example could use some changes/documentation adjustments
by Jacob McIntosh 11 Feb '10

11 Feb '10

> From: Jeffrey Hellrung <jhellrung(a)ucla.edu> > To: boost(a)lists.boost.org > Subject: Re: [boost] Iterator facade example could use some > changes/documentation adjustments > > I think this is a valid concern, though I'm guessing this would cause > problems at most infrequently. I'm having difficulty coming up with a > use case where this would be a problem. Did you stumble upon this while > writing "real" code? It just came to mind while I was writing some of my own iterators. I wasn't even using iterator facade to do it, as I ended up using raw pointers for iterators in my use case, but I started looking at the documentation for is_convertible to figure out why they chose that conversion, and noticed the other behavior. And, though I personally haven't used that in real code, I could imagine a developer having the bright idea of converting a derived iterator into a base one thinking it will _only_ remove his need to explicitly cast the value provided by the derived iterator for whatever purpose. But, even disregarding that, on a more basic level... using is_convertible to allow conversion from non-const to const iterators is really doing more than just that. It's letting you do a host of other things as well... and though my example involved derived classes, The same would happen in cases like converting an integer iterator into a double iterator, as is_convertible returns true in that case as well. Any time the size of the types is different, it could cause problems. This is arguably a very stupid usage of iterators, but if we can enforce proper usage via compile time errors rather than runtime errors... why not? > > Would this motivate the existence of an is_iterator_convertible > metafunction, which is identical to is_convertible except for pointers? > > - Jeff > I'm not sure what there is to gain from this, would have to see what functionality is_iterator_convertible would provide. IMO, it doesn't make a whole lot of sense to convert an iterator<A> to iterator unless A == const B. Converting a const iterator to non-const iterator wouldn't enforce the access of the const iterator, and doing so in a copy constructor removes the need to const_cast for clarity. And converting an iterator<derived> to iterator<base>... or iterator<int> to iterator<double> doesn't seem to make much sense, to me. - Jacob

1 0

Iterator facade example could use some changes/documentation adjustments
by Jacob McIntosh 10 Feb '10

10 Feb '10

My example here: http://codepad.org/pH3pXAvb As mentioned in the comment block at the codepad page: http://www.boost.org/doc/libs/1_41_0/libs/iterator/doc/iterator_facade.html… The above link demonstrates in a linked-list scenario, using is_convertible to handle the conversion from non-const iterators to const iterators. This works fine in the example's linked list scenario, but it's likely than many users of iterator_facade will more generally copy this usage to their own container, from the example. However, as my example demonstrates, in the case where the data lives in contiguous memory locations, or perhaps other scenarios, using is_convertible is very bad for this purpose. It lets you convert from a derived class pointer to a base class pointer, and this is problematic if sizeof(base) is less than sizeof(derived) See the below, very minimal example to illustrate my point. Look at CFixedTest for my proposed replacement for is_convertible to prevent this undesirable behavior. Seems to me that noting such behavior, or simply changing the example code to not allow the conversion (as my example does), would remedy the misunderstanding/problem. Just thought I'd contribute that - thanks, nacitar

2 1

[iterator] Interest in abstract iterator?
by Andrey Semashev 09 Feb '10

09 Feb '10

Hi, Quite a few times I needed a type-erased iterator, that is somewhat similar to boost::function and boost::any with regard to functors and other objects. I've crafted a simple abstract_iterator that is capable to adopt other iterators. Main features are: * A quite small and simple implementation. * Small objects optimization. By default, adopting iterators with size of a pointer or smaller will not result in dynamic memory allocation. * The abstract_iterator is capable to adopt other abstract_iterators of the same or more relaxed iterator category without increasing the adoption level. * Most operations on the iterator introduce a virtual function call overhead. Operations involving two iterators also require a dynamic_cast. The code is in the Vault: http://tinyurl.com/yhxbkl3 Tested on MSVC 9. Is there any interest?

4 4

[1.3.9][thread]:nm: libboost_thread-gcc40-mt-1_39.sl: no symbols
by gopal haldar 09 Feb '10

09 Feb '10

Hi I have built the boost thread library locally in hpux 11.23 system. But when I try to check the symbol in the library using nm it displays the following message. nm: libboost_thread-gcc40-mt-1_39.sl: no symbols. Please let me know how to check the symbols in boost library. Regards Gopal

3 2

[rfc] sized_array
by Tim Blechmann 09 Feb '10

09 Feb '10

hi all, i have a small class, something between std::vector and boost::array. if others find it useful, i could submit it as an extension to the boost.array libray. it basically implements a dynamically sized array, similar to boost::array, but its size can be defined at run-time, rather than compile-time. in contrary to std::vector, which is only required to support random-access iterators (which are implementation-defined), my class guaranties to allocate the data in one consecutive memory area. it can basically be used like boost::array, the only difference is its constructor, which takes either an integer size or a container. boost::array<float, 5> ba; sized_array<float> sa(5); // initialize to size 5 assert(sa.size() == ba.size()); // container size ba.assign(pi); sa.assign(pi); // assignment sized_array<float> sa2(ba); // construct from container the code is available at [1], would be interested to hear, if other people find it useful .. thanks, tim [1] http://tim.klingt.org/git?p=nova-server.git;a=blob;f=source/utilities/sized… -- tim(a)klingt.org http://tim.klingt.org Art is either a complaint or do something else John Cage quoting Jasper Johns

7 10

[website] Move guidelines and developer documentation to Trac?
by Daniel James 09 Feb '10

09 Feb '10

Hello all, The guidelines and developer documentation on the boost site are getting a bit old, and no one's really updating them. Meanwhile new developer documentation is being written on the Trac wiki. It seems confusing to split the documentation over two sites, and most developers find it easier to update the wiki so it might be a good idea to move all the developer documentation over to the wiki and the Trac would become the 'developer's site'. This could also help improve the main boost site. It could be simpler and more focussed towards users. Some developer pages would probably have to remain on the site for technical reasons (such as test results) and some articles might not be appropriate, or we might not have the author's permission to put them on a wiki. The developer section would be replaced by a page suggesting how to contribute to boost (along the lines of http://lists.boost.org/MailArchives/boost-docs/2010/01/3960.php) We'd also keep the calendar on the main site in some form, as it can be useful for users. Any thoughts? Daniel

3 4

TMP runtime access problem
by Willy Liu 09 Feb '10

09 Feb '10

Hi, I wonder that how to access metadata in runtime. If I pre-compute something and save them into a template ARRAY<int N>, how can I random access the metadatas in runtime? What I can only do is binary searching. Is it possible to do in constant time, or there exist some functions in MPL doing this? #include<cstdio> using namespace std; template<int N> struct ARRAY { static const int a = ARRAY<N - 1>::a * 2; }; template<> struct ARRAY<0> { static const int a = 1; }; template<int LOWER, int UPPER> struct BS { static const int MID = UPPER + LOWER >> 1; typedef BS<MID + 1, UPPER> GREATER; typedef BS<LOWER, MID> LESS; static inline int binary_search(int n) { if(n > MID) return GREATER::binary_search(n); else return LESS::binary_search(n); } }; template<int N> struct BS<N, N> { static const int MID = N; typedef ARRAY<MID> result; static inline int binary_search(int n) { return result::a; } }; int main() { int n; printf("2^n n:"); scanf("%d", &n); printf("ARRAY<%d>::a = %d\n", n, BS<0, 30>::binary_search(n)); main(); return 0; }

2 1

[GGL][Polygon][Union] Union returns hole (inner ring) of the expected result as the output polygon (outer ring)
by Mohammad Morshed Alam Helal 09 Feb '10

09 Feb '10

Hi, Union of two polygon_2d returns a hole (inner ring) as result. Where - Input polygons - Polygon 1: A big rectangle with a hexagonal hole inside Polygon 2: A triangle that intersects the hole from inside leaving portion of it in the hole Output polygon - The hexagonal hole without the triangle-portion. Expected output polygon - The big rectangle with current output polygon as hole (inner)as described in this picture. The Union of a rectangle with a hexagonal hole and a triangle intersecting the first polygon ***************************** ***************************** ***************************** ******** ********* ******* **X***** ****** XXX***** ***** XXX****** **** XX ***** ***** ****** ****** ******* ******* ******** ******** ********* ***************************** ***************************** ***************************** returns this polygon, instead of the correct result. ++++++++++++ ++++++++++++++ +++++++++++++++ +++++++++++++++ +++++++++++++++ +++ ++++++++++++++++++ ++++++++++++++++ ++++++++++++++ ++++++++++++ You can use the code bellow to generate the case and some PPM images. You may use a WSQ Viewer to see the polygons. Please let me know any workaround or anything thats I am missing. Thank and regards, Helal // the code void uniontest() // Your main should call it { double L = 200.0; const double outloop[][2] = { {L, L}, {L, -L}, {-L, -L}, {-L, L}, {L, L} }; double R = 100.0; double H = R * sqrt(3.0) / 2; const double inloop[][2] = { {R, 0}, {R/2, -H}, {-R/2, -H}, {-R, 0}, {-R/2, H}, {R/2, H}, {R, 0} }; polygon_2d BIGpoly; //A rectangle with a hexagonal hole in it assign(BIGpoly, outloop); //the rectangle BIGpoly.inners().resize(1); linear_ring<point_2d>& inner = BIGpoly.inners().back(); assign(inner, inloop); //the inner hexagon correct(BIGpoly); //correct the order iff not double a = 20.0; double h = a * sqrt(3.0) / 2; const double t1[][2] = { { 30+0, 10+0}, { 30+a/2, 10+h}, { 30+a, 10+0} }; const double t2[][2] = { { 0, 0}, { a/2, h}, { a, 0} }; const double t3[][2] = { {-10+0, -10+0}, {-10+a/2, -10+h}, {-10+a, -10+0} }; const double t4[][2] = { { 0, -15+0}, { a/2, -15+h}, { a, -15+0} }; const double t5[][2] = { {-50, -40}, {-110, 0}, {-100, 30}, {-50, -40} }; polygon_2d T1, T2, T3, T4, T5, T6; //the triangles assign(T1, t1); correct(T1); assign(T2, t2); correct(T2); assign(T3, t3); correct(T3); assign(T4, t4); correct(T4); assign(T5, t5); correct(T5); std::vector<polygon_2d > P_list, P_union, P_tmp; //the outer shape P_union.push_back(BIGpoly); DumbPPMPrint("c:\\BIGpoly.ppm", P_union.begin(), P_union.size()); //Case 1: floating triangle in hole P_union.clear(); ggl::union_inserter<ggl::polygon_2d >(BIGpoly, T1, std::back_inserter(P_union)); DumbPPMPrint("c:\\case1.ppm", P_union.begin(), P_union.size()); //Case 2: three solid triangle creating a small hole P_union.clear(); P_tmp.clear(); ggl::union_inserter<ggl::polygon_2d >(T2, T3, std::back_inserter(P_tmp)); DumbPPMPrint("c:\\case2_i.ppm", P_tmp.begin(), P_tmp.size()); ggl::union_inserter<ggl::polygon_2d >( (*(P_tmp.begin())), T4, std::back_inserter(P_union)); DumbPPMPrint("c:\\case2.ppm", P_union.begin(), P_union.size()); //Case 3: floating holed-polygon in hole //P_union.clear(); //contains result of case 2 P_tmp.clear(); ggl::union_inserter<ggl::polygon_2d >(BIGpoly, (*(P_union.begin())), std::back_inserter(P_tmp)); DumbPPMPrint("c:\\case3.ppm", P_tmp.begin(), P_tmp.size()); //Case 4: a triangle intersecting the hole from inside P_union.clear(); P_union.push_back(BIGpoly); P_union.push_back(T5); DumbPPMPrint("c:\\case4_pre.ppm", P_union.begin(), P_union.size()); P_union.clear(); ggl::union_inserter<ggl::polygon_2d >( BIGpoly, T5, std::back_inserter(P_union)); DumbPPMPrint("c:\\case4.ppm", P_union.begin(), P_union.size()); P_union.clear(); ggl::union_inserter<ggl::polygon_2d >( T5, BIGpoly, std::back_inserter(P_union)); DumbPPMPrint("c:\\case4_rev_order.ppm", P_union.begin(), P_union.size()); } void DumbPPMPrint(char *name, std::vector<polygon_2d >::iterator it, unsigned int n) { //WSQ Viewer can be of help //http://www.cognaxon.com/index.php?page=wsqview //the holes are black. //the more number of polygons are present at a pixel the brighter the pixel is. unsigned int imgwidth = 512; //pixel width of image unsigned int imgheight = 512; //pixel height of image float width = 400.0; //width of image: 10 units (e.g. meters) float height = 400.0; //height of image: 10 units (e.g. meters) //float width = 6000.0; //width of image: 10 units (e.g. meters) //float height = 6000.0; //height of image: 10 units (e.g. meters) //header FILE *signal = fopen(name, "wt"); fprintf(signal, "P3\n"); fprintf(signal, "# %s\n", name); fprintf(signal, "%d %d\n", imgwidth, imgheight); fprintf(signal, "255\n"); unsigned int x, y, i; float xpos, ypos; // PPM images carry red, green, blue color channels. int val0, val1, val2; std::vector<polygon_2d >::iterator poly; for (y = 0; y < imgheight; y++) { ypos = height/2 - height * y / imgheight; for (x = 0; x < imgwidth; x++) { xpos = width/2 - width * x / imgwidth; val0 = val1 = val2 = 0; //black ggl::point_xy<float> point(xpos, ypos); poly = it; for (i = 0; i < n; i++, poly++) { if( ggl::within( point, (*poly) ) ) { val0 += 255/n; val1 += 255/n; val2 += 255/n; } } //fi_poly // clamp to allowed range if (val0 < 0) val0 = 0; else if (val0 > 255) val0 = 255; if (val1 < 0) val1 = 0; else if (val1 > 255) val1 = 255; if (val2 < 0) val2 = 0; else if (val2 > 255) val2 = 255; fprintf(signal, "%3d %3d %3d ", val0, val1, val2); if (x%16 == 15) fprintf(signal, "\n"); } //fi_x } //fi_y fclose(signal); } //@End_of_Code

2 7

C++ Networking Library Release 0.5
by Dean Michael Berris 09 Feb '10

09 Feb '10

Good day everyone, and I apologize in advance for the shameless plug. That said though, I'd like to announce the availability of version 0.5 of the C++ Network Library (cpp-netlib) on both Github and Sourceforge. For those interested in trying out a header-only being-developed-for-boost-inclusion networking library collection, you can download the latest release from: http://github.com/cpp-netlib/cpp-netlib/downloads or https://sourceforge.net/projects/cpp-netlib/ Active development happens on Github where the official repository is http://github.com/cpp-netlib/cpp-netlib (or via git) git://github.com/cpp-netlib/cpp-netlib.git While the cutting edge "clearing house" repository is the one I host also on Github http://github.com/mikhailberis/cpp-netlib (or via git) git://github.com/mikhailberis/cpp-netlib.git The latest release contains: * An HTTP 1.1 client * An embeddable HTTP 1.0 server template If you're interested in joining in on the development, please join the discussion at the cpp-netlib-devel mailing list at: https://lists.sourceforge.net/mailman/listinfo/cpp-netlib-devel or just fork my Github hosted repository -- then send pull requests when you feel like submitting your work "upstream" to me. We're currently in the process of moving on to implementing an HTTP 1.1 server template (looks like a Java Servlet Container), more efficient HTTP 1.1 client implementations, and other goodies. You can find documentation about cpp-netlib over at http://cpp-netlib.github.com/ Thanks in advance everyone and I hope this helps! -- Dean Michael Berris cplusplus-soup.com | twitter.com/deanberris linkedin.com/in/mikhailberis | facebook.com/dean.berris | deanberris.com

31 123

[contract] Contract Programming Library
by Lorenzo Caminiti 09 Feb '10

09 Feb '10

Hi all, I am thinking to submit a library for Contract Programming (a.k.a. Design By Contract (TM) ) for C++. I have drafted some of the library documentation in Boost-like format: http://dbcpp.sourceforge.net/boost/libs/contract/doc/html/ Comments? Regards, Lorenzo

6 15

Re: [boost] boost::mpl::for_each and value_initialized
by Niels Dekker - address until 2010-10-10 08 Feb '10

08 Feb '10

>> I'm sorry, MSVC bug #100744 is still there, even though #335987 has >> been fixed. VC9 deals with POD types correctly, but may not do so >> for non-POD aggregate class types. Domagoj Saric wrote: > but if this is so, shouldn't the proposed patch atleast be > modified to: > > #ifdef BOOST_VALUE_INITIALIZATION_NEEDS_MEMSET > if > ( > !( > ( _MSC_VER >= 1500 ) && > ( is_pod<T>::value ) > ) > ) > std::memset(&x, 0, sizeof(x)); > > #endif > ? I would consider that a refinement. But it's not that simple. MSVC does value-initialize a lot of non-POD types correctly! (But not all of them.) Other compilers may value-initialize built-in types correctly, but not aggregates. I can't remember exactly. So I'd rather start by committing the simple fix that I proposed at Aleksey's ticket #3869, "Unconditional call to memset in value_initialized()", https://svn.boost.org/trac/boost/ticket/3869 Note that I'm planning to rename the macro to BOOST_NO_PROPER_VALUE_INITIALIZATION_FOR_ALL_TYPES. I hope that's okay. But before I commit I'll have to write unit tests for this macro, as John explained to me. I'm planning to do so later this month. When all that is done and stabilized, I wouldn't mind looking at some possible fine tuning, to further reduce the number of memset calls. But I'm afraid it will be a maintainer's headache. Kind regards, Niels -- Niels Dekker http://www.xs4all.nl/~nd/dekkerware Scientific programmer at LKEB, Leiden University Medical Center

2 1

[lexical_cast] efficiency
by Domagoj Saric 08 Feb '10

08 Feb '10

'A while back', in the "error_code debate" I used a lexical_cast<> example for demonstrating certain concerns/aspects but the whole post was so long (as usual :) that it was probably read by less than 0.1% of people :) Anyways I'm extracting and reposting this bit now as I think it warrants attention. The first problem is the ('standard') "std::streams vs efficency" issue: - on msvc 9.0 sp1 the single line boost::lexical_cast<int>( "321" ); caused 14 calls to new and 26 calls to EnterCriticalSection() (not to mention vtable initializations, virtual function calls, usage of locales...) the first time it is called, and 3 calls to new and 15 calls to EnterCriticalSection() on subsequent calls...It also caused the binary (which does not otherwise use streams) to increase by 50 kB! ...which is IMNHO abhorrent... (with my usual 'put things in perspective' examples http://www.theprodukkt.com/kkrieger http://www.youtube.com/watch?v=3vzcMdkvPPg :) As a start maybe this problem could be sufficiently "lessened" by providing lexical_cast specializations/overloads that use C library functions (strtol, itoa and the likes) as they suffer less from bloat/performance issues than std::streams. Ideally, IMHO, lexical_cast<> should provide the power/configurability of boost::numeric_cast (so that one can, for example, say I do not need/want to use locales/assume ASCII strings and things like that). The second problem is the use of exceptions (or better of only using exceptions): if, for example, one uses lexical_cast<> deep in the bowels of some parser it is probably "natural" to use a bad_cast exception to report an error to the outside world but if one uses lexical_cast<> to convert a string entered into a widget by a user into an int it would mostly be simpler to have a simple error code if the user entered an invalid string and issue a warning and retry "at the face of the place" (without the need for try-catch blocks)... In other words maybe a dual/hybrid approach of using both exceptions and error codes (through different overloads would be justified). -- "That men do not learn very much from the lessons of history is the most important of all the lessons of history." Aldous Huxley

5 9

boost::mpl::for_each and value_initialized
by Peter Foelsche 08 Feb '10

08 Feb '10

Dear All, what is the use of value_initialized in boost::mpl::for_each? It should be sufficient if the value is initialized by the constructor. value_initialized() calls memset() in before calling the constructor. This memset() is not being optimized away with gnu-c++ 4.4.1. What class does require zeroed memory to work correctly? Peter *** boost_1_40_0/boost/mpl/for_each.hpp Mon Aug 17 22:16:53 2009 --- boost_1_40_0.saved/boost/mpl/for_each.hpp Tue Sep 1 12:54:55 2009 *************** *** 71,78 **** // dwa 2002/9/10 -- make sure not to invoke undefined behavior // when we pass arg. ! value_initialized<arg> x; ! aux::unwrap(f, 0)(boost::get(x)); typedef typename mpl::next<Iterator>::type iter; for_each_impl<boost::is_same<iter,LastIterator>::value> --- 71,78 ---- // dwa 2002/9/10 -- make sure not to invoke undefined behavior // when we pass arg. ! //value_initialized<arg> x; ! aux::unwrap(f, 0)(arg()); typedef typename mpl::next<Iterator>::type iter; for_each_impl<boost::is_same<iter,LastIterator>::value>

5 10

[fusion] is there an adapter for C-arrays?
by vicente.botet 08 Feb '10

08 Feb '10

Hi, I need to visit the members of a C++ type using Fusion sequences. For structures I plan to use BOOST_FUSION_ADAPT_STRUCT. I need also to visit also c-arrays (with static size). I see that there is already an adapter for boost::array. Is there an adapter for C-arrays? Thanks, _____________________ Vicente Juan Botet Escribá

4 11

Re: [boost] boost::mpl::for_each and value_initialized
by Niels Dekker - address until 2010-10-10 07 Feb '10

07 Feb '10

Peter Foelsche wrote: > in boost_1_41_0 there is still an unconditional call to memset in > value_initialized() Fernando Cacciola and I originally added the memset call within value_initialized() for MSVC only, because MSVC's implementation of value-initialization was known to incorrectly leave some bytes uninitialized, in some very relevant use cases. https://svn.boost.org/trac/boost/changeset/39157/trunk/boost/utility/value_… Thereby we also added extra unit tests, which were passed by MSVC by then, because of the memset. But unfortunately they failed on other compilers (GCC, Borland/Codegear and Sun), because of similar value-initialization issues. That's when we thought it was wise to just have the memset call there for all compilers: https://svn.boost.org/trac/boost/changeset/41942/trunk/boost/utility/value_… Do I understand correctly that you want the memset call to be skipped for those compiler versions that have implemented value-initialization entirely correctly? Do you know exactly which compiler versions do implement value-initialization correctly? Personally I do appreciate that the behavior of value_initialized is now exactly the same for all compilers. But I do understand you're concerned about the performance penalty of the memset call, for those compilers that have implemented value-initialization correctly. If so, can you please create a ticket, preferably including a patch? Kind regards, Niels -- Niels Dekker http://www.xs4all.nl/~nd/dekkerware Scientific programmer at LKEB, Leiden University Medical Center

5 8

wrapper to add Boost.Iterator adaptors to Boost.Range
by dstahlke 07 Feb '10

07 Feb '10

I've worked up a subclass that adds Boost.Iterator functionality to a Boost.Range object. The motivation was twofold: Range combines begin() and end() into one object, preventing the need to write iterator adapter code twice, and adding adaptors into the subclass avoids the need to specify namespaces and allows code structures similar to those of perl or ruby. I expect that this type of writing will become desirable when C++0x lambda functions are available. The C++0x 'auto' keyword will allow storing the generated iterators to local variables for further arithmetic; as it stands now the induced types are far to complex to be written out by hand. The point of this message is just to share the idea in case anyone wishes to do something with it. I'm relatively new to C++ and lack the knowledge needed to make something like this the right way. For example, I have no idea how to make the transform_tuple function work with anything other than a two element tuple. The '*' and '+' arithmetic operators have been defined to perform pairwise arithmetic between elements, but it may also make sense to define operators like "magic_iter + scalar" and "magic_iter += magic_iter". With the 'auto' keyword this would allow converting a bunch of STL containers into iterator objects which could then be manipulated mathematically as if they were Blitz++ arrays. /////////////////////////////////////////////// // magic_iter_demo.cpp /////////////////////////////////////////////// #include <magic_iter.h> #include <vector> #include <set> #include <iostream> #include <boost/foreach.hpp> #include <boost/lambda/lambda.hpp> using namespace boost::lambda; int main() { std::cout << "--- odd multiples of 10, reverse sorted\n"; std::vector<int> tmp; BOOST_FOREACH( int x, my::make_magic_counter(0, 10). filter(_1 & 1). transform<int>(_1 * 10). assign_to(tmp). // needed to allow sort sort(_1 > _2) ) { std::cout << x << std::endl; } std::cout << "--- unique elements of v*w, using zip\n"; std::vector<int> v; std::vector<double> w; my::make_magic_counter(0, 11). transform<int>(_1 - 5). assign_to(v). transform<double>(_1 * 0.01). assign_to(w); std::set<double> tmp2; zip(my::make_magic_iter(v), my::make_magic_iter(w)). transform_tuple<double>(_1 * _2). insert_into(tmp2). // uniq for_each(std::cout << _1 << "\n"); std::cout << "--- elements of v*w, using operator\n"; (my::make_magic_iter(v) * my::make_magic_iter(w)). for_each(std::cout << _1 << "\n"); } /////////////////////////////////////////////// // magic_iter.h /////////////////////////////////////////////// #ifndef MAGIC_ITER_H #define MAGIC_ITER_H #include <iterator> #include <algorithm> #include <boost/range/iterator_range.hpp> #include <boost/iterator/transform_iterator.hpp> #include <boost/iterator/filter_iterator.hpp> #include <boost/iterator/zip_iterator.hpp> #include <boost/iterator/counting_iterator.hpp> #include <boost/tuple/tuple.hpp> #include <boost/lambda/lambda.hpp> namespace my { // result_type_wrapper is from mailing list post by Maxim Yegorushkin template <class R, class F> struct result_type_wrapper : F { typedef R result_type; explicit result_type_wrapper(const F &f) : F(f) {} }; template <class R, class F> static inline result_type_wrapper<R, F> result_type(const F &f) { return result_type_wrapper<R, F>(f); } template <class R, class F> struct tuple_lambda_wrapper { typedef R result_type; explicit tuple_lambda_wrapper(const F &_f) : f(_f) { } template <class T> R operator()(const T &tuple_val) const { return f( boost::tuples::get<0>(tuple_val), boost::tuples::get<1>(tuple_val) ); } F f; }; template <class R, class F> static inline tuple_lambda_wrapper<R, F> tuple_lambda(const F &f) { return tuple_lambda_wrapper<R, F>(f); } template <class T> class magic_iter : public boost::iterator_range<T> { public: typedef typename std::iterator_traits<T>::value_type value_type; magic_iter(const T &_begin, const T &_end) : boost::iterator_range<T>(_begin, _end) { } template <class F> magic_iter<boost::transform_iterator<F, T> > transform(const F &f) { return magic_iter<boost::transform_iterator<F, T> >( boost::make_transform_iterator(this->begin(), f), boost::make_transform_iterator(this->end(), f) ); } template <class R, class F> magic_iter<boost::transform_iterator< result_type_wrapper<R, F>, T> > transform(const F &f) { return transform(result_type<R>(f)); } template <class R, class F> magic_iter<boost::transform_iterator< tuple_lambda_wrapper<R, F>, T> > transform_tuple(const F &f) { return transform(tuple_lambda<R>(f)); } template <class C> magic_iter<typename C::iterator> assign_to(C &container) { container.assign(this->begin(), this->end()); return make_magic_iter(container); } template <class C> magic_iter<typename C::iterator> insert_into(C &container) { container.insert(this->begin(), this->end()); return make_magic_iter(container); } template <class F> magic_iter<T> &sort(const F &comparator) { std::sort(this->begin(), this->end(), comparator); return *this; } template <class F> magic_iter<boost::filter_iterator<F, T> > filter(const F &f) { return magic_iter<boost::filter_iterator<F, T> >( boost::make_filter_iterator(f, this->begin(), this- >end()), boost::make_filter_iterator(f, this->end(), this->end()) ); } template <class F> void for_each(const F &f) { std::for_each(this->begin(), this->end(), f); } }; template <class T> magic_iter<typename T::iterator> make_magic_iter(T &container) { return magic_iter<typename T::iterator>(container.begin(), container.end()); } template <class T> magic_iter<typename T::iterator> make_magic_iter(const T &begin, const T &end) { return magic_iter<typename T::iterator>(begin, end); } template <class T> magic_iter<typename boost::counting_iterator<T> > make_magic_counter(const T &begin, const T &end) { return magic_iter<typename boost::counting_iterator<T> >( boost::counting_iterator<T>(begin), boost::counting_iterator<T>(end) ); } template <class A, class B> magic_iter<boost::zip_iterator<boost::tuple<A, B> > > zip(const magic_iter<A> &a, const magic_iter &b) { //return make_magic_iter( return magic_iter<boost::zip_iterator<boost::tuple<A, B> > >( boost::make_zip_iterator( boost::tuple<A, B>(a.begin(), b.begin()) ), boost::make_zip_iterator( boost::tuple<A, B>(a.end(), b.end()) ) ); } template <class X, class Y> struct tuple_multiply { typedef typename boost::lambda::return_type_2< boost::lambda::arithmetic_action< boost::lambda::multiply_action >, X, Y>::type result_type; result_type operator()(const boost::tuple<X, Y> &t) const { const X &x = boost::tuples::get<0>(t); const Y &y = boost::tuples::get<1>(t); return x*y; } }; template <class X, class Y> magic_iter<boost::transform_iterator< tuple_multiply<typename X::value_type, typename Y::value_type>, boost::zip_iterator<boost::tuple<X, Y> > > > operator*(magic_iter<X> x, magic_iter<Y> y) { //magic_iter<boost::zip_iterator<boost::tuple<X, Y> > > zi = zip(x, y); //return zi.transform(tuple_multiply<typename X::value_type, typename Y::value_type>()); tuple_multiply<typename X::value_type, typename Y::value_type> op; return zip(x, y).transform(op); } template <class X, class Y> struct tuple_plus { typedef typename boost::lambda::return_type_2< boost::lambda::arithmetic_action< boost::lambda::plus_action >, X, Y>::type result_type; result_type operator()(const boost::tuple<X, Y> &t) const { const X &x = boost::tuples::get<0>(t); const Y &y = boost::tuples::get<1>(t); return x+y; } }; template <class X, class Y> magic_iter<boost::transform_iterator< tuple_plus<typename X::value_type, typename Y::value_type>, boost::zip_iterator<boost::tuple<X, Y> > > > operator+(magic_iter<X> x, magic_iter<Y> y) { tuple_plus<typename X::value_type, typename Y::value_type> op; return zip(x, y).transform(op); } } // namespace my #endif // MAGIC_ITER_H

3 2

[wave] limited extensibility
by Christopher Lux 07 Feb '10

07 Feb '10

Hi, i am trying to use boost.wave as a preprocessor for OpenGL Shading Language shader files (GLSL). GLSL uses a limited C/C++ preprocessor (no included etc.). I want to use boost.wave to handle the includes correctly besides generally gaining a more powerful preprocessor. Now the problem is that there a special preprocessor directives in GLSL that the compiler itself has to handle. I am speaking of the #version and #extension directives. I hoped boost.wave would provide the possibility to add special directives that the client code then can handle properly. Currently I use the context hook as follows: class glsl_preprocessing_hook : public boost::wave::context_policies::default_preprocessing_hooks { public: template <typename ContextT> void throw_exception(ContextT const &ctx, std::exception const& e) { throw e; } template <typename ContextT> void throw_exception(ContextT const &ctx, boost::wave::preprocess_exception const& e) { // just ignore ill formed directives (version, exception...) and let the glsl compiler handle these if(e.get_errorcode() != boost::wave::preprocess_exception::ill_formed_directive) { throw e; } } }; This just ignores the ill formed directives, but may still let unwanted errors through. Would it be possible to extend boost.wave in a way to be able feed the lexer or context regular expressions of the new custom directives? These could be pushed into a special hook method with the appropriate context information. I think this functionality would greatly increase the usability for C++ like languages with custom extensions to the preprocessor. Regards -chris

2 4

[chrono] v0.3.1 Support for wide characters
by vicente.botet 07 Feb '10

07 Feb '10

Hi, this new version includes: * Added support for wide characters on formatters. * Added chrono.hpp and stopwatches.hpp header files at the boost level. * Update of the doc taking care of preceding comments. Comments are welcome :) Best, Vicente ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost(a)lists.boost.org>; <boost-users(a)lists.boost.org> Sent: Sunday, January 17, 2010 9:14 PM Subject: [chrono] v0.3 New Stopwatch Feature Hi, I'm pleased to announce the new version of the Boost.Chrono library. The implementaton is quite stable; the new interface could suffer of some modifications, renaming, ... as far as you submit some proposals. I would request a formal review soon and I will need a review manager. I know that review managers are hard to find, so if you are interested in the library, please the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. I've tested it with gcc and MSVC. Previoous version of the library have been testted on Mac, but I'm not able to test this platform. Could someone check if there are some regressions on Mac? New Features: * Process cpu clocks * Independent process cpu clocks for real, user, system process CPU time * Global process cpu clock for real, user, system process CPU time * Stopwatch concept measuring elapsed time between different points in time associated to the operations start, stop, suspend and resume. * stopwatch is a model Stopwatch measuring the elapsed time between the start and the stop operations. * stopwatch_accumulator is a model Stopwatch allowing to accumulate several time samples and give the average, ... * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopwatch Formatter concept * stopwatch formatter "%ds\n" * stopwatch accumulator formatter "%c times, sum%ss, min%ms, max%Ms, mean%as\n" * time formatter "real %rs, cpu %cs (%p%), user %us, system %ss\n" * digital_time decomposition class separating days, hours,minutes,seconds, nanoseconds from any duration class (looking for a better name) * digital_time formatter "%d days(s) %h:%m:%s.%n\n" * stopwatch_reporter is a convenient generic class reporting elapsed time for the Stopwatch concept. * stopclock<Clock> shortcut stopwatch_reporter<stopwatch<Clcok>> * typeof registration for classes duration and time_point Depreceated Features: * The classes process_times, process_clock, process_timer, timer and run_timer are now deprecated as the preceding additions are more generic. However for backward compatibility they are preserved until inclusion of the library in Boost. Next follows the equivalences: timer<> ~ stopwatch<> process_timer ~ stopwatch<process_cpu_clock> run_timer ~ stopclock<> Bug Fixes * Try to correct warning C4251: 'boost::chrono::run_timer::m_format' : class 'std::basic_string<_Elem,_Traits,_Ax>' needs to have dll-interface to be used by clients of class 'boost::chrono::run_timer', by don't including inlines functions using the std::string m_format. For people that doesn't know it yet, Boost.Chrono library provides: * The C++0x Standard Library's common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * typeof registration for classes duration and time_point * Process clocks: * process_real_CPU_clocks, capturing real-CPU times. * process_user_CPU_clocks, capturing user-CPU times. * process_system_CPU_clocks, capturing system-CPU times. * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. * Stopwatches: * stopwatch, capturing elapsed Clock times. * stopwatch_accumulator, capturing cummulated elapsed Clock times. * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopclocks or Stopwatch reporters: * stopwatch_reporter, convenient reporting of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Best regards, _____________________ Vicente Juan Botet Escribá

7 9

[thread] small futures patch
by Christopher Lux 07 Feb '10

07 Feb '10

Hi, i came across an annoying compiler warning when using boost.thread (1.42 release) in a 64bit environment. Attached is a small patch for the futures.hpp in the trunk. Regards -chris

1 0

BoostCon 2010 tentative, fully scheduled program available
by Hartmut Kaiser 06 Feb '10

06 Feb '10

Hey all, The first tentative, fully scheduled program for BoostCon 2010 is now available at http://www.boostcon.com/program. We're quite fond of this program and we believe it contains something for almost everybody. We hope to convince you to join us at BoostCon 2010, May 10-14th, in the beautiful Aspen. For registration, accommodation, and more information please visit the conference website at http://www.boostcon.com. Please note the reduced early registration fee! Regards Hartmut Program Chair BoostCon 2010 --------------- Meet me at BoostCon www.boostcon.com

1 0

Link errors in copy_exception_test
by Emil Dotchevski 05 Feb '10

05 Feb '10

Can someone help me figure out what's the problem with the copy_exception_test from Boost Exception on this test site: http://tinyurl.com/yzjo8v4 Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

1 0

Utility/swap test error: LNK1561: entry point must be defined
by Kevin Li 05 Feb '10

05 Feb '10

Hi there, I got linking failures (fatal error LNK1561: entry point must be defined) with some of the Utility/swap tests. There is a test_main function in the source file, and the test application statically links to the Boost library. It seems that the Utility/swap tests try to link to boost_test_exec_monitor library. I have the library "libboost_test_exec_monitor-vc90-mt-1_41.lib" ready. I have no idea why the linking does not work. Is the problem with this library? I would appreciate any helps with this. The Ja Thanks in advance, Kevin _________________________________________________________________

2 2

Re: [boost] problems with recursive_timed_mutex and scoped lock wont compile in version 1.39
by amillet 05 Feb '10

05 Feb '10

did you find a solution for this compilation errror ? regards Clark Sims-2 wrote: > > I can compile the following code fine in boost 1.33.1 but it generates > compiler errors > in version 1.39. I am using visual studio 2005. > > I will post the code, and then post the compiler errors: > > #include <iostream> > #include <boost/thread/thread.hpp> > #include <boost/thread/xtime.hpp> > #include <boost/thread/recursive_mutex.hpp> > > using namespace std; > //using namespace boost; > using boost::mutex; > using boost::thread; > using boost::recursive_timed_mutex; > using boost::xtime; > > boost::recursive_timed_mutex hello_mutex; > > void hello( int thread_id, int iter) { > cerr << thread_id << " : " << iter << endl; > } > > > void rand_xtime( xtime* xt) { > xtime_get( xt, boost::TIME_UTC); > //xt.nsec += (rand() % 1000000000); > xt->sec += 1 + rand()%5; > } > > void say_hello( int thread_id) { > for (int iter=0; iter<5; iter++) { > xtime xt; > rand_xtime( &xt); > thread::sleep(xt); > rand_xtime( &xt); > { > recursive_timed_mutex &refer_hello = hello_mutex; > const xtime& refer_xt = xt; > recursive_timed_mutex::scoped_timed_lock > lock1( refer_hello, refer_xt); > if (lock1) { > hello( thread_id, iter); > } > } > } > } > > void hello1() { > say_hello( 1); > } > > void hello2() { > say_hello( 2); > } > > int main() { > boost::thread thrd1(hello1); > boost::thread thrd2(hello2); > > thrd1.join(); > thrd2.join(); > > return 0; > } > > Microsoft (R) Program Maintenance Utility Version 8.00.50727.42 > Copyright (C) Microsoft Corporation. All rights reserved. > > Warning: cannot find Makefile.TimedMutex.dep > cl.exe /nologo /Ob0 /W3 /EHs /MD /GR /I ".." /D NDEBUG /D WIN32 /D > _CONSOLE /FD /c /Fo"Release\TimedMutex\I386\TimedMutex.obj" > "TimedMutex.cpp" > TimedMutex.cpp > c:\boost_1_39\boost\thread\win32\basic_recursive_mutex.hpp(64) : error > C2679: binary '+' : no operator found which takes a right-hand operand of > type 'const boost::xtime' (or there is no acceptable conversion) > > c:\boost_1_39\boost/date_time/posix_time/date_duration_operators.hpp(31): > could be 'boost::posix_time::ptime boost::posix_time::operator +(const > boost::posix_time::ptime &,const boost::gregorian::months &)' [found using > argument-dependent lookup] > c:\boost_1_39\boost/date_time/date_duration_types.hpp(132): or > 'boost::gregorian::date > boost::date_time::months_duration<base_config>::operator +(const > boost::gregorian::date &,const > boost::date_time::months_duration<base_config> &)' [found using > argument-dependent lookup] > with > [ > base_config=boost::gregorian::greg_durations_config > ] > > c:\boost_1_39\boost/date_time/posix_time/date_duration_operators.hpp(75): > or 'boost::posix_time::ptime boost::posix_time::operator +(const > boost::posix_time::ptime &,const boost::gregorian::years &)' [found using > argument-dependent lookup] > c:\boost_1_39\boost/date_time/date_duration_types.hpp(244): or > 'boost::gregorian::date > boost::date_time::years_duration<base_config>::operator +(const > boost::gregorian::date &,const > boost::date_time::years_duration<base_config> &)' [found using > argument-dependent lookup] > with > [ > base_config=boost::gregorian::greg_durations_config > ] > c:\boost_1_39\boost/date_time/time.hpp(139): or > 'boost::posix_time::ptime > boost::date_time::base_time<T,time_system>::operator +(const > boost::gregorian::date_duration &) const' > with > [ > T=boost::posix_time::ptime, > time_system=boost::posix_time::posix_time_system > ] > c:\boost_1_39\boost/date_time/time.hpp(159): or > 'boost::posix_time::ptime > boost::date_time::base_time<T,time_system>::operator +(const > boost::posix_time::time_duration &) const' > with > [ > T=boost::posix_time::ptime, > time_system=boost::posix_time::posix_time_system > ] > while trying to match the argument list '(boost::system_time, > const boost::xtime)' > c:\boost_1_39\boost/thread/locks.hpp(364) : see reference to > function template instantiation 'bool > boost::detail::basic_recursive_mutex_impl<underlying_mutex_type>::timed_lock<boost::xtime>(const > Duration &)' being compiled > with > [ > underlying_mutex_type=boost::detail::basic_timed_mutex, > Duration=boost::xtime > ] > c:\boost_1_39\boost/thread/locks.hpp(363) : while compiling class > template member function 'bool boost::unique_lock<Mutex>::timed_lock(const > boost::xtime &)' > with > [ > Mutex=boost::recursive_timed_mutex > ] > TimedMutex.cpp(36) : see reference to class template instantiation > 'boost::unique_lock<Mutex>' being compiled > with > [ > Mutex=boost::recursive_timed_mutex > ] > NMAKE : fatal error U1077: '"c:\Program Files\Microsoft Visual Studio > 8\VC\BIN\cl.exe"' : return code '0x2' > Stop. > > > > > > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost > > -- View this message in context: http://old.nabble.com/problems-with-recursive_timed_mutex-and-scoped-lock-w… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

linear algebra library... again
by DE 04 Feb '10

04 Feb '10

"Yeah, well... I'm gonna go build my own theme park, with blackjack and hookers. In fact, forget the park!" it seems the previous message has not reached the list i hope this will i present you an almost finished linear algebra library called BIBLAL there are some aspects of matrix algebra implemented as well the sources and docs are in the vault:/linalg/ http://www.boostpro.com/vault/index.php?direction=0&order=&directory=linalg& to this moment the core of the library is fully working it turned out to be almost 100% the way i originally intended so i'm very happy about it there are some minor details to implement as well as some usefull features to add but this seems trivial when the core is finished although i think a linear algebra lib should never be part of the standard, the boost collection of libraries will certainly benefit from its inclusion to complement ublas i'm open to questions, criticism and suggestions -- Pavel

4 9

[1.42] PDF documentation build available.
by John Maddock 04 Feb '10

04 Feb '10

Documentation for those Boost libraries that can have their documentation built as PDF is now available from the usual SF download page: https://sourceforge.net/projects/boost/files/ Individual links are: https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (26Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (25Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (24Mb) https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_… (23Mb) Enjoy! John.

1 0

[1.42.0][integer] Compilation error in MS VS 2005
by Adam Badura 04 Feb '10

04 Feb '10

Problem described by Ticket #3657 was solved by version 1.42 only for Visual Studio 2008. In Visual Studio 2005 it still exists. So I reopened the bug with appropriate description (https://svn.boost.org/trac/boost/ticket/3657#comment:2) Is it possible to release 1.42.1 version correcting the bug? Or do I have to wait again 2 months (at least) for 1.43 which will (possibly) solve the bug? I still have to use 1.39 since starting from 1.40 there are problems with Integer library. Adam Badura

2 2

[serialization] basic_binary_oarchive.hpp asserts are no longer necessary
by Number Cruncher 04 Feb '10

04 Feb '10

I've just tried building my code against 1.42 and am encountering numerous warnings of the sort: boost/archive/basic_binary_oarchive.hpp:95: warning: comparison is always true due to limited range of data type I've checked the difference to the 1.41 release and noticed that boost/archive/basic_archive.hpp now uses BOOST_ARCHIVE_STRONG_TYPEDEF for class_id_type etc. and uses int_least16_t rather than "int". This is causing my GCC 4.1.2 compiler to produce the above warning because the assertion "t.t <= boost::integer_traits<boost::int_least16_t>::const_max" is always true when t.t *is* an int_least16_t The attached patch removes the (now redundant) asserts.

2 2

[1.42] The PDF build of the docs for the 1.42 BETA available
by John Maddock 04 Feb '10

04 Feb '10

The PDF build of the docs for 1.42 BETA are now available for download from the sourceforge download page https://sourceforge.net/projects/boost/files/boost-docs/1.42.0/boost_pdf_1_…. Please let me know if you spot any issues, Thanks, John Maddock.

2 1

[gil] trac #3619
by Christian Henning 03 Feb '10

03 Feb '10

Hi there, could someone please tell whether or not this bug still exists. I don't have access to gcc 4.4. This is marked as a showstopper and I would like to get rid of it. Is it a compiler bug maybe? Thanks, Christian

2 1

[multi_index][serialization] save_construct_data not called for multi_index collection
by Felipe Magno de Almeida 03 Feb '10

03 Feb '10

Hi, Boost.Serialization has support for non-default classes using save_construct_data and load_construct_data overloads. These are called before serialization to save and load information that's important for the construction of the object. Unfortunately, multi_index doesn't call these functions when serializing, so serialization of non-default-constructible classes is impossible with multi_index. I wanted to patch it so that it becomes possible, but to be honest I'm a bit lost in the serialization code for multi_index. collections_save_impl calls boost::serialization::save_construct_data_adl before serializing each item in the collection. I'm using boost 1.38.0, is there anyway to do the same for multi_index? Thanks in advance, -- Felipe Magno de Almeida

4 8

errors in Math Toolkit documentation
by Shawn Pautz 03 Feb '10

03 Feb '10

The documentation for the Poisson distribution in boost/math/distributions (http://www.boost.org/doc/libs/1_41_0/libs/math/doc/sf_and_dist/html/math_to…) contains a few errors. In the middle of the page is a bar graph depicting the Poisson distribution for several values of lambda. The one labeled for lambda=1 is actually the distribution for lambda=5. Similarly the one labeled as lambda=50 appears to be generated for lambda=20 instead. Please check this and correct as needed. Shawn Pautz

2 1

[1.42.0] Release candidates available
by Beman Dawes 02 Feb '10

02 Feb '10

Release candidates for 1.42.0 are available at http://boost.cowic.de/rc/ We need some reality checks before pushing these out to SourceForge. Please download, do a build, and report results here. Also let us know if you spot any problems or have any other comments. Thanks, --Beman PS: I've already downloaded and tried the .zip file on Windows. No problems.

6 10

Boost release 1.42.0 available
by Beman Dawes 02 Feb '10

02 Feb '10

Release 1.42.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library and numerous bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_42_0 The release can also be downloaded directly from SourceForge. See http://sourceforge.net/projects/boost/files/ To install this release on your system, see http://www.boost.org/doc/libs/1_42_0/more/getting_started/index.html Thanks, --The Boost release team

1 0

[property_tree][log] Error compiling with Visual C++ 2010 Beta 2
by Fulvio Esposito 02 Feb '10

02 Feb '10

Hi all, I'm currently experimenting with Visual C++ 2010 Beta 2. I've found compilation problems related to property_tree and log libraries. Hope it's not a problem to send a single post for two libraries. Boost.PropertyTree: the simplest program: #include "stdafx.h" #include <boost/property_tree/ptree.hpp> int _tmain(int argc, _TCHAR* argv[]) { boost::property_tree::ptree tree; return 0; } generate the error: c:\users\fulvio\sviluppo\boost_1_41_0\boost\property_tree\detail\ptree_implementation.hpp(30): error C2440: 'specialization' : cannot convert from 'const std::string std::_Pair_base<_Ty1,_Ty2>::* ' to 'const std::basic_string<_Elem,_Traits,_Ax> std::pair<_Ty1,_Ty2>::* ' 1> with 1> [ 1> _Ty1=const std::string, 1> _Ty2=boost::property_tree::basic_ptree<std::string,std::string> 1> ] 1> and 1> [ 1> _Elem=char, 1> _Traits=std::char_traits<char>, 1> _Ax=std::allocator<char>, 1> _Ty1=const std::string, 1> _Ty2=boost::property_tree::basic_ptree<std::string,std::string> 1> ] 1> Standard conversion from pointer-to-member of base to pointer-to-member of derived is not applied for template arguments 1> c:\users\fulvio\sviluppo\boost_1_41_0\boost\property_tree\detail\ptree_implementation.hpp(159) : see reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>::subs' being compiled 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] 1> c:\users\fulvio\sviluppo\boost_1_41_0\boost\property_tree\detail\ptree_implementation.hpp(159) : while compiling class template member function 'boost::property_tree::basic_ptree<Key,Data>::basic_ptree(void)' 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] 1> d:\documenti\visual studio 2010\projects\testpropertytree\testpropertytree\testpropertytree.cpp(9) : see reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>' being compiled 1> with 1> [ 1> Key=std::string, 1> Data=std::string 1> ] Boost.Log The compilation with bjam gives the error: libs\log\src\filter_parser.cpp(149) : error C2668: 'std::tr1::bind' : ambiguous call to overloaded function C:\Program Files\Microsoft Visual Studio 10.0\VC\INCLUDE\xxbind1(363): could be 'std::tr1::_Bind<_Result_type,_Ret,_BindN> std::tr1::bind<void,const std::basic_string<_Elem,_Traits,_Ax>&,double,boost::function1<R,T0>&,boost::reference_wrapper<T>,boost::arg,boost::reference_wrapper<boost::function1<R,T0>>>(_Rx (__cdecl *const )(_Farg0,_Farg1,_Farg2),_Arg0,_Arg1,_Arg2)' [found using argument-dependent lookup] with [ _Result_type=void, _Ret=void, _BindN=std::tr1::_Bind3<std::tr1::_Callable_fun<void (__cdecl *const )(const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,double,boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &),false>,boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>,boost::arg<1>,boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>>>, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, R=bool, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, T=const std::basic_string<char,std::char_traits<char>,std::allocator<char>>, I=1, _Rx=void, _Farg0=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, _Farg1=double, _Farg2=boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &, _Arg0=boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>, _Arg1=boost::arg<1>, _Arg2=boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>> ] C:\Users\Fulvio\Sviluppo\boost_1_41_0\boost/bind/bind_cc.hpp(46): or 'boost::_bi::bind_t<R,F,L> boost::bind<void,const std::basic_string<_Elem,_Traits,_Ax>&,double,boost::function1<bool,T0>&,boost::reference_wrapper<T>,boost::arg,boost::reference_wrapper<boost::function1<bool,T0>>>(R (__cdecl *)(B1,B2,B3),A1,A2,A3)' with [ R=void, F=void (__cdecl *)(const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,double,boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &), L=boost::_bi::list3<boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>,boost::arg<1>,boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>>>, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, T=const std::basic_string<char,std::char_traits<char>,std::allocator<char>>, I=1, B1=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, B2=double, B3=boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> &, A1=boost::reference_wrapper<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>, A2=boost::arg<1>, A3=boost::reference_wrapper<boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &>> ] while trying to match the argument list '(overloaded-function, const boost::reference_wrapper<T>, boost::arg, const boost::reference_wrapper<T>)' with [ T=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> ] and [ I=1 ] and [ T=boost::function1<bool,const boost::log_mt_nt5::basic_attribute_values_view<char> &> ] libs\log\src\filter_parser.cpp(87) : see reference to function template instantiation 'boost::function1<R,T0> boost::log_mt_nt5::`anonymous-namespace'::default_filter_factory<CharT>::parse_argument<boost::log_mt_nt5::aux::equal_to>(const std::basic_string<_Elem,_Traits,_Ax> &,const std::basic_string<_Elem,_Traits,_Ax> &)' being compiled with [ R=bool, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, CharT=char, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] libs\log\src\filter_parser.cpp(86) : while compiling class template member function 'boost::function1<R,T0> boost::log_mt_nt5::`anonymous-namespace'::default_filter_factory<CharT>::on_equality_relation(const std::basic_string<_Elem,_Traits,_Ax> &,const std::basic_string<_Elem,_Traits,_Ax> &)' with [ R=bool, T0=const boost::log_mt_nt5::basic_attribute_values_view<char> &, CharT=char, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] libs\log\src\filter_parser.cpp(208) : see reference to class template instantiation 'boost::log_mt_nt5::`anonymous-namespace'::default_filter_factory<CharT>' being compiled with [ CharT=char ] libs\log\src\filter_parser.cpp(530) : see reference to class template instantiation 'boost::log_mt_nt5::`anonymous-namespace'::filters_repository<CharT>' being compiled with [ CharT=char ] libs\log\src\filter_parser.cpp(569) : see reference to function template instantiation 'void boost::log_mt_nt5::register_filter_factory<char>(const char *,const boost::shared_ptr<T> &)' being compiled with [ T=boost::log_mt_nt5::filter_factory<char> ] In this case I belive that an explicit namespace qualification could solve. Fulvio Esposito

3 2

crash in boost serialization 1.41
by Est 02 Feb '10

02 Feb '10

Hi All I'm developing an image processing app. In my app, I serialize a boost::ptr_vector of an abstract base class to a polymorphic xml archive. I checked all my polymorphic classes are exported with BOOST_SERIALIZATION_EXPORT and BOOST_SERIALIZATION_ASSUME_ABSTRACT for abstract classes, and it's working correctly with boost 1.38. If I update to boost 1.41, I can save archives without problems. When I try to load the resulting archive, I get a crash: Program received signal EXC_BAD_ACCESS, Could not access memory. Reason: KERN_PROTECTION_FAILURE at address: 0x00000000 boost::archive::detail::basic_iarchive_impl::load_pointer (this=0x1b955a00, ar=@0xbfffe598, t=@0xbfffd8d0, bpis_ptr=0x0) at libs/serialization/src/basic_iarchive.cpp:429 429 class_id_type new_cid = register_type(bpis_ptr->get_basic_serializer()); I can read the archive with my app compiled with boost 1.38. I'm using gcc 4.0.1 on OSX and gcc 4.3 on linux, all 32 bits. I'm not using DLLs. I ran the unit tests of the serialization library. All passed. I'm in the process of extracting a small example that reproduces the crash. Do you have any idea how can I fix it? Thank you. Est. Here is the backtrace: node_t is my abstract base class. #0 boost::archive::detail::basic_iarchive_impl::load_pointer (this=0x1b955a00, ar=@0xbfffe598, t=@0xbfffd8d0, bpis_ptr=0x0) at libs/serialization/src/basic_iarchive.cpp:429 #1 0x005a5506 in boost::archive::detail::basic_iarchive::load_pointer (this=0x0, t=@0x0, bpis_ptr=0x0) at libs/serialization/src/basic_iarchive.cpp:538 #2 0x00043f2e in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_pointer (this=0xbfffe58c, t=@0xbfffd8d0, bpis_ptr=0x0) at polymorphic_iarchive_route.hpp:65 #3 0x0003d0f9 in boost::archive::detail::load_pointer_type<boost::archive::polymorphic_iarchive>::invoke<ramen::node_t*> (ar=@0xbfffe58c, t=@0xbfffd8d0) at iserializer.hpp:486 #4 0x0003d157 in boost::archive::load<boost::archive::polymorphic_iarchive, ramen::node_t*> (ar=@0xbfffe58c, t=@0xbfffd8d0) at iserializer.hpp:554 #5 0x0003d1a6 in boost::archive::polymorphic_iarchive_impl::load_override<ramen::node_t*> (this=0xbfffe58c, t=@0xbfffd8d4) at polymorphic_iarchive.hpp:137 #6 0x0003d1f8 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<ramen::node_t*> const> (this=0xbfffe58c, t=@0xbfffd8d4) at interface_iarchive.hpp:61 #7 0x0003d253 in boost::ptr_container_detail::load_helper<boost::archive::polymorphic_iarchive, boost::ptr_container_detail::sequence_config<ramen::node_t, std::vector<void*, std::allocator<void*> > >, boost::heap_clone_allocator> (ar=@0xbfffe58c, c=@0x193b1bd8, n=1) at detail/serialize_reversible_cont.hpp:52 #8 0x0003d2e9 in boost::serialization::load<boost::archive::polymorphic_iarchive, ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > (ar=@0xbfffe58c, c=@0x193b1bd8) at serialize_ptr_vector.hpp:28 #9 0x0003d327 in boost::serialization::free_loader<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > >::invoke (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_free.hpp:58 #10 0x0003d349 in boost::serialization::split_free<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_free.hpp:74 #11 0x0003d36b in boost::serialization::serialize<boost::archive::polymorphic_iarchive, ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > (ar=@0xbfffe58c, c=@0x193b1bd8, version=0) at serialize_ptr_vector.hpp:34 #12 0x0003d3a9 in boost::serialization::serialize_adl<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:133 #13 0x0003d456 in boost::archive::detail::iserializer<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > >::load_object_data (this=0xbcc2f0, ar=@0xbfffe598, x=0x193b1bd8, file_version=0) at iserializer.hpp:173 #14 0x005a5423 in boost::archive::object_id_type::operator= () at basic_archive.hpp:390 #15 0x005a5423 in boost::archive::detail::basic_iarchive_impl::load_object () at libs/serialization/src/basic_iarchive.cpp:391 #16 0x005a5423 in boost::archive::detail::basic_iarchive::load_object (this=0xbfffe598, t=0x193b1bd8, bis=@0xbcc2f0) at libs/serialization/src/basic_iarchive.cpp:529 #17 0x00043f0a in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_object (this=0xbfffe58c, t=0x193b1bd8, bis=@0xbcc2f0) at polymorphic_iarchive_route.hpp:59 #18 0x00039f93 in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::load_standard::invoke<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:363 #19 0x00039fbc in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::invoke<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:415 #20 0x00039fdb in boost::archive::load<boost::archive::polymorphic_iarchive, boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:554 #21 0x0003a02a in boost::archive::polymorphic_iarchive_impl::load_override<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > (this=0xbfffe58c, t=@0xbfffdbc4) at polymorphic_iarchive.hpp:137 #22 0x0003a07c in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > const> (this=0xbfffe58c, t=@0xbfffdbc4) at interface_iarchive.hpp:61 #23 0x0003a0ac in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator&<boost::serialization::nvp<boost::ptr_vector<ramen::node_t, boost::heap_clone_allocator, std::allocator<void*> > > const> (this=0xbfffe58c, t=@0xbfffdbc4) at interface_iarchive.hpp:68 #24 0x0003aa49 in ramen::dataflow::graph<ramen::node_t>::load<boost::archive::polymorphic_iarchive> (this=0x193b1bd8, ar=@0xbfffe58c, version=0) at graph.hpp:168 #25 0x0003ab9b in boost::serialization::access::member_load<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at access.hpp:101 #26 0x0003abbd in boost::serialization::detail::member_loader<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> >::invoke (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_member.hpp:54 #27 0x0003abdf in boost::serialization::split_member<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at split_member.hpp:69 #28 0x0003ac01 in ramen::dataflow::graph<ramen::node_t>::serialize<boost::archive::polymorphic_iarchive> (this=0x193b1bd8, ar=@0xbfffe58c, file_version=0) at graph.hpp:175 #29 0x0003ac23 in boost::serialization::access::serialize<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at access.hpp:109 #30 0x0003ac45 in boost::serialization::serialize<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:74 #31 0x0003ac83 in boost::serialization::serialize_adl<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:133 #32 0x0003ad30 in boost::archive::detail::iserializer<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> >::load_object_data (this=0xbcc260, ar=@0xbfffe598, x=0x193b1bd8, file_version=0) at iserializer.hpp:173 #33 0x005a5423 in boost::archive::object_id_type::operator= () at basic_archive.hpp:390 #34 0x005a5423 in boost::archive::detail::basic_iarchive_impl::load_object () at libs/serialization/src/basic_iarchive.cpp:391 #35 0x005a5423 in boost::archive::detail::basic_iarchive::load_object (this=0xbfffe598, t=0x193b1bd8, bis=@0xbcc260) at libs/serialization/src/basic_iarchive.cpp:529 #36 0x00043f0a in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_object (this=0xbfffe58c, t=0x193b1bd8, bis=@0xbcc260) at polymorphic_iarchive_route.hpp:59 #37 0x000365fb in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::load_standard::invoke<ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:363 #38 0x00036624 in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::invoke<ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:415 #39 0x00036643 in boost::archive::load<boost::archive::polymorphic_iarchive, ramen::dataflow::graph<ramen::node_t> > (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:554 #40 0x00036692 in boost::archive::polymorphic_iarchive_impl::load_override<ramen::dataflow::graph<ramen::node_t> > (this=0xbfffe58c, t=@0xbfffdf8c) at polymorphic_iarchive.hpp:137 #41 0x000366e4 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<ramen::dataflow::graph<ramen::node_t> > const> (this=0xbfffe58c, t=@0xbfffdf8c) at interface_iarchive.hpp:61 #42 0x00036714 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator&<boost::serialization::nvp<ramen::dataflow::graph<ramen::node_t> > const> (this=0xbfffe58c, t=@0xbfffdf8c) at interface_iarchive.hpp:68 #43 0x0002c3fb in ramen::composition_t::serialize (this=0x193b1bd8, ar=@0xbfffe58c, version=0) at /Users/est/Devel/ramen/trunk/ramen/app/composition.cpp:193 #44 0x0004570f in boost::serialization::access::serialize<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at access.hpp:109 #45 0x00048387 in boost::serialization::serialize<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:74 #46 0x0004574f in boost::serialization::serialize_adl<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8, file_version=0) at serialization.hpp:133 #47 0x00048436 in boost::archive::detail::iserializer<boost::archive::polymorphic_iarchive, ramen::composition_t>::load_object_data (this=0xbcc410, ar=@0xbfffe598, x=0x193b1bd8, file_version=0) at iserializer.hpp:173 #48 0x005a5423 in boost::archive::object_id_type::operator= () at basic_archive.hpp:390 #49 0x005a5423 in boost::archive::detail::basic_iarchive_impl::load_object () at libs/serialization/src/basic_iarchive.cpp:391 #50 0x005a5423 in boost::archive::detail::basic_iarchive::load_object (this=0xbfffe598, t=0x193b1bd8, bis=@0xbcc410) at libs/serialization/src/basic_iarchive.cpp:529 #51 0x00043f0a in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::load_object (this=0xbfffe58c, t=0x193b1bd8, bis=@0xbcc410) at polymorphic_iarchive_route.hpp:59 #52 0x0004835f in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::load_standard::invoke<ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:363 #53 0x00043692 in boost::archive::detail::load_non_pointer_type<boost::archive::polymorphic_iarchive>::invoke<ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:415 #54 0x000436b1 in boost::archive::load<boost::archive::polymorphic_iarchive, ramen::composition_t> (ar=@0xbfffe58c, t=@0x193b1bd8) at iserializer.hpp:554 #55 0x00043700 in boost::archive::polymorphic_iarchive_impl::load_override<ramen::composition_t> (this=0xbfffe58c, t=@0xbfffe5c8) at polymorphic_iarchive.hpp:137 #56 0x00043752 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator>><boost::serialization::nvp<ramen::composition_t> const> (this=0xbfffe58c, t=@0xbfffe5c8) at interface_iarchive.hpp:61 #57 0x00043782 in boost::archive::detail::interface_iarchive<boost::archive::polymorphic_iarchive>::operator&<boost::serialization::nvp<ramen::composition_t> const> (this=0xbfffe58c, t=@0xbfffe5c8) at interface_iarchive.hpp:68 #58 0x0004379c in boost::archive::detail::polymorphic_iarchive_route<boost::archive::naked_xml_iarchive>::operator&<boost::serialization::nvp<ramen::composition_t> const> (this=0xbfffe58c, t=@0xbfffe5c8) at polymorphic_iarchive_route.hpp:173

1 1

metaprogramming: associating a type with another type
by DE 02 Feb '10

02 Feb '10

hi boosters while solving my own design problems i accidentally discovered an interesting technique let's assume we want to associate some value (a type) to a newly created type so we can easily access the associated type during metaprogramming let's call the associated type a property then we have the following property types: struct property0 {}; struct property1 {}; struct property2 {}; now we want to access the associated property for an arbitrary type in a natural traits manner: property<arbitrary_type>::type it appears we can implement it almost trivially (if know how) (let's assume we have portable typeof() facility) consider the code //the return type of this function appears to be the default property template<typename type> property0 get_prop(type*); //do not implement! template<typename t> struct property { typedef typeof(get_prop((type*)42) type; }; template<typename type, typename p = typename property<type>::type> struct base { friend p get_prop(type*) { return p(); } }; template<typename type> void foo(const base<type>&) //handles ALL types derived from base { typedef typename property<type>::type associated_property; } template<typename type> void bar(const base<type, property2>&) //handles ONLY types with property2 {} struct s : public expression<s> //default property used here {}; struct s1 : public expression<s1, property1> {}; struct s2 : public expression<s2, property2> {}; int main() { foo(s()); foo(s1()); foo(s2()); //bar(s()); //should not compile //bar(s1()); //should not compile bar(s2()); return 0; } even with the lack of typeof(), given a fixed set of properties it is very easy to implement this technique see working example at http://codepad.org/qXkESprl personally i see it as extremely useful for generic lib writers for some designes (of course if appropriately applied) as well as for users of such libs i would appreciate any thoughts on improvement of this technique within C++98 standard also any thoughts on portability are welcome if you have questions about how and/or why does it work feel free to ask -- Pavel

5 17

Macro redefinition in boost/cstdint.hpp (1.42 beta1)
by Vemund Handeland 02 Feb '10

02 Feb '10

I've tested my code with the 1.42 beta, and get a lot of macro redefinition warnings on my system (msvc-9.0) The problem is redefinition of INT64_C and UINT64_C in boost/cstdint.hpp. My code also includes the ICU library, and these two macros are already defined in the ICU headers. The problem then comes down to header include order... I see that the updated boost/cstdint.hpp only test !defined(INT8_C) before defining all INT#_C and UNIT#_C macros The solution to my problem is to test for existence on every macro before definition: #ifndef INT#_C #define INT#_C( value ) ... #endif Is this appropriate fix, and should I add a ticket for this? -Vemund

3 2

[thread][hpux][1.3.9]/usr/lib/dld.sl: Unresolved symbol: pthread_create (code)
by gopal haldar 02 Feb '10

02 Feb '10

Hi I am using boost 1.3.9 thread library for all platform(Windows and non-windows). Same code is runing in all platform but for HPUX, I am getting the following error during runtime. /usr/lib/dld.sl: Unresolved symbol: pthread_create (code) from /opt/bst/lib/libboost_thread.sl ABORT instruction (core dumped). But it is working fine with boost library 1.3.2. Please let me know the solution of this problem. Regards Gopal

2 1

[transaction] New Boost.Transaction library under discussion
by vicente.botet 02 Feb '10

02 Feb '10

Hi Stefan, Bob, I've created in the sandbox the transaction directory (http://svn.boost.org/svn/boost/sandbox/transaction/) so we can share our work. I've created also a wiki page (http://svn.boost.org/trac/boost/wiki/BoostTransaction) on which we can compile the result of our discussions, requirements for the library, design, ... If you don't have right access to the Boost wiki pages, please request them throught this ML. Of course, anyone is welcome to participate, or comment on this wiki. HTH, _____________________ Vicente Juan Botet Escribá

8 42

[Serialization] seg fault with BOOST_CLASS_EXPORT
by fab 01 Feb '10

01 Feb '10

Hi, Simply by adding BOOST_CLASS_EXPORT(MyClass), all executables, unit tests, etc. which compile with this class failed at the end of the execution with a seg fault. All the process is done but the application exit with a seg fault. I encounter this problem with some classes and not with others... I don't understand where the error comes from and I don't arrived to reproduce on a simple test. Best regards, Fabien Castan Program received signal SIGSEGV, Segmentation fault. strcmp () at ../sysdeps/i386/i686/strcmp.S:40 40 ../sysdeps/i386/i686/strcmp.S: Aucun fichier ou dossier de ce type. in ../sysdeps/i386/i686/strcmp.S Current language: auto The current source language is "auto; currently asm". (gdb) bt #0 strcmp () at ../sysdeps/i386/i686/strcmp.S:40 #1 0x004ed2c1 in boost::serialization::extended_type_info::key_unregister() () from /usr/lib/libboost_serialization.so.1.40.0 #2 0x004ed3e4 in boost::serialization::extended_type_info::~extended_type_info() () from /usr/lib/libboost_serialization.so.1.40.0 #3 0x004edc98 in boost::serialization::detail::extended_type_info_typeid_0::~extended_type_info_typeid_0() () from /usr/lib/libboost_serialization.so.1.40.0 #4 0x0805861b in boost::serialization::extended_type_info_typeid<tuttle::host::ofx::attribute::OfxhClipDescriptor>::~extended_type_info_typeid() ( this=0x8189470) at /usr/include/boost/smart_ptr/detail/shared_count.hpp:221 #5 0x080586e5 in boost::serialization::detail::singleton_wrapper<boost::serialization::extended_type_info_typeid<tuttle::host::ofx::attribute::OfxhClipDescriptor> >::~singleton_wrapper() (this=0x8189470) at /usr/include/boost/smart_ptr/detail/shared_count.hpp:221 #6 0x0054f05f in __run_exit_handlers (status=0, listp=0x661304, run_list_atexit=true) at exit.c:78 #7 0x0054f0cf in *__GI_exit (status=0) at exit.c:100 #8 0x00536b5e in __libc_start_main (main=0x80561fa <main>, argc=1, ubp_av=0xbffff3a4, init=0x8126f80 <__libc_csu_init>, fini=0x8126f70 <__libc_csu_fini>, rtld_fini=0x198d20 <_dl_fini>, stack_end=0xbffff39c) at libc-start.c:252 #9 0x08052501 in _start () at ../sysdeps/i386/elf/start.S:119

2 3

[thread] why crash launching a thread?
by David M. Cotter 01 Feb '10

01 Feb '10

i'm launching a new thread from an existing background thread, BUT it is crashing. i don't know if it happens often yet, but was wondering what could possibly cause this? Thread 10 Crashed: 0 libSystem.B.dylib 0x96ce435d usleep$NOCANCEL$UNIX2003 + 0 1 libSystem.B.dylib 0x96d05a50 abort + 105 2 libstdc++.6.dylib 0x96bb2fda __gnu_cxx::__verbose_terminate_handler() + 433 3 libstdc++.6.dylib 0x96bb117a __cxxabiv1::__terminate(void (*)()) + 10 4 libstdc++.6.dylib 0x96bb11ba __cxxabiv1::__unexpected(void (*)()) + 0 5 libstdc++.6.dylib 0x96bb12b8 __gxx_exception_cleanup(_Unwind_Reason_Code, _Unwind_Exception*) + 0 6 libboost_thread.dylib 0x006af933 boost::thread::start_thread() + 195 7 com.kjams.kjams 0x001281d1 CThreads::Fork(APP_ThreadType, long (*)(void*, long), long (*)(void*, long), void*, char const*) + 1521 8 com.kjams.kjams 0x0012858b CT_Preemptive::call(char const*) + 91 9 com.kjams.kjams 0x00139fc2 CSpooler::Fork_Spool(CSpooler*, bool) + 290 10 com.kjams.kjams 0x0027fd05 CSongImporter::EncodeSong(CSI_PersistantQueData*, CSpooler*) + 1109

5 7

BoostCon 2010 preliminary program
by Hartmut Kaiser 01 Feb '10

01 Feb '10

Hey all, please find below a list of accepted submissions to BoostCon 2010. A tentative, fully scheduled program will be available soon. The keynote will be held by Maurice Herlihy. Maurice Herlihy is a computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to the design of concurrent algorithms, and in particular to the exposition and quantification of the properties and uses of hardware synchronization operations. He is currently (2009) a professor of computer science at Brown University and one of the leading visionaries in the field of transactional memory. Following up on this keynote we will have a full day sessions and panel discussion where we plan for 4 different groups to talk about their work on transactional memory (Mark Moir (Sun), Tatiana Shpeisman (Intel), Michael Wong (IBM), Vicente Botet (TBoost.STM)) In addition we have a high quality, distinctive, fully packed, and very diverse list of accepted talks: João P. R. Abecasis: Cross-platform development with Qt and Boost Ruediger Berlich: Distributed parametric optimization with the Geneva library Dean Michael Berris: Techniques in Flexible Header-Only C++ Network Library Implementations Michael Caisse: Using Spirit 2.1: Qi and Karma An Asio Based Flash XML Server Marshall Clow: A (proposed) MIME library for Boost Tony Van Eerd: The Basics of Lock-free Programming Joel Falcou and Jean-Thierry Lapresté: The Numerical Template Toolbox: BOOST'ed Generic Array Library for High Performance Computing Joachim Faulhaber: Boost.Alabaster (proposed): A Law Based Tester Barend Gehrels, Bruno Lalande and Mateusz Loskot: Generic Programming for Geometry Justin Gottschlich: TBoost.STM's Engine: An Efficient Software Transactional Memory Using Commit-Time Invalidatio Douglas Gregor: Clang: An Open-Source C++ Compiler Library C++ Tool-Builders Workshop Christophe Henry: Tutorial: The Meta State Machine Library V2 Ken Joyner: Revisiting Guidelines to Using Exceptions in C++ Hartmut Kaiser and Joel de Guzman: RAD Spirit Spirit History and Evolution Zachary Laine and Matt Calabrese: Instantiations Must Go! Stephan Lavavej: Data Structure Visualizers in Visual Studio 2010 Nevin Liber: Type Erasure Eric Niebler: Practical DSEL Design with Proto Roshan Naik: Logic Paradigm for C++ Stjepan Rajko: Patterns Library: a generic library for modeling, recognition, and synthesis of sequential patterns Gennadiy Rozental: Production use of Boost.Test David Sankel: Functional Programming in C++ Jeremy Siek: Generic Programming and the Boost Graph Library Robert Ramey: Is Boost Broken? Michael Wong: C++0x Update C++0x Concurrency We believe this program is reason enough to come to BoostCon this year (Aspen, CO, USA, May 10-14th)! For registration, accommodation, and more information please visit the conference website at http://www.boostcon.com. Please note the reduced early registration fee! Regards Hartmut Program Chair BoostCon 2010 --------------- Meet me at BoostCon www.boostcon.com

1 0

[log] Release Candidate 4 released
by Andrey Semashev 01 Feb '10

01 Feb '10

I'm proud to announce that I've released the fourth candidate of Boost.Log for the review. There were many improvements since the passed year of development. Many of them reflect the discussion of RC3. Here's a short list of major changes: * Substantial documentation improvement. The tutorial section has been reorganized. * Removed rotating file stream. As a replacement, a new file sink has been added, which allows to achieve the same results ans adds a few more features. It is now possible to collect rotated log files in a dedicated directory. * Added a new multifile sink backend. * Added a new ordering asynchronous sink frontend. * The syslog sink backend is now supported on Windows, too. The sink no longer requires native support for POSIX API for syslog, but is able to send syslog packets to a remote server over UDP. * Added support for scoped logging. There is now a distinct log record entity, which is returned by the core as a result of filtring. * Added support for exception control. * Added a new mode of logging, called trivial logging. The more complete change log is available here: http://tinyurl.com/ybcghuf The library with docs, tests and examples has been updated in Boost.Vault: http://tinyurl.com/cm9lum There's SVN repository available on SourceForge project page: http://tinyurl.com/ye23wyh The docs are also available online here: http://tinyurl.com/5e4fd7 Comments are welcome.

9 37

Boost.Atomic request for review/inclusion
by Helge Bahmann 01 Feb '10

01 Feb '10

Hello, First of all I would like to thank for the comments that I have received so far, I have incorporated almost all of them I think. Boost.Atomic is now in a form that I consider calling it a release. It has support for "true" atomic variables on: - gcc/x86, 32-bit (tested on Linux, FreeBSD) - gcc/x86, 64-bit (tested on Linux) - gcc/powerpc32 (tested on Linux, Mac OS X) - gcc/powerpc64 (untested) - generic Win32 (tested with Visual Studio Express on Win XP) For all others it falls back gracefully to locked operation. There is proper quickbook documentation, including a hopefully illustrative example section. If you have an unsupported platform, contact me and I will attempt to provide support for it (usually it is just a matter of testing). Otherwise I would like to request considering the library for inclusion and appreciate any further comments. Everything available as usual at: http://www.chaoticmind.net/~hcb/projects/boost.atomic Best regards Helge

6 12

[1.42.0] OK to build RC?
by Beman Dawes 01 Feb '10

01 Feb '10

If anyone knows of any 1.42.0 showstoppers, please post something right away. Otherwise we will start to put a release candidate together in a couple of hours. --Beman

1 0

[Serialization] virtual function and virtual inheritance
by fab 31 Jan '10

31 Jan '10

Hi, I have a compilation error with a virtual function inside a virtual base class. For example, I just add a function f() inside the unit test : "test_diamond.cpp". class base { ... virtual void f() =0; ... }; class derived1 { ... virtual void f(){} ... }; gcc 4.3, returns me an error: error: no unique final overrider for `virtual void base::f()' in `boost::detail::is_virtual_base_of_impl<derived1, final, mpl_::bool_< true> >::X' The same code works properly with msvc 2005. Best regards, Fabien Castan

2 2

RFC: Sequence Properties and Boost Algorithm/Functional
by Grant Erickson 31 Jan '10

31 Jan '10

For a recent project, I needed to inquire about a sequence of objects and make a determination as to whether the sequences were: * Increasing * Strictly Increasing * Decreasing * Strictly Decreasing Looking through STL, Boost documentation, Boost sources and headers and the Boost mailing lists I was able to find neither an existing algorithm or stateful unary predicate functor for accomplishing this for a pair of input iterators. However, I was a bit surprised considering that this seems like a sequence property query that would tend to come up fairly often and serve a general utility. Did I just fail to form the proper search/query or am I overestimating the general utility? Regardless, I forged ahead with the rather naïve implementation (see below), which can be used as a predicate with for_each as shown: const int strictlyIncreasingValues[] = { 1, 2, 3, 4, 5 }; bool isStrictlyIncreasing; isStrictlyIncreasing = std::for_each(strictlyIncreasingValues, strictlyIncreasingValues + 5, is_strictly_increasing<int>()); assert(inStrictlyIncreasing == true); However, acknowledging the inefficient and naïveté of the first implementation, this is probably more algorithm than functional in that for_each with a stateful predicate is wasteful in walking the entire sequence (i.e. if any arbitrary subsequence fails to meet the property predicate criteria, the whole sequence fails). Is a smarter realization of this as an algorithm a potential candidate for boost::algorithm? Naïve, inefficient functional implementation to be used with for_each: #include <functional> #include <boost/function.hpp> template <typename T> struct creasing : public unary_function<T, bool> { protected: typedef unary_function<T, bool> base_type; typedef typename base_type::argument_type argument_type; typedef typename base_type::result_type result_type; typedef boost::function<result_type (const argument_type &a, const argument_type &b)> binary_predicate; creasing(const binary_predicate & inPredicate) : base_type(), mPredicate(inPredicate), mCreasing(true), mInited(false), mLast() { return; } public: result_type operator()(const argument_type & x) { if (mCreasing) { if (mInited) { mCreasing = mPredicate(mLast, x); } else { mCreasing = true; mInited = true; } mLast = x; } return (mCreasing); } operator result_type() const { return (mCreasing); } private: const binary_predicate mPredicate; result_type mCreasing; result_type mInited; argument_type mLast; }; template <typename T> struct is_increasing : public creasing<T> { typedef creasing<T> base_type; typedef typename base_type::argument_type argument_type; is_increasing(void) : base_type(std::less_equal<argument_type>()) {} }; template <typename T> struct is_decreasing : public creasing<T> { typedef creasing<T> base_type; typedef typename base_type::argument_type argument_type; is_decreasing(void) : base_type(std::greater_equal<argument_type>()) {} }; template <typename T> struct is_strictly_increasing : public creasing<T> { typedef creasing<T> base_type; typedef typename base_type::argument_type argument_type; is_strictly_increasing(void) : base_type(std::less<argument_type>()) {} }; template <typename T> struct is_strictly_decreasing : public creasing<T> { typedef creasing<T> base_type; typedef typename base_type::argument_type argument_type; is_strictly_decreasing(void) : base_type(std::greater<argument_type>()) {} }; Regards, Grant

5 5

[atomic] Availability detection
by Andrey Semashev 31 Jan '10

31 Jan '10

Hi, Will there be a way to detect if specific operations over a specific type are available atomically on the current platform? That is, if I know that atomic operations are emulated with locks, I want to fall back to another branch of my code with explicit locks, rather than the emulated atomics.

2 4

codepad code longevity ?
by Joel de Guzman 31 Jan '10

31 Jan '10

Hi, We see more and more people post code using Codepad. Is that good? In the Spirit list, we've had this discussion about longevity of code posted to Codepad: http://article.gmane.org/gmane.comp.parsers.spirit.general/18220 I can't see any information regarding policy on how code is retained. Is there? I've heard they say the post is valid for 24 hours. If that's the case, then we should ban the use of codepad. People here, myself included, need pasted code to be permanent for future reference. Thoughts? Regards, -- Joel de Guzman http://www.boostpro.com http://spirit.sf.net http://www.facebook.com/djowel Meet me at BoostCon http://www.boostcon.com/home http://www.facebook.com/boostcon

6 27

[circular_buffer] Serialization support for circular_buffer
by Brian Wood 31 Jan '10

31 Jan '10

B"H Shalom, Boost, The C++ Middleware Writer now supports marshalling circular_buffers. This is done by transmitting a circular buffer's capacity, then size, followed by it's elements. An example of the code used when marshalling a circular_buffer is here -- http://webEbenezer.net/posts/cirbuf.hh. -- Brian Wood http://www.webEbenezer.net (651) 251-9384

1 0

[asio] [function] Strange corruption error with boost::function and asio
by Zachary Turner 29 Jan '10

29 Jan '10

I'm not sure if I'm experiencing a bug in boost, bug in compiler (VS 9.0 service pack 1), or bug somewhere else, but I'm having trouble reading boost::function code enough to be able to figure out. A little background: I'm using boost::asio to read from a disk, and then boost::asio to write results to a socket. Everything works completely fine most of the time, but in some cases there's an error on my server (which is largely irrelevant here as it's not even written in C++) and the server crashes unexpectedly. I suspect the error is occuring while I'm in the middle of an asynchronous network write, because the very first odd behavior surfaces in my network write completion routine. I can go into more detail about how I'm using boost::function and boost::asio in conjunction if necessary, but for now I'll just post the bare minimum needed to be able to make any sense at all of what I'm doing (which is still alot, my apologies for the length). Anyway: - my completion routine has the following signature: void async_service_write_network::write_data_handler(asio_handler wrapped_handler, boost::system::error_code error, size_t bytes_transferred) - asio_handler (referenced in the previous signature) is defined as follows: typedef boost::function<void (boost::system::error_code, size_t)> asio_handler; Which is exactly the same but contains a wrapped handler at the front so I can privately intercept the handler at various points along the chain, and then have the private handler do arbitrary work then invoke the wrapped handler. I do this with boost::bind as follows asio_handler wrapped_handler = boost::bind( &async_service_write_network::write_data_handler, this, handler, _1, _2); socket_.async_send( buffer, boost::bind( wrapped_handler, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); To explain the odd behavior, I've put a breakpoint in write_data_handler. Quick version if you don't feel like reading, the function arguments seem to be being corrupted either by boost::bind or boost::function. Long version, looking at the values of the arguments shows the following: error {m_val=23843184 m_cat=0x000000000000305d } boost::system::error_code m_val 23843184 int m_cat 0x000000000000305d const boost::system::error_category * boost::noncopyable_::noncopyable {...} boost::noncopyable_::noncopyable __vfptr CXX0030: Error: expression cannot be evaluated So I move one level up the callstack. This puts me in: template<class R, class T, class A1, class A2, class A3 BOOST_MEM_FN_CLASS_F> class BOOST_MEM_FN_NAME(mf3) { //Boost 1.39 mem_fn_template.hpp line 384 R operator()(T * p, A1 a1, A2 a2, A3 a3) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3); } } Examining a1, a2, and a3 shows that they are what they appear to be. Walking one more level up the callstack and this is no longer the case: template< class A1, class A2, class A3, class A4 > class list4: private storage4< A1, A2, A3, A4 > { //Bind.hpp line 450 template<class F, class A> void operator()(type<void>, F & f, A & a, int) { unwrapper<F>::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]); } } Examining the contents of 'a', I see this: - a {...} boost::_bi::list2<boost::system::error_code &,unsigned __int64 &> & - boost::_bi::storage2<boost::system::error_code &,unsigned __int64 &> {a2_=12381 } boost::_bi::storage2<boost::system::error_code &,unsigned __int64 &> - boost::_bi::storage1<boost::system::error_code &> {a1_={...} } boost::_bi::storage1<boost::system::error_code &> - a1_ {m_val=0 m_cat=0x000000014000ac48 } boost::system::error_code & m_val 0 int + m_cat 0x000000014000ac48 system_category_const const boost::system::error_category * a2_ 12381 unsigned __int64 & Somehow this error code is becoming corrupted. It is clearly has an m_val of 0 here, and an m_cat of 0x14000ac48 here, and in the very next function on the call stack, it has an m_val of 23843184, and an m_cat of 0x305d. Am I missing something obvious or is there an actual boost/compiler bug going on here?

1 0

doc for is_lvalue_iterator?
by Neal Becker 29 Jan '10

29 Jan '10

I don't see any doc for is_lvalue_iterator (and related metafunctions)

2 1

type of iterator_facade::value_type
by Neal Becker 29 Jan '10

29 Jan '10

According to iterator_facade doc: typedef remove_const<Value>::type value_type; Why remove_const? This makes it hard to detect if the resulting iterator points to a const value. In order to further adapt such an iterator, I needed to use the reference type instead of the value type to detect constness: typename boost::is_const< typename boost::remove_reference< typename std::iterator_traits<BaseIterator>::reference >::type >::type,

3 2

Review Request: Creasing (Sequence Properties)
by Grant Erickson 28 Jan '10

28 Jan '10

The creasing algorithm templates define four template functions for determining the order properties of sequences, specifically: * Increasing * Decreasing * Strictly Increasing * Strictly Decreasing The implementation is a fairly trivial composition of the STL adjacent_find, not2 and {greater,less,greater_equal,less_equal}. For the purposes of sequence ordering validation, using these templates is more efficient and straightforward than creating a temporary, sorted version of some sequence and comparing it against the original sequence. Example: bool CheckPoints(const Points & inPoints) { const bool strictlyIncreasing = is_strictly_increasing(inPoints.begin(), inPoints.end()); if (!strictlyIncreasing) { cerr << "Points must be in increasing order with " "no duplicate values." << endl; } return strictlyIncreasing; } The review files are available in both Sandbox and Vault: Sandbox: boost/algorithm/creasing.hpp libs/algorithm/creasing/example/creasing_ex.cpp libs/algorithm/creasing/example/Jamfile libs/algorithm/creasing/test/creasing_test.cpp libs/algorithm/creasing/test/Jamfile.v2 Vault: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=creasin g.zip&directory=Algorithms Regards, Grant Erickson

8 23

[Boost.Thread]
by Andrew Chinkoff 28 Jan '10

28 Jan '10

Hi. There is a test program I would to be explained to me: *** BEGIN OF TEST PROGRAM *** #include <stdio.h> #include <boost/thread.hpp> #define USE_SPINLOCKS //#define USE_MUTEXES boost::thread th1; boost::thread th2; boost::mutex mutex; int global_int = 0; bool IsNotEven(int code) { boost::mutex::scoped_lock locker(mutex); bool ret = (code & 1); return ret; } void thread_func() { for(int i = 0; i < 1000000; ++i) { #ifdef USE_MUTEXES if(IsNotEven(global_int)) // (1) #elif defined USE_SPINLOCKS if(__sync_fetch_and_and(&global_int, 1)) // (2) #else ERROR__WRONG_COMPILED; #endif global_int+=9; else global_int+=1; } } int main() { th1 = boost::thread(&thread_func); th2 = boost::thread(&thread_func); th1.join(); th2.join(); printf("global_int = %d\n", global_int); return 0; } *** END OF TEST PROGRAM *** Results of test program: 1) Test program compiled with USE_SPINLOCKS. Outputs are always: "global_int = 10" "global_int = 10" "global_int = 10" 2) Test program compiled with USE_MUTEXES. Outputs differ from each other: "global_int = 10000008" "global_int = 10000000" "global_int = 9763210" Could you explain me why outputs produced with USE_SPINLOCKS compilation differ from USE_MUTEXES ones? And what is the difference between (1) and (2) lines? Best, Andrew. P.S.: I use guest Ubuntu-8.04 installed on VirtualBox. Host OS = Vista.

3 2

detecting a constructor with a specific signature
by Kenny Riddile 28 Jan '10

28 Jan '10

I'm trying to create a type trait to detect the presence of a constructor with a very specific signature. Types passed to this trait will *always* have a constructor of the form: T( const std::string& ); but some of them will have this constructor as well: T( const std::string&, Foo& ); // Second parameter will always be a Foo& I would like to create a type trait that returns true when the second constructor is present. I can't simply do: !is_convertible<std::string, T>::value since that will return false when the second constructor is present since all Ts are convertible from std::string. Is it possible to create such a trait?

6 14

Trunk testing broken (Python and Utility)
by K. Noel Belcourt 28 Jan '10

28 Jan '10

Hi, There's at least two separate problems in trunk. Missing files in the Python library. error: Unable to find file or target named error: 'union.cpp' error: referred from project at error: '../libs/python/test' Missing files in the Utility library, error: Unable to find file or target named error: 'noncopyable_adl_barrier.cpp' error: referred from project at error: '../libs/utility/test' -- Noel

2 1

Range-aware version of min and max
by Zachary Turner 28 Jan '10

28 Jan '10

I am often frustrated by the inability of std::min and std::max to deal with data types of different ranges. For example: boost::uint64_t big = 9876543210ULL; boost::uint32_t small = 12345; boost::uint32_t smallest = std::min(big, small); will generate a compiler warning about possible loss of data due to converting from boost::uint64_t to boost::uint32_t. Obviously such a scenario is impossible since by definition the result can be no larger than the maximum value of a uint32. Previously there was a discussion on the list about adding operators such as is_addable, is_multipliable, is_less_comparable, etc. Using such a class, one could re-write min and max as follows (I'm sure someone will come up with a problem with this, or a better implementation, but anyway the idea should be clear): namespace boost { template<class A, class B> struct min_result { typedef mpl::if_c<(integer_traits<A>::const_max < integer_traits::const_max), A, B>::type type; }; template<class A, class B> struct max_result { typedef mpl::if_c<(integer_traits<A>::const_min > integer_traits::const_min), A, B>::type type; }; template<class A, class B> min_result<A,B>::type min(const A& a, const B& b) { return static_cast<min_result<A,B>::type>((a < b) ? a : b); } template<class A, class B> max_result<A,B>::type max(const A& a, const B& b) { return static_cast<max_result<A,B>::type>((a > b) ? a : b); } I'm sure there's some implementation details I haven't considered, but is there any fundamental reason why an approach like this would be flawed or undesirable? Zach

4 6

Please stay on-topic (was: C++ and quality of software)
by David Abrahams 28 Jan '10

28 Jan '10

This discussion is really not relevant to Boost, is it? At Mon, 25 Jan 2010 14:28:34 -0800, Peter Foelsche wrote: > > > "Marshall Clow" <mclow.lists(a)gmail.com> wrote in message > news:D43C711F-03E0-4A3C-BE40-BA99BE379F30@gmail.com... > > > Exceptions > > ▶ We do not use C++ exceptions. > > > > Run-Time Type Information (RTTI) > > ▶ We do not use Run Time Type Information (RTTI). > > > I think this is an embarrasement for google. > Didn't they claim to hire only very good people? > I would not want to work under these conditions. > > If there is again some security hole due to a buffer overflow, > such an institution could claim, that software using fixed-sized-buffers > would not get their stamp of approval. > And that the customer should be looking and asking for this stamp of > approval when buying software. > > How many fixed sized buffers are in the main OSs? -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com BoostPro Computing http://www.boostpro.com

1 0

[Serialization] memory leak when serialising a map containing shared_ptrs
by richard bradley 28 Jan '10

28 Jan '10

I'm finding that Boost.Serialization is leaking memory when deserialising std::map<string,boost::shared_ptr<X>>. Maybe this is a sign that my data structures are too complicated? ;-) This wouldn't bother me that much, except that I'm also using Boost.Test, which gives lots of angry messages about leaked memory at the end of my tests (I'm using MSCRT). I've attached a simple test case which demonstrates this. Can anyone shed some light on what's going on here? Have I used any of the libraries incorrectly? Is there anything I can do to fix this? I'm using Visual Studio 2008, and boost 1.41.0 The output from the attached test looks like: =========== Running 1 test case... MyClass @3532504 with 1 children MyClass @3532960 with 1 children Detected memory leaks! Dumping objects -> {800} normal block at 0x0035EDE8, 1 bytes long. Data: < > CD Object dump complete. =========== I've also attached a stack trace which I got by breaking on the non-free'd memory allocation,using "--detect_memory_leak=800" Thanks very much, Rich

1 1

unzip .zip file and browse to compressed files
by Andrej van der Zee 28 Jan '10

28 Jan '10

Hi, I am looking for a way to uncompress a zip-file (which contains multiple files/dirs) and browse through the contents. Does boost provide support for the first part? I looked at iostreams with a zlib uncompressor, but as far as I can see it assumes a single zipped file. Thank you, Andrej

7 7

[Boost.utility]
by Andrew Chinkoff 27 Jan '10

27 Jan '10

Having considered [ http://www.research.ibm.com/designpatterns/pubs/ph-jun96.txt] I propose singleton implementation. I had attached "singleton.hpp" to this letter. Below is the test program: #include <stdio.h> #include <singleton.hpp> class A : public boost::Singleton<A> { // // Only Singleton class can create and delete us! // SINGLETON_IS_MY_FRIEND; public: void foo(){ printf("foo!\n"); } A(){ printf("A()\n"); } ~A(){ printf("~A()\n"); } }; void main() { // It is not compiled: //A a = A::Instance(); // That is exactly as it should be used: A::Instance().foo(); } Test program outputs: A() foo! ~A() I suggest include "singleton.hpp" into "utility.hpp" header that it can be used along with: boost::noncopyable, etc.

14 67

[1.41.0] [filesystem] Undefined references to get_system_category and get_generic_category
by Richard Hadsell 27 Jan '10

27 Jan '10

I am trying to build some code using the 1.41.0 version of the filesystem library. It used to build with version 1.34.1. I am getting errors, when the linker fails to find boost::system::get_system_category and boost::system::get_generic_category. What do I need to do differently to find or build these functions? -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studios http://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560

2 2

Are any of these bugs _really_ show stoppers?
by Marshall Clow 27 Jan '10

27 Jan '10

There are 25 bugs in the Trac system which are marked as "showstopper". Are any of these really worth holding up the release for? (and if not, should we reclassify these bugs?) http://svn.boost.org/trac/boost/report/29 986 Problem building Python modules on boost 1.34.0 1215 Boost 1.34.1, mpl: Wrong workaround detection using MinGW32 (or.hpp, line #33)" 2411 bzip2_compressor does not work with filtering_istream,new,Bugs,Boost 1.37.0 2512 interval cosh: wrong result if interval contains 0 (but is not identical to [0,0]) 2513 rint not present in Visual Studio 2008 2164 locate_root wrong under CygWin 2797 Two problems with thread_specific_ptr 2255 Compilation error during arm cross compile - boost 1.36 2883 Boost::signals compile problem with GCC 3.4.5 2958 [patch] changes to make asio compile on vxWorks 2956 vxWorks POSIX quirks for date_time 583 Fixes for build on IBM pSeries for AIX and Linux 426 lambda vs pure virtual functions 3325 Limited support for mapping regions to specific addresses in Linux 738 Memory leaks with signal::connect? 3480 Build fails on Debian: 2.6.18-5-686-bigmem #1 SMP Tue Dec 18 22:34:10 UTC 2007 i686 GNU/Linux 3165 wrong project-config.jam generated for intel-linux 2955 [patch] recursive mutex impossible if pthread_mutexattr_settype not defined 1066 Patch to make Boost.Python compile on SunCC 2185 bjam hangs when building libs/python/examples/quickstart under MacOS X 3716 Application crash when using Boost.Python in a plug-in DLL for that application 3723 gzip_docompressor error - basic_array_source no putback member 2330 thread::interrupt() can be lost if condition_variable::wait() in progress 3735 thread_group::interrupt_all() is unreliable 2226 boost::thread 1.36.0 /clr Link Error LNK2022 Just asking.... -- Marshall P.S. I don't mind fixing 2512 and 2513 - and can do that for 1.43 if people don't want them in 1.42.

3 4

BoostCon Conference Hotel Now Accepting Reservations
by David Abrahams 26 Jan '10

26 Jan '10

Hello Boosters and former BoostCon attendees! The BoostCon website has been updated for 2010, registration is open, and the conference hotel is already prepared to start taking our reservations. If you are planning to go to Boostcon this year, I suggest you take a few minutes to register (http://www.boostcon.com/registration) and make your hotel reservation (http://www.boostcon.com/location/lodging) today. -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com BoostPro Computing http://www.boostpro.com

1 0

[chrono] v0.3.2 New frequency, lifetime and percentage stopwatch_accumulator features
by vicente.botet 26 Jan '10

26 Jan '10

Hi, I have update the Boost.Chrono library with some minor features, a lot of bug fixes, and started the tutorial with some examples of features interesting people since the last version. New Features: * Added overloading for operator/(Integer/Duration) (used to get the frequency) * Added frequency, lifetime and percentage to the stopwatch_accumulator. The default format is "%c times, sum%ss, min%ms, max%Ms, mean%as, frequency%fherzs, lifetime%ls, percentage=%p%\n", where %c : the counter of the number of times the pair start/stop has been called. %s : the sum of the samples of elapsed time between the call to start/stop. %m : the min of the samples of elapsed time between the call to start/stop. %M : the max of the samples of elapsed time between the call to start/stop. %a : the mean of the samples of elapsed time between the call to start/stop. %f : the frequency of calls to start. %l : the lifetime of the stopwatch_accumulator. %p : the percentage of time spent by this stopwatch respect to its lifetime. Bug Fixes * Specific formatters didn't work completly * Replace duration(0) by duration::zero() on template classes. * suspend didn't work: partial_ not initialized neither taken in account by the elapsed function. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. SVN repository http://svn.boost.org/svn/boost/sandbox/chrono. I would like to thanks particularly Andrew Chinkoff for his suggestion of the frequency feature and all those that have tried the library and reported the bugs they found, either on this ML or personally. I would really appreciate if people having the possibility to test on other platforms/compilers report me how the library works. As you can see the library is already on the review schedule, waiting for a review manager and a date for the review. I expect to add yet some features for the review release as thread clocks, and suspensible clocks i.e. clocks that can be suspended/resumed. Any idea for better naming the concepts/classes is welcome. Hoping this release works better for you, Vicente (See below the contents of preceding releases) ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost-users(a)lists.boost.org>; <boost(a)lists.boost.org> Sent: Wednesday, January 20, 2010 11:02 PM Subject: [chrono] v0.3.1 Support for wide characters Hi, this new version includes: * Added support for wide characters on formatters. * Added chrono.hpp and stopwatches.hpp header files at the boost level. * Update of the doc taking care of preceding comments. Comments are welcome :) Best, Vicente ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost(a)lists.boost.org>; <boost-users(a)lists.boost.org> Sent: Sunday, January 17, 2010 9:14 PM Subject: [chrono] v0.3 New Stopwatch Feature Hi, I'm pleased to announce the new version of the Boost.Chrono library. The implementaton is quite stable; the new interface could suffer of some modifications, renaming, ... as far as you submit some proposals. I would request a formal review soon and I will need a review manager. I know that review managers are hard to find, so if you are interested in the library, please the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. I've tested it with gcc and MSVC. Previoous version of the library have been testted on Mac, but I'm not able to test this platform. Could someone check if there are some regressions on Mac? New Features: * Process cpu clocks * Independent process cpu clocks for real, user, system process CPU time * Global process cpu clock for real, user, system process CPU time * Stopwatch concept measuring elapsed time between different points in time associated to the operations start, stop, suspend and resume. * stopwatch is a model Stopwatch measuring the elapsed time between the start and the stop operations. * stopwatch_accumulator is a model Stopwatch allowing to accumulate several time samples and give the average, ... * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopwatch Formatter concept * stopwatch formatter "%ds\n" * stopwatch accumulator formatter "%c times, sum%ss, min%ms, max%Ms, mean%as\n" * time formatter "real %rs, cpu %cs (%p%), user %us, system %ss\n" * digital_time decomposition class separating days, hours,minutes,seconds, nanoseconds from any duration class (looking for a better name) * digital_time formatter "%d days(s) %h:%m:%s.%n\n" * stopwatch_reporter is a convenient generic class reporting elapsed time for the Stopwatch concept. * stopclock<Clock> shortcut stopwatch_reporter<stopwatch<Clcok>> * typeof registration for classes duration and time_point Depreceated Features: * The classes process_times, process_clock, process_timer, timer and run_timer are now deprecated as the preceding additions are more generic. However for backward compatibility they are preserved until inclusion of the library in Boost. Next follows the equivalences: timer<> ~ stopwatch<> process_timer ~ stopwatch<process_cpu_clock> run_timer ~ stopclock<> Bug Fixes * Try to correct warning C4251: 'boost::chrono::run_timer::m_format' : class 'std::basic_string<_Elem,_Traits,_Ax>' needs to have dll-interface to be used by clients of class 'boost::chrono::run_timer', by don't including inlines functions using the std::string m_format. For people that doesn't know it yet, Boost.Chrono library provides: * The C++0x Standard Library's common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * typeof registration for classes duration and time_point * Process clocks: * process_real_CPU_clocks, capturing real-CPU times. * process_user_CPU_clocks, capturing user-CPU times. * process_system_CPU_clocks, capturing system-CPU times. * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. * Stopwatches: * stopwatch, capturing elapsed Clock times. * stopwatch_accumulator, capturing cummulated elapsed Clock times. * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopclocks or Stopwatch reporters: * stopwatch_reporter, convenient reporting of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Best regards, _____________________ Vicente Juan Botet Escribá

2 2

floating point FUD
by Thomas Klimpel 25 Jan '10

25 Jan '10

Hi, Find attached a small test program that tries to highlight some of the "usual" floating point traps. The essence is the following small function that outputs the results of some "buggy" floating point logic. The rest is just setting up the environment so that the bugs actually get triggered. void buggy_function(double eps = 1e-13, int length = 3, double delta = 1 / 7.0) { using namespace std; double alpha = 1e-13; double beta = eps; double a = length * delta; double b = length * delta; vector<double> inverse; for (int i = 0; i < length; ++i) inverse.push_back(1.0/(2*i+1)); vector<double> sorted; for (int i = 0; i < length; ++i) sorted.push_back(inverse[i]*delta); double t = -delta*sorted.size(); double tt = -sorted.size()*delta; bool t_tt = (abs(t-tt) < eps); bool abs_t = (abs(t) == -t); double c = (1-alpha) * a + alpha * b; double d = (1-beta) * a + beta * b; bool a_c = (a == c); bool b_d = (b == d); vector<bool> equal; for (int i = 0; i < length; ++i) equal.push_back(inverse[i]*delta == sorted[i]); std::cout << "t_tt = " << t_tt << "\nabs_t = " << abs_t << "\na_c = " << a_c << "\nb_d = " << b_d << "\n"; std::cout << "equal = ["; for (int i = 0; i < length; ++i) std::cout << " " << equal[i]; std::cout << " ]\n"; } The hypothetical "naive" programmer might expect the output: t_tt = 1 abs_t = 1 a_c = 1 b_d = 1 equal = [ 1 1 1 ] However, the actual output is not only different from this, but also depends on the compiler, the compiler settings, the current configuration of the floating points unit and the actual headers included directly or indirectly by the compilation unit. g++ test_fp.cpp -g -Wall compiles without warning and executes with output: t_tt = 0 abs_t = 1 a_c = 1 b_d = 1 equal = [ 1 1 1 ] g++ test_fp.cpp -DNDEBUG -O2 -msse2 -Wall compiles without warning and executes with output: t_tt = 0 abs_t = 1 a_c = 1 b_d = 1 equal = [ 1 0 0 ] I created a new project with MSVC9. The debug version compiles with warnings for the things that go badly wrong and executes with output: t_tt = 0 abs_t = 0 a_c = 1 b_d = 1 equal = [ 1 1 1 ] set floating point unit to 'high' precision: t_tt = 0 abs_t = 0 a_c = 1 b_d = 1 equal = [ 1 1 1 ] The release version compiles with warnings for the things that go badly wrong and executes with output: t_tt = 0 abs_t = 0 a_c = 1 b_d = 1 equal = [ 1 1 1 ] set floating point unit to 'high' precision: t_tt = 0 abs_t = 0 a_c = 0 b_d = 1 equal = [ 1 0 0 ] In my case (see the background story below), it was actually the trap represented by the output "abs_t = 0" instead of "abs_t = 1" that caught me on linux64 but worked on win32. (It turned out difficult to reproduce this with gcc, so the test program reproduces this trap with MSVC, even so MSVC warns quite explicitly about it). I think it is a funny exercise to debug the test program and find out what actually goes wrong (which is especially funny since most traps only go wrong with compiler optimization turned on). Regards, Thomas ------------------------ The background story: The recent reviews of [Constrained Value], [Polygon] and [GGL] all featured interesting disagreements over floating point issues: http://lists.boost.org/Archives/boost/2008/12/145655.php http://lists.boost.org/Archives/boost/2008/12/145788.php http://lists.boost.org/Archives/boost/2009/03/149567.php http://lists.boost.org/Archives/boost/2009/08/155767.php http://lists.boost.org/Archives/boost/2009/11/158560.php (These were long threads with many messages and many participants, so please don't misinterpret my choice of unrepresentative messages as any form of statement.) Last Wednesday, I had to give an internal live demo of a feature I just finished. I had done the development mostly on win32, but I wanted to run the demo on linux64, to be able to show examples of realistic size (full chip...). While preparing the presentation, I was surprised to find the accuracy of the results significantly worse than I remembered from my previous tests. I repeated my previous tests on linux64, and found out that there was indeed a problem with my code on linux64. I did the demo on win32, but was asked after the presentation to send the source code to somebody from another group. So I spent most of the night trying to find the problem in my code. When I found out that some code with floating point driven logic (I had written years ago) to analytically integrate radial symmetric functions over rectangular domains was showing unexpected behavior, I decided to postpone the floating point fights with the compiler to the next day. I told this story the next day in a group meeting, and was confronted with much floating point FUD and unrealistic suggestions, basically boiling down to either not writing floating point driven logic in the first place, or commenting it in excessive detail. So I lost my temper and explained that it was difficult enough for me to write this code with floating point driven logic, and that anybody suggesting writing it without floating point driven logic should do so please, because I'm unable to do it. I have to admit that I read "What Every Computer Scientist Should Know About Floating-Point Arithmetic" only superficially: http://www.engrng.pitt.edu/hunsaker/3097/floatingpoint.pdf http://docs.sun.com/source/806-3568/ncg_goldberg.html I also have to admit that I write code with floating point driven logic from time to time in case it seems unavoidable to me, and that this code often has bugs that are only discovered months after the code is already finished. But I never found a bug in such code that would have been a fundamental problem with floating point, but always just the "usual" floating point traps I keep overlooking by mistake. Now somebody will probably suggest that I should at least document the "usual" floating point traps then. So I created the attached small test program showing the "usual" floating point traps I could still remember having overlooked at least once. It was actually more difficult than expected to arrange the code in a way that the bugs are really triggered for typically compiler settings of MSVC and gcc.

9 16

[Quickbook] Integrating Spirit docs
by Hartmut Kaiser 24 Jan '10

24 Jan '10

Hey, Not exactly a question for the main devel list, but I'm not sure, where its best to send it to... What do I need to do in order to integrate the Spirit docs (generated by Quickbook) with Boosts overall doc page (i.e. http://www.boost.org/doc/libs/1_41_0/doc/html/libraries.html)? Regards Hartmut --------------- Meet me at BoostCon www.boostcon.com

2 1

Re: [boost] RFC: Sequence Properties and Boost Algorithm/Functional
by Grant Erickson 24 Jan '10

24 Jan '10

On Fri, 22 Jan 2010 14:13:31 -0800 Jeffrey Hellrung <jhellrung(a)ucla.edu> wrote: On 1/23/10 12:35 AM, boost-request(a)lists.boost.org wrote: >> For a recent project, I needed to inquire about a sequence of objects and >> make a determination as to whether the sequences were: >> >> * Increasing >> * Strictly Increasing >> * Decreasing >> * Strictly Decreasing >> >> Looking through STL, Boost documentation, Boost sources and headers and the >> Boost mailing lists I was able to find neither an existing algorithm or >> stateful unary predicate functor for accomplishing this for a pair of input >> iterators. However, I was a bit surprised considering that this seems like a >> sequence property query that would tend to come up fairly often and serve a >> general utility. Did I just fail to form the proper search/query or am I >> overestimating the general utility? >> >> Is a smarter realization of this as an algorithm a potential candidate for >> boost::algorithm? > > Perhaps std::adjacent_find and std::less is all you need, e.g., to > determine if a sequence is decreasing? > > I.e., a sequence is decreasing iff all adjacent pairs of elements xi, > x[i+1] satisfies xi >= x[i+1] iff no adjacent pair of elements xi, > x[i+1] satisfies xi < x[i+1] (assuming that (!>=) == (<)). On Fri, 22 Jan 2010 15:24:32 -0800 Marshall Clow <mclow.lists(a)gmail.com> wrote: > I've got this floating around from a while back... > > [ examples omitted ] Marshall and Jeff: Thanks for the feedback. Marshall's feedback seems to indicate that, yes, there is likely general utility need for such functions and Jeff, you are correct that these algorithms are trivially composed from std::adjacent_find, std::not2 and std::{greater,less,greater_equal,less_equal}: namespace boost { namespace detail { template <typename ForwardIterator, typename BinaryPredicate> bool is_creasing(ForwardIterator first, ForwardIterator last, BinaryPredicate binary_pred) { return std::adjacent_find(first, last, std::not2(binary_pred)) == last; } } // namespace detail template <typename ForwardIterator> bool is_increasing(ForwardIterator first, ForwardIterator last) { typedef typename std::iterator_traits<ForwardIterator>:: value_type value_type; return detail::is_creasing(first, last, std::less_equal<value_type>()); } [ ... other three instances follow trivially ... ] } // namespace boost Unless there's any other feedback, I'll work on posting an implementation to Boost Vault. Regards, Grant

1 0

Re: [boost] MPL bitand.hpp and iso646.h on MSVC 2008
by Nelson, Erik - 2 24 Jan '10

24 Jan '10

After further research, I saw that this is a duplicate of very similar reports previously. I'm not sure if it's scheduled to be fixed, but it still seems to be a problem in boost v1.41 Thanks Erik

3 3

[lockfree::fifo] Review
by Andrew Venikov 24 Jan '10

24 Jan '10

I decided to start a new thread on this topic since the last thread on the same topic is pretty outdated and not everyone will see it. (you can disregard my reply to the previous thread as this one is more complete) First of all I think that having a library of lock-free algorithms/containers would be greatly beneficial to a great number of boost users. On the other hand, having implemented several lock-free algorithms, I know that it is notoriously hard to get them right. We'll need all the help we can get from knowledgeable people in the field. The implementation needs to be thoroughly reviewed. Let me give the first attempt at that. In this e-mail I'll be primarily concentrating on the algorithm correctness rather than the interface. First, let me start with the choice of the algorithm for the fifo queues: Magued Michael and Michael Scott's "Simple, Fast, and Practical Non-blocking and blocking concurrent queues". I really think it is the best choice. Having said that, however, I need to point out that there some inherent limitation in this algorithm. The first limitation is that you can't peek at the head of the queue without dequeueing the element first, hence you can't get an interface that is conformant with std::queue. But I truly believe that it will be the case with any lock-free queue implementation, hence we should abandon the hope of having a lock-free queue look the same as std::queue Second, this algorithm makes certain assumptions about the ability to access memory that has been freed. The algorithm can try to read memory that has been de-allocated. (See further down for description of how). Several debug implementations of malloc/free store every allocated element on one page and when the element is freed, the page is marked protected for both reading and writing. That means that this algorithm can only work with a subset of custom allocators. Your "free_list" for example can't work with it since it's possible for a node to be freed when you call "deallocate". The "caching_freelist" and "static_freelist" on the other hand work just fine because they never return the memory back to the system. Third, and the biggest limitation, is the algorithm's assumption that you can store a pointer to an element plus an ABA tag in a contiguous memory space that can be passed to a CAS instruction. I believe not all platforms provide a DCAS instruction, that's why you're trying to work around this issue by using "packed pointers", i.e. storing the ABA tag in the part of the pointer that presumably is never used. The problem with that, however, is that some libc implementations of malloc/free do use all the bits in the pointer for their own needs, so you can't assume that you can meddle with them. My experience with this algorithm shows that the safest approach is to use a pre-allocated array for the queue and replace pointers with indexes into the array. Assuming that the size of an index is sufficiently lower than the size of a pointer, you can use the remaining bits to store the ABA tag. This alleviates both point 2 and 3. This does mean however, that the queue can't have an unbound size, the size has to be specified during the queue instantiation. Fourth, on platforms where CAS is implemented using LL/SC (such as PowerPC and MIPS), it is possible to livelock. The problem with LL/SC on most platforms is that the write granulum for marking LL's address as "dirty" isn't just the memory pointed to by LL, but the whole cache line where the memory resides. On these platforms it is important to make sure that each "node" of the queue is located on a separate cache line. Here's the code of your enqueue: bool enqueue(T const & t) { node * n = alloc_node(t); if (n == NULL) return false; for (;;) { atomic_node_ptr tail (tail_); //1 read_memory_barrier(); //2 atomic_node_ptr next (tail->next); //3 if (likely(tail == tail_)) //4 { if (next.get_ptr() == 0) //5 { if ( tail->next.cas(next, n) )//6 { tail_.cas(tail, n); return true; } } else tail_.cas(tail, next.get_ptr()); } } } 1. You're missing write barrier after a call to alloc_node(). Rational: alloc_node sets the "next" pointer of the newly allocated node to NULL. That is a store to shared memory. Setting next pointer to NULL has to be observable to other threads BEFORE they observe the inserted node. If you don't insert a write barrier, it is possible for other threads to see the new element in the list before element's next pointer is initialized with NULL. 2. You've misplaced the read_barrier. Rational: Line 4 checks the validity of the load done on line 3. That means that the read_barrier should be between lines 3 and 4. If you don't have a read_barrier after loading *tail->next, then this load can happen after the load of tail_ on line 4, which defies the purpose of line 4. Here's a scenario that makes it clear: State: queue is well-formed and tail_ points to the last element. 1. Thread A executes line1. State: the queue is unchanged and Thread A has a local copy of tail_ 2. Since there's no read barrier after line 3, loads at lines 3 and 4 happen out-of-order. tail_ is pre-loaded for comparison at line 4. 3. Thread B removes the element pointed by tail_, advances tail_ further State: tail_ is advanced, the old element is removed and given back to the allocator. A's local copy of tail_ becomes stale. 4. Thread A executes line 3 State: A's copy of tail is stale. This copy is used to load memory that has been reclamed by the allocator and possibly modified. The value of the memory happens to be 0. 5. Thread A executes line 4. Since tail_ has been preloaded, line 4 succedes. 6. Line 5 succedes 7. Line 6 succedes. Boom: you've just modified a piece of memory not controlled by the queue. You still need to have a barrier between lines 1 and 3, but here only a data dependency barrier will suffice, which is a weaker form of a read barrier and on most all platforms is a no-op since data dependent loads can be handled by processors automatically. 3. Your tail_ and head_ should be volatile. Furthermore, the getters for you tagged_ptr (like get_ptr, operator->() and operator* ) should return pointers/references to volatile types. Rational: If your tail_ is not volatile, then the compiler is free to load head_ just once and line 4 effectively becomes a no-op. Here's code for your "dequeue": bool dequeue (T * ret) { for (;;) { atomic_node_ptr head (head_); //1 read_memory_barrier(); //2 atomic_node_ptr tail(tail_); //3 node * next = head->next.get_ptr(); //4 if (likely(head == head_)) //5 { if (head.get_ptr() == tail.get_ptr()) //6 { if (next == 0) return false; tail_.cas(tail, next); } else { *ret = next->data; //7 if (head_.cas(head, next)) //8 { dealloc_node(head.get_ptr()); //9 return true; } } } } } 1. Again, you need to put read_barrier between lines 4 and 5. Only data dependency barrier will suffice at line 2. 2. You need to add write barrier after line 7 for the same reason as in the enqueue. Hope this was descriptive, Andy Venikov.

10 64

[1.42.0] Beta 1 available on Sourceforge
by Beman Dawes 23 Jan '10

23 Jan '10

1.42.0 beta 1 is now available. This release contains one new library and numerous bug fixes for existing libraries. For details, including download links, see http://beta.boost.org/users/news/version_1_42_0 The release can also be downloaded directly from SourceForge. See http://sourceforge.net/projects/boost/files/ There are a few known problems in the beta: * An odd 'simplesectsep' tag that doxygen creates which has turned up in the generated documentation, such as at http://tinyurl.com/ygbgkge. * Doxygen isn't expanding some of the macros in Boost.Accumulators. * A nasty bug in Spirit affecting copy construction of rules (rev. 50156) has been tracked down and fixed, but the fix was too late for the beta. These will be fixed in the final release. Please report any other problems by responding to this message on either the users or the main developers mailing lists. Thanks, --The Boost release team

3 3

help detecting presence of operator[]
by Jeffrey Hellrung 23 Jan '10

23 Jan '10

Hi all, I'm trying to perform a compile-time check to determine if a class has an operator[]. I'm using a "trick" I think I've seen in Adobe's library and on this list in the past: -------- BEGIN CODE -------- template< class T > struct has_op_bracket { struct base_t { void operator[]( int ); }; struct derived_t : T, base_t { }; template< void (base_t::*)( int ) > struct sfinae { typedef char type; }; template< class U > static typename sfinae< &U::operator[] >::type is_ambiguous(int); template< class U > static int is_ambiguous(...); static const bool value = sizeof( is_ambiguous< derived_t >(0) ) != 1; }; -------- END CODE -------- The way I understand this working is if T has no operator[], then &derived_t::operator[] unambiguously refers to *base_t::operator[], and so the first is_ambiguous overload is selected. Otherwise, &derived_t::operator[] is ambiguous, which is sufficient (I guess...?) for SFINAE to kick in, and the second is_ambiguous overload is selected. Now given the following definitions of X0 and X1: -------- BEGIN CODE -------- struct X0 { }; struct X1 { void operator[](void*); }; -------- END CODE -------- then the following static assertions pass, as expected: -------- BEGIN CODE -------- BOOST_STATIC_ASSERT(( !has_op_bracket<X0>::value )); BOOST_STATIC_ASSERT(( has_op_bracket<X1>::value )); -------- END CODE -------- However, if X2 is defined as -------- BEGIN CODE -------- struct X2 { template< class T > struct R : T { }; template< class T > typename R<T>::type operator[](T); }; -------- END CODE -------- then has_op_bracket<X2>::value fails to compile on MSVC9, but (according to Dinkum Exam[1]) it does compile just fine on "EDG/C++". The error in MSVC9 is -------- BEGIN OUTPUT -------- error C2516: 'T' : is not a legal base class 1> d:\test\main.cpp(9) : see declaration of 'T' 1> d:\test\main.cpp(9) : see reference to class template instantiation 'X2::R<T>' being compiled 1> with 1> [ 1> T=int 1> ] 1> d:\test\main.cpp(21) : see reference to class template instantiation 'has_op_bracket<T>' being compiled 1> with 1> [ 1> T=X2 1> ] -------- END OUTPUT -------- generated by the following program: -------- BEGIN CODE -------- template< class T > struct has_op_bracket { struct base_t { void operator[]( int ) const; }; struct derived_t : T, base_t { }; template< void (base_t::*)( int ) const > struct sfinae { typedef char type; }; template< class U > static typename sfinae< &U::operator[] >::type is_ambiguous(int); template< class U > static int is_ambiguous(...); static const bool value = sizeof( is_ambiguous< derived_t >(0) ) != 1; // line 9 }; struct X2 { template< class T > struct R : T { }; template< class T > typename R<T>::type operator[](T); }; int main() { has_op_bracket<X2>::value; // line 21 return 0; } -------- END CODE -------- What I don't understand is why MSVC is trying to instantiate R<int>. It seems to be grabbing the int from the parameter type of the member function pointer template parameter in sfinae, which doesn't seem like the right thing to do. I can change that parameter to anything else (as long as it doesn't have a nested type typedef) and the error persists. Is MSVC correct, or is this a compiler bug? Either way, is there an alternative, more portable approach to achieve the desired effect? Thanks in advance, - Jeff [1] http://www.dinkumware.com/exam/default.aspx

2 3

[test] mock objects
by Michael Robinson 23 Jan '10

23 Jan '10

Hi, I am a boost unit test newbie. I have been looking at the documentation and examples and would like to know if there is any documentation that specifically addresses the use of mock objects: I am specifically interested in how to interpret the output of est_example1.cpp and est_example2.cpp; as well as learning what the required format of the expectations log file (.elog) to be used for logged_exp_example.cpp is. Thank you, Mike ____________________________________________________________ Nutrition Improve your career health. Click now to study nutrition! http://thirdpartyoffers.netzero.net/TGL2241/c?cp=U1sp_d8XptT4jkLd7e_KlAAAJ1…

2 2

[typeof] Variadic functions
by Sergey Zubkovsky 22 Jan '10

22 Jan '10

Hi, Here is a patch to support variadic functions in the Boost.Typeof. Can anyone check it and commit? Thank you. Index: register_functions.hpp =================================================================== --- register_functions.hpp (revision 57837) +++ register_functions.hpp (working copy) @@ -18,18 +18,25 @@ #include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP() #ifndef BOOST_TYPEOF_LIMIT_FUNCTION_ARITY -#define BOOST_TYPEOF_LIMIT_FUNCTION_ARITY 10 +#define BOOST_TYPEOF_LIMIT_FUNCTION_ARITY 15 #endif enum { FUN_ID = BOOST_TYPEOF_UNIQUE_ID(), - FUN_PTR_ID = FUN_ID + 1 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), - FUN_REF_ID = FUN_ID + 2 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), - MEM_FUN_ID = FUN_ID + 3 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), - CONST_MEM_FUN_ID = FUN_ID + 4 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), - VOLATILE_MEM_FUN_ID = FUN_ID + 5 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), - VOLATILE_CONST_MEM_FUN_ID = FUN_ID + 6 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY) + FUN_VAR_ID = FUN_ID + 1 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + FUN_PTR_ID = FUN_ID + 2 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + FUN_VAR_PTR_ID = FUN_ID + 3 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + FUN_REF_ID = FUN_ID + 4 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + FUN_VAR_REF_ID = FUN_ID + 5 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + MEM_FUN_ID = FUN_ID + 6 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + MEM_FUN_VAR_ID = FUN_ID + 7 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + CONST_MEM_FUN_ID = FUN_ID + 8 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + CONST_MEM_FUN_VAR_ID = FUN_ID + 9 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + VOLATILE_MEM_FUN_ID = FUN_ID + 10 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + VOLATILE_MEM_FUN_VAR_ID = FUN_ID + 11 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + VOLATILE_CONST_MEM_FUN_ID = FUN_ID + 12 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY), + VOLATILE_CONST_MEM_FUN_VAR_ID = FUN_ID + 13 * BOOST_PP_INC(BOOST_TYPEOF_LIMIT_FUNCTION_ARITY) }; BOOST_TYPEOF_BEGIN_ENCODE_NS Index: register_functions_iterate.hpp =================================================================== --- register_functions_iterate.hpp (revision 57837) +++ register_functions_iterate.hpp (working copy) @@ -6,6 +6,12 @@ #define n BOOST_PP_ITERATION() +#if ( n > 1 ) +# define comma , +#else +# define comma +#endif + // function pointers template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> @@ -15,6 +21,13 @@ typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_PTR_ID + n) type; }; +template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> +struct encode_type_impl<V, R(*)(BOOST_PP_ENUM_PARAMS(n, P)comma ...)> +{ + typedef R BOOST_PP_CAT(P, n); + typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_VAR_PTR_ID + n) type; +}; + template<class Iter> struct decode_type_impl<boost::mpl::size_t<FUN_PTR_ID + n>, Iter> { @@ -24,6 +37,15 @@ typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter; }; +template<class Iter> +struct decode_type_impl<boost::mpl::size_t<FUN_VAR_PTR_ID + n>, Iter> +{ + typedef Iter iter0; + BOOST_TYPEOF_DECODE_PARAMS(BOOST_PP_INC(n)) + typedef BOOST_PP_CAT(p, n)(*type)(BOOST_PP_ENUM_PARAMS(n, p)comma ...); + typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter; +}; + #ifndef BOOST_TYPEOF_NO_FUNCTION_TYPES // function references @@ -35,6 +57,13 @@ typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_REF_ID + n) type; }; + template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> + struct encode_type_impl<V, R(&)(BOOST_PP_ENUM_PARAMS(n, P)comma ...)> + { + typedef R BOOST_PP_CAT(P, n); + typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_VAR_REF_ID + n) type; + }; + template<class Iter> struct decode_type_impl<boost::mpl::size_t<FUN_REF_ID + n>, Iter> { @@ -53,6 +82,13 @@ typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_ID + n) type; }; + template<class V, class R BOOST_PP_ENUM_TRAILING_PARAMS(n, class P)> + struct encode_type_impl<V, R(BOOST_PP_ENUM_PARAMS(n, P)comma ...)> + { + typedef R BOOST_PP_CAT(P, n); + typedef BOOST_TYPEOF_ENCODE_PARAMS(BOOST_PP_INC(n), FUN_VAR_ID + n) type; + }; + template<class Iter> struct decode_type_impl<boost::mpl::size_t<FUN_ID + n>, Iter> { @@ -62,6 +98,15 @@ typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter; }; + template<class Iter> + struct decode_type_impl<boost::mpl::size_t<FUN_VAR_ID + n>, Iter> + { + typedef Iter iter0; + BOOST_TYPEOF_DECODE_PARAMS(BOOST_PP_INC(n)) + typedef BOOST_PP_CAT(p, n)(type)(BOOST_PP_ENUM_PARAMS(n, p)comma ...); + typedef BOOST_PP_CAT(iter, BOOST_PP_INC(n)) iter; + }; + #endif//BOOST_TYPEOF_NO_FUNCTION_TYPES #ifndef BOOST_TYPEOF_NO_MEMBER_FUNCTION_TYPES @@ -83,5 +128,6 @@ #define BOOST_TYPEOF_id VOLATILE_CONST_MEM_FUN_ID #include <boost/typeof/register_mem_functions.hpp> +#undef comma #undef n #endif

2 3

[iostreams 1.42 beta1] gcc warning
by Christoph Duelli 22 Jan '10

22 Jan '10

boost/iostreams/detail/config/unreachable_return.hpp:25:7: warning: no newline at end of file would be great it that could be fixed. Best regards Christoph

1 0

[Polygon] Template error in CodeWarrior when attempting union on polygon_set_data
by Kef Schecter 22 Jan '10

22 Jan '10

I hesitate to mark this as [Polygon] because the error message is in a different part of Boost. However, I have little idea what the actual cause of the problem is or what any of the relevant stuff even means, so I figure [Polygon] is as good as anything at the moment... As before, this is a custom version of CodeWarrior an embedded ARM system, so I have no idea how well it corresponds with other versions of CodeWarrior. Here is a trivial program that illustrates the problem, using the BOOST_VERY_LITTLE_SFINAE patch from the last discussion here: #include <iostream> #define BOOST_VERY_LITTLE_SFINAE #include <boost/polygon/polygon.hpp> using namespace boost::polygon; using namespace boost::polygon::operators; int main() { polygon_set_data<int> ps; ps += rectangle_data<int>(0, 0, 1, 1); return 0; } This results in the following error message : Error : illegal use of template argument dependent type 'T::type' The error occurs in this part of boost/mpl/aux_/preprocessed/plain/and.hpp: template< typename T1, typename T2, typename T3, typename T4 > struct and_impl< true,T1,T2,T3,T4 > : and_impl< BOOST_MPL_AUX_NESTED_TYPE_WKND(T1)::value , T2, T3, T4 , true_ > { }; Any ideas about what's wrong or how to fix it? - Kef

2 3

Re: [boost] boost::mpl::for_each and value_initialized
by Niels Dekker - address until 2010-10-10 22 Jan '10

22 Jan '10

>> Do I understand correctly that you want the memset call to be >> skipped for those compiler versions that have implemented >> value-initialization entirely correctly? Peter Foelsche wrote: > I'm only concerned with boost::mpl::for_each > This function calls a function object by passing an object of the > matching type. > The contents of this object usually do not matter -- and in case they > do, the programmer can write a default constructor to initialize this > object. So there is no need in boost::mpl::for_each to call > value_initialized. So you think the issue can be resolved properly, merely by modifying mpl/for_each.hpp, right? You proposed at http://lists.boost.org/Archives/boost/2009/09/155805.php to modify mpl/for_each.hpp by changing: ! value_initialized<arg> x; ! aux::unwrap(f, 0)(boost::get(x)); Into: ! aux::unwrap(f, 0)(arg()); I see some subtle differences here. First of all, boost::get(x) return a reference to an lvalue, while arg() is an rvalue. Do you think that's okay? Secondly, things *might* go wrong if arg doesn't have a user-declared default-constructor *and* the compiler hasn't correctly implemented value-initialization. That's why Fernando and I added the memset call to boost::value_initialized, of course. But you think the data members of the temporary arg() won't be accessed anyway, right? Unless arg has a user-declared default-constructor? I'm sorry I don't know mpl/for_each.hpp well enough. But if the answer to each of the above questions is yes, I guess your proposal is fine. Kind regards, Niels -- Niels Dekker http://www.xs4all.nl/~nd/dekkerware Scientific programmer at LKEB, Leiden University Medical Center

2 1

MPL bitand.hpp and iso646.h on MSVC 2008
by Nelson, Erik - 2 21 Jan '10

21 Jan '10

If I make a program like #undef BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #include <iso646.h> #include <boost/mpl/bitand.hpp> I get an error like boost/mpl/aux_/include_preprocessed.hpp(37) : fatal error C1083: Cannot open include file: 'boost/mpl/aux_/preprocessed/plain/&.hpp': No such file or directory And if I change it to #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #include <iso646.h> #include <boost/mpl/bitand.hpp> I get 1>c:\work\boost\boost/mpl/aux_/numeric_op.hpp(86) : error C2332: 'struct' : missing tag name 1>c:\work\boost\boost/mpl/aux_/numeric_op.hpp(86) : error C3306: 'boost::mpl::<unnamed-tag>': unnamed class template is not allowed 1>c:\work\boost\boost/mpl/aux_/numeric_op.hpp(86) : error C2143: syntax error : missing ';' before '&' I think the problem is in boost/mpl/bitand.hpp, where #define AUX778076_OP_PREFIX bitand Is defined. 'bitand' is (nonconformantly) #defined to '&' in VC 2008's iso646.h, borking the definition of AUX778076_OP_PREFIX. The fix seems to be to #define AUX778076_OP_PREFIX to something else that MSVC doesn't stomp on. Thanks Erik

1 0

Any Chances for Boost Stable?
by Artyom 21 Jan '10

21 Jan '10

Hello, This mail is rather discussion of possible future Boost policy rather then concrete features it provides. Is there any chance for Stable Boost version? --------------------------------------------- What do I mean stable? Stable as Qt4, stable as STL Port, or STL. Boost is one of the greatest platforms for development of bleeding edge technologies. Like Boost.Asio is one of the greatest Asynchronous API libraries. On the other hand, this library is extremely unstable: each release breaks compatibility with previous one! When I compile a program or library that uses STL I expect that it would continue to work as long as compiler keeps table ABI (GCC - for years). I can compile great GUI application with Qt and expect from it to work for years and be sure that core Qt library includes updates, bug fixes and so. I can't do it with Boost! -------------------------------------------------------- Is there any chance to create a stable Boost branch that includes: - All libraries included in Tr1 - Various other stable libraries. This branch would keep: stable API and ABI, It may include additional libraries and features as long as they do not break API/ABI. Adopt the code such that different changes would not break ABI. For example, if shared_ptr on specific platform uses mutex or atomic counter, it would not be changed withing release because of new supported feature -- meaning config.hpp should be recompiled similarly as it done with autotools. Adopt pimpl policies of Qt to make sure that classes can be easily extended without breaking them. ------------------------------------ I know that this is lot of work and this is totally different from current Boost policy. But Boost should not be only experimental library... It should be as stable as STLPort or STL. -------------------------------- Do we need Boost.Stable branch? -------------------------------- Artyom

9 9

Boost is complicated. This forum too. (please help about accumulators)
by Mahdavi 21 Jan '10

21 Jan '10

{I beg your pardon if you receive multiple of this. I am not sure about its receive.} I hope I am in a right place. I heard that boost is this and that. I am new to boost but have 10 years of programming experience with c++. It is about 10 hours I am searching for a sample about how can I reach to a histogram. For clarity. Please (please I beg you) write some few line of code how to get a histogram. double s[] = { 0, .5 , .6 , .65 , .45 , .7 , .6 , .65 , .45 , .7 , .59 , .52 } ; I want histogram of s ?? I tried many boost codes but I failed all the time. Please help. -- View this message in context: http://old.nabble.com/Boost-is-complicated.-This-forum-too.-%28please-help-… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[GGL] Can't seem to use equals on multi_polygons
by Kef Schecter 21 Jan '10

21 Jan '10

When I try to use equals() on multi_polygons, the compiler blows up, giving a template error. I've tried this in CodeWarrior and MSVC. Using equals() on two polygon_2d's works fine, but it doesn't like it when I use multi_polygons. Is equals() for multi_polygons not implemented, or am I just missing something? I've attached a test program that demonstrates the problem. (I've defined my own integer-based types, like polygon_2di, because I need this to work on an embedded platform with no FPU. Using polygon_2d and doubles instead shows the same problem, though.) - Kef

2 6

error LNK2005
by Kevin Li 21 Jan '10

21 Jan '10

Hello, when the run boost test cases (Version 1.41.0), I got quite a few LNK2005 errors. Below is an example when run a Data_Time test: msvcprt.lib(MSVCP80.dll) : error LNK2005: "public: __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &)" (??0?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@QAE@ABV01@@Z) already defined in dates_as_strings.obj msvcprt.lib(MSVCP80.dll) : error LNK2005: "public: __thiscall std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >::~basic_string<char,struct std::char_traits<char>,class std::allocator<char> >(void)" (??1?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@QAE@XZ) already defined in dates_as_strings.obj It seems to me that there is a conflict between system library and the Boost library, but I am not sure if this is a bug or the Boost library is not correctly built. Any clue would be very appreciated. Best regards, --Kevin _________________________________________________________________

3 5

library for differentiation (interest research)
by DE 21 Jan '10

21 Jan '10

hi all recently i have interested in evaluating of derivatives of complicated functions and discovred that there is a finely developed technique which is called algorithmic differentiation (visit www.autodiff.org if you are interested) the resulting code using an imagined lib may look like this struct { template<typename type> type operator()(type x) //defining function { return sin(x); } } foo; //... double x = 42., f = foo(x), //evaluating function value df = deriv(foo, x); //evaluating derivative value notice that the function' code is untouched the very amazing thing is that the function may be arbitrarily complex it can even be a matrix inversion or eigenvalues evaluation so we get e.g. derivatives of eigenvalues with respect to system parameters gradients, jacobians and higher order derivatives are also possible there are numerous libraries implementing this technique and the questions are: - does it fit into boost collection of libraries? - is it worth building a distinct boost (well-designed) library or adopt a specific lib or to use other (non-boost) libs? and the like personally i am going to investigate the so called tangent mode (or direct mode which is very simple) and probably implement it if i don't find any suitable implementation for my own purposes -- Pavel

2 1

shared_ptr/intrusive_ptr conflict
by Gennadiy Rozental 21 Jan '10

21 Jan '10

Hi, Following snippet fails to compile with gcc 4: ---------------- #include <boost/shared_ptr.hpp> #include <boost/intrusive_ptr.hpp> boost::shared_ptr<void> sharedPtr; template <class T> boost::shared_ptr<T> get_concrete() { return boost::static_pointer_cast<T,void>(sharedPtr); } int main() { boost::shared_ptr<int> p = get_concrete<int>(); } ---------------- due to the presence of intrusive_ptr.hpp. it seems like SFINAE should have kicked in. Any help with how to work this around? Do we need to fix above header? Gennadiy.

2 2

[String Algo] error in ireplace_first or ireplace_all with std::wstring under gcc 3.4.2 (MingW)
by Doug Swanson 20 Jan '10

20 Jan '10

I apologize in advance if this is an inappropriate place to post this question. I posted it to the boost-users list half a week ago and got no replies, so I am trying here instead. The following code compiles and runs without error under g++ in Windows, GCC 3.4.2 (MingW): <code> #include <cstdio> #include <string> #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; int main( void ) { string test = "This is a test"; ireplace_first( test, "test", "success" ); printf( "%s\r\n", test.c_str() ); return 0; } </code> The output is correct: "This is a success". If I change the above code to use a std::wstring instead, it will compile, but it will crash on execution: <code> #include <cstdio> #include <string> #include <boost/algorithm/string.hpp> using namespace std; using namespace boost; int main( void ) { wstring test = L"This is a test"; ireplace_first( test, L"test", L"success" ); printf( "%ws\r\n", test.c_str() ); return 0; } </code> Setting a breakpoint on std::terminate() in gdb gives the following backtrace: Breakpoint 1, 0x00407ae6 in std::terminate() () (gdb) bt #0 0x00407ae6 in std::terminate() () #1 0x00404dc2 in __cxa_throw () #2 0x004021d2 in std::__throw_bad_cast() () #3 0x00434c69 in std::ctype<wchar_t> const& std::use_facet<std::ctype<wchar_t> >(std::locale const&) (__loc=@0x22fe8c) at C:/Applications/Dev-Cpp//bin//../lib/gcc/mingw32//3.4.2//..//..//../../include/c++/3.4.2/bits/locale_facets.tcc:112 #4 0x0043415c in wchar_t std::toupper<wchar_t>(wchar_t, std::locale const&) ( __c=84, __loc=@0x22fe8c) at C:/Applications/Dev-Cpp//bin//../lib/gcc/mingw32//3.4.2//..//..//../../include/c++/3.4.2/bits/locale_facets.h:4553 #5 0x0041648c in bool boost::algorithm::is_iequal::operator()<wchar_t, wchar_t> (wchar_t const&, wchar_t const&) const (this=0x22fe8c, Arg1=@0x3e3df4, Arg2=@0x43702e) at C:/Applications/Boost_new/boost/algorithm/string/compare.hpp:71 #6 0x004163fb in boost::iterator_range<__gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > > boost::algorithm::detail::first_finderF<wchar_t const*, boost::algorithm::is_iequal>::operator()<__gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > > >(__gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >, __gnu_cxx::__normal_iterator<wchar_t*, std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >) const (this=0x22fe80, Begin={_M_current = 0x3e3df4}, End={_M_current = 0x3e3e10}) at C:/Applications/Boost_new/boost/algorithm/string/detail/finder.hpp:76 #7 0x00413fe8 in void boost::algorithm::find_format<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, boost::algorithm::detail::first_finderF<wchar_t const*, boost::algorithm::is_iequal>, boost::algorithm::detail::const_formatF<boost::iterator_range<wchar_t const*> > >(std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&, boost::algorithm::detail::first_finderF<wchar_t const*, boost::algorithm::is_iequal>, boost::algorithm::detail::const_formatF<boost::iterator_range<wchar_t const*> >) ( Input=@0x22ff50, Finder=@0x22fe80, Formatter={m_Format = {m_Begin = 0x43701e, m_End = 0x43702e, singular = false}}) at C:/Applications/Boost_new/boost/algorithm/string/find_format.hpp:146 #8 0x004141b5 in void boost::algorithm::ireplace_first<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >, wchar_t[5], wchar_t[8]> (std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >&, wchar_t[5] const&, wchar_t[8] const&, std::locale const&) (Input=@0x22ff50, Search=@0x43702e, Format=@0x43701e, Loc=@0x22ff40) at C:/Applications/Boost_new/boost/algorithm/string/replace.hpp:259 #9 0x004014e8 in main () at test.cpp:11 I am not competent enough with Boost to understand what the call stack is telling me, except that __throw_bad_cast( ) is the source of the crash. ireplace_all gives the same behavior as ireplace_first above. Furthermore, the problem does not arise if I use replace_first or replace_all instead of ireplace_first or ireplace_all. It compiles and runs correctly. Finally, the problem does not arise if I compile using MSVC 2008. It compiles and runs correctly. Does this indicate a problem with gcc (MingW) unicode support? Is there an easy way to circumvent it? Thank you very much for any suggestions!

3 6

[gil] native image format loaders/savers
by Domagoj Saric 20 Jan '10

20 Jan '10

Would a contribution to GIL in the form of alternate 'native' (e.g. using GDI+ on Windows) implementations (to remove the libjpeg, libtiff, libpng and zlib requirements) of image format parsers be accepted? -- "That men do not learn very much from the lessons of history is the most important of all the lessons of history." Aldous Huxley

2 3

[Boost.tracer] library request
by Andrew Chinkoff 20 Jan '10

20 Jan '10

[Boost.tracer] library request is founded on a desire to trace some statistics about program execution. The sample program below demonstrates these statistics. Sample program file: ******** START OF FILE ******** #include <tracer.h> void foo() { TRACE_LIFETIME; usleep(rand() % 100000); } int main() { TRACE_LIFETIME; for(int i = 0; i < 100; ++i) foo(); } ******** END OF FILE ******** Produced log file: ******** START OF FILE ******** All the program time: 05265686 us (micro secs) TRACE POINT: Function: int main() Calls: 0000000001 times Average T between calls: 0000000000 us Average life T: 0005264459 us File: main.cpp Line: 00000009 TRACE POINT: Function: void foo() Calls: 0000000100 times Average T between calls: 0000051665 us Average life T: 0000052606 us File: main.cpp Line: 00000004 ******** END OF FILE ******** Comment: TRACE_LIFETIME is a MACRO that traces some scope statistics, namely: "Function" - the function name where the scope is; "Calls" - number of entries into this scope; "Average T between calls" - average time period between "Calls"; "Average life T" - average time spent in this scope. Conclusion: I think it is reasonable to introduce this trace functionality into (for example) boost::tracer namespace. I had wrote tracer.h and tracer.cpp source files and I wish Boost community to consider them. Thank You.

4 6

[1.42.0] Beta 1 release candidate
by Beman Dawes 20 Jan '10

20 Jan '10

Release candidates for 1.42.0 beta 1 are available at http://boost.cowic.de/rc/ Please download, do a build, and report results here. Also let us know if you spot any problems or have any other comments. Thanks, --Beman

7 8

[date_time] [patch][1.42] Trac #2757 - fix warning
by Sylvester-Bradley, Gareth 20 Jan '10

20 Jan '10

On 19 January 2010 22:14, Marshall Clow wrote: > Downloaded, built w/no errors (a bunch of warnings) here. > Mac OS X 10.6.2, gcc 4.2.1 I guess it's too late to apply the simple patch for date_time from ticket #2757 in 1.42.0, but how about on trunk? This would suppress over 1000 instances of the same warning when compiling my app at /W4 on Windows, VC90; this is the only warning I see! https://svn.boost.org/trac/boost/ticket/2757 The ticket was opened almost a year ago, and FWIW the patch (included at that time) has worked for more than one person. Best regards, Gareth ************************************************************************ The information contained in this message or any of its attachments may be confidential and is intended for the exclusive use of the addressee(s). Any disclosure, reproduction, distribution or other dissemination or use of this communication is strictly prohibited without the express permission of the sender. The views expressed in this email are those of the individual and not necessarily those of Sony or Sony affiliated companies. Sony email is for business use only. This email and any response may be monitored by Sony to be in compliance with Sony's global policies and standards

1 0

[BoostCon 2010] Final Call for Participation
by Hartmut Kaiser 20 Jan '10

20 Jan '10

Please distribute! -------------------------------- 4th Annual Boost Conference 2010 -------------------------------- Aspen CO, USA, May 10-14, 2010, www.boostcon.com Final Call for Participation -------------------------------- Important dates: Proposal submissions Extended to January 3, 2010 Proposals decisions sent January 25, 2010 (tentative program available) Fully scheduled program available February 10, 2010 Session materials due April 15, 2010 -------------------------------- We invite you to submit session proposals to the 4th Annual Boost Conference: BoostCon 2010 (Aspen CO, USA, May 10-14, 2010). Traditionally the main face-to-face event for all things Boost (www.boost.org) BoostCon 2010 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 two constituencies: Boost end-users and hard-core Boost library and tool developers. The program fosters interaction and engagement within and across those two 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 will change 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 * 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=boostcon10. 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 2010 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 boostcon10(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. 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

2 1

Re: [boost] Boost library submission (poll for interest)
by Bob Walters 20 Jan '10

20 Jan '10

Sorry for the delay here. Original reply bounced due to 'reply to digest' subject line. On Tue, 5 Jan 2010 21:21:29 +0100, "vicente.botet" <vicente.botet(a)wanadoo.fr> wrote: > I'm interested on a library that has transactional shared memory, but something more general that your containers database in shared memory. Can your library be extendeed to manage with types that are not containers? Currently there is an interface between the trans infrastructure (TI) and the containers allowing the containers to offer transactional operations, and indicate to the TI how they should be logged, committed, etc. This was intended to help make adding containers easier. There isn't really an assumption that transactional objects are containers - they could be anything which adheres to the interface. For example: I'm planning a quick wrapper for types T which makes T transactional for updates done to it via operator=. I need this for integerss that I want to use as sequences in one use of STLdb. (e.g. for key generation.) > If I have understood, the data is stored using Boost.Interprocess. Could you clarify why do you force the stored types to be Serializable? I'm not relying on the durability of the boost interprocess region. Nor am I trying to serialize the shared memory from directly to disk. Stefan has challenged me to do that, and I'm considering a variation which would do that, but it isn't without it's own issues. For now, I went with the approach of using serialization for sending K,V types to logs or checkpoints as a way to avoid those issues. My current concern with direct storage is that (assuming K and V may not be concrete types) it seems like it will require a lot of memory use tracking which could add an unwanted expense to shared memory pointer traversal. > With your library, there are alreasy 3 libraries under construction providing a transactional service (Boost.STLdb, Boost.Persistent and TBoost.STM). The ideal would be to have a single transactional framework with several transactional resources, e.g shared memory resource (Boost.STLdb), persistent resource (Boost.Persistent ), in memory resource (Boost.STM). If I'm not wrong Boost.Persistent contains already a Ressource concept. I would like to see how this transactional framework can be made generic so the three libraries can share the same transaction. Stefan, Bob, are you interesteed in participating on such a framework? Yes. Stefan had suggested this in private e-mails earlier, and I'll have to adapt to fit his interfaces. As I've alluded previously, I would like to see it possible to use Boost.Persistence with my library, as several shortcomings of STLdb would be addressed in that way. Part of doing that involved bringing all transaction control under one manager. Stefans library is the most robust in this sense, so I plan to work with and adapt to his interfaces. > Could you give a link from where to download the code. If you want I can add your library to the Boost Libraries Under Construction page https://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction. Currently it's in subversion only on sourceforge. I'm finishing some changes to the checkpointing mechanism, and I'm going to finish that first. Will let you know when its ready, thereby supporting the under construction entry. If it helps at all, I could move the SVN repository to the sandbox, or post the tarball into the Vault (?)

5 12

[boost-lists][string algo] C++0x string algo.
by Germán Diago 19 Jan '10

19 Jan '10

Hello. I'm using c++0x-enabled c++0x compiler. I was going to use this piece of code: typedef vector< string > split_vector_type; split_vector_type svec; split(svec, str, is_any_of(":")); for c++0x, I shouldn't need to define a typedef to take advantage of that. I think it would be more idiomatic (and way easier to do) to use something like this: auto splitrange = split(str, is_any_of(":")); So I would like to know if it's possible to map split to a range result by default (not a vector, maybe). And it could also be used with a vector if you put it explicitly: auto splitvec = split<vector<string>>(str, ....); I think the whole library should be readapted to return by value. I've spent some time figuring how to use the library because of the out parameters in the arguments. Can anyone tell me if there is any plan to change this? Or if it should be possible? Thanks in advance.

5 11

[random] normal_distribution
by Neal Becker 19 Jan '10

19 Jan '10

According to: http://www.taygeta.com/random/gaussian.html The method we're using is less stable and less computationally efficient than the method presented there. Is this true?

1 0

The boost component dependencies blues
by Stefan Seefeld 19 Jan '10

19 Jan '10

I'm not sure what the best place is for this question, but since it is symptomatic for a general theme (which I have complained about a lot in the past), I'll write it here: I'm trying to generate a boost subset that allows me to build boost.python and its dependencies into my own package. To do that, I ran "bcp python ...". I'm surprised to find all these components in the generated source tree: date_time, graph, mpi, regex, serialization, test, thread. And that's only compiled components (content of lib/). There are many more header-only components (i.e. subdirectories under boost/), such as spirit, variant, property_map, property_tree, dynamic_bitset. Is this really a minimal subset to use boost.python ? I can't quite believe it. In particular, what is boost.mpi doing there, and what boost.serialization (and boost.spirit) ? I'm going to great length to be able to use boost in a production environment, but I have to admit that this is quite unacceptable. :-( Stefan -- ...ich hab' noch einen Koffer in Berlin...

9 24

[math] Comeau can't match math::tools::fmod_workaround
by Mateusz Loskot 19 Jan '10

19 Jan '10

Hi, I'm not sure if I should submit this issue directly to Trac, so I decided to post it here first. Compiling Boost.Math using Comeau + GCC on Linux throws error that suggests mismatch of dobule and long double where single type T is expected: como-linux.compile.c++ ../../../bin.v2/libs/math/build/como-linux/debug/link-static/ellint_3l.o Comeau C/C++ 4.3.10.1 (May 7 2008 12:23:21) for LINUX_INTEL_ELF_Beta Copyright 1988-2008 Comeau Computing. All rights reserved. MODE:non-strict warnings C++ noC++0x_extensions "../../../boost/math/special_functions/ellint_3.hpp", line 185: error: no instance of function template "boost::math::tools::fmod_workaround" matches the argument list argument types are: (double, long double) T rphi = boost::math::tools::fmod_workaround(fabs(phi), T(constants::pi<T>() / 2)); ^ detected during instantiation of "T boost::math::detail::ellint_pi_imp(T, T, T, T, const Policy &) [with T=long double, Policy=c_policies::c_policy]" at line 309 1 error detected in the compilation of "../../../libs/math/build/../src/tr1/ellint_3l.cpp". como -tused -c --long_long -DBOOST_ALL_NO_LIB=1 -D_GNU_SOURCE=1 --no_inlining -O0 -g --exceptions -I"../../.." -I"../../../libs/math/src/tr1" -o "../../../bin.v2/libs/math/build/como-linux/debug/link-static/ellint_3l.o" "../../../libs/math/build/../src/tr1/ellint_3l.cpp" Could any one confirm if it is an error indeed? Should I submit ticket? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net Charter Member of OSGeo, http://osgeo.org

2 10

[Signals2] Using dummy_mutex in a multithreaded program
by Peter Petrov 18 Jan '10

18 Jan '10

Greetings Frank, boosters, Currently using a signal with a boost::signals2:dummy_mutex works well only in single-threaded programs. I'm wondering if it can be made a little more useful. I have an use case with a single global signal, where all slots and connections are setup on program start. Afterwards a bunch of threads are fired, and each of them can call the signal's operator(). There are no more connections added/removed, only signal invocations. According to the workflow described here: http://www.boost.org/doc/libs/1_41_0/doc/html/signals2/thread-safety.html#i… ...it seems that a dummy_mutex should be enough, since the slot list is never modified. It turns out it's not - I'm getting assertion failures in nolock_cleanup_connections() because the _shared_state.unique() requirement is sometimes violated. Because using a real mutex will significantly degrade both performance and concurrency, I'm wondering if this assertion is really necessary. In this case it should be safe to continue even if the uniqueness is violated, because the connection list is never modified. And I think my use case is quite common :) - Peter

2 2

[chrono] v0.3 New Stopwatch Feature
by vicente.botet 18 Jan '10

18 Jan '10

Hi, I'm pleased to announce the new version of the Boost.Chrono library. The implementaton is quite stable; the new interface could suffer of some modifications, renaming, ... as far as you submit some proposals. I would request a formal review soon and I will need a review manager. I know that review managers are hard to find, so if you are interested in the library, please the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. I've tested it with gcc and MSVC. Previoous version of the library have been testted on Mac, but I'm not able to test this platform. Could someone check if there are some regressions on Mac? New Features: * Process cpu clocks * Independent process cpu clocks for real, user, system process CPU time * Global process cpu clock for real, user, system process CPU time * Stopwatch concept measuring elapsed time between different points in time associated to the operations start, stop, suspend and resume. * stopwatch is a model Stopwatch measuring the elapsed time between the start and the stop operations. * stopwatch_accumulator is a model Stopwatch allowing to accumulate several time samples and give the average, ... * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopwatch Formatter concept * stopwatch formatter "%ds\n" * stopwatch accumulator formatter "%c times, sum%ss, min%ms, max%Ms, mean%as\n" * time formatter "real %rs, cpu %cs (%p%), user %us, system %ss\n" * digital_time decomposition class separating days, hours,minutes,seconds, nanoseconds from any duration class (looking for a better name) * digital_time formatter "%d days(s) %h:%m:%s.%n\n" * stopwatch_reporter is a convenient generic class reporting elapsed time for the Stopwatch concept. * stopclock<Clock> shortcut stopwatch_reporter<stopwatch<Clcok>> * typeof registration for classes duration and time_point Depreceated Features: * The classes process_times, process_clock, process_timer, timer and run_timer are now deprecated as the preceding additions are more generic. However for backward compatibility they are preserved until inclusion of the library in Boost. Next follows the equivalences: timer<> ~ stopwatch<> process_timer ~ stopwatch<process_cpu_clock> run_timer ~ stopclock<> Bug Fixes * Try to correct warning C4251: 'boost::chrono::run_timer::m_format' : class 'std::basic_string<_Elem,_Traits,_Ax>' needs to have dll-interface to be used by clients of class 'boost::chrono::run_timer', by don't including inlines functions using the std::string m_format. For people that doesn't know it yet, Boost.Chrono library provides: * The C++0x Standard Library's common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * typeof registration for classes duration and time_point * Process clocks: * process_real_CPU_clocks, capturing real-CPU times. * process_user_CPU_clocks, capturing user-CPU times. * process_system_CPU_clocks, capturing system-CPU times. * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. * Stopwatches: * stopwatch, capturing elapsed Clock times. * stopwatch_accumulator, capturing cummulated elapsed Clock times. * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopclocks or Stopwatch reporters: * stopwatch_reporter, convenient reporting of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Best regards, _____________________ Vicente Juan Botet Escribá

4 8

[inspect] Changes to Inspection Report
by Beman Dawes 18 Jan '10

18 Jan '10

The latest run of the trunk inspection report is up at http://boost.cowic.de/rc/inspect-trunk.html Several new features have been added: * References to unknown bookmarks are now detected. * Duplicate bookmarks are now detected. * Each problem detected is reported on a separate line, to make it easier to work with files that have multiple problems. For example, see the errors below in the filesystem library. Comments? --Beman filesystem libs/filesystem/doc/faq.htm: *LINK* unknown bookmark: #global libs/filesystem/doc/i18n.html: *LINK* unknown bookmark: #Footnote *LINK* unknown bookmark: #status libs/filesystem/doc/index.htm: *LINK* unknown bookmark: #path libs/filesystem/doc/reference.html: *LINK* duplicate bookmark: exists *LINK* duplicate bookmark: initial_path *LINK* unknown bookmark: #basic_directory_entry-comparisons *LINK* unknown bookmark: #operator-eq libs/filesystem/test/deprecated_test.cpp: *APPLE-MACROS* violation of Boost apple-macro guidelines on line 21 *APPLE-MACROS* violation of Boost apple-macro guidelines on line 27 libs/filesystem/test/path_test.cpp: *APPLE-MACROS* violation of Boost apple-macro guidelines on line 34 *APPLE-MACROS* violation of Boost apple-macro guidelines on line 43

8 11

[1.42] Release Notes
by Daniel James 18 Jan '10

18 Jan '10

Hi, Just a quick reminder about the release notes. This is the ideal time to add them to 'boost_1_42_0.qbk' in: https://svn.boost.org/svn/boost/website/public_html/beta/feed/history/ Or if you send them to the list and I'll add them for you. It's helpful if they're added before the beta, so that beta testers know what needs testing. thanks, Daniel

2 3

[1.42.0] Ready for beta?
by Beman Dawes 18 Jan '10

18 Jan '10

How do we look for going ahead with the beta? Unless there are concerns, I'll start putting the beta together later today. --Beman

1 0

[interval containers (itl)] found review manager. New release on sourceforge
by Joachim Faulhaber 18 Jan '10

18 Jan '10

Dear list! I am pleased to announce that Hartmut Kaiser now supports my library of interval containers as review manager. Although this was not necessarily intended, the planned date for the review already found it's way into the review schedule. But this is unofficial as long as Hartmut has not done his announcement of the review period. In preparation to the review I have done some improvements mainly for documentation of the extended parts of the itl, so I have uploaded a new release to the itl's project page on sourceforge http://sourceforge.net/projects/itl/ There are a few corrections and additions to the quickbook docs of the core library itl which is submitted for review: http://herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html For the extended parts there is a doxygen generated documentation http://www.herold-faulhaber.de/itl/index.html that now also contains a commented example for a law based test http://www.herold-faulhaber.de/itl/de__morgan_8cpp.html for people how are interested how this works. Any feed back, comments and suggestions are welcome. Best regards Joachim --------------------------------------------------------------------- Interval Template Library (ITL) | Boost.IntervalContainers --------------------------------------------------------------------- Availability: Project page at sourceforge: http://sourceforge.net/projects/itl/ Boost Vault: http://www.boostpro.com/vault/index.php?&direction=0&order=&directory=Conta… Boost Quickbook documentation (corelibrary itl) http://www.herold-faulhaber.de/boost_itl/doc/libs/itl/doc/html/index.html Doxygen Documentation (extensions itl_xt, validate) http://www.herold-faulhaber.de/itl/index.html The name ITL is provisional and will probably be changed to Boost.IntervalContainers after the review.

1 0

[property_tree] stream_translator <-> lexical_cast
by Domagoj Saric 18 Jan '10

18 Jan '10

By scanning briefly through the property_tree implementation I noticed that it uses its own stream_translator<> class for string-to-other_type and vice verse conversions. The functionality seems very similar/overlapping to that of lexical_cast (and also uses streams), if this is true this part of property_tree should probably be refactored to use lexical_cast so that it gets implicitly 'fixed' when/if lexical_cast gets fixed (regarding the issues outlined in the previous relevant post). -- "That men do not learn very much from the lessons of history is the most important of all the lessons of history." Aldous Huxley

1 0

Boost.Filesystem: basename function is not compatible with POSIX; potential for path-related security issues
by Steve M. Robbins 18 Jan '10

18 Jan '10

Hi, I got the following report [1] for Boost.Filesystem from a Debian user. Before entering into trac, I thought I'd ask whether this deviation from POSIX is by design or is a bug. Thanks, -Steve P.S. The original report is based on Boost 1.40, but I verified the same behaviour on Boost 1.41. [1] http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=565504 ----- Forwarded message from Roger Leigh <rleigh(a)debian.org> ----- Package: libboost-filesystem1.40.0 Version: 1.40.0-5 Severity: important The basename function is not compatible with the POSIX function by the same name: Path POSIX Boost test.real test.real test /usr/bin/perl perl perl /usr/lib lib lib /usr/ usr usr usr usr / / / . . .. .. . The test program is attached. Just compile with g++ -o testbasename -lboost_filesystem testbasename.cc http://www.opengroup.org/onlinepubs/000095399/functions/basename.html ??? It is not stripping trailing backslashes. ??? "if ph.leaf() contains a dot ('.'), returns the substring of ph.leaf() starting from beginning and ending at the last dot (the dot is not included). Otherwise, returns ph.leaf()". This is wrong, shown by the paths returned for "." ("") and ".." (".") above. The latter could lead to reading and writing using the wrong path, which could have security issues if used in a secure context. This might be justification for raising the severity of this bug. Looking at the API reference, it looks like extension() and basename() may be intended to be complementary and are for splitting a filename into its main part and extension part, *not* the directory and filename components of a path. This should probably be explicitly spelled out due to the dangerous confusion which may result if used inappropriately. In particular, "." and ".." definitely need special casing--these are not extension separators and basename should return them intact; extension() should return an empty string. I noticed this when converting schroot to use the boost convenience function instead of my own. For reference, this is my version: std::string sbuild::basename (std::string name, char separator = '/') { // Remove trailing separators std::string::size_type cur = name.length(); while (cur > 0 && name[cur - 1] == separator) --cur; name.resize(cur); // Find last separator std::string::size_type pos = name.rfind(separator); std::string ret; if (pos == std::string::npos) ret = name; // No separators else if (pos == 0 && name.length() == 1 && name[0] == separator) ret = separator; // Only separators else ret = name.substr(pos + 1); // Basename only // Remove any duplicate adjacent path separators return remove_duplicates(ret, separator); } A POSIX-compatible dirname() function would nicely complement a POSIX-compatible basename() function as an addition to boost::filesystem. It looks like these are orthogonal to the existing functionality, however. Regards, Roger -- System Information: Debian Release: squeeze/sid APT prefers unstable APT policy: (550, 'unstable') Architecture: amd64 (x86_64) Kernel: Linux 2.6.32-trunk-amd64 (SMP w/4 CPU cores) Locale: LANG=en_GB.UTF-8, LC_CTYPE=en_GB.UTF-8 (charmap=UTF-8) Shell: /bin/sh linked to /bin/dash Versions of packages libboost-filesystem1.40.0 depends on: ii libboost-system1.40.0 1.40.0-5 Operating system (e.g. diagnostics ii libc6 2.10.2-5 Embedded GNU C Library: Shared lib ii libgcc1 1:4.4.2-9 GCC support library ii libstdc++6 4.4.2-9 The GNU Standard C++ Library v3 libboost-filesystem1.40.0 recommends no packages. libboost-filesystem1.40.0 suggests no packages. -- no debconf information #include <libgen.h> #include <boost/filesystem/convenience.hpp> #include <cstring> #include <iostream> #include <iomanip> int main () { const char *paths[] = { "test.real", "/usr/bin/perl", "/usr/lib", "/usr/", "usr", "/", ".", "..", 0 }; std::cout << std::setw(16) << std::left << "Path" << std::setw(16) << std::left << "POSIX" << std::setw(16) << std::left << "Boost" << '\n'; for (const char **path = &paths[0]; *path != 0; ++path) { char *bpath = strdup(*path); std::cout << std::setw(16) << std::left << *path << std::setw(16) << std::left << basename(bpath) << std::setw(16) << std::left << boost::filesystem::basename(*path) << '\n'; free(bpath); } return 0; } _______________________________________________ pkg-boost-devel mailing list pkg-boost-devel(a)lists.alioth.debian.org http://lists.alioth.debian.org/mailman/listinfo/pkg-boost-devel ----- End forwarded message -----

2 1

String literals concatenation issue when using BOOST_CURRENT_FUNCTION
by vicente.botet 16 Jan '10

16 Jan '10

Hi, I want to define a macro as #define BOOST_CHRONO_DIGITAL_TIME_FORMAT(F) "\n" F " tokes %d day(s) %h:%m:%s.%n\n" #define BOOST_CHRONO_DIGITAL_TIME_FUNCTION_FORMAT BOOST_CHRONO_DIGITAL_TIME_FORMAT(BOOST_CURRENT_FUNCTION) I have a compile error with gcc(3.4.4 or 4.4.0) (Boost v1.41) in the following sentence const char* c= "\n" BOOST_CURRENT_FUNCTION " %d day(s) %h:%m:%s.%n\n"; C:\cygwin\boost_1_41_0\libs\chrono\example\digital_time_example.cpp: In function `int f1(long int)': C:\cygwin\boost_1_41_0\libs\chrono\example\digital_time_example.cpp:24: error: expected `;' before "__PRETTY_FUNCTION__" as well as const char* c= "\n" __PRETTY_FUNCTION__ " %d day(s) %h:%m:%s.%n\n"; The same code works as I expected with MSVC. The following code works well with gcc const char* c= "\n" "f" " %d day(s) %h:%m:%s.%n\n"; const char* c2= BOOST_CURRENT_FUNCTION; as well as this one const char* c= "\n" __FILE__" %d day(s) %h:%m:%s.%n\n"; Is there something wrong? Does gcc manage __PRETTY_FUNCTION__ and __FILE__ differently? Does someone knows a workaround? Best, _____________________ Vicente Juan Botet Escribá

2 3

[python] const-correctness and get_signature
by Jim Bosch 16 Jan '10

16 Jan '10

I've been working on an idea to provide optional const-handling in boost.python wrapped classes. It's coming along pretty well, but I've run into one major sticking point: the get_signature functions that extract the argument types of member function pointers into mpl sequences remove any cv-qualification on the hidden 'this' argument. This seems to be intentional - from the comments in python/signature.hpp: // Note that cv-qualification is dropped from // the "hidden this" argument of member functions; that is a // necessary sacrifice to ensure that an lvalue from_python converter // is used. This doesn't actually seem necessary; for a normal wrapped class, the special-case lvalue converter will always be the highest priority, and for a const member function, supporting rvalue converters as a fall-back wouldn't do any harm that I can see (and would help me out considerably). Could this be a relic from before wrapped class lvalue conversions were handled as a special case? Anyhow, if my hypothesis is correct, and there isn't a need to drop the cv-qualifiers in get_signature, I'd like to make a ticket and submit a patch to change it - but I wanted to check here first to see if maybe that breaks something else. Thanks! Jim Bosch

1 0

[release] files from previous releases (was: Re: [ Fusion ] Extra files in "release"?)
by Tobias Schwinger 15 Jan '10

15 Jan '10

Joel de Guzman wrote: > Marshall Clow wrote: >> Hey Joel -- >> >> I noticed that there are a bunch of fusion files that only exist in >> the release branch, and not in the trunk. >> Is that on purpose? > Thanks for reporting! Seems a "release procedure issue" to me; the trunk has apparently been copied over an old release where those files were still present and needed. Those files can be deleted from the release branch (gone from trunk since February 09, last changes on Fusion in June 09). I just read that the release branch is about to freeze so posting to boost.devel for the Release Managers to join in. Also, there might be similar issues for other libraries. >> boost/fusion/functional/adapter/detail/pow2_explode.hpp >> boost/fusion/functional/adapter/detail/pt_def.hpp >> boost/fusion/functional/adapter/detail/pt_undef.hpp >> boost/fusion/functional/adapter/unfused_generic.hpp >> boost/fusion/functional/adapter/unfused_lvalue_args.hpp >> boost/fusion/functional/adapter/unfused_rvalue_args.hpp >> boost/fusion/functional/generation/make_unfused_generic.hpp >> boost/fusion/functional/generation/make_unfused_lvalue_args.hpp >> boost/fusion/functional/generation/make_unfused_rvalue_args.hpp >> >> libs/fusion/doc/html/fusion/functional/adapters/unfused_generic.html >> libs/fusion/doc/html/fusion/functional/adapters/unfused_lvalue_args.html >> libs/fusion/doc/html/fusion/functional/adapters/unfused_rvalue_args.html >> libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_genrc.html >> >> libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_lvargs.html >> >> libs/fusion/doc/html/fusion/functional/generation/functions/mk_unfused_rvargs.html >> >> libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_genrc.html >> >> libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_lvargs.html >> >> libs/fusion/doc/html/fusion/functional/generation/metafunctions/mk_unfused_rvargs.html >> >> libs/fusion/test/functional/make_unfused_generic.cpp >> libs/fusion/test/functional/make_unfused_lvalue_args.cpp >> libs/fusion/test/functional/make_unfused_rvalue_args.cpp >> libs/fusion/test/functional/unfused_generic.cpp >> libs/fusion/test/functional/unfused_lvalue_args.cpp >> libs/fusion/test/functional/unfused_rvalue_args.cpp >> Regards, Tobias

6 14

[python] patch modules_init.hpp to expand macros
by Neal Becker 15 Jan '10

15 Jan '10

This patch replaces use of ## and # with BOOST_PP_CAT and BOOST_PP_STRINGIZE. This is needed so that python module names can be programmatically generated. https://svn.boost.org/trac/boost/ticket/3843

1 0