- Boost - lists.boost.org

Trac open bugs - by assignee
by Marshall Clow 14 Apr '08

14 Apr '08

[ 286 open bugs today, 286 on Friday ] If you are maintaining a library, and have not logged into the trac system at <http://svn.boost.org/trac/boost/>, please do so ASAP. Until you do that, no tickets can be assigned to you, and will remain under "None". Instructions on working with tickets can be found at: <http://svn.boost.org/trac/boost/wiki/TicketWorkflow> and a mapping of user names to "real names" can be found at: <http://svn.boost.org/trac/boost/report/16> Bug summary 26 djowel 24 az_sw_dude 23 grafik 17 vladimir_prus 14 dave 14 bemandawes 12 doug_gregor 12 dgregor 11 no-maintainer 11 anthonyw 11 agurtovoy 9 jsiek 8 turkanis 8 ramey 7 nesotto 6 rogeeff 6 danieljames 6 None 5 witt 5 johnmaddock 5 igaztanaga 4 ebf 4 danielw 3 samuel_krempp 3 pdimov 3 pavol_droba 3 nasonov 3 kaalus 2 troyer 2 shammah 2 jmaurer 2 hkaiser 2 garcia 2 chris_kohlhoff 2 aaron_windsor 1 urzuga 1 t_schwinger 1 speedsnail 1 marshall 1 fcacciola 1 eric_niebler 1 dlwalker 1 <Blank> <Blank> 1750 Autolink library name not in sync with actually build lib None 1644 Boost.Test missing documentation file BOOST_CHECK_CLOSE_FRACTION.html None 1736 Headers containing non ASCII characters cause MS VC to issue warning 4819 in some locales None 1744 No information on building static libraries with bjam under Windows None 1763 wrong AST when parser_tag==0 None 1799 Boost.Test docs missing reference pages None 1810 HP-UX_ PA-RISC_ GCC 4.1+ sp_counted_base.hpp aaron_windsor 1622 Adjacency list needs to handle self-edges correctly aaron_windsor 778 top-level configure is broken agurtovoy 1001 gcc 4.1.2 segfaults on mpl/test/apply.cpp agurtovoy 1051 MPL header ordering triggers bug agurtovoy 1099 unable to iterate through a "non-explicitly-declared" mpl::set agurtovoy 1215 Boost 1.34.1_ mpl: Wrong workaround detection using MinGW32 (or.hpp_ line #33) agurtovoy 1317 has_xxx randomly broken in msvc agurtovoy 1469 [mpl] nested typedef of set has two different meanings agurtovoy 1476 always<> is not nullary. agurtovoy 1528 g++ 4.3.0 reports error because of redeclaration of next agurtovoy 1549 Boost.MPL: 'index_of' algorithm is not documented agurtovoy 1568 duplicate include guards agurtovoy 588 mpl::remove compile error with gcc 4.1.0 anthonyw 1154 tss destruction segfaults in conjunction with dlopen/dlclose anthonyw 1168 [thread] tss crashes randomly anthonyw 1268 xtime_cmp changes to deal with overflow were reverted anthonyw 1470 Boost.Thread: Compilation errors with non-__cdecl calling convention anthonyw 1657 Bug in boost::threads sample anthonyw 1713 no definitions for copy ctor and assignment operator for basic_condition_variable anthonyw 1805 thread creation crashes with /Zp1 switch in VS2005 compiler anthonyw 1813 Signed/Unsigned warning in win32/condition_variable anthonyw 1825 thread.hpp injects windows.h and breaks user application. anthonyw 876 xtime documentation incomplete anthonyw 881 errors when build with Apache stdcxx az_sw_dude 1028 typo in boost header: date_time/time_defs.hpp az_sw_dude 1078 from_iso_string cannot read the output from to_iso_string az_sw_dude 1098 Urgent libboost-date-time1.33.1 : bugs on ia64 ? az_sw_dude 1147 date_time library contains global #define ERROR az_sw_dude 1160 warning: month_format shadows a member of this az_sw_dude 1162 warning: ticks shadows a member of this az_sw_dude 1289 posix_time::time_facet forgets to pass a_ref argument to base class az_sw_dude 1299 change in typedef stringstream_type in format_date_parser.hpp causing compilation error az_sw_dude 1306 invalid docbook in date_period.xml az_sw_dude 1384 Linking problem with date_time library on Visual C++ 2008 Express az_sw_dude 1386 date_time documentation Jamfile breaks building of boost docs az_sw_dude 1524 format_date_parser.hpp(221) : cannot convert parameter 1 az_sw_dude 1574 operator<< for boost::posix_time::ptime ignores ostream flags az_sw_dude 1674 date_time::date_formatting.hpp: incorrectly formats year using global locale az_sw_dude 1695 add correct namespace to class to fix compilation bug az_sw_dude 1726 boost/date_time/posix_time/time_formatters.hpp incorrectly formats fractional seconds using global locale az_sw_dude 1740 date_time includes <windows.h> az_sw_dude 1788 local_time::local_time_period streaming operators not implemented az_sw_dude 287 wrong usage of ios_base::narrow az_sw_dude 316 date_time type conversion warning az_sw_dude 604 from_ftime incorrectly processes FILETIME filled with zeros az_sw_dude 642 operator<< for gregorian::date_duration not found az_sw_dude 889 Insane Dependencies az_sw_dude 890 date_time library supports only the current dst rule bemandawes 1378 filesystem path invalid name for hidden files (LINUX) bemandawes 1389 filesystem::ostream << boost::format generates operator ambigious error (in MSVC++) bemandawes 1458 Darwin Tiger throws std::runtime_error: locale::facet::_S_create_c_locale name not valid bemandawes 1578 bug in readdir_r_simulator() in a multi-threaded environment bemandawes 1583 Serious flaw in boost::filesystem filename handling (opensuse) bemandawes 1589 [filesystem] 'mbstate_t' : is not a member of 'std' bemandawes 1606 filesystem/src/exception.cpp doesn't build with gcc bemandawes 1613 Link Errors against file_system on OS X with Intel Version 10.1 C++ compilers bemandawes 1682 path_traits needs imbue() bemandawes 1701 boost::filesystem::remove_all - segmentation fault with wpath on Linux bemandawes 1711 Boost Serialization export facility broken on gcc 4.1_ 4.2 bemandawes 1767 missing file: boost/filesystem/cerrno.hpp bemandawes 1768 system: error_code.cpp #defines macros without checking whether already defined bemandawes 752 directory_iterator doesn't work with catch chris_kohlhoff 1703 [asio] Compiler warnings on VC8/9 + warning level 4 chris_kohlhoff 1820 win_iocp_socket_service::accept() doesn't update error_code danieljames 1554 When BOOST_HASH_NO_EXTENSIONS is defined hash doesn't support new string types. danieljames 1555 When BOOST_HASH_NO_EXTENSIONS is defined hash doesn't support boost::system::error_code danieljames 1705 [boostbook] Spaces in reference file names for types like 'long long' danieljames 1742 Some bugs in http://www.boost.org/doc/libs/1_35_0 danieljames 1743 Documentation has incorrect Build & Link settings for some libraries danieljames 1818 The tables in status reports jump all over the place. danielw 1044 Argument pack inaccessable in a functions return type danielw 1054 Parameter takes an "infinite" amount of time to compile with the Intel compiler. danielw 1097 keyword.hpp generates many warnings C4180: qualifier applied to function type has no meaning; ignored danielw 1784 [parameter] missing include dave 1010 linking boost.python on freebsd dave 1019 iterator_facade::pointer should be the return type of operator-> (DR 445) dave 1085 Python rules for compiling in Mac OS X dave 1179 [boost.python] can not export a union in VC2005sp1 dave 1181 [boost.python] can modify enum value dave 1387 Review / update docs to reflect changes dave 1460 Python classes with multiple bases are convertible only to the first class in the lists dave 1482 boost::python::throw_error_already_set should be marked noreturn dave 1516 [python] Failing VC9 regression tests dave 1599 [python] '_set_se_translator': identifier not found dave 1697 [utility][noncopyable] ADL barrier broken by msvc-9.0 dave 1730 No debug libs on Windows by default dave 865 Use of C++0x keyword as identifier dave 910 gcc strict-aliasing problems with python dgregor 1009 Improper overflow handling in shortest paths algorithms dgregor 1164 Floyd Warshall broken with unsigned edge weights dgregor 1192 [boostbook] problem when two files have the same name dgregor 1199 configure doesn't work with path containing whitespaces (MacOS X) dgregor 1310 [result_of] const-qualified function pointer doesn't work dgregor 1326 Unable to check graph isomorphism using LEDA adapter dgregor 1391 dominator_tree_test on Borland/CodeGear outputs overly long line dgregor 1395 Write Tests for Python Bindings dgregor 1630 gcc-4.3: adjacency_list.hpp includes deprecated header dgregor 556 Bundled graph properties dgregor 732 Johnson All-Pairs needs better "no path" information dgregor 736 Const correctness violation djowel 1170 Emit Warnings instead of # symbols in the syntax highlighter djowel 1171 Quickbook title output djowel 1172 non-utf djowel 1176 Space after inline code djowel 1206 Escaping from within code? djowel 1273 CR+LF newlines in position_iterator djowel 1276 spirit problem with _GLIBCXX_DEBUG djowel 1277 Closing section like [pre with } causes Quickbok to crash djowel 1280 sections in imported source files get put inside <para> elements in docbook output djowel 1281 Quickbook produces invalid BoostBook/DocBook XML djowel 1324 tuple should have a swap() that operates element-by-element djowel 1396 wrong result_of invocation around transform_view djowel 1436 [quickbook] inline code inside headings djowel 1484 Quickbook produces illegal docbook for some docinfo fields. djowel 1500 [Spirit/Phoenix] C4512 Compiler warnings from VC8 djowel 1570 Some boost headers aren't ready for gcc 4.3 djowel 1600 duplicate include guard djowel 1601 distane of boost::tuple djowel 1607 Tuple Library Documentation Changes djowel 1610 [MSVC/STLport] [tree/common.hpp] Standard library requirements violation(incomplete type as vector parameter) djowel 1614 vector workaround needed for MSVC9 djowel 1617 spirit gcc-4.3 fix djowel 1619 [Fusion] C4512 warnings from VC9 (Visual Studio 2008) djowel 1651 incorrect typedefs in examples djowel 1722 [TR1/Fusion] Conflict between TR1 and Fusion headers djowel 1764 wrong AST when parser_tag==0 dlwalker 613 boost/crc.hpp uses non-standard conforming syntax doug_gregor 1021 [Graph][reverse_graph] Problem using reverse_graph adapter with an adapted user defined graph doug_gregor 1076 compile error: disconnecting struct with operator()() doesn't work in VS2005 SP1 doug_gregor 375 LEDA graph adaptors do not handle hidden nodes properly doug_gregor 402 random_vertex/random_edge are unnecessarily inefficient doug_gregor 403 Document copy_component doug_gregor 447 reverse_graph and constness of property maps doug_gregor 708 Dijkstra no_init version should not require VertexListGraph doug_gregor 733 Numbered headers don't work with "preferred" syntax doug_gregor 735 Fruchterman-Reingold grid performance can be improved doug_gregor 738 Memory leaks with signal::connect? doug_gregor 829 Implicit graph not implement doug_gregor 852 Problem with Boost and GCC 4.1 ebf 1507 [variant] C4512 warnings from VC8.0 ebf 1548 [variant][docs]typo: formal arg_ operand_ should be v in times_two arglist ebf 1654 recursive variants do not handle nested variants correctly. ebf 993 Variant should use least common multiple of alignments_ rather than maximum eric_niebler 1796 compile error when SDL_syswm.h (from sdl library) is included before foreach.hpp fcacciola 1666 Visualizer for boost::optional garcia 1581 Boost.MultiArray: Resizing bug if the index is not 0-based garcia 1741 Review schedule out of date grafik 1041 Cygwin requires PATH setting. grafik 1322 trac rejects patch attachment as spam grafik 1406 Understanding the Tables outdated grafik 1417 Regresson tests hang in Darwin (Tiger) grafik 1430 Regression fails under Cygwin grafik 1433 Trac's spam detection rejects too many valid messages grafik 1512 Broken link to vacpp in bjam docs. grafik 1513 Broken link to bcpp in bjam docs. grafik 1576 cannot read non-ASCII output messages grafik 1577 Some commands don't work because hStdInput == 0 grafik 1663 build.bat cannot set/reset ERRORLEVEL grafik 1733 Website layout overlays on IE7 grafik 1735 [website] Wrong HTML on main documentation page. grafik 1738 Boost Jam details and download link grafik 1739 Search box and Google link grafik 1753 Python docs: bad link to the Jamroot grafik 1769 Broken links in documentation index. grafik 1771 Statechart TOC mangled. grafik 1775 website bugs for 1.35.0 docs grafik 1776 Documentation page renders incorrectly in Safari 3.1 on OS X grafik 616 Boost Jam_ and non english directorys grafik 959 linking fails when Boost is compiled with STLport 5.1.* on Linux (names mismatch) grafik 986 Problem building Python modules on boost 1.34.0 hkaiser 1079 boost-1.34.0 fails to compile. concept checks not satisfied. hkaiser 1670 wave almost unusably slow on real-world input igaztanaga 1080 boost::interprocess win32 global file mapping issue igaztanaga 1210 interprocess::barrier hangs during second use under linux (boost 1.33.1) igaztanaga 1390 Interpocess: managed shared memory failing completely under OS X igaztanaga 1634 boost::interprocess::vector cannot contain volatile int igaztanaga 1635 Incomplete include guard in boost/intrusive jmaurer 351 Diff in state of mersenne_twister gen between GCC3.41 & CW9 jmaurer 599 uniform_01 copies engine instead of using a reference johnmaddock 1081 Empty string rejected as perl-style regex johnmaddock 1411 Fix BOOST_PARTIAL_SPECIALIZATION_EXPLICT_ARGS johnmaddock 1446 POSIX API doesn't use C locale johnmaddock 1451 error: use of C99 long long integer constant johnmaddock 1765 Need a macro to determine whether basic streams are present jsiek 1531 segfault in dynamic_bitset::reference assign operator jsiek 1540 Poisson distribution very slow for large mean (and may also overflow). jsiek 1755 Boost.tokenizer is broken for wide characters - patch attached jsiek 1798 met an error using boost::tokenizer in multi-times in vs2005_ unicode jsiek 575 Calling subgraph::global_to_local on a root graph jsiek 636 strange compiling problem for transitive_closure jsiek 815 remove_edge core dumps on self-circle jsiek 875 No iterator based constructor for adjacency_matrix jsiek 900 graphml reader namespace handling is broken kaalus 1184 property_tree assignment (operator) bug kaalus 1604 property_tree xml parser doesn't compile with gcc kaalus 1678 Boost.property_tree::read_xml does not parse UNICODE file with BOMs marshall 1252 [pool] severe overhead with unaligned sizes. nasonov 1220 lexical_cast requires RTTI nasonov 1704 [any] 4512 warning from VC8/9 on warning level 4 nasonov 754 boost::any - typeid comparison across shared boundaries nesotto 1629 range/iterator_range.hpp bug nesotto 1675 [range] VC8 - compiler warnings when including range/array headers nesotto 1694 NDEBUG vs. BOOST_ASSERT in iterator_range.hpp nesotto 1748 [ptr_container] compiler warnings from VC9 nesotto 1754 Illegal HTML in range docs. nesotto 1785 assign::list_of works poorly with class constructors nesotto 1795 [ptr_container] minor documentation typo no-maintainer 1068 Mersenne twister disables streaming for Visual C++ no-maintainer 1222 lambda::ret<T> should declare result_type. no-maintainer 1270 uniform_smallint doesn't compile with lagged_fibonacci random number generators no-maintainer 1515 [lambda] C4512 warnings from VC8.0 no-maintainer 1544 uniform_01 w/ref template param causes ref to ref error no-maintainer 1546 Method boost::random::uniform_int::operator()(engine_ value) is missing no-maintainer 1572 [lambda] smart pointer const-ness affects its contents no-maintainer 1632 Default Interval rounding policies incomplete no-maintainer 1691 [Random] Brokem MSVC workaround no-maintainer 781 Lambda: (_1 + "y")(string("x")) Doesn't Compile no-maintainer 819 uniform_int<> with type's maximum availaible range error pavol_droba 1152 rle_example fails pavol_droba 1385 begin must be boost-qualified pavol_droba 1761 StringAlgo: Error in an example pdimov 1106 shared_ptr<T> should not convert to shared_ptr<U> when T* doesn't convert to U* pdimov 1719 [addressof] Can't obtain the address of an instance of an anonymous struct pdimov 1762 BOOST_DISABLE_THREADS should imply BOOST_SP_DISABLE_THREADS ramey 1708 Can't serialize class with private destructor ramey 1734 BOOST_STATIC_WARNING can't be passed a dependent expression ramey 1747 [serialization] unreferenced formal parameter warnings from VC9 ramey 1807 boost::archive::xml_archive_exception does not store error code and reports wrong message text ramey 1812 Boost.Serialization fails to build on Cygwin ramey 1822 header dependency in boost/serialization/map.hpp ramey 1823 Archive concept: Incomplete description? ramey 1824 serialization keeps using wchar_t if BOOST_NO_STD_WSTRING is set rogeeff 1383 signal.h features not found on Mac OS rogeeff 1542 [test] compiler errors when building with stdcxx library rogeeff 1676 Dead links on Boost.Test example documentation. rogeeff 1723 No subprocess can be started in init_unit_test_suite rogeeff 1746 Online documentation for 1.35.0 is out of date for current lib version rogeeff 1781 Empty page in Test documentation samuel_krempp 1699 Compile warning about initialization order. samuel_krempp 1801 Typo in documentation. samuel_krempp 859 boost::format ignores a user defined locale shammah 290 perfomance: memory cleanup for pool takes too long shammah 386 boost::pool_allocator breaks with vector of vectors speedsnail 1138 Problems with TSS and static thread library t_schwinger 1653 wave executable erroneously required for build of function_types lib troyer 1774 serialization: file written with 1.34.1 can't be read in with 1.35 troyer 1778 Possible regression in 1.35 serialization of 2D arrays turkanis 1523 [iostreams] VC8/VC9 compiler warnings turkanis 1545 [boost/rational.hpp] 'noskipws' is not a member of 'std' turkanis 1579 gzip compressor should model DualUseFilter turkanis 1580 Add static assert to prohibit instantiating a chain with mode dual_use turkanis 1649 Fix definition of JavaScript menu to avoid long chains of functions turkanis 1656 Consider implementing flush() for symmetric filters turkanis 1671 type mismatch of buffer size parameter causes overload resolution to fail turkanis 1727 Sample code in documentation does not compile_ has namespace errors. urzuga 574 [boost::lambda] Compile error with libstdc++ debug mode vladimir_prus 1132 program_options documentation error. vladimir_prus 1165 more quoting problems vladimir_prus 1274 Useless error message vladimir_prus 1321 invalid docbook in tool documentation vladimir_prus 1527 [program_options] Second (and subsequent) lines in tabbed text not aligned correctly vladimir_prus 1530 Program options documentation - Overview - Syntactic Information example typo vladimir_prus 1537 no value given in 'mysql_password =' vladimir_prus 1584 cryptic bbv2 error building quickbook vladimir_prus 1587 [program_options] crashes if value part missing in external configuration file vladimir_prus 1588 [program_options] crashes if value part missing in external configuration file vladimir_prus 1645 Invalid unicode support for default_value vladimir_prus 1679 added 4-way universal binary support from mac osx (ppc_ ppc64_ i386_ x86_64) vladimir_prus 1809 Allow empty values in conf file vladimir_prus 1816 --build-type=complete broken in current svn vladimir_prus 469 multitoken broken vladimir_prus 689 [program_options] Endless loop with long default arguments vladimir_prus 850 program_options strips off escaped quotes in some situations witt 1046 Boost.Python quickstart instructions mention nonexistent target witt 583 Fixes for build on IBM pSeries for AIX and Linux witt 834 Homepage regression links witt 957 The "Getting Started" page does not mention the stdlib option witt 973 zip_iterator has value_type == reference -- -- Marshall Marshall Clow Qualcomm, Inc. <mailto:mclow@qualcomm.com> The famous British scientist, Lord Kelvin, said: "When you measure what you are speaking about and express it in numbers, you know something about it, but when you cannot (or do not) measure it, when you cannot (or do not) express it in numbers, then your knowledge is of a meagre and unsatisfactory kind."

1 0

Generating a single functor from multiple ones
by Mathias Gaunard 14 Apr '08

14 Apr '08

I would be quite interested in an utility that could generate a single functor with multiple overloads from multiple functors. It could be quite useful for example to visit a variant and all kinds of pattern matching. I tried to implement it, using this [1] as a basis. But then I wanted to add Lambda and ResultOf support, and thus I realized the reflection mechanism could really help to figure out what argument_type should be. Any ideas about how to implement that and make it work with ResultOf and Lambda? [1] http://groups.google.com/group/comp.std.c++/msg/34b98493a8531d58

3 3

Re: [boost] Has someone any plans to submit a exception_ptr library to Boost?
by joaquin＠tid.es 14 Apr '08

14 Apr '08

Kowalke Oliver (QD IT PA AS) escribió: > I'm sorry - the exception_ptr_impl.hpp needs a modification (case where no user > defined types are passed). Now it's corrected. > Oliver > > /*************************************************************************** > * Copyright (C) 2008 by Oliver Kowalke * > * kowalke@drslx002 * > * * > * This program is free software; you can redistribute it and/or modify * > * it under the terms of the GNU General Public License as published by * > * the Free Software Foundation; either version 2 of the License, or * > * (at your option) any later version. * > [...] Hi Oliver, Just a remark: if this piece of code finally makes it into Boost, you'll likely be requested to change the licensing terms to those of the BSL (http://www.boost.org/users/license.html ) Best, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

thoughts on logging library
by Christian Holmquist 14 Apr '08

14 Apr '08

Hi, I saw that the previously proposed logging library went into the review queue again, so I thought of pointing out some remarks prior the actual review. First of all, I think that a boost logging library should come up with one, and one only, way of expressing a log line. BOOST_LOG(some, kind, of, args); Now, how should the interface of BOOST_LOG(...) look like? To find that out, I'll start by explaining how I would like boost log to behave from a users point of view, for instance using boost.Asio. #define BOOST_ASIO_LOG_ENABLE #define BOOST_ASIO_LOG_MIN_LEVEL boost::log::level::debug #include <boost/asio/asio.hpp> // Insert lots of broken client code here... =) What I want to do is configure the amount of logging code that gets generated inside asio, not if the logging functionality is enabled at runtime or so. Without BOOST_ASIO_LOG_ENABLE there should be no logging code, from asio, in the executable.. I could use side by side another config for another boost library #define BOOST_SERIALIZATION_LOG_ENABLE #define BOOST_SERIALIZATION_LOG_MIN_LEVEL boost::log::level::error // only care about error logs to avoid spamming, for instance.. #include <boost/serialization.hpp> So, I've only informed the libraries that I want log to be generated, not anything about where it'll end up, or what kind of information it'll contain. The author of Asio also doesn't know what kind of information that will be generated either, but can, and should, only provide what is available from the library's point of view. // somewhere in asio code BOOST_ASIO_LOG(log::level::debug, "shutting down service.."); or, another way BOOST_ASIO_LOG_DEBUG(asio::g_log, "closing socket " << native_handle_id_); something like this is what I'm used to, but it's just for discussion. in the million ++ lines of code we have in our project we configure logs depending on system and level. That's the input required to make a log statement, the rest are details filled in by the log system itself, but it's not very interesting. a log message could automatically create the following in default config. struct msg { const char* system; //i.e. "asio" const char* source_file; const char* source_line; const char* function_name; std::string user_message; }; or it could be anything else that boosters think is portable and makes sense. My point is that libraries in boost should not deal with this, they must only learn the interface and some configuration macros of boost log (for handling the compile time enable/disable of loggin macros), and then provide the log system with the information -they have-, the rest is config details (such as log sinks and formatters). Configuring the above with a compiled library like boost serialization is an interesting task as well, that I definitely think should be addressed. could be that the flexibility decreases some in such a scenario, or it could be configued in site-config.jam or whatever. Is this along the line what boost.log has in mind, or will it be a logging library not to be used by the boost libraries themselves? Regards, Christian

3 8

Enum naming conventions
by Maciej Sobczak 14 Apr '08

14 Apr '08

Hi, Is there an established naming convention for enum names in Boost? I don't see anything truly consistent. Consider this: enum eGrays { eBlack, eDarkGray, eGray, eLightGray, eWhite }; Is this commonly accepted by the Boost community? If not, what alternative naming for the above would you propose? Regards, -- Maciej Sobczak * www.msobczak.com * www.inspirel.com

4 4

[test] reporting problems from tests
by Maxim Yanchenko 14 Apr '08

14 Apr '08

Hi Gennadiy! I'm using Boost.Test 1.34.1. I have some questions: 1) Is it possible to customize the output? As I see in boost/test/impl/compiler_log_formatter.ipp: void compiler_log_formatter::print_prefix( std::ostream& output, const_string file, std::size_t line ) { output << file << '(' << line << "): "; } This is MSVC compiler output syntax, and integrates with MSVS only. But many other compilers (at least gcc, suncc) and unix tools like grep print their messages in the form "filename:line: ", and there are many tools/IDEs supporting exactly this format but not "filename(line): ". Is it possible to customize it? Maybe by using Boost.Format, or any kind of config #define, or anything else. 2) timeout. You working with timeout using SIGALRM, but this interferes affects sleep(), alarm() etc. You can read about it here: http://www.opengroup.org/onlinepubs/000095399/functions/sleep.html To me, it looks dangerous as there are many applications calling sleep(). What do you think? 3) --catch_system_errors Is it possible to set it to false by default? Everybody wants to have a core dump if the program crashed, the only scenario when cores are unwelcome - huge test suits with many-many binaries, when crashing tests can just exhaust disk space. But such huge test suits will be run from scripts where the number of parameters doesn't matter. But when I run a single test manually - I (and everybody I know) expect it to crash, to have a possibility to dive into the core with the debugger. You know the errors leading to crashes are usually very hard to reproduce, so it's quite frustrating when you lose a chance to understand an error just because you forgot to type this "--catch_system_errors=no" or forgot to setup environment variable. I just faced this problem. The test crashed but no core was dumped. Immediate rerun gave no crash. So I just ran the test in cycle and only after two(!) hours it finally crashed. That's why I'm voting for setting crash the default option. For now I just went to the boost sources and changed the code to make "no" default option. But I'm looking for more elegant solution. For example, why not to place all default values to config defines like BOOST_TEST_DEFAULT_SOMETHING? 4) I finally found the problem in the crashing test - it crashed inside Boost.Test due to parallel calls to Boost.Test checks. Any plans to do anything with this? 5) Printing objects in failed tests For example, what if I have BOOST_CHECK_EQUAL(a,b) and there is no operator<< defined in the classes? Or they're defined, but do something that I don't want to see in this particular test output (because it dumps the object in binary form, for example)? Is it possible to customize this somehow, e.g. by passing a printing functor as a third parameter, or any other way? Bests, Maxim

2 1

A C++ puzzler
by Eric Niebler 13 Apr '08

13 Apr '08

I recently had a C++ problem and found an answer that tickled my brain. In the spirit of Car Talk on NPR, I thought I'd share it in the form of a puzzler. Say that you are given a set of types, and you must find the "common" type, where common is defined as follows: - If all the types are the same, say X, then the common type is X - If some types are X and some are Default (where Default is a known special type), the common type is X - If some types are X and some are Y (and neither X nor Y is Default), then there is no common type. It's an error and you should issue a diagnostic. So for example: [Default, Default, Default] --> Default [Default, A, Default] --> A [B, B, B] --> B [Default, C, D] --> Error, issue diagnostic. And here's the kicker ... do it in O(1). No O(N) recursive template instantiations allowed. Assume that the maximum size of the set is known ahead of time. Answer next week, unless someone beats me to it. -- Eric Niebler Boost Consulting www.boost-consulting.com

11 25

[smart_ptr] small step approach
by Daniel Frey 13 Apr '08

13 Apr '08

Hi, since passing or not passing the deleter to sp_accept_owner seems controversial, I'd like to try another approach: Smaller patches/steps. The attached patch is a minimalistic version of my previous patches. It doesn't change sp_accept_owner's current design. With this patch, I'd be able to implement my own, optimized version of enable_shared_from_this, which is otherwise not possible. Do you see any problem with this patch or with the approach in general? Regards, Daniel

1 0

High Cost of MS "Safe" STL for Release Builds
by Mat Marcus 13 Apr '08

13 Apr '08

### Overview ### In a recent thread regarding issues in the boost::System library, we began a discussion on the performance cost, *in release builds*, of accepting the default Microsoft compiler setting that enables the so-called secure STL feature. In this post I am adding some source code excerpts, from a colleague's benchmark suite, that I used to generate the results (reproduced below). I am also changing the subject line to better reflect the topic under discussion. Summary: In VC8 (Dev Studio 2005) and later, Microsoft's 'secure' STL feature (enabled by default) can cause a slowdown of more than an order of magnitude in the execution of performance critical algorithms in release builds. I suspect that many projects would benefit from ensuring that _SECURE_SCL=0 for release configurations. I recommend that boost ships with this feature disabled by default for (at least) release builds. Microsoft product managers claim that the performance cost for release builds is negligible. For example, Peter Dimov cited a thread that lead me to the following claim: Martyn Lovell> I strongly recommend against turning off Martyn Lovell> _SECURE_SCL. The perf win is normally minor, and Martyn Lovell> the security risk is much higher. If you find a Martyn Lovell> major perf issue with _SECURE_SCL, please let us Martyn Lovell> know. http://forums.microsoft.com/MSDN/ShowPost.aspx?PostID=863481&SiteID=1#882374 The benchmarks below offer a different view of the performance costs. (Please don't confuse this discussion with the separate feature controlling compiler warnings. In some configurations, the MS compiler warning that routines like std::copy are inherently unsafe. The original text of the warnings claimed that such routines had been "deprecated". We have not deprecated such routines in the C++ committee. The _SCL_SECURE_NO_DEPRECATE can be used to control such warnings, but this issue is separate from the performance impact of the _SECURE_SCL feature.) A colleague has been developing some benchmarks that aim to help compiler vendors ensure that they properly support C++ programming, and to help programmers understand the costs of the algorithms and data structures that they use. Instead of using his suite to measure the relative performance of different compilers, I ran some tests completely under VC 9 to measure only the Release build performance of the 'secure' STL. (Interestingly, the penalty seems to have increased from VC8 to VC9. But the numbers for VC8 are also disheartening.) ### Details ### I ran the stepanov_vector benchmark (excerpted below) twice, once with default boost build settings ("secure" STL enabled) and once with it turned off. That is, I built with settings roughly equivalent to: bjam release bjam release define=_SCL_SECURE=0 This benchmark attempts, amongst other things, to measure the abstraction penalty by comparing the performance of different algorithms when using a vendor's vector with associated iterator type vs. an array with pointers. When reading the results below, 'double pointer' denotes a test using an array of doubles (pointer iterators), where 'double vector' means a vector of doubles (vector::iterator). Note that sometimes the penalty exceeds an order of magnitude . In light of these results, one could argue that_SECURE_SCL for release builds is a misfeature. I won't debate whether it is worth the slowdown for normal (non-extreme) debugging situations. Results follow for 'secure' STL and then normal STL. These are followed by a source code excerpt from the pre-release benchmark suite. As Peter pointed out, SECURE_SCL setting must be consistent throughout linkage units, or else the resulting ODR violations can lead to memory corruption etc. For this reason, I would like to see boost build add a link-incompatible feature, something like: on/off :-) whose default setting is off for release. Of course something like might be a more realistic name. Of course one can manually achieve a similar effect using the bjam command line above. But with such an approach it is too easy to mix and match, the defaults are backwards, and there seems to be relatively little support for projects built with boost build that bring in boost libraries via properties. Alternatively, it might be worth considering whether we could control the feature via configuration header files. - Mat ### release build with _SECURE_SCL enabled ### c:\boxer\performance\projects\msvc8\Release\stepanov_vector.exe test description absolute operations ratio with number time per second test0 0 "double pointer verify2" 3.03 sec 989.77 M 1.00 1 "DoubleClass pointer verify2" 3.05 sec 984.57 M 1.01 2 "double vector" 16.14 sec 185.86 M 5.33 3 "DoubleClass vector" 18.19 sec 164.95 M 6.00 4 "double vector reverse" 26.23 sec 114.35 M 8.66 5 "DoubleClass vector reverse" 26.20 sec 114.49 M 8.65 6 "double vector reverse reverse" 31.25 sec 96.00 M 10.31 7 "DoubleClass vector reverse reverse" 31.25 sec 96.00 M 10.31 Total absolute time for Vector accumulate: 155.34 sec Vector accumulate Penalty: 5.92 test description absolute operations ratio with number time per second test0 0 "insertion_sort double pointer verify2" 1.16 sec 2.60 M 1.00 1 "insertion_sort DoubleClass pointer verify2" 1.58 sec 1.90 M 1.37 2 "insertion_sort double vector" 19.58 sec 0.15 M 16.94 3 "insertion_sort DoubleClass vector" 18.00 sec 0.17 M 15.57 4 "insertion_sort double vector reverse" 30.56 sec 0.10 M 26.44 5 "insertion_sort DoubleClass vector reverse" 29.06 sec 0.10 M 25.14 6 "insertion_sort double vector reverse reverse" 43.03 sec 0.07 M 37.22 7 "insertion_sort DoubleClass vector reverse reverse" 43.05 sec 0.07 M 37.24 Total absolute time for Vector Insertion Sort: 186.02 sec Vector Insertion Sort Penalty: 16.49 test description absolute operations rati o with number time per second test 0 0 "quicksort double pointer verify2" 1.64 sec 14.63 M 1.00 1 "quicksort DoubleClass pointer verify2" 1.95 sec 12.29 M 1.19 2 "quicksort double vector" 5.03 sec 4.77 M 3.07 3 "quicksort DoubleClass vector" 5.22 sec 4.60 M 3.18 4 "quicksort double vector reverse" 7.16 sec 3.35 M 4.36 5 "quicksort DoubleClass vector reverse" 7.34 sec 3.27 M 4.48 6 "quicksort double vector reverse reverse" 8.84 sec 2.71 M 5.39 7 "quicksort DoubleClass vector reverse reverse" 9.06 sec 2.65 M 5.52 Total absolute time for Vector Quicksort: 46.25 sec Vector Quicksort Penalty: 3.52 test description absolute operations rati o with number time per second test 0 0 "heap_sort double pointer verify2" 1.81 sec 13.24 M 1.00 1 "heap_sort DoubleClass pointer verify2" 1.88 sec 12.80 M 1.03 2 "heap_sort double vector" 7.84 sec 3.06 M 4.33 3 "heap_sort DoubleClass vector" 7.89 sec 3.04 M 4.35 4 "heap_sort double vector reverse" 10.80 sec 2.22 M 5.96 5 "heap_sort DoubleClass vector reverse" 10.31 sec 2.33 M 5.69 6 "heap_sort double vector reverse reverse" 13.23 sec 1.81 M 7.30 7 "heap_sort DoubleClass vector reverse reverse" 13.22 sec 1.82 M 7.29 Total absolute time for Vector Heap Sort: 66.98 sec Vector Heap Sort Penalty: 4.46 ### release build with _SECURE_SCL disabled ### c:\boxer\performance\projects\msvc8\Release\stepanov_vector.exe test description absolute operations ratio with number time per second test0 0 "double pointer verify2" 3.03 sec 989.45 M 1.00 1 "DoubleClass pointer verify2" 3.05 sec 984.57 M 1.00 2 "double vector" 3.06 sec 979.75 M 1.01 3 "DoubleClass vector" 3.05 sec 984.57 M 1.00 4 "double vector reverse" 3.06 sec 979.75 M 1.01 5 "DoubleClass vector reverse" 3.05 sec 984.57 M 1.00 6 "double vector reverse reverse" 3.09 sec 969.62 M 1.02 7 "DoubleClass vector reverse reverse" 3.06 sec 979.43 M 1.01 Total absolute time for Vector accumulate: 24.45 sec Vector accumulate Penalty: 1.01 test description absolute operations ratio with number time per second test0 0 "insertion_sort double pointer verify2" 1.16 sec 2.60 M 1.00 1 "insertion_sort DoubleClass pointer verify2" 1.58 sec 1.90 M 1.37 2 "insertion_sort double vector" 1.58 sec 1.90 M 1.37 3 "insertion_sort DoubleClass vector" 2.08 sec 1.44 M 1.80 4 "insertion_sort double vector reverse" 1.55 sec 1.94 M 1.34 5 "insertion_sort DoubleClass vector reverse" 2.03 sec 1.48 M 1.76 6 "insertion_sort double vector reverse reverse" 1.59 sec 1.88 M 1.38 7 "insertion_sort DoubleClass vector reverse reverse" 2.09 sec 1.43 M 1.81 Total absolute time for Vector Insertion Sort: 13.66 sec Vector Insertion Sort Penalty: 1.53 test description absolute operations rati o with number time per second test 0 0 "quicksort double pointer verify2" 1.75 sec 13.71 M 1.00 1 "quicksort DoubleClass pointer verify2" 2.06 sec 11.64 M 1.18 2 "quicksort double vector" 1.80 sec 13.36 M 1.03 3 "quicksort DoubleClass vector" 2.14 sec 11.21 M 1.22 4 "quicksort double vector reverse" 1.78 sec 13.48 M 1.02 5 "quicksort DoubleClass vector reverse" 2.13 sec 11.29 M 1.21 6 "quicksort double vector reverse reverse" 1.78 sec 13.48 M 1.02 7 "quicksort DoubleClass vector reverse reverse" 2.16 sec 11.13 M 1.23 Total absolute time for Vector Quicksort: 15.59 sec Vector Quicksort Penalty: 1.13 test description absolute operations rati o with number time per second test 0 0 "heap_sort double pointer verify2" 1.80 sec 13.36 M 1.00 1 "heap_sort DoubleClass pointer verify2" 1.83 sec 13.12 M 1.02 2 "heap_sort double vector" 1.88 sec 12.80 M 1.04 3 "heap_sort DoubleClass vector" 2.05 sec 11.73 M 1.14 4 "heap_sort double vector reverse" 2.14 sec 11.21 M 1.19 5 "heap_sort DoubleClass vector reverse" 2.28 sec 10.52 M 1.27 6 "heap_sort double vector reverse reverse" 1.88 sec 12.80 M 1.04 7 "heap_sort DoubleClass vector reverse reverse" 2.03 sec 11.81 M 1.13 Total absolute time for Vector Heap Sort: 15.88 sec Vector Heap Sort Penalty: 1.12 ### pre-release benchmark source code excerpt ### /* Copyright 2007-2008 Adobe Systems Incorporated Distributed under the MIT License (see accompanying file LICENSE_1_0_0.txt or a copy at http://stlab.adobe.com/licenses.html) Goal: examine any change in performance when moving from pointers to vector iterators Assumptions: 1) Vector iterators should not perform worse than raw pointers. 2) Using a vector should not perform worse than using a plain array of values. HIstory: This is similar to Alex Stepanov's original abstraction penalty benchmark. But the use of the STL container adds complexity and dependencies that don't fit with the design of the original benchmark, so this is broken out into a separate test. Now we are testing the STL vector implementation in addition to the compiler. #include #include #include #include #include #include #include "benchmark_results.h" #include "benchmark_timer.h" #include "benchmark_algorithms.h" #include /******************************************************************************/ // a single double value wrapped in a struct struct DoubleClass { double value; DoubleClass() {} DoubleClass(const double& x) : value(x) {} operator double() { return value; } }; inline DoubleClass operator+(const DoubleClass& x, const DoubleClass& y) { return DoubleClass(x.value + y.value); } inline bool operator<(const DoubleClass& x, const DoubleClass& y) { return (x.value < y.value); } /******************************************************************************/ // reverse iterator template template struct reverse_iterator { RandomAccessIterator current; reverse_iterator(RandomAccessIterator x) : current(x) {} T& operator*() const { RandomAccessIterator tmp = current; return *(--tmp); } }; // really a distance between pointers, which must return ptrdiff_t // because (ptr - ptr) --> ptrdiff_t template inline ptrdiff_t operator-(reverse_iterator& xx, reverse_iterator& yy) { return (ptrdiff_t)( yy.current - xx.current ); } template inline reverse_iterator& operator++(reverse_iterator &xx) { --xx.current; return xx; } template inline reverse_iterator& operator--(reverse_iterator &xx) { ++xx.current; return xx; } template inline reverse_iterator operator++(reverse_iterator &xx, int) { reverse_iterator tmp = xx; ++xx; return tmp; } template inline reverse_iterator operator--(reverse_iterator &xx, int) { reverse_iterator tmp = xx; --xx; return tmp; } template inline reverse_iterator operator-(reverse_iterator &xx, ptrdiff_t inc) { reverse_iterator tmp = xx; tmp.current += inc; return tmp; } template inline reverse_iterator operator+(reverse_iterator &xx, ptrdiff_t inc) { reverse_iterator tmp = xx; tmp.current -= inc; return tmp; } template inline reverse_iterator& operator+=(reverse_iterator &xx, ptrdiff_t inc) { xx.current -= inc; return xx; } template inline reverse_iterator& operator-=(reverse_iterator &xx, ptrdiff_t inc) { xx.current += inc; return xx; } template inline bool operator<(const reverse_iterator& x, const reverse_iterator& y) { return (y.current < x.current); } template inline bool operator==(const reverse_iterator& x, const reverse_iterator& y) { return (x.current == y.current); } template inline bool operator!=(const reverse_iterator& x, const reverse_iterator& y) { return (x.current != y.current); } /******************************************************************************/ /******************************************************************************/ // this constant may need to be adjusted to give reasonable minimum times // For best results, times should be about 1.0 seconds for the minimum test run int iterations = 1500000; // 2000 items, or about 16k of data // this is intended to remain within the L2 cache of most common CPUs #define SIZE 2000 // initial value for filling our arrays, may be changed from the command line double init_value = 3.0; /******************************************************************************/ /******************************************************************************/ inline void check_sum(double result) { if (result != SIZE * init_value) printf("test %i failed\n", current_test); } /******************************************************************************/ template void verify_sorted(Iterator first, Iterator last) { if (!is_sorted(first,last)) printf("sort test %i failed\n", current_test); } /******************************************************************************/ // a template using the accumulate template and iterators template void test(Iterator first, Iterator last, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) check_sum( double( accumulate(first, last, zero) ) ); record_result( timer(), label ); } /******************************************************************************/ template void test_insertion_sort(Iterator firstSource, Iterator lastSource, Iterator firstDest, Iterator lastDest, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) { ::copy(firstSource, lastSource, firstDest); insertionSort< Iterator, T>( firstDest, lastDest ); verify_sorted( firstDest, lastDest ); } record_result( timer(), label ); } /******************************************************************************/ template void test_quicksort(Iterator firstSource, Iterator lastSource, Iterator firstDest, Iterator lastDest, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) { ::copy(firstSource, lastSource, firstDest); quicksort< Iterator, T>( firstDest, lastDest ); verify_sorted( firstDest, lastDest ); } record_result( timer(), label ); } /******************************************************************************/ template void test_heap_sort(Iterator firstSource, Iterator lastSource, Iterator firstDest, Iterator lastDest, T zero, const char *label) { int i; start_timer(); for(i = 0; i < iterations; ++i) { ::copy(firstSource, lastSource, firstDest); heapsort< Iterator, T>( firstDest, lastDest ); verify_sorted( firstDest, lastDest ); } record_result( timer(), label ); } /******************************************************************************/ /******************************************************************************/ // our global arrays of numbers to be summed double data[SIZE]; DoubleClass Data[SIZE]; double dataMaster[SIZE]; DoubleClass DataMaster[SIZE]; /******************************************************************************/ // declaration of our iterator types and begin/end pairs typedef double* dp; dp dpb = data; dp dpe = data + SIZE; dp dMpb = dataMaster; dp dMpe = dataMaster + SIZE; typedef DoubleClass* Dp; Dp Dpb = Data; Dp Dpe = Data + SIZE; Dp DMpb = DataMaster; Dp DMpe = DataMaster + SIZE; typedef std::vector::iterator vdp; typedef std::vector::iterator vDp; typedef std::vector::reverse_iterator rvdp; typedef std::vector::reverse_iterator rvDp; typedef reverse_iterator rrvdp; typedef reverse_iterator rrvDp; /******************************************************************************/ /******************************************************************************/ int main(int argc, char** argv) { double dZero = 0.0; DoubleClass DZero = 0.0; // output command for documentation: int i; for (i = 0; i < argc; ++i) printf("%s ", argv[i] ); printf("\n"); if (argc > 1) iterations = atoi(argv[1]); if (argc > 2) init_value = (double) atof(argv[2]); // seed the random number generator so we get repeatable results srand( (int)init_value + 123 ); ::fill(dpb, dpe, double(init_value)); ::fill(Dpb, Dpe, DoubleClass(init_value)); std::vector vec_data; std::vector vec_Data; vec_data.resize(SIZE); vec_Data.resize(SIZE); rrvdp rvdpb(vec_data.rend()); rrvdp rvdpe(vec_data.rbegin()); rrvDp rvDpb(vec_Data.rend()); rrvDp rvDpe(vec_Data.rbegin()); ::fill(vec_data.begin(), vec_data.end(), double(init_value)); ::fill(vec_Data.begin(), vec_Data.end(), DoubleClass(init_value)); test(dpb, dpe, dZero, "double pointer verify2"); test(Dpb, Dpe, DZero, "DoubleClass pointer verify2"); test(vec_data.begin(), vec_data.end(), dZero, "double vector"); test(vec_Data.begin(), vec_Data.end(), DZero, "DoubleClass vector"); test(vec_data.rbegin(), vec_data.rend(), dZero, "double vector reverse"); test(vec_Data.rbegin(), vec_Data.rend(), DZero, "DoubleClass vector reverse"); test(rvdpb, rvdpe, dZero, "double vector reverse reverse"); test(rvDpb, rvDpe, DZero, "DoubleClass vector reverse reverse"); summarize("Vector accumulate", SIZE, iterations, kShowGMeans, kShowPenalty ); // the sorting tests are much slower than the accumulation tests - O(N^2) iterations = iterations / 1000; std::vector vec_dataMaster; std::vector vec_DataMaster; vec_dataMaster.resize(SIZE); vec_DataMaster.resize(SIZE); // fill one set of random numbers fill_random( dMpb, dMpe ); // copy to the other sets, so we have the same numbers ::copy( dMpb, dMpe, DMpb ); ::copy( dMpb, dMpe, vec_dataMaster.begin() ); ::copy( dMpb, dMpe, vec_DataMaster.begin() ); rrvdp rvdMpb(vec_dataMaster.rend()); rrvdp rvdMpe(vec_dataMaster.rbegin()); rrvDp rvDMpb(vec_DataMaster.rend()); rrvDp rvDMpe(vec_DataMaster.rbegin()); test_insertion_sort(dMpb, dMpe, dpb, dpe, dZero, "insertion_sort double pointer verify2"); test_insertion_sort(DMpb, DMpe, Dpb, Dpe, DZero, "insertion_sort DoubleClass pointer verify2"); test_insertion_sort(vec_dataMaster.begin(), vec_dataMaster.end(), vec_data.begin(), vec_data.end(), dZero, "insertion_sort double vector"); test_insertion_sort(vec_DataMaster.begin(), vec_DataMaster.end(), vec_Data.begin(), vec_Data.end(), DZero, "insertion_sort DoubleClass vector"); test_insertion_sort(vec_dataMaster.rbegin(), vec_dataMaster.rend(), vec_data.rbegin(), vec_data.rend(), dZero, "insertion_sort double vector reverse"); test_insertion_sort(vec_DataMaster.rbegin(), vec_DataMaster.rend(), vec_Data.rbegin(), vec_Data.rend(), DZero, "insertion_sort DoubleClass vector reverse"); test_insertion_sort(rvdMpb, rvdMpe, rvdpb, rvdpe, dZero, "insertion_sort double vector reverse reverse"); test_insertion_sort(rvDMpb, rvDMpe, rvDpb, rvDpe, DZero, "insertion_sort DoubleClass vector reverse reverse"); summarize("Vector Insertion Sort", SIZE, iterations, kShowGMeans, kShowPenalty ); // these are slightly faster - O(NLog2(N)) iterations = iterations * 8; // iterations / 25 test_quicksort(dMpb, dMpe, dpb, dpe, dZero, "quicksort double pointer verify2"); test_quicksort(DMpb, DMpe, Dpb, Dpe, DZero, "quicksort DoubleClass pointer verify2"); test_quicksort(vec_dataMaster.begin(), vec_dataMaster.end(), vec_data.begin(), vec_data.end(), dZero, "quicksort double vector"); test_quicksort(vec_DataMaster.begin(), vec_DataMaster.end(), vec_Data.begin(), vec_Data.end(), DZero, "quicksort DoubleClass vector"); test_quicksort(vec_dataMaster.rbegin(), vec_dataMaster.rend(), vec_data.rbegin(), vec_data.rend(), dZero, "quicksort double vector reverse"); test_quicksort(vec_DataMaster.rbegin(), vec_DataMaster.rend(), vec_Data.rbegin(), vec_Data.rend(), DZero, "quicksort DoubleClass vector reverse"); test_quicksort(rvdMpb, rvdMpe, rvdpb, rvdpe, dZero, "quicksort double vector reverse reverse"); test_quicksort(rvDMpb, rvDMpe, rvDpb, rvDpe, DZero, "quicksort DoubleClass vector reverse reverse"); summarize("Vector Quicksort", SIZE, iterations, kShowGMeans, kShowPenalty ); test_heap_sort(dMpb, dMpe, dpb, dpe, dZero, "heap_sort double pointer verify2"); test_heap_sort(DMpb, DMpe, Dpb, Dpe, DZero, "heap_sort DoubleClass pointer verify2"); test_heap_sort(vec_dataMaster.begin(), vec_dataMaster.end(), vec_data.begin(), vec_data.end(), dZero, "heap_sort double vector"); test_heap_sort(vec_DataMaster.begin(), vec_DataMaster.end(), vec_Data.begin(), vec_Data.end(), DZero, "heap_sort DoubleClass vector"); test_heap_sort(vec_dataMaster.rbegin(), vec_dataMaster.rend(), vec_data.rbegin(), vec_data.rend(), dZero, "heap_sort double vector reverse"); test_heap_sort(vec_DataMaster.rbegin(), vec_DataMaster.rend(), vec_Data.rbegin(), vec_Data.rend(), DZero, "heap_sort DoubleClass vector reverse"); test_heap_sort(rvdMpb, rvdMpe, rvdpb, rvdpe, dZero, "heap_sort double vector reverse reverse"); test_heap_sort(rvDMpb, rvDMpe, rvDpb, rvDpe, DZero, "heap_sort DoubleClass vector reverse reverse"); summarize("Vector Heap Sort", SIZE, iterations, kShowGMeans, kShowPenalty ); return 0; } // the end /******************************************************************************/ /******************************************************************************/

5 4

[1.35] [serialization] header dependency when using msvc-8.0
by Stefan Heinzmann 13 Apr '08

13 Apr '08

Hi all, this very simple program here didn't compile with msvc-8.0 and boost 1.35: // bugtest-boost-1.35-mpl.cpp #include <boost/serialization/map.hpp> int main(int argc, char* argv[]) { return 0; } The compiler outputs those error lines: d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(48) : error C2039: 'and_' : is not a member of 'boost::mpl' d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(50) : see reference to class template instantiation 'boost::serialization::is_bitwise_serializable<std::pair<_Ty1,_Ty2>>' being compiled d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(48) : error C2504: 'and_' : base class undefined d:\src\libs\boost\include\boost-1_35\boost\serialization\utility.hpp(48) : error C2143: syntax error : missing ',' before '<' Adding another include line before the existing one makes the compile succeed: #include <boost/mpl/and.hpp> Surely this must be a simple bug in the serialization library. Cheers Stefan

3 3