- Boost - lists.preview.boost.org

[mpl] is_lambda_expression bug?
by James Hirschorn 12 Feb '13

12 Feb '13

The compile-time assertion fails in the following program. I have tried with more than one version of boost including 1.53. Is it a bug? Shall I report it? -------------------------------------------------- #include <boost/mpl/assert.hpp> #include <boost/mpl/lambda.hpp> #include <boost/mpl/plus.hpp> namespace mpl = boost::mpl; struct MetafunctionClass { template<typename T1, typename T2> struct apply { typedef typename mpl::plus<T1,T2>::type type; }; }; BOOST_MPL_ASSERT((mpl::is_lambda_expression<MetafunctionClass>)); int main(int argc, char * argv[]) { } --------------------------------------------------

4 12

[test] missing include files
by Vicente J. Botet Escriba 12 Feb '13

12 Feb '13

Hi, I have needed to apply this patch to be able to compile with Boost.Test. Could I commit it? Best, Vicente svn diff boost/test Index: boost/test/tools/detail/print_helper.hpp =================================================================== --- boost/test/tools/detail/print_helper.hpp (revision 82823) +++ boost/test/tools/detail/print_helper.hpp (working copy) @@ -25,6 +25,7 @@ #include <boost/type_traits/is_array.hpp> #include <boost/type_traits/is_function.hpp> #include <boost/type_traits/is_abstract.hpp> +#include <limits> #include <boost/test/detail/suppress_warnings.hpp> Index: boost/test/utils/is_forward_iterable.hpp =================================================================== --- boost/test/utils/is_forward_iterable.hpp (revision 82823) +++ boost/test/utils/is_forward_iterable.hpp (working copy) @@ -33,6 +33,7 @@ // STL #include <utility> +#include <type_traits> #endif //____________________________________________________________________________//

2 2

[odeint] Docs don't build in 1.53.0
by John Maddock 12 Feb '13

12 Feb '13

I've finally got around to building the PDF docs for 1.53, and the the docs for Odeint don't build in 1.53: xslt-xsltproc.windows ..\..\..\..\bin.v2\libs\numeric\odeint\doc\msvc-10.0\debug \auto-index-internal-on\auto-index-verbose-on\auto-index-on\threading-multi\refe rence-xml.doxygen file:///D:/data/boost/branches/1.53.0/bin.v2/libs/numeric/odeint/doc/msvc-10.0/d ebug/auto-index-internal-on/auto-index-verbose-on/auto-index-on/threading-multi/ reference-xml/index.xml:1327: parser error : Opening and ending tag mismatch: co mpound line 334 and doxygenindex </doxygenindex> ^ file:///D:/data/boost/branches/1.53.0/bin.v2/libs/numeric/odeint/doc/msvc-10.0/debug/auto-index-internal-on/auto-index-verbose-on/auto-index-on/threading-multi/reference-xml/index.xml:1328: parser error : Premature end of data in tag compound line 333 ^ file:///D:/data/boost/branches/1.53.0/bin.v2/libs/numeric/odeint/doc/msvc-10.0/debug/auto-index-internal-on/auto-index-verbose-on/auto-index-on/threading-multi/reference-xml/index.xml:1328: parser error : Premature end of data in tag compound line 266 Any ideas? Thanks, John.

3 2

[1.53] PDF doc build
by John Maddock 12 Feb '13

12 Feb '13

There's a preliminary build of the PDF docs for 1.53 here: https://sourceforge.net/projects/boost/files/boost-docs/1.53.0/ Currently missing Odeint, but should otherwise be complete and OK. Regards, John.

1 0

[interprocess] Platform-specific flags for mapped_region
by Andrey Semashev 12 Feb '13

12 Feb '13

Hi, I wanted to try using Linux huge pages in my application, which uses Boost.Interprocess currently for interprocess communication. However there seems to be no way to pass MAP_HUGETLB flag to mmap in the interface of mapped_region. I understand that this is a platform-specific option, so probably it would be best to just add an opaque unsigned int flags parameter to the mapped_region constructor with the default value of 0. Or is there a better way of doing this? I'll create a ticket for this feature, but I wanted to know if the general idea of this extension is welcome.

2 3

[Boost.Range] An issue with the documentation of 'remove_erase_if' algorithm
by Adam Romanek 12 Feb '13

12 Feb '13

Hi, I think there's an issue with the documentation of 'remove_erase_if' algorithm from Boost.Range library. It says: "remove_erase_if removes the elements x that satisfy pred(x) from the container. This is in contrast to the erase algorithm which merely rearranges elements." I believe it's not in contrast to the "erase" algorithm but rather the "remove" algorithm. WBR, Adam Romanek

5 8

Future of Boost Windows Installers
by Dave Abrahams 11 Feb '13

11 Feb '13

Hi, As many of you already know, I'm going to work at Apple in late February, and BoostPro is closing its doors. For many years, the Boost Getting Started Guide has suggested that Windows users pop over to BoostPro's website and use the latest installer to get Windows binaries. We'd like to donate to the community the technology used to build those installers. If anyone would like to pick up the job of creating them, we'd be happy to offer guidance. Right now I'm on a plane where an uplink to GitHub is creeping along at 4KB/s, so I've been pushing the stuff up in bits and pieces and the latest stuff isn't up there, but it's going to http://github.com/boostpro/installer and will be complete within 24 hours. Whatever happens with this installer code, someone is going to need to update the Getting Started Guide, either to point at the installer's new home, or to remove references to it. -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

3 7

Release branch now open for merging
by Marshall Clow 11 Feb '13

11 Feb '13

The release branch (https://svn.boost.org/svn/boost/branches/release) is open for merging all stable changes from trunk, including bug fixes and major upgrades to existing libraries. Breaking changes should be coordinated via the mailing list with the developers of the other libraries affected. New libraries may be added, but require permission of a release manager. In other words, merging *does not* require permission from a release manager, except for new libraries. Boost Calendar with the release schedule: http://www.boost.org/development/index.html Release schedule explanation: http://svn.boost.org/trac/boost/wiki/ReleaseSchedule Release practices for developers: http://svn.boost.org/trac/boost/wiki/ImprovingPractices -- The Release Managers, Beman Dawes Daniel James Eric Niebler Marshall Clow Rene Rivera Vladimir Prus

2 1

[iostreams] mapped_file_source fails for zero sized file
by Michael Marcin 11 Feb '13

11 Feb '13

While testing out iostreams memory mapped file source I ran into an issue where it throws when opening a zero sized file (testing on windows 7 vc11 x64). for example something like: namespace io = boost::iostreams; namespace fs = boost::filesystem; fs::path path("C:\\boost\\boost_1_53_0\\libs\\context\\src\\dummy.cpp"); io::stream<io::mapped_file_source> file( path ); Will throw: failed create mapping: The volume for a file has been externally altered so that the opened file is no longer valid. From: http://tinyurl.com/cx2b9ru "When you do not want the size of the file to change (for example, when mapping read-only files), call CreateFileMapping and specify zero for both dwMaximumSizeHigh and dwMaximumSizeLow. Doing this creates a file mapping object that is exactly the same size as the file. Otherwise, you must calculate or estimate the size of the finished file because file mapping objects are static in size; once created, their size cannot be increased or decreased. An attempt to map a file with a length of zero in this manner fails with an error code of ERROR_FILE_INVALID. Programs should test for files with a length of zero and reject such files." I don't see anything in the docs that would lead me to believe this should throw. Rather I would expect: std::istream_iterator<char>(file) == std::istream_iterator<char>()

1 0

Picking overload with the most specific concept
by Louis Dionne 11 Feb '13

11 Feb '13

Hi, I was playing around today and I achieved to do something I find quite cool. I would like to know whether the technique/general principle is of any interest. Basically, it allows to overload functions based on the modeling of a concept by a type without having to write complicated enable_ifs. It does come with some problems and it is not very general for the moment, but it's a first shot. Here we go: #include <duck.hpp> // the library where I implemented that #include <forward_list> #include <utility> #include <vector> // Generates some boilerplate required to enable concept overloading for // a function named `my_distance`. Ignore this for now. DUCK_ENABLE_CONCEPT_OVERLOADING( my_distance, my_distance(std::declval<Iterator>(), std::declval<Iterator>(), State()), typename Iterator ) struct random_access_version_picked { }; struct forward_version_picked { }; // The State template parameter will be used to carry information during // the resolution. tag::my_distance was defined by the above macro. template <typename Iterator, typename State = tag::my_distance> // This can be seen like an enable_if with some more functionality. typename duck::requires< // This overload is picked iff Iterator models RandomAccessIterator // and no other overload for a more specific concept exist. // Concepts are MPL metafunction classes, so there's no magic here. duck::model_of<duck::RandomAccessIterator, Iterator> // Could add more duck::model_of clauses here , duck::overload_resolution_state<State> // required for the mechanics , duck::template_parameters<Iterator> // ditto , random_access_version_picked>::type // return type my_distance(Iterator, Iterator, State = State()) { return random_access_version_picked(); } // Same thing for the ForwardIterator implementation. template <typename Iterator, typename State = tag::my_distance> typename duck::requires< duck::model_of<duck::ForwardIterator, Iterator> , duck::overload_resolution_state<State> , duck::template_parameters<Iterator> , forward_version_picked>::type my_distance(Iterator, Iterator, State = State()) { return forward_version_picked(); } int main() { std::forward_list<int> list; std::vector<int> vec; forward_version_picked forward = my_distance(begin(list), end(list)); random_access_version_picked random = my_distance(begin(vec),end(vec)); } This example works with Clang 3.3 and GCC 4.8. For those interested in seeing more, the full library is available at: http://github.com/ldionne/duck Look for the `next` branch. The file involved with the above mechanics is include/duck/requires.hpp. Also see the test in test/requires.cpp. Regards, Louis Dionne

1 0