August 2009 - Boost - lists.preview.boost.org

bad include guards
by Steven Watanabe 26 Jan '17

26 Jan '17

AMDG The following pairs of files have identical include guards ./boost/concept_check/general.hpp ./boost/concept/detail/msvc.hpp ./boost/concept_check/msvc.hpp ./boost/concept/detail/msvc.hpp ./boost/filesystem/cerrno.hpp ./boost/cerrno.hpp ./boost/interprocess/containers/tree.hpp ./boost/interprocess/containers/detail/tree.hpp ./boost/mpl/min_max.hpp ./boost/mpl/max.hpp ./boost/mpl/vector/aux_/front.hpp ./boost/mpl/list/aux_/front.hpp ./boost/multi_index/identity_fwd.hpp ./boost/multi_index/identity.hpp ./boost/python/pointee.hpp ./boost/python/detail/pointee.hpp ./boost/spirit/phoenix/closures.hpp ./boost/lambda/closures.hpp ./boost/xpressive/proto/v1_/proto_typeof.hpp ./boost/xpressive/proto/proto_typeof.hpp ./libs/config/test/boost_no_dep_nested_class.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_mem_templates.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_std_allocator.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/conversion/test.hpp ./libs/any/test.hpp ./libs/interprocess/example/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/expand_bwd_test_template.hpp ./libs/interprocess/test/allocation_test_template.hpp ./libs/interprocess/test/printcontainer.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/iostreams/test/detail/utf8_codecvt_facet.hpp ./boost/detail/utf8_codecvt_facet.hpp ./libs/regex/test/regress/test_regex_search.hpp ./libs/regex/test/regress/test_partial_match.hpp ./libs/serialization/test/C.hpp ./libs/serialization/test/A.hpp ./libs/xpressive/perf/regex_comparison.hpp ./libs/regex/performance/regex_comparison.hpp ./tools/inspect/time_string.hpp ./tools/common/time_string.hpp In Christ, Steven Watanabe

5 8

Why no non-null smart pointers?
by Ross MacGregor 29 Apr '14

29 Apr '14

I just created a very small smart pointer libary for our project. It will contain two types of shared pointers: SharedHandle and NullableSharedHandle. SharedHandle will be a shared pointer that cannot be null by ensuring a non-null construction while NullableSharedHandle will basically be a typedef for boost::shared_ptr. I firmly believe that code can be made more reliable by minimizing the use of nullable pointers. To this end, I think it is important that we start using non-null pointer types. Ideally the compiler would be able to understand a non-null pointer and catch bugs at compile time, but I think we can still improve things with a few runtime checks. If we make sure that a shared pointer is constructed with a non-null pointer and ban any reset() type methods, we guarentee that it points to something. This can be beneficial for the following reasons: 1. Any function that uses this type will no longer be burdened with precondition checks to make sure variables of this type are not null. 2. It's type is simply more explicit and better explains its function. 3. Moving the non-null check to the creation phase will reduce the possibility of encountering null pointer exceptions at runtime (assuming there are many more pointer references than constructor calls). So my little pointer library seems to make a lot of sense, but if so why hasn't this simple smart pointer variation made it into boost yet? Has this been discussed somewhere already? My search on non-null smart pointers is not revealing much discussion on the topic. Regards, Ross

9 16

[#pragma once]
by Sid Sacek 18 Nov '12

18 Nov '12

I've worked with the MSVC, Sun and GCC compilers. Each one of them supports #pragma once. Is there any reason to wrap this pragma within #ifdefs? Are there any compilers out there today that don't support this #pragma? #if defined( _MSC_VER ) && ( _MSC_VER >= 1020 ) # pragma once #endif Could we change this coding pattern so that it no longer looks like MSVC is being selfish? -Sid Sacek

17 20

[interprocess] message_queue hangs when another process dies
by Sergei Politov 03 Nov '11

03 Nov '11

Hi, I have found the following problem with message_queue on win32 (MSVC 2008 + Windows Vista). Suppose we have 2 processes, one sends messages to queue, another reads them. When reading process dies (for instance using End process) during message_queue.receive the another process hangs in send. As I found during investigation, it tries to lock interprocess mutex, but it is already locked by dead process. So this message queue instance becomes unusable. I attached the example. Steps to reproduce: 1) Start "mq.exe s" (i.e. with argument s) It outs: sender: $PID 2) Start mq.exe without arguments. It outs: receiver: $PID 0 1 2 3 4 This time sender outs: send done: 3) At this point the message queue is empty and receiver waits for messages. End it with Task Manager. 4) Enter some number in sender console and press Enter. 5) The sender hangs in message_queue.send Best Regards, Sergei

6 13

Re: [boost] [date_time] Time zone improvements
by Rutger ter Borg 25 May '11

25 May '11

Jeff Garland wrote: > Very cool :-) One question -- is there a portable solution where a user > could deploy a files onto a Windows system or is it a Unix only solution? > I'm fine with incorporating a *nix only solution because what your > suggesting will be a nice solution for *nix platforms, but it will need to > be clear that it's not portable. I don't see why it wouldn't be possible to deploy the (big-endian) binary files to any platform. Getting it into this binary form (using zone info compiler zic) may be harder to do cross-platform, but cygwin may help here. [snip] > As the primary maintainer of Boost date-time I can say with certainty that > there is interest in this functionality -- it's long been on my todo list > and I haven't had time to get to it. You can email me privately and we > can discuss all the details of how to get your code incorporated. I'll do! Regards, Rutger

5 9

[serialization] boost/serialization/path.hpp
by Johan Råde 21 Feb '11

21 Feb '11

There is no boost/serialization/path.hpp. I suggest the following: ---------------------------------------------------------------------------------------------------------------- #ifndef BOOST_SERIALIZATION_PATH_HPP #define BOOST_SERIALIZATION_PATH_HPP // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) #pragma once #endif #include <boost/config.hpp> #include <boost/filesystem/path.hpp> #include <boost/serialization/level.hpp> BOOST_CLASS_IMPLEMENTATION(boost::filesystem::path, boost::serialization::primitive_type) #ifndef BOOST_NO_STD_WSTRING BOOST_CLASS_IMPLEMENTATION(boost::filesystem::wpath, boost::serialization::primitive_type) #endif namespace boost { namespace serialization { template<class Archive, class String, class Traits> void serialize(Archive& ar, boost::filesystem::basic_path<String, Traits>& p, const unsigned int version) { String s; if(Archive::is_saving::value) s = p.string(); ar & boost::serialization::make_nvp("string", s); if(Archive::is_loading::value) p = s; } }} #endif //-------------------------------------------------------------------------------------------------------------- Comments? Any suggested improvements? --Johan Råde

5 11

[C++0x] Emulation of scoped enums
by Beman Dawes 16 Feb '11

16 Feb '11

The improved type safety of the C++0x scoped enum feature is attractive, so I'd like to start using it as it becomes available in compilers. See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2347.pdf for a description. Note that the committee changed the name from strongly typed enums to scoped enums. See the attached for a boost/detail header that provides macro wrappers that use scoped enums if available, otherwise fall back on C++03 namespaces and unscoped enums. It lets a library write: BOOST_SCOPED_ENUM_START(algae) { green, red, cyan }; BOOST_SCOPED_ENUM_END ... BOOST_SCOPED_ENUM(algae) sample( algae::red ); void func(BOOST_SCOPED_ENUM(algae)); and then a user can write: sample = algae::green; func( algae::cyan ); Comments or suggestions appreciated, --Beman // scoped_enum_emulation.hpp ---------------------------------------------------------// // Copyright Beman Dawes, 2009 // Distributed under the Boost Software License, Version 1.0. // See http://www.boost.org/LICENSE_1_0.txt // Generates C++0x scoped enums if the feature is present, otherwise emulates C++0x // scoped enums with C++03 namespaces and enums. The Boost.Config BOOST_NO_SCOPED_ENUMS // macro is used to detect feature support. // // Caution: only the syntax is emulated; the semantics are not emulated and // the syntax emulation doesn't include being able to specify the underlying type. // // See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2347.pdf for a // description of the feature. Note that the committee changed the name from // strongly typed enums to scoped enums. // // Sample usage: // // BOOST_SCOPED_ENUM_START(algae) { green, red, cyan }; BOOST_SCOPED_ENUM_END // ... // BOOST_SCOPED_ENUM(algae) sample( algae::red ); // void foo( BOOST_SCOPED_ENUM(algae) color ); // ... // sample = algae::green; // foo( algae::cyan ); #ifndef BOOST_SCOPED_ENUM_EMULATION_HPP #define BOOST_SCOPED_ENUM_EMULATION_HPP #include <boost/config.hpp> #ifndef BOOST_NO_SCOPED_ENUMS # define BOOST_SCOPED_ENUM_START(name) enum class name # define BOOST_SCOPED_ENUM_END # define BOOST_SCOPED_ENUM(name) name #else # define BOOST_SCOPED_ENUM_START(name) namespace name { enum enum_t # define BOOST_SCOPED_ENUM_END } # define BOOST_SCOPED_ENUM(name) name::enum_t #endif #endif // BOOST_SCOPED_ENUM_EMULATION_HPP

14 27

[process] How to run test cases
by Boris 23 Jan '11

23 Jan '11

As Boost.Process 0.3 has been released it would be great if the test cases are run on various platforms. So far I've tested Boost.Process on WinXP with MSVC 9.0, Cygwin with g++ 3.4.4 and Solaris with g++ 3.4.6 and Sun C++ 5.9. To make it as easy as possible for others to run the test cases here's a short description of how to proceed. Nearly all test cases depend on a program called "helpers". This program is built first and is started by many test cases as a child process. In order to find the program "helpers" the test cases must know its location. As there is no way to get the location at runtime it is hardcoded in the file libs/process/test/misc.hpp. As the location differs depending on what compiler is used YOU MUST CHECK FIRST THE PATH IN libs/process/test/misc.hpp! Otherwise most of the test cases will fail as they look for a program "helpers" in the wrong directory. As of today only those paths are correct and have been tested which are set for Windows, Cygwin and Solaris. Only after you have checked and maybe updated the path in libs/process/test/misc.hpp you should try to build and run the test cases: WinXP/MSVC 9.0 ************** With MSVC 9.0 you only need to open the Visual Studio 2008 Command Prompt, change to the directory with the test cases and run bjam: C:\boost_1_36_0\libs\process\test> ..\..\..\bjam.exe -q Cygwin/GCC 3.4.4 **************** On Cygwin it's important to know if the Boost libraries have been built for the POSIX or Windows API. By default Boost libraries on Cygwin use the Windows API. With the Windows API the Boost.Process test cases are not passed successfully though (there are compiler errors where I'm not sure currently if they are a Boost.Process problem and how they could be fixed). If you want to run the test cases on Cygwin you must (re-)build the Boost libraries to use the POSIX API: $ cd ~/boost_1_36_0 $ ./bjam cxxflags=-DBOOST_POSIX_API Afterwards you can run the test cases: $ cd ~/boost_1_36_0/libs/process/test $ ../../../bjam cxxflags=-DBOOST_POSIX_API -q Solaris/GCC 3.4.6 ***************** At first you have to put the following line in ~/user-config.jam: using gcc : : : <linker-type>sun ; Then start building the Boost libraries: $ cd ~/boost_1_36_0 $ ./bjam --toolset=gcc cxxflags=-mcpu=ultrasparc For the test cases to be passed successfully you must update Boost.Test. Change line 624 in ~/boost_1_36_0/boost/test/impl/execution_monitor.ipp temporarily to: - , m_CHLD_action( SIGCHLD, catch_system_errors, attach_dbg, alt_stack ) + , m_CHLD_action( SIGCHLD, false, attach_dbg, alt_stack ) It is important that the second parameter is false as the signal SIGCHLD should not be handled by the execution monitor and should not be reported as an error. Afterwards the test cases can be run: $ cd ~/boost_1_36_0/libs/process/test $ ../../../bjam --toolset=gcc cxxflags=-mcpu=ultrasparc -q Solaris/Sun C++ 5.9 ******************* Build the Boost libraries with the sun toolset: $ cd ~/boost_1_36_0 $ ./bjam --toolset=sun stdlib=sun-stlport For the test cases to be passed successfully you must update Boost.Test. Change line 624 in ~/boost_1_36_0/boost/test/impl/execution_monitor.ipp temporarily to: - , m_CHLD_action( SIGCHLD, catch_system_errors, attach_dbg, alt_stack ) + , m_CHLD_action( SIGCHLD, false, attach_dbg, alt_stack ) It is important that the second parameter is false as the signal SIGCHLD should not be handled by the execution monitor and should not be reported as an error. If you run the test cases now you'll get this compiler error for one test case: "../../../boost/asio/detail/socket_ops.hpp", line 218: Error: Cannot assign void* to char*. "../../../boost/asio/detail/socket_ops.hpp", line 229: Error: Cannot assign void* to char*. "../../../boost/asio/detail/descriptor_ops.hpp", line 66: Error: Cannot assign void* to char*. "../../../boost/asio/detail/descriptor_ops.hpp", line 72: Error: Cannot assign void* to char*. The bug has been reported to the Boost.Asio mailing list. If you want to build that one test case, too, you need to fix the two files in Boost.Asio 1.36.0 yourself. All the test cases can be built and run with: $ cd ~/boost_1_36_0/libs/process/test $ ../../../bjam --toolset=sun stdlib=sun-stlport -q

4 9

[RangeEx] Where is the current version?
by Mathias Gaunard 19 Apr '10

19 Apr '10

Where is the current version (or a fairly recent version) of RangeEx? I can't find anything on the trunk, the sandbox or the vault.

5 13

[asio] read_until -- possibly misleading documentation?
by Richard Smith 15 Apr '10

15 Apr '10

The documentation for Boost.ASIO (which is otherwise very comprehensive) says of the boost::asio::read_until set of overloads: | Read data into a streambuf until a delimiter is | encountered. <http://www.boost.org/doc/libs/1_35_0/doc/html/boost_asio/reference/read_unt…> What the function actually does is to read blocks of data into the streambuf, and stop when the delimiter is found. This means that frequently data beyond the delimiter will be read into the streambuf. (And this is elaborated in more detail on the individual function's pages, if a reader looks there.) I appreciate that this behaviour is compatible with the documentation, but someone less familiar with ASIO could easily assume that the function will read as far as the delimiter and no further. (And I have just spent a fair amount of time debugging a piece of code where the author had made this assumption.) Could we change the summary documentation to read something like: | Read data into a streambuf at least until a delimiter is | encountered. The implementation may read beyond the | delimiter, but will not block when doing so. While I'm on the subject of ASIO documentation, I can't see any documentation on whether the service_name parameters to the basic_resolver_query constructors are allowed to be port numbers (e.g. "80") or whether they have to be symbolic names (e.g. "http"). Port numbers work, at least on Linux, but it's not clear whether this is something that I should be relying on. Similarly for IPv4 and IPv6 addresses in the host_name parameter. Richard Smith

3 2

Trac XMLRPC support
by Vladimir Prus 21 Mar '10

21 Mar '10

Would it be possible to have XMLRPC plugin installed in Boost Trac instance? See: http://trac-hacks.org/wiki/XmlRpcPlugin The installation appears to be fairly simple (and indeed seems to just work somewhere else). This will allow to use third-party tools to grab tickets from Boost Trac, which will hopefully lead to more issues fixed :-) - Volodya

4 5

Interest check: Boost.Mock
by Peter Bindels 26 Dec '09

26 Dec '09

Hi all, Over the past three-quarters of a year I've been working (with three friends) on a mocking framework for C++. In our vision, it would be a good complement to Boost.Test for testing classes separate from interfaces required - it would improve the ability to unit-test the classes that tie others together and that implement higher-level algorithms. It does this by creating an object that is "derived" from a given class at runtime, and replacing the functions with functions that redirect to verifying logic. The verifying logic uses basic structures to record expectations and to verify they happened. These ways of creating an object at runtime and modifying it are highly compiler dependant but remarkably portable - as it runs on at least 3 different compiler series (GCC, MSVC, EDG-based) and 5 platforms (Windows XP, Windows CE, Linux, QNX, bare platform), with few modifications. The library has been released under the name "Hippo Mocks" already. I'm interested in submitting it to Boost for three reasons. First of all, I believe that there may be obvious or very interesting optimizations or expansions I do not notice. Second, as Christian has elaborated on already, having the Boost tag on the project makes it more noticed and more used. As it has taken quite a bit of time from me already I would like people to use it. Third, Boost.Test allows testing code but does not support mocking. In the environment of unit testing, anything that is not a base library benefits from mocking by abstracting away details that are irrelevant and that will break your test unnecessarily. For Boost the main changes would be superficial in the naming and in using more default libraries instead of a new implementation. For Hippo Mocks I've decided to make no assumptions in anything over C++98 so there's a full Tuple implementation and so on. If there's an interest I'll spend the evening porting the code to qualify for the Boost coding norms and upload it to the vault (if I can - but that should be OK). I would like you to take a look at the code and tell me what you think of it. Thanks for your time. Kind regards, Peter Bindels

8 10

[TypeTraits] is it possible to add something to boost.type_traits?
by frederic.bron＠alcan.com 17 Dec '09

17 Dec '09

Dear boost implementers, TypeTraits is very useful, thanks you. However, recently, I needed something to know if a type is comparable (with operator<) and that was not in the library. Fortunately, somebody forwarded me an earlier post on the users list where I could find what I wanted. The implementation was inspired from boost/detail/is_incrementable.hpp I have written is_less_comparable, is_less_equal_comparable, is_greater_comparable... inspired from the same source and I wonder if it could be possible to add it to the library as I think it could be helpful for others. I give the source code below (if it is useful) but I am not able to make it fully general as it is in boost/type_traits. In particular, I do not understand all the macros that are used. Regards, F. Bron (See attached file: is_comparable.hpp) Avis : Ce message et toute pièce jointe sont la propriété d'Alcan et sont destinés seulement aux personnes ou à l'entité à qui le message est adressé. Si vous avez reçu ce message par erreur, veuillez le détruire et en aviser l'expéditeur par courriel. Si vous n'êtes pas le destinataire du message, vous n'êtes pas autorisé à utiliser, à copier ou à divulguer le contenu du message ou ses pièces jointes en tout ou en partie. Notice: This message and any attachments are the property of Alcan and are intended solely for the named recipients or entity to whom this message is addressed. If you have received this message in error please inform the sender via e-mail and destroy the message. If you are not the intended recipient you are not allowed to use, copy or disclose the contents or attachments in whole or in part.

11 23

Re: [boost] Formal Review Request: Boost.String.Convert
by Vladimir.Batov＠wrsa.com.au 02 Dec '09

02 Dec '09

I understand we'll never manage to please everyone. Apologies. For now I am settling on the boost::convert interface as I very much agree with the arguments Robert's put forward for it and I feel there is the least disagreement around this interface. Surely boost::convert() has issues of its own. However, I feel the path (convert::to_string->convert::to->convert) how I myself arrived to this logical (IMHO) conclusion seemed reasonable. More so, despite its subtle (to some) directionality the interface has proven to work (as it is essentially the same interface as for lexical_cast). You cannot deny that I made considerable sacrifices (my pets "string" namespace and "to/from" are gone, something I was ready to die :-) for yesterday...). I am hoping the others could make some concessions as well and we would settle on boost::convert()... for now. If some other issues pop up that we missed so far, we'll revisit the issue. It is because I would very much like to move forward and start looking at the functionality and implementation. Do you think it is possible or I am rushing things again? I somewhat cleaned up the implementation (removed to/from, etc.). However, before going forward I'd like to discuss one important thing that's been bugging me since Scott brought it up. Namely, all conversions are now implemented as discriminated functions like // string-to-type conversion template<class TypeOut, class StringIn> typename boost::enable_if_c< !is_string<TypeOut>::value && is_string<StringIn>::value, detail::from_string<StringIn, TypeOut> >::type convert(StringIn const& from_str, TypeOut const& default_value =TypeOut()) { return detail::from_string<StringIn, TypeOut>(from_str, default_value); } However, Scott mentioned that and I feel that might be cleaner if we could implement it as namespace boost { template<class TypeOut, class TypeIn, class Enable =void> class convert; } Then for every conversion we'll be able to encapsulate *complete* implementation in the respective specialization class. Like for string-to-type template< class TypeOut, class StringIn, typename boost::enable_if_c< !is_string<TypeOut>::value && is_string<StringIn>::value, void>::type> class convert { convert(StringIn const& from_str, TypeOut const& default_value =TypeOut()); }; The reason I like it is that it eliminates other support/intermediate classes (like something used-to-called boost::string::value<...> and detail::from_string) and we can do int i = convert(str, -1); // Nothing changed. a 'convert' instance created on the stack and converted to 'int'. convert<int, string> checked(str, -1); // named 'convert' is created. convert<int, string> checked = convert(str, -1); // the same but some might like this syntax better. if (checked.good()) success // we can check the success as ussed to with boost::string::value It feels that approach gives us considerably more room for expansion as some special conversions will be able to have methods only specific to that particular conversion. For this approach to work with algorithms we'll need class convert { static TypeOut apply(TypeIn const&); }; and then std::transform( ints.begin(), ints.end(), std::back_inserter(strings), convert<string, int>::apply); Thanks, Vladimir.

9 63

[thread] #2742 Why the at_thread_exit cleanup function is const?
by vicente.botet 25 Nov '09

25 Nov '09

Hi, Anthony, could you verify the patch and test I have attached to the ticket works for other platforms that cygwin? Thanks, _____________________ Vicente Juan Botet Escribá

2 1

[move][container] Review Request (new versions of Boost.Move and Boost.Container in sandbox and vault)
by Ion Gaztañaga 17 Nov '09

17 Nov '09

Hi to all, I've just uploaded to boost sandbox... http://svn.boost.org/svn/boost/sandbox/move/) and Boost.Vault... http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost.… ...new versions of libraries Boost.Move and Boost.Container. Online documentation can be found here: Boost.Move http://svn.boost.org/svn/boost/sandbox/move/libs/move/doc/html/index.html Boost.Container http://svn.boost.org/svn/boost/sandbox/move/libs/container/doc/html/index.h… I would like to request a review for both libraries. Boost.Move is quite small (just one header). Boost.Container depends on Boost.Move and Boost.Intrusive so you must download also the post-1.40 version of Intrusive placed in the same package (Boost.Container uses new features from Intrusive not included in Boost 1.40). Just take fresh Boost 1.39 folder and overwrite it with package contents. ************************ What's new in Boost.Move: ************************ ->The library has been modified to support moving rvalues of copyable AND movable types, a limitation of the previous version. This changes where proposed by Klaus Triendl in this thread: http://lists.boost.org/Archives/boost/2009/06/153266.php The library has now new macros to declare copyable and movable types and movable only types. Old macros are still there for backwards compatibility (specially unordered library which was also ported to this move sandbox) but I expect to remove them if current approach is considered better. ->Updated documentation and tests. ************************ What's new in Boost.Container: ************************ -> Added tests and documentation -> Updated the library to the new Boost.Move macros * * * I've tested both libraries in Windows XP using the following compilers: Visual 7.1, Visual 8.0, Visual 9.0, Intel 10.0, Mingw-gcc 4.3 and Mingw-gcc 4.3 in C++0x mode. The library should work on any C++03 conforming compiler Best, Ion

19 95

Boost.Variant is not EqualityComparable
by brook＠biology.nmsu.edu 12 Nov '09

12 Nov '09

I just ran into the case that Boost Variant does not satisfy the EqualityComparable concept. While it provides operator==() and operator<() (and therefore is LessThanComparable), it does not provide operator!=(), which is required for the EqualityComparable concept. Is this by design or oversight? It seems reasonable to expect that a Boost Variant model this concept, but perhaps I am missing something. In case it is by oversight, the following patch seems to provide the missing operator. Cheers, Brook --- boost/variant/variant.hpp.orig 2009-05-13 21:21:59.000000000 -0600 +++ boost/variant/variant.hpp 2009-05-25 19:21:40.000000000 -0600 @@ -1681,6 +1681,8 @@ return rhs.apply_visitor(visitor); } + bool operator!=(const variant& rhs) const { return !(*this == rhs); } + bool operator<(const variant& rhs) const { //

6 7

proposal interval container; ITL moved to the boost sandbox
by Joachim Faulhaber 11 Nov '09

11 Nov '09

Dear boosters, after completion of a lot of boostification work I moved my Interval Template Library to the boost sandbox in the boost project centric form: https://svn.boost.org/trac/boost/browser/sandbox/itl itl boost itl [itl_xt] [validate] libs itl [itl_xt] [validate] I have split up the original library into three parts: (1) itl, (2) itl_xt and (3) validate. Core part 1 'ITL' contains all interval container class templates. Only this part will be prepared for a formal submission. Part 2 'itl_xt' contains extended parts of the original library that do not belong to the core interval container data structures and might be proposed for later extensions. Part 3 'validate' contains the sources for the law based test automaton 'LaBatea' that has been used for an automated check of the ITLs correctness. Parts 2 and 3 do not yet conform boost standards and naming conventions and are not yet intended as contributions to boost. On the core ITL-part I have done the following: + Removed all virtual functions via introduction of mixins + Integrated deeper into boost libraries replacing own code by e.g. boost::type_traits and boost::mpl + Minimized the class template interfaces by transforming member functions into non member function templates. + Made interval containers more interoperable by overloading operators and global function templates. + Wrote a test suite using boost unit test tools. Tested for boost-instance types boost::date_time and boost::rational + Provided jamfiles to build and run examples and tests. + All examples and tests have been compiled, linked and run successfully with msvc_9.0 and gcc_3.4.4(cygwin). Next I am going to write boost style html-documentation. >From the boost web page I don't see a clear recommendation for a preferable way of doing that. Handcoded? Generated with BoostBook? Is there a reference library that has an exemplary standard documentation? Cheers Joachim

3 4

[utility] auto_buffer v2
by Thorsten Ottosen 07 Oct '09

07 Oct '09

Dear All, Hereby an updated class. Thanks to all who contributed with comments to the first try. I have made the following changes: 1. push_back() overloads are now growing 2. added swap() (boy, was this nasty to implement). I assume the allocator can be wapped without throwing. How do other people copy with this problem? 3. added copy-constructor + copy-assignment 4. made the min capacity equal to N, the number of elements in the stack buffer 5. the size of the internal buffer is now controlled via two policies: template< unsigned N > struct store_n_objects; template< unsigned N > struct store_n_bytes; the default is store_n_objects<256>. The reason is that we don't want the capacity to change just because we compile on a different platform. 6. added comparison operators Comments most welcome! best regards -Thorsten

4 7

[interprocess][multi_index] emplace() is not sufficient for maps
by Thorsten Ottosen 25 Sep '09

25 Sep '09

Hi Ion and Joaquín, This issue is related to node-based containers. I think you both have added emplace() to provide efficient in-place construction. However, I often encounter a situation where emplace() is not sufficient for me. The situation is characterized by the need to calculate the key after the mapped value (a heavy object) has been placed in the pair. To calculate the key the mapped value needs to be modified (the key is calculated as a side-effect). I therefore suggest that we add a new function: typedef ... map; map m; map::node_ptr p = m.get_node_ptr(<like emplace, but only for constructing the mapped value>); p->pair.first = modify( p->pair.second ); m.insert( boost::move(p) ); Thoughts? -Thorsten

5 21

review request: addition to type_traits library of is_less_comparable<T> and others
by Frédéric Bron 22 Sep '09

22 Sep '09

Hi folks, I would like to propose to your review the following addition to the type_traits library. The addition is attached to this email and also available in the sandbox at https://svn.boost.org/trac/boost/browser/sandbox/type_traits The purpose of the addition is to add type traits to detect if type T is comparable in the sens of <, <=, >, >=, == or != operators, i.e. if t1<t2 has a sens when t1 and t2 are of type T (same for <=, >, >=, ==, !=). The following traits are added: is_equal_to_comparable<T> is_greater_comparable<T> is_greater_equal_comparable<T> is_less_comparable<T> is_less_equal_comparable<T> is_not_equal_to_comparable<T> The names are based on the corresponding names of the standard template library (<functional> header, section 20.3.3 of the standard). The compilation has been tested with g++ 4.3.2 and icpc 10.0 on linux 64 bits, g++ 3.4.4 on cygwin, mingw32 3.4.4 on cygwin. I must add that I did not invent the code (I obtained some help from the boost mailing list) but I put it together in a form that should be acceptable to boost. Regards, Frédéric

8 23

[filesystem] Compatibility with STLPort
by Andrey Semashev 21 Sep '09

21 Sep '09

Hi, I've created ticket #3241 some time ago, with a patch attached. It's about Boost.Filesystem compatibility with STLPort expression templates feature. So far no activity has appeared on it, although the fix is trivial. Is it OK if I go ahead and commit the patch? PS: Ticket URL is https://svn.boost.org/trac/boost/ticket/3241

3 6

Formal Review: Boost.Polygon starts today August 24, 2009
by Fernando Cacciola 20 Sep '09

20 Sep '09

Dear Developers, The formal review of the Boost.Polygon library by Lucanus Simonson starts today, August 24, 2009 and will finish September 2, 2009. I really hope to see your vote and your participation in the discussions on the Boost mailing lists! --------------------------------------------------- About the library: The boost polygon library provides algorithms focused on manipulating planar polygon geometry data. Specific algorithms provided are the polygon set operations (intersection, union, difference, disjoint-union) and related algorithms such as polygon connectivity graph extraction, offsetting and map-overlay. These so-called Boolean algorithms are of significant interest in GIS (Geospatial Information Systems), VLSI CAD as well al other fields of CAD, and many more application areas, and providing them is the primary focus of this library. The polygon library is not intended to cover all of computational geometry in its scope, and provides a set of capabilities for working with coordinates, points, intervals and rectangles that are needed to support implementing and interacting with polygon data structures and algorithms. Specifically, 3d and non-Cartesian/non-planar geometry is outside of the scope of the polygon library The design philosophy behind the polygon library was to create an API for invoking the library algorithms it provides on user geometry data types that is maximally intuitive, minimally error-prone and easy to integrate into pre-existing applications. C++-concepts based template meta-programming combined with generic operator overloading meets these design goals without sacrificing the runtime or memory efficiency of the underlying algorithms. This API makes the following code snippet that operates on non-library geometry types possible: void foo(list<CPolygon>& result, const list<CPolygon>& a, const list<CPolygon>& b, int deflateValue) { CBoundingBox domainExtent; using namespace boost::polygon::operators; boost::polygon::extents(domainExtent, a); result += (b & domainExtent) ^ (a - deflateValue); } The source is available at http://svn.boost.org/svn/boost/sandbox/gtl/boost/polygon/ And the documentation is at http://svn.boost.org/svn/boost/sandbox/gtl/doc/index.htm --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Best Regards Fernando Cacciola Review Manager

30 142

[iostreams][bug] Uncaught exception in destructor when using file_descriptor
by Sylvester-Bradley, Gareth 19 Sep '09

19 Sep '09

https://svn.boost.org/trac/boost/ticket/2932 I hope it's appropriate to ping the list about this issue, which was reported 4 months ago and has not been fixed in 1.39.0 or on the trunk. If closing a file descriptor fails, file_descriptor::impl::~impl() (or file_descriptor_impl::~file_descriptor_impl() on the trunk) throws an exception. This has the potential to happen during stack unwinding, causing immediate std::terminate(). Since the fix appears to be a trivial addition of try { /*...*/ } catch (...) {} it'd be a shame if this wasn't fixed in 1.40.0. Cheers, 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

2 2

Formal Review of Boost.Polygon is halfway through and no actual reviews so far
by Fernando Cacciola 17 Sep '09

17 Sep '09

Dear Developers, The formal review of the Boost.Polygon is halfway through and, while there was some useful discussion, there are still no "actual" reviews (where you clearly vote for inclusion and rejection). If you are interested in a geometric oriented library please try to make the time to post a formal review by the end of September 2 :) Best regards Fernando Cacciola Review Manager

4 7

[Endian] Version 0.10 available - Binary I/O added
by Beman Dawes 16 Sep '09

16 Sep '09

Version 0.10 of the Endian Integers library is available. Docs: http://mysite.verizon.net/beman/endian-0.10/libs/integer/doc/endian.html Zip: http://mysite.verizon.net/beman/endian-0.10.zip Sandbox: http://svn.boost.org/svn/boost/sandbox/endian This version adds binary I/O for both endian integers (<boost/integer/endian_binary_stream.hpp>) and C++ built-in types + std::string (<boost/integer/endian_binary_stream.hpp>). Support for C++0x features has also been added, ensuring that an Endian integer on C++0x is a POD. Comments appreciated! My Endian TODO list is pretty well cleared, so there are comments to the contrary, the library will be submitted for formal review in a few days. --Beman

3 4

enabling/disabling floating point exceptions
by Gennadiy Rozental 15 Sep '09

15 Sep '09

Hi guys, I am looking to complete cross platform implementation of enabling/disabling logic in boost::execution_monitor. It looks like there is no standard interface available. I'm using _controlfp interface now on Windows. I also found these non-standard extensions: * feenableexcep/fedisableexcept available with glib 2.2 * fesettrapenable avaialble in Dinkumware (implementation of STL?) and HP * sun has something called fex_set_handling. not sure when it's available though * header fpu_control.h. Not sure where it's available though. * MAC OS X has something called _MM_SET_EXCEPTION_MASK in xmmintrin.h It also seems that in some cases the switch is compile time only (using compilation option). Would anyone care to extend this list/comment on it's applicability and/or correctness? Another change I am considering is to split floating point exception catching from other system exceptions. It seems perfectly valid scenario to set catch_system_error to false (thus avoid catching access violations etc) but still willing to catch and process floating point exception. What do you think? Gennadiy

4 4

Build files locations, try 2
by Vladimir Prus 12 Sep '09

12 Sep '09

Some time ago, I have raised the concern that CMakeList.txt files violate directory structure requirements. See: http://thread.gmane.org/gmane.comp.lib.boost.devel/189496/ Back then, the discussion did not lead anywhere, and no further progress was made for 2.5 months. So, let me try to phrase this a bit differently. Is it fine with everybody if I move Jamfiles out of 'build' folder of every library one level higher? Thanks, Volodya

4 4

Control of the file location for the boost::interprocess::managed_shared_memory object
by Michael Watkins 11 Sep '09

11 Sep '09

Is it possible to control the exact location of the file that is backing the shared memory created by boost::interprocess::managed_shared_memory? The issue occurs under Windows (it has not been tried yet under Linux). The problem is two processes attempting to connect to the same shared memory segment between two accounts, in specific from a program running as a service (using the system account) and a program running under a user account. The user account is running a program that needs to interface to the database that the service created. Everything seems to work fine, but the service will open the shared memory backing file in the global temp directory while the user account will open the file in their local settings temporary directory. Therefore two different segments are opened. The interim solution is to use boost::interprocess::managed_windows_shared_memory to create the shared memory, but the desire is to use the generic version for cross-platform compatibility. If the full file path could be specified when creating the memory segment, it would solve the problem. Michael Watkins _________________________________________________________________ Windows Live™: Keep your life in sync. http://windowslive.com/explore?ocid=PID23384::T:WLMTAGL:ON:WL:en-US:NF_BR_s…

2 4

[unordered] please don't allocate memory in the default constructor
by Thorsten Ottosen 10 Sep '09

10 Sep '09

Hi Jeremy, I think this a really bad idea to allocate in the default construtor. The user can always call rehash() on the empty container, just like when we call reserve() for vector. Thanks -Thorsten

5 8

Re: [boost] [serialization] Linker errors in trunk
by Hartmut Kaiser 08 Sep '09

08 Sep '09

> Sorry, resending as it ended up on the wrong list... > > ----------------------------- > > Since the latest changes in trunk I'm seeing linker errors while > linking with the serialization library (VS2005 SP1, > boost_serialization-vc80-mt-gd-1_40.lib): > > runtime_support.obj : error LNK2001: unresolved external symbol > "__declspec(dllimport) public: __thiscall > boost::archive::archive_exception::archive_exception(enum > boost::archive::archive_exception::_exception_code,char const *,char > const *)" > (__imp_??0archive_exception@archive@boost@@QAE@W4_exception_code@012@PB > D1@Z) > > (note the leading underscore in _exception_code) > > Which is really strange as this symbol is the only missing one. > > OTOH, the library exports the symbol: > > boost::archive::archive_exception::archive_exception( > enum boost::archive::archive_exception::exception_code, > char const *,char const *); > > (note the missing underscore in exception_code) > > If I change the first parameter of the archive_exception constructor to > be a 'int' everything builds fine. Ok, I solved it. The MS header file excpt.h has a #define exception_code _exception_code which leads to problems if not consistently included. Doh! What a mess. The bottom line is, that archive_exception.cpp needs to be compiled with exactly the same windows headers included (excpt.h gets included by windows.h) as any sources including archive_exception.hpp, which is generally not possible to ensure. The only fail-proof way I could see is to always have #if defined(BOOST_WINDOWS) #include <excpt.h> #endif inside archive_exception.hpp, globally mapping exception_code to _exception_code. Patch attached. Ok to commit? Regards Hartmut

4 9

Arbitrary precision arithmetic
by Scott Johnson 07 Sep '09

07 Sep '09

Greetings. This is my first post to the mailing list, so I'll try not to act stupid. :) The recent release of Boost (1.39.0), in the boost::rational library documentation, broadly hints at (and expresses a fond wish for) an arbitrary-precision integer ("bignum") library; however none currently exists within Boost. There are numerous such libraries out in the wild (many targeted towards C); though some of them are under incompatible licenses. (One interesting starting point would be libtommath, by Tom St. Denis; it appears to be a pretty robust and functional C library; which now has a C++ wrapper--albeit one that doesn't meet boost standards. It also contains numerous other useful number-theoretic functions, many of which appear to not be dependeing on the underlying bigint type. And it's in the public domain, or at least appears to be...) Searching through the mailing list, I've seen numerous references to creating such a thing, some of them dating back nearly ten years--but none yet seems to exist. This is something, I think, which would be Really Useful to add to boost. I wasn't able to locate any current boost project or proposal to create such a thing--though it's certainly possible I looked up the wrong keyword(s). So, my possibly impertinent newbie question: Is anyone (seriously) working on such a thing, for inclusion in boost? Are there any nasty (political) obstacles to such a thing being added? Thanks! -- engineer_scotty (no, not that one) If life gives you lemons, drink Hefeweizen

12 21

[ptr_container] Questionable strong guarantee of ptr_map::insert()
by Kazutoshi Satoda 05 Sep '09

05 Sep '09

Hi, With current implementation of ptr_map::insert(), if an exception is thrown, the objected pointed by the passed pointer is deleted. Is this really providing strong guarantee as documented? I understand strong guarantee as described here. http://www.boost.org/community/exception_safety.html > The strong guarantee: that the operation has either completed > successfully or thrown an exception, leaving the program state exactly > as it was before the operation started. I think ptr_map::insert() doesn't provide this guarantee because deleting the object is a change of the program state. As more concrete problem, see the attached code. I couldn't find any way to provide strong guarantee for delayed_inserter::insert_ready() using ptr_map. I want ready_value unchanged if an exception is thrown during the insertion. Looking for a solution on a similar situation, I found constructors of shared_ptr. Its documentation clearly says that "If an exception is thrown, delete p is called". And for auto_ptr version, it provides strong guarantee by taking the auto_ptr as non-const reference. I think ptr_map::insert() should follow this manner; document the deletion on exception for raw pointer version, and provide strong guarantee with insert(const key_type& key, std::auto_ptr<U>& x) . The the auto_ptr& version can be a better replacement of the raw pointer version. The required temporary of auto_ptr, instead of key_type, is more expressive (about the purpose of the temporary), and matches the Best Practices shown in the documentation of shared_ptr. http://www.boost.org/libs/smart_ptr/shared_ptr.htm#BestPractices But, introducing the auto_ptr& version seems to cause some change of behavior in client codes using the current pass-by-value version. Is it valid to request (create a ticket) for strong guaranteed (taking auto_ptr&) version while having this compatibility concern? Regards. -- k_satoda #include <memory> #include "boost/ptr_container/ptr_map.hpp" namespace ptr_map_insert_strong_guarantee_demo { class value { public: explicit value(int source); // ... }; class delayed_inserter { public: // ... // This is called from context that knows key and source of value, // but doesn't know the time of insertion. void ready_new(int key, int source) { // OK. // This implementation offers strong guarantee for this call. std::auto_ptr<value> new_value(new value(source)); ready_key = key; ready_value = new_value; } // This is called from context which doesn't know key and value, // but knows the time of insertion. void insert_ready() { if (ready_value.get() != 0) { // I want to offer strong guarantee for this call, // but boost::ptr_map deosn't provide the way to do that; // *** ready_value is deleted when an exception is thrown. *** map.insert(ready_key, ready_value); } } // ... private: int ready_key; std::auto_ptr<value> ready_value; boost::ptr_map<int, value> map; // ... }; }

8 17

wait-free fast-pathed, bounded-time, 100% starvation-free rw-mutex...
by Chris M. Thomasson 04 Sep '09

04 Sep '09

I was wondering if the following invention of mine might be of use to Boost: http://software.intel.com/en-us/forums/intel-threading-building-blocks/topi… (please __read_all__; thank you) Here are some performance numbers wrt my algorithm versus NPTL on Linux (fedora 10), and OpenSolaris: http://groups.google.com/group/comp.programming.threads/msg/3e7531657a11baf0 My invention has some very interesting properties that simply do not exist for 99% of all the other rw-mutex algorithms I have seen to date. It's 100% starvation free and has bounded wait time for readers and writers. Heck, even the Microsoft rw-mutex algorithm in Vista does not come close to that: http://msdn.microsoft.com/en-us/library/aa904937(VS.85).aspx They clearly state that their algorithm is not fair. The algorithm I have observed in OpenSolaris does not meet this goal as well. Another nice property is that the algorithm has wait-free fast-paths. If readers hit a fast-path, then they are going to get wait-free access to the protected data-structure. The same goes for writers. The underlying operation is a single atomic fetch-and-add operation: http://software.intel.com/en-us/forums/intel-threading-building-blocks/topi… In fact, the algorithm only needs fetch-and-add; no stupid CAS-loops are required. Please take not that there are absolutely no loops in the algorithm; this is one reason why it's bounded time and starvation free. Also, it has conditional reader-to-writer upgrades and non-conditional writer-to-reader downgrade capabilities. This is something that does not exist in the Microsoft implementation, or even the OpenSolaris, or basically any Linux implementation I have observed. Same goes for OSX. Therefore, I think this particular algorithm might be of use to Boost. Any thoughts? Thank you all for you're valuable time; I really do appreciate it! :^)

4 14

[date_time, Boost 1.40.0]
by Christoph 03 Sep '09

03 Sep '09

including boost/date_time/posix_time/posix_time.hpp or boost/date_time/gregorian/gregorian.hpp gives lots of warning for the following line(s): (boost/date_time/gregorian/conversion.hpp; posix_time, tooo) line 44 std::tm datetm = {}; // zero initialization is needed for extension members, like tm_zone I admit I don't understand the comment. Is it possible to fix that (correctly) such that including the header does not produce like 20 warnings in each .cpp file including the header? (I am using linux running gcc 4.1.2) Best regards Christoph

4 5

[pool] patch to make pool support zero sized allocations.
by Steven Watanabe 02 Sep '09

02 Sep '09

AMDG The patch at https://svn.boost.org/trac/boost/attachment/ticket/386/pool.patch allows the pool classes to support zero sized allocation, by returning a null pointer. std::vector sometimes allocates a zero sized block, so this is necessary for pool_allocator. Returning a null pointer is the simplest solution and I'm that the standard allows an allocator to return the null pointer when asked for a block of zero elements. Okay to commit? In Christ, Steven Watanabe

1 1

windows timeout implementation
by Gennadiy Rozental 01 Sep '09

01 Sep '09

Hi, I have windows timeout support implemented for boost::execution monitor. It requires multithreading and thus introduces additional dependencies. I am thinking of making it available with compile time flag. Any comments/suggestions are welcome. Gennadiy

4 4

[polygon] examplefile compilation failed
by Joachim Faulhaber 31 Aug '09

31 Aug '09

Hi Luke and polygonists! I had problems compiling the example files from the doc's main page with msvc-9. None of custom_p*.cpp examples compiled. Also the connectivity_extraction_usage.cpp example failed. (1) connectivity_extraction_usage.cpp: #include <boost/gtl/gtl.hpp> must be replaced by #include <boost/polygon/polygon.hpp> namespace gtl = boost::polygon; has to be added. (2) custom_point.cpp: compilation yields: 1>.\custom_point.cpp(75) : error C2757: 'gtl' : a symbol with this name already exists and therefore this name cannot be used as a namespace name 1>.\custom_point.cpp(77) : error C2143: syntax error : missing ';' before '<' 1>.\custom_point.cpp(77) : error C2913: explicit specialization; '::geometry_concept' is not a specialization of a class template and many errors more after replacing gtl:: by boost::polygon:: and namespace gtl { ... } by namespace boost { namespce polygon { ... } } and adding typedef int coordinate_type; to struct CPoint the code finally compiled. Are these examples intended to be excercises ;) HTH Joachim

3 6

C++ MapReduce performance - compared to C Phoenix
by Jose 31 Aug '09

31 Aug '09

I wanted to share some performance numbers to encourage others to write examples or applications using the C++ multi-core mapreduce library being developed by Craig H. I ran some tests comparing the C++ version to the C version, for the word_count example. The tests are run on a X86_64 linux Fedora 10 with 2 cores. The results below show that the C++ MapReduce (mr) has very similar performance to the C version (mr-c). The tests start running phoenix first. Run 3 and 4 show that c++ mr is slightly faster. When using 1MB MR_L1CACHESIZE (which should be the best comparison) shows that mr-c is a little bit faster but not much. 1-mr-c 0m18.077s 2-mr 0m13.818s 3-mr-c 0m14.828s 4-mr 0m14.148s 5-mr-c-1MB 0m14.006s 6-mr-c-2MB 0m14.084s Note: The C++ version uses a chunk size of 1MB while the C version uses by default a chunk size of 64KB (which can be changed with the variable MR_L1CACHESIZE) regards jose

1 0

Boost.MapReduce: what next?
by Craig Henderson 31 Aug '09

31 Aug '09

I am thinking now about how to progress my MapReduce library that is in the Boost SandBox. I have completed the single-machine implementation; it's performance is comparable to other libraries such as Phoenix (http://mapreduce.stanford.edu) and has been tested by a few people on this list. There has, however, been little interest in the library so far from Boost users/developers which surprises me. I don't know if that is because of the single-machine limitation and people don't see any value that MR can bring to multi-threaded programming? So where do I go next with the library? Options that I see are: 1. Complete the documentation and submit the current library to Boost for a formal review. I'm not clear there is sufficient interest, though. 2. Continue to develop the library in the sandbox to multi-machine implementation and work towards submitting that for formal review. Is there interest for this? 3. Accept that Boost is not an appropriate forum for a MapReduce library and find an alternative community to develop the library. Looking at the download figures from the Vault, there has been a reasonable number of downloads; Of course there is no way to tell the number of people looking at the sandbox implementation. Perhaps the library has some silent interest? Please let me know your thoughts. Thanks -- Craig Craig Henderson <http://craighenderson.co.uk/> http://www.craighenderson.co.uk http://www.siteupdatenotification.com

6 9

factory.hpp missing
by Felipe Magno de Almeida 31 Aug '09

31 Aug '09

Hi, AFAIK, the functional/factory.hpp was accepted in boost a long time ago. But never seem to have made into svn. Does anybody know why? Regards, -- Felipe Magno de Almeida Sent from my Nokia E71

2 1

Re: [boost] Proposal: MapReduce library (single machine)
by Mateusz Berezecki 31 Aug '09

31 Aug '09

Hi , I've just joined this mailing list because of this particular discussion :-) >> 2) have a plan so that the library can eventually range from >> working on 1 multi-core system to distributed >This is the eventual goal, and I have designed the library to be extensible >to be able to do this in the future. With the policy based designed, making >use of the open source projects that you mention should be non-intrusive; >the library allows the user to supply a handler for the intermediate files >(to use kosmosfs or hypertable, for example) I'm going to give it a spin as it happens I'm already having a half-baked distributed backend lacking a mapreduce library for both hypertable and KFS and report back. But this is interesting! Can't stop thinking about it now :-) best, Mateusz

2 1

Help with Boost Preprocessor
by Emil Dotchevski 30 Aug '09

30 Aug '09

Let's say I have a class template functor like this: struct func { typedef void result_type; template <class A1,class A2,class A3> void operator()( A1, A2, A3, int x ) { } }; Given a list of types, I want the function instantiated and called for all permutations of the types in the list; the additional argument(s), x, just need to be forwarded the same for all instances. Actually I got it working, see http://codepad.org/tnYTy9Iw. I don't think that my solution is very good though. First, it has some run-time overhead due to the use of boost::bind in fwd1 and fwd2 (see link above.) Second, I'd like the macro that defines the type list not to be hard-coded in fwd1 and fwd2. Is this possible? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

4 7

[1.40.0] Release candidates available
by Beman Dawes 30 Aug '09

30 Aug '09

The 1.40.0 release candidates are available. See http://boost.cowic.de/rc/ Please download, give it a try, and then report back either success or failures. These will get pushed out to SourceForge once we've had enough reports to be sure the packages are good. TIA, --Beman

6 18

[1.40] Release of PDF docs for Boost-1.40 now available.
by John Maddock 29 Aug '09

29 Aug '09

For those who prefer printable docs, PDF builds of the docs from Boost-1.40 are now available from the usual sourceforge download site: https://sourceforge.net/projects/boost/files/ (look under the boost-docs subtree). Direct links are as follows: zip (19.2Mb): https://sourceforge.net/projects/boost/files/boost-docs/1.40.0/boost_pdf_1_… tgz (19.7Mb): https://sourceforge.net/projects/boost/files/boost-docs/1.40.0/boost_pdf_1_… 7z (17.9Mb): https://sourceforge.net/projects/boost/files/boost-docs/1.40.0/boost_pdf_1_… Please note that not all libraries have documentation suitable for automatic PDF generation yet, libraries covered are: Accumulators Any Array Asio Bimap Bjam Boost.Build Range Boostbook TR1-complex number algorithms Concepts Config Conversion Date_time Foreach Function FunctionTypes Fusion Hash Interprocess Intrusive Iterator Lambda Math (special functions and distributions) Math-gcd MPI Octonion Optional Phoenix ProgramOptions Proto Python tutorial Quaternion Quickbook Ref Regex ScopeExit Signals Signals2 StaticAssert StringAlgo Thread TR1 Tribool TypeTraits Typeof Units Unordered Variant Xpressive Enjoy! John Maddock.

2 2

RFC - Updated MapReduce library
by Craig Henderson 29 Aug '09

29 Aug '09

I have considerably revised and updated my MapReduce library and committed the changes to the Sandbox. I've also uploaded to the Vault for easy access http://www.boostpro.com/vault/index.php?action=downloadfile <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=mapred uce_0_3.zip&directory=&> &filename=mapreduce_0_3.zip&directory=& Library documentation to date is available along with the code, or on my site at http://craighenderson.co.uk/mapreduce/ I am very interested to hear any comment on design, code, performance or any other area. Regards -- Craig Craig Henderson <http://craighenderson.co.uk/> http://www.craighenderson.co.uk http://www.siteupdatenotification.com

3 14

Boost.Multimethod proposal
by Nicholas Howe 29 Aug '09

29 Aug '09

I have written a C++ Multimethod library and propose adding it to Boost. I see that the addition of such a library to Boost has been proposed in the past, and been met with relative enthusiasm. However, it has not been done. Does anyone know why previous attempts were aborted? I want to be sure there is a demand before starting the somewhat daunting task of boostifying and documenting my library. The library works by requiring clients to register user types of interest, and specify their public base classes. This allows traversing class hierarchies at run-time. A multimethod uses this information to perform run-time overload resolution on registered methods to determine the best implementation based on the type-id of each parameter. There are no restrictions on the types of a multimethod's parameters, although only single indirections to user types will behave polymorphically. The library is designed to behave well when used by other libraries. To declare a new method, the client is required to derive a new type from the multimethod type. This allows multiple multimethods with the same parameters in different libraries. It also allows encapsulation of each multimethod implementation within each library, reducing the chance of conflict between different libraries that were compiled with different versions of the multimethod library. Is there any interest in including my library in Boost? Nick

10 14

Boost C++ Math Toolkit
by Paul A. Bristow 29 Aug '09

29 Aug '09

I am pleased to announce publication of the Boost Math Toolkit PDF documentation as a book (in CD format initially). Boost C++ Math Toolkit, ISBN 0-9504833-2-X John Maddock, Paul A. Bristow, Hubert Holin, Xiaogang Zhang, Bruno Lalande, Johan Råde, Gautam Sewani, Thijs van den Berg Publisher: hetp Publication date: 1 Sep 2009 Suggested Classification 519.2-dc22 If you are using this software, and writing academic or scholarly articles, you can reference it as above. (If you an author you can add it to your CV ;-) In the unlikely event that anyone would like this as a CD, I can of course provide it (at a modest cost) - but then you can download everything for free from www.boost.org or www.sourceforge.net. The CD also includes a Windows Installer program for the Distribution Explorer (but you can also download from http://distexplorer.sourceforge.net/) Please tell me if you would like to be able to buy a printed version. Thank you. Paul --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

1 0

[mpl] minor typo in for_each documentation
by Emil Dotchevski 29 Aug '09

29 Aug '09

See http://www.boost.org/doc/libs/1_39_0/libs/mpl/doc/refmanual/for-each.html, the example at the bottom: shouldn't the 'n' be '\n'? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

2 1

GTL Questions
by Tom Brinkman 28 Aug '09

28 Aug '09

Just to get things rolling, a few softball questions. Could you give a short history of this library? How long has it been in development? Is it in current use? If so, how and where. Does this library have any affiliation with Intel? Thanks for submitting this greatly needed library. A lightweight, boost friendly geometry library would be very useful. Tom

2 1

boost.polygon not GTL
by Tom Brinkman 28 Aug '09

28 Aug '09

boost.polygon, not GTL. Sorry. Any plans to work together with the authors of GTL and synchronise your API's?

2 1

Unicode preview 3
by Mathias Gaunard 28 Aug '09

28 Aug '09

Here is the third preview of the Unicode library developed by myself and mentored by Eric Niebler as part of the Google Summer of Code, and probably the last one as part of this program. (I will continue development and maintenance of it, however) The docs are available online at: http://blogloufoque.free.fr/unicode/doc/html/ The code, documentation, examples, tests and data parser are also available on the sandbox subversion repository, and as an archive on the vault: http://tinyurl.com/n9xqju Note you will need to set BOOST_ROOT to the root of your boost trunk checkout in order to compile the library, examples, tests, documentation or data parser. One particular issue subject to debate lately is the name of the "Pipe" concept. It has been suggested it be renamed to Transducer, Transcoder or Converter. I would appreciate community feedback on this. I'm also trying to polish documentation, so I would like to know anything that could be made better, or anything that is a bit unpractical or hard to understand. (and of course, things that are incorrect as well) You will also notice part of the reference is separate, and that some files do not lie under boost/unicode. Those are things I am pondering whether they should get included in Boost.Iterator or Boost.Range instead of Boost.Unicode. any_range (which depends on any_iterator, that I didn't write) and join_iterator certainly ought to not be in the Unicode library, but I'm unsure about the rest. There are also a few little things in the source I'd like to get included elsewhere, such as foreach_auto, common_type, static_pow and mpl/ustring, but I didn't document these at all.

2 3

[serialization] Linker errors in trunk
by Hartmut Kaiser 28 Aug '09

28 Aug '09

Sorry, resending as it ended up on the wrong list... ----------------------------- Since the latest changes in trunk I'm seeing linker errors while linking with the serialization library (VS2005 SP1, boost_serialization-vc80-mt-gd-1_40.lib): runtime_support.obj : error LNK2001: unresolved external symbol "__declspec(dllimport) public: __thiscall boost::archive::archive_exception::archive_exception(enum boost::archive::archive_exception::_exception_code,char const *,char const *)" (__imp_??0archive_exception@archive@boost@@QAE@W4_exception_code@012@PBD1@Z) (note the leading underscore in _exception_code) Which is really strange as this symbol is the only missing one. OTOH, the library exports the symbol: boost::archive::archive_exception::archive_exception( enum boost::archive::archive_exception::exception_code, char const *,char const *); (note the missing underscore in exception_code) If I change the first parameter of the archive_exception constructor to be a 'int' everything builds fine. Any clues? Compiler issue? Regards Hartmut

1 0

Boost release 1.40.0 is available
by Beman Dawes 28 Aug '09

28 Aug '09

Boost release 1.40.0 is available from SourceForge: http://sourceforge.net/projects/boost/files/ As always, the .7z and .zip files have Windows line endings, while the .bz2 and .gz files have POSIX line endings. Please download a file that has line endings appropriate for your platform. There are no new libraries in this release, but lots of libraries have been updated and had bugs fixed, including: * Accumulators * Asio * Circular Buffer * Filesystem * Foreach * Function * Fusion * Hash * Interprocess * Intrusive * MPL * Program Options * Proto * Python * Serialization * Unordered * Xpressive Enjoy! -- The Boost Release Managers

2 1

[1.40, regex] compile problem in boost/regex/v4/cpp_regex_traits.hpp
by Christoph Duelli 28 Aug '09

28 Aug '09

when compiling with gcc 3.3.3 (with #ifdef BOOST_REGEX_BUGGY_CTYPE_FACET active) at line 737: There are 16 entries for an array defined as size 14. This does not compile for gcc 3.3.3 at line 827: there is no char_class_horizontal (or vertical). At least I found none. Might be a typo and perhaps should be char_class_horizontal_space instead? If that is no reason for a 1.40.1 (I could understand that), I'd be grateful for a confirmation that the line 827 issue is correctly fixed by adding "_space". Best regards Christoph

2 1

geodetic library
by DE 28 Aug '09

28 Aug '09

is there a need for subj? i implemented very accurate direct and inverse geodetic problem routines (as well as geocentric (X, Y, Z) to geodetic (B, L, H) conversion) i used bessel's method to derive the formulas 6 iterations for both direct and inverse routines is enough to converge to full double precision (16 digits) however the formulas themselves provide 9 significant digits that is 1cm accuracy regardless of range (i.e. range = 1m..20000km) to get acceptable accuracy, say, 2 iterations is enough (or even 1) however there are several other aspects uncovered (area and perimeter, projections, etc.) -- Pavel

3 9

geodetic library
by DE 28 Aug '09

28 Aug '09

is there a need for subj? i implemented very accurate direct and inverse geodetic problem routines (as well as geocentric (X, Y, Z) to geodetic (B, L, H) conversion) i used bessel's method to derive the formulas 6 iterations for both direct and inverse routines is enough to get full double precision that is 1mm accuracy regardless of range (i.e. range = 1m..20000km) to get acceptable accuracy, say, 2 iterations is enough (or even 1) however there are several other aspects uncovered (area and perimeter, projections, etc.) -- Pavel

2 1

warning in serialization.hpp with g++ 4.1
by Anton Ivanov 28 Aug '09

28 Aug '09

Hello! during usage serialization.hpp from boost 1.40 we found such problem: /usr/local/include/boost/serialization/serialization.hpp: In instantiation of ‘void boost::serialization::load_construct_data(Archive&, T*, unsigned int) [with Archive = boost::archive::text_iarchive, T = std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >]’: /usr/local/include/boost/serialization/serialization.hpp:163: instantiated from ‘void boost::serialization::load_construct_data_adl(Archive&, T*, unsigned int) [with Archive = boost::archive::text_iarchive, T = std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >]’ /usr/local/include/boost/serialization/detail/stack_constructor.hpp:58: instantiated from ‘boost::serialization::detail::stack_construct<Archive, T>::stack_construct(Archive&, unsigned int) [with Archive = boost::archive::text_iarchive, T = std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >]’ /usr/local/include/boost/serialization/collections_load_imp.hpp:77: instantiated from ‘void boost::serialization::stl::archive_input_map<Archive, Container>::operator()(Archive&, Container&, unsigned int) [with Archive = boost::archive::text_iarchive, Container = std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > >]’ /usr/local/include/boost/serialization/collections_load_imp.hpp:191: instantiated from ‘void boost::serialization::stl::load_collection(Archive&, Container&) [with Archive = boost::archive::text_iarchive, Container = std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > >, InputFunction = boost::serialization::stl::archive_input_map<boost::archive::text_iarchive, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > > >, R = boost::serialization::stl::no_reserve_imp<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > > >]’ /usr/local/include/boost/serialization/map.hpp:50: instantiated from ‘void boost::serialization::load(Archive&, std::map<Key, Type, Compare, Allocator>&, unsigned int) [with Archive = boost::archive::text_iarchive, Type = std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, Key = std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Compare = std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, Allocator = std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > >]’ /usr/local/include/boost/serialization/split_free.hpp:58: instantiated from ‘static void boost::serialization::free_loader<Archive, T>::invoke(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > >]’ /usr/local/include/boost/serialization/split_free.hpp:74: instantiated from ‘void boost::serialization::split_free(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > >]’ /usr/local/include/boost/serialization/map.hpp:70: instantiated from ‘void boost::serialization::serialize(Archive&, std::map<Key, Type, Compare, Allocator>&, unsigned int) [with Archive = boost::archive::text_iarchive, Type = std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, Key = std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Compare = std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, Allocator = std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > >]’ /usr/local/include/boost/serialization/serialization.hpp:133: instantiated from ‘void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > >]’ /usr/local/include/boost/archive/detail/iserializer.hpp:170: instantiated from ‘void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::archive::text_iarchive, T = std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<const std::basic_string<char, std::char_traits<char>, std::allocator<char> >, report_impl::CollectInfo> > >, std::vector<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > > >]’ /usr/local/include/boost/serialization/serialization.hpp:94: warning: unused parameter ‘ar’ Patch to fix this warning attached. -- Yours sincerely, Anton Ivanov (ai(a)drweb.com)

1 0

[spirit] spirit2 PDF docs.
by John Maddock 28 Aug '09

28 Aug '09

While trying to build the PDF's of the spirit2 quickbook documentation I've noticed a few SNAFU's: 1) In the release branch, the docs don't currently build: quickbook.quickbook-to-boostbook ..\..\bin.v2\libs\spirit\doc\msvc-9.0\debug\threading-multi\spirit2.xml Generating Output File: ..\..\bin.v2\libs\spirit\doc\msvc-9.0\debug\threading-multi\spirit2.xml d:/data/boost/branches/release/doc/pdf/../../libs/spirit/doc/qi_and_karma/../../example/qi/mini_xml3.cpp:133: error: Template Redefinition: tutorial_xml3_grammar IMO there's no need to fix this for the release, but if there's an easy fix I can apply locally, then I'll include spirit2 in the PDF doc build. 2) In trunk, there are some unresolved internal links: Making portrait pages on A4 paper (210mmx297mm) Error: no ID for constraint linkend: spirit.qi_and_karma.abstracts.attributes. XLink to nonexistent id: spirit.qi_and_karma.abstracts.attributes Error: no ID for constraint linkend: spirit.qi_and_karma.abstracts.parsing_and_generating.the_tokenize_and_phrase_parse___function. XLink to nonexistent id: spirit.qi_and_karma.abstracts.parsing_and_generating.the_tokenize_and_phrase_parse___function Error: no ID for constraint linkend: spirit.lex.lexer_tokenizing.the_generate_static_function. XLink to nonexistent id: spirit.lex.lexer_tokenizing.the_generate_static_function 3) I've also committed some minor fixes to the Jamfiles in Trunk to get the PDF's building from within doc/pdf OK: see https://svn.boost.org/trac/boost/changeset/55798/trunk Cheers, John.

3 4

Re: [boost] [interprocess] shared_memory_object design
by Ion Gaztañaga 27 Aug '09

27 Aug '09

Christian Henning escribió: > Hi there, a colleague of mine is questioning the design decisions in > the shared_memory_object class. The assignment operator and copy > constructor are private. Why? Because the class own a unique resource just like a file. Is fstream copyable? No, movable (in c++0x) just like shared_memory_object. What should the copy constructor do? Also the constructor takes a type > instead of a value as the first parameter. In his eyes it makes it > very inflexible since the creation of or attaching to shared_memory > area has to known at compile time. Ok, this is debatable, because with move semantics you can write: shared_memory_object obj(create? shared_memory_object(create_only, ...): shared_memory_object(open_only, ...)); or shared_memory_object shm; if(create){ shared_memory_object tmp(create_only); tmp.swap(shm); } else{ shared_memory_object tmp(open_only); tmp.swap(shm); } Best, Ion

1 0

different matrix library?
by DE 27 Aug '09

27 Aug '09

behold! i've put my lib in the vault/linalg there are sources as well as documentation (zipped html and CHM file) if you are interested you might try to use it or even perform some performance testing (would you mind to post results in that case?) i tried to write documentation so that any user would be able to figure out what's going on and use the lib without difficulties if you'd run through it i hope you get the image of my proposition any constructive comments are welcome -- Pavel ps do anyone know how to kill directories in the vault?

10 204

[graph] Bug in quickbook docs
by John Maddock 27 Aug '09

27 Aug '09

While looking to build PDF's for trunk, I see the graph lib now has quickbook docs, but the [import ../examples/whatever] should all be [import ../example/whatever] In order to find the files. Cheers, John.

3 3

[rfc] cppgui
by Felipe Magno de Almeida 27 Aug '09

27 Aug '09

I've been working the past two years, on and off, unfortunately more often not, in a GUI library. But I have gotten back to it. And I wanted to make it usable. I believe there are some great things in it. This library has a named parameter interface which is extensible by the backend implementation. I've been working on a QT port, which have been fairly easy so far. My intention is to rework some parts of it, finish most widgets and the surface concept I've been working on and submit to review to boost. But I wanted some ideas on the controller interface and whatever might be useful too in improving the design before submitting. The library is in http://www.assembla.com/wiki/show/cppgui There's a svn and trac there that I use. The library requires the boost/funcitonal/factory.hpp library reviewed and accepted (?), which is not yet part of any boost distribution to compile. You will also need fusion to compile. I've tested with GCC 4.4.0/4.3.3 with QT and win32 with visual C++ 9.0. But should be pretty portable, including qt in visual C++. The gtk code does not compile :(. There are some very primitive documentation in the site, and some examples in the svn. Thanks in advance, -- Felipe Magno de Almeida

14 47

[serialization][1.40] Release notes
by Daniel James 27 Aug '09

27 Aug '09

2009/8/7 Daniel James <daniel_james(a)fmail.co.uk>: > 2009/8/7 Matthias Troyer <troyer(a)phys.ethz.ch>: >> >> Robert changed the implementation of pointer serialization. Now different >> headers need to be included and different templates instantiated in the >> source files for any archive to be used by Boost.Serialization. This is a >> breaking change and none of the archives created for releases before 1.40 >> will work out of the box with Boost 1.40. They all will have to be >> rewritten. > > Please can someone write something about this for the release notes? Is this still relevant? If there's a breaking change it should be mentioned in the release notes. Daniel

3 5

[random] release notes?
by Neal Becker 27 Aug '09

27 Aug '09

There are breaking changes in 1.40 mersenne_twister.hpp. Is this in release notes? (Where are release notes?)

2 4

[Test] Problem testing with wstring
by Jared McIntyre 27 Aug '09

27 Aug '09

I'm having an issue testing against wstrings: std::wstring testString(""); BOOST_CHECK_EQUAL(testString,L""); This fails with the following error: std_map.cpp: In member function ‘void vector_in_map_stream_test::test_method()’: std_map.cpp:83: error: no matching function for call to ‘std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >::basic_string(const char [1])’ /usr/include/c++/4.0.0/bits/basic_string.tcc:232: note: candidates are: std::basic_string<_CharT, _Traits, _Alloc>::basic_string(typename _Alloc::size_type, _CharT, const _Alloc&) [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /usr/include/c++/4.0.0/bits/basic_string.tcc:225: note: std::basic_string<_CharT, _Traits, _Alloc>::basic_string(const _CharT*, const _Alloc&) [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /usr/include/c++/4.0.0/bits/basic_string.tcc:218: note: std::basic_string<_CharT, _Traits, _Alloc>::basic_string(const _CharT*, typename _Alloc::size_type, const _Alloc&) [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /usr/include/c++/4.0.0/bits/basic_string.tcc:207: note: std::basic_string<_CharT, _Traits, _Alloc>::basic_string(const std::basic_string<_CharT, _Traits, _Alloc>&, typename _Alloc::size_type, typename _Alloc::size_type, const _Alloc&) [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /usr/include/c++/4.0.0/bits/basic_string.tcc:196: note: std::basic_string<_CharT, _Traits, _Alloc>::basic_string(const std::basic_string<_CharT, _Traits, _Alloc>&, typename _Alloc::size_type, typename _Alloc::size_type) [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /usr/include/c++/4.0.0/bits/basic_string.tcc:182: note: std::basic_string<_CharT, _Traits, _Alloc>::basic_string(const std::basic_string<_CharT, _Traits, _Alloc>&) [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /usr/include/c++/4.0.0/bits/basic_string.tcc:190: note: std::basic_string<_CharT, _Traits, _Alloc>::basic_string(const _Alloc&) [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /usr/include/c++/4.0.0/bits/basic_string.h:2027: note: std::basic_string<_CharT, _Traits, _Alloc>::basic_string() [with _CharT = wchar_t, _Traits = std::char_traits<wchar_t>, _Alloc = std::allocator<wchar_t>] /Users/jared/Source/boost_nobak/boost_1_39_0/boost/test/ test_tools.hpp: In member function ‘void boost::test_tools::print_log_value<T>::operator()(std::ostream&, const T&) [with T = std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >]’: /Users/jared/Source/boost_nobak/boost_1_39_0/boost/test/test_tools.hpp: 467: instantiated from ‘std::ostream& boost::test_tools::tt_detail::operator<<(std::ostream&, const boost::test_tools::tt_detail::print_helper_t<T>&) [with T = std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> >]’ /Users/jared/Source/boost_nobak/boost_1_39_0/boost/test/utils/ lazy_ostream.hpp:74: instantiated from ‘std::ostream& boost::unit_test::lazy_ostream_impl<T>::operator()(std::ostream&) const [with T = const boost ::test_tools::tt_detail::print_helper_t<std::basic_string<wchar_t, std::char_traits<wchar_t>, std::allocator<wchar_t> > >&]’ std_map.cpp:110: instantiated from here /Users/jared/Source/boost_nobak/boost_1_39_0/boost/test/test_tools.hpp: 326: error: no match for ‘operator<<’ in ‘ostr << t’ /usr/include/c++/4.0.0/bits/ostream.tcc:67: note: candidates are: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_ostream<_CharT, _Traits>& (*) (std::basic_ostream<_CharT, _Traits>&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:78: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_ios<_CharT, _Traits>& (*) (std::basic_ios<_CharT, _Traits>&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:90: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(std::ios_base& (*)(std::ios_base&)) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:125: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(long int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:159: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(long unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:102: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(bool) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/ostream:176: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(short int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/ostream:187: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(short unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/ostream:191: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/ostream:202: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:183: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:218: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(long long unsigned int) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:242: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(double) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/ostream:217: note: std::basic_ostream<_CharT, _Traits>& std::basic_ostream<_CharT, _Traits>::operator<<(float) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:265: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(long double) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:288: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(const void*) [with _CharT = char, _Traits = std::char_traits<char>] /usr/include/c++/4.0.0/bits/ostream.tcc:311: note: std::basic_ostream<CharT1, Tr>& std::basic_ostream<_CharT, _Traits>::operator<<(std::basic_streambuf<_CharT, _Traits>*) [with _CharT = char, _Traits = std::char_traits<char>] Is this something that can be worked around without having to convert the string to char? Thanks, Jared

2 3

BCP module list from file
by Matthew Chambers 26 Aug '09

26 Aug '09

Hi, I'm automating the creation of a boost subset tarball with bcp and I had to add passing the module list in from a file because the list got so long (and of course piecemeal invocation results in a lot of redundant copying). Is this a feature that someone wants to patch into an official release? I'll attach the diffs; it was a very simple change but it makes the program scalable for larger projects. Thanks, Matt --- C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/trunk bcp_imp.hpp Wed Aug 26 13:29:19 2009 +++ C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/bcp_imp.hpp Wed Aug 19 15:17:17 2009 @@ -59,6 +59,7 @@ void enable_bsl_summary_mode(); void set_boost_path(const char* p); void set_destination(const char* p); + void set_module_list_file(const char* p); void add_module(const char* p); virtual int run(); --- C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/trunk main.cpp Wed Aug 26 13:29:26 2009 +++ C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/main.cpp Wed Aug 19 15:28:38 2009 @@ -34,11 +34,13 @@ " bcp [options] module-list output-path\n" "\n" "Options:\n" - " --boost=path sets the location of the boost tree to path\n" - " --scan treat the module list as a list of (possibly non-boost)\n" - " files to scan for boost dependencies\n" - " --cvs only copy files under cvs version control\n" - " --unix-lines make sure that all copied files use Unix style line endings\n" + " --boost=path sets the location of the boost tree to path\n" + " --scan treat the module list as a list of (possibly\n" + " non-boost) files to scan for boost dependencies\n" + " --cvs only copy files under cvs version control\n" + " --unix-lines convert all copied files to use Unix style end-lines\n" + " --module-list-file=path reads the module-list from a file, or from standard\n" + " input if the filename is '-'\n" "\n" "module-list: a list of boost files or library names to copy\n" "html-file: the name of a html file to which the report will be written\n" @@ -134,6 +136,10 @@ { papp->set_boost_path(argv[i] + 8); } + else if(0 == std::strncmp("--module-list-file=", argv[i], 19)) + { + papp->set_module_list_file(argv[i] + 19); + } else if(argv[i][0] == '-') { show_usage(); --- C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/trunk bcp_imp.cpp Wed Aug 26 13:29:17 2009 +++ C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/bcp_imp.cpp Wed Aug 19 15:16:59 2009 @@ -95,6 +95,33 @@ m_dest_path = fs::path(p, fs::native); } +void bcp_implementation::set_module_list_file(const char* p) +{ + if(0 == std::strncmp("-", p, 1)) + { + // read lines from standard input + std::string s; + while(std::getline(std::cin, s)) + m_module_list.push_back(s); + } + else + { + fs::path module_list_file_path = fs::path(p, fs::native); + if(!fs::exists(module_list_file_path)) + { + std::runtime_error e("The module list file does not exist."); + throw e; + } + + std::ifstream module_list_file(p, std::ios::in); + + // read lines from file + std::string s; + while(std::getline(module_list_file, s)) + m_module_list.push_back(s); + } +} + void bcp_implementation::add_module(const char* p) { m_module_list.push_back(p); --- C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/trunk bcp.hpp Wed Aug 26 13:29:08 2009 +++ C:/bumbershoot/src/pwiz-src/libraries/boost_1_39_0/tools/bcp/bcp.hpp Wed Aug 19 15:00:27 2009 @@ -28,6 +28,7 @@ virtual void enable_bsl_summary_mode() = 0; virtual void set_boost_path(const char* p) = 0; virtual void set_destination(const char* p) = 0; + virtual void set_module_list_file(const char* p) = 0; virtual void add_module(const char* p) = 0; virtual int run() = 0;

1 0

Re: [boost] compression format (was: Plotting graphs in Scalable Vector Graphics format.)
by OvermindDL1 26 Aug '09

26 Aug '09

On Tue, Aug 25, 2009 at 8:05 AM, Stefan Seefeld<seefeld(a)sympatico.ca> wrote: > On 08/21/2009 01:44 PM, Paul A. Bristow wrote: >> >> And source at >> >> https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization Boost >> Sandbox >> source code >> > > I tried to navigate that in a browser. Unfortunately it seems the html files > aren't meant to be browsed in-place, at least most of the links are invalid. > That's a pity. > > >> And, in case you were on vacation for my first post, some demo plots are >> attached for your amusement. >> > > Could you please use a more widely supported packaging / compression format > ? (E.g., gzip, bz2) > > The pdf tutorial looks great, and I would love to see such a boost.svg > library addition. (Though, this reminds me of all the discussions we have > had about modularity: I think this should be a stand-alone library. But > that's a completely separate discussion.) 7z is rather widely used from what I have seen. All the random zips I have downloaded over the past probably 2 years, probably 80% have been 7z. 7z has been included in all the *nix distro's I have used for the past few years, and most zip programs on Windows supports it just fine as well. 7z compresses a *lot* better then gzip/bzip/zip/etc... Takes more memory and time to do the initial compression, but is fast decompressing. I really doubt you would have any issues opening it, on my Kubuntu install I just click to open it, ditto with my windows.

5 5

[1.40.0] [threads] Unmerged threads changesets
by Beman Dawes 26 Aug '09

26 Aug '09

There are at least nine Boost.Threads changesets in trunk that have not been merged into the release branch. They date back to February. There are several multiple-platform trunk test failures that seem related to one or more of these changesets. I pinged Anthony yesterday about one of the changesets, but have had no reply. Given the above, plus the fact that 1.40.0 is really late already, I'm going to go ahead with the release without these changesets. --Beman

1 0

Plotting graphs in Scalable Vector Graphics format.
by Paul A. Bristow 26 Aug '09

26 Aug '09

Further to my post advertising Plotting graphs in Scalable Vector Graphics and inviting feedback, I am encouraged by the several ' looks neat' comments. I have now improved the documentation - and even reduced the number of typos a little ;-) (With several hundred options, effective documentation is uncommonly challenging). You will find a PDF documentation at https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization/libs/svg_plo… /pdf/svg_plot.pdf And source at https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization Boost Sandbox source code And, in case you were on vacation for my first post, some demo plots are attached for your amusement. Finally - I would like to ask how many of you were deterred from looking at the many examples of plots when you found that Microsoft Internet Explorer failed to render the files (unless you installed the Adobe SVG view add-in - and you couldn't be bothered to do that). Is this (lamentable) lack fatal to people's interest in SVG? Thank you. Paul --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

2 2

Comparative analysis of Boost versus ACE
by Dhiman Lahiri 26 Aug '09

26 Aug '09

Hello, We are planning to port our Windows software on to Linux and we were thinking of Boost and ACE as alternatives. But I am not sure as to which one would suit our needs. The things we need from the library would be: 1) Threads, IPC 2) Shared memory abstraction 3) OS calls abstraction I would like to know which one would have a smaller memory footprint. Thanks in advance. Best regards, Dhiman Lahiri

2 1

Bug in lexertl library (in Spirit)
by Alejandro Rivero Pérez 25 Aug '09

25 Aug '09

Hi There is a bug in the lexertl library. This library is being used in spirit but being prepared for submission to boost as a separate library. The file consts.hpp contains the lines: const std::size_t num_wchar_ts = (boost::integer_traits<wchar_t>::const_max < 0x110000) ? boost::integer_traits<wchar_t>::const_max: 0x110000; Which should be: const std::size_t num_wchar_ts = (boost::integer_traits<wchar_t>::const_max + 1 < 0x110000) ? boost::integer_traits<wchar_t>::const_max + 1: 0x110000; Currently the lexer will cause a buffer overflow parsing a 0xffff value in a wchar_t buffer (assuming sizeof(wchar_t) is 2). Best regards, Alex

2 1

[task] functor passed to a boost::task::task not always destroyed?
by Harald Winroth 25 Aug '09

25 Aug '09

I wrote a short test program to check that each copy construction of a functor passed to a boost::task::task and boost::task::async was balanced by a corresponding destructor call. This is indeed the case when the task is run in a thread pool but it seems as if one destructor call is missing when the task is submitted to to boost::task::async with a boost::task::new_thread execution policy. Here is the a short test program and the resulting output. For comparison, the same functor is also passed directly to a boost::thread, which behaves as expected. The program was compiled using Visual C++ 2005 (SP1), and boost 1.39.0 with the latest Boost.Task library from the vault dropped in. Any ideas? Am I missing something? Best regards Harald --- Output: Running Runnable as a task Runnable() [0012FF57] Runnable(const Runnable&) [0012FE88] Runnable(const Runnable&) [0012FE40] Runnable(const Runnable&) [00463B9C] ~Runnable() [0012FE40] ~Runnable() [0012FE88] Runnable::operator() [00463B9C] ~Runnable() [0012FF57] Running Runnable directly on a thread Runnable() [0012FF33] Runnable(const Runnable&) [0012FE8C] Runnable(const Runnable&) [0012FE5C] Runnable(const Runnable&) [0012FDDC] Runnable(const Runnable&) [001541D8] ~Runnable() [0012FDDC] ~Runnable() [0012FE5C] ~Runnable() [0012FE8C] Runnable::operator() [001541D8] ~Runnable() [001541D8] ~Runnable() [0012FF33] --- Test program: #include <boost/thread.hpp> #include <boost/task.hpp> #include <iostream> void print(const std::string& s, void* instance = 0) { static boost::mutex mutex; boost::lock_guard<boost::mutex> guard(mutex); std::cout << s; if (instance) std::cout << " [" << instance << "]"; std::cout << std::endl; } struct Runnable { Runnable() { print("Runnable()", this); } Runnable(const Runnable&) { print("Runnable(const Runnable&)", this); } ~Runnable() { print("~Runnable()", this); } void operator()() { print("Runnable::operator()", this); } }; int main() { { print("Running Runnable as a task"); Runnable r; boost::task::handle<void> h = boost::task::async(boost::task::make_task(r), boost::task::new_thread()); h.wait(); } { print("Running Runnable directly on a thread"); Runnable r; boost::thread thread(r); thread.join(); } return 0; }

2 1

[1.40.0] Freeze for release candidate
by Beman Dawes 25 Aug '09

25 Aug '09

As far as I can tell, all the branches/release merges we were waiting for have now been completed. The plan is to go ahead with the release candidate as soon as all the release branch tests have cycled for revision 55757. Please commit no more changes to branches/release without explicit permission from me. Thanks, --Beman

9 32

Re: [boost] [1.40.0] Freeze for release candidate
by Eric Niebler 25 Aug '09

25 Aug '09

Matthias Troyer wrote: > On Aug 25, 2009, at 3:15 PM, Eric Niebler wrote: >> We have some MPI test results now. Matthias >> should have a look and report on the failures there. Then we can >> decide whether there are any showstoppers. >> >> Marshal, can you make sure Matthias has access to your test results? > > I saw some test results, and they are the failures I also sometimes see: > the skeleton&contents tests sometimes fail, and sometimes work. This is > the same as in the past and Doug Gregor had explained it as a problem of > the underlying MPI implementation. Looking deeper into it would require > more time than is available. These are not regressions but issues that > have been around for a while. Thanks, Matthias. This is good enough for me to feel comfortable moving ahead with the 1.40 release. Beman, Jeremiah, any objections? -- Eric Niebler BoostPro Computing http://www.boostpro.com

3 4

[move][containers] Fast track request response
by John Phillips 25 Aug '09

25 Aug '09

Ion and all, Ron and I have discussed the fast track review requests, and we have decided they should be normal reviews. The Move library is a single header, but that header has a lot of functionality in it. In addition, it is a very good capability to provide so we expect that it will be used heavily from the time it is added until move support becomes commonly implemented in C++0x compliant compilers. So, giving everyone a chance to really dig deep and mull the details is important. The container library is a larger collection of code and will just take some time for people to absorb well enough to review well and so should have a full review. To be clear, this is not intended as a criticism of the quality of the code and documentation, but instead a recognition of how important it is likely to become. So, we want to make sure it gets a thorough review. Thanks to Ion for producing the libraries, and to the future reviewers for their input. We strongly encourage review manager volunteers to step forward so we can schedule the reviews quickly. John Phillips Ron Garcia Review Wizards

2 1

[UUID] uuid.hpp Objective C++ conflict.
by M M 25 Aug '09

25 Aug '09

Hello, I'm interested in using the uuid library for iphone development. Unfortunately, I can't use it "out of the box" because the function nil in uuid.hpp collides with the Objective C keyword of the same name and, hence, I get a compiler error. If I change the name to mynil, then it compiles ok. 1) Given this conflict, will you still proceed with the same function name? (As an fyi, all other boost libraries I've incorporated into the iphone fortunately don't have this problem.) 2) If so, do you have any suggestions on how I can handle this issue besides manually changing the function name from nil to something else? Thanks, Mostafa

6 9

[UUID] uuid.hpp ODR violation and Ctrl-M pollution
by Mostafa 25 Aug '09

25 Aug '09

Hi all, Using "uuid_alt_v13_pod.zip": 1) It seems that some namespace function definitions in uuid.hpp violate the ODR, specifically the ones lacking inline keyword. This is one of the errors I get using Apple's g++-4.0 when including uuid.hpp in two different source files: ld: duplicate symbol boost::uuids::operator>=(boost::uuids::uuid const&, boost::uuids::uuid const&) If I add inline to the aforementioned function definitions, then the linker errors go away, which makes since. After some digging around, this issue was discussed beginning with: http://lists.boost.org/Archives/boost/2007/05/122479.php but seems to have cropped back up. Examples are: "uuid/boost/uuid/uuid_io.hpp" and the files under "uuid/libs/uuid/test/"2) Also some files in the package are pseudo-randomly sprinkled with Ctrl-M characters, as if someone edited them with two different editors.. -Mostafa

3 4

[1.40] Beta build of PDF docs available.
by John Maddock 25 Aug '09

25 Aug '09

A beta build of the docs for Boost-1.40 in PDF format is available from https://sourceforge.net/projects/boost/files/boost-docs/1.40.0/boost_pdf_1_… If folks can check their library's PDF docs for the usual SNAFU's that would be much appreciated (note only if your Boost library contains quickbook/boostbook/docbook format docs). Enjoy, John.

5 13

Re: [boost] Boost.Multimethod proposal
by OvermindDL1 25 Aug '09

25 Aug '09

On Sat, Aug 22, 2009 at 10:40 PM, Kim Barrett<kab.conundrums(a)verizon.net> wrote: > At 11:58 PM -0400 8/22/09, Edward Diener wrote: >> >> This does not explain the practical purpose of multimethods. I know what >> virtual functions are, of course. What in multimethods improves on the >> polymorphic capabilities of virtual functions that make them a practical >> choice for use over normal polymorphism. > > The previously referenced paper > (http://research.att.com/~bs/multimethods.pdf) > contains rationale discussion, including several well chosen examples where > multiple dispatch can be beneficial. To be blunt though, Virtual Methods are not proper OO, multimethods are proper OO. C++ has been lacking in this, sometimes important area of OO, where things like LISP do wonderfully. Hmm, I know LISP has a well optimized multimethod implementation written in pure LISP, wonder how easily that method could be transferred to C++, although more verbose...

4 6

Request for feedback - Map providing insertion order preserving iteration
by Gautam Sewani 24 Aug '09

24 Aug '09

Hi, We wanted to add a map to Boost C++ libraries which would allow iteration in the order in which elements were inserted, and would also provide logarithmic time retrieval. A simple design for this would be to have a balanced binary tree along with an auxiliary linked list of pointers to the keys in the tree. We would be grateful if you could provide feedback on the utility and design. Regards Gautam Sewani Satyam Shekhar

2 1

[signals2] How to build docs?
by John Maddock 24 Aug '09

24 Aug '09

I'm looking into building PDF versions of the docs for 1.40 and I'm having trouble building the signals2 docs. For example if I cd into libs/signals2/doc and build from there, then the XML code snippets aren't found. Likewise if I build as a dependency from doc/pdf. Any ideas? Thanks, John.

3 7

Re: [boost] [C++-sig] [Boost.Python] Request to merge some patches from trunk into 1.40 branch (was: Re: PySide has been released)
by Stefan Seefeld 24 Aug '09

24 Aug '09

Anderson, let me forward that mail to the main boost list, and ping Beman (release manager) and David (boost.python maintainer). Beman, David, if it's not too late, I may help merge trunk to the release branch. Let me know... Stefan On 08/21/2009 08:08 AM, Anderson Lizardo wrote: > I think it was not clear in the announcement, but PySide uses Boost.Python. > > And for it to work properly, we need a few patches that are already in > Boost SVN trunk, but in none of the release branches. > > Therefore, is it possible to get these patches merged into the 1.40 > release branch before the final release? That would make life a lot > easier for other distros to try PySide without requiring to apply > patches separately. > > The relevant commits are listed in http://www.pyside.org/downloads/, they are: > > Add generic call operator support. > https://svn.boost.org/trac/boost/changeset/47846 > Support C++ enums which have the same value. > https://svn.boost.org/trac/boost/changeset/53660 > Fix unsigned integer converters. > https://svn.boost.org/trac/boost/changeset/54919 > Fix unsigned integer converters (update). > https://svn.boost.org/trac/boost/changeset/54923 > > IMHO these patches fix important bugs in Boost.Python, and the first > two were in trunk even before the 1.39 release, but were never > merged... > > Thanks in advance, > -- ...ich hab' noch einen Koffer in Berlin...

3 2

[Boost.Python] Request to merge some commits from trunk into 1.40 branch
by Anderson Lizardo 24 Aug '09

24 Aug '09

[I accidentally sent this e-mail to the C++-sig mailing list, please don't consider it a cross-post] As announced on the C++-sig mailing list, PySide was released: www.pyside.org. I think it was not clear in the announcement, but PySide uses Boost.Python. And for it to work properly, we need a few patches that are already in Boost SVN trunk, but in none of the release branches. Therefore, is it possible to get these patches merged into the 1.40 release branch before the final release? That would make life a lot easier for other distros to try PySide without requiring to apply patches separately. The relevant commits are listed in http://www.pyside.org/downloads/, they are: Add generic call operator support: https://svn.boost.org/trac/boost/changeset/47846 Support C++ enums which have the same value: https://svn.boost.org/trac/boost/changeset/53660 Fix unsigned integer converters: https://svn.boost.org/trac/boost/changeset/54919 Fix unsigned integer converters (update): https://svn.boost.org/trac/boost/changeset/54923 I think these patches fix important bugs in Boost.Python, and the first two were in trunk even before the 1.39 release, but were never merged... Thanks in advance, -- Anderson Lizardo OpenBossa Labs - INdT Manaus - Brazil

2 1

[persistence] interface overview
by Stefan Strasser 24 Aug '09

24 Aug '09

A while ago, I proposed a persistence library and there was some interest. Since then, the prototype has evolved into a feature-complete, reasonably optimized, implementation. Here's a quick recap of what the library is supposed to do: --------- int main(){ ... shared_ptr<A> shared(new A); db_ptr<A> db(new A); ... } // "shared" is destroyed, "db" is saved to disk to ensure data consistency, there are transactions introduced: transaction tx; //change_objects tx.commit(); if change_objects throws an exception, causing tx to be destroyed without commit() being called, all changes are undone. --------- there is no complete documentation yet, but I've written an overview of the library interface, which can be found here: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=overvi… I'd appreciate your comments. please note the "open issues" section.

4 5

[unordered] allocators and EBO
by Thorsten Ottosen 24 Aug '09

24 Aug '09

Hi James, (Sorry I called you Jeremy in the other post). When the allocator is empty, you should avoid storing them as members in different internal structures, and make the allcator a base class of some of these structures. Thanks -Thorsten

2 2

[mpl] patch for non-typeof map::insert
by Steven Watanabe 24 Aug '09

24 Aug '09

AMDG mpl::map insert can fail after an erase, because it uses size instead of order to determine the next order. The patch https://svn.boost.org/trac/boost/attachment/ticket/2042/insert_impl.hpp.pat… fixes this. Okay to commit? In Christ, Steven Watanabe

3 3

bjam - help please
by Edward Grace 23 Aug '09

23 Aug '09

Since I'm trying to Boostify (is that a legitimate word now? - heck you can verb anything these days) my code, I decided to try bjam: Gulp, having been weaned on automake and fiends [sic] it looks like it should be easy enough, but I've fallen at the first hurdle: In Jamroot: using gcc : 4.4 : g++-4 ; exe example_basic : example_basic.cpp : <include>. ; The <include>. line, as I understand it will mean the #include <blah> that I use will pick up stuff in the same directory as the source file (this seems ok). My problem is the link stage, $ bjam example_basic ...found 53 targets... ...updating 1 target... gcc.link bin/gcc-4.4/debug/example_basic /usr/bin/ld: unknown flag: --start-group collect2: ld returned 1 exit status "g++-4" -o "bin/gcc-4.4/debug/example_basic" -Wl,--start- group "bin/gcc-4.4/debug/example_basic.o" -Wl,-Bstatic -Wl,- Bdynamic -Wl,--end-group -g ...failed gcc.link bin/gcc-4.4/debug/example_basic... I've no idea where all this --start-group stuff comes from -- never seen it before. Any ideas? -ed ------------------------------------------------ "No more boom and bust." -- Dr. J. G. Brown, 1997

2 6

regex/ICU fix
by Vladimir Prus 23 Aug '09

23 Aug '09

As reported previously, --build-type=complete does not work if ICU is also configured. The below patch makes build process suppress building static Boost.Regex in this case. The wording is as follows: ghost@wind:~/Work/Boost/boost-svn$ bjam link=static runtime-link=static --with-regex .... warning: when using ICU, Boost.Regex must be a dynamic library warning: forcing link=shared runtime-link=shared for Boost.Regex Note: Building Boost.Regex with Unicode/ICU support enabled Using ICU in /usr/include Note that the warning is printed before the message that we're using ICU, which is ugly, but what I have is a minimal change. I'll tweak those configuration messages for 1.41. Comments? Ok for release branch? - Volodya

3 13

[1.40] PDB fix merge
by Vladimir Prus 23 Aug '09

23 Aug '09

Steven Watanabe has recently reported that a bug in Boost.Build caused boost libraries to be rebuilt when bjam is invoked again after a successful build. This affects msvc. I've just now reproduced and fixed this on trunk: https://svn.boost.org/trac/boost/changeset/55717 Since this fairly annoying behaviour, I would like to merge it to release branch. OK? I'd expect at least on trunk msvc tester to cycle shortly, so I should be able to merge tomorrow morning. Thanks, Volodya

3 3

[mirror] automatic reflection / boost.mirror still in development?
by strasser＠uni-bremen.de 23 Aug '09

23 Aug '09

is boost.mirror (sandbox: https://svn.boost.org/svn/boost/sandbox/mirror/boost/mirror/ ) still in development? looks a bit abandonded to me. when I first saw it I was not too excited about it because I don't think a reflection library that requires the user to register every c++ construct manually is very usable. but GCC recently (finally) integrated a plugin infrastructure, so it would be possible to automatically generate reflection information. I've worked with the GCC internal tree before, it's pretty close to the c++ constructs in the early stages. something like this would be possible: test.cpp: //include result of GCC plugin of test.cpp: #include "test.rpp" class myclass{ int myvar; double myfunction(); }; int main(){ typedef reflection::myclass::myvar::type ret; BOOST_STATIC_ASSERT(is_same<ret,int>::value); typedef reflecton::myclass::myfunction::type::return_type ret; BOOST_STATIC_ASSERT(is_same<ret,double>::value); } //or, lookup in MPL map: template<class T> char const *lookup_name(){ return reflection::type<T>::name; } or anything else you can do with MPL sequences, like iterating over class members. this would have some downsides though: - GCC the library user must install GCC. other compilers can still be used for compilation, but the code to be reflected must be portable to GCC. - license the code generating plugin must be GPLed. that does not affect the license of the user code or other parts of boost though. acceptable downsides imho, given that there are no practical alternatives in sight, like a standard conforming boost C++ parser. what do you think?

4 4

[Exception] Why is there no non-const version of get_error_info?
by Adam Badura 23 Aug '09

23 Aug '09

get_error_info takes a const exception object and returns a pointer to const data object of respective error_info. But why is there no way of getting non-const pointer (which would allow to modify the data)? This is especially strange because operator << can be used to add data to a const exception object so I don't see reason for not being able to get modifiable data back (at least from non-const exception object). Having this would allow me to safely gather exception data before throwing or during exception propagation. What I wanted was to insert an empty vector of data to the preconstructed exception object. Then obtain the vector with get_error_info (since operator << adds a copy I have to get the actual object). Then call reserve on the obtained vector and start the actual operation. During the operation I can gather (possible) error data and safely add it to the vector since memory is already reserved. In the end if any error data was gathered I will throw the preconstructed exception object. In reasonable implementation this should be safe as well. (Similar thing might be done while propagating the exception.) With current code (lack of non-const get_error_info) it is not possible. I have to get the vector from exception object. Then add data to the vector (this may fail). Then again add vector to the exception object (overwriting old vector; this may fail). And in the end throw (if needed). Alternatively I could preconstruct vector, reserve space add data to it. Then in the end if I will throw the data vector is there for me. However I still have to add it to the exception object and this still may fail. Adam Badura

4 15

[fusion] Minor interface change
by Joel de Guzman 23 Aug '09

23 Aug '09

Hi Y'all, Heads up. There will be a minor interface change. vector0 will now be a template: vector0<> to better reflect MPL. This also addresses Boost Trac ticket #1608: https://svn.boost.org/trac/boost/ticket/1608 Please adjust your code accordingly, or holler if you have any complaints. Unless there are objections, I'll commit the code as soon as all the relevant regression tests pass. Regards, -- Joel de Guzman http://www.boostpro.com http://spirit.sf.net

2 3

request for help: g++ compiler error in mapreduce library
by Craig Henderson 22 Aug '09

22 Aug '09

Can someone please help me with a g++ compiler error with my MapReduce library test program? My primary development platform is MSVC 2005 on Windows. I have an Ubuntu box with g++ 4.3.3 which I am not particularly familiar with. Compiling the test program 'mrtest' in boost-sandbox/libs/mapreduce/test on g++, I get an error which I cannot resolve: mrtest.cpp:228: error: expected primary-expression before '>' token here's the piece of code (the full source is in https://svn.boost.org/svn/boost/sandbox/libs/mapreduce/test/mrtest.cpp) typename Job::datasource_type datasource(spec); Job job(datasource, spec); job.run<boost::mapreduce::schedule_policy::cpu_parallel<Job> >(result); // <-- ERROR The code compiles and runs fine on Windows. Any ideas? Thanks -- Craig Craig Henderson <http://craighenderson.co.uk/> http://www.craighenderson.co.uk http://www.siteupdatenotification.com

2 3

Subversion update and boost release schedule
by Marshall Clow 21 Aug '09

21 Aug '09

Begin forwarded message: > Date: Fri, 21 Aug 2009 17:00:19 -0400 > From: "Kim, DongInn" <dikim(a)osl.iu.edu> > To: all-osl-users(a)osl.iu.edu > Subject: [all-osl-users] Upgrading of the OSL SVN server and trac > Sender: osl-mailman-bounces(a)wowbagger.osl.iu.edu > > Hi, > > The new version(1.6.3) of subversion was released on June 2009. It > has a lot of good features included and many bugs are fixed. > http://subversion.tigris.org/servlets/ProjectNewsList > > The OSL would like to upgrade the current subversion(ver 1.5.5) to > get the benefit of the new version. > The upgrade would start at 8:00AM(E.T.) and is expected to take > 8hours on Wed, Aug 26, 2009. > > The subversion service and trac websites services would NOT be > available during the following time period. > > Date: Wed, Aug 26, 2009 > Time: > - 5:00am-1:00pm Pacific US time > - 6:00am-2:00pm Mountain US time > - 7:00am-3:00pm Central US time > - 8:00am-4:00pm Eastern US time > - 12:00pm-8:00pm GMT > > Meanwhile, I will upgrade trac-0.11 to 0.11.5 during this downtime > too. > > Please let me know if you have any concerns or questions about this > upgrade. > > Regards, > > -- > - DongInn How will this interact with the boost release schedule? -- Marshall

2 1

[range] [1.40] iterator_range::size broken for non-random access iterators
by Ryan Gallagher 21 Aug '09

21 Aug '09

We were just upgrading from 1.34.1 to 1.39.0 and I ran into this issue which I note is still in the trunk (and I would assume the 1.40 candidate). The definition of iterator_range::size is using operator- where it should be using std::distance as it did in boost 1.34 days: """ difference_type size() const { BOOST_ASSERT( !is_singular() ); return m_End - m_Begin; } """ It used to be: """ #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x582)) return std::distance<IteratorT>( m_Begin, m_End ); #else return std::distance( m_Begin, m_End ); #endif """ I'm not sure why it would have changed but it's no longer working with bi-directional iterators, etc. Can we put back the old version? Can we get this fixed for 1.40? Thanks, -Ryan

2 5

Checking for return types (result_of) - redux..
by Edward Grace 21 Aug '09

21 Aug '09

Dear all, So, I have nearly figured out what to do, however it seems -- deliberately in fact, that the behaviour of result_of<???> is different when passed a function and a functor. Though I am not sure, the documentation: http://www.boost.org/doc/libs/1_39_0/libs/utility/ utility.htm#result_of "When F is a class type with a **member type result_type**, result_of<F(T1, T2, ..., TN)> is F::result_type." appears to imply that this is the way it should be (emphasis mine). So does the following in fact, http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1454.html So it seems that my original instinct (it's hard) was correct after all. Surely result_of<functor()>::type should resolve to the result type in the same way as it does for anything else callable (like a function). Anything else seems to be a big fat pain in the rear... Or, put another way, can I get what I want? Example below, the problem is s.member_function(one). Help! -ed #include <boost/mpl/assert.hpp> #include <boost/utility/result_of.hpp> #include <boost/type_traits/is_same.hpp> void void_f() {} unsigned unsigned_f() { return 1; } // We want member_function to accept any callable object (functor, // function pointer) thing that returns an unsigned integer. // // value = f(); // // Should work. struct S { template <class O> void member_function(O f) { // We require that the function/functor f returns an unsigned integer. BOOST_MPL_ASSERT( (boost::is_same<unsigned, typename boost::result_of<O()>::type>) ); unsigned sum(0); sum += f(); } }; struct one_functor { // This is apparently needed if we want to use result_of<..> on nullary functors like this. // typedef unsigned result_type; unsigned operator()() { return 1; } }; int main() { S s; one_functor one; unsigned val=one(); // We can assign to the val from the // instantiated functor. // THIS DOES NOT WORK AS IT SHOULD... s.member_function(one); // This does not work as // boost::result_of<O()> is, apparently // one_functor instead of unsigned // // Uncommenting the typedef in one_functor makes it // work - but it seems like a right pain in the rear. s.member_function(unsigned_f); // Works fine. // s.member_function(void_f); // Dies as it should! return 0; }

5 12

[1.40] OK to patch docs on release branch?
by John Maddock 21 Aug '09

21 Aug '09

Is it still Ok to patch the docs on the release branch? I have one small patch for the Boostbook docs (currently they produce invalid Docbook XML :-( ), and one for the doc/pdf/Jamfile.v2. Cheers, John.

2 2

[1.40] Any new libraries in 1.40?
by John Maddock 21 Aug '09

21 Aug '09

Are there any new libraries in 1.40 that need their docs adding to the PDF build? If there are then they need to be added to the release notes as well BTW... Just double checking yours, John.

2 2

graph_parallel
by Vladimir Prus 21 Aug '09

21 Aug '09

I notice that release branch now has libs/graph_parallel. I have a couple of questions about that: 1. I don't see any mention of this addition at http://beta.boost.org/users/news/version_1_40_0 Jeremiah, unless I've missed something, would you please add something to release notes? 2. Normally, directories under libs/ correspond to libraries. I do not see any review for new library called graph_parallel on: http://www.boost.org/community/review_schedule.html, which suggest to me this is actually part of Boost.Graph libraries. Why does it have top-level directory? Thanks, Volodya

2 1

Checking for return type -- BOOST_STATIC_ASSERT?
by Edward Grace 21 Aug '09

21 Aug '09

I'd like to be able to make certain that a function/functor returns a double precision floating point value. I was always under the impression that it's essentially impossible to check things based on return type. Is there a way to do this? Something like BOOST_STATIC_ASSERT, who knows perhaps that *can* do it.. Ideally I would like to have some sort of compile type warning so that in the following context, class myclass { public: ... template <class O> a_func(O functor) { ASSERT_IS_A_FUNCTOR(O); ASSERT_RETURN_TYPE_CONVERTABLE_TO_FLOAT(O); } }; if O is compatible with the concept of a functor and O returns a type that can be converted to a float, then we are good to go -- otherwise I'd like an intelligible error. If, for example, O is of the type 'void (*)()' I'd like it (the compiler) to spit out, "The function pointer of type O must of signature float (*)()" Any ideas? -ed ------------------------------------------------ "No more boom and bust." -- Dr. J. G. Brown, 1997

4 8

Re: [boost] [interprocess] SHARING_VIOLATION due to antivirus
by raindog＠macrohmasheen.com 21 Aug '09

21 Aug '09

I can confirm that I received your message twice. ------Original Message------ From: Isidor Zeuner Sender: boost-bounces(a)lists.boost.org To: boost(a)lists.boost.org ReplyTo: boost(a)lists.boost.org Sent: Aug 20, 2009 9:21 PM Subject: Re: [boost] [interprocess] SHARING_VIOLATION due to antivirus > Quoting Lars Hagstrom <lars(a)update.uu.se>: > > > Yes, of course it is due to bad AV. But for me it would still be handy > > if boost.interprocess was a little bit more tolerant towards that. If my > > software crashes it will be perceived as buggy, however much I blame AV... > > One thing you can do is to, at startup, detect if nod32.dll is loaded in your > process, and throw up a warning dialog to tell the user that the AV software is > buggy. > This seems inappropriate since, if anything, the operating system kernel which forces user space programmers into busy waiting for obtaining locks could be considered buggy by design in that regard. However, this bug could even be warned about at compile time, so we could solve this in boost itself. It is probably inappropriate to do so by default, but for administrators of heterogenous systems it might become handy to have a preprocessor flag which can warn if someone is about to deploy software which uses features the operating system was not designed for, so it can be considered to move the application to a more appropriate platform. Best regards, Isidor PS: The moderation software of this list seems to be broken. I sent this message before, received a "...was successfully received by the Boost mailing list" acknowledgement after a while, but over 12 hours later the message is still neither "successfully received", nor have I got any new status information. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost Sent from my Verizon Wireless BlackBerry

2 1

[interprocess] SHARING_VIOLATION due to antivirus
by Lars Hagstrom 21 Aug '09

21 Aug '09

Hi, I've discovered that there is some unfortunate interaction of boost::interprocess and at least one antivirus product (ESET Nod32). The problem manifests on some installations, and the symptom is that an interprocess_exception with a native error code of 32 (ERROR_SHARING_VIOLATION) occurs when a named_semaphore (or other named objects) are opened (well, I've only seen it when opening, but depending on the AV product I guess it may happen when creating as well). Googling a bit on this I found http://support.microsoft.com/kb/316609, which suggests that AV products take exclusive locks on files just as a file is being opened, which sometimes upsets calls to CreateFile. What they suggest is doing retries when a sharing violation occurs. I'm not really saying that this is a boost.interprocess bug, but at least for me it would be handy if it was a little bit more tolerant towards AV products. I've managed (after quite a lot of hard work) to get a test environment where I can reproduce this quite easily, so I'm more than willing to help out with testing. Cheers Lars

7 12

ABI Compliance checker
by Neal Becker 20 Aug '09

20 Aug '09

I wonder if something like this could be added to boost release process to warn of incompatibilities? http://ispras.linux-foundation.org/index.php/ABI_compliance_checker

2 1

[ptr_container] new_clone overload
by Frank Mori Hess 20 Aug '09

20 Aug '09

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've noticed that ptr_container/clone_allocator.hpp contains an undocumented overload of new_clone that accepts a pointer-to-const: template< class T > inline T* new_clone( const T* r ); It is annoying because it doesn't support a pointer-to-non-const argument, resulting in a compile error if you try. Any chance one of the following could be done? 1) remove it 2) add a pointer-to-non-const overload 3) change it to template< class T > T* new_clone( T* r ); 4) or if you care about always returning a pointer-to-non-const change it to template< class T > typename remove_const<T>::type * new_clone( T* r ); -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAkpxsyoACgkQ5vihyNWuA4WnCACgwzxlNxG8z8NAln6Ra8+fNHsn Yr8AoL5a8Bdvkoya1p99GcS1W8N2WSjk =rSZQ -----END PGP SIGNATURE-----

2 5

Review Wizard Status Report for June 2009
by Ronald Garcia 20 Aug '09

20 Aug '09

============================================== Review Wizard Status Report for June 2009 ============================================== News ==== Futures: Williams variant Accepted; Gaskill variant Rejected Boost 1.38 Released New Libraries: Revised Libraries: Boost.Range Extension Accepted Polynomial Library Rejected Boost 1.39 Released Constrained Value Review - Review Result Pending Older Issues ============ The Time Series Library, accepted in August 2007, has not yet been submitted to SVN. Eric Niebler and John Phillips are working on making the changes suggested during the review. The Floating Point Utilities Library, has not yet been submitted to SVN. It is slated to be integrated with the Boost.Math library. The Switch Library, accepted provisionally in January 2008, has not yet been submitted for mini-review and full acceptance. The Phoenix Library, accepted provisionally in September 2008, has not yet been submitted for mini-review and full acceptance. A rewrite of Phoenix, basing it on the Proto metaprogramming library, has just begun. General Announcements ===================== As always, we need experienced review managers. The review queue has been growing substantially but we have had few volunteers, so manage reviews if possible and if not please make sure to watch the review schedule and participate. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants or library contributors. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "garcia at osl dot iu dot edu" and "phillips at mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. A recent effort is trying to secure at least five people who promise to submit reviews as a precondition to starting the review period. Consider volunteering for this and even taking the time to create the review as early as possible. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. If you're a library author and plan on submitting a library for review in the next 3-6 months, send Ron or John a short description of your library and we'll add it to the Libraries Under Construction below. We know that there are many libraries that are near completion, but we have hard time keeping track all of them. Please keep us informed about your progress. Review Queue ============ * Lexer * Shifted Pointer * Logging * Log * Join * Pimpl * Thread Pool * Endian * Meta State Machine * Conversion * Sorting * GIL.IO * AutoBuffer * String Convert -------------------- Lexer ----- :Author: Ben Hanson :Review Manager: Eric Neibler :Download: `Boost Vault <http://boost-consulting.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. Shifted Pointer --------------- :Author: Phil Bouchard :Review Manager: Needed :Download: `Boost Vault <http://www.boost-consulting.com/vault/index.php?&direction=0&order=&directo… >`__ :Description: Smart pointers are in general optimized for a specific resource (memory usage, CPU cycles, user friendliness, ...) depending on what the user need to make the most of. The purpose of this smart pointer is mainly to allocate the reference counter (or owner) and the object itself at the same time so that dynamic memory management is simplified thus accelerated and cheaper on the memory map. Logging ------- :Author: John Torjo :Review Manager: Gennadiy Rozental :Download: http://torjo.com/log2/ :Description: Used properly, logging is a very powerful tool. Besides aiding debugging/testing, it can also show you how your application is used. The Boost Logging Library allows just for that, supporting a lot of scenarios, ranging from very simple (dumping all to one destination), to very complex (multiple logs, some enabled/some not, levels, etc). It features a very simple and flexible interface, efficient filtering of messages, thread-safety, formatters and destinations, easy manipulation of logs, finding the best logger/filter classes based on your application's needs, you can define your own macros and much more! Log --- :Author: Andrey Semashev :Review Manager: Needed :Download: `Boost Vault <http://tinyurl.com/cm9lum>`__ :Description: The library is aimed to help adding logging features to applications. It provides out-of-box support for many widely used capabilities, such as formatting and filtering based on attributes, sending logs to a syslog server or to Windows Event Log, or simply storing logs into files. It also provides basic support for the library initialization from a settings file. The library can also be used for a wider range of tasks and implement gathering and processing statistical information or notifying user about application events. Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: | `Boost Vault <http://www.boost-consulting.com/vault/index.php?action=downloadfile&filenam… >`__ | http://www.ddj.com/cpp/205918714 (documentation) :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Thread Pool ----------- :Author: Oliver Kowalke :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: The library provides: - thread creation policies: determines the management of worker threads: - fixed set of threads in pool - create workerthreads on demand (depending on context) - let worker threads ime out after certain idle time - channel policies: manages access to queued tasks: - bounded channel with high and low watermark for queuing tasks - unbounded channel with unlimited number of queued tasks - rendezvous syncron hand-over between producer and consumer threads - queueing policy: determines how tasks will be removed from channel: - FIFO - LIFO - priority queue (attribute assigned to task) - smart insertions and extractions (for instance remove oldest task with certain attribute by newst one) - tasks can be chained and lazy submit of taks is also supported (thanks to Braddocks future library). - returns a task object from the submit function. The task it self can be interrupted if its is cooperative (means it has some interruption points in its code -> ``this_thread::interruption_point()`` ). Endian ------ :Author: Beman Dawes :Review Manager: Needed :Download: http://mysite.verizon.net/beman/endian-0.10.zip :Description: Header boost/integer/endian.hpp provides integer-like byte-holder binary types with explicit control over byte order, value type, size, and alignment. Typedefs provide easy-to-use names for common configurations. These types provide portable byte-holders for integer data, independent of particular computer architectures. Use cases almost always involve I/O, either via files or network connections. Although data portability is the primary motivation, these integer byte- holders may also be used to reduce memory use, file size, or network activity since they provide binary integer sizes not otherwise available. Meta State Machine ------------------ :Author: Christophe Henry :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?direction=0&order=&director… >`__ :Description: Msm is a framework which enables you to build a Finite State Machine in a straightforward, descriptive and easy-to-use manner . It requires minimal effort to generate a working program from an UML state machine diagram. This work was inspired by the state machine described in the book of David Abrahams and Aleksey Gurtovoy "C++ Template Metaprogramming" and adds most of what UML Designers are expecting from an UML State Machine framework: * Entry and Exit Methods * Guard Conditions * Sub state machines (also called composite states in UML) * History * Terminate Pseudo-State * Deferred Events * Orthogonal zones * Explicit entry into sub state machine states * Fork * Entry / Exit pseudo states * Conflicting transitions Conversion ---------- :Author: Vicente Botet :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=co… >`__ :Description: Generic explicit conversion between unrelated types. Boost.Conversion provides: * a generic ``convert_to`` function which can be specialized by the user to make explicit conversion between unrelated types. * a generic ``assign_to`` function which can be specialized by the user to make explicit assignation between unrelated types. * conversion between ``std::complex`` of explicitly convertible types. * conversion between ``std::pair`` of explicitly convertible types. * conversion between ``boost::optional`` of explicitly convertible types. * conversion between ``boost::rational`` of explicitly convertible types. * conversion between ``boost::interval`` of explicitly convertible types. * conversion between ``boost::chrono::time_point`` and ``boost::ptime``. * conversion between ``boost::chrono::duration`` and ``boost::time_duration``. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=al… >`__ :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 8X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 7X as fast as std::sort on x86 processors. string_sort is roughly 2X as fast as std::sort. GIL.IO ------ :Author: Christian Henning :Review Manager: Needed :Download: `GIL Google Code Vault <http://gil-contributions.googlecode.com/files/rc2.zip >`__ :Description: I/O extension for ``boost::gil`` which allows reading and writing of/in various image formats ( tiff, jpeg, png, etc ). This review will also include the Toolbox extension which adds some common functionality to gil, such as new color spaces, algorithms, etc. AutoBuffer ---------- :Author: Thorsten Ottosen :Review Manager: Needed :Download: `Here <http://www.cs.aau.dk/~nesotto/boost/ auto_buffer.zip>`__ :Description: Boost.AutoBuffer provides a container for efficient dynamic, local buffers. Furthermore, the container may be used as an alternative to std::vector, offering greater flexibility and sometimes better performance. String Convert -------------- :Author: Vladimir Batov :Review Manager: Needed :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bo… >`__ :Description: The library takes the approach of boost::lexical_cast in the area of string-to-type and type-to-string conversions, builds on the past boost::lexical_cast experience and advances that conversion functionality further to additionally provide: * throwing and non-throwing conversion-failure behavior; * support for the default value to be returned when conversion fails; * two types of the conversion-failure check -- basic and better/safe; * formatting support based on the standard I/O Streams and the standard (or user-defined) I/O Stream-based manipulators (like std::hex, std::scientific, etc.); * locale support; * support for boost::range-compliant char and wchar_t-based string containers; * no DefaultConstructibility requirement for the Target type; * consistent framework to uniformly incorporate any type-to-type conversions. It is an essential tool with applications making extensive use of configuration files or having to process/prepare considerable amounts of data in, say, XML, etc. Libraries under development =========================== Please let us know of any libraries you are currently developing that you intend to submit for review. Mirror ------ :Author: Matus Chochlik :Download: | http://svn.boost.org/svn/boost/sandbox/mirror/doc/index.html | `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=mi… >`__ :Description: The aim of the Mirror library is to provide useful meta-data at both compile-time and run-time about common C++ constructs like namespaces, types, typedef-ined types, classes and their base classes and member attributes, instances, etc. and to provide generic interfaces for their introspection. Mirror is designed with the principle of stratification in mind and tries to be as less intrusive as possible. New or existing classes do not need to be designed to directly support Mirror and no Mirror related code is necessary in the class' definition, as far as some general guidelines are followed Most important features of the Mirror library that are currently implemented include: * Namespace-name inspection. * Inspection of the whole scope in which a namespace is defined * Type-name querying, with the support for typedef-ined typenames and typenames of derived types like pointers, references, cv-qualified types, arrays, functions and template names. Names with or without nested-name-specifiers can be queried. * Inspection of the scope in which a type has been defined * Uniform and generic inspection of class' base classes. One can inspect traits of the base classes for example their types, whether they are inherited virtually or not and the access specifier (private, protected, public). * Uniform and generic inspection of class' member attributes. At compile-time the count of class' attributes and their types, storage class specifiers (static, mutable) and some other traits can be queried. At run-time one can uniformly query the names and/or values (when given an instance of the reflected class) of the member attributes and sequentially execute a custom functor on every attribute of a class. * Traversals of a class' (or generally type's) structure with user defined visitors, which are optionally working on an provided instance of the type or just on it's structure without any run-time data. These visitors are guided by Mirror through the structure of the class and optionally provided with contextual information about the current position in the traversal. I'm hoping to have it review ready in the next few months. Interval Template Library ------------------------- :Author: Joachim Faulhaber :Description: The Interval Template Library (Itl) provides intervals and two kinds of interval containers: Interval_sets and interval_maps. Interval_sets and maps can be used just as sets or maps of elements. Yet they are much more space and time efficient when the elements occur in contiguous chunks: intervals. This is obviously the case in many problem domains, particularly in fields that deal with problems related to date and time. Interval containers allow for intersection with interval_sets to work with segmentation. For instance you might want to intersect an interval container with a grid of months and then iterate over those months. Finally interval_maps provide aggregation on associated values, if added intervals overlap with intervals that are stored in the interval_map. This feature is called aggregate on overlap. It is shown by example: :: typedef set<string> guests; interval_map<time, guests> party; guests mary; mary.insert("Mary"); guests harry; harry.insert("Harry"); party += make_pair(interval<time>::rightopen(20:00, 22:00),mary); party += make_pair(interval<time>::rightopen_(21:00, 23:00),harry); // party now contains [20:00, 21:00)->{"Mary"} [21:00, 22:00)->{"Harry","Mary"} //guest sets aggregated on overlap [22:00, 23:00)->{"Harry"} As can be seen from the example an interval_map has both a decompositional behavior (on the time dimension) as well as a accumulative one (on the associated values). StlConstantTimeSize ------------------- :Author: Vicente J. Botet Escriba :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=consta… >`__ :Description: Boost.StlConstantTimeSize Defines a wrapper to the stl container list giving the user the chioice for the complexity of the size function: linear time, constant time or quasi-constant. In future versions the library could include a similar wrapper to slist. InterThreads ------------------- :Author: Vicente J. Botet Escriba :Download: `Boost Vault <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=in… >`__ :Description: Boost.InterThreads extends Boost.Threads adding some features: * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz. Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples.

13 49

[shifted_ptr] Status
by Phil Bouchard 20 Aug '09

20 Aug '09

Greetings: More than a year ago I have submitted a quite stable version of the shifted_ptr memory manager. I am not aware of the level of understanding of it but I am planning writing more documentation, helping introducing it quicker. For now there is a quick presentation which can be found at: http://svn.boost.org/svn/boost/sandbox/shifted_ptr/libs/smart_ptr/doc/Shift… As far as I am concerned, I stepped into astrophysics and I wrote a book called "Finite Relativism" reengineering the whole relativity theory with standard calculus. This is out of topic for this list but I need writing a complex simulator so I will post on "user". Thank you, -Phil

2 2

building a run-time static version
by Lorenzo Bettini 20 Aug '09

20 Aug '09

Hi I was trying to build a static version of the regex library (boost 1.39), issuing this command: ./bjam --build-dir=build_static --layout=system threading=single runtime-link=static link=static but I always get this error: error: link=shared together with runtime-link=static is not allowed error: such property combination is either impossible error: or too dangerious to be of any use but why is it trying to use link=shared when I explicitly specified link=static? thanks in advance Lorenzo -- Lorenzo Bettini, PhD in Computer Science, DI, Univ. Torino ICQ# lbetto, 16080134 (GNU/Linux User # 158233) HOME: http://www.lorenzobettini.it MUSIC: http://www.purplesucker.com http://www.myspace.com/supertrouperabba BLOGS: http://tronprog.blogspot.com http://longlivemusic.blogspot.com http://www.gnu.org/software/src-highlite http://www.gnu.org/software/gengetopt http://www.gnu.org/software/gengen http://doublecpp.sourceforge.net

2 10

[flat_set/flat_map] request for new constructor that accepts a sorted sequence
by Thorsten Ottosen 20 Aug '09

20 Aug '09

Hi Ion, It would be veyr nice to have the following constructor: template< class Iter > flat_container( Iter, Iter, bool /*tag*/ ); which allows one to give the container an already sorted sequence (this would be the precondition). -Thorsten

2 4

[spirit][karma] In-place modification of previously parsed content?
by Carlos Rafael Giani 19 Aug '09

19 Aug '09

Hello, I wonder if it is possible to modify previously parsed content using Karma. An example is some text like: coordinate (1, 4.15, 1.49, 0.81) // some comment 1 coordinate (1, -19, 4, -1) // some comment 2 Now suppose the numbers are all parsed, and I change the 0.81 to 71.44. I want to update the text accordingly: coordinate (1, 4.15, 1.49, 71.44) // some comment 2 coordinate (1, -19, 4, -1) // some comment 2 Note how the overall formatting and comments are preserved. The text could contain lots of other strings etc. and they would be all left untouched. This part - the preservation - is the hard one, and I ask, is this possible using Karma?

2 1

[1.40.0] Beta 1 available
by Beman Dawes 19 Aug '09

19 Aug '09

Boost release 1.40.0 beta 1 is available from SourceForge: http://sourceforge.net/projects/boost/files/ This release contains no new libraries, but contains numerous bug fixes for existing libraries. Boost source files with types .bz2 and .gz are created with POSIX-style (\n) line endings. Source files with types .7z and .zip are created with Windows-style (\r\n) line endings. The content is otherwise identical. Be sure to download a file with the appropriate line endings for your platform. If you are new to Boost, be sure to read the Getting Started Guide. See www.boost.org There are three known issues with beta 1: * boost/detail/scoped_enum_emulation.hpp, used by Boost.Filesystem, has a name conflict (enum_t) with Unix header rpc/types.h. Fixed in trunk, but not yet merged into the release. * Boost.Python has fixes in trunk not yet merged into to the release. * Boost.Signals has has fixes in trunk not yet merged into to the release. These issues will be resolved for the final 1.40.0 release. Other than these three known issues, please report any problems with the beta on the developers or users mailing lists. Unless unexpected problems arise, the plan is to ship the final 1.40.0 release in a week to ten days. Thanks, --The Boost release team

3 3

FW: [boost.thread] how to delete this thread from within the thread and thread hangs
by Tan, Tom (Shanghai) 19 Aug '09

19 Aug '09

I debugged through VS2010, it seems that the main thread gets stuck in thread_group::join_all(), while some remaining thread gets stuck in remove_this_thread(). The state of the threads are wait:UserRequest. Does it suggest that a thread cannot be deleted(by operator delete) or removed from the thread_group(by remove_thread()) before the join_all() ? Thanks. -----Original Message----- From: Tan, Tom (Shanghai) Sent: 2009-08-19 10:35 To: 'boost(a)lists.boost.org' Subject: [boost.thread] how to delete this thread from within the thread and thread hangs I am using boost::thread_group to create(using thread_group::create_thread()) and dispatch threads. In order to limit the max thread numbers, at the end of each thread, I remove the thread from the thread_group and delete the thread itself(so that I could decide whether new threads need to be created). However it hangs somewhere between the creation and deletion of the last thread (say the 999th one of 999 in total). My questions are: -1) is it OK to delete the thread from within itself like what I do? if not, what the best way to achieve this -2) why does my code hangs? Below are the related code: //1- code to create and dispatch thread { //mutex for map<thread_id, thread*> operations boost::mutex::scoped_lock lk(m_mutex_for_ptr); // create a thread for this->f(duplicate_hashes) boost::thread* p = m_thread_group.create_thread(boost::bind( &detectiveT<equal_predicate>::f, this, duplicate_hashes )); // save the thread_id -> thread pointer map for later lookup and deletion m_thread_ptrs.insert(make_pair(p->get_id(), p)); // log to console for debug cout << "thread created: " << p->get_id() << ", " << m_thread_group.size() << ", " m_thread_ptrs.size() << "\n"; } //2- code of the thread execution void f(list<map_iterator_type>& l) { Do_something(l); boost::this_thread::at_thread_exit(boost::bind( &detectiveT<equal_predicate>::remove_this_thread, this )); } //3- code to delete the thread itself void remove_this_thread() { { //mutex for map<thread_id, thread*> operations boost::mutex::scoped_lock lk(m_mutex_for_ptr); boost::thread::id this_id(boost::this_thread::get_id()); map<boost::thread::id, boost::thread*>::iterator itr; itr = (m_thread_ptrs.find(this_id)); if(m_thread_ptrs.end() != itr) { // remove it from the control of thread_group m_thread_group.remove_thread(itr->second); // delete it delete itr->second; // remove from the map m_thread_ptrs.erase(this_id); // log to console for debug cout << "thread erased: " << this_id << ", " << m_thread_group.size() << ", " << m_thread_ptrs.size() << "\n"; } } } Thanks.

1 0

[boost.thread] how to delete this thread from within the thread and thread hangs
by Tan, Tom (Shanghai) 19 Aug '09

19 Aug '09

I am using boost::thread_group to create(using thread_group::create_thread()) and dispatch threads. In order to limit the max thread numbers, at the end of each thread, I remove the thread from the thread_group and delete the thread itself(so that I could decide whether new threads need to be created). However it hangs somewhere between the creation and deletion of the last thread (say the 999th one of 999 in total). My questions are: -1) is it OK to delete the thread from within itself like what I do? if not, what the best way to achieve this -2) why does my code hangs? Below are the related code: //1- code to create and dispatch thread { //mutex for map<thread_id, thread*> operations boost::mutex::scoped_lock lk(m_mutex_for_ptr); // create a thread for this->f(duplicate_hashes) boost::thread* p = m_thread_group.create_thread(boost::bind( &detectiveT<equal_predicate>::f, this, duplicate_hashes )); // save the thread_id -> thread pointer map for later lookup and deletion m_thread_ptrs.insert(make_pair(p->get_id(), p)); // log to console for debug cout << "thread created: " << p->get_id() << ", " << m_thread_group.size() << ", " m_thread_ptrs.size() << "\n"; } //2- code of the thread execution void f(list<map_iterator_type>& l) { Do_something(l); boost::this_thread::at_thread_exit(boost::bind( &detectiveT<equal_predicate>::remove_this_thread, this )); } //3- code to delete the thread itself void remove_this_thread() { { //mutex for map<thread_id, thread*> operations boost::mutex::scoped_lock lk(m_mutex_for_ptr); boost::thread::id this_id(boost::this_thread::get_id()); map<boost::thread::id, boost::thread*>::iterator itr; itr = (m_thread_ptrs.find(this_id)); if(m_thread_ptrs.end() != itr) { // remove it from the control of thread_group m_thread_group.remove_thread(me); // delete it delete itr->second; // remove from the map m_thread_ptrs.erase(this_id); // log to console for debug cout << "thread erased: " << this_id << ", " << m_thread_group.size() << ", " << m_thread_ptrs.size() << "\n"; } } } Thanks.

1 0

Introduction
by Jeff 18 Aug '09

18 Aug '09

Hey everyone. I'm Jeff Gosling and been deving in C++ for 8+ years now and I'm looking to get involved in an open source community I am very interested in getting involved in Boost development. I've subscribed to the developer mailing list and have browsed through the community webpage. I've also read up on all the existing boost modules/projects. Obviously I have a bit more reading to do to get to grips with Boost. What I was wondering is how specifically can I help? Where is a good place for someone new to Boost to start? Is there a task list that I can look to for something new to do? Thanks, Jeff

2 1

[1.40.0] Beta 1 release candidate available
by Beman Dawes 18 Aug '09

18 Aug '09

1.40.0 beta 1 release candidates are available at http://boost.cowic.de/rc/ Before pushing the beta out to SourceForge, I'd appreciate it if several people would try the release candidate and report success or problems. Thanks, --Beman

12 29

boost build output locations
by Zachary Turner 18 Aug '09

18 Aug '09

I notice there's some strange asymmetries in the locations that the standard boost build process outputs binaries to. Is there a reason for this? For example, running bjam variant=debug,release address-model=32 I get the following directory structure: bin.v2 --libs ----date_time\build\msvc-9.0 ------debug --------address-model-32 ---------- boost_date_time-vc90-gd-1_39.dll ---------- boost_date_time-vc90-gd-1_39.lib ----------link-static ------------threading-multi -------------- libboost_date_time-vc90-mt-gd-1_39 Alright there is one asymmetry evident. The dll version of the binaries are in address-model-32, and the static library version of the binaries are in address-model-32/link-static/threading-multi. Should there be like a link-dynamic and a link-static? It makes it much easier to automate linking and building if everything is symmetric, because in some compilers (e.g. visual studio) you don't have as much control as you do with a makefile. So then we take a look at boost::thread bin.v2 --libs ----date_time\build\msvc-9.0 ------debug --------address-model-32 ----------link-static ------------threading-multi -------------- libboost_thread-vc90-mt-gd-1_39.lib ----------threading-multi ------------ boost_thread-vc90-mt-gd-1_39.lib ------------ boost_thread-vc90-mt-gd-1_39.dll This time, the dll versions appeared under address-model-32/threading-multi instead of just address-model-32 like in date_time. Am I going crazy and I have a messed up system, or is this just the way it is? Is it easy to change, or would it be undesirable to change for some reason? Zach

2 1

[move][container] Fast-track reviews for Move and Container?
by Ion Gaztañaga 17 Aug '09

17 Aug '09

Hi, As some others have mentioned, I'd like to ask if Boost.Move and Boost.Container could meet the requirements for a Fast Track review (the Review Wizard has the last word according to the Boost Formal Process, but I'll like to see if there is consensus). Arguments: Boost.Move -> Only one header (move.hpp) -> Technique already in use in Boost (in several detail namespaces). This is a proposal for a common implementation. -> Boost-conformant implementation available in sandbox. Boost.Container -> Most of them standard containers -> Node containers are just wrappers over Boost.Intrusive -> Most containers (all except stable_vector) were already reviewed for Boost.Interprocess. -> Boost-conformant implementation available in sandbox. I'll be specially interested in pushing Move first, so that we could have move semantics for Boost 1.41. Best, Ion

4 6

Re: [boost] [1.40.0] Unmerged changes delaying beta 1
by Ralf W. Grosse-Kunstleve 17 Aug '09

17 Aug '09

> I'd prefer these changes go in 1.40.0 if possible. Since they have > been stable on trunk, and we are waiting a few more days anyhow for > beta feedback, I don't see a lot of risk. So please merge, and then > watch the release tests to make sure nothing breaks. All {boost,libs}/python changes are now merged into the release branch. Thanks to Steven Watanabe and Henrik Sundberg for pointing out the http vs. https problem. Ralf

1 0

Re: [boost] [1.40.0] need svn merge advice (was: Unmerged changes delaying beta 1)
by Ralf W. Grosse-Kunstleve 17 Aug '09

17 Aug '09

Beman gave me the advice below. When trying to svn merge libs/python I'm running into this error: svn: Access scheme mixtures not yet supported ('http://svn.boost.org/svn/boost/trunk/libs/python/test/enable_shared_from_th…' and 'https://svn.boost.org/svn/boost/branches/release/libs/python/test') svn: Error reading spooled REPORT request response The full output is below. Fedora release 11 (Leonidas) % svn --version svn, version 1.6.4 (r38063) compiled Aug 7 2009, 03:42:39 The working copy was checked out fresh with this client. The merge command is OK for boost/python. Adding --force doesn't help for libs/python. Last night I locally tested after simply copying the boost/python and libs/python directories into a working copy of the release branch. That works fine, but there will be no merge info if I commit from the manually modified working copy. IIUC that will be a problem for future merges. What's the best way forward? What if I commit from the release working copy with the manual copies from the trunk, then manually edit svn:mergeinfo to tell it I have everything from trunk up to this point? -- Secondary question: should I do this at the top level (branches/release) or in the subdirectories (branches/release/boost/python, branches/release/libs/python)? Any advice is appreciated; I'm quite afraid of doing something bad to the merge info. (The svn documentation explicitly tells me not to merge in subdirectories in order to avoid pitfalls...) Ralf ----- Original Message ---- From: Beman Dawes <bdawes(a)acm.org> To: Ralf W. Grosse-Kunstleve <rwgk(a)yahoo.com> Sent: Monday, August 17, 2009 9:12:37 AM Subject: Re: [boost] [1.40.0] Unmerged changes delaying beta 1 I'd prefer these changes go in 1.40.0 if possible. Since they have been stable on trunk, and we are waiting a few more days anyhow for beta feedback, I don't see a lot of risk. So please merge, and then watch the release tests to make sure nothing breaks. > (I don't have any experience working with the release branch...) The merge process is pretty simple. Assume you have a working copy of branches release at \boost\release: svn merge http://svn.boost.org/svn/boost/branches/release/boost/python \ http://svn.boost.org/svn/boost/trunk/boost/python \ \boost\release\boost\python svn merge http://svn.boost.org/svn/boost/branches/release/libs/python \ http://svn.boost.org/svn/boost/trunk/libs/python \ \boost\release\libs\python % svn merge --force http://svn.boost.org/svn/boost/branches/release/libs/python http://svn.boost.org/svn/boost/trunk/libs/python /net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python --- Merging differences between repository URLs into '/net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python': U /net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python/test/andreas_beyer.cpp U /net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python/test/stl_iterator.py U /net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python/test/exec.cpp U /net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python/test/slice.cpp U /net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python/test/object.cpp U /net/firtree/raid1/rwgk/boost_release_merge_attempt/boost/libs/python/test/enum.py svn: Access scheme mixtures not yet supported ('http://svn.boost.org/svn/boost/trunk/libs/python/test/enable_shared_from_th…' and 'https://svn.boost.org/svn/boost/branches/release/libs/python/test') svn: Error reading spooled REPORT request response

3 2

[C++0x] Report from Frankfurt committee meeting
by Beman Dawes 17 Aug '09

17 Aug '09

The C++ standards committee met in Frankfurt, Germany, last week. Key actions: * Concepts have been removed from C++0x. The committee is very much in favor of Concepts. But Concepts are seen as so important that they have to be right. And the strong consensus was that getting Concepts right, for any reasonable definition of "right", would add several years to the schedule. There was also a consensus that an implementation of a compiler that could compile the entire standard library is part of the definition of "right". While ConceptGCC has been a great help, it isn't there as far as validating "right". Personally, I think Clang may end up being the compiler that eventually validates Concepts. * The range-based for loop and some other library features that were dependent on Concepts will be retained by recasting them to no longer depend on Concepts. See a paper in the upcoming post-meeting mailing to see how range-based for loops will work. * A second Committee Draft (CD2) will need go out for public comment in the Spring or Summer 2010, given the amount of change required to remove Concepts. The C++0x final schedule will thus slip about one year. * No committee action was taken as to how Concepts will eventually make it into C++. While there was a bit of discussion about doing a Concepts Technical Report (TR), there was no such proposal made. Committee members seem to lean toward letting the two rival Concept teams go back to work outside of the committee process. The expectation being they will come back to the committee when they are ready to restart the standardization process. Hopefully the lessons learned about Concepts during the committee process will be taken advantage of, so future standardization of Concepts will be smoother. My personal opinion is that removing Concepts will speed the arrival of conforming C++0x compilers. GCC, for example, has already implemented much of C++0x, so their key developers are no longer faced with the difficult task of turning ConceptGCC into a production compiler, and can concentrate on remaining major features like lambdas. Although Concepts would have added a lot to C++ and Boost, Concepts would also have presented major migration challenges. I'm thinking that for most Boost libraries, migration to C++0x will now be easier and less disruptive. We need to focus on the bright side. --Beman

18 35

boost.lockfree review request
by Tim Blechmann 17 Aug '09

17 Aug '09

hi all, i would like to submit a small library of lock-free data structures for review. boost.lockfree provides implementations of lock-free data structures. lock-free data structures can be accessed by multiple threads without the necessity of blocking synchronization primitives such as guards. lock-free data structures can be used in real-time systems, where blocking algorithms may lead to high worst-case execution times, to avoid priority inversion, or to increase the scalability for multi-processor machines. boost.lockfree provides: * boost::lockfree::fifo, a lock-free fifo queue * boost::lockfree::stack, a lock-free stack the code is available from the boost vault: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boost_… and from my personal git repository: git://tim.klingt.org/boost_lockfree.git http://tim.klingt.org/git?p=boost_lockfree.git the documentation is available at: http://tim.klingt.org/boost_lockfree/ thanks in advance, tim -- tim(a)klingt.org http://tim.klingt.org You don't have to call it music if the term shocks you. John Cage

1 0

[1.40.0] Unmerged changes delaying beta 1
by Beman Dawes 17 Aug '09

17 Aug '09

There seem to be a large number of changes to trunk that have not been merged into branches/release. Perhaps a lot of merges were forgotten after the bug fixing sprint. All of the libraries listed below are suspect, although some may just be holding changes until after the release. "svn diff" can be used to see exactly what changes have not been merged. Here is a simple Windows batch file that eases typing; perhaps someone could post a Unix equivalent. @echo off if not %1$==$ goto usage_ok echo Usage: unmerged library-name goto done :usage_ok svn diff %2 %3 %4 %5 %6 http://svn.boost.org/svn/boost/branches/release/boost/%1.hpp http://svn.boost.org/svn/boost/trunk/boost/%1.hpp svn diff %2 %3 %4 %5 %6 http://svn.boost.org/svn/boost/branches/release/boost/%1 http://svn.boost.org/svn/boost/trunk/boost/%1 svn diff %2 %3 %4 %5 %6 http://svn.boost.org/svn/boost/branches/release/libs/%1 http://svn.boost.org/svn/boost/trunk/libs/%1 :done If your library has changes that need to be merged, please do so right away. I'll hold off on the beta until Monday morning to give folks a chance to do merges and let tests cycle. --Beman accumulators algorithm any array asio assign bimap bind circular_buffer compatibility concept concept_check config conversion crc date_time detail disjoint_sets dynamic_bitset exception flyweight foreach format function function_types functional fusion gil graph integer io iostreams iterator lambda math mpi mpl multi_array multi_index numeric optional parameter pool preprocessor program_options property_map proto ptr_container python random range rational regex scope_exit serialization signals smart_ptr spirit statechart static_assert system thread timer tokenizer tr tuple type_traits typeof units unordered utility variant wave xpressive

13 16

[bgl] Transitive closure
by Gustavo Gutiérrez 14 Aug '09

14 Aug '09

Hello, I am trying to compute the transitive closure of a graph. The definition of the graph is: typedef boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_name_t, int> > graph_t; The code that calls the transitive closure function is: (g is of type graph_t) // prepare a map Vertex-int. map<Vertex,int> extmap; VertexIt vi, v_end; int i = 0; for (tie(vi,v_end) = vertices(g); vi != v_end; ++vi, i++) { extmap.insert(pair<Vertex,int>(*vi,i)); } associative_property_map<map<Vertex,int> > tempMap(extmap); map<Vertex,Vertex> vmap; adjacency_list<> c; boost::transitive_closure(g, c, vmap, tempMap); According with the documentation, tempMap must be a map from vertices to integers. When I try to compile the program, the following error occurs: /usr/local/include/boost/graph/transitive_closure.hpp:182: error: invalid initialization of reference of type 'const std::vector<long unsigned int, std::allocator<long unsigned int> >&' from expression of type 'std::vector<int, std::allocator<int> >' After taking a look at the file, the vector successors is defined as: std::vector<std::vector<cg_vertex> > successors(...); The error occurs with the following call: detail::union_successor_sets(successors[u], successors[v], successors[u]); the definition of union_successor_sets is: inline void union_successor_sets(const std::vector < std::size_t > &s1, const std::vector < std::size_t > &s2, std::vector < std::size_t > &s3) {...} Probably I am really wrong, but successors[u] is an std::vector<cg_vertex> and the function expects a std::vector < std::size_t >. So size_t and cg_vertex should be the same type, which according with the error reported by the compiler is not true. Can someone give me a hint on how to solve my problem? Thaks in advance.

2 2

stack-allocated STL-containers
by Stefan Strasser 13 Aug '09

13 Aug '09

I recently ran into the problem that a local container on the stack, which was likely to be very small, but its size was still not known at compile-time, consumed a considerable amount of runtime because of allocation/deallocation. e.g. void do(istream &i){ vector<int> vec; vec.reserve(20); while(...){ int tmp; i >> tmp; vec.push_back(tmp); } } so I wrote an allocator that I think is generally useful and could be added e.g. to Boost.Array: void do(int n){ int buffer[20]; stack_allocator<int,20> alloc(buffer); vector<int,stack_allocator<int,20> > vec(alloc); vec.reserve(alloc.max_stack_size()); while(...){ int tmp; i >> tmp; vec.push_back(tmp); } } the vector operates on the stack as long as there is enough space, and moves to the heap afterwards. in most cases there is no dynamic allocation. here's the source: http://www.boostpro.com/vault/index.php?action=downloadfile&filename=stack_… it uses the simple_seq_fit allocation algorithm described here: http://www.boost.org/doc/libs/1_37_0/doc/html/interprocess/allocators_conta…

4 5

Generic copy-on-write infrastructure in boost?
by Jason Dictos 13 Aug '09

13 Aug '09

Hi, I'm looking for a way to implement a project using some copy-on-write feature, similar to how STL strings use reference counters to prevent needles copying of data. Is there anything in boost to help me out with this? -Jason ---------------------------------- Check out the Barracuda Spam & Virus Firewall - offering the fastest virus & malware protection in the industry: www.barracudanetworks.com/spam

5 7

[Serialization] Bizarre bug
by Jarl Lindrud 12 Aug '09

12 Aug '09

There is a rather bizarre bug in Boost.Serialization, that was reported on this list three years ago: http://article.gmane.org/gmane.comp.lib.boost.devel/147010/match=serializat… +bizarre+bug To sum up, a piece of code that is never even executed, is causing a serialization error in a different part of the program. Unfortunately it seems that this bug was never fixed - I just tried it on Boost 1.39.0, and the bug is still there. Any chance something can be done about it? For reference, here is the sample program that reproduces the issue: #include <sstream> #include <string> #include <vector> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/serialization/vector.hpp> template<typename Archive> struct X { template<typename T> void operator<<(const T &t) { Archive &archive = (*(Archive *) NULL); archive << t; } }; void dummy() { typedef boost::archive::text_oarchive Archive; X<Archive> &x = * (X<Archive> *) NULL; std::vector<char> *pt = NULL; // uncomment this line to cause the test in main() to fail //x << pt; } int main(int argc, char* argv[]) { std::vector<char> v0(25, '%'); std::vector<char> v1; std::ostringstream ostr; boost::archive::text_oarchive(ostr) & v0; std::istringstream istr(ostr.str()); boost::archive::text_iarchive(istr) & v1; bool ok = (v0 == v1); return 0; }

7 35

[mpl] strange vector_c and integral_c construction
by Maxim Yanchenko 12 Aug '09

12 Aug '09

Hi all, > Probably this is well-known and I just failed to find it in the docs and mailing list. According to the docs (http://www.boost.org/doc/libs/1_39_0/libs/mpl/doc/refmanual/integral-sequen…) typedef seq_c<T,c1,c2,... cn> s; Semantics: s is a sequence seq of integral constant wrappers integral_c<T,c1>, integral_c<T,c2>, ... integral_c<T,cn>. Consider the following example: const int64_t max_int = integer_traits<int>::const_max; const int64_t max_int_plus_1 = max_int + 1; BOOST_MPL_ASSERT(( equal< vector_c< int64_t, 1 > , vector< integral_c< int64_t, 1 > > > )); BOOST_MPL_ASSERT(( equal< vector_c< int64_t, max_int > , vector< integral_c< int64_t, max_int > > > )); BOOST_MPL_ASSERT(( equal< vector_c< int64_t, max_int_plus_1 > , vector< integral_c< int64_t, max_int_plus_1 > > > )); The first assert passes, while the second and third fail with the following error messages (removed repetition of 2147483647l for readability): test.h:149: error: ************mpl::equal<mpl::vector_c<int64_t, 2147483647l, 2147483647l, ...>, mpl::vector<mpl_::integral_c<int64_t, 2147483647>>, is_same<true> >::************' test.h:153: error: ************mpl::equal<mpl::vector_c<int64_t, -0x00000000080000000l, 2147483647l, ...>, mpl::vector<mpl_::integral_c<int64_t, 2147483648ll>>, is_same<true> >::************' I consider these errors as a contradiction to the docs statement. Probably, I configured MPL wrong, as I see in the preprocessed code, where long is used (boost/mpl/aux_/preprocessed/gcc/vector_c.hpp) template< typename T, long C0 = LONG_MAX, long C1 = LONG_MAX, long C2 = LONG_MAX , long C3 = LONG_MAX, long C4 = LONG_MAX, long C5 = LONG_MAX , long C6 = LONG_MAX, long C7 = LONG_MAX, long C8 = LONG_MAX , long C9 = LONG_MAX, long C10 = LONG_MAX, long C11 = LONG_MAX , long C12 = LONG_MAX, long C13 = LONG_MAX, long C14 = LONG_MAX , long C15 = LONG_MAX, long C16 = LONG_MAX, long C17 = LONG_MAX , long C18 = LONG_MAX, long C19 = LONG_MAX > struct vector_c; I'm using GCC 3.4.6, on Linux-64, compiling 32-bit binary (so int and long are of same size, and boost::int64_t is bigger than long). Thanks, Maxim (to reply in private, please use FirstName.LastName at gmail.com)

4 4

Microsoft Security Bulletin MS09-03: Vulnerabilities in Visual Studio Active Template Library Could Allow Remote Code Execution (969706)
by Christian Eckstein 12 Aug '09

12 Aug '09

Hi, I need to know the impact of the following security bulletin on Boost: Microsoft Security Bulletin MS09-03: Vulnerabilities in Visual Studio Active Template Library Could Allow Remote Code Execution (969706). I found usage of ATL only in the range and regex libraries and it seems that only string and array classes are used. None of the problematic methods seem to be used that are described in the checklist at http://msdn.microsoft.com/en-us/visualc/ee309358.aspx. - No class implements IUnknown so there is no ActiveX control. - No PROP_* macros are used - VT_* is not used - ReadFromStream is not used I think no modification of Boost and no recompilation of the Boost binaries is needed. I would be very happy if somebody could confirm this. Kind regards, Christian

2 1

persistence library proposal (with prototype implementation)
by Stefan Strasser 12 Aug '09

12 Aug '09

Is there any interest to include a persistence library in boost, built upon the boost serialization library? the basic idea is: transaction tx; change_objects(); tx.commit(); all changes made by change_objects() should be undone if tx is destroyed without calling commit(), e.g. because of an exception thrown by change_objects(). the library should provide ACID transaction properties, so that multiple transactions (in different threads) can work on the same objects and conflicts are discovered by the library. further, an application crash should be recovered, with the changes made by a transaction either committed as a whole or undone. to partition your object model into many different objects, which can be saved to disk and loaded back on demand, there is a new smart pointer introduced, which behaves like smart_ptr and is convertible to smart_ptr. objects that are handled by this smart pointer and are no longer used in memory are not destroyed but saved to disk. only objects which are no longer in use either in memory or on disk are destroyed. the only requirement on persistent objects would be to model the concept "Serializable" as defined by boost serialization. e.g. a linked list, whose elements are loaded from disk on demand could look like: struct node{ db_ptr<node> next; private: //Serializable requirements }; void traverse(){ while(current) current=current->next; //operator-> loads the next node } prototype implementation --- i've attached a test case using the current implementation. it demonstrates multiple concurrent transactions.running isolated from each other. it models a bank, with multiple threads constantly withdrawing from one (random) bank account and depositing the amount on another. when two threads are using the same bank account at the same time, resulting in money being lost, an isolation_exception is thrown in one of the threads and the transaction can be restarted. there is no manual thread synchronization involved. the current implementation uses an optimistic multiversion approach, meaning that each transaction running concurrently is working on its own copy of an object. when the transaction is committed conflicts are discovered and an isolation_exception is thrown. several things like reference counting on disk and the recovery process after a crash aren't implemented yet, but the basics are in place and should give you an idea of what kind of a library I'm proposing.

4 12

different matrix library?
by DE 12 Aug '09

12 Aug '09

hi i'm new to boost so please don't blame me the question is do you need a matrix library which allows you to write clear, human readable code like dV = (1/m)*force + transpose(A)*g - cross_product(omega, V) //here dV is a derivative of velocity, m is (scalar) mass //A is transition matrix and //g is gravity acceleration vector //omega is angular velocity and V is velocity vector itself //force is defined in body space (e.g. aerodynamics and thrust) that is an expression of newton's 2nd law (or if you like 'change in momentum' law: d(m*V)/dt = d_local(m*V)/dt + (omega)x(m*V) = sum_of(forces) as you can see so far i'm a math nerd) of course it must be implemented through lazy evaluation technique (which immediately implies expression templates) ps i looked at uBLAS and the design seemed obsolete to me so i thought there could be a better approach then blindly following blas design pps thanks for reading til here and forgive for (possibly) wasting your time

9 39

[Interprocess] Possible bug in shared memory on FreeBSD 8.0
by Manish Vachharajani 11 Aug '09

11 Aug '09

I've been happily using Boost.Interprocess to create shared memory regions under FreeBSD 7.2, however, I am having issues on FreeBSD 8.0 pre-release. I can reproduce the problem with Boost 1.39.0 and the svn trunk. The source of the problem appears to be that Boost.Interprocess calls lseek on a file descriptor returned by shm_open, but the results of such an lseek are undefined. Below, I explain further how I came to this conclusion. If you run the program I've appended to the end of this email, the constructor for managed_shared_memory throws an interprocess_exception with error code 29 which is Illegal Seek on FreeBSD. A little bit of system call tracing and debugging reveals that the offending seek is in mapped_region.h:447 (in svn revision 55512). However, digging around, it appears that lseek's behavior on file descriptors for shared memory regions is undefined (See http://www.opengroup.org/onlinepubs/000095399/functions/lseek.html for what IEEE 1003.1 standard has to say about this.) I've confirmed that FreeBSD 7.2 allowed such seeks but 8.0 does not by looking at the kernel source code. For what it's worth AIX 6.1 does not allow such seeks either (see http://publib.boulder.ibm.com/infocenter/systems/index.jsp?topic=/com.ibm.a…) Could someone advise me on what the correct fix for this bug is? I'd be glad to implement it, but I'm not sure what the right fix ought to be. #include <iostream> #include <string> #include <exception> #include <boost/interprocess/managed_shared_memory.hpp> namespace bip = boost::interprocess; int main(const int argc, const char *argv[]) { bool error = true; std::string shmName("testShmRegion"); bip::shared_memory_object::remove(shmName.c_str()); try { std::auto_ptr<bip::managed_shared_memory> segment(new bip::managed_shared_memory(bip::create_only, shmName.c_str(), 12345)); error = false; } catch(const std::exception &e) { std::cerr << "Error: " << e.what() << std::endl; } if(!error) { std::cout << "Shm allocated successfully." << std::endl; } return 0; } Manish

3 9

[asio] very confusing title
by DE 11 Aug '09

11 Aug '09

when i personally see 'asio' i immediately think about steinberg technology asio which stands for 'audio stream i/o' so it's up to you of course just want you to know

4 3

Vault access for Boost.Debug
by Zachary Turner 11 Aug '09

11 Aug '09

Hello, I'd like to request access to the vault. I'm going to upload a proof-of-concept of some of the things I mentioned earlier in my thread about Boost.Debug. This early version gives simple stack traces in limited scenarios, only supports Windows, and isn't designed very well. Here's an example of a program using it in its current form: void test_func(int argc, int argc2, char* argv[]) { stack_trace trace(10); //Maximum depth of 10 levels std::cout << trace.string() << std::endl; } int main(int argc, char* argv[]) { test_func(argc, argc, argv); return 0; } and an example of the stack trace printed as a result of this program: void test_func(int, int, char**) [f:/dev/stack_trace/main.cpp:10] int main(int, char**) [f:/dev/stack_trace/main.cpp:23] int __tmainCRTStartup() [f:/dd/vctools/crt_bld/self_x86/crt/src/crtexe.c:406] int mainCRTStartup() [f:/dd/vctools/crt_bld/self_x86/crt/src/crtexe.c:389] It also currently supports printing the names of all the arguments, but it was hackish and I left it out until it undergoes some redesign. There is currently no documentation, but as this is just a proof of concept I'm currently only looking for people to help out with actual code and/or provide input, so I think that's ok for now. Thanks

5 6

enum / string translation
by Zachary Turner 11 Aug '09

11 Aug '09

I wrote some code to perform both compile-time and runtime translation between enums and their corresponding string values. The only direction that isn't possible is string->enum at compile time. Is there any interest in this? You can use it as follows: typedef enum { ValueA1, ValueA2 } EnumA; typedef enum { ValueB1, ValueB2 } EnumB; BEGIN_ENUM_MAP_DECLS() BEGIN_ENUM_MAP(EnumA, a_map) ENUM_MAP(ValueA1) //maps ValueA1 to the string "ValueA1", provides both compile-time and run-time lookups. ENUM_MAP_NAME(ValueA2, "custom name") //maps ValueA2 to the string "custom name", provides both compile-time and run-time lookups END_ENUM_MAP() BEGIN_ENUM_MAP(EnumB, b_map) ENUM_MAP(ValueB1) ENUM_MAP(ValueB2) END_ENUM_MAP() END_ENUM_MAP_DECLS() void foo() { //value -> string, compile time BOOST_STATIC_ASSERT(enum_map<EnumA>::value_lookup[ValueA2] == "custom name"); //value -> string, runtime EnumB some_value = get_enum_b_from_external_source(); std::cout << "some_value = " << enum_map<EnumB>::name_lookup[some_value] << std::endl; //prints either 'some_value = ValueB1', or 'some_value = ValueB2' //string -> value, runtime EnumA value = enum_map<EnumA>::name_lookup["custom name"]; BOOST_ASSERT(value == ValueA2); } One particularly useful application of this that I've found is with regards to boost::program_options. You can provide an overload of boost::program_options::validate that uses boost::enable_if with boost::is_enum thus providing automatic support for entry of friendly names corresponding to enumerations on the command line or in a config file. Obviously there's many other easily identifiable uses as well. However, this is a common enough problem that I wonder if anyone else has already attempted something like this, and if so maybe I can look at their code first, or just scrap mine altogether and reuse something existing. If not, I'm sure there is plenty of room for improvement in mine but if it could fit somewhere in boost (perhaps boost/utility) I'd be willing to submit it and make necessary improvements. Unfortunately I don't think it's technically possible to have a simple syntax, even through preprocessor magic, that requires you to only specify the name of each enumerated value once, and end up providing both a definition of the enumeration as well as the mapping from string<->value, but if someone comes up with a way that would obviously be ideal.

7 16

[move] moving temporaries of copyable types
by klaus triendl 10 Aug '09

10 Aug '09

Hi, I've recently taken a look at the Boost.Move library and it seems that it is only possible to make 1) either non-copyable types movable or 2) make copyable types move-aware by explicitly moving them. Now, I've discovered for myself that it is possible for pre-c++09 compilers to make copyable types *implicitly* movable by detecting temporaries that can be moved. So, my question is whether this is well-known and this feature was deliberately excluded from Boost.Move or nobody has discovered it yet. It would be great to have support for copy- and (implicit) move-semantics. Klaus Triendl

5 9

[type_traits] is_less_comparable
by Frédéric Bron 10 Aug '09

10 Aug '09

Hi, One year ago, I added to the sandbox the following type_traits: - is_equal_to_comparable, - is_greater_comparable, - is_greater_equal_comparable, - is_less_comparable, - is_less_equal_comparable, - is_not_equal_to_comparable They allow to check if type T can be compared, i.e. if operator==, >, >=, <, <=, !=(T&, T&) exist. At that time, I could not build the documentation so the addition has never been reviewed. I have now a larger hard disk which allows me to have a virtual machine running linux (ubuntu). I would like to check if my documentation addition is OK, therefore could you tell me how I can compile .qbk files? Then, I would like to submit the addition for a review and future inclusion in a boost release; what is the procedure? Regards, Frédéric

2 5

[proto]: rewriting POOMA and Blitz++
by Chandrashekhar Kumar 10 Aug '09

10 Aug '09

Hello, At some time Eric expressed that all the expression template based libraries of boost (notably Phoenix, Spirit) has to be re-written using proto. I think that this target is kind of achieved by now. Can something be done along the similar lines for re-writing the top-notch libraries like POOMA and Blitz++ as a complete examples of proto applications? Does anyone has idea about how huge this undertaking can be? Thanks, Chandra

4 7

"I want everything" should build "out of the box" (on Windows)
by KTC 09 Aug '09

09 Aug '09

Users on Microsoft Windows should be able to build boost with everything, both in terms of all supported variants and all boost libraries, with a single command to bjam assuming they have all the optional supporting libraries available. An user download boost, and want to build all the libraries that require building go read the Getting Started Guide <.../getting_started/windows.html#invoke-bjam> and see the after getting bjam they use the command bjam --build-dir=build-directory toolset=toolset-name --build-type=complete stage So they enter that into the command prompt and see lots of warnings and notes about missing optional components. The warnings and notes itself is fine and informative. Actually, it's incomplete as it stand as it doesn't tell the user about Boost.IOStreams optional component requirement of bzip2 & zlib headers. Okay, the user go and install all the optional components the warnings and notes tell them. After installing Python, ICU (building it first), Expat (building it first), and MPI (say MS-MPI), they try again. This time with the command becoming bjam --toolset=... --build-dir=... --build-type=complete -sHAVE_ICU=1 -sICU_PATH="..." -sEXPAT_INCLUDE="..." -sEXPAT_LIBPATH="..." -sBZIP2_SOURCE="..." -sZLIB_SOURCE="..." stage Nope, MPI requires modification of user-config.jam or building it on its own with --with-mpi. Why? No other optional components build that way. So they look to see how they do that, and does it. Second attempt and ... nope. New to 1.39 is the errors error: link=shared together with runtime-link=static is not allowed error: such property combination is either impossible error: or too dangerious to be of any use due to the changes made as a result of <http://lists.boost.org/Archives/boost/2009/04/150675.php>. (Recently noted on <http://groups.google.com/group/boost-list/browse_thread/thread/2a7bd07468b5…>.) While catching those errors is good, maybe it should be fixed as well such that it doesn't come up in the first place if someone do a --build-type=complete with ICU. So now the users have to build Boost.Regex separately from the rest of the library (after finding how to pass the link= & runtime-link= options). By the way, at this point I would like to point out how it's strange that -sHAVE_ICU=1 mean to build with ICU, but so is -sHAVE_ICU=0 .... :S And ... nope, even separately Boost.Regex still wouldn't build without errors. No one told them they need to rename icuin.lib, icuind.lib, icuind.pdb & icudt.lib from ICU to icui18n.lib, icui18nd.lib, icui18nd.pdb & icudata.lib respectively. With Boost.Regex built, we turn to the rest of the library with --without-regex. After waiting a while, we discover ... nope, Most of the library is built but not Boost.Graph. Sorry, this time no one told them they need to change Boost.Graph's Jamfile.v2 file with "<find-shared-library>expat" to "<find-shared-library>libexpatwMT" and adding "<define>XML_STATIC". Boost is great, it's free, it's flexible and I understand it's developed for free by volunteers, but its "installation" for someone that want every libraries could be improved. :-) Regards, KTC -- Only two things are infinite, the Universe and Stupidity. And I'm not quite sure about the former. - Albert Einstein

15 56

[Interprocess::Semaphore] Deadlock on more producers - one consumer problem
by Cosimo Calabrese 09 Aug '09

09 Aug '09

Hi to all, I've a buffer of 10 positions; 4 producers put elements on the buffer and only 1 consumer pick them; the producers generate elements very fastly, but the consumer picks the element very slowly. I've decided to synchronize the producers and the consumer with a boost::interprocess semaphore initialized to 10. Before to put an element in the buffer, the producer execute a wait() in the semaphore; the 4 producers put quickly 10 elements in the buffer, so they all block on the wait(). When the consumer picks an element from the buffer, it performs a post() on the semaphore. Here is the problem: the post() unlocks only one of the 4 producers. Consider this scenario: - the producers are all in wait state; the semaphore counter is 0; - the consumer picks an element and perform a post(), that unlocked the producer_1; the semaphore counter is 1; - the producer_1 is unlocked but it doesn't produce any element; the other producers are locked; - the consumer picks the other 9 elements in the buffer and perform the 9 post() on the semaphore, but the semaphore counter becomes 2, 3, 4, ... 10, and so the semaphore doesn't signal the other producers, that remains in lock state(). --> DEADLOCK. Is there a way to unlock all the producers with the boost::interprocess::semaphore? Or I have mistaken the approach of the problem? Thanks to all, Cosimo Calabrese.

5 27

backward binary compatibility of boost shared libraries
by Андрей Пономаренко 08 Aug '09

08 Aug '09

Hello, I'm from Institute for System Programming of Russian Academy of Sciences and we are developing a free lightweight tool for checking backward/forward binary compatibility of shared C/C++ libraries in OS Linux. It checks interface signatures and data type definitions in two library versions (headers and shared objects) and searches ABI changes that may lead to incompatibility. We have released 1.2 version of this tool and we'd like you to consider its usefulness for your project. The wiki-page with the latest release of binary compatibility checker is http://ispras.linux-foundation.org/index.php/ABI_compliance_checker Andrey Ponomarenko

1 0

boost 1.40.0 release date?
by Zoran Cvetkov 08 Aug '09

08 Aug '09

I would like to know when is scheduled release date for version 1.40 of boos library? Some critical fixes are in there and I'd like to know when we should expect it? Browsing the web site didn't help me, did I missed something? Thanks in advance!

2 1

[1.40] timeline?
by John Maddock 07 Aug '09

07 Aug '09

Do we have a revised timeline for 1.40 yet? I'm asking because the regex lib is ready for a substantial update (provided trunk tests cycle OK obviously!). Thanks, John.

6 13

[BGL] How to stopping prematurely a graph exploration
by Cosimo Calabrese 07 Aug '09

07 Aug '09

Hi to all, I'm searching for a good method to stopping prematurely a graph exploration, e.g. when I've just founded and explored a particular vertex. I think I've to create a visitor to which passing the particular vertex, but I don't know how to configure it. A very brutal method is to wrap the exploration function in a try-catch block, and then throw an exception in the examine_vertex funtion. I want to believe that there's a more elegant method than this... Best regards, Cosimo Calabrese.

4 6

[config] symbols export from shared library (#2114)
by Alexander Arhipenko 07 Aug '09

07 Aug '09

Guys, I've decided to start a new thread on this topic. The messages beyond was taken from the last ticket comments. >--------------------------------------------------------------------- >*** Changed 19 hours ago by johnmaddock *** >--------------------------------------------------------------------- > >Is this nearly ready to go in Trunk now? > >Before it does at the very least we need: > >1) An update for http://www.boost.org/development/separate_compilation.html >2) An update for the Boost.Config docs for each of these new macros. >3) A clear understanding of what BOOST_SYMBOL_FORWARD_EXPORT/IMPORT do. >4) A clear understanding of what needs re-exporting - >IMO BOOST_EXCEPTION_EXPORT is somewhat misleading since as I understand the gcc docs >this may need to be applied to any class that has "vague linkage" whatever that is. >Also do we need to re-export std lib exceptions from our SO's? >Do we have a dependency analysis to know when we need to use these (or that we don't need to)? > >John. > >----------------------------------------------------------------- >*** Changed 3 hours ago by arhipjan@… *** >----------------------------------------------------------------- > >Replying to johnmaddock: > >JFYI, stdcxx library (at least of version 4.1.1 and later) >already have default visibility for std::exception, std::bad_exception, i.e: > >//exception header > >#pragma GCC visibility push(default) > >namespace std { > > class exception {/*...*/}; > class bad_exception {/*...*/}; > >//... > >Also logic_error, runtime_error don't cause abnormal program termination >since they have key functions >(i.e. at least one non-inline virtual function). >--------------------------------------------------------------------- >*** Changed 26 minutes ago by anonymous *** >--------------------------------------------------------------------- > >I forgot one other requirement: we should maybe try and put together a small test case to check that this all works. > >Good to hear that libstdc++ already does the necessary work, does this mean that exceptions that inherit from std::runtime_error (as I think all Boost >exceptions do?) are automatically visable and don't need re-exporting on account of their virtual functions? > >Oops, one other thing (sorry!), how if at all is Boost.Exception effected by this - especially as it's header only? > >Cheers, John. I would like to make some comments: 1) BOOST_EXCEPTION_EXPORT macro In current patch version there is no need for this macro, since all the symbols marked with BOOST_SYMBOL_EXPORT always have default visibility on gcc. (In the original version, they have default visibility when building shared library and hidden visibility when using it in another shared library). 2) >>>>Also do we need to re-export std lib exceptions from our SO's? >>JFYI, stdcxx library (at least of version 4.1.1 and later) >>already have default visibility for std::exception, std::bad_exception >>[snip] >>Also logic_error, runtime_error don't cause abnormal program termination >>since they have key functions >>(i.e. at least one non-inline virtual function). >Good to hear that libstdc++ already does the necessary work, >does this mean that exceptions that inherit from std::runtime_error (as I think all Boost exceptions do?) >are automatically visable and don't need re-exporting on account of their virtual functions? The exceptions that inherit std::exception (or std::runtime_error) are not visible. But throwing such exception from shared library and catching it in another exe or lib doesn't cause abnormal termination (but only if thrown exception have at least one key function)

1 0

Re: [boost] Using channel with boost 1.39.0
by Yigong Liu 07 Aug '09

07 Aug '09

Hello Joaquim, Thanks for your help. I'll soon fix these issues with a new update to vault. Best Regards. Yigong > > However in some samples has appeared warnning about deprecated casts > to transfrom from std::string to char*. I attach to this e-mail the > output of compilation of samples to fix the warnings. > > Thanks and Best Regards, > Joaquim Duran > >

1 0

Boost.Plot? - Scalable Vector Graphics
by Paul A. Bristow 07 Aug '09

07 Aug '09

Jake Voytko started this library during a 2007 GSoC and I have now expanded it quite a bit, and begun to use it for my own purposes (including preparing the plot for the Boost.Math library functions and statistical distributions). Before I do any more work on it, I'd appreciate feedback from Boosters on how useful they think it might be, perhaps as a Boost library? Although it still has plenty of wrinklies (the calculation of positioning of titles, legends, axes labels and ticks labels is intricate - to say the least). And there are not-a-few nasty warts (this may be the 1st version to throw away?), so it is in no way review-ready. But I believe it is working well enough for you to try to use it - and to give me feedback. There are of course hundreds of programs for plotting. What is special about *this* library is that it is in C++ and it has a Boost license. It allows you to add just a few lines of code to the end of your C++ program to take data from any STL container (all or part) and produce a plot as a Scale Vector Graph (.svg) file. (No need to export data to a file and suck into Excel ;-) Applause!) .svg files can be displayed by all good Internet Browsers (and even by IE8 with an Adobe add-in). They are very small but high quality, highly zip compressible, and equally suitable for printing to viewing on mobiles (only the features of Tiny SVG are used.). It takes as little code as svg_2d_plot my_plot; my_plot .plot(map1, "Series 1").stroke_color(blue) .plot(map2, "Series 2").stroke_color(red") .autoscale(map1); my_plot.write("./2d_simple.svg"); but you can have hours of fun trying out hundreds of options to produce some rather fancy plots. For your amusement, attached are a few (mostly contrived) examples (with tasteless garish colors just to highlight the possible options). There are also lots and lots of other examples. (Note that the 20 plots occupy a mere 30 kb when zipped). Unusually, there is lots (too much? - 6Mbyte hyperlinked and indexed PDF!) of documentation, produced using the C++ in QuickBook with Doxygen reference info and John Maddock's auto-indexing. But there are hundreds of options, so you will need all the help you can get from tutorials, examples and indexes. A novel feature is the built-in handling of an 'uncertain' type (based on Evan Marshal Manning, C/C++ Users Journal, March 1996 page 29 to 38) including a double 'most likely' value, an 'uncertainty' estimate, roughly standard deviation, and an estimate of 'degrees of freedom'. This can be used to display confidence ellipses and label values "1.23 +-0.01 (21)", for example. (Of course, you can make much better confidence estimates using the Boost.Math library). You can view and can get code from the Boost sandbox https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization Docs are available to build as html and pre-built as pdf (patience - 6 Mbyte!) https://svn.boost.org/svn/boost/sandbox/SOC/2007/visualization/libs/svg_plot /doc/pdf/svg_plot.pdf or http://tinyurl.com/coqlbg (or ask if you want zips instead). Paul PS Thanks to all those who have offered support, especially John Maddock of course. It has stress-tested the Quickbook - Doxygen indexing system ;-) I haven't managed to make the index work perfectly yet and I'm sure it can be improved. PPS If I were doing this again, I would not use 'derived' trick to permit re-use of functions by 1D, 2D and boxplots - it causes the Intellisense of MS VisualStudio IDE 'Intelligence Circuits' to melt (and sometimes crash - workaround - delete the .ncb file) making the nice 'goto definition' feature ineffective and makes debugging difficult (as does the use of set and get functions). I suspect it makes compile times longer too. There must be a better way - suggestions welcome. But I *would* use the chaining feature - I think it makes a very nice syntax for the user - but tell me what you think. --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

14 36

[Boost.Thread][Boost1.39]:boost::thread& is not accessible from boost::move
by Karun Gahlawat 07 Aug '09

07 Aug '09

Running CC 5.10 to build Boost.Thread using the following command: Referred to this list by boost-build Trying to build Boost.Thread using Sun CC 5.10 on opensolaris. This one looks like a generic error. "CC" +d -library=stlport4 -g -mt -m64 -KPIC -DBOOST_ALL_NO_LIB=1 -DBOOST_THREAD_BUILD_DLL=1 -DBOOST_THREAD_POSIX -I"." -c -o "/tmp/boost/boost/bin.v2/libs/thread/build/sun/debug/a ddress-model-64/stdlib-sun-stlport/threading-multi/pthread/thread.o" "libs/thread/src/pthread/thread.cpp" Getting this error: "./boost/thread/detail/thread.hpp", line 344: Error: boost::thread::thread(boost::thread&) is not accessible from boost::move(boost::detail::thread_move_t<boost::thread>). 1 Error(s) detected. -- Karun -

2 2

[function_types] documentation issues
by Sam Partington 06 Aug '09

06 Aug '09

Hi all, I am writing a library that aims to make using dynamic libraries easier across platforms. The aim is the following : dynamic::library lib("sharedlib.so"); dynamic::function<int (int, int> fn(lib, "fn"); int result = fn(1, 2); So to achieve this I needed to implement forwarding functions and I used function_types to make this easier. This all worked fairly well, but in general I really struggled with figuring out how to use function_types. Though simple uses were fairly straight forward, as soon as I came across a STDCALL function it all fell over and I got compiler errors "'value' : is not a member of 'boost::function_types::function_arity<T>". I have managed to fix it, but the route there was far from obvious, and I would put that entirely down to incomplete and misleading documentation. Eventually, I found the Reference->Macros section which discussed calling conventions : BOOST_FT_CC_* Enables a specific calling convention. * dentoes the macro suffix, as defined by BOOST_FT_CC_NAMES or BOOST_FT_BUILTIN_CC_NAMES. The macro expands to a list of restrictions, separated by the | character. Possible items are: callable_builtin member non_member variadic non_variadic If no such macro is defined for a particular calling convention, it is disabled. Example: #define BOOST_FT_CC_STDCALL non_variadic|callable_builtin // enables stdcall calling convention for all non-variadic, // callable, builtin types Ahah! It looked like I needed to #define BOOST_FT_CC_STDCALL non_variadic|callable_builtin, as per the example there. However this caused monstrous compile errors from the guts of function_types initially stating that "'...' requires cdecl". Further reading pointed me to this : BOOST_FT_COMMON_X86_CCs Defining this macro causes the following macros to be defined, if not defined already: #define BOOST_FT_CC_CDECL BOOST_FT_COMMON_X86_CCs #define BOOST_FT_CC_STDCALL non_variadic|BOOST_FT_COMMON_X86_CCs #define BOOST_FT_CC_FASTCALL non_variadic|BOOST_FT_COMMON_X86_CCs So I added the following : #define BOOST_FT_COMMON_X86_CCs But this also failed with more bizarre errors, eventually I experimented with : #define BOOST_FT_COMMON_X86_CCs 1 Which finally worked. But the docs do not indicate that you need to define it with any particular value. The whole problem would have been so much simpler if there was one of more of the following sections in the documentation : "Getting Started", "Calling Conventions", "Common Pitfalls", or an FAQ. Sam

1 0

[program_options] Can this library write config file?
by Guanqiang Liu 06 Aug '09

06 Aug '09

the boost::program_options can read options from config file. But, can this library write opions into config file?

3 2

[BGL] To customize the graph traversing
by Cosimo Calabrese 06 Aug '09

06 Aug '09

Hi to all, I'm studying the BGL, and I've a question. I've noticed that: - the traversing algorithms, like breadth first search, only decide how to traverse the graph, but do not perform specific calculations; - if I want to perform any calculation during the traverse, I can do it passing a custom visitor to the algorithm. But the question is: how can I customize the traverse method? The algorithms always explore enterely the graph. EXAMPLE: every edge (u, v) of a graph have a property "edge_can_traverse_t" that says on which of adjacent edges starting from v I can continue the traverse. _C _F o| /| o / o / A---->B---->D o o o >G \ \ \ \ _\| _\| E H ----------------------------------------- | edge | property edge_can_traverse_t | | | (vector<edge>) | ----------------------------------------- | (A,B) | (B,D) , (B,E) | | (B,C) | empty | | (B,D) | (D,F) , (D,H) | | (B,E) | empty | | (D,F) | empty | | (D,G) | empty | | (D,H) | empty | ----------------------------------------- For example, if I come from the (A,B) edge, I want that the algorithm consider only the (B,D) and (B,E) edge, and skip the (B,C) edge. The solution I found is to modify the breadth_first_search algorithm, adding a predicate to the visitor and performing a control when the algorithm examines the outer edges of the current vertex. Something like this: //============================================================================== // PREDICATE (in the visitor) //============================================================================== template <class IncidenceGraph, class PredecessorMap> bool can_traverse_edge( edge_descriptor e, IncidenceGraph &g, PredecessorMap p ) { typedef graph_traits<IncidenceGraph>::vertex_descriptor VertexDescriptor; VertexDescriptor u = source( e, g ); // select the source of the edge EdgeDescriptor eFrom = edge( p(u), u ); // select the previous visited edge if ( e is contained in the edge_can_traverse_t property of eFrom ) return true; else return false; } //------------------------------------------------------------------------------ //============================================================================== // breadth_first_visit //============================================================================== template <class IncidenceGraph, class Buffer, class BFSVisitor, class ColorMap> void customized_breadth_first_visit (const IncidenceGraph& g, typename graph_traits<IncidenceGraph>::vertex_descriptor s, Buffer& Q, BFSVisitor vis, ColorMap color) { [.....] put(color, s, Color::gray()); vis.discover_vertex(s, g); Q.push(s); while (! Q.empty()) { Vertex u = Q.top(); Q.pop(); vis.examine_vertex(u, g); for (tie(ei, ei_end) = out_edges(u, g); ei != ei_end; ++ei) { if ( !vis.can_traverse_edge( *ei ) ) continue; [.....] } //------------------------------------------------------------------------------ Does it exist a better mechanism to control the traverse with the BGL? Or I must implement my solution? Best Regards, Cosimo Calabrese.

3 13

Re: [boost] Using channel with boost 1.39.0
by Yigong Liu 06 Aug '09

06 Aug '09

Hello, this early morning i uploaded a new version of "Channel" to Vault ( http://www.boostpro.com/vault/index.php?&direction=0&order=&directory=Distr…) which is updated to build with latest boost distribution (1.39) and the following compilers: ubuntu8.04/g++4.2.4, ubuntu9.04/g++4.3.3, windows(VC++2005, VC++2008). I haven't yet got chance to install fedora11 to try out. Joaquim, could you please help give the new version a try? Channel is a distributed message passing framework built on top of boost. ( http://channel.sourceforge.net) Regards Yigong I'm trying to run the channel examples compiled with boost trunk > version with the last released channel version 0.07.1. In gui_event > and in ping-pong examples, there are errors at compilation (I've not > tested more examples). I'm using gcc 4.4.0 from Fedora 11. Which is > the exepected version of boost to test the channel ? > > Joaquim >

1 0

Partial Sort and Partition with Ranges [was: Boostcon Keynote available]
by Scott McMurray 05 Aug '09

05 Aug '09

2009/8/3 Marshall Clow <mclow.lists(a)gmail.com>: > at http://boostcon.blip.tv > > Thank you, everyone, for your patience. > More videos from Boostcon will be going up there in the near future. > Thanks, Marshall, I'd been looking forward to that. I see that the talk presents a two-range form of partialSort, which I don't see in D's standard library[1]. Does anyone know the history there? On a related note, how would I, using ranges, sort only the first half of a partition? It appears I can only get a range for the second half[2]. In code, I'm looking for the equivalent of sort(b, partition(b, e, pred)); [1] http://www.digitalmars.com/d/2.0/phobos/std_algorithm.html#partialSort [2] http://www.digitalmars.com/d/2.0/phobos/std_algorithm.html#partition

2 4

[1.40.0] Beta planned for this weekend
by Beman Dawes 05 Aug '09

05 Aug '09

I'm planning to put together the 1.40.0 beta this weekend. Please ask permission before updating branches/release. Thanks, --Beman

1 0

Important: Boost server downtime on August 5, 2009
by Doug Gregor 05 Aug '09

05 Aug '09

The Boost mailing lists, web server, and Subversion server will be offline tomorrow (Wednesday, August 5th) from 8:00AM EDT to 9:00AM EDT while we upgrade the mailman software. My apologies for the late notice. - Doug

2 1

Boostcon Keynote (finally!) available.
by Marshall Clow 05 Aug '09

05 Aug '09

at http://boostcon.blip.tv Thank you, everyone, for your patience. More videos from Boostcon will be going up there in the near future. -- Marshall

4 3

Interest in a "Heterogenous Container" system?
by Christian Schladetsch 04 Aug '09

04 Aug '09

Hello, After a discussion on a different thread, I came up with an implementation allowing containers to store and retrieve heterogenous instances, and provide correct deep cloning of those containers. A working motivational example is here http://tinyurl.com/larqyy. I have yet to do a comparison with container<boost::any>. This is just an initial proof-of-concept, and there remains a lot of work to do if it were to be a complete proposal. Before I did that work (especially since I have another proposal in the wings), I wanted to ask if there would be any interest in a completed system? The system is based on a modified ptr_container branch (also in the sandbox - I've contacted Thorsten about this), and and allocator adaptor system to deal with cloning. It allows one to place object pointers into a container using syntax such as: /// a vector of heterogenous objects template <class Alloc = std::allocator<char>, class Base = common_base > struct vector; heterogenous::vector<> v; v.push_back<T0>(); // add a default-constructed object of type T0 v.push_back<T1>(a0,a1,...,an); // add an object of type T1, passig a0..an as ctor arguments T1 &obj = v.ref_at<T1>(1); // get a reference of type T1& to the object at index 1 or throw bad_cast heterogenous::vector<> v2 = v; // copy the container; concrete types are preserved assert(v2.is_type_at<T1>(1)); There are many outstanding issues; it may not fly in the end, it may not work for all container types and semantics, but I would like some early opinion on whether it is even worth my pursuing further. One initial issue that may break any interest is that instances put into the container must be of a type T that derives from heterogenous::base<T>. Regards, Christian.

11 29

Pre-compiled headers, Boost.Thread, and boost/date_time/date_facet.hpp
by Patrick Hartling 04 Aug '09

04 Aug '09

I am using Boost 1.39.0 with Visual C++ 9.0 SP1, and I am having problems with pre-compiled headers that include boost/date_time/date_facet.hpp. I have code organized into several DLLs, and one of the lowest level DLLs in that set has a header file that, as of yesterday, includes headers from Boost.Thread. The highest level DLL provides Python bindings made using Boost.Python for all of the other DLLs. We use pre-compiled headers to get a dramatic speed up of the build of the code that uses Boost.Python, and that was working like a charm until Boost.Thread headers came into the mix. Now, I get this linker error for every object file in the Python bindings DLL: error LNK2001: unresolved external symbol "public: static class std::locale::id boost::date_time::date_facet<class boost::gregorian::date,char,class std::ostreambuf_iterator<char,struct std::char_traits<char> > >::id" (?id@?$date_facet@Vdate@gregorian@boost@@DV?$ostreambuf_iterator@DU?$char_traits@D@std@@@std@@@date_time@boost@@2V0locale@std@@A) The only way that I have found to work around this is to keep anything that might include boost/date_time/date_facet.hpp out of the headers that get pre-compiled. At the moment, that is every Boost.Thread header I am using: boost/thread/{thread,mutex,condition_variable}.hpp. It appears that most of the key Boost.Thread headers end up including boost/thread/xtime.hpp, and that header indirectly includes boost/date_time/date_facet.hpp. Is there any way to work around this? I am not entirely sure what the problem is, but my guess is that it has something to do with an aspect of DLL symbol exporting and the way that the static data member boost::date_time::date_facet<...>::id is defined. I think I ran into something like this once (unrelated to Boost) a couple of years ago, but I am still trying to track down that code. -Patrick -- Patrick L. Hartling Senior Software Engineer, Priority 5 http://www.priority5.com/

1 0

[Range] Boost and N2930?
by Beman Dawes 04 Aug '09

04 Aug '09

N2930, Range-Based For Loop Wording (Without Concepts), provides begin() and end() non-member function templates for standard library types. It also provides general range access non-member templates: // 24.7 range access [iterator.range] template<typename C> auto begin(C& c) -> decltype(c.begin()); template<typename C> auto begin(const C& c) -> decltype(c.begin()); template<typename C> auto end(C& c) -> decltype(c.end()); template<typename C> auto end(const C& c) -> decltype(c.end()); template<typename T, size_t N> T* begin(T (&array)[N]); template<typename T, size_t N> T* end(T (&array)[N]); (Until the official WG21 site gets updated, you can see a copy of n2930 at http://mysite.verizon.net/beman/n2930.html) Should Boost.Range and/or RangeEx be modified and/or extended in light of N2930? Can Boost.Range, RangeEx, or some other Boost component help developers and users who want to take advantage of N2930 in C++03 now, and do so in a way that transitions smoothly to C++0x as language and library available? --Beman

3 2

[function] should it require rtti?
by Emil Dotchevski 03 Aug '09

03 Aug '09

Line 223 in function_base.hpp uses typeid. Can this be avoided? If not, perhaps it can be refactored to use the workaround found in sp_typeinfo.hpp? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

5 5

Re: [boost] [xpressive] Performance Tuning?
by raindog＠macrohmasheen.com 03 Aug '09

03 Aug '09

I would be very interested in seeing this too as your numbers look extremely good ------Original Message------ From: OvermindDL1 Sender: boost-bounces(a)lists.boost.org To: boost(a)lists.boost.org ReplyTo: boost(a)lists.boost.org Sent: Jul 17, 2009 3:30 PM Subject: Re: [boost] [xpressive] Performance Tuning? On Wed, Jul 15, 2009 at 6:57 AM, OvermindDL1<overminddl1(a)gmail.com> wrote: > /* snip */ So has anyone tried the code I posted to see how it compared? _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost Sent from my Verizon Wireless BlackBerry

27 154

Timing.
by Edward Grace 03 Aug '09

03 Aug '09

Hello All, Rather than replying to previous messages I felt it would be better to start a new and more appropriately titled thread. In the ongoing quest to try and develop a timing system for in-code use and (now) benchmarking as an example application the original code of Joel de Guzman has been extensively modified and uploaded here: http://tinyurl.com/nmhthy The code uses two techniques for calculating the percentage speedup. It is quite likely that the error estimate for the actual run times is very wrong. I strongly suspect that the random error is over- estimated but the systematic error is under-estimated. Note that changing the machine loading can affect the absolute times noticeably. Burst-like behaviour will not matter too much, but sustained loading will. Consequently if you wish to directly compare the ns/char (nanoseconds per character) values between runs or machines care should be taken to make sure the background load is consistent. When looking at the relative times on a given run - particularly with the Wilcoxon test, this is far less important. I look forward to results anyone gets on other machines. Particularly with respect to robustness of the results against background processes, repeatability and or inter-compiler variations. Cheers, -ed $ echo 1000 15 | ./ejg_uint Enter buffer size: Enter nominal precision (%): initializing input strings... Nominal precision of quantum: 15% Timer overhead (t_c) (ticks): 108.321 Jitter (ticks): 8.24459 Approx clock frequency (GHz): 2.1681 Direct point estimates of actual run time. Function T - delta T (best) T + delta (ns/char) (ns/char) (ns/char) qi_parse 47 67 87 strtol 74 1.1e+02 1.4e+02 atoi 79 1.1e+02 1.5e+02 Speedup percentages based on Wilcoxon matched pair confidence intervals. Func. A vs Func. B Minimum Median Maximum (% faster) (% faster) (% faster) qi_parse atoi 69 69.2 69.3 qi_parse strtol 57.8 57.9 58 strtol atoi 7.14 7.16 7.2 qi_parse qi_parse -0.0762 0.00468 0.0343 Speedup percentages based on the point estimates. Func. A vs Func. B Best - err Best Best + err (% faster) (% faster) (% faster) qi_parse atoi 63.1 69.1 75.1 qi_parse strtol 51.8 57.8 63.8 strtol atoi 1.16 7.16 13.2 qi_parse qi_parse -6 0.00222 6 All done! ------------------------------------------------ "No more boom and bust." -- Dr. J. G. Brown, 1997

1 0

Details on boost::serialization
by Per Nordlöw 03 Aug '09

03 Aug '09

I haven't found any documentation on the header bits of the archive formats supported by boost::serialization. These are added as default when I construct binary and text formats. I am especially interested in skipping these headers completely in my application, that is serializing a char should only result in one byte outputted to stream. Does the headers basic_binary_[io]archive.hpp play any roles in this case? I have tried to use them instead by I got some strange error messages so these are commented out here. Thanks in advance, Nordlöw Compileable sample code follows: #include <fstream> // #include <boost/archive/basic_text_iarchive.hpp> // #include <boost/archive/basic_text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/binary_oarchive.hpp> class gps_position { public: gps_position() {}; gps_position(int d, size_t m, float s) : degrees(d), minutes(m), seconds(s) {} private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & degrees & minutes & seconds; } int degrees; size_t minutes; float seconds; }; template<class OA, class IA> static void test(const gps_position & pos, const char * filename) { std::ofstream ofs(filename); // create and open a character archive for output { OA oa(ofs); oa << pos; } gps_position newg; { std::ifstream ifs(filename); // create and open an archive for input IA ia(ifs); ia >> newg; } } int main() { const gps_position p(35, 59, 24.567f); // test<boost::archive::basic_text_oarchive, // boost::archive::basic_text_iarchive>(p, "boost_serialization_basic_text_archive"); test<boost::archive::text_oarchive, boost::archive::text_iarchive>(p, "boost_serialization_text_archive"); test<boost::archive::binary_oarchive, boost::archive::binary_iarchive>(p, "boost_serialization_binary_archive"); return 0; }

2 1

[phoenix2][asio] phoenix bind does not work with asio
by Carlos Rafael Giani 03 Aug '09

03 Aug '09

Hi, I am trying to replace all occurrences of boost.bind with phoenix bind, since boost.bind is unusable due to the placeholders not residing in a named namespace. However, asio always fails to compile when used with phoenix bind. The error message always goes like "boost/asio/detail/bind_handler.hpp:130: error: no matching function for call to ‘invoke(const boost::asio::detail::binder2<boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<4>, ....." I suspect this is because phoenix bind creates an actor, not a boost function object. This problem is present in boost trunk as well. Does anybody have an idea how to solve this?

3 3

Documentation policy about namespaces
by Lasse Kärkkäinen 03 Aug '09

03 Aug '09

I couldn't find any discussion about this, but I have noticed that the documentation often completely neglects to mention the namespaces used or just mentions somewhere which using namespace directives should be used instead of documenting the namespaces of individual symbols. To me it would seem best to use explicit namespace specification in all example code and reference documentation. However, in example code where this is unsuitable (e.g. boost::placeholders::_1), the required using declarations and directives should be documented along with which symbols they are used for. Adding the namespace information to the documentation increases clarity because it instantly tells the reader which symbols are part of the library and which are part of the example code. Additionally, a number of Boost libraries already use the same symbol names in their respective namespaces, so assuming a large collection of using namespace directives is a bad practice. Documenting the header files to use and the libraries to link is another similar issue, but the problem is not as severe as it is with namespaces.

2 1

Release branch regression testing failures
by Beman Dawes 03 Aug '09

03 Aug '09

Stale tests have been cleared, and there is a fresh release branch regression test report up at: http://beta.boost.org/development/tests/release/developer/summary.html Libraries reporting errors on more than one platform are: bimap - all platforms failing build - all non-Linux platforms failing math - all platforms failing numeric/interval - two platforms failing optional - two platforms failing python - Linux platforms failing spirit - all platforms failing type_traits - all platforms failing units - two platforms failing I'd appreciate it if the developers involved would clear these tests in the next few days. Thanks, --Beman

10 12

There's a serious problem with the Boost Community :(
by Jon Biggar 03 Aug '09

03 Aug '09

Even though this is a complaint, let me start off by stating that I'm a happy user of Boost libraries for over six years, and don't intend to stop. That said, here's the problem: simple patches submitted languish without action or response for far too long. I submitted a patch for bjam with ticket #2552 back in November, including test cases to verify that it operates correctly. But despite requesting over several release cycles since then, no action has been taken and I haven't even gotten a response. It's a pain in the butt to have to keep reintegrating the same patch, release after release so I can keep working on code that I hope to one day submit to for inclusion in a Boost release. The Boost Community *really* needs a mechanism to ensure that patches submitted are acknowledged, vetted, and if found worthy, integrated into a release in a timely manner. Not doing so discourages contribution. Let me suggest that the Community set up something like the review queue, where a few volunteers could regularly select the next patch, request comments from the community and then champion getting the patch integrated into the next Boost release. I understand that library owners have a stake in the design vision and integrity of their library's code, so the community will have to figure out a policy where patches with minimal impact on a library's integrity can be quickly integrated without requiring a lot of the primary library owner's or maintainer's time, but will still get integrated or rejected in a timely manner. -- Jon Biggar jon(a)floorboard.com jon(a)biggar.org jonbiggar(a)gmail.com

4 5

Help with SVN required
by Robert Ramey 02 Aug '09

02 Aug '09

I want to merge current state of the directories of the serialization library into the release branch. In order to do this, I consult the SVN documentation as well as the instructions at https://svn.boost.org/trac/boost/wiki/ImprovingPractices When I do the merge - I get a large number of conflicts. It looks like: a) lines deleted from the trunk are not deleted from the new (release) working copy. b) files deleted from the trunk are not deleted from the new (release) working copy. c) files which have been added to the trunk don't show up in my (release) working copy. According to the SVN documentation I should go through the dozens of files with conflicts one by one and examine them and resolve all the conflicts. What I really want is for the current state of the trunk to be "transfered" to the release branch. Any body know what i might be doing wrong? Robert Ramey

3 5

request: BOOST_NO_SFINAE_EXPR macro
by Mathias Gaunard 01 Aug '09

01 Aug '09

It would be very nice if Boost.Config provided the BOOST_NO_SFINAE_EXPR macro, that would be defined if the compiler does not support SFINAE applied to expressions. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2634.html GCC supports this feature since 4.4 both for C++03 and C++0x for example.

3 7

issues when compiling boost with visual c++ 8 and 9
by Sean Farrow 01 Aug '09

01 Aug '09

Hi: The following is the output I am currently getting with the current trunk when trying to compile with visual c++ 9, tried with visual c++ 8 and got a similar error: C:/Program Files/boost/tools/build/v2/tools\msvc.jam:1040: syntax error at keyword = C:/Program Files/boost/tools/build/v2/build\toolset.jam:38: in toolset.using rule msvc.init unknown in module toolset. C:/Program Files/boost/tools/build/v2\build-system.jam:465: in process-explicit-toolset-requests C:/Program Files/boost/tools/build/v2\build-system.jam:545: in load C:\Program Files\boost\tools\build\v2/kernel\modules.jam:283: in import C:\Program Files\boost\tools\build\v2\kernel\bootstrap.jam:138: in boost-build C:\Program Files\boost\boost-build.jam:17: in module scope Hope this helps. Sean.

3 3