- Boost - lists.boost.org

[gsoc] project ideas
by Andrew Sutton 26 Feb '12

26 Feb '12

Just a reminder: if you have project ideas for Google Summer of Code, please submit them, either to me or post them here https://svn.boost.org/trac/boost/wiki/SoC2012 (under "Projects"). I think that this, any project ideas are fair game. I'm not terribly concerned with completely finishing something over the course of a single summer or having a goal of getting something into the main Boost release. I'd like to foster long-term participation in the Boost community, and I'd like to see more ambition in the kinds of problems we want students to tackle. Proposals for XML, some aspects of a UI library (whatever that entails), user input library (mice, raw-mode key input, touch, and physical sensors?), networking and protocol standards, etc. should be fair game. We can always set reasonable summer-long expectations for more ambitious projects. Obviously, short-term projects are fine -- I'm linking to Feature Requests as a source of project proposals -- but I hope that won't be the only kind of project proposed. If you have ideas, please post them earlier rather than later.. Thanks, Andrew

1 0

Inconsistency between std::minmax and boost::minmax
by Marshall Clow 25 Feb '12

25 Feb '12

So, C++11 has been approved, and in the new standard library, there is: template <typename T> std::pair<const T&, const T&> minmax ( const T& a, const T& b ) but in Boost, we've got: template <typename T> tuple< T const&, T const& > minmax(T const& a, T const& b) { I can easily change boost minmax to return a pair instead of a 2-element tuple, but that's an interface change, and might break existing code. On the other hand, giving them the same interface will make it easier for people to move to C++11's library functions. Any opinions? ideas? -- Marshall P.S. boost::minmax_element, on the other hand, already returns a pair, not a two-element tuple. I'm pretty sure it doesn't satisfy the C++ complexity requirements, but that's easily fixed.

3 3

Fix docs for boost.fusion
by niXman 25 Feb '12

25 Feb '12

Hello list. Diff is attached. -- Regards, niXman

2 5

Boost 1.49.0 release notice
by Beman Dawes 24 Feb '12

24 Feb '12

Release 1.49.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library (Heap) and numerous enhancements and bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_49_0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.49.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

3 2

[1.49.0] Release candidate 2
by Beman Dawes 24 Feb '12

24 Feb '12

Another set of release candidate files is up at http://boost.cowic.de/rc/ Could someone please check that the doc files are now correct? Thanks, --Beman

4 4

[1.49] Release candidate PDF doc build available
by John Maddock 24 Feb '12

24 Feb '12

I've put a release candidate of the PDF documentation build for 1.49 here: https://sourceforge.net/projects/boost/files/boost-docs/1.49.0/ Let me know if there are any SNAFU's, Enjoy, John.

3 15

[integer] Bug in int_t<65>
by Vicente J. Botet Escriba 24 Feb '12

24 Feb '12

Hi, I was trying to instantiate a boost::int_t<65>::least and I didn't got an error. Unfortunately the size of the obtained type was 8. I think that there is an error in the meta-function class as there is a comparison without and with the sign bit in // ** template< int Bits > // bits (including sign) required struct int_t : public detail::exact_signed_base_helper<Bits> { typedef typename detail::int_least_helper < #ifdef BOOST_HAS_LONG_LONG (Bits-1 <= (int)(sizeof(boost::long_long_type) * CHAR_BIT)) + // ** #else 1 + #endif The same applies to uint_t. The fix of course consists in checking (Bits <= (int)(sizeof(boost::long_long_type) * CHAR_BIT)) + // ** Please could this be fixed in trunk? Best, Vicente

2 1

[spirit][qi] Fastest way to parse file
by Antony Polukhin 24 Feb '12

24 Feb '12

Hi, Boost.Spirit documentation advices to use multi_pass iterators for parsing files (or reading data to a STL container and then passing the begin and end of the container to Spirit.Qi). Much better solution would be to use a memory mapped file: boost::interprocess::file_mapping fm(filename.c_str(), boost::interprocess::read_only); boost::interprocess::mapped_region region(fm, boost::interprocess::read_only, 0, 0); const char* begin = reinterpret_cast<const char*>(region.get_address()); const char* const end = b + region.get_size(); Comparing to multi_pass iterator, mmap approach increased parsing speed more than 5 times, reduced memory usage and CPU load. Mmap approach is also a little bit faster than reading data to STL container and mmap sometimes requires less memory (depending on OS). I think, that such solution should be at least mentioned in Spirit documentation. May be mmap shall be wrapped in some class for tighter integration with Spirit and simpler usage: int main() { namespace spirit = boost::spirit; using spirit::ascii::space; using spirit::ascii::char_; using spirit::qi::double_; using spirit::qi::eol; spirit::file_parser first("multi_pass.txt"); // class that does mmap`ing std::vector<double> v; bool result = spirit::qi::phrase_parse(first , spirit::make_default_multi_pass(base_iterator_type()) , double_ >> *(',' >> double_) // recognize list of doubles , space | '#' >> *(char_ - eol) >> eol // comment skipper , v); // data read from file if (!result) { std::cout << "Failed parsing input file!" << std::endl; return -2; } std::cout << "Successfully parsed input file!" << std::endl; return 0; } Best regards, Antony Polukhin

3 4

Updated boost::base_from_member for C++2011
by Daryle Walker 22 Feb '12

22 Feb '12

This is in changeset 76982. I tried it on my system, with Apple-supplied GCC 4.0.1 and GCC-direct 4.6 (from MacPorts) on a Mac/PowerPC system. It just does the slam-dunk implementation of this concept that C++2011 allows (and therefore showing its power). The new code should be isolated to only systems that can handle it. Now the code is over the wall, and it's time to see who crashes & burns (hopefully no one) in the tests.... Daryle W.

4 15

Unsubscribe not working
by Ben Robinson 22 Feb '12

22 Feb '12

I have changed to a new email address for Boost and need to unsubscribe this one. The unsubscribe option here: http://lists.boost.org/mailman/options.cgi/boost-users is not working for me. Thanks in advance for your help. Ben Robinson

2 1