November 2006 - Boost - lists.preview.boost.org

2D Matrix
by Jason Kraftcheck 13 Nov '06

13 Nov '06

Hi, I have written a simple 2D matrix template where the extents of the matrix are template parameters. The multi_array container and the uBLAS matrix class both provide matrices of fixed dimension (template parameter for multi_array and 2 for uBLAS) but variable extents. I think my matrix definition is complementary to these. There are several advantages to having an array of fixed extents; but the implementation is, of course, unusable when the extents are not known at compile-time. If the extents of the matrix are part of the type, the compiler can enforce correct matrix extents for operations, avoiding the cost of runtime checks. For example: double b[3][2] = { ... }; matrix<3,3> A(2.0); // 2 * identity matrix<3,2> B(b); matrix<2,3> C; matrix<3,2> D; D = A * B; // OK C = A * B; // compile error - mismatched types C = transpose(B) * A; // OK Optimizing compilers can trivially unroll the loops used to define the operations. Use of this class does not require heap allocation. The storage required for the matrix is the minimal possible (assuming no assumptions about the values of the elements.) An array of matrices can be "serialized" to an array of doubles with a single reinterpret_cast. The proposed implementation is unsuitable for very large matrices: defining the element storage as a contiguous array may be problematic, most of the performance gains become insignificant, and the implicit copying will become significant. I've attached my current implementation. In it's current form, it is unsuitable for inclusion in Boost. I will fix any required issues if there is any interest in including it in Boost. The things that need to be changed (that I'm aware of) are: o license - GPL is not acceptable for Boost o naming (namespace and class name) o change explict 'double' for element type to a template parameter Some other changes that should probably be done before inclusion: o implement inverse for other than 2x2 and 3x3 matrices o more efficient determinant implementation for larger matrices o LU factorization o QR factorization In timing tests using G++ 4.1 on a Linux/Pentium4 platform, the performance of the arithmetic operations was equivalent to those of a special 3x3 matrix implementation with all operations explicitly unrolled (the 'old' implementation this one was to replace.) Is there any interest in including such a matrix definition in Boost? Is there already an effort to include something equivalent? I searched back a few years in the mailing list archive and didn't notice anything. Any suggested changes (other than those I listed above) for the attached implementation?

6 18

Exception lib proposal: renaming boost::exception_info
by Emil Dotchevski 13 Nov '06

13 Nov '06

This is an update to the proposed boost::exception library (the source code, full documentation and tests are available at http://www.revergestudios.com/boost-exception/boost-exception.htm.) Last thing that I wanted to clear before requesting a formal boost review for boost::exception is renaming exception_info as a workaround for the name clash with the macro with the same name (lowercase and all) defined by windows.h. The two candidates I like for renaming exception_info are: except_info throw_info Here is an example of how they would look in code: throw my_exception() << except_info<tag_errno>(errno) << except_info<tag_function>(BOOST_CURRENT_FUNCTION); -or- throw my_exception() << throw_info<tag_errno>(errno) << throw_info<tag_function>(BOOST_CURRENT_FUNCTION); The above is a use case of encoding exception information at the time of the throw. The other use case is to catch a boost::exception, add exception info to it and re-throw. Here is an example of how each of except_info and throw_info would look in that case: catch( boost::exception & x ) { x << except_info<tag_filename>(fn); throw; } -or- catch( boost::exception & x ) { x << throw_info<tag_filename>(fn); throw; } Any strong preferences? Thanks, Emil Dotchevski

4 5

GIL: Survey
by Lubomir Bourdev 13 Nov '06

13 Nov '06

Hi, I am collecting a survey about GIL. I would really appreciate it if people who are thinking about using GIL send me an email with the following: 1. Which company/university/organization are you a member of? 2. Are you thinking of using / will likely use / have adopted GIL? 3. In what context are you using GIL (if you can share that) Of course, any feedback on GIL, including features that you would like to see, is much appreciated! Thanks! Lubomir

2 1

[mpl] metafunctions for stl templates
by Sascha Krissler 12 Nov '06

12 Nov '06

Hi, i had this little idea. when yo want to customize a class with a container like template <typename T, typename Container> struct Foo; then you must instanciate it with: Foo<int, std::vector<int> > the second int is redundant. --- Alternative: template <typename T, template <typename, typename> class Container> struct Foo; Here i do not have an allocator for the instantiation of Container. --- What i would like is: template <typename T, typename Container> struct Foo { typedef typename mpl::apply<Container, T>::type foo; }; and instantiate it with: Foo<int, mpl::stl_foo::vector<mpl::placeholder::_1> > For that i need namespace boost::mpl::stl_foo { template <typename T, typename Alloc> struct vector { typedef std::vector<T, Alloc> type }; } so i can curry containers as i wish. just an idea

5 6

How do I detect if a system is fully 2's complement?
by Daryle Walker 12 Nov '06

12 Nov '06

I'm working on a bug that's only present on machines that use 2's complement for their built-in integers that use all possible bit combinations (like the common platforms). How can I detect this? Stuff I tried (knowing that my system matches): 1. -INT_MIN == INT_MIN My compiler didn't find it a match for some reason (Apple's special GCC on Mac OS X 10.4.8) 2. (INT_MIN % 3 != 0) && (INT_MIN % 2 == 0) This is true, especially since I was doing a GCD(INT_MIN, 6) == 2, but I don't think it's sufficient. 3. -1 == ~0 This worked. Then I found out that ~0 may trap on some systems (like 1s' complement). Worse, I found out that INT_MIN could equal -INT_MAX, leaving out the final power of 2 for trap reasons, so [2] is flawed. 4. ~1 == -2 Also 2's complement, but leaves out the trap possibility (not tried) 5. INT_MIN + INT_MAX == -1 This worked. It guarantees the bounds, but not that INT_MIN is a negative of a power of 2. 6. (INT_MIN + INT_MAX == -1) && ((INT_MIN ^ INT_MAX) == -1) This is what I currently got. It matches two properties of 2's complement systems that use every bit combination. But is it sufficient? 7. [6] && [4] (Not tried) Would this be an improvement? Or is it redundant? -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

2 2

[1.34.0] Boost.Build
by Thomas Witt 12 Nov '06

12 Nov '06

Hi, Please note that we are not going to ship boost.build v1 with 1.34.0. The only supported build system will be v2. Please notify me of any outstanding issues due to this. Thanks Thomas Release Manager -- Thomas Witt witt(a)acm.org

11 20

[serialization] binary archives missing from diagram
by David Abrahams 12 Nov '06

12 Nov '06

See http://www.boost.org/libs/serialization/doc/class_diagram.html I just watched as this omission confounded someone on the Boost IRC channel, FWIW. -- Dave Abrahams Boost Consulting www.boost-consulting.com

2 2

Re: [boost] [1.34.0] Boost.Build
by Matt Doyle 12 Nov '06

12 Nov '06

> [mailto:boost-bounces@lists.boost.org] On Behalf Of Thomas Witt > Johan Nilsson wrote: > > Paul Baxter wrote: > > > > FWIW, I agree. > > > > Keeping BBv1 in CVS and instead making BBv2 the default > when executing > > "bjam" for this release would be easier on the users, in > combination with > > adding support for "bjam --v1". Perhaps also some > deprecation warnings > > should be output when building with v1. > > > > BBv1 could then be removed from Boost CVS in 1.35 and made > available as a > > separate download (tgz, zip). > > That are all valid points, but at the end of the day we just > don't have > the resources. We can barely support one build system. > > FWIW users that depend on v1 can always use 1.33.x > > Thomas Doesn't this seem rather Microsoft-ish? I'm thinking of .NET, the attitude was you wouldn't accept it when we offered it to you so now we're going to force it on you. And, if you really don't want .NET you can always use VC6.5. Do you see the parallels here? If it has to go away, and I'm not saying for a moment that it shouldn't, v1 should at least be formally deprecated for one release cycle so as not to catch the users off guard. Matt Scanned by McAfee GroupShield {X3BTB534}

4 6

Function Types Review is extened to November 17, 2006
by Tom Brinkman 12 Nov '06

12 Nov '06

The Function Types library min-review is extended five more days to to November 17, 2006. Please take another look at this library and express your views as to whether you think that the library is now ready for inclusion into boost. Help improve this library even further by giving the author some additional feedback. This library was reviewed last year, the link to the review manager comments at that time are here: http://lists.boost.org/boost-announce/2005/06/0066.php Author ------------------------------ Tobias Schwinger tschwinger AT neoscientists DOT org Download ------------------------------------------- <http://tinyurl.com/qaf5f>http://boost-consulting.com/vault/index.php?&direction=0&order=&directory=T… Introduction -------------------------------------------- Boost.FunctionTypes provides functionality to classify, decompose and synthesize function, function pointer, function reference and pointer to member function types. In other words, the library can be used to: - test whether a type is a specific callable builtin type, - extract all component properties from callable builtin types, and - create callable builtin types from specified properties. The library is designed to work well with other Boost libraries and uses well-accepted concepts introduced by Boost and TR1. Templates that encapsulate boolean or numeric properties define a static member constant called value. Examples ---------------------------------------------- is_function_pointer< bool(*)(int) >::value // == true function_arity< bool(*)(int) >::value // == 1 Templates that encapsulate properties that are single types contain a type member called type. function_type< mpl::vector<bool,int> >::type // is bool(int) result_type< bool(&)(int) >::type // is int Templates that encapsulate properties that are type lists model an MPL-compatible type sequence. parameter_types< bool(int) > // models an MPL sequence Whats New ------------------------------------------------------------------- (from the last "official" version) - The interface, - the documentation, - the test-suite, - carefully picked and inline-documented source code examples, - code generator for preprocessed files is entirely written on top of Wave, - preprocessed files and the configuration (up to a certain extent) are compiler-agnostic, - preprocessed files do not have to be regenerated for custom configurations, unless for optimization (and changing the library code, of course), and - library is default calling convention-agnostic, OIW the default calling convention can be changed and detected without changing the library's configuration (unless for MSVC<8 due to the lack of a 'thiscall' keyword) Review Manager, Tom Brinkman

1 0

Boost inspection notification (2006-11-12/HEAD) *X*
by Rene Rivera 12 Nov '06

12 Nov '06

Boost Inspection Report Run Date: 17:09:19 UTC, Sunday 12 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 12981 files scanned 1096 directories scanned (including root) 282 problems reported Problem counts: 1 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 117 broken links 24 unlinked files 34 file/directory names issues 19 files with tabs 42 violations of the Boost min/max guidelines 42 usages of unnamed namespaces in headers (including .ipp files) Summary: algorithm (1) archive (5) asio (2) bind (1) build (2) conversion (9) date_time (5) doc (2) dynamic_bitset (1) filesystem (40) fusion (16) graph (3) integer (1) interprocess (36) iostreams (2) iterator (1) lambda (4) math (8) more (1) mpl (1) multi_array (2) numeric (3) parameter (2) program_options (2) python (1) quickbook (12) random (2) rational (8) regex (1) regression (13) serialization (4) signals (1) system (4) test (80) thread (2) tr1 (1) tuple (1) type_traits (1) utility (1) Details: *R* invalid (cr only) line-ending *A* invalid bookmarks, invalid urls, broken links, unlinked files *N* file/directory names issues *T* tabs in file *M* uses of min or max that have not been protected from the min/max macros, or unallowed #undef-s *U* unnamed namespace in header |algorithm| libs/algorithm/string/doc/external_concepts.html: *A* unlinked file |archive| boost/archive/basic_streambuf_locale_saver.hpp: *N* name exceeds 31 characters boost/archive/detail/polymorphic_iarchive_dispatch.hpp: *N* name exceeds 31 characters boost/archive/detail/polymorphic_oarchive_dispatch.hpp: *N* name exceeds 31 characters boost/archive/impl/xml_wiarchive_impl.ipp: *U* unnamed namespace at line 53 boost/archive/iterators/remove_whitespace.hpp: *U* unnamed namespace at line 57 |asio| boost/asio/placeholders.hpp: *U* unnamed namespace at line 89 libs/asio/index.html: *A* broken link: doc/html/index.html |bind| boost/bind/placeholders.hpp: *U* unnamed namespace at line 25 |build| tools/build/v2/example/make/main.cpp.pro: *N* name contains more than one dot character ('.') tools/build/v2/test/test_system.html: *A* unlinked file |conversion| libs/conversion/lexical_cast_test.cpp: *M* violation of Boost min/max guidelines on line 410 *M* violation of Boost min/max guidelines on line 430 *M* violation of Boost min/max guidelines on line 433 *M* violation of Boost min/max guidelines on line 445 *M* violation of Boost min/max guidelines on line 448 *M* violation of Boost min/max guidelines on line 452 *M* violation of Boost min/max guidelines on line 456 *M* violation of Boost min/max guidelines on line 457 |date_time| boost/date_time/date_parsing.hpp: *M* violation of Boost min/max guidelines on line 80 *M* violation of Boost min/max guidelines on line 81 boost/date_time/period.hpp: *M* violation of Boost min/max guidelines on line 353 *M* violation of Boost min/max guidelines on line 354 libs/date_time/xmldoc/date_time_docs_howto.html: *A* unlinked file |doc| doc/html/boost_math/inverse_complex.html: *A* unlinked file doc/html/threads.html: *A* unlinked file |dynamic_bitset| boost/dynamic_bitset/dynamic_bitset.hpp: *T* |filesystem| libs/filesystem/doc/do-list.htm: *A* invalid URL (hardwired file): file://?/ *A* invalid URL (hardwired file): file://?/UNC/ libs/filesystem/doc/faq.htm: *A* broken link: path.htm#Canonical *A* broken link: path.htm#Normalized libs/filesystem/doc/i18n.html: *A* broken link: ../../../../site/LICENSE_1_0.txt *A* broken link: convenience.htm#basic_recursive_directory_iterator *A* broken link: exception.htm *A* broken link: operations.htm *A* broken link: operations.htm#Do-the-right-thing *A* broken link: operations.htm#is_directory *A* broken link: operations.htm#is_file *A* broken link: operations.htm#status libs/filesystem/doc/index.htm: *A* broken link: convenience.htm *A* broken link: fstream.htm *A* broken link: operations.htm#create_directory *A* broken link: operations.htm#create_hard_link *A* broken link: operations.htm#current_path *A* broken link: operations.htm#directory_iterator *A* broken link: operations.htm#equivalent *A* broken link: operations.htm#file_size *A* broken link: operations.htm#initial_path *A* broken link: operations.htm#is_file *A* broken link: operations.htm#is_symlink *A* broken link: operations.htm#status *A* broken link: operations.htm#symlink_status *A* broken link: path.htm#Canonical *A* broken link: path.htm#Grammar *A* broken link: path.htm#Normalized *A* broken link: path.htm#default_name_check *A* broken link: path.htm#name_check_mechanism *A* broken link: path.htm#normalize *A* broken link: path.htm#operator_eq *A* broken link: path.htm#synopsis libs/filesystem/doc/portability_guide.htm: *A* broken link: path.htm#name_check_typedef libs/filesystem/doc/tr2_proposal.html: *A* invalid URL (hardwired file): file:///C|/boost/site/libs/filesystem/doc/operations.htm#complete_note libs/filesystem/src/operations.cpp: *T* |fusion| libs/fusion/doc/html/fusion/algorithms/concepts/polymorphic_function_object.html: *N* name exceeds 31 characters libs/fusion/example/performance/accumulate.cpp: *M* violation of Boost min/max guidelines on line 117 *M* violation of Boost min/max guidelines on line 163 *M* violation of Boost min/max guidelines on line 206 *M* violation of Boost min/max guidelines on line 267 *M* violation of Boost min/max guidelines on line 45 libs/fusion/example/performance/inner_product.cpp: *M* violation of Boost min/max guidelines on line 119 *M* violation of Boost min/max guidelines on line 76 libs/fusion/example/performance/inner_product2.cpp: *M* violation of Boost min/max guidelines on line 135 *M* violation of Boost min/max guidelines on line 76 libs/fusion/test/sequence/construction.hpp: *U* unnamed namespace at line 16 libs/fusion/test/sequence/copy.hpp: *U* unnamed namespace at line 25 libs/fusion/test/sequence/make.hpp: *U* unnamed namespace at line 22 libs/fusion/test/sequence/mutate.hpp: *U* unnamed namespace at line 16 libs/fusion/test/sequence/tie.hpp: *U* unnamed namespace at line 24 libs/fusion/test/sequence/value_at.hpp: *U* unnamed namespace at line 23 |graph| boost/graph/maximum_cardinality_matching.hpp: *N* name exceeds 31 characters libs/graph/doc/lengauer_tarjan_dominator_tree.htm: *N* name exceeds 31 characters libs/graph/doc/sorted_erdos_renyi_generator.html: *N* name exceeds 31 characters |integer| libs/integer/integer.htm: *A* broken link: ../../../LICENSE_1_0.txt |interprocess| boost/interprocess/containers/deque.hpp: *T* boost/interprocess/containers/detail/flat_tree.hpp: *T* boost/interprocess/containers/detail/tree_func.hpp: *T* boost/interprocess/containers/list.hpp: *T* boost/interprocess/containers/slist.hpp: *T* boost/interprocess/containers/string.hpp: *T* boost/interprocess/containers/tree.hpp: *T* boost/interprocess/containers/vector.hpp: *T* boost/interprocess/detail/move_iterator.hpp: *T* boost/interprocess/detail/utilities.hpp: *T* boost/interprocess/ipc/message_queue.hpp: *T* boost/interprocess/streams/vectorstream.hpp: *T* boost/interprocess/sync/emulation/interprocess_recursive_mutex.hpp: *N* name exceeds 31 characters boost/interprocess/sync/interprocess_recursive_mutex.hpp: *N* name exceeds 31 characters boost/interprocess/sync/interprocess_upgradable_mutex.hpp: *N* name exceeds 31 characters *T* boost/interprocess/sync/posix/interprocess_recursive_mutex.hpp: *N* name exceeds 31 characters libs/interprocess/doc/code/doc_anonymous_condition_shared_data.hpp: *N* name exceeds 31 characters libs/interprocess/doc/code/doc_anonymous_mutex_shared_data.hpp: *N* name exceeds 31 characters libs/interprocess/doc/code/doc_anonymous_semaphore_shared_data.hpp: *N* name exceeds 31 characters libs/interprocess/doc/code/doc_anonymous_upgradable_mutexA.cpp: *N* name exceeds 31 characters libs/interprocess/doc/code/doc_anonymous_upgradable_mutexB.cpp: *N* name exceeds 31 characters libs/interprocess/doc/code/doc_named_condition_shared_data.hpp: *N* name exceeds 31 characters libs/interprocess/doc/code/doc_upgradable_mutex_shared_data.hpp: *N* name exceeds 31 characters libs/interprocess/index.html: *A* broken link: doc/html/index.html libs/interprocess/proj/vc7ide/cached_node_allocator_test.vcproj: *N* name exceeds 31 characters libs/interprocess/proj/vc7ide/doc_anonymous_upgradable_mutexA.vcproj: *N* name exceeds 31 characters libs/interprocess/proj/vc7ide/doc_anonymous_upgradable_mutexB.vcproj: *N* name exceeds 31 characters libs/interprocess/proj/vc7ide/named_recursive_mutex_test.vcproj: *N* name exceeds 31 characters libs/interprocess/proj/vc7ide/private_node_allocator_test.vcproj: *N* name exceeds 31 characters libs/interprocess/proj/vc7ide/shared_memory_mappable_test.vcproj: *N* name exceeds 31 characters libs/interprocess/proj/vc7ide/shared_memory_mapping_test.vcproj: *N* name exceeds 31 characters libs/interprocess/test/file_mapping_test.cpp: *T* libs/interprocess/test/message_queue_test.cpp: *M* violation of Boost min/max guidelines on line 26 *M* violation of Boost min/max guidelines on line 61 libs/interprocess/test/sharable_mutex_test_template.hpp: *N* name exceeds 31 characters |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file |iterator| libs/iterator/doc/issues.html: *A* unlinked file |lambda| boost/lambda/core.hpp: *U* unnamed namespace at line 62 boost/lambda/detail/lambda_functors.hpp: *U* unnamed namespace at line 25 boost/lambda/exceptions.hpp: *U* unnamed namespace at line 24 libs/lambda/doc/index.html: *A* broken link: ../../LICENSE_1_0.txt |math| libs/math/test/common_factor_test.cpp: *M* violation of Boost min/max guidelines on line 141 *M* violation of Boost min/max guidelines on line 142 *M* violation of Boost min/max guidelines on line 188 *M* violation of Boost min/max guidelines on line 189 |more| more/BoostCon07_session_call.html: *A* unlinked file |mpl| boost/mpl/alias.hpp: *U* unnamed namespace at line 17 |multi_array| boost/multi_array/base.hpp: *U* unnamed namespace at line 69 libs/multi_array/test/generative_tests.hpp: *U* unnamed namespace at line 57 |numeric| libs/numeric/conversion/doc/converter_policies.html: *R* libs/numeric/conversion/index.html: *A* broken link: ../../LICENSE_1_0.txt libs/numeric/ublas/doc/index.htm: *A* broken link: array_adaptor.htm |parameter| libs/parameter/doc/html/python.html: *A* broken link: tag::x(int *A* broken link: tag::y*(int |program_options| boost/program_options/positional_options.hpp: *M* violation of Boost min/max guidelines on line 44 libs/program_options/doc/index.html: *A* broken link: ../.../../LICENSE_1_0.txt |python| libs/python/doc/tutorial/index.html: *A* broken link: ../../../LICENSE_1_0.txt |quickbook| tools/quickbook/doc/html/index.html: *A* broken link: quickbook/editors.html *A* broken link: quickbook/editors/scite.html *A* broken link: quickbook/faq.html tools/quickbook/doc/html/quickbook/installation_and_configuration.html: *N* name exceeds 31 characters tools/quickbook/doc/html/quickbook/installation_and_configuration/debian__ubuntu.html: *A* broken link: ../editors.html tools/quickbook/doc/html/quickbook/installation_and_configuration/windows_2000__xp__2003__vista.html: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ *N* name exceeds 31 characters tools/quickbook/doc/html/quickbook/ref.html: *A* broken link: faq.html |random| boost/random/uniform_01.hpp: *T* boost/random/uniform_int.hpp: *T* |rational| libs/rational/rational_test.cpp: *M* violation of Boost min/max guidelines on line 230 *M* violation of Boost min/max guidelines on line 231 *M* violation of Boost min/max guidelines on line 276 *M* violation of Boost min/max guidelines on line 277 |regex| libs/regex/performance/input.html: *A* unlinked file |regression| regression/.htaccess: *N* leading character of ".htaccess" is not alphabetic tools/regression/xsl_reports/xsl/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html: *A* unlinked file |serialization| libs/serialization/doc/archive_reference.html: *A* broken link: ../../../boost/archive/detail/polymorphic_iarchive_impl.hpp *A* broken link: ../../../boost/archive/detail/polymorphic_oarchive_impl.hpp libs/serialization/doc/wrappers.html: *A* broken link: ../example/demo_xml.hpp libs/serialization/test/polymorphic_array_binary_archive.hpp: *N* name exceeds 31 characters |signals| boost/signals/detail/named_slot_map.hpp: *T* |system| libs/system/doc/error_code.html: *A* broken link: ../../utility/doc/identifier.html libs/system/doc/system_error.html: *A* unlinked file libs/system/index.html: *A* broken link: doc/index.html |test| boost/test/floating_point_comparison.hpp: *U* unnamed namespace at line 223 *U* unnamed namespace at line 245 boost/test/impl/cpp_main.ipp: *U* unnamed namespace at line 42 boost/test/impl/exception_safety.ipp: *M* violation of Boost min/max guidelines on line 129 *U* unnamed namespace at line 400 boost/test/impl/framework.ipp: *U* unnamed namespace at line 199 boost/test/impl/plain_report_formatter.ipp: *U* unnamed namespace at line 45 boost/test/impl/progress_monitor.ipp: *U* unnamed namespace at line 38 boost/test/impl/results_collector.ipp: *U* unnamed namespace at line 106 boost/test/impl/results_reporter.ipp: *U* unnamed namespace at line 48 boost/test/impl/unit_test_log.ipp: *U* unnamed namespace at line 79 boost/test/impl/unit_test_monitor.ipp: *U* unnamed namespace at line 35 boost/test/impl/unit_test_parameters.ipp: *U* unnamed namespace at line 50 boost/test/results_collector.hpp: *U* unnamed namespace at line 40 boost/test/test_tools.hpp: *U* unnamed namespace at line 255 boost/test/utils/iterator/token_iterator.hpp: *U* unnamed namespace at line 166 boost/test/utils/named_params.hpp: *U* unnamed namespace at line 216 boost/test/utils/runtime/cla/dual_name_parameter.ipp: *U* unnamed namespace at line 43 boost/test/utils/runtime/cla/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/env/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/file/config_file.hpp: *U* unnamed namespace at line 169 *U* unnamed namespace at line 64 *U* unnamed namespace at line 74 boost/test/utils/runtime/file/config_file_iterator.hpp: *U* unnamed namespace at line 68 boost/test/utils/trivial_singleton.hpp: *U* unnamed namespace at line 55 *U* unnamed namespace at line 64 libs/test/build/msvc71_proj/config_file_iterator_test.vcproj: *N* name exceeds 31 characters libs/test/doc/components/prg_exec_monitor/index.html: *A* broken link: ../../../../../boost/test/cpp_main.hpp libs/test/doc/components/test_tools/index.html: *A* broken link: ../../tests/boost_check_equal_str.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_CLOSE.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_MESSAGE.html: *A* broken link: BOOST_MESSAGE.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_SMALL.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/tools_list.html: *A* broken link: ../../btl1.gif *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/utf/components/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/components/test_case/abstract_interface.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/auto_register_facility.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/tc_template.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/custom_log_formatter.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_result/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_suite/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/index.html: *A* broken link: getting_started/index.html libs/test/doc/components/utf/parameters/build_info.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/catch_system_errors.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/detect_memory_leaks.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/no_result_code.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/output_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/random.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_format.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/show_progress.html: *A* broken link: ../../btl1.gif libs/test/doc/examples/unit_test_example1.html: *A* broken link: ../../example/unit_test_example1.cpp libs/test/doc/examples/unit_test_example2.html: *A* broken link: ../../example/unit_test_example2.cpp libs/test/doc/examples/unit_test_example3.html: *A* broken link: ../../example/unit_test_example3.cpp libs/test/doc/examples/unit_test_example4.html: *A* broken link: ../../example/unit_test_example4.cpp libs/test/doc/examples/unit_test_example5.html: *A* broken link: ../../example/unit_test_example5.cpp *A* broken link: ../../example/unit_test_example5.input libs/test/doc/tests/auto_unit_test_test.html: *A* broken link: ../../test/auto_unit_test_test.cpp libs/test/doc/tests/auto_unit_test_test_mult.html: *A* broken link: ../../test/auto_unit_test_test_mult1.cpp *A* broken link: ../../test/auto_unit_test_test_mult2.cpp libs/test/doc/tests/unit_test_suite_ex_test.html: *A* broken link: ../../test/unit_test_suite_ex_test.cpp libs/test/doc/tutorials/hello_the_testing_world.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../execution_monitor/index.html libs/test/doc/tutorials/new_year_resolution.html: *A* broken link: ../../../../../../LICENSE_1_0.txt |thread| libs/thread/doc/index.html: *A* broken link: ../../../doc/html/thread.html libs/thread/test/util.inl: *U* unnamed namespace at line 19 |tr1| libs/tr1/test/test_shared_from_this_header.cpp: *N* name exceeds 31 characters |tuple| libs/tuple/index.html: *A* broken link: ../../site/LICENSE_1_0.txt |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file |utility| libs/utility/index.html: *A* broken link: ../../site/LICENSE_1_0.txt

1 0