- Boost - lists.preview.boost.org

[config] BOOST_NO_CXX11_HDR_MEMORY and gcc-4.6.2
by Vicente J. Botet Escriba 29 Oct '13

29 Oct '13

Hi, I'm checking for BOOST_NO_CXX11_HDR_MEMORY to include <memory> file with gcc-4.6.2 C++0x and while the file is there (it was a C++98 file),it is not defining in particular pointer_traits and allocator_traits Could the following patch be applied? Best, Vicente svn diff stdlib/libstdcpp3.hpp Index: stdlib/libstdcpp3.hpp =================================================================== --- stdlib/libstdcpp3.hpp (revision 86431) +++ stdlib/libstdcpp3.hpp (working copy) @@ -154,9 +154,11 @@ // Note that although <chrono> existed prior to 4.7, "stead_clock" is spelled "monotonic_clock" // so 4.7.0 is the first truely conforming one. # define BOOST_NO_CXX11_HDR_CHRONO +// C++11 header not yet (fully!) implemented, e.g. pointer_traits and allocator_traits. +# define BOOST_NO_CXX11_HDR_MEMORY # define BOOST_NO_CXX11_ALLOCATOR #endif -// C++0x headers not yet (fully!) implemented +// C++11 headers not yet (fully!) implemented // # define BOOST_NO_CXX11_HDR_THREAD # define BOOST_NO_CXX11_HDR_TYPE_TRAITS

6 14

The release branch is now closed
by Marshall Clow 28 Oct '13

28 Oct '13

Please do not commit anything to the release branch w/o explicit permission from the release managers. -- Marshall

5 4

[1.55] Request permission to merge 86426 to branches/release
by Beman Dawes 28 Oct '13

28 Oct '13

86426 needs to be merged to branches/release. It is a showstopper since without it all msvc tests are broken. It is a one-liner from Steven that simply deletes line 15, " : usage-requirements <implicit-dependency>/boost//headers" from libs/Jamfile.v2. This was was part of a three revision set of patches (86393, 86398, and 86426) that was being held waiting for trunk tests to cycle. The first two got merged yesterday, but the last one was missed in the last minute rush. --Beman

3 3

[config] gcc 4.6 unified initialization syntax buggy
by klaus triendl 28 Oct '13

28 Oct '13

hi, gcc 4.6 (with -std=c++0x) has a bug in its support for unified initialization. specifically a derived class cannot initialize its base with members, if the base has no user-defined constructor: <code> struct base { int i; }; struct derived: base { explicit derived(int i): base{i} {} }; </code> therefore the configuration macro BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX should be fixed... Has this been already addressed? -- klaus triendl

1 0

[config] clang/int128 support
by Tim Blechmann 28 Oct '13

28 Oct '13

hi all, is it ok to commit this patch? this works around some issues when compiling boost.atomic with clang-3.4: ../../../boost/atomic/detail/gcc-atomic.hpp:961:64: error: no matching constructor for initialization of 'storage_type' (aka 'boost::atomics::detail::storage128_type') explicit base_atomic(value_type const& v) BOOST_NOEXCEPT : v_(0) thnx, tim --- a/boost/config/compiler/clang.hpp +++ b/boost/config/compiler/clang.hpp @@ -39,6 +39,11 @@ // Clang supports "long long" in all compilation modes. #define BOOST_HAS_LONG_LONG +#if defined(__SIZEOF_INT128__) +# define BOOST_HAS_INT128 +#endif + +

2 1

[numeric] Lack headers for ARM CPU
by christine bouzant 28 Oct '13

28 Oct '13

Hello all, I would need to include the header boost/numeric/interval/hw_rounding.hpp but i see that the ARM CPU is not taken in account. Is someone would have a non official header version for the ARM cpu case ? Thank you! Cheers, Christine

1 0

boost::polygon type genericity
by T. Raykoff 28 Oct '13

28 Oct '13

boost::polygon has a nice facility for generic numeric types for coordinate values via coordinate_traits, etc. But there are a number of places in the library code where a hard-coded type, usually a double, is used instead of referring to the appropriate type in this trait struct. Should this be considered a bug in b::p? Background: I'd like to use a custom class as a type which manages the scaling of real-world decimal coordinates to the integral values that b::p likes to use. I understand the whole thing about snap-rounding to an integral grid and all that, so need to scale up the real-world decimal values to an appropriate grid size. But it makes sense to carry this paradigm through to all of the typedef's in coordinate_traits and high_precision_type, but this is where things break with the hard-coded double's. T -- View this message in context: http://boost.2283326.n4.nabble.com/boost-polygon-type-genericity-tp4651484.… Sent from the Boost - Dev mailing list archive at Nabble.com.

6 10

[1.55] Late release Notes?
by John Maddock 27 Oct '13

27 Oct '13

In order to save my blushes(!), can the following line please be added to the Math lib release notes: * Add improvement to non-central chi squared distribution quantile due to Thomas Luu. Apologies to Thomas for forgetting him! John.

4 5

[git] [conversion] Schedule and remaining showstoppers?
by Beman Dawes 27 Oct '13

27 Oct '13

It seems to me the best time for the svn to modular git changeover is right after a Boost release. That will give us the maximum time window to get the new house in order before the subsequent release. So should we convert right after 1.55 ships? I'm well aware that there is a long list of conversion related tasks that we haven't completed. But the svn -> git conversion process itself is so complex that only Dave and Daniel can make modifications. They have done a staggering amount of work already and are nearing exhaustion. Once the conversion is done, there are many of us that understand git well enough to help with problems. For example, https://github.com/ryppl/Boost2Git/issues/5, "Mimic gitfow", is a showstopper in that what is now "master" should be "develop" and the true "master" (i.e. releases) branch needs to be synthesized. But while it would be great if the Boost2Git process could handle that, it could probably also be do by a post-conversion step performed by git and other command line tools that many of us could help with. Messy, but I'm not willing to take a further delay waiting for perfection. Which of the issues in https://github.com/ryppl/Boost2Git/issues?state=openare true show stoppers? Are there any true showstoppers missing from that list? --Beman

12 45

[git] conversion stalled
by Jürgen Hunold 27 Oct '13

27 Oct '13

Hi! It seems the conversion script is stalled on commit 515f5649bbfb25e2ac89958d700ff2a67fddc030 Date: Fri Sep 13 14:48:17 2013 +0000 There have been some Boost.Build commits in the meantime, can someone please re-enable the conversion again? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

7 15

[winapi] Default target Windows version
by Andrey Semashev 26 Oct '13

26 Oct '13

Hi, First, a little intro. As part of ongoing work on Boost.Sync we've created quite a few headers with WinAPI declarations that are often needed in Boost libraries. The headers are in boost/detail/winapi and can be used by any library that wishes to avoid including windows.h. The headers declare some symbols that depend on the target Windows version. For example, GetTickCount64 only appeared in Windows Vista. The user can define BOOST_USE_WINAPI_VERSION macro before including any Boost headers to indicate the target WinAPI version Boost should use. If the macro is not defined, the headers attempt to deduce the target Windows version from the _WIN32_WINNT and WINVER macros, if they are defined by the user. Lastly, if everything fails, the headers fall back to a default, which is currently Windows XP. I wanted to ask the community if it is appropriate to raise the default to Windows Vista. The rationale for this is that Vista introduced a lot of useful APIs (in thread synchronization, in particular) and XP is losing its popularity and soon will be completely unsupported by Microsoft. Also, I'm not sure what is the current state of affair, but Microsoft already tried to drop pre-Vista targets in MSVC. Note that I'm not suggesting to drop support for pre-Vista Windows. The user will still be able to enable previous versions of WinAPI in one of the mentioned above ways. Lastly, I'd like to encourage Boost developers to use this protocol for defining WinAPI version used by libraries. It would be ideal if by defining BOOST_USE_WINAPI_VERSION the user would be able to control WinAPI version used by all Boost libraries, not just Boost.Sync and Boost.Chrono (the current users of these headers). If you want to add support for this protocol to your library, simply include boost/detail/winapi/config.hpp. This will result in BOOST_USE_WINAPI_VERSION being defined so that it can be checked by the library. Other headers boost/detail/winapi make use of this macro, you can see them as an example.

9 36

Re: [boost] [voronoi]medial axis
by Michael Simbirsky 26 Oct '13

26 Oct '13

Thanks, Andrii, Louis, Like Louis, I try to use Boost.Polygon Voronoi diagram for medial axis computation. Since Voronoi diagram is stored as DCEL, it is not difficult to represent it as a combination of two dual graphs. The "primal" bidirected graph has Voronoi vertices as its vertices and (finite) halfedges as edges. The "dual" graph has Voronoi cells as its vertices; half-edges "connect" adjacent cells. This graph is also bi-directed. I think this understanding of DCEL is rather common; I believe CGAL applies similar approach to provide Boost Graph adapters for its DCEL arrangements. For my purposes I am writing the adapters on my own. Iterator parts are straight-forward. For efficiency it is also useful to convert some internals into "property maps". For example, color map is already provided, one has only to wrap it into boost::property_map with correct access functions. Similarly, the fact that vertices are packed into continuous storage gives us an efficient "vertex to integer" bimap, an important ingredient for many search algorithms from Boost Graph library. As the next step I hope to implement your discussion on vertices connected to infinity, vertices in holes etc.using Boost.Graph. Andrii, I would be glad to share this code with you and Boost.Polygon users. Thanks, -Michael

2 3

[release] Permission to merge after regression cycle
by Vicente J. Botet Escriba 26 Oct '13

26 Oct '13

Hi, I have been fixing some bugs on Boost.Chrono #9274 <https://svn.boost.org/trac/boost/ticket/9274> lost of precission on system_clock input <https://svn.boost.org/trac/boost/ticket/9274> #9276 <https://svn.boost.org/trac/boost/ticket/9276> output from a system_clock::time_point get a time_point that is one day later than expected <https://svn.boost.org/trac/boost/ticket/9276> #9265 <https://svn.boost.org/trac/boost/ticket/9265> time_point_output_h test crashes regression test <https://svn.boost.org/trac/boost/ticket/9265> #8328 <https://svn.boost.org/trac/boost/ticket/8328> chrono crashes visual studio 2012 regression tests <https://svn.boost.org/trac/boost/ticket/8328> The concerned change sets are 19:00 Changeset /[86410]/ by viboes <https://svn.boost.org/trac/boost/changeset/86410> Thread: Try to fix system_clock::time_point output on windows. 18:01 Changeset /[86384]/ by viboes <https://svn.boost.org/trac/boost/changeset/86384> Chrono: try to avoid the crash with msvc 11 on chrono_io. 17:36 Changeset /[86383]/ by viboes <https://svn.boost.org/trac/boost/changeset/86383> Chrono: set precission to 9 so that there is no lost with the hisgest ... 14:27 Changeset /[86376]/ by viboes <https://svn.boost.org/trac/boost/changeset/86376> Chrono: fix two important issues with Boost.Chrono IO v2 on windows * ... 14:54 Changeset /[86357]/ by viboes <https://svn.boost.org/trac/boost/changeset/86357> Chrono: don't run test_good_utc_fmt_system_clock on windows as this is ... I would like to merge these changeset to release. Is it time to do it before releasing boost 1.55? Best, Vicente Patch: svn diff boost/chrono/detail/inlined/win/chrono.hpp boost/chrono/io/time_point_io.hpp libs/chrono/test/io/time_point_output.cpp libs/chrono/example/io_ex1.cpp Index: boost/chrono/detail/inlined/win/chrono.hpp =================================================================== --- boost/chrono/detail/inlined/win/chrono.hpp (revision 86326) +++ boost/chrono/detail/inlined/win/chrono.hpp (working copy) @@ -109,8 +109,11 @@ { ec.clear(); } - return time_point(duration( - (static_cast<__int64>( ft.dwHighDateTime ) << 32) | ft.dwLowDateTime)); + return system_clock::time_point( + system_clock::duration( + ((static_cast<__int64>( ft.dwHighDateTime ) << 32) | ft.dwLowDateTime) + -116444736000000000LL + )); } #endif Index: boost/chrono/io/time_point_io.hpp =================================================================== --- boost/chrono/io/time_point_io.hpp (revision 86326) +++ boost/chrono/io/time_point_io.hpp (working copy) @@ -28,6 +28,7 @@ #include <boost/chrono/clock_string.hpp> #include <boost/chrono/round.hpp> #include <boost/chrono/detail/scan_keyword.hpp> +#include <boost/static_assert.hpp> #include <boost/detail/no_exceptions_support.hpp> #include <cstring> #include <locale> @@ -46,9 +47,11 @@ { namespace chrono { + typedef double fractional_seconds; namespace detail { + template <class CharT, class InputIterator = std::istreambuf_iterator<CharT> > struct time_get { @@ -758,6 +761,7 @@ { 0,31,59,90,120,151,181,212,243,273,304,334}, { 0,31,60,91,121,152,182,213,244,274,305,335} }; + return days[is_leap(year)][month-1] + day - 1; } @@ -779,7 +783,7 @@ month++; int day = t->tm_mday; int day_of_year = days_from_1jan(year,month,day); - int days_since_epoch = days_from_1970(year) + day_of_year; + int days_since_epoch = days_from_1970(year) + day_of_year ; time_t seconds_in_day = 3600 * 24; time_t result = seconds_in_day * days_since_epoch + 3600 * t->tm_hour + 60 * t->tm_min + t->tm_sec; @@ -801,11 +805,36 @@ return y * 365 + y / 4 - y / 100 + y / 400; } + // Returns year/month/day triple in civil calendar + // Preconditions: z is number of days since 1970-01-01 and is in the range: + // [numeric_limits<Int>::min(), numeric_limits<Int>::max()-719468]. + template <class Int> + //constexpr + void + inline civil_from_days(Int z, Int& y, unsigned& m, unsigned& d) BOOST_NOEXCEPT + { + BOOST_STATIC_ASSERT_MSG(std::numeric_limits<unsigned>::digits >= 18, + "This algorithm has not been ported to a 16 bit unsigned integer"); + BOOST_STATIC_ASSERT_MSG(std::numeric_limits<Int>::digits >= 20, + "This algorithm has not been ported to a 16 bit signed integer"); + z += 719468; + const Int era = (z >= 0 ? z : z - 146096) / 146097; + const unsigned doe = static_cast<unsigned>(z - era * 146097); // [0, 146096] + const unsigned yoe = (doe - doe/1460 + doe/36524 - doe/146096) / 365; // [0, 399] + y = static_cast<Int>(yoe) + era * 400; + const unsigned doy = doe - (365*yoe + yoe/4 - yoe/100); // [0, 365] + const unsigned mp = (5*doy + 2)/153; // [0, 11] + d = doy - (153*mp+2)/5 + 1; // [1, 31] + m = mp + (mp < 10 ? 3 : -9); // [1, 12] + y += (m <= 2); + --m; + } inline std::tm * internal_gmtime(std::time_t const* t, std::tm *tm) { if (t==0) return 0; if (tm==0) return 0; +#if 0 static const unsigned char day_of_year_month[2][366] = { @@ -820,6 +849,7 @@ { -1, 30, 58, 89, 119, 150, 180, 211, 242, 272, 303, 333, 364 }, { -1, 30, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365 } }; +#endif const time_t seconds_in_day = 3600 * 24; int32_t days_since_epoch = static_cast<int32_t>(*t / seconds_in_day); @@ -829,6 +859,7 @@ hms = seconds_in_day+hms; } +#if 0 int32_t x = days_since_epoch; int32_t y = static_cast<int32_t> (static_cast<long long> (x + 2) * 400 / 146097); @@ -843,16 +874,23 @@ //y -= 32767 + 2; y += 70; tm->tm_year=y; - const bool leap = is_leap(y); + const int32_t leap = is_leap(y); tm->tm_mon = day_of_year_month[leap][doy]-1; - tm->tm_mday = doy - days_in_year_before[leap][day_of_year_month[leap][doy] - 1]; + tm->tm_mday = doy - days_in_year_before[leap][tm->tm_mon] ; +#else + int32_t y; + unsigned m, d; + civil_from_days(days_since_epoch, y, m, d); + tm->tm_year=y-1900; tm->tm_mon=m; tm->tm_mday=d; +#endif - tm->tm_hour = hms / 3600; const int ms = hms % 3600; tm->tm_min = ms / 60; tm->tm_sec = ms % 60; + tm->tm_isdst = -1; + (void)mktime(tm); return tm; } @@ -907,6 +945,9 @@ tm = *tmp; #else if (gmtime_r(&t, &tm) == 0) failed = true; + tm.tm_isdst = -1; + (void)mktime(&tm); + #endif } @@ -922,7 +963,7 @@ failed = tpf.put(os, os, os.fill(), &tm, pb, pe).failed(); if (!failed) { - duration<double> d = tp - system_clock::from_time_t(t) + seconds(tm.tm_sec); + duration<fractional_seconds> d = tp - system_clock::from_time_t(t) + seconds(tm.tm_sec); if (d.count() < 10) os << CharT('0'); //if (! os.good()) { // throw "exception"; @@ -932,6 +973,7 @@ //if (! os.good()) { //throw "exception"; //} + os.precision(9); os << d.count(); //if (! os.good()) { //throw "exception"; @@ -1058,12 +1100,8 @@ const std::time_get<CharT>& tg = std::use_facet<std::time_get<CharT> >(loc); const std::ctype<CharT>& ct = std::use_facet<std::ctype<CharT> >(loc); tm tm; // {0} - tm.tm_year=0; - tm.tm_mon=0; - tm.tm_mday=0; - tm.tm_hour=0; - tm.tm_min=0; - tm.tm_sec=0; + std::memset(&tm, 0, sizeof(std::tm)); + typedef std::istreambuf_iterator<CharT, Traits> It; if (pb == pe) { @@ -1079,9 +1117,13 @@ tg.get(is, 0, is, err, &tm, pb, pe); #endif if (err & std::ios_base::failbit) goto exit; - double sec; + fractional_seconds sec; CharT c = CharT(); + std::ios::fmtflags flgs = is.flags(); + is.setf(std::ios::fixed, std::ios::floatfield); + is.precision(9); is >> sec; + is.flags(flgs); if (is.fail()) { err |= std::ios_base::failbit; @@ -1099,13 +1141,14 @@ if (err & std::ios_base::failbit) goto exit; time_t t; + #if BOOST_CHRONO_INTERNAL_TIMEGM t = detail::internal_timegm(&tm); #else t = timegm(&tm); #endif tp = time_point_cast<Duration>( - system_clock::from_time_t(t) - min + round<microseconds> (duration<double> (sec)) + system_clock::from_time_t(t) - min + round<system_clock::duration> (duration<fractional_seconds> (sec)) ); } else Index: libs/chrono/test/io/time_point_output.cpp =================================================================== --- libs/chrono/test/io/time_point_output.cpp (revision 86326) +++ libs/chrono/test/io/time_point_output.cpp (working copy) @@ -148,68 +148,102 @@ using namespace boost::chrono; using namespace boost; - test_good_system_clock("1970-01-01 02:00:00.000000 +0000", hours(2), duration_style::prefix); - test_good_system_clock("1970-01-01 02:00:00.000000 +0000", hours(2), duration_style::symbol); + test_good_system_clock("1970-01-01 02:00:00.000000000 +0000", hours(2), duration_style::prefix); + test_good_system_clock("1970-01-01 02:00:00.000000000 +0000", hours(2), duration_style::symbol); - test_good_prefix_system_clock("1970-01-01 02:00:00.000000 +0000", hours(2)); - test_good_prefix_system_clock("1970-01-01 00:02:00.000000 +0000", minutes(2)); - test_good_prefix_system_clock("1970-01-01 00:00:02.000000 +0000", seconds(2)); - test_good_prefix_system_clock("1970-01-01 00:00:01.000000 +0000", seconds(1)); - test_good_prefix_system_clock("1969-12-31 23:59:59.000000 +0000", seconds(-1)); - test_good_prefix_system_clock("1970-01-01 00:00:00.000000 +0000", seconds(0)); - test_good_prefix_system_clock("1970-01-01 00:00:00.002000 +0000", milliseconds(2)); - test_good_prefix_system_clock("1970-01-01 00:00:00.000002 +0000", microseconds(2)); - test_good_prefix_system_clock("1970-01-01 00:00:00.000000 +0000", nanoseconds(2)); - test_good_prefix_system_clock("1970-01-01 00:00:00.200000 +0000", duration<boost::int_least64_t, deci> (2)); - test_good_prefix_system_clock("1970-01-01 00:00:00.066667 +0000", duration<boost::int_least64_t, ratio<1, 30> > (2)); + test_good_prefix_system_clock("1970-01-01 02:00:00.000000000 +0000", hours(2)); + test_good_prefix_system_clock("1970-01-01 00:02:00.000000000 +0000", minutes(2)); + test_good_prefix_system_clock("1970-01-01 00:00:02.000000000 +0000", seconds(2)); + test_good_prefix_system_clock("1970-01-01 00:00:01.000000000 +0000", seconds(1)); + test_good_prefix_system_clock("1969-12-31 23:59:59.000000000 +0000", seconds(-1)); + test_good_prefix_system_clock("1970-01-01 00:00:00.000000000 +0000", seconds(0)); + test_good_prefix_system_clock("1970-01-01 00:00:00.002000000 +0000", milliseconds(2)); + test_good_prefix_system_clock("1970-01-01 00:00:00.000002000 +0000", microseconds(2)); + test_good_prefix_system_clock("1970-01-01 00:00:00.000000002 +0000", nanoseconds(2)); + test_good_prefix_system_clock("1970-01-01 00:00:00.200000000 +0000", duration<boost::int_least64_t, deci> (2)); + test_good_prefix_system_clock("1970-01-01 00:00:00.066666667 +0000", duration<boost::int_least64_t, ratio<1, 30> > (2)); - test_good_symbol_system_clock("1970-01-01 02:00:00.000000 +0000", hours(2)); - test_good_symbol_system_clock("1970-01-01 00:02:00.000000 +0000", minutes(2)); - test_good_symbol_system_clock("1970-01-01 00:00:02.000000 +0000", seconds(2)); - test_good_symbol_system_clock("1970-01-01 00:00:00.002000 +0000", milliseconds(2)); - test_good_symbol_system_clock("1970-01-01 00:00:00.000000 +0000", nanoseconds(2)); - test_good_symbol_system_clock("1970-01-01 00:00:00.200000 +0000", duration<boost::int_least64_t, deci> (2)); - test_good_symbol_system_clock("1970-01-01 00:00:00.066667 +0000", duration<boost::int_least64_t, ratio<1, 30> > (2)); + test_good_symbol_system_clock("1970-01-01 02:00:00.000000000 +0000", hours(2)); + test_good_symbol_system_clock("1970-01-01 00:02:00.000000000 +0000", minutes(2)); + test_good_symbol_system_clock("1970-01-01 00:00:02.000000000 +0000", seconds(2)); + test_good_symbol_system_clock("1970-01-01 00:00:00.002000000 +0000", milliseconds(2)); + test_good_symbol_system_clock("1970-01-01 00:00:00.000000002 +0000", nanoseconds(2)); + test_good_symbol_system_clock("1970-01-01 00:00:00.200000000 +0000", duration<boost::int_least64_t, deci> (2)); + test_good_symbol_system_clock("1970-01-01 00:00:00.066666667 +0000", duration<boost::int_least64_t, ratio<1, 30> > (2)); test_good_utc_fmt_system_clock("1970-01-01 02:00:00", "%Y-%m-%d %H:%M:%S", hours(2)); test_good_utc_fmt_system_clock("1970-01-01 02", "%Y-%m-%d %H", hours(2)); - +#if ! defined(BOOST_CHRONO_WINDOWS_API) test_good_utc_fmt_system_clock ("1970-01-01 02:00:00", "%Y-%m-%d %T", hours(2)); test_good_utc_fmt_system_clock ("1970-01-01 02:00", "%Y-%m-%d %R", hours(2)); test_good_utc_fmt_system_clock ("% 1970-01-01 02:00", "%% %Y-%m-%d %R", hours(2)); test_good_utc_fmt_system_clock ("1970-01-01 02:00 Thursday January", "%Y-%m-%d %R %A %B", hours(2)); - +#endif } + +#endif +#if BOOST_CHRONO_VERSION == 2 void test_gmtime(std::time_t t) { std::cout << "t " << t << std::endl; + puts(ctime(&t)); std::tm tm; + std::memset(&tm, 0, sizeof(std::tm)); if (boost::chrono::detail::internal_gmtime(&t, &tm)) { - std::cout << "year " << tm.tm_year << std::endl; - std::cout << "month " << tm.tm_mon << std::endl; - std::cout << "day " << tm.tm_mday << std::endl; - std::cout << "hour " << tm.tm_hour << std::endl; - std::cout << "min " << tm.tm_min << std::endl; - std::cout << "sec " << tm.tm_sec << std::endl; + tm.tm_isdst = -1; + (void)mktime(&tm); + std::tm tm2; + std::memset(&tm2, 0, sizeof(std::tm)); + if (gmtime_r(&t, &tm2)) + { + tm2.tm_isdst = -1; + (void)mktime(&tm2); + + BOOST_TEST_EQ( tm.tm_year , tm2.tm_year ); + BOOST_TEST_EQ( tm.tm_mon , tm2.tm_mon ); + BOOST_TEST_EQ( tm.tm_mday , tm2.tm_mday ); + BOOST_TEST_EQ( tm.tm_hour , tm2.tm_hour); + BOOST_TEST_EQ( tm.tm_min , tm2.tm_min ); + BOOST_TEST_EQ( tm.tm_sec , tm2.tm_sec ); + BOOST_TEST_EQ( tm.tm_wday , tm2.tm_wday ); + BOOST_TEST_EQ( tm.tm_yday , tm2.tm_yday ); + BOOST_TEST_EQ( tm.tm_isdst , tm2.tm_isdst ); + } } + } #endif + int main() { -// test_gmtime( 0 ); -// test_gmtime( -1 ); -// test_gmtime( +1 ); -// test_gmtime( 0 - (3600 * 24) ); -// test_gmtime( -1 - (3600 * 24) ); -// test_gmtime( +1 - (3600 * 24) ); -// test_gmtime( 0 + (3600 * 24) ); -// test_gmtime( -1 + (3600 * 24) ); -// test_gmtime( +1 + (3600 * 24) ); +#if BOOST_CHRONO_VERSION == 2 + test_gmtime( 0 ); + test_gmtime( -1 ); + test_gmtime( +1 ); + test_gmtime( 0 - (3600 * 24) ); + test_gmtime( -1 - (3600 * 24) ); + test_gmtime( +1 - (3600 * 24) ); + test_gmtime( 0 + (3600 * 24) ); + test_gmtime( -1 + (3600 * 24) ); + test_gmtime( +1 + (3600 * 24) ); + test_gmtime( 0 + 365*(3600 * 24) ); + test_gmtime( 0 + 10LL*365*(3600 * 24) ); + test_gmtime( 0 + 15LL*365*(3600 * 24) ); + test_gmtime( 0 + 17LL*365*(3600 * 24) ); + test_gmtime( 0 + 18LL*365*(3600 * 24) ); + test_gmtime( 0 + 19LL*365*(3600 * 24) ); + test_gmtime( 0 + 19LL*365*(3600 * 24)+ (3600 * 24)); + test_gmtime( 0 + 19LL*365*(3600 * 24)+ 3*(3600 * 24)); + test_gmtime( 0 + 19LL*365*(3600 * 24)+ 4*(3600 * 24)); + test_gmtime( 0 + 20LL*365*(3600 * 24) ); + test_gmtime( 0 + 40LL*365*(3600 * 24) ); +#endif + std::cout << "high_resolution_clock=" << std::endl; check_all<boost::chrono::high_resolution_clock> (); #ifdef BOOST_CHRONO_HAS_CLOCK_STEADY @@ -239,6 +273,13 @@ check_all<boost::chrono::process_cpu_clock> (); #endif +#if BOOST_CHRONO_VERSION == 2 + boost::chrono::system_clock::time_point tp = boost::chrono::system_clock::now(); + std::cout << tp << std::endl; + time_t t = boost::chrono::system_clock::to_time_t(tp); + test_gmtime( t ); +#endif + return boost::report_errors(); } Index: libs/chrono/example/io_ex1.cpp =================================================================== --- libs/chrono/example/io_ex1.cpp (revision 86326) +++ libs/chrono/example/io_ex1.cpp (working copy) @@ -53,10 +53,13 @@ << ClockTick(3) + nanoseconds(10) << '\n'; cout << "\nsystem_clock::now() = " << system_clock::now() << '\n'; +#if defined _MSC_VER && _MSC_VER == 1700 +#else #if BOOST_CHRONO_VERSION==2 cout << "\nsystem_clock::now() = " << time_fmt(chrono::timezone::local) << system_clock::now() << '\n'; cout << "\nsystem_clock::now() = " << time_fmt(chrono::timezone::local,"%Y/%m/%d") << system_clock::now() << '\n'; #endif +#endif #ifdef BOOST_CHRONO_HAS_CLOCK_STEADY cout << "steady_clock::now() = " << steady_clock::now() << '\n';

3 4

[type traits] Removal of files broke regression tests
by Beman Dawes 26 Oct '13

26 Oct '13

r68300 removed boost/type_traits/broken_compiler_spec.hpp and boost/type_traits/transform_traits_spec.hpp. Removing the first broke regression tests for iterator, python, and serialization. Removing the second doesn't appear to have done any harm. John Maddock did the r68300 commit. I'm assuming it was in response to Steve Kelly's r86250, "Remove use of obsolete BOOST_TT_BROKEN_COMPILER_SPEC", so the fix may be to remove the #includes that are causing all the errors rather than restoring the file. --Beman

2 1

[fusion] flatten/flatten_view Proposal
by TONGARI J 25 Oct '13

25 Oct '13

Hi there, I've created the ticket, doc&test included https://svn.boost.org/trac/boost/ticket/9294 'flatten' is an algorithm which returns a view that allows you to go through the leaf elems sequentially. For example: flatten(make_vector(1, make_vector(2, 3))) == make_vector(1, 2, 3) This is developed when I use Fusion to work with SQL for simple data mapping. In addition to 'flatten', 'support/ref' is also provided in this patch for working with mutable sequence, which I had talked with Joel sometime ago. BTW, I think the ticket below is OK to close (the patch seem applied): https://svn.boost.org/trac/boost/ticket/8270 Thanks,

2 7

[config] A few headers moved from detail into config module
by Daniel James 25 Oct '13

25 Oct '13

Hi, In case you missed it on the other thread, a few headers have been moved to the config module from detail: boost/version.hpp boost/limits.hpp boost/detail/workaround.hpp Hopefully that isn't a controversial move, but if any of these are a problem, it's just a case of reverting the appropriate changeset in Boost2Git. You can see them at: https://github.com/ryppl/Boost2Git/commits/master Daniel

1 0

[Numeric] Lack Numeric/interval headers for ARM CPU
by christine bouzant 25 Oct '13

25 Oct '13

Hello all, I would need to include the header boost/numeric/interval/hw_rounding.hpp but i see that the ARM CPU is not taken in account. Is someone would have a non official header version for the ARM cpu case ? Thank you! Cheers, Christine

1 0

storing intrusive_ptr in atomic?!
by Oliver Kowalke 25 Oct '13

25 Oct '13

Hello, do you confirm that it is valid to store a intrusive_ptr inside an atomic?! struct X { std::size_t use_count; X() : use_count( 0) {} friend inline void intrusive_ptr_add_ref( X * p) BOOST_NOEXCEPT { ++p->use_count; } friend inline void intrusive_ptr_release( X * p) { if ( 0 == --p->use_count) delete p; } }; X::ptr_t x1( new X() ); X::ptr_t x2( new X() ); boost::atomic< X::ptr_t > av1( x1); BOOST_ASSERT( av1.compare_exchange_strong( x1, x2) ); BOOST_ASSERT( av1.load() != x1); BOOST_ASSERT( av1.load() == x2); A type T used in generic template atomic<T> is required to be trivial copy-able, e.g. I think it is trivial copy-able (std::memcpy) only the use_count will not incremented. The memory layout of intrusive_ptr is a raw-pointer so trivial copy-able should be correct. What do you think? Oliver

4 26

[git] creation of .gitignores
by Jürgen Hunold 25 Oct '13

25 Oct '13

Hi, the converted repository is missing .gitignores. svn provides the ignores patterns in the "svn:ignore" property. The question is: Can those patterns be extracted by the conversion script or shall manually create .gitignores in current svn (patch attached). The third option is to add them after the conversion. Adding (and modifying) the .gitignores during the conversion has the advantage of having .gitignores throughout the whole history instead of only "now". Any comments? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

3 2

[git help] Documenting common modular boost workflows
by Beman Dawes 25 Oct '13

25 Oct '13

I think we need to document simple suggested modular boost workflows. Each workflow could start with the assumption that the steps described in https://svn.boost.org/trac/boost/wiki/TryModBoost have been completed. Workflows might include: 1) Switch to the "develop" branch, fix a minor problem, test, commit, switch back to "master". 2) Same as (1) but also push to remote. 3) Same as (2) but also merge develop to master. 4) Same as (3) but end by submitting a pull request to the boost super-project. I don't mind writing the actual wiki pages, but am a little hobbled by being a TortoiseGit rather than command line git user, and by never having worked with sub-modules. So what would recommended git commands look like for one or more of the above workflows? Thanks, --Beman

12 30

[utility][enable_if] Documentation issue
by Agustín K-ballo Bergé 25 Oct '13

25 Oct '13

The documentation for `enable_if` has a duplicated anchor for sections 3.1 and 3.2, making it impossible to link to section 3.2 directly. See http://www.boost.org/libs/utility/enable_if.html#htoc7 This issue is still present in trunk. Could this be fixed? I could provide a patch but I do not see a .qbk file for it, should the html be modified directly? Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

2 2

[Type_Traits] [remove_bounds]: Wrong workaround for IBM C++ compiler is applied in remove_bounds.hpp
by Kilian Kilger 24 Oct '13

24 Oct '13

Hi, in remove_bounds.hpp, a wrong workaround for the IBM C++ compiler is applied. This workaround is only valid for IBM C++ on AIX, but wrong for IBM C++ on z/OS. The z/OS compiler has no bug and thus no workaround must be applied (else we get wrong results). So instead of testing against __IBMCPP__ one should also test against __MVS__. This last macro is only defined for IBM C++ on z/OS. I wanted to open a ticket on trac, but this system did always identify my posting as spam. Best regards, Kilian.

4 11

[1.55 beta][serialization] VS2013 boost/archive/iterators/transform_width.hpp(151) : error C2039: 'min'
by Jeff Flinn 24 Oct '13

24 Oct '13

This is ticket #9279/#8750. Just checking that this gets into the release. Is that the case? Thanks, Jeff

1 0

[functors] proposal
by Piotr Wygocki 24 Oct '13

24 Oct '13

Hi, I've developed a small set of functors and functor adaptors. Although this code is very simple it might be very useful for some subset of the community. Do you think it might become a part of the boost library? If not I'm still very interested in any feedback. I think it's not big enough to be a separate library. To my knowledge of boost it fits in the utility lib. The code can be found here: https://github.com/wygos/functors List of utilities: SkipFunctor takes any number of arguments; does completely nothing ReturnSomethingFunctor<T,t> takes any number of arguments; returns t; IdentityFunctor takes one parameter and returns it. ReturnFalseFunctor takes any number of arguments; returns false; ReturnTrueFunctor takes any number of arguments; returns true; ReturnZeroFunctor takes any number of arguments; returns 0; AssertFunctor takes any number of arguments; asserts; ArrayToFunctor<Array> Stores an object which provides operator[]. Provides operator()(). A set of non-template comparison functors (only operator() is templated): * Greater * Less * GreaterEqual * LessEqual * EqualTo * NotEqualTo FunctorToComparator<Functor, Compare> This comparator takes a functor "f" and a comparator "c". For elements (x,y) it returns c(f(x), f(y)) c is Less by default FunctorToOutputIterator<Functor> The output iterator stores a functor and each time the operator= is called the given functor is called Logical operators as functors: * Not * Or * And * Xor LiftBinaryOperatorFunctor<Operator, FunctorLeft, FunctorRight> Functor stores a binary operator "o" and two functors "f" and "g". For given arguments args returns o(f(args), g(args)). Boolean functor adapters. Each of them stores a boolean functor and performs an appropriate logical operation in the operator(). * NotFunctor<Functor> * OrFunctor<FunctorLeft, FunctorRight> * AndFunctor<FunctorLeft, FunctorRight> * XorFunctor<FunctorLeft, FunctorRight> Regards, Piotr

5 12

[boost-testing] something broke my tester(lazypiranha)
by Michael Mathews 24 Oct '13

24 Oct '13

Hi Folks, starting with last nights run my tester has been failing with : File "/home/michael/boost_testing/tools_regression_src/regression.py", line 329, in command_test self.command_test_boost_build() File "/home/michael/boost_testing/tools_regression_src/regression.py", line 369, in command_test_boost_build "boost/bin.v2/libs/any/test/any_test.test")); OSError: [Errno 2] No such file or directory: '/home/michael/boost_testing/results/boost/bin.v2/libs/any/test/any_test.test' Is there an easy an easy way for me to determine the missing test? thanks michael

1 0

NT2 and Boost.SIMD beta 2 available
by Joel Falcou 23 Oct '13

23 Oct '13

This following releases updates NT2 and Boost.SIMD libraries.10 months had past and 176 Issues have been closed since last beta release and more than 2000 commits have been issued. Boost.SIMD is heading toward API stability. We want to tackle ons ome more compile time issues before going for an actual Boost Review. Special thanks to Tim Blenchmann and Domagoj Saric for their help and suggestions throughout this development. The release Changelog is here : https://github.com/MetaScale/nt2/releases The files can be download from : http://nt2.metascale.org/downloads/ The Documentation (in progress) is here : http://nt2.metascale.org/doc/html/index.html

4 4

[1.55][Math] Are we still open to patches?
by John Maddock 23 Oct '13

23 Oct '13

Are we still open for patches for 1.55? If so I'd like to merge the patch for the issue raised here: http://boost.2283326.n4.nabble.com/Boost-1-54-0-boost-math-sph-bessel-n-x-c… now that the tests on Trunk have cycled. Thanks, John.

2 1

[website] Redirection to latest documentation
by Laurent Dupuy 23 Oct '13

23 Oct '13

Hello all, Would it be possible for the webmaster(s) to add a redirection (a symbolic link or whatever) to the latest documentation? Until recently, the URL http://www.boost.org/doc/libs/ did the job, but it does not anymore. Thanks! -- Laurent Dupuy.

2 1

Boost.Build commit heads up
by Beman Dawes 23 Oct '13

23 Oct '13

Here is the commit message for revision 86392: Add Boost.Build support for the Git modular layout, using links to to new header locations, thus preventing breakage to vast amounts of user code and build setups. Being added to SVN so that changes will automatically propagate to Git and modular Boost. Thanks to Steven Watanabe, Jürgen Hunold, Vladimir Prus, and Bjørn Roald for developing this patch. Steven in particular conceived the approach and did the initial implementation, which was further refined by the other contributors. In theory this commit won't break any existing boost builds. To verify that, on Win 7 and Ubunto I've done a fresh SVN checkout of trunk and verified bootstrap.bat, bootstrap.sh, and a b2 build work both before and after the patch is applied. On Windows, I verified that after the patch is applied a b2 build using an unpatched prior compilation of b2 still works. These tests increase confidence that committing the patch to trunk now isn't likely to cause breakage, but please post to this list right away if you spot any build breakage or other odd behavior. The files modified are listed below. Thanks, --Beman Modified: D:\boost\trunk\Jamroot Modified: D:\boost\trunk\libs\geometry\index\example\Jamfile.v2 Modified: D:\boost\trunk\libs\numeric\odeint\examples\vexcl\Jamfile.v2 Modified: D:\boost\trunk\libs\parameter\doc\html\index.html Modified: D:\boost\trunk\libs\parameter\doc\index.rst Modified: D:\boost\trunk\libs\python\example\Jamroot Modified: D:\boost\trunk\libs\python\example\quickstart\Jamroot Modified: D:\boost\trunk\libs\python\example\tutorial\Jamroot Modified: D:\boost\trunk\libs\signals2\example\Jamfile.v2 Modified: D:\boost\trunk\libs\spirit\example\qi\json\build\Jamfile Modified: D:\boost\trunk\libs\units\test\Jamfile.v2 Modified: D:\boost\trunk\tools\Jamfile.v2 Modified: D:\boost\trunk\tools\regression\build\Jamroot.jam

5 6

Re: [boost] [git help] Documenting common modular boost workflows
by Daryle Walker 23 Oct '13

23 Oct '13

Since a project that’s made of a bunch of sub-repositories that’s later merged is (AFAIK) unusual, I don’t think the writer of gitflow had it in mind. I’m guessing that each sub-repository independently uses gitflow. When it’s shipping time, the release-merge script grabs from the “master” branch of each sub-repository. Of course, this doesn’t cover multiple libraries that have to work together or what happens when fixing is necessary (probably due to cross-library problems). And do the test runners work off “develop,” “master,” “release,” or does it shift depending where we are in the release cycle? Sent from Windows Mail From: Peter Dimov Sent: ‎Monday‎, ‎October‎ ‎21‎, ‎2013 ‎10‎:‎16‎ ‎AM To: Boost Dev-List Dave Abrahams wrote: > IIUC we already agreed long ago to use gitflow: It's not entirely clear to me what using gitflow would mean in the context of a Boost superproject with per-library submodules. Who is "we" who would be using gitflow, the Boost release managers or the library maintainers? When Boost release 1.64.0 is started, who is going to create the gitflow release branch, and from what? _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

4 4

Reading & Parsing an .ini input file using BOOST... ..!!
by Rahul Mathur 22 Oct '13

22 Oct '13

All, Need small help. I have an "input.ini" input file which contains sample values like – --- App=| 5000 | 5001 | 0 | | | | 1BYTE | --- Starting with word (viz. App), followed by equal sign, than data within pipes (|) and blank space between two pipes ( | | ). Anything only between two pipes is to be read. I am looking to parse this input file. After parsing, assign each data to struct member type and than send this complete struct as socket. I am looking to use Boost property tree (or the needed one) and finally the ASIO to send the complete filled struct as stream. I tried below code to read complete data and it worked but - --- #include <iostream> #include <boost/property_tree/ptree.hpp> #include <boost/property_tree/ini_parser.hpp> #include <boost/filesystem/fstream.hpp> int main() { boost::property_tree::ptree pt; boost::property_tree::ini_parser::read_ini("input.ini", pt); std::cout << pt.get<std::string>("App") << std::endl; } --- But, how to read between pipes? Any clue?

1 0

Re: [boost] Boost.Build commit heads up
by Klaim - Joël Lamotte 22 Oct '13

22 Oct '13

(my last email is still in moderaition because of the zip with the log) On Tue, Oct 22, 2013 at 11:40 PM, Klaim - Joël Lamotte <mjklaim(a)gmail.com>wrote: > The boost build on my Win764bit finished for me for both VS2012 and > VS2013, apparently no error in the log I'm attaching to this mail with the > build script (which uses b2). > I'll try now to compile my main project. > I forgot to say that the revision I built was trunk r86395. So building boost with b2 now don't spawn errors, but compiling my project I still hit this bug: https://svn.boost.org/trac/boost/ticket/9266 see comments for details. (By the way, does the test suite is able to catch such compiler crashes?) To continue compiling my project, see other errors, I modified synchronized_value to activate only the code that do use variadic templates, which is a workaround I suggested in the bug report. I'm waiting for the rest of the project build right now.

1 1

[1.55] VS2013 massively failing
by Joaquin M Lopez Munoz 22 Oct '13

22 Oct '13

I understand this is being taken care of, but... VS2013 is failing to pass most libs in the release branch. For the one I care about most the problem is: D:\teeks99-10\boost\boost/mpl/aux_/preprocessed/plain/arg.hpp(45) : error C2039: 'assert_not_arg' : is not a member of 'boost::mpl' which seems to be fixed in trunk. Thank you, Joaquín M López Muñoz Telefónica Digital

3 2

Reading & Parsing an .ini input file using BOOST... ..Thanks!!
by Rahul Mathur 22 Oct '13

22 Oct '13

All, I have an .ini input file which contains sample values like – --- App=| 5000 | 5001 | 0 | | | | 1BYTE | --- Starting with word (viz. App), followed by equal sign, than data within pipes (|) and blank space between two pipes ( | | ). Anything only between two pipes is to be read. I am looking to parse this input file. After parsing, assign each data to struct member type and than send this complete struct as socket. I am looking to use Boost property tree (or the needed one) and finally the ASIO to send the complete filled struct as stream. Any clue?

2 2

Request permission to apply patch to trunk.
by Beman Dawes 22 Oct '13

22 Oct '13

I'd like to apply the attached patch to trunk. It is not supposed to break anything on an svn checkout, but we held off applying it until 1.55 beta shipped because of concern it would be disruptive if it somehow messed up the build system right in the middle of getting the beta out. Thanks to Bjørn Roald for developing the patch. Without this patch, the only way to test modular-boost headers mechanism is to manually apply the patch yourself, and that pretty much limits testing. OK to apply? --Beman

5 7

[modernization][skelly] Surprising changes
by Agustín K-ballo Bergé 22 Oct '13

22 Oct '13

I was going through recent Boost.Spirit changes and I was surprised to see this code: #if (defined(BOOST_MSVC) && (BOOST_MSVC < 1310)) \ || (defined(__BORLANDC__) && (__BORLANDC__ <= 0x570)) \ || (defined(__GNUC__) && (__GNUC__ < 3)) \ || (defined(__GNUC__) && (__GNUC__ == 3) && (__GNUC_MINOR__ < 1)) # error "Compiler not supported. See note in <boost/spirit/core/config.hpp>" #else // Pass... Compiler supported. #endif modified into this code: #if (defined(__BORLANDC__) && (__BORLANDC__ <= 0x570)) # error "Compiler not supported. See note in <boost/spirit/core/config.hpp>" #else // Pass... Compiler supported. #endif The whole point of the check is to detect unsupported compilers. It seems the modernization changes do not take into account the context in which they are done. To Stephen Kelly: I would like to suggest going over your modernization commits looking for unwanted changes like this one, and reverting them. I have already revisited your modifications to Boost.Spirit and found all changes but the one I mentioned to be valid ones (thank you for those!). Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

2 1

[multiprecision] New binary floating point type
by John Maddock 21 Oct '13

21 Oct '13

Folks, One of the main feature requests during the multiprecision lib review was for a binary floating point type. There is now such a type in the sandbox under the "multiprecision.cpp_bin_float" directory - you will also need latest SVN Trunk to try this out. This new type is correctly rounded to nearest for all arithmetic operations plus binary-decimal conversions and sqrt. Minimal docs so far here: https://svn.boost.org/svn/boost/sandbox/multiprecision.cpp_bin_float/libs/m… I'd welcome comments, and if folks would like to try and break it, that would be cool too ;-) Regards, John.

2 4

Re: [boost] [mpl] integral_c [type_traits] integral_constant limits
by Krzysztof Czainski 21 Oct '13

21 Oct '13

2012/1/4 Vicente Botet <vicente.botet(a)wanadoo.fr> > > Any new on the application of this patch? Could I apply my self and commit > in trunk? > > Vicente > > -- > View this message in context: > http://boost.2283326.n4.nabble.com/mpl-integral-c-type-traits-integral-cons… > > Hi, I just bumped into this bug with MinGW-4.8, which treats this as an error. I use boost-1.54 My simple test case is: #include <boost/mpl/integral_c.hpp> typedef boost::mpl::integral_c<int,0x7fffffff>::type next_ovf; typedef boost::mpl::integral_c<int,0x80000000>::type prior_ovf; I worked around my test by doing changing linest 74-75 of boost/mpl/aux_/integral_wrapper.hpp to typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (::boost::intmax_t(value) + 1)) ) next; typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (::boost::intmax_t(value) - 1)) ) prior; This only moves the problem from int to intmax_t, but the workaround works for me ATM. Could this please be fixed? I had this idea of fixing it by providing specializations of integral_c for the limits cases? And the specializations wouldn't typedef the offending next or prior. Would that work? I'd have tried that myself, but this integral_wrapper.hpp file and it's macros scared me away from this idea ;-) Regards, Kris

1 0

[config] Macro for unused declarations
by Jeremiah Willcock 21 Oct '13

21 Oct '13

Would it be possible to have a macro for __attribute__((unused)) and similar pragmas to portably avoid "unused typedef" and related warnings (especially from recent versions of GCC)? I have mostly removed those in Boost.Graph, but there are some that need to remain---creating a typedef to a member type of a class to make sure that the member exists, for example. Thank you. -- Jeremiah Willcock

3 2

When Boost modularization and Git migration coupling were accepted on this ML?
by Vicente J. Botet Escriba 21 Oct '13

21 Oct '13

Hi, I would not take the time to inspect all the post relating to this subject. There are a lot of post related to the subject, a lot of discussion, but what I'm locking for is a decision. So please don't replay to this post by telling me, you have just to use this tool or this other tool to have the answer. If you consider that this post is bicksheding or a bad post, please, just ignore it. I remember a post that deceded to move to Git long time ago. I would just know if (and when) the Boost community has decided to couple the move to Git and the Boost modularization. And i would like to know also if changes to the trunk repository without requesting authors permission were allowed on this move. Who accepted the plan described by S. Kelly ? Who gave him the right to update the whole Boost repository? Was this discussed on this ML or on a specific ML that is not an official Boost ML? Le 18/10/13 00:24, Stephen Kelly a écrit : > my plan for modularizing and modernizing Boost was roughly this: > > * Phase 0 - remove dead weight by bumping compiler feature requirements > * Phase 1 - move some files around so that the modularized repos form a > mostly directed graph > * Phase 2 - Form some kind of 'boost core library' or 'boost feature > normalization library' from the guts of existing libraries like > type_traits, static_assert, config mpl and utilities. > * Phase 3 - Try to port the mpl to variadic templates so that the > dependency on Boost.PP is not needed when variadic templates are available. Apologies if this is clear for most of you. IMHO, this kind of decisions should be posted with an explicit title. Best, Vicente

3 2

C++Now 2014: Call for Submissions
by Hartmut Kaiser 20 Oct '13

20 Oct '13

============================================== C++ Now Conference 2014 Aspen CO, USA, May 12-17, 2014, www.cppnow.org ============================================== Call for Submissions -------------------- We invite you to submit session proposals to the 2nd annual C++ Now Conference (Aspen CO, USA, May 12-17, 2014). Building upon the resounding success of C++ Now 2013 and five years of BoostCon, C++ Now 2014 will present leading speakers from the whole C++ community. The C++ Now Conference is dedicated to discussion and education about C++, an open and free language and standard. Our Conference will focus on discussion and education about open source software usage and developments in the C++ developer and user community. To reflect the breadth of the C++ and Boost communities, the conference includes sessions aimed at three constituencies: C++ and Boost end-users, hard-core Boost library and tool developers, and researchers pushing the boundaries of computation. The program fosters interaction and engagement within and across those groups, with an emphasis on hands-on, participatory sessions. As a multi-paradigm language, C++ is a melting pot where the most compelling ideas from other programming communities are blended in powerful ways. Historically, some of the most popular sessions at C++ Now have highlighted these concepts, from DSLs to functional programming to transactional memory and more. Bring your C#, Python, Ruby or Haskell influences to bear in an environment that will broaden their exposure. At C++ Now 2014 we would like to focus on the now established C++11 standard and the new, upcoming C++14 and how those standard are and will shape C++'s future. However, by no means this is intended to restrict the topics of proposals we hope to see. Any other topic related to C++ as outlined below is perfectly fine for submission. Important dates --------------- New proposal submissions due: December 8th, 2013. Proposals decisions sent (tentative program available): January 30th, 2014. Fully scheduled program available: February 24th, 2014. Best Presentation Awards ------------------------ We know how much effort it takes to prepare talks for our conference. For this reason we will award the best presentations in the following categories: Best Presentation, Best Short Presentation, Best Tutorial, and Best Workshop. The awards will be given based on the audience's voting. Each award will include the author's name listed on the cover of the C++ Now website for that year and a plaque containing all the C++ Now conference information. Session topics -------------- Topics of interest include, but are not restricted to, the following: * C++11/14 and how it changes life for users and library writers * General tutorial sessions on C++11/14, the C++11/14 Standards library, and one or more Boost libraries * Parallelism in the new C++11/14 standard * Parallel, distributed and GPGPU topics relating to C++ * In-depth sessions on using specific Boost libraries * Case studies on using Boost * Experts panels * Advanced sessions on implementation techniques used within Boost libraries * Development workshops to extend or enhance existing Boost libraries * Workshops on design process * Infrastructure workshops such as Build tools, Website, Testing * Concepts and Generic Programming * Hardware and infrastructure presentations focused on how libraries can make better use of the technology * Software development tools and their application to C++ and or Boost * Other topics likely to be of great interest to C++ users and developers Interactive and collaborative sessions are encouraged, as this is the style of learning and participation that has proven most successful at such events. Sessions can be tutorial based, with an emphasis on interaction and participant involvement, or workshop based, whether hands-on programming or paper-based, discussion-driven collaborative work. Session formats --------------- Presentations Presentations focus on a practitioner's ideas and experience with anything relevant to C++11 or C++14, Boost and users. Panels Panels feature three or four people presenting their ideas and experiences relating to C++11 or C++14 and Boost's relevant, controversial, emerging, or unresolved issues. Panels may be conducted in several ways, such as comparative, analytic, or historic. Tutorials Tutorials are sessions at which instructors teach conference participants specific skills relevant to C++11 or C++14 and Boost. Workshops Workshops provide an active arena for advancements in Boost-relevant topics. Workshops provide the opportunity for experienced practitioners to develop new ideas about a topic of common interest and experience. Author's Corner Presentations These were introduced at BoostCon 2008, and were a great success. They are short (30 minute) sessions, focusing on tips on usage and design. In addition, we're looking to uncover the hidden design gems in Boost libraries. Tool Vendors Presentations We actively encourage tool vendors and ISP's to submit proposals for a special Tool Vendors Session Track aimed at products related to Boost and C++ (compilers, libraries, tools, etc.). Other formats may also be of interest. Don't hold back a proposal just because it doesn't fit into a pigeonhole. Submitting a proposal --------------------- Standard Sessions are 90 minutes. You may submit a proposal for fractions or multiples of 90-minutes. Fractional proposals will be grouped into 90 minute sessions covering related topics. Longer sessions, such as tutorials and classes, will be assigned three hour (i.e. half day), or six hour (i.e. full day) time slots. Please include: * The working title. * Type of session: presentation, panel, tutorial, workshop, authors corner, vendor track, other. * A paragraph or two describing the topic covered, suitable for the conference web site. * Proposed length: 10-20 minute short talks, 45 minutes, 90 minutes, half day, full day. * Alternate lengths, if you are willing to make adjustments: 10-20 minute short-talks, 45 minutes, 90 minutes, half-day, full day. * Audience: users, developers, both. * Level: basic, intermediate, advanced. * A biography, suitable for the conference web site. * Your contact information (will not be made public). Submission details ------------------ All submissions should be made through the EasyChair conference management system: http://www.easychair.org/conferences/?conf=cppnow2014. If you have not already registered at EasyChair, you will need to do so in order to submit your proposal. All submissions will go through a peer review process. Authors are invited (but are not required) to submit PDF versions of full papers of up to 10 pages in ACM conference proceedings format (see http://www.acm.org/sigs/publications/proceedings-templates) The full papers are not required unless you want them published in the proceedings. All accepted proposals will be made available in the Association for Computing Machinery (ACM) Digital Library (approval pending). Best papers, after further reviews, will be considered to be book chapters or journal articles in a renowned journal. The session materials go on the C++ Now website and will be available to attendees. For general information on the C++ Now 2014 paper submission or the scope of technical papers solicited; please refer to the conference website at www.cppnow.org. For any other questions about the submission process or paper format, please contact the Program Committee at cppnow2014(a)easychair.com. If you have any technical problems with EasyChair, please contact EasyChair for help. Note: Presenters must agree to grant a non-exclusive perpetual license to publish submitted materials, either electronically or in print, in any media related to C++ Now. Hartmut Kaiser, email: hartmut.kaiser(a)gmail.com (Program Committee Chair) Joel Falcou, email: joel.falcou(a)lri.fr (Program Committee Chair) Jon Kalb, email: dave(a)boostpro.com (Conference Chair) On behalf of the conference organizers

1 0

[modularization] Trying it out doesn't quite work?
by John Maddock 20 Oct '13

20 Oct '13

OK I'm following https://svn.boost.org/trac/boost/wiki/TryModBoost Git clone proceeds OK, and I seem to have everything I should have, likewise bootstrapping b2 proceeds OK. But: b2 headers does nothing at all. Trying: b2 --with-regex results in all the expected compile errors 'cos the headers aren't found. What gives? Thanks, John. PS this is on Windows Vista.

2 1

[modularization] What do we do with "glue" headers?
by John Maddock 20 Oct '13

20 Oct '13

Trying to get this discussion somewhat back on track... There are many libraries in Boost that have "glue" headers: by this I mean small headers that allow library A to interoperate with library B. Often these are simply specializations of traits classes or function overloads, are relatively trivial, and are not included unless you need them to be. By this I mean that: suppose library B wants to interoperate with lib A. It defines a special header which #includes what it needs from lib A and defines whatever specializations are required to get the two libraries working together. Now here's the thing: there is no dependency from lib B to lib A *unless you are already using both libraries*. A good example would be the serialization lib: a simple dependency tracker would show this up as a dependency to a large part of Boost, but in fact that's not true: in the vast majority of those cases there is no such dependency unless you actually want to use both libraries together and do so by including the "glue" header. So where does the glue header belong? In most cases if you want B to interoperate with A then you define a header which: * Includes headers from both libraries. * Uses the public interface of A, but may access the internals of B (think serialization). Which would imply that the header belongs with B. Pure and simple. Except it's not, because these two libraries may be peers, and interoperability may be more complex than simply unidirectional. I don't have an answer here, but it seems to me that "dependency" is a more complex thing than simply what-includes-what (and that's without getting into header file, vs source file, vs test file dependencies). Cheers, John.

9 15

[multi_index] problems with initializer lists in Intel 14.0 for Linux
by Joaquin M Lopez Munoz 20 Oct '13

20 Oct '13

Hi, I'm having here the same problems as described for Visual Studio 2013, only in an amplified way: http://tinyurl.com/pclssoe http://tinyurl.com/nzwzpu6 Any clue much appreciated. Joaquín M López Muñoz Telefónica Digital

1 0

[multi_index] problems with initializer lists in Visual Studio 2013
by Joaquin M Lopez Munoz 20 Oct '13

20 Oct '13

I think this is related to the similar problem just discussed in connection with Boost.Unordered with the same compiler. The following struct employee { employee(int id_,std::string name_,int age_,int ssn_); // ... }; employee_set es8({{0,"Rose",40,4512},{1,"Mary",38,3345}, {2,"Jo",25,7102}}); gives me (see http://tinyurl.com/pg4fsln ) ..\libs\multi_index\test\test_copy_assignment.cpp(159) : error C2440: 'initializing' : cannot convert from 'initializer-list' to 'boost::multi_index::multi_index_container<[...]>' No constructor could take the source type, or constructor overload resolution was ambiguous and this es9={{0,"Rose",40,4512},{1,"Mary",38,3345},{2,"Jo",25,7102}, {0,"Rose",40,4512}}; results in ..\libs\multi_index\test\test_copy_assignment.cpp(162) : error C2593: 'operator =' is ambiguous D:\teeks99-10\boost\boost/multi_index_container.hpp(329): could be 'boost::multi_index::multi_index_container<[...]> &boost::multi_index::multi_index_container<[...]>::operator= (std::initializer_list<employee>)' D:\teeks99-10\boost\boost/multi_index_container.hpp(321): or 'boost::multi_index::multi_index_container<[...]> &boost::multi_index::multi_index_container<[...]>::operator = (boost::multi_index::multi_index_container<[...]> &&)' D:\teeks99-10\boost\boost/multi_index_container.hpp(313): or 'boost::multi_index::multi_index_container<[...]> &boost::multi_index::multi_index_container<[...]>::operator = (const boost::multi_index::multi_index_container<[...]> &)' while trying to match the argument list '(employee_set, initializer-list)' Is this the compiler's fault or mine? Any applicable library-side workarond? Thank you, Joaquín M López Muñoz Telefónica Digital

1 0

Password Reminder Troubles
by Olaf van der Spek 19 Oct '13

19 Oct '13

Hi, The mailing list password reminder doesn't seem to work for me @ olafvdspek(a)gmail.com and ml(a)vdspek.org. Is there a known issue (sending mail to gmail)? Olaf

2 2

[Serialization] How to retrieve a class version in an archive without loading?
by nico 18 Oct '13

18 Oct '13

Hello. My question is about program rollback and the management of archive compatibility : let's say I saved on object of type T with my program in version 1.35 => archive.txt. If I roll back my program to a previous version (let say 1.30), I'd like to check (without trying to deserialize for performance issue) if T in 1.30 has the same "BOOST_CLASS_VERSION" as the object saved in archive.txt. *In brief : is there a way to retrieve the BOOST_CLASS_VERSION of T stored in the archive ?* I read boost code, but I didn't find a "quite direct" way to do that. It seems I must get cobject_id_vector of basic_iarchive_impl, but all this stuff is private. Is their another non-intrusive way to do it ? (By non-intrusive I mean : only using the boost public stuff, or at least with a simple inheritance to get protected member of base classes?). Thanks in advance. nicolas.

2 1

Re: [boost] Boost Serialization on Sun Solaris with rwtools7_std
by Brian Wood 18 Oct '13

18 Oct '13

From: Duc Tran: > That's not all errors, still have many. > Unfortunately, my company is unable to sponsor it. I have to do it myself. > Do you have any suggestions? I have alternative serialization approach. Unlike traditional library approach most of the code only runs on one platform as an on line code generator. I believe this makes porting to other platforms simpler than traditional approach. I'm willing to port my software to Solaris if you are interested. It should be easy. It would be nice to have someone to ask about Solaris install/admin questions. Additionally I'm willing to donate 15 hours/week for six months on a project that uses my software. -- Brian Ebenezer Enterprises http://webEbenezer.net

2 1

[mpi][type_traits] BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION macro missing
by Jeremiah Willcock 17 Oct '13

17 Oct '13

This macro was used in Boost.MPI, and it seems to no longer be defined in the Boost trunk, leading to compiler errors. Was it removed on purpose, and what should be done with the call to it in <boost/mpi/packed_iarchive.hpp>? -- Jeremiah Willcock

2 5

Extensive interdependencies in Boost
by Philip Bennefall 17 Oct '13

17 Oct '13

Hi all, I have been doing some tests with bcp recently, and the number of files I get for even the smallest header-only libraries (at least on the surface) is quite surprising to me. I know that not all files are used for compilation on a given platform, but I would still like to avoid putting 1253 files (11.7 MB) in my source tree just because I use a tiny part of Boost (boost/unordered_map.hpp in this case). I am wondering, will the effort that I have been reading about to modularize Boost, attempt to reduce some of these interdependencies? Or is the idea more about reducing the download size of the Boost distribution itself? Thanks in advance for any clarification. Kind regards, Philip Bennefall

3 3

[Correction] Extensive interdependencies in Boost
by Philip Bennefall 17 Oct '13

17 Oct '13

I'd like to correct some numbers in my recent post. I was looking at a directory containing the Boost files that had been put in a GIT repository so it had some files in it that were related to that. The true numbers are 1239 files (11.6 MB) when using bcp on boost/unordered_map.hpp. Sorry about the carelessness. Kind regards, Philip Bennefall

1 0

Contributing to boost
by Cosmin Boaca 17 Oct '13

17 Oct '13

Hi, My name is Cosmin Boaca and i would like to contribute to boost. I have contributed to some other open-source projects before and i have some C++ programming experience. I have no prior experience with boost. Can you give me some tips about what should i do first ? Thanks, Cosmin Boaca

4 3

Boost Serialization on Sun Solaris with rwtools7_std
by Duc Tran 17 Oct '13

17 Oct '13

Hi All, My project is using rwtools7_std library on Sun Solaris. However, Boos Serialization needs stlport4 and these two libraries cannot work together. Does anyone use Boost on Sun Solaris with rwtools7_std before? Can I change Boost library to use rwtools7_std instead of stlport4? The reason is my project has to use rwtools7_std. Thank you. Dennis

2 7

[regression test][IBM_Canada_Ltd] Regression tester stuck at rev 86223
by Joaquin M Lopez Munoz 16 Oct '13

16 Oct '13

Hi, a heads up: IBM_Canada_Ltd is cycling regulrly, but seems to be stuck at rev 86223, dating from Oct 9. Best, Joaquín M López Muñoz Telefónica Digital

1 0

GSoC 2014
by Sumol Lodha 16 Oct '13

16 Oct '13

Hi, My name is Sumol. I'm a 3rd year Computer Science student. I am new to Open Source Development and want to explore and experience it. I am interested to work for Boost in GSoC 2014. Seeing last year GSoC projects of BOOST I would be really interested in working projects related to maths and computing. Any pointers on how should I go about it ? Thanks, Sumol

4 4

Is there interest in a library for object (especially STL object) marshalling?
by Roger Sanders 16 Oct '13

16 Oct '13

Hi there, I'm not totally sure if this is the right "fit" for boost or not. Perhaps this problem isn't general or abstract enough to warrant inclusion within boost, but I thought I'd send an email around to see what people thought. I've written a library that I've been using extensively, both for my own code, and more recently for a large project in my work, that allows STL objects to easily be exchanged over a function call, even if the caller and the target function represent those STL objects using incompatible binary layouts. This is intended in particular to deal with the common problem of sharing STL objects between multiple compiled assemblies, such as a main executable and satellite DLL's. I'm already using this library extensively to exchange STL objects over pure virtual interfaces for a plugin-based application. The traditional advice people give is "don't use STL objects across DLL boundaries", but this is impractical for applications that are heavily modularized, or plugin-based applications with complex interfaces. Dealing with raw arrays and pointers is often difficult and error-prone, hence why we have STL containers to begin with. Returning data from a function call can also become extremely difficult when STL containers aren't used. With an array for example, if the total number of elements cannot be known by the caller, this can lead to fixed-sized buffers being used with hard-coded maximums, or functions requiring multiple calls, either to determine the size of the data, or to free an allocated buffer that's been returned. Attempting to use STL containers across assembly boundaries without addressing STL compatibility issues however basically requires you to use the exact same compiler version and compiler flags when building each assembly, which is not really possible with a plugin system designed to allow third-party plugins, or even simply with assemblies built at different times on different systems, and it's also inconvenient for development, since you can't easily compile just one assembly with debug compiler settings, while leaving the other assemblies compiled with release compiler settings. Ideally, you want the same signature for a function or method, whether the target code is contained within the same assembly or not. The goal is to make these assembly boundaries "invisible", so you can just write the same code to access functions, regardless of where the code for the target function is located. With the help of this library, along with a simple inline wrapper function which the caller is basically unaware of, that can be achieved, and existing code which makes use of STL objects can be shifted into separate assemblies without refactoring. I haven't found another library like this in the public domain, that attempts to solve this issue comprehensively for any type. Some of the points about my current library implementation are as follows: -Fully template based, with all code defined in header files. -Support for all *primary (see exclusions below) STL container types up to C++11, including strings and keyed containers. -Supports infinite nesting of STL container types, IE: std::vector<std::list<std::map<std::wstring, std::stack<unsigned int>>>> -Heavily optimized, with profiled performance comparable to the best possible hand-written marshalling code. -Extensible, so new STL container types, or boost container types for example, and potentially user-defined types, can be supported and marshalled in a consistent manner, even when nested within each other. *The only three containers I'm aware of that I haven't supported yet are std::pair, std::tuple, and std::bitset, although I can include support for them easily enough. Although difficult, I can also think of how to add support for pointer types such as std::shared_ptr, where object lifetime and destruction can be correctly and automatically managed across assemblies when these types are marshalled. The only compiler requirement here is that each assembly uses a compatible C++ ABI, or at least, as much as is required to allow calling a virtual member function on an object that was constructed within another assembly. What I wanted to get an idea on is whether there is any interest in having something like this included as part of boost? Perhaps there's enough scope here for a general "marshalling" library, that would address some other similar concerns in the future? There would be a fair amount of work to do in order to "boostify" the library and write the corresponding documentation, but I'd be willing to do it if there was interest. Any feedback, thoughts, criticisms? Thanks, Roger Sanders.

3 4

Re: [boost] Fastest Data-structure maybe from STL or Boost ..!!
by Andrew Hundt 15 Oct '13

15 Oct '13

On Mon, Oct 14, 2013 at 11:22 PM, Sylvain Bougerel < sylvain.bougerel.devel(a)gmail.com> wrote: > > > It's seems you need 2-dimensional sorting, one dimension for data, one > for > time. I have a library that is written for this kind of real-time analysis > in multi-dimension, it has k-d tree containers that are self re-balancing, > with insertion in fractional amortized time. You can check it out here: > http://spatial.sourceforge.net/ > > I've been wanting to propose it for review on boost, but never got around > to do it, cause I believe the documentation is sub-par. How does this compare to the Spatial Indexes in Boost.Geometry? http://www.boost.org/doc/libs/1_54_0/libs/geometry/doc/html/geometry/spatia… Cheers! Andrew Hundt

2 1

Testing clang in Windows using VC++ RTL with Boost libraries
by Edward Diener 15 Oct '13

15 Oct '13

I have been trying to test clang in Windows using the VC++ RTL with Boost libraries but I am unable to do so with the clang toolset in Boost Build. The main reason for this is that clang in the configuration I want to test only takes a subset of the gcc command-line options but the Boost Build clang toolset is for clang on Linux ( or a Unix-like environment on Windows like cygwin or MingW/msys ). I am neither knowledgable enough or willing enough to try to create such a Boost Build toolset myself. So I am going to stop. I wish the clang people and Chandler Carruth best of luck getting it to work for Windows using VC++ RTL.

2 2

[trac] [predef] No `prefef` component in trac
by Michel Morin 15 Oct '13

15 Oct '13

There is no `predef` component, which will be shipped in Boost 1.55, in trac. Thanks, Michel

2 5

[predef] missing file On MacOS 10.7.5.
by Vicente J. Botet Escriba 15 Oct '13

15 Oct '13

Hi, I'm getting this error clang-darwin.compile.c++ ../../../bin.v2/libs/thread/build/clang-darwin-3.2x/debug/link-static/threading-multi/pthread/thread.o In file included from ../../../libs/thread/src/pthread/thread.cpp:33: In file included from ../../../boost/lexical_cast.hpp:156: In file included from ../../../boost/math/special_functions/sign.hpp:18: In file included from ../../../boost/math/special_functions/detail/fp_traits.hpp:27: In file included from ../../../boost/detail/endian.hpp:9: In file included from ../../../boost/predef/detail/endian_compat.h:11: ../../../boost/predef/other/endian.h:61:25: fatal error: 'sys/endian.h' file not found # include <sys/endian.h> ^ On MacOS 10.7.5. Please could this be fixed? Is there a test on the regression test using this file? Best, Vicente

5 15

Fastest Data-structure maybe from STL or Boost ..!!
by Rahul Mathur 15 Oct '13

15 Oct '13

All, I wish to record 1000 real time data which need to be in sorted order. I used STL MAP which sorts using KEYS and than sorted the value using STL VECTOR, the complete scenario give me almost 6ms of time analysis. The TARGET is to achieve almost 1.5 - 2.0 ms. Also, once this data structure is completely filled I want to delete the first data and replace it with the new data. Can I have the fastest data structure (STL or BOOST) techniques for the same. ~ Thanks!!

5 4

[release/atomic] request permission to merge 86144
by Tim Blechmann 15 Oct '13

15 Oct '13

i'd like to merge r86144 into release. it is not exactly a bugfix, but it enables double-width cas support for msvc, which is rather important for many lock-free algorithms to be lockfree with this toolchain (including some configurations of stack/queue of boost.lockfree). thnx, tim

3 8

Boost ASIO - Client Request TCP Help..!!
by Rahul Mathur 14 Oct '13

14 Oct '13

All, Below is the client request code which makes a CONNECT request to remote SERVER (having IP & PORT#) but gives error code during send() process - --- #include <iostream> #include <string> #include <boost/asio.hpp> namespace opp = boost::asio::ip; struct PacketFormat { unsigned short length; //Length int sequenceNumber; }; int main(int argc, char* argv[]) { std::string port = "8000"; std::string hostname = "X.X.X.X"; boost::asio::io_service io_service; opp::tcp::resolver resolver(io_service); opp::tcp::resolver::query query(hostname, port); opp::tcp::resolver::iterator iter = resolver.resolve(query); opp::tcp::resolver::iterator end; // End marker. // Looking for a successful endpoint connection opp::tcp::socket socket(io_service); boost::system::error_code error = boost::asio::error::host_not_found; while (error && iter != end) { socket.close(); socket.connect(*iter++ , error); } if (error) throw boost::system::system_error(error); std::cout << "Connected ..Thanks!! \n" << std::endl; PacketFormat pf; // where PacketFormat is struct defined pf.length = 236; pf.sequenceNumber = 2; std::cout << "Sending Logon Message.. . ..!! \n" << std::endl; std::size_t n = opp::tcp::socket::send(iter, boost::asio::buffer(&pf)); if (n < 0) std::cerr << "ERROR writing to Server .. . ..\n" << std::endl; std::cout << "Logon Message Sent.. . ..Thanks!!\n" << std::endl; if (n < 0) std::cerr << "ERROR writing to Server .. . ..\n" << std::endl; std::cout << "Logon Message Sent.. . ..Thanks!!\n" << std::endl; return 0; } __ The error message obtained is - -- # g++ testclient.cpp -o testclient -lboost_system -lboost_thread testclient.cpp: In function âint main(int, char**)â: testclient.cpp:42: error: no matching function for call to âbuffer(PacketFormat*)â /usr/local/include/boost/asio/buffer.hpp:704: note: candidates are: boost::asio::mutable_buffers_1 boost::asio::buffer(const boost::asio::mutable_buffer&) /usr/local/include/boost/asio/buffer.hpp:717: note: boost::asio::mutable_buffers_1 boost::asio::buffer(const boost::asio::mutable_buffer&, size_t) /usr/local/include/boost/asio/buffer.hpp:733: note: boost::asio::const_buffers_1 boost::asio::buffer(const boost::asio::const_buffer&) /usr/local/include/boost/asio/buffer.hpp:746: note: boost::asio::const_buffers_1 boost::asio::buffer(const boost::asio::const_buffer&, size_t) /usr/local/include/boost/asio/buffer.hpp:762: note: boost::asio::mutable_buffers_1 boost::asio::buffer(void*, size_t) /usr/local/include/boost/asio/buffer.hpp:772: note: boost::asio::const_buffers_1 boost::asio::buffer(const void*, size_t) __ Please help for L#42 "tcp::socket::send()" proper call. I believe above code fine apart from L#42 error. Thanks!!

4 12

Requesting svn access
by Mathias Gaunard 14 Oct '13

14 Oct '13

Hi, There are a couple of warnings generated by unmaintained libraries that I'd like to fix. (In particular https://svn.boost.org/trac/boost/ticket/9115) Would it be possible to have write access so that I can commit these to trunk and then to release?

3 2

[config] Patch for clang.hpp to support clang in Windows using VC++ RTL
by Edward Diener 14 Oct '13

14 Oct '13

Once Boost 1.55 is out the doors can I apply the attached patch for clang when _MSC_VER is defined ? Unfortunately clang in this situation does not currently support the C++11 types char16_t or char32_t ( there is a bug report for this ), and this means trying to compile Boost libraries like type_traits without this patch yields many errors. I would have used the BOOST_WORKAROUND macro but clang does not support a value which gives a single number for the compiler version so I felt that drumming up multiple BOOST_WORKAROUNDs using major/minor/patch version numbers was too much of a hack to bother about.

2 3

Support for BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
by Joaquin M Lopez Munoz 14 Oct '13

14 Oct '13

I understand there's been some discussion about dropping support for compliers with BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION defined. Has some final decision been made about this? Thank you, Joaquín M López Muñoz Telefónica Digital

6 23

[algorithm][array] Inspection report (tabs)
by Michel Morin 14 Oct '13

14 Oct '13

Hi Marshall, An inspection report says that some files contain tabs: ( http://boost.cowic.de/rc/docs-inspect-trunk.html ) algorithm boost/algorithm/cxx14/equal.hpp: *Tab* boost/algorithm/cxx14/mismatch.hpp: *Tab* libs/algorithm/string/doc/external_concepts.html: Unlinked file libs/algorithm/string/test/find_test.cpp: *Tab* libs/algorithm/string/test/split_test.cpp: *Tab* libs/algorithm/test/iterator_test.hpp: *C*, *Lic*, *Tab* array libs/array/doc/Jamfile.v2: *C*, *Lic* libs/array/test/array_constexpr.cpp: *Tab* libs/array/test/array_getfail1.cpp: *Tab* Regards, Michel

1 0

Permission to proceed?
by Stephen Kelly 14 Oct '13

14 Oct '13

Hello, Now that the beta has been out for a while, I'd like to proceed with my clean-up commits in trunk. I'd like to commit the patch in http://thread.gmane.org/gmane.comp.lib.boost.devel/244392/focus=244397 immediately and then proceed to remove the resulting dead code. Can I go ahead and do that? I assume that does not have any effect on the release branch. Thanks, Steve.

6 13

Re: [boost] Improving Documentation
by Andrew Hundt 14 Oct '13

14 Oct '13

On Fri, Oct 11, 2013 at 2:49 PM, Robert Ramey <ramey(a)rrsd.com> wrote: > Mathias Gaunard wrote: > > On 11/10/13 15:31, TONGARI J wrote: > > > >> I think Doxygen is fine for "regular" libraries, but I always have a > >> question: how could a library like Spirit be doucumented with it? > > > > Same as any other library. > > You document the data types and the functions. > > what about the type constraints - aka concepts? > and templates? You can document template parameters with doxygen. If you are using the boost concept check library you can also use those classes to document your concepts. I believe gil does that if you would like an example. You can also always add custom fields fairly easily if none of the existing ones meet you needs. Cheers! Andrew Hundt

5 5

[config][release] Release notes for old compilers.
by Daniel James 14 Oct '13

14 Oct '13

Hi, I added a little release notes for config, and also a note about removing support for older compilers in the future. If this concerns you, please give it a quick check and let me know if you want any changes. This release note is not a promise that future changes will or won't be made, and it can be changed if appropriate. Sorry that this is a bit late. We can still change the release notes after the beta (and final) release, so don't worry about that. thanks, Daniel

5 12

Review request: Require a SFINAE capable compiler
by Stephen Kelly 14 Oct '13

14 Oct '13

Hello, Several of the ancient compilers define BOOST_NO_SFINAE. The attached patch removes support for those versions of the compilers which are not capable of SFINAE. This bumps the compiler requirement to remove support for Borland 5.x, Metrowerks prior to 9.0, and SunPro prior to 5.7. Compilers based on EDG 238 are also affected, though it is unknown what those are. Ok to commit? Thanks, Steve.

6 12

[compiler workaround] Are we purging history?
by Daryle Walker 14 Oct '13

14 Oct '13

As I understand it, the people modernizing Boost code by getting rid of old compiler workarounds are doing two things: 1. Remove the workaround macro flags and the code that uses them, leaving the code that doesn't use the workarounds behind. 2. Purging those workaround macros from Boost.Config. If we are doing [2], why? Doing [1] is sufficient for modernization. Doing [2] is just purging history that we spent blood/sweat/tears generating. Authors/maintainers generally have free reign to use as many or as few workarounds as they want. They can't do that if we're deleting that knowledge from Boost.Config. Daryle W.

3 2

Re: [boost] Improving Documentation
by Andrew Hundt 14 Oct '13

14 Oct '13

On Thu, Oct 10, 2013 at 4:29 PM, Mathias Gaunard < mathias.gaunard(a)ens-lyon.org> wrote: > > Documentation like this is generated by preprocessing Doxygen XML output > to integrate it into Boostbook and have a good look for C++ references. > It has most of what you can expect from Doxygen + the Boostbook stuff > which gives better cross-referencing than simple Doxygen. > > I personally don't understand how one cannot notice that the blue bits > that become underlined when you hover them and change colors once visited > are hyperlinks (especially since that's also true for any other hyperlink > in Boost docs and most of the World Wide Web). > What do you suggest would be better? I believe part of the problem is that everything is blue. For instance, on the boost.lockfree page: http://www.boost.org/doc/libs/1_54_0/doc/html/lockfree/reference.html#heade… - The following words are blue: - namespace, template, bool, struct, capacity, template, typename, allocator, class, fixed_sized, queue, spec_queue, stack - Out of those, the following are links: - fixed_sized, capacity, allocator, queue, spec_queue, stack I believe there is a word to describe the concept of building things such that people expect to interact with them. I think it is called an affordance, so a link should "afford" clicking. https://en.wikipedia.org/wiki/Affordance When it is your first time ever on the site, even if you try to hover over one of the blue words, you may choose one that can't be clicked on, then assume the same applies for the others. IMHO, changing the color of links or making the underlines always visible could be helpful. One possible improvement would be what Mario Mulansky described. In the Table of Contents of libraries the Reference section could contain a list of links to headers, classes, functions, metafunctions, and definitions. Then if you click to the reference link where it currently just lists headers it could also provide the synopsis of the aforementioned items and links to the detailed docs. Right now all of the documentation is an extremely deep hierarchical structure, which if I recall my conventions correctly has been moved away from in modern user experience design. Most websites try to focus on getting you to the information you need in as few clicks as possible. That is why I mentioned cppreference.com in my previous email, if you check out that site nearly everything is 3 levels deep or less. Since boost is so much larger a total of 4 levels with the top one being the list of libraries would make sense. Some link to the libs unit test and/or example folders in each library would also be helpful. These are a couple small, concrete steps that would probably help with browsing but aren't too out there. It doesn't help some of the possibilities for improved text which could also benefit, but it does help many things at a high level. As a side note, I wonder if the boost main page could be better served as a wiki of some sort? Cheers! Andrew Hundt

3 2

[typeof] trunk build broken
by Agustín K-ballo Bergé 12 Oct '13

12 Oct '13

Boost.TypeOf is broken as of revision #85920 due to an invalid preprocessing directive. Patch attached. Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

3 3

Re: [boost] Improving Documentation
by Andrew Hundt 12 Oct '13

12 Oct '13

On Friday, October 11, 2013, Mathias Gaunard wrote: > On 11/10/13 00:07, Andrew Hundt wrote: > > I believe part of the problem is that everything is blue. For instance, on >> the boost.lockfree page: >> >> http://www.boost.org/doc/libs/**1_54_0/doc/html/lockfree/** >> reference.html#header.boost.**lockfree.policies_hpp<http://www.boost.org/doc/libs/1_54_0/doc/html/lockfree/reference.html#heade…> >> >> >> - The following words are blue: >> - namespace, template, bool, struct, capacity, template, typename, >> allocator, class, fixed_sized, queue, spec_queue, stack >> > > It's clearly not the same shade of blue though. The links (capacity, > allocator, fixed, queue, spec_queue, stack) are closer to a greenish blue. > Do they appear difficult to distinguish to you? > > Maybe the color palette could be changed. It isn't just me. I believe two others in this email chain mentioned it took them a while to figure out too, and I have had to explain it to other users who are not on this list. The shades certainly don't "pop" and it could just be more syntax highlighting. There isn't anything distinguishing it a a link when you just look at the page and imagine not already being familiar with this documentation layout. Doxygen and other documentation tools don't really have anything like it. > > Some link to the libs unit test and/or example folders in each library >> would also be helpful. >> > > I agree for examples, but I don't think unit tests should appear in the > documentation. > > They can be obscure test cases that users don't need to worry about. > Yeah, it would be great if everything had micro examples at the bottom of each page but often the only thing that exists is a unit test. While it isn't a great situation it would be better than nothing. Cheers! Andrew Hundt

2 1

[type_traits] Variadic function pointer with __fastcall calling convention
by Edward Diener 12 Oct '13

12 Oct '13

In type_traits/detail/is_function_ptr_tester.hpp there are pointer to function signatures being tested which have the __fastcall calling convention and variadic functions. While MSVC accepts this code clang in Windows, which defines _MSC_VER and _MSC_EXTENSIONS, currently gives an error. The justification for giving an error is that __fastcall is a callee stack cleanup calling convention, so it cannot be used for variadic functions. There is a bug report regarding this in the Bugzilla for llvm at http://llvm.org/bugs/show_bug.cgi?id=12535. Comments have been made to me in e-mail and the clang developer's mailing list that it is a type_traits error to allow this, even for MSVC-emulation code. Of course we can temporarily fix this for clang on Windows, possibly with a BOOST_WORKAROUND solution for clang and see if/how clang eventually addresses the bug report. But I would like some sort of resolution so that clang on Windows can compile type_traits in the current Boost trunk.

3 11

[1.55.0] Beta 1 Available
by Marshall Clow 12 Oct '13

12 Oct '13

Boost release 1.55.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/boost/1.55.0.beta.1/ This release contains 1 new library: * Predef: This library defines a set of compiler, architecture, operating system, library, and other version numbers from the information it can gather of C, C++, Objective C, and Objective C++ predefined macros or those defined in generally available headers, from Rene Rivera. For details of what's in the release, see http://www.boost.org/users/history/version_1_55_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

6 11

results pages not updating
by Michael Mathews 11 Oct '13

11 Oct '13

Neither the trunk nor release results have updated since Wednesday michael

1 0

[1.55][Math] Permission to apply bug fix?
by John Maddock 11 Oct '13

11 Oct '13

Is 1.55 release branch open for bug fixes again? If so I'd like to apply the patch for: https://svn.boost.org/trac/boost/ticket/9183 in https://svn.boost.org/trac/boost/changeset/86205 Many thanks, John.

2 1

Looking for thoughts on a new smart pointer: shared_ptr_nonnull
by Luke Bradford 11 Oct '13

11 Oct '13

Hi, I'm new to this list, so apologies for any oversights or faux pas. I've been finding a lot of use for a type of smart pointer I call shared_ptr_nonnull, which is a variation on shared_ptr which is never allowed to be empty. Specifically: (1) It doesn't have reset() with no arguments, doesn't have a default constructor, and doesn't have implicit conversion to bool (which would always be true.) (2) It throws an exception whenever there's an attempt to make it empty, i.e. in constructors, reset, assignment, and swap. For convenience, it's implicitly convertible to shared_ptr, and I have all of shared_ptr's templated operators implemented with possible combinations of shared_ptr and shared_ptr_nonnull. Usually it can be used just by changing the type of a shared_ptr. We have a lot of shared_ptrs, especially member variables, which are claimed to be "always valid" and this class enforces that, at compile time (1) and runtime (2). Has there been any discussion of something like this? Does anybody have any thoughts, suggestions, criticisms? Who's in charge of the smart pointer library these days? Thanks, Luke

20 113

Review wizards response and Boost reviews
by Edward Diener 11 Oct '13

11 Oct '13

I tried to contact the review wizards via their e-mail addresses to update some information on the Boost Formal Review Schedule page at http://www.boost.org/community/review_schedule.html but have heard nothing in response. I appreciate that they have a hard job to do for which most people would not want the responsibility. But it does seem to me, either by plan or because there appear to be no people willing to act as review managers, that the Boost formal review process has completely bogged down for some time now. Since I am interested in getting my own library reviewed I would like to volunteer to act as a Review Manager for other libraries. I have no particular library in mind but I am pretty knowledgeable and interested in some of the ideas of libraries on the review schedule. I have been a Review Manager for a past library and think I did a pretty good job. At the same time I am looking for a review manager for my Variadic Macro Data library. Unfortunately the link to it on the web page above is wrong. It is now on GitHub at https://github.com/eldiener/variadic_macro_data. Edward Diener

2 4

libs/context/src/asm/make_i386_sysv_elf_gas.S:37: Error: junk at end of line
by Frédéric Bron 11 Oct '13

11 Oct '13

Hello, When building with i686-w64-mingw32 cross compiler, this is what I get: libs/context/src/asm/make_i386_sysv_elf_gas.S: Assembler messages: libs/context/src/asm/make_i386_sysv_elf_gas.S:37: Warning: .type pseudo-op used outside of .def/.endef ignored. libs/context/src/asm/make_i386_sysv_elf_gas.S:37: Error: junk at end of line, first unrecognized character is `m' libs/context/src/asm/make_i386_sysv_elf_gas.S:77: Warning: .size pseudo-op used outside of .def/.endef ignored. libs/context/src/asm/make_i386_sysv_elf_gas.S:77: Error: junk at end of line, first unrecognized character is `m' libs/context/src/asm/make_i386_sysv_elf_gas.S:80: Error: junk at end of line, first unrecognized character is `-' ...failed gcc.compile.asm bin.v2/libs/context/build/gcc-mingw-4.8.1/debug/address-model-32/link-static/target-os-windows/threadapi-win32/threading-multi/asm/make_i386_> What does that mean? Frédéric

2 4

[type_traits] VC++ and vararg function/mmeber functions and varargs
by Edward Diener 10 Oct '13

10 Oct '13

After going back and for with Mr. Lavavej from Microsoft about how VC++ treats functions/member functions which have varargs parameters and calling conventions, I learned that VC++ always treats all these function types as if the calling convention is __cdecl, no matter what the end-user specifies. Therefore attempting to match function and member function types taking varargs, with VC++ and compatibles, by having to specify __cdecl, __fastcall, and __stdcall calling conventions for every function/member function declaration with varargs, is a waste since these are not potential new types being tested by templates but just the same type redeclared. These occur in type_traits/detail files is_mem_fun_pointer_tester.hpp and is_mem_fun_pointer_tester.hpp when BOOST_TT_TEST_MS_FUNC_SIGS ( essentially _MSC_EXTENSIONS) is defined. I would like to remove these redundant declarations from these files. I have made sure that my tests for VC++ pass. I will test Intel C++, if it also emulates VC++ in this way. Can I make the change on trunk to these files once I ascertain that Intel C++ tests with type_traits also pass with this change ? Are there any other VC++ emulation compilers that need to be tested ?

4 11

[BGL] Maximum Weight Matching
by Pablo Madoery 10 Oct '13

10 Oct '13

Hello, We wrote the attached code in c++ using Boost, Blossom V and Guido Shafer Reduction to compute Maximum-Weight-Matching (not necessarily perfect) of a graph. We want to contribute to Boost BGL library. We are not experts in boost BGL library but we think that this code can be improved and used in Boost. We wrote this code becouse we need this algorithm and it wasn't in Boost. Although it is in Lemon Library ( http://lemon.cs.elte.hu/pub/doc/1.2.3/a00537.html) we need other algorithms and functions that are only in Boost. Thank you very much

3 3

Weird Boost 1.55 beta failure on VS2013 RC
by Niall Douglas 10 Oct '13

10 Oct '13

Can someone else confirm that Boost v1.55 beta is not compiling on VS2013 RC? I see lots of this: 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(42): error C2065: 'ReadableIterator' : undeclared identifier 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(42): error C2065: 'Iterator' : undeclared identifier 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(43): error C2448: 'BOOST_concept' : function-style initializer appears to be a function definition 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(43): error C2143: syntax error : missing ';' before ':' 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(43): error C2065: 'Iterator' : undeclared identifier 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(43): error C2923: 'boost::Assignable' : 'Iterator' is not a valid template type argument for parameter 'TT' 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(44): error C2143: syntax error : missing ';' before ',' 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(44): error C2059: syntax error : ',' 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(44): error C2065: 'Iterator' : undeclared identifier 2>G:\TripleGit\boost\boost/iterator/iterator_concepts.hpp(44): error C2923: 'boost::CopyConstructible' : 'Iterator' is not a valid template type argument for parameter 'TT' .... Here is the really weird thing - the macro BOOST_concept appears to not be defined, so if you do a: #ifndef BOOST_concept #error Hello #endif ... you get error Hello. Methinks this is a compiler bug in the RC, but can anyone else confirm? Niall -- Currently unemployed and looking for work. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

2 2

How to center an element in Boost QuickBook?
by Niall Douglas 10 Oct '13

10 Oct '13

As the documentation for proposed Boost.AFIO comes together for this week's GSoC Milestone 1 (feel free to check it out at https://ci.nedprod.com/job/Boost.AFIO%20Build%20Documentation/Boost.AFIO_Doc umentation/?), a problem has emerged. We'd like a matrix table containing ticks and crosses, and building such a thing in QuickBook is easy. However, we'd also like to center the ticks and crosses in each table cell, otherwise it looks poor. Is there some way I haven't realized of aligning content in Boost QuickBook, or even BoostBook itself? The DocBook documentation suggests one can do a '''<entry align="center">'''__tick__'''</entry>''' (the triple single ticks escape from QuickBook into BoostBook). However unfortunately BoostBook defines CSS which overrides the per-cell alignment :( Thanks in advance for the help. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

9 22

Try out a multi-dimensional adapter class template?
by Daryle Walker 10 Oct '13

10 Oct '13

I added a new class template for my library at <https://github.com/CTMacUser/ArrayMD>. It's called "multiarray," and it's an adapter class like stack and queue. But the new interface is only for accessing elements. Besides the element and container types, the template header for the class takes the number of dimensions. The class uses at, operator [] and operator () to access an element. It has methods to read/write the shape of the array and the priority of each index. There are no methods to change the number of elements stored; you have to either use a fixed-size container or sub-class the multi-array to add methods to change the size. (The container sub-object is protected, like the Standard adapters.) I split the main code into two base class templates, because the code for computing the offset from an index tuple and the code for referencing an element were nearly distinct. This really screws up my attempt at Doxygen comments. Any ideas? Or is my case too complex for what Doxygen's author thought could be handled. Daryle W.

5 9

[tokenizer] Some remarks
by Robert Kawulak 09 Oct '13

09 Oct '13

Hi, I have a few proposals/questions related to boost::tokenizer: - the first template parameter of char_separator and other tokenizer functions could be defaulted to char to save typing and make it consistent with the defaults of tokenizer; - making the constructor of char_separator and other tokenizer functions non-explicit would allow for less verbose construction of a tokenizer; - the docs state that char_delimiters_separator is deprecated in favour of char_separator. Are there any plans to actually drop the former and change the default for the template parameter of tokenizer to the latter? I guess this might be controversial because interfaces and semantics of the two differ, so maybe providing a new template, say string_tokenizer, is a good idea? Combining the first two points, the following: auto t = boost::tokenizer<boost::char_separator<char>>( str, boost::char_separator<char>("-;|")); could be written more conveniently as: auto t = boost::tokenizer<boost::char_separator<>>(str, "-;|"); and adding the third point it would become: auto t = boost::string_tokenizer<>(str, "-;|"); which is IMO a significant improvement. Any thoughts? Best regards, Robert

1 0

[any] Infinite loop in boost::any in boost release 1.54.0 using Visual C++ 2010
by Bo Peng 09 Oct '13

09 Oct '13

This very simple code: #include <boost/any.hpp> #include <string> const boost::any getBoolVal() { return false; } int main() { boost::any vals[] = {1.0, std::string("1m"), getBoolVal()}; } When built using Visual C++ 2010, it will run into a infinite loop: ntdll.dll!_RtlAllocateHeap@12() + 0x8 bytes ntdll.dll!_RtlDebugAllocateHeap@12() + 0x86 bytes ntdll.dll!@RtlpAllocateHeap@20() + 0x1108a bytes ntdll.dll!_RtlAllocateHeap@12() - 0x28d8a bytes msvcr100d.dll!_heap_alloc_base(unsigned int size=44) Line 55 C msvcr100d.dll!_heap_alloc_dbg_impl(unsigned int nSize=8, int nBlockUse=1, const char * szFileName=0x00000000, int nLine=0, int * errno_tmp=0x002a3280) Line 431 + 0x9 bytes C++ msvcr100d.dll!_nh_malloc_dbg_impl(unsigned int nSize=8, int nhFlag=0, int nBlockUse=1, const char * szFileName=0x00000000, int nLine=0, int * errno_tmp=0x002a3280) Line 239 + 0x19 bytes C++ msvcr100d.dll!_nh_malloc_dbg(unsigned int nSize=8, int nhFlag=0, int nBlockUse=1, const char * szFileName=0x00000000, int nLine=0) Line 302 + 0x1d bytes C++ msvcr100d.dll!malloc(unsigned int nSize=8) Line 56 + 0x15 bytes C++ msvcr100d.dll!operator new(unsigned int size=8) Line 59 + 0x9 bytes C++ test.exe!boost::any::any<boost::any const >(const boost::any && value={...}, void * __formal=0x00000000) Line 73 + 0x49 bytes C++ test.exe!boost::any::holder<boost::any const >::holder<boost::any const >(const boost::any && value={...}) Line 177 C++ ... test.exe!boost::any::any<boost::any const >(const boost::any && value={...}, void * __formal=0x00000000) Line 73 + 0x71 bytes C++ test.exe!boost::any::holder<boost::any const >::holder<boost::any const >(const boost::any && value={...}) Line 177 C++ test.exe!boost::any::any<boost::any const >(const boost::any && value={...}, void * __formal=0x00000000) Line 73 + 0x71 bytes C++ test.exe!boost::any::holder<boost::any const >::holder<boost::any const >(const boost::any && value={...}) Line 177 C++ test.exe!boost::any::any<boost::any const >(const boost::any && value={...}, void * __formal=0x00000000) Line 73 + 0x71 bytes C++ test.exe!boost::any::holder<boost::any const >::holder<boost::any const >(const boost::any && value={...}) Line 177 C++ > test.exe!boost::any::any<boost::any const >(const boost::any && value={...}, void * __formal=0x00000000) Line 73 + 0x71 bytes C++ test.exe!main() Line 11 + 0x9c bytes C++ Sorry I don't know enough of the c++ standard to figure out whether it is because of Visual C++ or it is because of boost. But I think it is worth to raise it to the experts out here. Thanks Bo ---- http://www.pengbo.me

3 3

[Boost.extension] Current Status
by Sean Farrow 08 Oct '13

08 Oct '13

Hi, Does anybody know what the current status of the boost.extension library is, it's not been updated since 2008. Any help appreciated. Regards Sean.

2 1

[website][getting started] Linking to binaries
by Daniel James 08 Oct '13

08 Oct '13

On 8 October 2013 15:58, Tom Kent <lists(a)teeks99.com> wrote: > > The corresponding windows binaries for msvc-8.0, msvc-9.0, msvc-10.0, and > msvc-11.0 in 32 & 64 bit versions are now also available from sourceforge. > > https://sourceforge.net/projects/boost/files/boost-binaries/1.55.0_beta1/ We should probably link to binaries from the website somewhere. If not in the release notes, maybe there should be some information about alternative downloads on the download page. Any opinions? Also for other platforms? (e.g. debian packages). The getting started guide used to mention the old binaries, you can see what was removed at: https://svn.boost.org/trac/boost/changeset/82893/trunk/more/getting_started… We could put back something like that. Especially if anyone fancies writing it? I don't use windows much so I'm not the best person.

1 0

[graph] porting code from 1.46 to 1.54
by Maurizio Vitale 08 Oct '13

08 Oct '13

Hello boost, I'm trying to move some large code base to use boost 1.54. In some dark corner of it, the following was compiling fine: class Instance; typedef boost::setS OutEdgeList; typedef boost::listS VertexList; struct InstancePropertyTag { typedef boost::vertex_property_tag kind; }; typedef boost::property<InstancePropertyTag, Instance*> InstanceProperty; typedef boost::adjacency_list<OutEdgeList, VertexList, boost::bidirectionalS, InstanceProperty> Graph; typedef boost::property_map<Graph, boost::vertex_index_t>::type IndexGraph; under 1.54, I get 'attempt to form reference to void', but everything was fine under 1.46. I traced it a bit through template expansion, and the problem seems to be that the type for vertex_index_t is not found. The following declaration for InstanceProperty fixes (or hides) the problem: typedef boost::property<InstancePropertyTag, Instance*, boost::property<boost::vertex_index_t, int> > InstanceProperty; Does somebody know if some properties were added by default to graphs before and need to be explicitly added now? I don't find anything in the documentation and all examples I've found seem to imply that one wouldn't need to explicitly add a property declaration of vertex_index_t. Thanks a lot, Maurizio

3 4

[1.55.0] Release branch now open
by Marshall Clow 08 Oct '13

08 Oct '13

The release branch is now open for bug fixes and doc updates, without need to ask for a release manager's permission. It will remain open until Monday, October 28th. The 1.55.0 release is scheduled for November 4th. -- Marshall

1 0

[1.55.0] Release Notes
by Daniel James 08 Oct '13

08 Oct '13

Hello, If you haven't already, can you write your release notes for 1.55? You can send them to me, or add them yourself at: http://svn.boost.org/svn/boost/website/public_html/live/feed/history/ They're on the website at: http://www.boost.org/users/history/version_1_55_0.html thanks, Daniel

12 24

Boost.Application : Request for comments : Article / Thread Pool / Other Features / Documentation
by Renato Forti 08 Oct '13

08 Oct '13

Hi All, In this email I would like to discuss some areas of Boost.Application. 01) Thread Pool functionality One of the most recurring requests is that Boost.Application should provide Thread Pool functionality. A flexible Thread Pool can be a complex thing, need provide schedule polices, grow/reduce polices, Shutdown policies, deadline s and many others, and then I think that this feature devotes your own Boost library. The Boost.Application can be integrated easily with one Thread Pool provided by third parties, or the user can make one "specific" (Not flexible/Complex) to your needs, e.g.: I make a simple work queue model using Boost.Asio and Boost.Thread that I plug on Boost.Application, see these tutorial: * Creating a Work Queue (Thread Pool) Application Using Boost.Asio, Boost.Thread and Boost.Application http://www.codeproject.com/Articles/664709/Creating-a-Work-Queue-Thread-Pool -Application-Usin My question is: The boost users think that Boost.Application must provide a complex Thread Pool to be accepted? 02) Ideas (new features) So far these are the ideas proposed to improve Boost.Application: http://www.dokfile.com/appbeta3/docs/libs/application/doc/html/application/f uture.html What functionality do you think should already be included in the first release, and not only in future versions? (Please mention here!) If you have any other ideas, (or improvement of current list) please post here so that I can update the "TODO" session. 03) Articles About "Boost.Application" I published other articles about "Boost.Application" on Code Project Website. Code Project Tutorials * Create a Windows Service Application http://www.codeproject.com/Articles/662221/Create-a-Windows-Service-Applicat ion-Using-the-Boo 04) Documentation Feedback Also, the library documentation was updated. If someone can take a look! Please, tell me if this is a little more understandable. * On-Line Documentation http://www.dokfile.com/appbeta3/docs/libs/application/doc/html/index.html 05) Boost.Application Resources [Other Boost.Application Resources] * Download Last Version https://sourceforge.net/projects/boostapp/ Note that the latest version is (10/07/2013): Boost.Application_beta_3a_release_5.zip (1.4 MB) * Please Write a Review https://sourceforge.net/projects/boostapp/reviews Please send comments. (Specify if you think if the library should be accepted as part of boost) Thank you very much! -- Renato

4 6

1.55.0 beta 1 release candidates available for testing
by Marshall Clow 08 Oct '13

08 Oct '13

Release candidate files for 1.55.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: 9fa020efb06f5485628c646451b927c6 *boost_1_55_0b1_rc1.tar.gz 02d26b038ac96f19c3478d0c45a63c9b *boost_1_55_0b1_rc1.tar.bz2 de5f7d60b2387c4fe3d03eb327f095a9 *boost_1_55_0b1_rc1.zip 7deb9063846873452e6ec6918cb75a87 *boost_1_55_0b1_rc1.7z Thanks, --The release managers

7 13

Boost result_of maintainer
by Daniel Walker 07 Oct '13

07 Oct '13

Hi all, I have been the maintainer of boost::result_of since Doug Gregor handed it over to me a few years ago, but my circumstances are changing, and I'm afraid it's time for me to hand the library over to someone else. Any volunteers? - Daniel

3 5

boost 153 interprocess_mutex much slower in windows 7 than xp?
by Noll, Jeffrey T UTAS 07 Oct '13

07 Oct '13

We have 3 processes that are synchronized with an interprocess mutex. Basically one of them has a multiplier which allows the others to run at a synchronized accelerated rate. Under XP we typically can get it to run at 5000 times realtime. New desktop refreshes are coming out running Windows 7 and the same code with faster machines with more memory are maxing out at 250 times with 95%+ cpu idle time. Am new to boost so am wondering if we're doing something wrong. Here's the crux of the code. 3 processes and some shared memory. Share memory defines struct ds_control_sync { boost::interprocess::interprocess_mutex mutex; //Mutex to protect access to the queue boost::interprocess::interprocess_condition cond_running; //Condition to wait when the control software is running boost::interprocess::interprocess_condition cond_timestep; //Condition to wait until the control software is to run again }; struct ds_plant_sync { boost::interprocess::interprocess_mutex mutex; //Mutex to protect access to the queue boost::interprocess::interprocess_condition cond_running; //Condition to wait when the plant software is running boost::interprocess::interprocess_condition cond_timestep; //Condition to wait until the plant software is to run again }; Control process has a thread that waits for a signal to run once. DWORD __stdcall Control_Sync (LPVOID) { scoped_lock<interprocess_mutex> lock(sm_control_sync->mutex); while (1) { sm_control_sync->cond_running.notify_one(); sm_control_sync->cond_timestep.wait(lock); ns_common::TimeProfile_Periodic (&sm_io->status.control_sync, &sync_first, &sync_time); Control_PWM (); if (control_run) { Control_Run (); control_run = FALSE; } else { control_run = TRUE; } ns_common::TimeProfile_Execution (&sm_io->status.control_sync, &sync_first, &sync_time); } } Plant process has the same sort of thing DWORD __stdcall Plant_Sync (LPVOID) { scoped_lock<interprocess_mutex> lock(sm_plant_sync->mutex); while (1) { sm_plant_sync->cond_running.notify_one(); sm_plant_sync->cond_timestep.wait(lock); ns_common::TimeProfile_Periodic (&sm_io->status.plant_sync, &sync_first, &sync_time); Plant_Run (); ns_common::TimeProfile_Execution (&sm_io->status.plant_sync, &sync_first, &sync_time); } } And then main process counts down a multiplier to increase it's run rate. In this case 10000X boost::interprocess::scoped_lock<boost::interprocess::interprocess_mutex> plant_lock(plant_sync.mutex); boost::interprocess::scoped_lock<boost::interprocess::interprocess_mutex> control_lock(control_sync.mutex); mult = 10000; if(mult > 1) { iterations = 0; while(mult-- > 0) { plant_sync.cond_timestep.notify_one(); control_sync.cond_timestep.notify_one(); plant_sync.cond_running.wait(plant_lock); control_sync.cond_running.wait(control_lock); iterations++; } } Works great under XP, our new Windows 7 desktops it are dog slow by a factor of around 50. Any ideas why this would be? Thanks! Jeffrey Noll Software Engineer (860)654-6378 CONFIDENTIALITY WARNING: This email may contain privileged or confidential information and is for the sole use of the inteded recipients. Unauthorized disclosure or use of this communication is prohibited. If you believe that you have received this email in error, please notify the sender immediately and delete it from your system.

5 5

Re: [boost] boost 153 interprocess_mutex much slower in windows 7 than xp?
by jim＠jc-bell.com 07 Oct '13

07 Oct '13

> We have 3 processes that are synchronized with an interprocess mutex. > Basically one of them has a multiplier which allows the others to run at a > synchronized accelerated rate. Under XP we typically can get it to run at > 5000 times realtime. New desktop refreshes are coming out running Windows > 7 and the same code with faster machines with more memory are maxing out > at 250 times with 95%+ cpu idle time. > > Am new to boost so am wondering if we're doing something wrong. Here's the > crux of the code. 3 processes and some shared memory. > ... It might be hitting the disk when it shouldn't be. Try pointing SysInternals' ProcMon at each and see if one's doing file accesses where the other isn't. (SysInternals.com.)

1 0

[interest] rich-typed smart pointers
by Julian Gonggrijp 07 Oct '13

07 Oct '13

Dear Boost members, I have designed a smart pointer that relies on the type system to offer safe and flexible automatic memory management at no runtime cost. It combines single ownership as in std::unique_ptr and reliable access from multiple places as in std::shared_ptr with some additional features. I believe it to be about as safe and practically useful as a smart pointer in C++11 could get. Further explanation and a proof-of-concept implementation is available over here: https://github.com/jgonggrijp/rich-typed-pointers There is no license yet, but you have my explicit permission to try the library and the example programs at your own risk. :-) Could this library be useful addition to Boost? I look forward to your comments. Thanks in advance, -Julian PS: a possible minor seed for discussion is the current lack of an implicit cast to bool. I agree with Jeff Flinn's argument why the implicit cast may be desirable [1]. However, it interferes with the comparison operators when one of the operands should be implicitly cast to weak_ptr, as explained in [2]. I could repeat myself and write comparison functions for all possible overloads, but this seems inelegant. [1] http://boost.2283326.n4.nabble.com/Looking-for-thoughts-on-a-new-smart-poin… [2] https://github.com/jgonggrijp/rich-typed-pointers/commit/89fcf2821cb39bbb9f…

5 24

[utility][enable_if]Fiddly function lookup failure on msvc11
by 山本賢一 07 Oct '13

07 Oct '13

Hi, I found a part of my code failed to compile with boost::enable_if_c when I was porting my code for msvc11 (Visual Studio 2012). The original code was bit too complex but I simplified it to boil down the issue. The simplified code is eventually like this: #include <boost/mpl/bool.hpp> #include <boost/mpl/not.hpp> #include <boost/utility/enable_if.hpp> template <class T> struct always_true : boost::mpl::true_ { }; template <class T> inline typename boost::enable_if_c< !boost::mpl::not_< always_true<T> // Argument of boost::mpl::not_ >::type::value // Refer the result of boost::mpl::not_ , int >::type get_one(T) { return 1; } void test() { get_one('a'); // Compile fails at this line with error C2893 } msvc11 fails to resolve the call to get_one() but I believe the code is definitely correct. With some more extra test, I found: (1)The same code compiles on msvc10 (Visual Studio 2010) and msvc9 (Visual Studio 2008). (2)If I changed the line I commented "//Argument of boost::mpl::not_" to "boost::mpl::true_", the code compiled on msvc11. template <class T> inline typename boost::enable_if_c< !boost::mpl::not_< boost::mpl::true_ // *** Argument of boost::mpl::not_ >::type::value // Refer the result of boost::mpl::not_ , int >::type get_one(T) { return 1; } (3)If changed the line I commented "// Refer the result of boost::mpl::not_" to ">::value", the code compiled on msvc11. template <class T> inline typename boost::enable_if_c< !boost::mpl::not_< always_true<T> // Argument of boost::mpl::not_ >::value // *** Refer the result of boost::mpl::not_ , int >::type get_one(T) { return 1; } The issue seems to be rather a compiler quirk of msvc11 than a enable_if's problem, but I posted the issue here because we need a workaround to avoid it (on msvc11) when we use enable_if. Please let me know if you have any idea about the issue. Thanks. Yamamoto

3 3

[algorithm] documentation mistakes in 'equal' and 'mismatch'
by Takatoshi Kondo 06 Oct '13

06 Oct '13

Hi, Marshall IIUC, I found some mistakes in the documentation of 'equal' and 'mismatch'. http://www.boost.org/doc/libs/1_54_0/libs/algorithm/doc/html/algorithm/CXX1… http://www.boost.org/doc/libs/1_54_0/libs/algorithm/doc/html/the_boost_algo… In the first code block, auto seq1 = { 0, 1, 2 }; auto seq2 = { 0, 1, 2, 3, 4 }; std::equal ( seq1.begin (), seq1.end (), seq2.begin ()); // true std::equal ( seq2.begin (), seq2.end (), seq1.begin ()); // Undefined behavior std::equal ( seq1.begin (), seq1.end (), seq1.begin (), seq2.end ()); // false The second seq1.begin() in the last line should be seq2.begin() as follows. std::equal ( seq1.begin (), seq1.end (), seq2.begin (), seq2.end ()); // false Similarly, std::mismatch ( seq1.begin (), seq1.end (), seq1.begin (), seq2.end ()); // <3, 3> should be std::mismatch ( seq1.begin (), seq1.end (), seq2.begin (), seq2.end ()); // <3, 3> Thanks, Takatoshi

2 1

[svn] Server problems?
by Rene Rivera 06 Oct '13

06 Oct '13

I'm getting a persistent error on te SVN server like so: === Froggy:trunk grafik$ svn up Updating '.': svn: E175002: Server sent unexpected return value (413 Request Entity Too Large) in response to REPORT request for '/svn/boost/!svn/vcc/default' === Any ideas? Rene -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

2 1

[circular-buffer] Missing images.
by Daniel James 06 Oct '13

06 Oct '13

Hi, I made a change to try to fix some broken links in the circular buffer documentation: https://svn.boost.org/trac/boost/changeset/86174/ You can see the broken links in the inspect report: http://boost.cowic.de/rc/docs-inspect-trunk.html#doc Although hopefully in a couple of hours they'll be gone. But there are still a couple of links to images which I can't find: 'circular_buffer.png' and 'space_optimized.png', did someone forget to check them in? It's probably best not to check them in at 'libs/circular_buffer/doc/html/images', but instead at something like 'libs/circular_buffer/doc/images', that way the images are kept separate from generated documentation. I'll help get the image links right, as it's more tricky than it should be. thanks, Daniel

1 0

[regression] Beagle Bone Black
by Jim Bell 05 Oct '13

05 Oct '13

For anyone interested, Boost regression tests fare pretty well on the $45 Beagle Bone Black (beaglebone.org) Stop by the release regression matrix and check it out (http://www.boost.org/development/tests/release/developer/summary.html) And while you're over there, investigate & fix a regression test failure on your platform: submit a patch and make the matrix a greener place! (See http://www.boost.org/development/bugs.html.) Cheers! -Jim

1 0

[log] logger linking problem
by Tadeusz Jordan 05 Oct '13

05 Oct '13

Hi everyone, I have been using Boost for some time now and really like it. Unfortunately, recently I have bumped into a linker issue when trying to use boost::log, was wondering if anyone has seen this before, or has any insights … thank you very much. The problem is described in the below post. http://stackoverflow.com/questions/18881602/boost-logger-linking-issue -- Sincerely, Tadeusz Jordan Software Engineer at The Broad Institute of MIT and Harvard MS Candidate in CS at Northeastern University This email message and any attachments are confidential and may be privileged. It is intended only for the individual or individuals to whom it is addressed and may not be saved, copied, printed, disclosed or otherwise used by anyone else. If you are not the intended recipient, kindly notify the sender and delete this email and any attachments immediately.

3 11

Re: [boost] [type_traits][function_types] Discard param const qualification, bug or feature?
by Sergey Zhuravlev 05 Oct '13

05 Oct '13

Signature type int(int, const std::string) can be used as parameter for some compiletime algorithm. For example, algorithm that generate new signature type with optimal transfer arguments int (int, const std::string&) or generate signature with all argument references int (int&, const std::string&) Can't use type_traits, function_types at that cases, because const be omitted. This will lead to compiletime error, if function with first signature call function with second signature and use arguments from function with first signature for this call. Signature type void(int, const std::string) can use as types tuple for some compiletime algorithm. Can't use type_traits, function_types, at that case, because const be lost. Signature type void(int, const std::string) can use as parentheses dropper for "types list", e.g. for macro parameter. (int, const std::string) => int, const std::string. Can't use type_traits, function_types, at that case, because const be lost. I think default behavior is correct, but need parameter for change this behavior. At least function_types.

6 16

lots of warning with gcc-4.8.1 + boost-1.54.0
by Neal Becker 04 Oct '13

04 Oct '13

Lots of warnings like this: ./boost/bind/arg.hpp:37:22: warning: typedef ‘T_must_be_placeholder’ locally defined but not used [-Wunused-local-typedefs] when building 1.54.0 with gcc-4.8.1 (fedora f19)

8 9

[log] MSVC 9 build hangs
by Andrey Semashev 04 Oct '13

04 Oct '13

Hi, Many test results for Boost.Log on teeks99-03b-win2008-64on64 [1] show that the build aborts due to timeout. From the test setup description (2 GiB of RAM, 2 CPUs, 4 build jobs) it seems that the problem could be in the insufficient system resources. 4 jobs building Boost.Log can easily exceed 2 gigs of RAM, especially considering some of the memory is reserved by OS and other programs. If there isn't any swap, the build may be just aborting, and if there is, it's probably performing dead slow. And 2 cores might also be too limiting. Could the tester take a look what is happening on that setup? If it's not a resource problem, then I would appreciate any information on the problem. [1] http://www.boost.org/development/tests/trunk/developer/log.html

3 27

[ASIO] Safely shut down timer thread in boost::asio::io_service in Windows DLL
by Bo Peng 03 Oct '13

03 Oct '13

Hi folks, As you might already know, Windows DLL has quite some limitation about what you can do during its loading and unloading. For example, you can't 'join' a thread when unloading a DLL. The consequence of doing that, from my opinion, is quite serious: it will hang the process in a dead lock. I have a Windows DLL, which uses boost::asio::deadline_timer. I found that deadline_timer::async_wait creates a timer thread as a private member of io_service. This thread won't be shut down even if all the timers are cancelled. In the destructor of io_service, 'join' will be called on the thread. In some exceptional situation, users might exit their main function before destructs the io_service inside my DLL, so the destructor is called during the unloading of the DLL, which hangs their process. The following code demonstrates this issue. action.h and action.cpp are the code for the dll, main.cpp are the code for the application which uses the dll. action.h: #pragma once #ifndef _WIN32_WINNT #define _WIN32_WINNT 0x0501 #endif extern "C" __declspec(dllexport) void start(); extern "C" __declspec(dllexport) void stop(); action.cpp: #include "action.h" #include <boost/asio.hpp> #include <boost/bind.hpp> #include <boost/shared_ptr.hpp> #include <boost/thread.hpp> class Action { public: Action() : ios_(), timer_(ios_, boost::posix_time::seconds(1)), worker_() { } void start() { worker_.reset(new boost::thread(boost::bind(&Action::startEntry, this))); } void stop() { if (worker_) { ios_.post(boost::bind(&Action::stopEntry, this)); worker_->join(); worker_.reset(); } } private: void startEntry() { timer_.async_wait(boost::bind(&Action::timerHandler, this, _1)); ios_.run(); } void stopEntry() { timer_.cancel(); } void timerHandler(const boost::system::error_code& e) { if(e == boost::asio::error::operation_aborted) { std::cout << "Finished." << std::endl; } else { std::cout << "Triggered." << std::endl; timer_.expires_from_now(boost::posix_time::seconds(1)); timer_.async_wait(boost::bind(&Action::timerHandler, this, _1)); } } boost::asio::io_service ios_; boost::asio::deadline_timer timer_; boost::shared_ptr<boost::thread> worker_; }; boost::shared_ptr<Action> action; void start() { action.reset(new Action); action->start(); } void stop() { if (action) { action->stop(); action.reset(); } } main.cpp: #include <iostream> #include <windows.h> int main() { typedef void (__cdecl *PROC)(); HINSTANCE hInstLib = LoadLibrary(TEXT("dll.dll")); if (hInstLib == NULL) { std::cout << "Failed to load dll" << std::endl; return 1; } PROC startProc = reinterpret_cast<PROC>(GetProcAddress(hInstLib, "start")); if (startProc == NULL) { std::cout << "Failed to load start function" << std::endl; return 1; } PROC stopProc = reinterpret_cast<PROC>(GetProcAddress(hInstLib, "stop")); if (startProc == NULL) { std::cout << "Failed to load stop function" << std::endl; return 1; } startProc(); std::cout << "Press any key to exit..." << std::endl; getchar(); //stopProc(); FreeLibrary(hInstLib); return 0; } As you can see, stopProc() is commented out to simulate that the user doesn't have the chance to call the clean up function of my DLL. What I am wondering is, is it possible to shut down the thread whenever there isn't any timer outstanding. Or if I had access to the handle of this thread, I could call TerminateThread, which is allowed even during dll unloading. Regards, Bo

2 2

[graph] ranges used by boost.graph not compatible with c++11 range-based-for
by Nathan Ridge 03 Oct '13

03 Oct '13

>> Sadly, I don't think there s a way of turn an std::pair of iterators into >> a range-based-for-compliant range (see [1]). > > correct me if I'm missing something, but when performing ADL the > namespaces of the template parameters > are in the set of associated namespaces. So, one could simply overload > begin/end in the namespace where > the iterator types are defined ... You're right, a per-namespace solution is possible. I don't think it can be done in general, though (i.e. for all std::pairs of iterators in one stroke). I'm not familiar with BGL - are the iterator types in question defined in a namespace under the library's control, or could they be user-provided types (in which the case the user would have to put the begin()/end() in their own namespace)? Regards, Nate

2 1

[graph] ranges used by boost.graph not compatible with c++11 range-based-for
by Gabriel Redner 03 Oct '13

03 Oct '13

I noticed today that code of this form does not compile: typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Node, Edge> Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; typedef boost::graph_traits<Graph>::edge_descriptor Edge; Graph graph = ...; Vertex vertex = ...; for (Edge edge: boost::out_edges(vertex, graph)) {...} The reason is that out_edges returns a std::pair of iterators. This is a valid range in the sense of boost.range, and so is compatible with BOOST_FOREACH. However, this is not a valid range in the sense of c++11 range-based-for. It's not clear whether this can easily be changed. In a perfect world these functions should probably return something like boost::iterator_range which would be compatible with both boost- and language-level concepts of range-ness. However, the graph documentation explicitly names the return types of out_edges et. al. (see [1]) as std::pairs, which eliminates some wiggle room. Is there an alternate way to address this? -Gabe [1] http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/IncidenceGraph.html

4 4

Heads up: 1.55.0 deadlines approaching
by Marshall Clow 02 Oct '13

02 Oct '13

See the calendar at: http://www.boost.org/development/index.html September 16: 1.55.0 Closed for new libs and breaking changes September 23: 1.55.0 Closed, except bug fixes and doc changes September 30: 1.55.0 Closed, except by permission October 7: 1.55.0 Beta release -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

6 10

[accumulators] Help understanding implementation of weighted accumulators
by Gabriel Redner 02 Oct '13

02 Oct '13

Hi folks, I am trying to implement a weighted accumulator, but I'm having trouble understanding a few things about the existing ones. Looking at the implementation of weighted_sum, I see (weighted_sum.hpp:37): template<typename Args> weighted_sum_impl(Args const &args) : weighted_sum_( args[parameter::keyword<Tag>::get() | Sample()] * numeric::one<Weight>::value ) { } My questions are: - It's taking the first sample from the args and multiplying it by a weight of 1. Isn't this wrong - ignoring the real weight of this sample? Shouldn't this produce incorrect results? - I've never understood anyways how there can be an initial argument during construction of the accumulator. I haven't found any explanation in the docs beyond "Maybe there is an initial value in the argument pack". Maybe? How? Probably more questions later. Thanks, -Gabe

2 4

[thread] semaphore
by Tim Blechmann 02 Oct '13

02 Oct '13

hi all, i've submitted an implementation of semaphores for boost.thread to trac [1]. they provide an interface similar to boost.interprocess semaphores, with the exception of having chrono-style try_wait_for and try_wait_until members for timed_wait. the patch provides the following implementations: * win32 semaphores (tested with windows 8) * posix semaphores (tested with linux) * dispatch semaphores (tested with osx 10.8) * mutex/condition_variable/counter emulation the native implementations are much faster than the fallback, in microbenchmarks with high contention, i've seen a speedup of 30 to 80. would be great if they can be incorporated into boost.thread. comments/suggestions on the API are highly appreciated. cheers, tim [1] https://svn.boost.org/trac/boost/ticket/8797

10 29

Is there interest in a Simulation library?
by Damian Vicino 01 Oct '13

01 Oct '13

Dear All, Following the on-going efforts on development and standardization of C++, especially application-oriented libraries, we are soliciting expression of interest within the C++ community for a new Boost library for building Discrete-Event simulators. We plan to build this new library on the latest features of the C++11 standard, for possible inclusion in a future version of the C++ standard. This work is based on our experience in building C++-based simulators for over 20 years, exploring various optimization and algorithms, and leading to a significant number of reseach publications. Writing a new version of a simulation library based on the latest features of the C++ language has started as new joint research project of University of Nice Sophia Antipolis, UMR CNRS 7172 (FR), INRIA Sophia Antipolis (FR), and Carleton University (CAN). Of course, anyone interested in joined this effort is more than welcome! Damian Vicino, PhD Candidate Université Nice Sophia Antipolis & Carleton University Dr. Olivier Dalle, Maître de Conférences, Université Nice Sophia Antipolis Pr. Gabriel Wainer, Carleton University

5 13

[polygon] Release testing stalled... Missing source file.
by Rene Rivera 01 Oct '13

01 Oct '13

I commented out one of the test cases in the release branch because the source file for the test is non-existent. Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

2 1

testers blocked after changeset 85924 in trunk.
by Vicente J. Botet Escriba 01 Oct '13

01 Oct '13

Hi, the last change set that has been taken in account in trunk regression test is 85924. I'm expecting a lot of testers to cycle. Note that release regressing test are not blocked. Could someone explain what is happening? Best, Vicente

8 12

Review request: Require compiler support for partial template specialization.
by Stephen Kelly 01 Oct '13

01 Oct '13

Hi there, Following from http://thread.gmane.org/gmane.comp.lib.boost.devel/243923/focus=243924 I am posting a more focused and specific request to review a patch to bump compiler requirements to require support for partial template specialization. This allows the removal of a lot of workaround code: src/boost-trunk{master}$ ../kf5/remove_def.py BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION src/boost-trunk{master}$ git diff --shortstat 192 files changed, 4798 deletions(-) Obviously I would not commit all of that as a single patch. Any comments? Thanks, Steve.

4 8

Do/can we have a C++11 variadic integer list?
by Daryle Walker 01 Oct '13

01 Oct '13

I'm talking about this: template < std::size_t ...N > struct indices_too { using next = indices_too<N..., sizeof...(N)>; }; template < std::size_t N > struct make_indices_too { using type = typename make_indices_too<N - 1u>::type::next; }; template < > struct make_indices_too<0u> { using type = indices_too<>; }; I've written things like this 4 times for my prototype Boost classes, and I want it in Boost already so I can just reference that version. Something like it will come in C++14, but we could provide it here for C++11 users? Do we already have one? Here's how to use one: template < typename Function, typename T, class Tuple, std::size_t ...I > void apply_x_and_exploded_tuple_impl( Function &&f, T &&x, Tuple &&t, indices_too<I...> ) { using std::forward; forward<Function>( f )( forward<T>(x), forward<typename std::tuple_element<I, typename std::remove_reference<Tuple>::type>::type>(std::get<I>( t ))... ); } template < typename Function, typename T, class Tuple > void apply_x_and_exploded_tuple( Function &&f, T &&x, Tuple &&t ) { using std::forward; apply_x_and_exploded_tuple_impl( forward<Function>(f), forward<T>(x), forward<Tuple>(t), typename make_indices_too<std::tuple_size<typename std::remove_reference<Tuple>::type>::value>::type{} ); } Daryle W.

3 2

orphaned tickets
by Joel Falcou 01 Oct '13

01 Oct '13

What's the protocol to handle lingering tickets of un maintained components. I wish #9169 and #9170 could be merged to trunk soonish. I cna do it myself but i dont want to breach any protocol. Regards

3 2

REQ: Looking for access to a Haswell machine to test Boost memory transactions code
by Niall Douglas 30 Sep '13

30 Sep '13

Dear Boost Devs, Last night I may have implemented some Boost macro based support for simple memory transactions. Basically one does this: STLLockable lockable; ... BOOST_BEGIN_MEMORY_TRANSACTION(lockable) { // Transaction code } BOOST_END_MEMORY_TRANSACTION(lockable) This can turn into __transaction_relaxed, or Intel TSX falling back onto a spin lock. It's very simple, but it ought to work and with very significant performance improvements on TSX capable hardware. The problem is that I don't have access to an Intel Haswell CPU to test the code upon. I think its design is correct through introspection, but if a kind Boost dev could lend me access to their Haswell machine via SSH - or even just offer to debug some binaries for me, I would be very grateful. Thanks, Niall -- Currently unemployed and looking for work. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

2 2

[release][interprocess] regression in Windows
by Joaquin M Lopez Munoz 30 Sep '13

30 Sep '13

As indicated by the regression testers, see for instance: http://tinyurl.com/qabv7dm This is affecting also Boost.Flyweight, which uses <boost/interprocess/detail/intermodule_singleton.hpp> for its intermodule_holder component. Thank you, Joaquín M López Muñoz Telefónica Digital

2 1

Boost and clang under Windows
by Edward Diener 30 Sep '13

30 Sep '13

First off I am not of course proposing any changes to the upcoming release build of Boost 1.55 for clang under Windows. It turns out that clang under Windows, possibly to support the ability to use Windows header file, becomes another compiler which defines _MSC_VER. I believe the Intel compiler also does this but there may be some others. However clang is a much more strictly conforming to the C++ standard compiler than VC++ and does not have VC++'s quirks. This presents a problem in Boost. The Boost header files have numerous places where testing the macro _MSC_VER produces slightly different behavior based on the fact that the code is being used by VC++ or a compiler with the same behavior as VC++. But clang does not have the same behavior as VC++ despite defining _MSC_VER. Can I go ahead and change some of these situations as necessary to get clang under Windows to work properly with Boost code ? The usual change will be to test not only _MSC_VER but also that __clang__ is not defined for keeping the current implementation which assumes a VC++ compatible compiler with VC++ behavior. I am willing to make those changes in 'trunk' and keep an eye out for any significant failures in unit tests for our current regression tests. I have already made a slight change to Boost PP config.hpp on 'trunk' so that clang for Windows will pass the preprocessor tests. I am willing to work on other changes but I do not want to go ahead and do so if the maintainers of other libraries see any reasons for me not making the changes on 'trunk'. Of course I will test any changes I make locally to make sure they do not affect any other _MSC_VER defined compilers as well as with VC++. But the changes themselves should be fairly simple, just adding a check that __clang__ is not defined as part of the VC++ type behavior. Obviously something like the many tests for _MSC_VER in order to specify #pragma once will not change but some other situations will to exclude clang from the _MSC_VER functionality.

9 20

[clang][Windows] Volunteer for a Boost regression test runner for Clang on Windows
by Beman Dawes 30 Sep '13

30 Sep '13

Chandler Carruth has asked for a volunteer to start running boost regression tests for the Clang on Windows project. For more about this project, see http://blog.llvm.org/2013/09/a-path-forward-for-llvm-toolchain-on.html. Chandler cornered me at the C++ committee meeting last week, and emphasized how much they would like to see boost tests passing using Clang in a Visual Studio environment. This would be a big plus for boost developers and users in the Windows environment IMO, so I hope we can help them out. This project is at an early stage, and many boost tests currently fail, so there is a lot of work to be done. --Beman

4 7

Re: [boost] [scope_exit] D-style scope(failure) and scope(success) in C++
by Sergey Cheban 30 Sep '13

30 Sep '13

On 02.10.2012 16:53, Evgeny Panasyuk wrote: > Currently BOOST_SCOPE_FAILURE and BOOST_SCOPE_SUCCESS are implemented > based on boost_1_51_0/boost/scope_exit.hpp by copy-paste and replace > (just for proof-or-concept, of course it is possible solution with much > less duplication). > Semantically meaningful changes can be viewed as diff at > https://github.com/panaseleus/stack_unwinding/commit/d5513404323490ea99d9b6… Any progress on this? -- Sergey Cheban

5 17

Program Options library and Unicode compliance
by munsingh 30 Sep '13

30 Sep '13

I noticed that the class option_description does not work with wstring, instead works with string. Does anyone has any idea why is it so? Regards, Manish -- May the force be with you

2 1

[clang] How to use CLang for Windows?
by Daryle Walker 30 Sep '13

30 Sep '13

There was a recent conference where the Clang team announced a version of Clang that's supposed to work on Windows (as opposed to kind-of working if you try real hard). It's accessible from the command line if you put Clang in the PATH. I just found out it's supposed to be used from Visual Studio ('10 or '12) after tweaking a project's settings. Can it be used from out BJam system? How will it find right header files to use? (Does it automatically use the ones from MSVC?) Daryle W.

8 36

Code to address the requirement 7(a) of Boost.IOStreams Roadmap
by Gene Panov 29 Sep '13

29 Sep '13

Colleagues, I posted this before, but didn't get answers to some questions so far. I think I possibly addressed the "output" part of requirement 7(a) from the IOStreams Roadmap https://svn.boost.org/trac/boost/wiki/IostreamsRoadmap in this library https://code.google.com/p/async-ostream/ Does it make sense if I create a patch for Boost.IOStreams to add those five files and ask the maintainer (or volunteers) for feedback? Regards, Gene

1 0

[variant] Stalled testing, from missing file.
by Rene Rivera 29 Sep '13

29 Sep '13

Note to the variant maintainers.. I commented out a test which was referring to a non-existent source file. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

3 2

[range][algorithms] How about making the range algorithms pipeable as the range adaptors are?
by Viktor Sehr 28 Sep '13

28 Sep '13

It would be syntactically really nice if the stl-algorithms wrapped in boost range were pipeable, as with the adaptors, making it seamless to combine them in left-to-right statements For non-mutating algorithms I think it's an obvious evolvement const auto& max_pos = some_range | filtered(..) | max_element; const auto& num_elements = some_range | filtered(..) | count(42); ...instead of inside out as it is now const auto& max_pos = max_element(some_range | filtered(..)); const auto& num_elements = count(some_range | filtered(..), 42); For non-mutating algorithms it might not be an obvious solution, as the range beneath is modified, but I still think it should be possible boost::erase(my_vector | sort | unique); ...instead of boost::erase(unique(sort(my_vector)); *Implementation example with std::accumulate:* // Tag to be recognized by the global pipe operatortemplate <typename value_type>struct accumulate_argument_tag { accumulate_argument_tag(const value_type& value) : value_(value) {} const value_type& value_; }; struct accumulate_tag { // Put the regular algorithm as an operator() function where the first argument is the range template <typename range_type, typename value_type> value_type operator()(const range_type& range, const value_type& start) { return std::accumulate(std::begin(range), std::end(range), start); } // If no range is provided, return a tag which contains the argument, which can then be identified by the global pipe operator template <typename value_type> accumulate_argument_tag<value_type> operator()(const value_type& value) { return accumulate_argument_tag<value_type>(value); } };static accumulate_tag accumulate; // Global pipe operator which takes one argumenttemplate <typename range_type, typename value_type>value_type operator|(const range_type& range, const accumulate_argument_tag<value_type>& argument_holder) { return std::accumulate(std::begin(range), std::end(range), argument_holder.value_); } // Global pipe operator which can accept 'accumulate' without any parenthesis// (assuming that std::accumulate can be used without arguments)template <typename range_type>typename range_type::value_type operator|(const range_type& range, const accumulate_tag&) { return std::accumulate(std::begin(range), std::end(range), range_type::value_type(0)); } // Usage std::vector<int> vec;for(size_t i = 0; i < 135; ++i) vec.push_back(i);auto a = accumulate(vec, 0);auto b = vec | accumulate(0);auto c = vec | accumulate; /Viktor

6 10

Borland and metrowerks compiler requirements?
by Stephen Kelly 27 Sep '13

27 Sep '13

Hello, In the work I've done so far on removing ifdefs for obsolete compilers, some compilers which have come up a few times are __BORLANDC__ and __MWERKS__. I have never used either of those compilers. Can old versions of either of them be dropped at this point in boost trunk? Thanks, Steve.

8 29

"Remove obsolete MSVC checks" and _MSC_VER
by Peter Dimov 26 Sep '13

26 Sep '13

One general note about these changes. This: #if defined( _MSC_VER ) && _MSC_VER >= 1310 doesn't mean "compiler is MS VC++ 7.1". It means "compiler claims to support MSVC 7.1's features." Many Windows compilers define _MSC_VER for compatibility. I'm not positive that the removal of the _MSC_VER >= part would break something nowadays, but if it does, this would be why. I'd have left these alone; it's not clear what purpose removing the check is intended to serve, apart from breaking code. Actual MSVC-specific code is guarded by BOOST_MSVC and not _MSC_VER.

3 11

[Container] Memory leak from allocation of 0 sized memory
by Evan Wallace 26 Sep '13

26 Sep '13

I recently tracked down a major memory leak in a system that I am working on to a bug in Boost.Container. The bug is that the following code leaks memory: #include <boost/container/vector.hpp> int main() { while (true) { boost::container::vector<int> vec; boost::container::vector<int> vec2(vec); } } I have submitted a ticket to trac, but since this is a major issue and the release date for 1.55.0 is very soon, I am also posting to the mailing list. https://svn.boost.org/trac/boost/ticket/9166 For reference: the leaked memory is allocated in allocator_version_traits::allocation_command Evan Wallace

2 1

mpl broken after removal of nttp.hpp in 85956
by Jürgen Hunold 26 Sep '13

26 Sep '13

Hi Stephen, the message is: home/hunold/src/devel/boost/boost/mpl/aux_/nttp_decl.hpp:17:42: fatal error: boost/mpl/aux_/config/nttp.hpp: No such file or directory It seems that even nttp_decl.hpp is obsolete, as is only contains: // Obsolete. Remove. # define BOOST_MPL_AUX_NTTP_DECL(T, x) T x /**/ Maybe incomplete quick patch attached. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

2 1

[type_traits][function_types] Discard param const qualification, bug or feature?
by Mostafa 26 Sep '13

26 Sep '13

Both the type_traits and function_types library discard parameter const-qualifiers when decomposing function types. Is this a bug or a feature? If a feature, then it's surprising enough behaviour that I think it warrants some documentation in both libraries. For the record, I'm using gcc 4.7.3 on Cygwin 1.7.22 in Windows 7, and here's a reproducible example of what I'm talking about: #include <boost/type_traits.hpp> #include <boost/function_types/parameter_types.hpp> #include <boost/mpl/at.hpp> #include <boost/mpl/int.hpp> #include <boost/mpl/assert.hpp> using namespace boost; typedef void (foo)(int const); int main() { typedef function_traits<foo>::arg1_type traits_deduced_type; BOOST_MPL_ASSERT(( is_same<traits_deduced_type, int> )); //Errors: //BOOST_MPL_ASSERT(( is_same<traits_deduced_type, int const> )); typedef boost::function_types::parameter_types<foo> ftypes_params; typedef boost::mpl::at<ftypes_params, boost::mpl::int_<0> >::type ftypes_deduced_type; BOOST_MPL_ASSERT(( is_same<ftypes_deduced_type, int> )); //Errors: //BOOST_MPL_ASSERT(( is_same<ftypes_deduced_type, int const> )); return 0; } Mostafa

5 10

Student and Internationaltickets for Meeting C++
by Jens Weller 26 Sep '13

26 Sep '13

Hello boost-community, a short update on the upcoming Meeting C++ Conference. There are 3 different discounts available - Student discount of 200 € - international guests 100 € - boost contributor* 100 / 50 € The discount works over a code, so you need to contact me, in order to be given your discount-code. The discount for boost contributors is 100 €, or additional 50 € if combined with one of the other discounts. More information on the Discounts: http://meetingcpp.com/index.php/newsreader/items/announcing-student-and-int… Meeting C++ 2013 Schedule: http://meetingcpp.com/index.php/schedule13.html General Information on the conf: http://meetingcpp.com/index.php/mcpp2013.html * you should have activly contributed to boost kind regards, Jens Weller

1 0

Re: [boost] Some patches to remove obsolete MSVC version checks
by Stephen Kelly 26 Sep '13

26 Sep '13

On 09/13/2013 01:35 PM, Stephen Kelly wrote: > Hi, > > I've attached patches to remove or simplify some ifdefs for MSVC > versions which are now obsolete. > > This is a followup to this thread: > > http://thread.gmane.org/gmane.comp.lib.boost.devel/243094 > (Removing old config macro and increasing compiler requirements., > 2013-07-29) > > The patches are most easily applied locally and reviewed with a git-svn > checkout and git am. > > I'll also apply to get SVN access so I can commit patches myself. FYI, I've started cherry-picking, re-reviewing and committing these patches. I'll keep the patches small and single-issue. I would appreciate post-commit review from anyone for any of them, as some of the ifdef chains are complex. Thanks, Steve.

2 2

BoostPro closing the doors and needing volunteers
by munsingh 25 Sep '13

25 Sep '13

Hello Boost Maintainers, I observed that BoostPro have closed doors and have made the project open source. I would like to volunteer for maintaining and enhancing the pre-build binaries and sources for boost pre-built installers. Kindly let me know what all is desired from a person who wishes to take up this activity. Thanks & Regards, Manish -- May the force be with you

2 1

VC12 RC: Compiler crash when mixing boost::synchronized_value, Boost.ptree and uniform initialization.
by Klaim - Joël Lamotte 25 Sep '13

25 Sep '13

Just for information, if that can help, I just reported this bug that I can only reproduce using boost::synchronized_value<boost::property_tree::ptree>::operator->() It's obviously a compiler problem but it might help adapting Boost code it if it is not fixed in time for VS2013 release: https://connect.microsoft.com/VisualStudio/feedback/details/802157/compiler… As said in the comments, I didn't find how to reproduce it in a simpler way.

1 0

Re: [boost] [thread] synchronized_value: value and move semantics
by Andrey Semashev 24 Sep '13

24 Sep '13

On Wed, Feb 20, 2013 at 10:02 PM, Vicente J. Botet Escriba < vicente.botet(a)wanadoo.fr> wrote: > > Hi, > > boost::synchronized_value (not released yet [1][2][3]) is based on [4]. > See below part of this paper adapted to the Boost.Thread interface. > > Currently boost::synchronized_value is in addition Copyable and Swappable. > I was wondering if it is worth adding value and move semantics to > synchronized_value. Making it EqualityComparable, LessThanComparable and > Movable if the underlying type satisfy these requirements will allow to > store them on a Boost.Container/C++11 container. > > Do you see something completely wrong with this addition? > Has some of you had a need for this? Could you share the context? > Sorry, I missed this discussion somehow. I've taken a quick look at the interface and have a few questions: 1. Why are there strict_lock_ptr and unique_lock_ptr? What are the differences and why we can't have one such ptr (presumably, unique_lock_ptr)? 2. I find value() and get() a bit confusing, since it is not apparent what is the difference between them. Maybe value() could be renamed to get_ref() or unsafe_get()? 3. Am I correct that having strict_lock_ptr/unique_lock_ptr acquired by calling synchronize() will not deadlock with operator-> when a non-recursive mutex is used?

5 11

Re: [boost] [Boost-users] cross-compilation x86_64-w64-ming32: undefined reference to `InterlockedIncrement'
by Frédéric Bron 24 Sep '13

24 Sep '13

So I eventually managed to fix the issue with interlocked.hpp and mingw-w64: both i686 and x86_64 now work. Attached is a patch against 1.54.0. Is it possible to include this in 1.55.0? Regards, Frédéric

3 17

Is there any interest in a library for application : Boost.Application, new version: Boost.Application_beta_3a_release_2
by Renato Forti 23 Sep '13

23 Sep '13

Hi all, The docs and lib are updated! Please, send your comments. http://www.dokfile.com/appbeta3/docs/libs/application/doc/html/index.html PS: I want to take and ask for help, if any native english speaker can help me with the documentation! Please, contact: re.tf <at> acm.org Thanks

5 8

Referencing Boost.Iostreams in the documentation of a non-boost library
by Gene Panov 23 Sep '13

23 Sep '13

Boost Experts, I am a fan of Boost.Iostreams and I am referencing them several times in the documentation of a little library that I wrote and posted on Google Code under "New BSD license" (https://code.google.com/p/async-ostream/) Do I need to provide a full URL or copyright information or anything else to make such reference to Boost.Iostreams legally sound? Or shall I just switch to use Boost Software License instead to keep it simple? Thanks! Gene

3 2

Functionality for part 7(a) of Boost.IOStreams Roadmap
by Gene Panov 23 Sep '13

23 Sep '13

Boost Experts, I think I possibly addressed the "output" part of requirement 7(a) (Support for asynchronous and non-blocking I/O :: asio compatibility) from the Iostreams Roadmap https://svn.boost.org/trac/boost/wiki/IostreamsRoadmap in this library https://code.google.com/p/async-ostream/ Do you think it addresses that requirement from the roadmap? If yes, does it make sense if I make a patch for Boost.Iostreams to include those five files? Regards, Gene

1 0

[predef] [git] Do the tests need an explicit <dependency>
by Steven Watanabe 22 Sep '13

22 Sep '13

AMDG The property <dependency>$(BOOST_PREDEF_INCLUDE_ROOT)/boost/predef.hpp interferes with testing under the git layout, because this header is generated as part of the build. Is there a reason for it? The dependency should be found by the #include scanner. In Christ, Steven Watanabe

2 1

[config] Visual C++ 2013 RC support - variadic template failures
by Beman Dawes 21 Sep '13

21 Sep '13

I updated boost/config Visual C++ support yesterday to add Visual C++ 2013 RC support. But Mat Berchtold reported that signals2 tests then started to fail. I confirmed that 2013 RC tests were failing for signals2 and several of its dependencies, and narrowed it down to variadic templates so reverted to defining BOOST_NO_CXX11_VARIADIC_TEMPLATES for 2013 RC. --Beman

3 6

[Operators] empty_base should be untemplated?
by Andrew Ho 21 Sep '13

21 Sep '13

I've noticed about the empty_base class is that it's templated with type T, and I don't think it should be. Fyi, the empty_base class is there to turn multiple inheritance into a single inheritance chain (due to compiler deficiencies/object size bloat on at least Visual Studio). I don't see why this empty_base should be templated, and it would be better suited if it wasn't since all I can think it does is make the compiler work harder. Does anyone know why it was templated to begin with? Additionally, are we safe to change empty_base to be not use templates?

4 4

Boost reviews
by Edward Diener 21 Sep '13

21 Sep '13

I have not seen any new reviews of libraries for Boost in a long time. Is this because: * There are very few libraries on the review queue. * There are no people willing to act as review managers for library reviews. * Boost already has so many libraries that an effort has been made to slow down reviews to a great extent. * There is little interest for new Boost libraries in the community of developers who follow Boost. * The transition to git and ryppl is taking precedence before any new libraries will be reviewed. * There are not enough reviewers when a library does have a review in order to decide whether or not a library should be accepted into Boost. Or perhaps some combination of these possibilities. As someone who still would like to see my variadic data library be reviewed for possible acceptance into Boost I am most curious to know the reasons why no new libraries appear to be getting reviewed anymore.

5 7

[multi_index][intel-linux-14.0.0][repost] Help needed debugging initializer list support
by Joaquin M Lopez Munoz 21 Sep '13

21 Sep '13

Hi, Any kind soul can help with this? Reposting: The trunk version of Boost.MultiIndex introduces support for initializer list, which seems to work fine with regression tests except for intel-linux-14.0.0: http://tinyurl.com/pclssoe http://tinyurl.com/nzwzpu6 which spits error messages like this (replaced large chunks of text with *** for clarity): ../libs/multi_index/test/test_modifiers.cpp(230): error: no instance of overloaded function "boost::multi_index::detail::hashed_index<***>::insert [***]" matches the argument list argument types are: ({...}) object type is: employee_set_by_name i1.insert({{4,"Vanessa",20,9236},{5,"Penelope",55,2358}}); At first I thought this is failing because for it to work the compiler should not only support initializer lists but also C++11 unified initialization syntax, but I think this is not the problem because a) intel-linux-14.0.0 does indeed seem to support unified initialization syntax, since BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX is not listed in http://tinyurl.com/ndutn2w . b) the following test code also fails: s.assign({0,1,2,3,4,5}); with s a multi_index_container of ints, and this does not depend on unified initialization syntaxes. The error message here, FWIW, is different than before: ../libs/multi_index/test/test_copy_assignment.cpp(56): internal error: assertion failed: node_has_side_effects: bad node kind (shared/cfe/edgcpfe/il.c, line 20611) The tested code seems simple enough, for instance lines 271 and following of multi_index_container.hpp look like: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) multi_index_container( std::initializer_list<Value> list, const ctor_args_list& args_list=ctor_args_list(), const allocator_type& al=allocator_type()) [...] and the ofending assign member function in sequenced_index.hpp is as innocent as: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void assign(std::initializer_list<value_type> list) { assign(list.begin(),list.end()); } #endif Besides, other libs with initializer list support such as Boost.SmartPtr and Boost.Unordered cope fine with this compiler. Clues? Any help much appreciated. Joaquín M López Muñoz Telefónica Digital

1 0

Policy about non-compliant standard headers
by Andrey Semashev 21 Sep '13

21 Sep '13

Hi, I was reported an issue with Boost.Log which fails to compile with Sun Pro compiler because it has non-compliant standard C headers. I was wondering if there is a policy or recommendation for dealing with this kind of problems. I know there is Boost.Compatibility [1] created exactly for this problem. There are many places I include C headers in my code, so relying on Boost.Compatibility would be an ideal solution for me so I don't have to cripple my code. However, I see that many libraries deal with missing std::C symbols themselves. Why do that and not leave it to Boost.Compatibility? By that I mean require users to add it in include path of the compiler. There is one more point to consider. The issue with the broken standard headers is a sign of an ancient compiler. And if the compiler vendor by 2011 (when Sun Studio 12.3 was released) doesn't manage to ship conforming 1998 headers, I'd still consider it an ancient compiler. Boost recently removed (removing?) support for ancient compilers. So, should I bother supporting this compiler at all? [1] http://www.boost.org/doc/libs/1_54_0/libs/compatibility/

3 7

Boost::Units - mapping from units object to something else
by david.hagood＠gmail.com 21 Sep '13

21 Sep '13

I'm looking at the Boost::Units classes to help eliminate a family of programming errors, but there is one thing that I'm having difficulty with: I have a collection of objects of my own type that pertains to units - these are of a fixed type, with instances per type of unit. I'd like to somehow be able to map from the units constants that Boost uses (e.g. boost:units:si:watts) into my objects (return the correct instance for "watts"). Obviously, there's going to be some hand coding to make that happen - it is unlikely to be possible to generate that mapping automatically. Ideally, what I'd like to do would be to have something like template <typename Unit> struct MyMapper { static const MyUnitInfo info; }; template <> const MyUnitInfo<boost::units::si::watts>::info(/*ctor parms for my type */); and do things like: MyMapper<boost::units::si::watts>::info to get the appropriate structure. However, since all the various Boost units are in a type hierarchy to express dimensionality, I'm at a loss how to compose a template to allow something like that to happen - it certainly isn't as straightforward as the above, since Boost units instances of varying types, not typenames. Likewise, just defining some form of map: std::map<???,MyUnitInfo> mymap = boost::assign::map_list_of (boost::units::si::watts,MyUnitInfo(/* my parms*/)) (boost::units::si::ohms,MyUnitInfo(...)); won't work as the types for the Boost constants are all different as far as I can see. Is there some base type all the Boost::Units constants extend, such that I could test for that?

3 3

Boost.Mock ?
by Mathieu Champlon 21 Sep '13

21 Sep '13

Hello, Would a library for mock objects be of interest ? The documentation can be found here : http://mat007.users.sourceforge.net/boost_mock/ An archive is also available for download there : http://sourceforge.net/projects/mat007.u/files/boost-mock.zip It's been converted from turtle (http://turtle.sourceforge.net/) which was mentioned on the mailing-list a couple of times in the past. There is a catch in that it needs Boost.Test from the release branch and doesn't compile with the trunk. The changes are minimal though and I can provide a patch if anyone is interested. Would the library be worth a review ? In the meanwhile I would be highly interested in any feedback ! Thank you, MAT.

4 4

Is there any interest in a library for application : Boost.Application, new version: Boost.Application_beta_3a
by Renato Forti 20 Sep '13

20 Sep '13

Hi All, I have a new version of Boost.Application! In this release all requested features that boost users suggested (in boost user group) are addressed, based on release 1 and release 2, including: 1) Provide more "Boost Way" interface 2) Use Boost.Parameter to give flexibility for future extensions. 3) Access and change environment variables. 4) Simple class (shared_library) to allow use of dynamic libs as plug-in (extending application). 5) Wide string support (Windows). 6) Use Boost.System on Error Handling 7) Setup module for windows service installation. To install, download file: https://downloads.sourceforge.net/project/boostapp/Boost.Application_beta_3a .zip?r=https%3A%2F%2Fsourceforge.net%2Fprojects%2Fboostapp%2F&ts=1379614495& use_mirror=master or https://sourceforge.net/projects/boostapp/files/ and copy application to your boost installation folder! You don't need build it, the lib is header only, but have some dependences. The documentation is still pretty bad, but it is the right place for you to start with lib! Please, send your questions, to: re.tf(a)acm.org Thanks -- Renato

5 7

[asio] Compilation failures on mingw
by Andrey Semashev 20 Sep '13

20 Sep '13

Hi, I'm seeing test failures on MinGW [1], which are probably caused by commit 85764 [2]. Could this be fixed? [1] <http://www.boost.org/development/tests/trunk/developer/MinGW-32%20jc-bell-c…> [2] <https://svn.boost.org/trac/boost/changeset/85764>

1 0

[multi_index][intel-linux-14.0.0] Help needed debugging initializer list support
by Joaquin M Lopez Munoz 19 Sep '13

19 Sep '13

Hi, The trunk version of Boost.MultiIndex introduces support for initializer list, which seems to work fine with regression tests except for intel-linux-14.0.0: http://tinyurl.com/pclssoe http://tinyurl.com/nzwzpu6 which spits error messages like this (replaced large chunks of text with *** for clarity): ../libs/multi_index/test/test_modifiers.cpp(230): error: no instance of overloaded function "boost::multi_index::detail::hashed_index<***>::insert [***]" matches the argument list argument types are: ({...}) object type is: employee_set_by_name i1.insert({{4,"Vanessa",20,9236},{5,"Penelope",55,2358}}); At first I thought this is failing because for it to work the compiler should not only support initializer lists but also C++11 unified initialization syntax, but I think this is not the problem because a) intel-linux-14.0.0 does indeed seem to support unified initialization syntax, since BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX is not listed in http://tinyurl.com/ndutn2w . b) the following test code also fails: s.assign({0,1,2,3,4,5}); with s a multi_index_container of ints, and this does not depend on unified initialization syntaxes. The error message here, FWIW, is different than before: ../libs/multi_index/test/test_copy_assignment.cpp(56): internal error: assertion failed: node_has_side_effects: bad node kind (shared/cfe/edgcpfe/il.c, line 20611) The tested code seems simple enough, for instance lines 271 and following of multi_index_container.hpp look like: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) multi_index_container( std::initializer_list<Value> list, const ctor_args_list& args_list=ctor_args_list(), const allocator_type& al=allocator_type()) [...] and the ofending assign member function in sequenced_index.hpp is as innocent as: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void assign(std::initializer_list<value_type> list) { assign(list.begin(),list.end()); } #endif Besides, other libs with initializer list support such as Boost.SmartPtr and Boost.Unordered cope fine with this compiler. Clues? Any help much appreciated. Joaquín M López Muñoz Telefónica Digital

1 0

[smart_ptr] extra colon on make_shared variadic template instantiation
by Vicente J. Botet Escriba 19 Sep '13

19 Sep '13

Hi, while instantiating this template, the Intel compiler finds that there is an extra colon when Args is empty. ::new( pv ) T( boost::detail::sp_forward<Arg1>( arg1 ), boost::detail::sp_forward<Args>( args )... ); ^ Is this a bug on the compiler or on Boost.SmartPtr? Best, Vicente template< class T, class Arg1, class... Args > typename boost::detail::sp_if_not_array< T >::type make_shared( Arg1 && arg1, Args && ... args ) { boost::shared_ptr< T > pt( static_cast< T* >( 0 ), BOOST_SP_MSD( T ) ); boost::detail::sp_ms_deleter< T > * pd = static_cast<boost::detail::sp_ms_deleter< T > *>( pt._internal_get_untyped_deleter() ); void * pv = pd->address(); ::new( pv ) T( boost::detail::sp_forward<Arg1>( arg1 ), boost::detail::sp_forward<Args>( args )... ); pd->set_initialized(); T * pt2 = static_cast< T* >( pv ); boost::detail::sp_enable_shared_from_this( &pt, pt2, pt2 ); return boost::shared_ptr< T >( pt, pt2 ); }

3 4

Comparing floating point Alberto Squassabia - original article wanted.
by Paul A. Bristow 19 Sep '13

19 Sep '13

This link to this article http://www.adtmag.com/joop/crarticle.asp?ID=396 seems now dead [4] Alberto Squassabia Comparing Floats: How To Determine if Floating Quantities Are Close Enough Once a Tolerance Has Been Reached <http://www.adtmag.com/joop/crarticle.asp?ID=396> C++ Report March 2000. Referenced in http://www.boost.org/doc/libs/1_54/libs/test/doc/components/test_tools/floa… l Does anyone still have a copy of the original? Thanks Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 2

[mpl] and_<true_> returns false
by Agustín K-ballo Bergé 19 Sep '13

19 Sep '13

The following snippet fails to compile (tested with 1.54.0 and trunk, several compilers), #include <boost/mpl/and.hpp> #include <boost/mpl/bool.hpp> #include <boost/mpl/or.hpp> int main() { using namespace boost::mpl; static_assert(and_<true_>::value, "U KID?"); //this one fires static_assert(or_<true_>::value, "U KID?"); //this one is ok } This issue actually showed up in a variadic template scenario. Is this a bug? I feel like I'm doing something really wrong... I guess one may not call `and_` with less than two arguments. If that's the case, it would be helpful if it would be impossible to instantiate it with a single argument. Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

4 6

NuGet packages for boost
by Ben Craig 19 Sep '13

19 Sep '13

NuGet is a package manager that has traditionally been focused on .NET, but it has recently added support for C++ libraries. Here is a presentation by the lead developer adding C++ support to NuGet: http://channel9.msdn.com/Events/GoingNative/2013/Find-Build-Share-Use-Using… I would like to see boost packages added to NuGet, and to have these packages be "official" packages. I am a contributor on another project (Thrift) and I would like to be able to produce NuGet packages for Thrift, and I would like that package to have a "magically" working Boost dependency. Sergey Shandar has made some unofficial packages. Blog describing his effort: http://sergey-shandar.blogspot.com/2013/08/boost-on-nugetorg.html Nuget packages he has submitted: https://www.nuget.org/profiles/sergey.shandar/ If someone (perhaps me) authored the boost NuGet package build process, would the person in charge of releasing Boost be willing to publish the NuGet packages that get created? There are going to be plenty of follow up questions if Boost releases are willing to publish NuGet packages, but I figured I would get the big question out of the way first.

7 14

[voronoi]medial axis
by Louis Lavery 19 Sep '13

19 Sep '13

[mods: I posted this a few days ago, and that post was acknowledged etc (it was my first post as a new subscriber) but I haven't receieved a copy myself and cannot find it in the archives - perhaps I should be more patient?] Hello, I'm hoping to use boost voronoi to construct the (internal) medial axis for closed shapes (with holes). I need to work out which vertices of the voronoi are inside, outside and on a boundary. So my first goal is to determine which vertices correspond to the ends of the input segments (boundary vertices). The way I do this at the moment, is to look at each edge and test if its source vertex, vertex0(), is equal to either end point of the segment contained by the edge's cell. (1) If it is then it's a boundary vertex otherwise it's not. Is that correct? (2) When comparing a vertex with an input point can I do an exact compare (==) or should I use a tolerance (epsilon)? Thanks, fuzzy.

2 8

[cpo-proposal] About mixout container for polymorphic objects
by Santiago Tapia 17 Sep '13

17 Sep '13

Hi all, I have design a new concept of container to be part of the cpo library. In summary, those containers will break down the inserted objects into some elementary parts. Why do that? Short answer: to save memory. Long answer: Because the alignment requirement of data members in an object could be very different, in a range from 1 byte to 16 bytes, structs or classes use padding to provide the correct location for members. That means an object size could be significantly greater than the sum of its members sizes. Even more, when dealing with polymorphic objects, the size is increased a little more due to the pointer to the table of virtual methods. I will try to outline the alternative solution, obviously, the implementation will be part of the container, the user will not need to know the details. ---- Example:----- #include <cstdlib> #include <iostream> #include <vector> class output { public: virtual void print(std::ostream& out) = 0; }; class integer { public: integer(short a_ = 0) : a(a_) { } short a; }; class character { public: character(char c_ = 'a') : c(c_) { } char c; }; class data { public: data(double x_ = 0) : x(x_) { } double x; }; class my_object : public integer, public data, public character, public output { public: my_object(int show = 1) : integer(rand() % 100) , data(1.0*rand()/RAND_MAX) , character('a' + rand() % 10) { if (show) print(std::cout); } virtual void print(std::ostream& out) { std::cout << a << "\t" << x << " \t" << c << "\n"; } }; void insert( std::vector<integer>& v_int, std::vector<data>& v_data, std::vector<character>& v_char, const my_object& o) { v_int.push_back( o ); v_data.push_back( o ); v_char.push_back( o ); } void iterate( std::vector<integer>& v_int, std::vector<data>& v_data, std::vector<character>& v_char ) { my_object o(0); unsigned i; for ( i = 0; i < v_int.size(); ++i) { static_cast<integer&>( o ) = v_int[i]; static_cast<data&>( o ) = v_data[i]; static_cast<character&>( o ) = v_char[i]; o.print(std::cout); } } int main(int, char**) { std::cout << "sizeof(my_object): " << sizeof(my_object) << "\n"; std::vector<integer> v_int; std::vector<data> v_data; std::vector<character> v_char; std::cout << "--- inserting (random) objects ---\n"; unsigned i; for ( i = 0; i < 5; ++ i ) { insert( v_int, v_data, v_char, my_object() ); } std::cout << "--- show content ---\n"; iterate(v_int, v_data, v_char); return 0; } ---- Output: (32 bit PC) ---- sizeof(my_object): 20 --- inserting (random) objects --- 83 0.394383 h 15 0.911647 f 86 0.76823 j 21 0.477397 h 90 0.513401 d --- show content --- 83 0.394383 h 15 0.911647 f 86 0.76823 j 21 0.477397 h 90 0.513401 d Final comment. In this example, all the std::vector objects will be part of the mixout container. The user will only use the insert method and the container iterator that will dereference to output& (template parameter in the container). Just in this simple example the implementation saves aproximately n* (20 - (8+2+1) = 9) bytes, being n the number of instances of my_object. Comments are wellcome. Best regards, Santiago Tapia

5 4

[svn] pre-commit hook/mime-type
by Tim Blechmann 17 Sep '13

17 Sep '13

hi all, is it possible that the pre-commit hook had changed recently? not sure if this was intended, but it currently breaks the use of git-svn, which imo is a huge inconvenience: -- tim@moka-mac:~/Documents/boost-trunk-git/boost$ git svn dcommit Committing to https://svn.boost.org/svn/boost/trunk ... A boost/sync/detail/generic/event_cv_emulation.hpp A boost/sync/detail/windows/event.hpp A boost/sync/event.hpp A libs/sync/test/event_test.cpp ERROR from SVN: A repository hook failed: Commit blocked by pre-commit hook (exit code 1) with output: /home/subversion/boost/hooks/check-mime-type.pl: trunk/boost/sync/detail/generic/event_cv_emulation.hpp : svn:mime-type is not set trunk/boost/sync/detail/windows/event.hpp : svn:mime-type is not set trunk/boost/sync/event.hpp : svn:mime-type is not set trunk/libs/sync/test/event_test.cpp : svn:mime-type is not set Every added file must have the svn:mime-type property set. In addition text files must have the svn:eol-style property set. For binary files try running svn propset svn:mime-type application/octet-stream path/of/file For text files try svn propset svn:mime-type text/plain path/of/file svn propset svn:eol-style native path/of/file You may want to consider uncommenting the auto-props section in your ~/.subversion/config file. Read the Subversion book (http://svnbook.red-bean.com/) Chapter 7, Properties section, Automatic Property Setting subsection for more help. Also, see http://svn.boost.org/trac/boost/wiki/BoostSubversion W: b7ab541813d43b7d74b44f57eb04c2625ce305a7 and refs/remotes/git-svn differ, using rebase: :040000 040000 4b2ab78eaa8f1e5fa80761a327da5066ca15d465 73aa096ac4b16618132d6d012e964b1790542c8f M boost :040000 040000 6146f06c45f590b38f76d123656cea13f24471d1 7a95e843ffc2f67fff874b6bd6c142b040423414 M libs Current branch master is up to date. ERROR: Not all changes have been committed into SVN, however the committed ones (if any) seem to be successfully integrated into the working tree. Please see the above messages for details. -- this used to work fine just a few days ago. was this done intentionally? if so, an announcement on the list with a comment on the implications for the git-svn users would have been good to see. best, tim

3 4

[functional] New functor adaptors
by Tigran Hayrapetyan 17 Sep '13

17 Sep '13

Hello, Suppose we want to transform sequence of integers by doubling and adding 5 to each value (x = 2*x + 5 for all x in sequence). If using std::transform, then we need a functor which will for given "x" return "2*x + 5". My question is - is it possible to do it in C++98 style (without lambda expressions), and without writing additional functor class? As I understand, it's not. For doing that we need something like nesting functors into each other. Here we have "std::bind2nd( std::multiplies<int>(), 2 )" functor, and "std::bind2nd( std::plus<int>(), 5 )" functor, which must be nested to provide necessary functionality. I suggest something like "unary_result_translator" functor adapter, which is unary functor itself, and which will apply unary functor to result of another unary functor. The implementation of "unary_result_translator" can be something like this: template< typename Fn1, typename FnTrans > class unary_result_translator { public: typedef typename Fn1::argument_type argument_type; typedef typename FnTrans::result_type result_type; unary_result_translator( const Fn1& fn1, const FnTrans& fn_trans ) : fn1_( fn1 ), fn_trans_( fn_trans ) {} result_type operator()( const argument_type& arg ) const { return fn_trans_( fn1_( arg ) ); } const Fn1& fn1_; const FnTrans& fn_trans_; }; So, we will create our needed functor which converts "x" to "2*x + 5" by this: make_unary_result_translator( std::bind2nd( std::multiplies<int>(), 2 ), std::bind2nd( std::plus<int>(), 5 ) ) Of'course, unary_result_translator can be also used for more complex functors construction. Recently I used it for case-insensitive comparision of strings only with help of ::tolower. Similarly, there can be "binary_result_translator" which is binary functor itself, and which will apply unary functor to result of binary functor. Can that functor adaptors be useful? Or may be there is another way to do such things? Thanks for reading! Best Regards, Tigran Hayrapetyan

6 6

Boost::lexical_cast<> under llvm 3.4
by Robert J Goedman 17 Sep '13

17 Sep '13

Hi, Has anyone tried boost::lexical_cast<> on clang++ based on llvm/clang++ 3.4? Or is it too early to use 3.4? Couldn't find any recent references to problems with lexical_cast (except from Mar 16, 2013 and older, but boost_1_54_0 does have that fix in it). No problems with llvm/clang++ 3.3, but on a test machine under 3.4 it produces the errors shown in below file lexical_cast-error.txt. The files are also at https://github.com/goedman/clang11-spirit-qi , in the Boost_lexical_cast directory. As far as I can see, all other parts of a spirit::qi project does build, the error occurs in a small print utility where lexical_cast<> is used.. Rob J. Goedman goedman(a)icloud.com

3 5

Re: [boost] [threads] Memory leaks in Boost threading support? Version boost_1_53_0
by Vicente J. Botet Escriba 16 Sep '13

16 Sep '13

Le 15/09/13 16:58, Paul Morrison a écrit : > Hi Vicente, > > I got your note about the memory leak not being connected to > condition_variable, but this one seems to be... see png file attached... > > Any suggestions you may have would be appreciated! > > TIA > > Paul M. > > PS I wasn't sure how to make sure that my reply got back to you in > person! :-) No, what I mean is that my comment had nothing to be with the condition_variable memory_leak. Unfortunately, I have not found yet what could be the cause. If you can post a short example that reproduce the issue this would surely help. Best, Vicente

1 0

[C++11] If you have an old class with a throwing destructor...
by Daryle Walker 16 Sep '13

16 Sep '13

I just got reminded of a breaking change in C++11 regarding this. Destructors without any exception specification in C++11 get `noexcept(true)` added to them. This means that pre-C++11 classes with throwing destructors turn into `std::terminate` bombs when imported to a C++11 project! I have two^H^H^Hthree such classes in Boost, so I just reported myself. (It's bug #9088, if you're curious.) Any other maintainers as stu^H^H^Henlightened as me should review their classes and add `noexcept(false)` when compiling in C++11 mode. If there are other libraries affected, maybe someone should make an en-masse bug ticket. Daryle W.

11 20

[units] problems
by Robert Ramey 16 Sep '13

16 Sep '13

I want and need the boost.units functionality. I'm sure that this is what I want. But I've spend a lot of time going through the documentation and I'm having real difficulties figure out how to use this. There's a lot there so I feel that what I want must be in there somewhere. I've started going through the tutorial example and there are a couple of problems. First of all, it doesn't compile on my machine. Looking at the tutorial, it actually contains two programs - one of which is commented out. I tried the commented out one as well - it didn't compile either. Note that other than in the header, there are very few if any comments in this code. It doesn't qualify as a tutorial. What I expect to see is: #include <boost/units/quantity.hpp> #include <boost/units/systems/si/length.hpp> #include <boost/units/base_units/us/mile.hpp> void main(){ using namespace boost::units; using namespace boost::units::si; using namespace boost::units::us; quantity<length, float> l1; l1 = 1000.0 * meters; quantity<length, float> l2; l2 = 1.0 * miles; // compile error quantity<length, float> l3 = l1 + l2; } and I expect this to pretty much work. The documentation says " Implicit conversions between unit systems are allowed only when the reduced units are identical, allowing, for example, trivial conversions between equivalent units in different systems (such as SI seconds and CGS seconds)" so I expected that it can convert miles into kilometers. This is a disappointment - but I'll assume that the authors have a good reason for this. So I'm interest in figuring out how to fix this but the manual doesn't seem to help me. I know a huge amount of effort has been invested in this package, but I'm afraid this issue of documentation is a big obstacle to this package being used every where it could be. Note to authors of boost libraries. When you think you've got the documentation done, hand it to someone who isn't familiar with it and ask him to make a small example using the library in 30 minutes. If he can't do that, it's time to go back to work. Most users will give up if they can't get some sort of love back from the library in that amount of time. Robert Ramey

5 13

Re: [boost] [threads] Memory leaks in Boost threading support? Version boost_1_53_0
by Paul Morrison 16 Sep '13

16 Sep '13

>> Hi Vicente, >> >> I got your note about the memory leak not being connected to >> condition_variable, but this one seems to be... see png file >> attached... >> >> Any suggestions you may have would be appreciated! >> >> TIA >> >> Paul M. >> >> PS I wasn't sure how to make sure that my reply got back to you in >> person! :-) > PPS having trouble reducing size of attachment - hope you can read it!

1 0

[threads] Memory leaks in Boost threading support? Version boost_1_53_0
by Paul Morrison 14 Sep '13

14 Sep '13

I am running a number of Boost threads communicating via bounded buffers. My programs seem to run properly, but I get a number of memory leaks, usually 4- and 8- byte areas, although a few are longer. As far as I can tell, they are coming from inside Boost, as there is no mention of lines in my code. OTOH, although my code runs fine, it is quite possible that there are subtle errors in it! I am using _CRTDBG_MAP_ALLOC, which is being used correctly as it detected one area of my own that I was not freeing up, and that has been fixed. I am running VC++ 2010 Express on a 64-bit machine. Here is my memory leak display - I tried setting a few of the numbers as breakpoints, using_CrtSetBreakAlloc(), but most of them did not cause breaks. The first one broke at a new in > boost::detail::basic_condition_variable::get_wait_entry() Line 180 + 0x7 bytes C++ Why wouldn't this get freed up?! Note: <bad exception > looks ominous - where is it coming from?! Detected memory leaks! Dumping objects -> {8624} normal block at 0x02312550, 4 bytes long. Data: <HC1 > 48 43 31 02 {8615} normal block at 0x0015F8F8, 4 bytes long. Data: <h!1 > 68 21 31 02 {8602} normal block at 0x023117A0, 4 bytes long. Data: < 51 > F8 35 31 02 {5584} normal block at 0x02311760, 4 bytes long. Data: <@ > 40 F7 15 00 {4013} normal block at 0x0015F948, 4 bytes long. Data: < 1 > 00 17 31 02 {3924} normal block at 0x02314048, 4 bytes long. Data: < <1 > 20 3C 31 02 {3883} normal block at 0x02314008, 4 bytes long. Data: < +1 > D0 2B 31 02 {3862} normal block at 0x02313CA0, 4 bytes long. Data: <h!1 > 68 21 31 02 {445} normal block at 0x02314088, 4 bytes long. Data: < R1 > 88 52 31 02 {440} normal block at 0x023145F8, 4 bytes long. Data: <HC1 > 48 43 31 02 {430} normal block at 0x02314648, 4 bytes long. Data: < 51 > F8 35 31 02 {402} normal block at 0x02313FC0, 4 bytes long. Data: < 1 > 98 1D 31 02 {395} normal block at 0x023136B8, 4 bytes long. Data: < +1 > D0 2B 31 02 {382} normal block at 0x02313A18, 4 bytes long. Data: < 51 > F8 35 31 02 {355} normal block at 0x02312B90, 4 bytes long. Data: <HC1 > 48 43 31 02 {332} normal block at 0x023121E8, 4 bytes long. Data: <h > 68 F8 15 00 {316} normal block at 0x02311978, 4 bytes long. Data: <HC1 > 48 43 31 02 {298} normal block at 0x023117E0, 4 bytes long. Data: < 51 > F8 35 31 02 {270} normal block at 0x023106D0, 4 bytes long. Data: < 1 > E0 0E 31 02 {256} normal block at 0x02310C50, 4 bytes long. Data: < R1 > 88 52 31 02 {225} normal block at 0x0015FC30, 4 bytes long. Data: < > 90 F9 15 00 {217} normal block at 0x0015F5C0, 8 bytes long. Data: <l > 6C F5 15 00 00 00 00 00 {213} normal block at 0x0015E7B8, 8 bytes long. Data: < > 14 E7 15 00 00 00 00 00 {212} normal block at 0x0015E770, 8 bytes long. Data: < > EC E6 15 00 00 00 00 00 {208} normal block at 0x0015D900, 8 bytes long. Data: <\ > 5C D8 15 00 00 00 00 00 {207} normal block at 0x0015D8B8, 8 bytes long. Data: <4 > 34 D8 15 00 00 00 00 00 {203} normal block at 0x0015CA48, 8 bytes long. Data: < > A4 C9 15 00 00 00 00 00 {202} normal block at 0x0015CA00, 8 bytes long. Data: <| > 7C C9 15 00 00 00 00 00 {198} normal block at 0x0015BB90, 8 bytes long. Data: < > EC BA 15 00 00 00 00 00 {197} normal block at 0x0015BB48, 8 bytes long. Data: < > C4 BA 15 00 00 00 00 00 {193} normal block at 0x0015ACD8, 8 bytes long. Data: <4 > 34 AC 15 00 00 00 00 00 {192} normal block at 0x0015AC90, 8 bytes long. Data: < > 0C AC 15 00 00 00 00 00 {188} normal block at 0x00159E20, 8 bytes long. Data: <| > 7C 9D 15 00 00 00 00 00 {187} normal block at 0x00159DD8, 8 bytes long. Data: <T > 54 9D 15 00 00 00 00 00 {183} normal block at 0x00158F68, 8 bytes long. Data: < > C4 8E 15 00 00 00 00 00 {182} normal block at 0x00158F20, 8 bytes long. Data: < > 9C 8E 15 00 00 00 00 00 {178} normal block at 0x001580B0, 8 bytes long. Data: < > 0C 80 15 00 00 00 00 00 {177} normal block at 0x00158068, 8 bytes long. Data: < > E4 7F 15 00 00 00 00 00 {173} normal block at 0x001571F8, 8 bytes long. Data: <Tq > 54 71 15 00 00 00 00 00 {172} normal block at 0x001571B0, 8 bytes long. Data: <,q > 2C 71 15 00 00 00 00 00 {168} normal block at 0x00156340, 8 bytes long. Data: < b > 9C 62 15 00 00 00 00 00 {167} normal block at 0x001562F8, 8 bytes long. Data: <tb > 74 62 15 00 00 00 00 00 {164} normal block at 0x00155B30, 8 bytes long. Data: < Z > D4 5A 15 00 00 00 00 00 {162} normal block at 0x001559E0, 8 bytes long. Data: < Y > 84 59 15 00 00 00 00 00 {160} normal block at 0x00155890, 8 bytes long. Data: <4X > 34 58 15 00 00 00 00 00 {158} normal block at 0x00155740, 8 bytes long. Data: < V > E4 56 15 00 00 00 00 00 {156} normal block at 0x001555F0, 8 bytes long. Data: < U > 94 55 15 00 00 00 00 00 {154} normal block at 0x001554A0, 8 bytes long. Data: <DT > 44 54 15 00 00 00 00 00 {152} normal block at 0x00155350, 8 bytes long. Data: < R > F4 52 15 00 00 00 00 00 {150} normal block at 0x00155200, 8 bytes long. Data: < Q > A4 51 15 00 00 00 00 00 {148} normal block at 0x001550B0, 8 bytes long. Data: <TP > 54 50 15 00 00 00 00 00 {146} normal block at 0x00154F60, 8 bytes long. Data: < O > 04 4F 15 00 00 00 00 00 {144} normal block at 0x00154E10, 8 bytes long. Data: < M > B4 4D 15 00 00 00 00 00 {140} normal block at 0x00154C40, 16 bytes long. Data: < K > 0C 1D EF 00 02 00 00 00 01 00 00 00 88 4B 15 00 {139} normal block at 0x00154BF0, 14 bytes long. Data: <bad exception > 62 61 64 20 65 78 63 65 70 74 69 6F 6E 00 {138} normal block at 0x00154B88, 44 bytes long. Data: < h > F4 1C EF 00 00 00 00 00 68 F8 EE 00 18 F8 EE 00 {135} normal block at 0x00154A98, 16 bytes long. Data: <\ 0J > 5C 1C EF 00 02 00 00 00 01 00 00 00 30 4A 15 00 {134} normal block at 0x00154A30, 44 bytes long. Data: <D 8 > 44 1C EF 00 00 00 00 00 88 F7 EE 00 38 F7 EE 00 Object dump complete.

2 2

Forking boost's git
by Mathias Gaunard 13 Sep '13

13 Sep '13

Hi, I would have liked to fork Boost to maintain my own version with my patches before they get merged in master. I was considering using git for this, unfortunately I don't know how to make this happen with submodules. Do I need to fork each submodule separately and to edit the .gitmodules file? Is there a way to not have to do that by hand?

1 0

[COUNTERTREE + SUBALLOCATOR ] version 2.0
by Francisco José Tapia 13 Sep '13

13 Sep '13

Hi this message is to announce the version 2.0 of the *[countertree + suballocator]* library. 1 year ago I presented the request for the evaluation of the [countertree+ suballocator] version 1.0. The approval process is stopped due to the absence of review managers, and in the meanwhile I continued with the develop of this version 2.0. Actually the most important libraries and environments for parallel development, *don't provide parallel algorithms for th**e** data structures based on trees* ( set , multiset, map and multimap), and all the operations with these data structures are done with 1 thread. This is due to the difficult to divide the element of the tree between an arbitrary number of threads. (If you want to access to the element in the position 1000, you must go sequentially forward from the position 0 or sequentially backward from the last position. The [countertree + suballocator] library provide data structures set, multiset,map and multimap compatibles with the STL data structures *plus the access to the elements by their position like in a vector, and random access iterators*, You can manage it like a vector. Many parallel algorithms designed for vectors, can be used without changes with the countertree data structures. This make *easy **the **design **of **parallel algorithms* for these data structures. In the library there are a concurrent and a non concurrent versions of all the data structures. The non concurrent version are designed for to be executed inside 1 thread, or for to be accessed by several threads only in read operations (like the STL data structures), they provide a bit more speed than the concurrent version. The concurrent version is *thread safe with all the operations*, one thread can be read and other writing over the same data structure in a safe mode ( as you can see in 2.3 -examples) The concurrent library provide the full set of functions of the STL , plus an *additional set of functions*. These functions have the mission of resolve the problems appeared in the concurrent development. By example, you have a map, find an iterator from a key and with the iterator modify the element, but in the middle, other thread delete the element, and when try to access with the iterator, the program crash, and it is very difficult to reproduce the error for to debug. These additional functions make a pack with the two things, first with a read lock which permit concurrent reads, and when obtain the iterator with an exclusive lock for to modify. These additional functions *prevent the problems* like the previously described, with an *easy interface* for to understand and use for the final user. I don't know if exist any other library with tree based structures with random access iterators. I had search for and didn't find. If someone knows someone, please, say me, I am interested to know something new and collect good ideas. I suppose it don't exist because i didn't see parallel support for data structures based on trees, in any library or parallel tools. I request help to the Boost community because I am in the *moment “perhaps” *. Perhaps I forgot something, perhaps something is wrong, perhaps someone decision was not correct, perhaps it can be done in other way... *Please*, is someone see any fail, any omission, any alternative or simply any comment, please say me, in order to reach the final objective, *provide to the C++ community a good, fast, robust and reliable tool.* In my opinion, this library or other with similar functionality, is the last big part needed for to begin to think about a *concurrent STL* . You can find concurrent libraries with vectors and arrays. You have too, concurrent libraries with containers based on hash functions. With the countertree library you have concurrent set, multiset,map and multimap. The concurrent linked list can be implemented with the concurrent vector_tree ( other data structure of the library). The concurrent STL is a very big project, and must involve many agents and perspectives. From the users associations, to big computers makers and big data providers, passing by the compiler makers, the parallel tools providers... But I am sure the *Boost community* will play a central role by prestige, knowledge and experience designing libraries You can find the documentation and the code in the GitHub https://github.com/fjtapia/countertree_2.0 or you can see online in my dropbox page : https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/index.html<https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/doc/index…> If you prefer download a file with all the code and the documentation : https://github.com/fjtapia/countertree_2.0/blob/master/doc/countertree_2.0.… Sincerely yours Francisco Tapia fjtapia(a)gmail.com ** I you don't try the library, perhaps the most interested parts of the documentation is the 1.5.- Next improvements. Where explain the future parallel algorithms for the library and how they can improve others areas of the computation with the augmented trees.*

3 6

Some patches to remove obsolete MSVC version checks
by Stephen Kelly 13 Sep '13

13 Sep '13

Hi, I've created patches to remove or simplify some ifdefs for MSVC versions which are now obsolete. There are many more to do. http://www.steveire.com/msvc_obsolete_versions_patches This is a followup to this thread: http://thread.gmane.org/gmane.comp.lib.boost.devel/243094 (Removing old config macro and increasing compiler requirements., 2013-07-29) The patches are most easily applied locally and reviewed with a git-svn checkout and git am. I'll also apply to get SVN access so I can commit patches myself. Thanks, Steve.

1 0

[asio] boost::asio::async_connect reports success on failure
by Ben Pope 13 Sep '13

13 Sep '13

Hi all, I've found a regression between 1.53 to 1.54; if you compile boost/libs/asio/example/cpp11/chat/chat_client.cpp and point it at a host and port that doesn't exist or refuses the connection, instead of coming back with an error, such as host not found or connection refused, it reports success (on the conversion to bool). (you might want to embellish the example with a std::cout << error_code.message() << std::endl;) This appears to be the case across Linux, Darwin, iOS and Android :( synchronous connect seems to work correctly (i.e., echo/blocking_tcp_echo_client.cpp) Ben

2 4

Removing old config macro and increasing compiler requirements.
by Stephen Kelly 12 Sep '13

12 Sep '13

Hi there, I've been working on the modularization effort from a CMake point of view, and from an 'actual modularization' point of view, looking at interdependencies: http://thread.gmane.org/gmane.comp.programming.tools.ryppl.devel/9/focus=26 I'd like to start on reducing interdependencies, and I'd like to start reasonably small, as no-one in the boost community knows me and see how it goes from there. I'm very active in CMake, Qt and KDE. Currently, in the modularized boost repos, boost::config and boost::core depend on each other. I listed 3 ways of fixing this on the ryppl list: http://thread.gmane.org/gmane.comp.programming.tools.ryppl.devel/201 My preference is the removal of BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS, and requiring compilers to have the feature. That way boost/config/suffix.hpp will no longer need to include boost/{non_,}type.hpp. My preference is increasing the compiler requirement, because that may open up more similar opportunities for reducing dependencies and interdependencies throughout boost. Grepping indicates that that means increasing the compiler requirements to something like __DMC__ > 0x840, GCC > 3.2, BOOST_INTEL_CXX_VERSION > 500, VC++ > 7.0. Comments? Thanks, Steve.

15 82

proposal for metafunction mpl::eval
by klaus triendl 12 Sep '13

12 Sep '13

Hi, I'm not so much into meta-programming, so I'm not sure whether there's already an alternative available. Nevertheless I'd like to propose a new metafunction that simply evaluates its argument: template<typename F> struct eval: F::type {}; I've found it somehow useful because it avoids syntactical sugar when specifying a condition to be evaluated for eval_if: eval_if< eval<apply<UnaryF, Arg>>, F1, F2 >; instead of writing: eval_if< typename apply<UnaryF, Arg>::type, F1, F2 >; Any comments on this? -- klaus triendl

4 6

[interprocess] Different processes accessing shared memory in different locations
by Tom Sanham 11 Sep '13

11 Sep '13

Hi Our application has the following scenario using Boost V1.0.52: 1) Process A writes to boost interprocess shared memory. The files appear at C:\ProgramData\boost_interprocess\... 2) Process A launches Process B 3) Process B attempts to read from shared memory but fails. It is attempting to read from: C:\Users\<username>\AppData\Local\Temp\boost_interprocess\... This failure only occurs on one single Windows 8 64 bit machine out of many we have tested. On all other machines, the application works perfectly. Please could somebody advise: What changes to our application could be made to avoid this? What changes to the machine's configuration (eg. Registry) could be made to avoid this issue? Many thanks Thomas Sanham

3 4

[asio] Mixing streambuf-based async_read and async_read_until
by Gavin Lambert 11 Sep '13

11 Sep '13

I was tracing through some code today (using Boost.Asio 1.53) and noticed something that seems a little odd to me. Given a boost::asio::streambuf that already contains data (typically from a previous read), the async_read_until operation will check the buffer first to see if it can find the specified delimiter already, and will only fetch more data from the stream if it needs to. It does appear to perform at least one async_read_some per async_read_until call, but this will be a zero-length-read that will not actually hit the network/wherever. (Could probably be optimised a little further though.) The async_read operation however will not check the buffer. While it won't destroy any existing data (it just appends) it will still fetch additional data from the stream up to the specified completion condition, ignoring however much is already in the buffer. For example, if buf already contains 32 unconsumed bytes then async_read(s, buf, transfer_exactly(16), cb) will fetch 16 more bytes from the network, leaving 48 bytes in the buffer but only passing 16 to the read handler. Of particular note is that it will wait for those 16 bytes to be read from the network -- it's not satisfied with the data it already has. The net effect of these behaviours I think is that if you're using async_read_until exclusively or async_read exclusively then everything will behave fairly normally. If you are mixing these two operations on the same stream then you will either be losing data (if you use separate streambufs) or reading more data than you should (if you use the same streambuf and don't check outside of ASIO to see if it already contained enough data). Maybe it's just me, but I find it surprising that async_read doesn't check if the supplied streambuf already satisfies the completion condition, given that async_read_until does and the docs for async_read do say that it's allowed to make zero async_read_some calls. Is this a bug or is it expected behaviour?

1 0

Incompatible Boost license file in boost.container
by Philip Bennefall 10 Sep '13

10 Sep '13

Hi all, I was looking at boost.container, and found that boost/container/deque.hpp has similar problems as boost/detail/endian.hpp had before that was fixed. Parts of deque.hpp seem to be covered by a license that is not compatible with the Boost software license. I quote: // Copyright (c) 1996,1997 // Silicon Graphics Computer Systems, Inc. // // Permission to use, copy, modify, distribute and sell this software // and its documentation for any purpose is hereby granted without fee, // provided that the above copyright notice appear in all copies and // that both that copyright notice and this permission notice appear // in supporting documentation. Etc. Kind regards, Philip Bennefall

4 4

Re: [boost] [cpo-proposal] presentation of the idea
by Santiago Tapia 10 Sep '13

10 Sep '13

Hi, I have working in the implementation of the cpo library, so I keep working and I expect to make a formal proposal within 2 or 3 months, and meanwhile I will try my best to answer mails. > Date: Wed, 28 Aug 2013 11:18:03 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > The storage strategy does not mandate the interface of the container. > unordered_set/map are implemented as a number of buckets (i.e. > single-linked lists), yet they provide sequence interface with an > additional ability to iterate within a single bucket. I don't see why a > similar approach couldn't be taken in your container. I will not provide the classifier container with a push_back or push_front method, instead I will use insert, I suppose it is just about the meaning of sequence, I expect a sequence to keep an order on items while container means just a collection of items in not a particular order. On the other hand I will provide a way to iterate over a "single bucket". Actually, I have been working on benchmarking and that seems to be the better option to iterate over the classifier because it reduces the number of virtual method calls in the iteration. I also will provide a const random access iterator and some other utilities to access a particular item in the container. > > You can't create std::multiset<shape> but you can create > boost::intrusive::multiset<shape>. The reason for that is that > std::multiset attempts to allocate storage for shape, while > boost::intrusive::multiset doesn't, leaving this to the user. This allows > you to insert any objects derived from shape to the single > boost::intrusive::multiset and work with this container pretty much the > same way you would with std::multiset. You can even insert the very same > object in multiple containers if you need to. I recommend you to have a > look at Boost.Intrusive, it is a truly amazing library. The interface for my library needs to be far more simple than the interface in Boost.Intrusive, but I will consider that option to implement the details. Up to now, I am only using std containers to avoid dependencies, but I will consider other options to optimize speed and size performance. [snip] About "polymorphic vector", that is, a container that stores different types contigously, I should say that the interface needs to be as easy as in the classifier, so I will discard solutions that needs any requirement to objects apart from being copyable, default constructive or the like. I will try to develop a prototype from Larry Evans' example (with his permission). But because I am not an expert on alignment and memory optimization, I will try to use something "more standard", actually I am going trying to use the allocator to compute the "right" address to place an object of a given type that is greater that a "free" memory pointer. In that way, I also expect to take advantages of allocator such as tbb cache aligned allocator. Again, thank you all for your comments. Regards, Santiago -- ESCUELA TÉCNICA SUPERIOR DE INGENIEROS INDUSTRIALES UNIVERSIDAD POLITÉCNICA DE MADRID Santiago Tapia Fernández | DEPARTAMENTO DE AUTOMÁTICA, INGENIERÍA ELECTRÓNICA E INFORMÁTICA INDUSTRIAL José Gutiérrez Abascal, 2 | 28006 Madrid TEL +34 91 336 4266 E-MAIL stapia(a)industriales.upm.es www.industriales.upm.es

3 2

Re: [boost] [cpo-proposal] presentation of the idea
by Santiago Tapia 10 Sep '13

10 Sep '13

> Date: Mon, 09 Sep 2013 11:57:43 -0500 > From: Larry Evans <cppljevans(a)suddenlink.net> > >> But because I am not an expert on alignment and memory >> optimization, I will try to use something "more standard", actually I am >> going trying to use the allocator to compute the "right" address to place >> an object of a given type that is greater that a "free" memory pointer. >> In that way, I also expect to take advantages of allocator such as >> tbb cache aligned allocator. > > I know nothing about how 'to use the allocator to compute the "right" > address'; hence, I'm afraid I can't be any help there. Could you maybe > give a brief summary of how that works? > No idea, I was just speculating, actually, I am not sure I will be able to do it. On the other hand, I suppose there should be a way to do it. Just need some time and thought. > Best of luck on this project, Santiago! > > -regards, > Larry Thank you!

2 1

[PREPROCESSOR] Possible improvement for BOOST_PP_VARIADIC_SIZE
by Brent Lewis 10 Sep '13

10 Sep '13

Currently, BOOST_VARIADIC_SIZE() evaluates to 1. Based on http://gustedt.wordpress.com/2010/06/08/detect-empty-macro-arguments/ it can be improved to return 0 for an empty argument list.

4 3

Quid pro quo for Boost peer review manager
by Niall Douglas 09 Sep '13

09 Sep '13

Dear Boost Devs, GSoC 2013 ends on 23rd September, and myself and Paul expect that Boost.AFIO will be ready for peer review at around that time after finishing the following features from your voting at http://boostafio.uservoice.com/: (i) Directory Monitoring (ii) Asynchronous Directory Enumeration (iii) Parts of Improved formal closure execution engine support based on the latest updated papers in the Sept WG21 mailing N3721 and N3731. It seems unfair to ask for someone to volunteer to do all the work to be a review manager for AFIO without me volunteering to be a review manager for another Boost library in exchange, so I was wondering: are there any similar sized libraries to AFIO (~800 active LOC, ~20,000 for everything including docs and testing) which are ready for peer review and need a review manager? Thanks, Niall -- Currently unemployed and looking for work. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

1 0

[Thread] possible bug in Move emulation "portable interface"
by Gavin Lambert 09 Sep '13

09 Sep '13

I tried submitting this via Trac but for some reason it was convinced that my bug report contained spam, while refusing to tell me what part it was objecting to, and also refusing to give me a captcha or anything to convince it otherwise. Anyways: Bug 1: the Boost.Thread documentation and release history indicate that BOOST_THREAD_VERSION==3 is the default since v1.52. As far as I can tell this has never been true in any released version; the latest code still has ==2. (I found a thread in boost-devel that was debating consequences of making breaking changes by default, which I assume is why this change was not actually made; but the docs need correcting.) Bug 2: when writing code using the Boost.Thread "Portable Interface" for move support/emulation, it recommends using the BOOST_THREAD_DCL_MOVABLE_BEG macro to "avoid conflicts with Boost.Move". However regardless of C++11 or not or the BOOST_THREAD_VERSION it defines a template specialisation in a way that assumes that it is called only from "namespace boost". As this usage is unlikely for any code outside the boost library itself, I think this is a bug. namespace user { template<typename T> class test { public: BOOST_THREAD_COPYABLE_AND_MOVABLE(test) test() {} test(const test&) {} test& operator=(BOOST_COPY_ASSIGN_REF(test) o) { return *this; } test(BOOST_THREAD_RV_REF(test) o) {} test& operator=(BOOST_THREAD_RV_REF(test) o) { return *this; } }; BOOST_THREAD_DCL_MOVABLE_BEG(T) test<T> BOOST_THREAD_DCL_MOVABLE_END } The above code will not compile. It does compile if the DCL define is moved into a "namespace boost" block, but I do not regard this as an acceptable solution. Suggested fix is to explicitly specify the namespace in the macro, eg. replace "enable_move_utility_emulation" with "::boost::enable_move_utility_emulation".

6 12

Fwd: Re: [atomic] atomic<int>::is_lock_free() returns false on iPad 4 (armv7s)
by Tim Blechmann 09 Sep '13

09 Sep '13

-------- Original-Nachricht -------- Betreff: Re: [boost] [atomic] atomic<int>::is_lock_free() returns false on iPad 4 (armv7s) Datum: Mon, 09 Sep 2013 15:49:06 +0100 Von: Phil Endecott <spam_from_boost_dev(a)chezphil.org> An: Tim Blechmann <tim(a)klingt.org> Hi Tim, (My Boost list subscription is temporarily broken; feel free to forward this if you want.) Tim Blechmann wrote: >>> boost:atomic<int>::is_lock_free() returns false on iPad 4 (armv7s) but >>> returns true on iPad 3 (armv7). Yes. I thought this had been fixed. It's now too long ago for me to recall exactly what happened. I know that I filed a trac ticket to get it fixed in smart_ptr's spinlock; I think that at that time Boost.Atomic has still not been reviewed and merged, and I probably fixed it only in a local copy. > btw, it may be worth to note that on iOS devices std::atomic should be > available ... Absolutely! Few people have any reason to be using Boost.Atomic. Regards, Phil.

1 0

[format] convenient format wrapper
by Alexey Klimkin 09 Sep '13

09 Sep '13

I found this boost::format wrapper to be very convenient as replacement of sprintf. Can something like that be a part of the library? #include <boost/format.hpp> #include <string> #include <iostream> using namespace std; using namespace boost; format& my_format(format& fmter) { return fmter; } template <typename T, typename... Args> format& my_format(format& fmter, T value, Args... args) { fmter % value; return my_format(fmter, args...); } string my_format(string fmt) { format fmter(fmt); return my_format(fmter).str(); } template <typename... Args> string my_format(string fmt, Args... args) { format fmter(fmt); return my_format(fmter, args...).str(); } int main() { cout << my_format("%s %.6f", "pi", 3.14159) << endl; return 0; } -Alexey

3 2

[utility] Proposal to extract some components from Boost.Log
by Andrey Semashev 09 Sep '13

09 Sep '13

Hi, I'd like to extract some general-purpose components from Boost.Log to Boost.Utility so that they could be used in other libraries and user's code that is not related to logging. The components are mostly standalone already and are not tied to Boost.Log specifics. 1. BOOST_EXPLICIT_OPERATOR_BOOL() macro for defining explicit operator bool() for a class. For C++03 compilers the macro implements safe bool idiom or just a regular operator bool(), if the compiler doesn't handle safe bool well. The generated operator is implemented in terms of operator!(), which should be defined for the class: template< typename T > class my_ptr { T* m_p; public: BOOST_EXPLICIT_OPERATOR_BOOL() bool operator! () const { return !m_p; } }; Various different implementations of explicit/safe bool operator are present in different libraries. It would be good to unify them. Implementation: boost/log/utility/explicit_operator_bool.hpp 2. basic_string_literal< CharT, CharTraitsT > class template. String literal is similar to string_ref, but it only allows to be constructed from a string literal. Obviously, it doesn't allow to modify the literal and it doesn't allocate memory for the literal. It supports clear() though, which makes the literal object to refer to an empty literal. Otherwise it provides interface similar to std::string. Docs: < http://www.boost.org/doc/libs/release/libs/log/doc/html/log/detailed/utilit… > Implementation: boost/log/utility/string_literal.hpp 3. type_info_wrapper class. The class wraps a reference to std::type_info and provides equality and ordering operators. The wrapper implements value semantics (i.e. it can be constructed and copied), which allows it to be stored in containers, including as keys. Docs: < http://www.boost.org/doc/libs/release/libs/log/doc/html/log/detailed/utilit… > Implementation: boost/log/utility/type_info_wrapper.hpp 4. empty_deleter class. The class can be used as a deleter (e.g. for shared_ptr) that does nothing. It can be useful in some cases, when you need a shared_ptr but you know you will delete the referred object by other means. For example, with Boost.Log this deleter can be used to create shared_ptr< std::ostream > to std::cout. Another use case is to create a weak_ptr to an object to be able to test whether the object has already been deleted. Implementation: boost/log/utility/empty_deleter.hpp 5. BOOST_LOG_UNIQUE_IDENTIFIER_NAME(prefix) macro. This macro expands in a unique (within the current TU) token that starts with prefix. This can be useful for declaring unique variable and type names within other macros. Not that this macro has much value but it could be useful for other libraries that define macros. Implementation: boost/log/utility/unique_identifier_name.hpp

4 10

[Container] Strange flat_set crash with std::inserter
by Ben Pope 08 Sep '13

08 Sep '13

Hi all It seems that when I copy a sorted but non-unique range of randomly generated numbers to an output iterator generated from std::inserter to a boost::flat_set it crashes. At first I assumed it was because boost::flat_set doesn't have stable iterators, but it seems that the implementation of std::insert_iterator does the right thing by reassigning its internal iterator to the result of the insert operation before incrementing it. Apologies for not being able to reduce the problem further, but this one is a little strange, the following code demonstrates the problem (and some variations that do work) in boost 1.54: #include <boost/container/flat_set.hpp> #include <algorithm> #include <iterator> #include <numeric> #include <vector> template<typename ContainerT> void Populate(std::vector<size_t> const& input) { ContainerT container; std::copy( std::begin(input), std::end(input), std::inserter(container, std::end(container))); } int main() { const size_t Count = 1000000; std::vector<size_t> random_numbers; random_numbers.reserve(Count); std::generate_n( std::back_inserter(random_numbers), Count, &std::rand); std::vector<size_t> sorted_numbers(random_numbers); std::sort(std::begin(sorted_numbers), std::end(sorted_numbers)); std::vector<size_t> unique_sorted_numbers; unique_sorted_numbers.reserve(Count); std::unique_copy( std::begin(sorted_numbers), std::end(sorted_numbers), std::back_inserter(unique_sorted_numbers)); using namespace boost::container; Populate<flat_set<size_t>>(unique_sorted_numbers); // ok Populate<flat_multiset<size_t>>(sorted_numbers); // ok Populate<flat_set<size_t>>(sorted_numbers); // segfault, line 39 } It might be a little hard to reproduce with the rand() in there, I'm on 64bit Ubuntu 13.04 and it's reproducible with Clang 3.3 with libc++ and GCC 4.8.1. Here's the backtrace from Clang: #0 0x0000000000403aec in operator() (this=0x7fffffffd598, __x=@0x7ffff61c6320: 61595138, __y=@0x454000: <error reading variable>) at /usr/include/c++/v1/__functional_base:61 #1 boost::container::container_detail::flat_tree_value_compare<std::__1::less<unsigned long>, unsigned long, boost::container::container_detail::identity<unsigned long> >::operator() (this=0x7fffffffd598, lhs=@0x7ffff61c6320: 61595138, rhs=@0x454000: <error reading variable>) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:66 #2 0x0000000000404367 in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::priv_insert_unique_prepare (this=0x7fffffffd598, pos=..., val=@0x7ffff61c6320: 61595138, commit_data=...) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:824 #3 0x0000000000404275 in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::insert_unique (this=0x7fffffffd598, pos=..., val=@0x7ffff61c6320: 61595138) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:354 #4 0x000000000040421d in boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::priv_insert<unsigned long const&> (this=0x7fffffffd598, p=..., x=@0x7ffff61c6320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:688 #5 0x00000000004041bd in boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::insert (this=0x7fffffffd598, arg1=..., x=@0x7ffff61c6320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:508 #6 0x0000000000401de4 in operator* (this=0x7fffffffd750, this=0x7fffffffd750, this=0x7fffffffd750, __value_=@0x7ffff61c6320: 61595138) at /usr/include/c++/v1/iterator:718 #7 __unwrap_iter<std::__1::insert_iterator<boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> > > > (__i=..., __first=..., __last=..., __result=...) at /usr/include/c++/v1/algorithm:1717 #8 end<boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> > > (__c=..., __x=..., __i=..., __first=..., __last=..., __result=...) at /usr/include/c++/v1/algorithm:1741 #9 Populate<boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> > > (input=...) at flat_set_crash.cpp:13 #10 0x00000000004017a6 in main () at flat_set_crash.cpp:39 or from GCC if you prefer: #0 0x0000000000404bed in std::less<unsigned long>::operator() (this=0x7fffffffdd10, __x=@0x7ffff62e7320: 61595138, __y=@0x453000: <error reading variable>) at /usr/include/c++/4.8/bits/stl_function.h:235 #1 0x00000000004047f9 in boost::container::container_detail::flat_tree_value_compare<std::less<unsigned long>, unsigned long, boost::container::container_detail::identity<unsigned long> >::operator() (this=0x7fffffffdd10, lhs=@0x7ffff62e7320: 61595138, rhs=@0x453000: <error reading variable>) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:66 #2 0x0000000000404389 in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::less<unsigned long>, std::allocator<unsigned long> >::priv_insert_unique_prepare (this=0x7fffffffdd10, pos=..., val=@0x7ffff62e7320: 61595138, commit_data=...) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:824 #3 0x000000000040420a in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::less<unsigned long>, std::allocator<unsigned long> >::insert_unique (this=0x7fffffffdd10, pos=..., val=@0x7ffff62e7320: 61595138) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:354 #4 0x00000000004040ef in boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> >::priv_insert<unsigned long const&> (this=0x7fffffffdd10, p=..., x=@0x7ffff62e7320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:688 #5 0x0000000000403fa5 in boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> >::insert (this=0x7fffffffdd10, arg1=..., x=@0x7ffff62e7320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:508 #6 0x0000000000403b71 in std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > >::operator= (this=0x7fffffffdbd0, __value=@0x7ffff62e7320: 61595138) at /usr/include/c++/4.8/bits/stl_iterator.h:640 #7 0x000000000040350a in std::__copy_move<false, false, std::random_access_iterator_tag>::__copy_m<unsigned long const*, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=0x7ffff62e7320, __last=0x7ffff6a50210, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:335 #8 0x0000000000402c2f in std::__copy_move_a<false, unsigned long const*, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=0x7ffff62af010, __last=0x7ffff6a50210, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:390 #9 0x000000000040237f in std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<unsigned long const*, std::vector<unsigned long, std::allocator<unsigned long> > >, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=1210, __last=0, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:428 #10 0x0000000000401b70 in std::copy<__gnu_cxx::__normal_iterator<unsigned long const*, std::vector<unsigned long, std::allocator<unsigned long> > >, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=1210, __last=0, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:460 #11 0x000000000040120f in Populate<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > (input=std::vector of length 1000000, capacity 1000000 = {...}) at flat_set_crash.cpp:10 #12 0x0000000000400c50 in main () at flat_set_crash.cpp:39 (gdb) Since my refactoring of the code above, the crash location has changed, it used to be in: boost::container::vector::priv_forward_range_insert_at_end_expand_forward boost/container/vector.hpp:2205 unique_sorted_numbers.size() is 999752. Unfortunately producing a sequential list of numbers with std::iota and then changing one of them to the proceeding value didn't repro the problem. Ben

2 1

Re: [boost] [Boost.Interprocess] conditions variables get 10 times faster when opening a multiprocess browser
by Marcello Pietrobon 08 Sep '13

08 Sep '13

I've noticed the same 10 times acceleration even while I make a skyPE call... How can this have anything to do with interprocess programming? -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Interprocess-conditions-variables-… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 14

Problems with yield_k workaround. Still too slow.
by Marcello Pietrobon 07 Sep '13

07 Sep '13

Hello Boost team, As exposed by Gav Wood in http://boost.2283326.n4.nabble.com/Boost-Interprocess-Chronic-performance-o… Windows doesn't handle well the contest switching between threads. Basically if a thread is given a time to sleep for 1ms then the OS puts that thread on sleep for its entire timeslice (~20ms), no matter if the concurrent threads need a much shorter time to complete their job. The effect of this choice is that if you need to have two threads talking with each other through an emulated synchronization object, they take well 2 seconds to do just 100 back and forth. At least it seems to me that this problem arises only when *emulating * a synchronization object, which I understand is necessary, for example, in the interprocess library. It's not a problem of easy solution. There is an ongoing discussion in the interprocess library on how to fix this (see for example http://boost.2283326.n4.nabble.com/Boost-Interprocess-conditions-variables-… ) but clearly this is not a problem limited to it. The workaround http://www.boost.org/doc/libs/1_54_0/boost/smart_ptr/detail/yield_k.hpp improves the situation, yet only a bit. In order to isolate the problem I've run some tests using the interprocess library, with the example comp_doc_anonymous_conditionA.cpp (and B). This test is slowed down by this time of a factor ranging from 2 to 10, 100 or even 1000 or more times depending on how soon that infamous Sleep(1) is triggered. *The bottom line is that in yield_k.cpp we need to change the constant in the code * from 32 to *1000 * at least. I call this constant kMax: Here some test results, running XPsp3 on Xeon E5450 - dual socket 32bit CPU quad cores. 2GHz core speed. For test I changed comp_doc_anonymous_conditionA.cpp : that is 100000 iterations, while in comp_doc_anonymous_conditionB.cpp I've added the line just to emulate a job done by the thread while owning the mutex. That is: The results are (these numbers are representative of many tests I've run) : kMax = 32, jMax = 0 : time = 00:00:01.125000 kMax = 50, jMax = 0 : time = 00:00:00.403750 kMax = 100, jMax = 0 : time = 00:00:00.2803750 kMax = 65535, jMax = 0 : time = 00:00:00.203125 kMax ~= 64 is good kMax = 32, jMax = 10 : time = 00:00:32.843750 kMax = 100, jMax = 10 : time = 00:00:02.750000 kMax = 1000, jMax = 10 : time = 00:00:00.859375 kMax = 65535, jMax = 10 : time = 00:00:00.328125 kMax ~= 1000 is good kMax = 32, jMax = 100 : time = 00:04:01.953125 kMax = 50, jMax = 100 : time = 00:00:04.296875 kMax = 1000, jMax = 100 : time = 00:00:02.062500 kMax = 65535, jMax = 100 : time = 00:00:01.593750 kMax ~= 1000 is good If the job takes longer we need to increase kMax even more, but it seems that a value of 65535 cuts the problem and makes sure that a locked thread doesn't take most of the cpu time for more than one timeslice. -- View this message in context: http://boost.2283326.n4.nabble.com/Problems-with-yield-k-workaround-Still-t… Sent from the Boost - Dev mailing list archive at Nabble.com.

4 6

[Graph] floyd_warshall crashes using optimzation
by Tim Keitt 06 Sep '13

06 Sep '13

I'm getting seg faults when I use optimization with floyd_warshall_shortest_paths. Without optimization it works fine. d here is defined as struct dmat_t { typedef std::vector<edge_weight_t> storage_t; dmat_t(vertex_t n) : ncol(n), storage(n * n) {} storage_t::iterator operator[](vertex_t row) { assert(row < ncol); storage.begin() + row * ncol; } vertex_t ncol; storage_t storage; }; Is this from 'inf' getting optimized out or how I defined dmat_t? Program received signal SIGSEGV, Segmentation fault. 0x000000000040162a in floyd_warshall_all_pairs_shortest_paths<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >, edge_thinning_diameter_t::dmat_t, boost::adj_list_edge_property_map<boost::undirected_tag, double, double const&, unsigned long, boost::property<boost::edge_weight_t, double> const, boost::edge_weight_t>, std::less<double>, boost::closed_plus<double>, double, double> ( zero=<optimized out>, inf=<optimized out>, combine=..., compare=..., d=<synthetic pointer>, g=..., w=...) at /usr/include/boost/graph/floyd_warshall_shortest.hpp:115 115 d[*firstv][*firstv2] = inf; Also, it does not seem that floyd_warshall_shortest_paths is compatible with bundled properties. THK -- Timothy H. Keitt http://www.keittlab.org/

2 2

[atomic] atomic<int>::is_lock_free() returns false on iPad 4 (armv7s)
by Taylor Holliday 06 Sep '13

06 Sep '13

Hi, boost:atomic<int>::is_lock_free() returns false on iPad 4 (armv7s) but returns true on iPad 3 (armv7). Is this expected or did I build boost incorrectly? thanks! - Taylor W. Taylor Holliday, Owner/Founder Subatomic Software, San Francisco

3 3

[boost.chrono] Slow down process (if specifing c++11)
by Gaetano Mendola 06 Sep '13

06 Sep '13

Hi have tried the following code compiling it with gcc 4.6.3, with four combinations: 1) -O3 2) -O3 (commeting out the chrono call) 3) -O3 -std=c++0x 4) -O3 -std=c++0x (commenting out the chrono call) and I'm obtaining the following runtime values: 1) 8921 ms 2) 8915 ms 3) 9400 ms 4) 8933 ms as you can see the combination: "c++11 and chrono call" slows down the entire process. I have tried the same with gcc 4.8.1 and all times are more or less the same. At this point I'm not sure if it's a problem of chrono with gcc 4.6.3 or simply an issue of 4.6.3 disappeared in 4.8.1 series. Regards Gaetano Mendola Here the code I have used: #include <iostream> #include <boost/chrono.hpp> #include <sys/time.h> #include <math.h> int main() { cpu_set_t myAffinityMask; CPU_ZERO( &myAffinityMask ); CPU_SET(0, &myAffinityMask ); sched_setaffinity(0, sizeof(myAffinityMask), &myAffinityMask); volatile float* myMemoryA = new float[(1<<24)]; volatile float* myMemoryB = new float[(1<<24)]; struct timeval myStart; struct timeval myStop; struct timeval myResult; boost::chrono::time_point<boost::chrono::steady_clock> t1 = boost::chrono::high_resolution_clock::now(); gettimeofday(&myStart, 0); for (size_t i = 0; i < (1<<24); ++i) { myMemoryA[i] = i; myMemoryB[i] = i+1; } delete []myMemoryA; delete []myMemoryB; for (size_t j = 0; j < 100; ++j) { volatile float* myMemoryA = new float[(1<<24)]; volatile float* myMemoryB = new float[(1<<24)]; for (size_t i = 0; i < (1<<24); ++i) { myMemoryA[i] *= sqrtf(myMemoryB[i]); } delete []myMemoryA; delete []myMemoryB; } gettimeofday(&myStop, 0); timersub(&myStop,&myStart,&myResult); std::cout << "Time: " << myResult.tv_sec*1000 + myResult.tv_usec/1000.0 << std::endl; std::cout << "t1: " << t1 << std::endl; }

3 5

bjam assertion failure: does it really need stack alignment?
by Steve M. Robbins 05 Sep '13

05 Sep '13

Hi, A question for the bjam maintainers about https://svn.boost.org/trac/boost/ticket/8993 The file tools/build/v2/engine/function.c contains this check: static void check_alignment( STACK * s ) { assert( (size_t)s->data % sizeof( LIST * ) == 0 ); } However, things other than LIST* are allocated on the stack. For example expand_modifiers() allocates VAR_EDITS objects, whose size turns out not to be a multiple of sizeof(LIST*) on some architectures (m68k in the above ticket). Does check_alignment() still make sense? Thanks, -Steve

1 0

[thread] Can boost::this_thread::sleep_for() totally stop the thread?
by Klaim - Joël Lamotte 03 Sep '13

03 Sep '13

I'm having, sometime, trouble with a rare heisenbug (rare but appearing several times a week). I described it there: http://stackoverflow.com/questions/17918548/can-windows-totally-stop-a-thre… There I ask if it's possible for windows to totally stop a thread that is sleeping too often. As I'm using boost::thread for sleeping this specific thread that, for unknown reason, sometime totally stop working, I'm also wondering if the boost::this_thread() implementation could not be doing something that the OS might not like? ----- I'll report the content of the page here: Can Windows totally stop a thread if it's sleeping too often? I have a rare heisenbug in a multi-threaded application where the main thread, and only this thread, will just do nothing. As it's an heisenbug it's really hard to understand why this is happening. The main thread is basically just looping. In the loop, it check several concurrent priority queues which contain tasks ordered by time to be executed. It pop a task, see if it's time to execute it. If it's time, it will just schedule it into TBB's task scheduler (using a root task which is the parent of all other tasks). If it's not time, the task is pushed again in the priority queue. That's for one cycle. At the end of the cycle, the main thread is put to sleep for a very short time that I expect will be longer in practice but it's not really a problem, I just don't want it to use too much resources when not necessary. Litterally: static const auto TIME_SCHEDULED_TASKS_SPAWN_FREQUENCY = microseconds(250); while( !m_task_scheduler.is_exiting() ) // check if the application should exit { m_clock_scheduler.spawn_realtime_tasks(); // here we spawn tasks if it's time this_thread::sleep_for( TIME_SCHEDULED_TASKS_SPAWN_FREQUENCY ); } m_clock_scheduler.clear_tasks(); m_root_task.wait_for_all(); I have a special task that just log a "TICK" message each second. It is automatically rescheduling until the end of the program. However, when the heisenbug appear, I can see the "TICK" disappearing and the application not doing anything else than the work that occurs in non-main threads. So it appear that only the main thread is touched. The problem can come from different places, maybe in the scheduling logic, but then it's also the only thread that have a sleep call. That sleep is a boost::this_thread::sleep_for(). My question is: **Is it possible that Windows (7 64bit) consider the main thread to be sleeping often and decide that it should sleep for a longer period of time than asked or be definitely ended?** I expect that it is not possible but I would like to be sure. I didn't find any precision on this in online documentation so far. ----- I really suspect that the problem can't come from the sleeping function but I need to eliminate each potential source of problem to isolate it. Thanks for your time. Joel Lamotte

2 9

smart_ptr doesn't work when built with gcc on AIX
by Florent Guiliani 03 Sep '13

03 Sep '13

Hi, The Boost 1.54 smart_ptr atomic API code only supports the IBM xlC compiler under AIX. The attached patch make it also support the gcc compiler. I wanted to fill in a ticket for it on https://svn.boost.org/trac/boost/newticket but for some reason the ticket was classified as a spam by Trac. Anyone could help me here? One issue is the _sync*() APIs doesn't work when built optimized with GCC 4.8.0 on AIX 6.1 and 7.1 (and so the patch assume they don't work with all versions of GCC on AIX), so the patch undefine BOOST_SP_HAS_SYNC to prevent using those APIs. Another issue is the builtins.h file that Boost uses is missing, because it is installed as part of xlC. Under gcc, this patch will define assembly versions of the 2 builtins that are used in sp_counted_base_aix.hpp. Hope this gets through, -- Florent

1 0

[git] b2 headers not producing headers
by Ahmed Charles 02 Sep '13

02 Sep '13

I've tried following the instructions here: https://svn.boost.org/trac/boost/wiki/TryModBoost The 'b2 headers' command doesn't see to actually produce a boost directory. Is this supposed to work or is it just too soon?

3 2

[smart_ptr] Proposal to extract intrusive_ref_counter from Boost.Log
by Andrey Semashev 01 Sep '13

01 Sep '13

Hi, I'd like to move intrusive_ref_counter class from Boost.Log to Boost.SmartPtr. The class is intended to be used as a base class for a user's class that is intended to be used with intrusive_ptr. The class implements a reference counter and the related intrusive_ptr_add_ref/intrusive_ptr_release operations, so the user doesn't have to do that himself. Usage example: class my_class : public intrusive_ref_counter { }; intrusive_ptr< my_class > p = new my_class(); Besides just simplifying intrusive_ptr usage, the base class can be used as a sort of "void" as in shared_ptr< void >. I.e. intrusive_ptr< intrusive_ref_counter > can refer to object of any class that follows this protocol. Implementation: boost/log/utility/intrusive_ref_counter.hpp

5 10

Re: [boost] [utility] Proposal to extract some components from Boost.Log
by Daryle Walker 01 Sep '13

01 Sep '13

I don’t think you need a “constexpr_if.” You can unconditionally put BOOST_CONSTEXPR in the definition. This will unconditionally add “constexpr” to the member operator (for C++11 systems), which will be ignored if the compiler determines that the attached function (or a particular call) is disqualified from being used in constant expressions. So any extra preprocessor work, or a variant macro, is unnecessary. Sent from Windows Mail From: Andrey Semashev Sent: ‎Sunday‎, ‎September‎ ‎01‎, ‎2013 ‎4‎:‎40‎ ‎AM To: boost(a)lists.boost.org On Sunday 01 September 2013 03:27:06 Daryle Walker wrote: > > Date: Wed, 28 Aug 2013 12:14:51 +0400 > > From: andrey.semashev(a)gmail.com > > > > 1. BOOST_EXPLICIT_OPERATOR_BOOL() macro for defining explicit operator > > bool() for a class. > > a. It isn't marked "constexpr." I can add that myself before using > "BOOST_EXPLICIT_OPERATOR_BOOL" in "boost/rational.hpp," but what happens if > someone corrects it in "explicit_operator_bool.hpp"? Will the (temporary) > double definition cause an error? Well, since there isn't a constexpr_if or something, I don't see a way to add it to BOOST_EXPLICIT_OPERATOR_BOOL. I could add BOOST_EXPLICIT_OPERATOR_BOOL_PP(pre, post), which would add pre() and post() before and after the operator signature. For example:

3 4

[multimethods] Proposal: Open Multi-Methods
by Jean-Louis Leroy 01 Sep '13

01 Sep '13

Hi, I am working on library that pretty much implements what Pirkelbauer, Solodkyy and Stroustrup describe in their paper "Open Multi-Methods for C++" - although there are some divergences. I have posted it on GitHub: https://github.com/jll63/multimethods. Please examine the files in the "examples" directory to get an idea of how to use it. Salient features are: * syntax: is relatively uncluttered. There are no limitations on the number of virtual arguments. Virtual and non-virtual arguments can be arbitrarily mixed. Multiple inheritance is supported, with some limitations - see below. * speed: close to a virtual function call when the hierarchies involved in the virtual arguments collaborate with the library. Calling a method that does nothing, with a single virtual argument in a single inheritance hierarchy is 33% slower than the equivalent virtual function call. The difference becomes unnoticeable if the functions perform a few simple maths operations. See tests/benchmarks.cpp. * size: the dispatch table is constructed in terms of class groups. This results, most of the time, in a table devoid of redundancies. The size is bounded by the product of the number of specializers - not classes - in each dimension. * support for "foreign" class hierarchies: the library can be used without modifications to existing classes, at the cost of lower performance. Collaborating and foreign arguments can be freely mixed. Performance is still quite good, see the benchmarks. * next: a pointer to the next most specialized method is available inside method specializations - see examples/next.cpp. Alternatively, it is possible to call a specialization directly. Current limitations are: * restrictions on hierarchy: the classes involved in a method call must have a single root. Repeated inheritance is not supported. Multiple inheritance is supported, provided that the two conditions above are respected. * no overloading: multi-methods are implemented as constexpr function objects. This does not allow for overloading. This restriction can be easily side-stepped by wrapping multi-methods with different names in a set of overloaded functions. I know how to make multi-methods functions instead of objects, at the cost of a slightly less nice syntax for specializers. This is open to discussion. Besides, the library differs from Stroustrup et al's paper on the following points: * a specializer specializes only one multi-method: what would "next" mean otherwise? What would its static type be? * pure multi-methods are allowed: if called, an exception is thrown. This seems a better choice given that most of the time the declared virtual arguments will be abstract classes anyway. The library is essentially feature complete (if anything ever is). I am now going to work on the documentation, a build system, some clean up and compatibility (I tested it only with g++ 4.7.2 only so far). Is there interest in the Boost community for this stuff? If yes, I will adapt it to the guidelines and submit it for formal review. Of course, suggestions are welcome. Thank you for your time, Jean-Louis Leroy

5 10