Boost
Threads by month
- ----- 2025 -----
- July
- June
- May
- April
- March
- February
- January
- ----- 2024 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2023 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2022 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2021 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2020 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2019 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2018 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2017 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2016 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2015 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2014 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2013 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2012 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2011 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2010 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2009 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2008 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2007 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2006 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2005 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2004 -----
- December
- November
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- 33145 discussions
I'm looking at some code in boost/detail - in particular Lightweight mutex.
Is there any chance that this as well as other useful modules
can get promoted to boost "first class" status. That is
would include thier own documentation(especially) and tests.
I think several of the modules should have a more
permanent "home". Just from the names it seems
that the following should be considered for promotion
as thier utility goes beyond that of an impementation
detail for any specific library.
lightweight_mutex
interlocked
atomic_count
binary_search
ut8_codecvt_facet
and it seems others should be part of particular libraries
rather than boost/detail/
sp_*
shared_?
Robert Ramey
3
5
I'd like to request the following functions added to shared_ptr's interface:
template <class T>
void * shared_ptr<T>::void_cast() const;
template <class T>
std::type_info const & shared_ptr<T>::type() const;
The first function mimics the use of dynamic_cast<void *>(p) for pointers to
polymorphic objects. The second function is similar to typeid(r), for
references to polymorphic objects. Of course, void_cast needs to be
specialized to apply the correct modifiers of T to the returned pointer
type.
There are two scenarios that need those functions:
- when using shared_ptr<T> in contexts where T is incomplete (or void);
- when the T in shared_ptr<T> has nothing to do with the type of the object
managed by the shared_ptr's control block. For example, through the recently
introduced aliasing constructor, it is possible for a shared_ptr<int> to
manage the lifetime of an object of some user-defined type that has the int
as a member.
Both functions are critical for implementing proper serialization of
shared_ptr objects.
Emil Dotchevski
3
5
Boost Inspection Report
Run Date: 16:06:00 UTC, Monday 28 May 2007
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:
11453 files scanned
909 directories scanned (including root)
192 problems reported
Problem counts:
0 files with invalid line endings
0 bookmarks with invalid characters
3 invalid urls
101 broken links
21 unlinked files
22 file/directory names issues
1 files with tabs
9 violations of the Boost min/max guidelines
35 usages of unnamed namespaces in headers (including .ipp files)
Summary:
archive (3)
bind (1)
boost-root (1)
build (1)
date_time (1)
doc (2)
filesystem (33)
graph (2)
iostreams (2)
lambda (3)
math (8)
more (4)
mpl (4)
multi_array (2)
ptr_container (1)
python (8)
regex (1)
regression (32)
serialization (1)
test (81)
type_traits (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
|archive|
boost/archive/basic_streambuf_locale_saver.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
|bind|
boost/bind/placeholders.hpp:
*U* unnamed namespace at line 25
|boost-root|
index.htm:
*A* broken link: doc/hmtl/date_time/details.html#changes
|build|
tools/build/v2/test/test_system.html:
*A* unlinked file
|date_time|
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/jam.html:
*A* unlinked file
|filesystem|
libs/filesystem/doc/do-list.htm:
*A* invalid URL (hardwired file): file://?/
*A* invalid URL (hardwired file): file://?/UNC/
libs/filesystem/doc/i18n.html:
*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: ../build/Jamfile
*A* broken link: convenience.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#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#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
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
|graph|
libs/graph/example/file_dependencies.cpp:
*M* violation of Boost min/max guidelines on line 139
libs/graph/test/serialize.cpp:
*T*
|iostreams|
libs/iostreams/doc/concepts/multi-character.html:
*A* unlinked file
libs/iostreams/doc/installation.html:
*A* broken link: ../../../tools/build/v1/build_system.htm
|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
|math|
libs/math/test/common_factor_test.cpp:
*M* violation of Boost min/max guidelines on line 146
*M* violation of Boost min/max guidelines on line 147
*M* violation of Boost min/max guidelines on line 193
*M* violation of Boost min/max guidelines on line 194
|more|
more/cvs.html:
*A* unlinked file
more/getting_started/unix-variants.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/getting_started/windows.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/separate_compilation.html:
*A* broken link: ../libs/config/test/link/test/Jamfile.v2
|mpl|
boost/mpl/alias.hpp:
*U* unnamed namespace at line 17
libs/mpl/doc/refmanual/for-each.html:
*A* broken link: ./value-initialized.html
|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
|ptr_container|
libs/ptr_container/doc/tutorial_example.html:
*A* unlinked file
|python|
libs/python/doc/building.html:
*A* broken link: ../index.htm
libs/python/doc/tutorial/doc/html/python/hello.html:
*A* broken link: ../../../../../example/tutorial/Jamrules
libs/python/doc/tutorial/index.html:
*A* broken link: ../../../LICENSE_1_0.txt
libs/python/doc/v2/May2002.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
*A* broken link: ../../../../tools/build/v1/gen_aix_import_file.py
libs/python/doc/v2/faq.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
|regex|
libs/regex/performance/input.html:
*A* unlinked file
|regression|
regression/.htaccess:
*N* leading character of ".htaccess" is not alphabetic
tools/regression/test/test-cases/incremental/bjam.log.1:
*N* name contains more than one dot character ('.')
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
*N* name contains more than one dot character ('.')
*N* name exceeds 31 characters
tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
*N* name contains more than one dot character ('.')
*N* name exceeds 31 characters
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/src/basic_xml_grammar.ipp:
*U* unnamed namespace at line 43
|test|
boost/test/floating_point_comparison.hpp:
*U* unnamed namespace at line 206
*U* unnamed namespace at line 228
boost/test/impl/cpp_main.ipp:
*U* unnamed namespace at line 42
boost/test/impl/exception_safety.ipp:
*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 262
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 52
*U* unnamed namespace at line 61
libs/test/build/msvc71_proj/config_file_iterator_test.vcproj:
*N* name exceeds 31 characters
libs/test/doc/components/prg_exec_monitor/compilation.html:
*A* broken link: ../../../build/Jamfile
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/compilation.html:
*A* broken link: ../../../build/Jamfile
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
|type_traits|
libs/type_traits/cxx_type_traits.htm:
*A* unlinked file
1
0
Boost Inspection Report
Run Date: 16:06:07 UTC, Monday 28 May 2007
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:
11453 files scanned
909 directories scanned (including root)
1059 problems reported
Problem counts:
661 files missing Boost license info or having wrong reference text
398 files missing copyright notice
Summary:
any (1)
archive (1)
build (68)
concept_check (22)
conversion (5)
doc (1)
filesystem (2)
function (1)
graph (1)
inspect (1)
integer (9)
lambda (10)
libs (6)
logic (2)
math (1)
more (13)
mpl (417)
multi_array (13)
numeric (188)
optional (1)
people (4)
program_options (35)
property_map (15)
ptr_container (8)
python (14)
rational (5)
regex (4)
regression (118)
release (2)
serialization (16)
signals (2)
smart_ptr (8)
test (3)
timer (1)
tr1 (2)
tuple (5)
utility (12)
variant (42)
Details:
*L* missing Boost license info, or wrong reference text
*C* missing copyright notice
|any|
libs/any/doc/
any.xml: *L*
|archive|
boost/archive/detail/
utf8_codecvt_facet.hpp: *L*
|build|
tools/build/v2/build/
build-request.jam: *L*
modifiers.jam: *L*
tools/build/v2/doc/
Jamfile.v2: *C* *L*
tools/build/v2/doc/src/
advanced.xml: *C* *L*
architecture.xml: *C* *L*
catalog.xml: *C* *L*
extending.xml: *C* *L*
faq.xml: *C* *L*
fragments.xml: *C* *L*
howto.xml: *C* *L*
install.xml: *C* *L*
recipes.xml: *C* *L*
reference.xml: *C* *L*
standalone.xml: *C* *L*
tutorial.xml: *C* *L*
userman.xml: *C* *L*
tools/build/v2/example/generate/
REAME.txt: *C* *L*
a.cpp: *C* *L*
tools/build/v2/example/generator/
README.txt: *C* *L*
soap.jam: *C* *L*
tools/build/v2/example/python_modules/
python_helpers.jam: *C* *L*
python_helpers.py: *C* *L*
tools/build/v2/test/
abs_workdir.py: *C* *L*
dependency_property.py: *L*
dependency_test.py: *C* *L*
direct_request_test.py: *C* *L*
dll_path.py: *L*
double_loading.py: *L*
duplicate.py: *L*
echo_args.jam: *C* *L*
empty.jam: *C* *L*
expansion.py: *L*
explicit.py: *L*
gcc_runtime.py: *L*
tools/build/v2/test/project-test3/lib3/
Jamfile: *C* *L*
tools/build/v2/test/
readme.txt: *C* *L*
svn_tree.py: *L*
tag.py: *L*
test_system.html: *L*
tools/build/v2/tools/
sun.jam: *L*
xsltproc.jam: *L*
|concept_check|
libs/concept_check/
bibliography.htm: *L*
concept_check.htm: *L*
concept_covering.htm: *L*
creating_concepts.htm: *L*
libs/concept_check/doc/
Jamfile.v2: *C* *L*
libs/concept_check/doc/reference/
Assignable.xml: *L*
BidirectionalIterator.xml: *L*
CopyConstructible.xml: *L*
DefaultConstructible.xml: *L*
EqualityComparable.xml: *L*
ForwardIterator.xml: *L*
InputIterator.xml: *L*
LessThanComparable.xml: *L*
OutputIterator.xml: *L*
RandomAccessIterator.xml: *L*
SignedInteger.xml: *L*
concepts.xml: *L*
libs/concept_check/
implementation.htm: *L*
prog_with_concepts.htm: *L*
reference.htm: *L*
using_concept_check.htm: *L*
|conversion|
libs/conversion/
cast.htm: *L*
index.html: *C* *L*
lexical_cast.htm: *L*
libs/conversion/test/
Jamfile.v2: *L*
|doc|
doc/html/
docutils.css: *L*
|filesystem|
libs/filesystem/doc/
tr2_proposal.html: *L*
libs/filesystem/src/
utf8_codecvt_facet.hpp: *L*
|function|
boost/function/detail/
gen_maybe_include.pl: *L*
|graph|
libs/graph/doc/
lengauer_tarjan_dominator.htm: *L*
|inspect|
tools/inspect/build/
Jamfile.v2: *L*
|integer|
libs/integer/
cstdint.htm: *C* *L*
libs/integer/doc/
integer_mask.html: *L*
static_min_max.html: *L*
libs/integer/
index.html: *C* *L*
integer.htm: *L*
integer_traits.html: *C* *L*
|lambda|
libs/lambda/doc/
Jamfile.v2: *C* *L*
libs/lambda/doc/detail/
README: *C* *L*
lambda_doc.xsl: *C* *L*
lambda_doc_chunks.xsl: *C* *L*
libs/lambda/test/
Makefile: *C* *L*
|libs|
libs/
expected_results.xml: *C* *L*
maintainers.txt: *C* *L*
platform_maintainers.txt: *C* *L*
|logic|
libs/logic/doc/
Jamfile.v2: *C* *L*
|math|
boost/math/
common_factor_rt.hpp: *L*
|more|
more/
error_handling.html: *L*
generic_exception_safety.html: *C* *L*
generic_programming.html: *L*
getting_started.rst: *C* *L*
moderators.html: *C*
regression.html: *C* *L*
report-apr-2006.html: *C* *L*
report-jan-2006.html: *C* *L*
|mpl|
libs/mpl/doc/src/refmanual/
ASSERT.rst: *C* *L*
ASSERT_MSG.rst: *C* *L*
ASSERT_NOT.rst: *C* *L*
ASSERT_RELATION.rst: *C* *L*
AUX_LAMBDA_SUPPORT.rst: *C* *L*
Acknowledgements.rst: *C* *L*
Algorithms-Iteration.rst: *C* *L*
Algorithms-Querying.rst: *C* *L*
Algorithms-Runtime.rst: *C* *L*
Algorithms-Transformation.rst: *C* *L*
Algorithms.rst: *C* *L*
AssociativeSequence.rst: *C* *L*
BackExtensibleSequence.rst: *C* *L*
BidirectionalIterator.rst: *C* *L*
BidirectionalSequence.rst: *C* *L*
CFG_NO_HAS_XXX.rst: *C* *L*
CFG_NO_PREPROCESSED.rst: *C* *L*
Categorized.rst: *C* *L*
Data.rst: *C* *L*
ExtensibleAssociativeSeq.rst: *C* *L*
ExtensibleSequence.rst: *C* *L*
ForwardIterator.rst: *C* *L*
ForwardSequence.rst: *C* *L*
FrontExtensibleSequence.rst: *C* *L*
HAS_XXX_TRAIT_DEF.rst: *C* *L*
HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L*
Inserter.rst: *C* *L*
IntegralConstant.rst: *C* *L*
IntegralSequenceWrapper.rst: *C* *L*
Iterators-Concepts.rst: *C* *L*
Iterators-Metafunctions.rst: *C* *L*
Iterators.rst: *C* *L*
LIMIT_LIST_SIZE.rst: *C* *L*
LIMIT_MAP_SIZE.rst: *C* *L*
LIMIT_METAFUNCTION_ARITY.rst: *C* *L*
LIMIT_SET_SIZE.rst: *C* *L*
LIMIT_UNROLLING.rst: *C* *L*
LIMIT_VECTOR_SIZE.rst: *C* *L*
LambdaExpression.rst: *C* *L*
Macros-Asserts.rst: *C* *L*
Macros-Configuration.rst: *C* *L*
Macros.rst: *C* *L*
Metafunction.rst: *C* *L*
MetafunctionClass.rst: *C* *L*
Metafunctions-Arithmetic.rst: *C* *L*
Metafunctions-Bitwise.rst: *C* *L*
Metafunctions-Comparisons.rst: *C* *L*
Metafunctions-Composition.rst: *C* *L*
Metafunctions-Conditional.rst: *C* *L*
Metafunctions-Invocation.rst: *C* *L*
Metafunctions-Logical.rst: *C* *L*
Metafunctions-Trivial.rst: *C* *L*
Metafunctions-Type.rst: *C* *L*
Metafunctions.rst: *C* *L*
NumericMetafunction.rst: *C* *L*
PlaceholderExpression.rst: *C* *L*
Placeholders.rst: *C* *L*
RandomAccessIterator.rst: *C* *L*
RandomAccessSequence.rst: *C* *L*
ReversibleAlgorithm.rst: *C* *L*
Sequences-Classes.rst: *C* *L*
Sequences-Concepts.rst: *C* *L*
Sequences-Intrinsic.rst: *C* *L*
Sequences-Views.rst: *C* *L*
Sequences.rst: *C* *L*
TagDispatchedMetafunction.rst: *C* *L*
TrivialMetafunction.rst: *C* *L*
VariadicSequence.rst: *C* *L*
accumulate.rst: *C* *L*
advance.rst: *C* *L*
always.rst: *C* *L*
and_.rst: *C* *L*
apply.rst: *C* *L*
apply_wrap.rst: *C* *L*
arg.rst: *C* *L*
at.rst: *C* *L*
at_c.rst: *C* *L*
back.rst: *C* *L*
back_inserter.rst: *C* *L*
begin.rst: *C* *L*
bind.rst: *C* *L*
bitand_.rst: *C* *L*
bitor_.rst: *C* *L*
bitxor_.rst: *C* *L*
bool_.rst: *C* *L*
clear.rst: *C* *L*
contains.rst: *C* *L*
copy.rst: *C* *L*
copy_if.rst: *C* *L*
count.rst: *C* *L*
count_if.rst: *C* *L*
deque.rst: *C* *L*
deref.rst: *C* *L*
distance.rst: *C* *L*
divides.rst: *C* *L*
empty.rst: *C* *L*
empty_base.rst: *C* *L*
empty_sequence.rst: *C* *L*
end.rst: *C* *L*
equal.rst: *C* *L*
equal_to.rst: *C* *L*
erase.rst: *C* *L*
erase_key.rst: *C* *L*
eval_if.rst: *C* *L*
eval_if_c.rst: *C* *L*
filter_view.rst: *C* *L*
find.rst: *C* *L*
find_if.rst: *C* *L*
fold.rst: *C* *L*
for_each.rst: *C* *L*
front.rst: *C* *L*
front_inserter.rst: *C* *L*
greater.rst: *C* *L*
greater_equal.rst: *C* *L*
has_key.rst: *C* *L*
identity.rst: *C* *L*
if_.rst: *C* *L*
if_c.rst: *C* *L*
inherit.rst: *C* *L*
inherit_linearly.rst: *C* *L*
insert.rst: *C* *L*
insert_range.rst: *C* *L*
inserter_.rst: *C* *L*
int_.rst: *C* *L*
integral_c.rst: *C* *L*
is_sequence.rst: *C* *L*
iter_fold.rst: *C* *L*
iter_fold_if.rst: *C* *L*
iterator_category.rst: *C* *L*
iterator_range.rst: *C* *L*
joint_view.rst: *C* *L*
key_type.rst: *C* *L*
lambda.rst: *C* *L*
less.rst: *C* *L*
less_equal.rst: *C* *L*
list.rst: *C* *L*
list_c.rst: *C* *L*
long_.rst: *C* *L*
lower_bound.rst: *C* *L*
map.rst: *C* *L*
max.rst: *C* *L*
max_element.rst: *C* *L*
min.rst: *C* *L*
min_element.rst: *C* *L*
minus.rst: *C* *L*
modulus.rst: *C* *L*
multiplies.rst: *C* *L*
negate.rst: *C* *L*
next.rst: *C* *L*
not_.rst: *C* *L*
not_equal_to.rst: *C* *L*
numeric_cast.rst: *C* *L*
or_.rst: *C* *L*
order.rst: *C* *L*
pair.rst: *C* *L*
partition.rst: *C* *L*
plus.rst: *C* *L*
pop_back.rst: *C* *L*
pop_front.rst: *C* *L*
preface.rst: *C* *L*
prior.rst: *C* *L*
protect.rst: *C* *L*
push_back.rst: *C* *L*
push_front.rst: *C* *L*
quote.rst: *C* *L*
range_c.rst: *C* *L*
remove.rst: *C* *L*
remove_if.rst: *C* *L*
replace.rst: *C* *L*
replace_if.rst: *C* *L*
reverse.rst: *C* *L*
reverse_copy.rst: *C* *L*
reverse_copy_if.rst: *C* *L*
reverse_fold.rst: *C* *L*
reverse_iter_fold.rst: *C* *L*
reverse_partition.rst: *C* *L*
reverse_remove.rst: *C* *L*
reverse_remove_if.rst: *C* *L*
reverse_replace.rst: *C* *L*
reverse_replace_if.rst: *C* *L*
reverse_stable_partition.rst: *C* *L*
reverse_transform.rst: *C* *L*
reverse_unique.rst: *C* *L*
sequence_tag.rst: *C* *L*
set.rst: *C* *L*
set_c.rst: *C* *L*
shift_left.rst: *C* *L*
shift_right.rst: *C* *L*
single_view.rst: *C* *L*
size.rst: *C* *L*
size_t.rst: *C* *L*
sizeof_.rst: *C* *L*
sort.rst: *C* *L*
stable_partition.rst: *C* *L*
terminology.rst: *C* *L*
times.rst: *C* *L*
transform.rst: *C* *L*
transform_view.rst: *C* *L*
unique.rst: *C* *L*
unpack_args.rst: *C* *L*
upper_bound.rst: *C* *L*
value_type.rst: *C* *L*
vector.rst: *C* *L*
vector_c.rst: *C* *L*
void_.rst: *C* *L*
zip_view.rst: *C* *L*
libs/mpl/doc/
style.css: *L*
libs/mpl/example/fsm/
README.txt: *C* *L*
libs/mpl/test/
Jamfile.v2: *C* *L*
|multi_array|
libs/multi_array/doc/
iterator_categories.html: *C* *L*
reference.html: *L*
libs/multi_array/doc/xml/
MultiArray.xml: *C* *L*
const_multi_array_ref.xml: *C* *L*
multi_array.xml: *C* *L*
multi_array_ref.xml: *C* *L*
reference.xml: *L*
libs/multi_array/test/
Jamfile.v2: *L*
|numeric|
boost/numeric/ublas/
banded.hpp: *L*
blas.hpp: *L*
boost/numeric/ublas/detail/
concepts.hpp: *L*
config.hpp: *L*
definitions.hpp: *L*
documentation.hpp: *L*
duff.hpp: *L*
iterator.hpp: *L*
matrix_assign.hpp: *L*
raw.hpp: *L*
temporary.hpp: *L*
vector_assign.hpp: *L*
boost/numeric/ublas/
exception.hpp: *L*
expression_types.hpp: *L*
functional.hpp: *L*
fwd.hpp: *L*
hermitian.hpp: *L*
io.hpp: *L*
lu.hpp: *L*
matrix.hpp: *L*
matrix_expression.hpp: *L*
matrix_proxy.hpp: *L*
matrix_sparse.hpp: *L*
operation.hpp: *L*
operation_blocked.hpp: *L*
operation_sparse.hpp: *L*
storage.hpp: *L*
storage_sparse.hpp: *L*
symmetric.hpp: *L*
traits.hpp: *L*
triangular.hpp: *L*
vector.hpp: *L*
vector_expression.hpp: *L*
vector_of_vector.hpp: *L*
vector_proxy.hpp: *L*
vector_sparse.hpp: *L*
libs/numeric/conversion/test/
Jamfile.v2: *C* *L*
test_helpers.cpp: *C*
test_helpers2.cpp: *C*
test_helpers3.cpp: *C*
traits_test.cpp: *C*
udt_example_0.cpp: *C*
udt_support_test.cpp: *C*
libs/numeric/ublas/bench1/
bench1.cpp: *L*
bench1.hpp: *L*
bench11.cpp: *L*
bench12.cpp: *L*
bench13.cpp: *L*
libs/numeric/ublas/bench2/
bench2.cpp: *L*
bench2.hpp: *L*
bench21.cpp: *L*
bench22.cpp: *L*
bench23.cpp: *L*
libs/numeric/ublas/bench3/
bench3.cpp: *L*
bench3.hpp: *L*
bench31.cpp: *L*
bench32.cpp: *L*
bench33.cpp: *L*
libs/numeric/ublas/bench4/
bench4.cpp: *L*
bench41.cpp: *L*
bench42.cpp: *L*
bench43.cpp: *L*
libs/numeric/ublas/doc/
Release_notes.txt: *C* *L*
array_adaptor.htm: *C* *L*
banded.htm: *L*
blas.htm: *L*
bounded_array.htm: *C* *L*
container_concept.htm: *L*
doxygen.css: *C* *L*
expression_concept.htm: *L*
hermitian.htm: *L*
index.htm: *L*
iterator_concept.htm: *L*
matrix.htm: *L*
matrix_expression.htm: *L*
matrix_proxy.htm: *L*
matrix_sparse.htm: *L*
operations_overview.htm: *L*
overview.htm: *L*
products.htm: *L*
range.htm: *C* *L*
libs/numeric/ublas/doc/samples/
banded_adaptor.cpp: *L*
banded_matrix.cpp: *L*
bounded_array.cpp: *L*
compressed_matrix.cpp: *L*
compressed_vector.cpp: *L*
coordinate_matrix.cpp: *L*
coordinate_vector.cpp: *L*
hermitian_adaptor.cpp: *L*
hermitian_matrix.cpp: *L*
identity_matrix.cpp: *L*
map_array.cpp: *L*
mapped_matrix.cpp: *L*
mapped_vector.cpp: *L*
matrix.cpp: *L*
matrix_binary.cpp: *L*
matrix_binary_scalar.cpp: *L*
matrix_column.cpp: *L*
matrix_column_project.cpp: *L*
matrix_matrix_binary.cpp: *L*
matrix_matrix_solve.cpp: *L*
matrix_range.cpp: *L*
matrix_range_project.cpp: *L*
matrix_row.cpp: *L*
matrix_row_project.cpp: *L*
matrix_slice.cpp: *L*
matrix_slice_project.cpp: *L*
matrix_unary.cpp: *L*
matrix_vector_binary.cpp: *L*
matrix_vector_range.cpp: *L*
matrix_vector_slice.cpp: *L*
matrix_vector_solve.cpp: *L*
range.cpp: *L*
slice.cpp: *L*
symmetric_adaptor.cpp: *L*
symmetric_matrix.cpp: *L*
triangular_adaptor.cpp: *L*
triangular_matrix.cpp: *L*
unbounded_array.cpp: *L*
unit_vector.cpp: *L*
vector.cpp: *L*
vector_binary.cpp: *L*
vector_binary_outer.cpp: *L*
vector_binary_redux.cpp: *L*
vector_binary_scalar.cpp: *L*
vector_range.cpp: *L*
vector_range_project.cpp: *L*
vector_slice.cpp: *L*
vector_slice_project.cpp: *L*
vector_unary.cpp: *L*
vector_unary_redux.cpp: *L*
zero_matrix.cpp: *L*
zero_vector.cpp: *L*
libs/numeric/ublas/doc/
storage_concept.htm: *C* *L*
storage_sparse.htm: *L*
symmetric.htm: *L*
triangular.htm: *L*
types_overview.htm: *L*
ublas.css: *C* *L*
unbounded_array.htm: *C* *L*
vector.htm: *L*
vector_expression.htm: *L*
vector_proxy.htm: *L*
vector_sparse.htm: *L*
libs/numeric/ublas/test/
README: *C* *L*
concepts.cpp: *L*
test1.cpp: *L*
test1.hpp: *L*
test11.cpp: *L*
test12.cpp: *L*
test13.cpp: *L*
test2.cpp: *L*
test2.hpp: *L*
test21.cpp: *L*
test22.cpp: *L*
test23.cpp: *L*
test3.cpp: *L*
test3.hpp: *L*
test31.cpp: *L*
test32.cpp: *L*
test33.cpp: *L*
test4.cpp: *L*
test4.hpp: *L*
test42.cpp: *L*
test43.cpp: *L*
test5.cpp: *L*
test5.hpp: *L*
test52.cpp: *L*
test53.cpp: *L*
test6.cpp: *L*
test6.hpp: *L*
test62.cpp: *L*
test63.cpp: *L*
test7.cpp: *L*
test7.hpp: *L*
test71.cpp: *L*
test72.cpp: *L*
test73.cpp: *L*
|optional|
libs/optional/test/
Jamfile.v2: *L*
|people|
people/
paul_moore.htm: *C* *L*
vesa_karvonen.htm: *C* *L*
|program_options|
boost/program_options/detail/
utf8_codecvt_facet.hpp: *L*
libs/program_options/build/
Jamfile.v2: *C* *L*
libs/program_options/doc/
Jamfile.v2: *C* *L*
acknowledgements.xml: *C* *L*
changes.xml: *C* *L*
design.xml: *C* *L*
glossary.xml: *C* *L*
howto.xml: *C* *L*
overview.xml: *C* *L*
post_review_plan.txt: *C* *L*
todo.txt: *C* *L*
tutorial.xml: *C* *L*
libs/program_options/example/
Jamfile.v2: *C* *L*
libs/program_options/test/
Jamfile.v2: *C* *L*
program_options_size_test.py: *C* *L*
ucs2.txt: *C* *L*
utf8.txt: *C* *L*
winmain.py: *C* *L*
|property_map|
libs/property_map/
LvaluePropertyMap.html: *L*
ReadWritePropertyMap.html: *L*
ReadablePropertyMap.html: *L*
WritablePropertyMap.html: *L*
associative_property_map.html: *L*
const_assoc_property_map.html: *L*
libs/property_map/doc/
dynamic_property_map.html: *C* *L*
dynamic_property_map.rst: *C* *L*
libs/property_map/
example2.cpp: *L*
identity_property_map.html: *L*
iterator_property_map.html: *L*
property_map.html: *L*
vector_property_map.html: *L*
|ptr_container|
libs/ptr_container/doc/
default.css: *L*
intro.xml: *C* *L*
ptr_container.xml: *L*
libs/ptr_container/test/
Jamfile.v2: *C* *L*
sequence_point.cpp: *C* *L*
|python|
libs/python/doc/
internals.html: *L*
internals.rst: *L*
libs/python/doc/tutorial/doc/html/python/
embedding.html: *L*
exception.html: *L*
exposing.html: *L*
functions.html: *L*
hello.html: *L*
iterators.html: *L*
object.html: *L*
techniques.html: *L*
libs/python/test/
operators_wrapper.cpp: *C* *L*
operators_wrapper.py: *C* *L*
|rational|
boost/
rational.hpp: *L*
libs/rational/
index.html: *L*
rational.html: *L*
rational_example.cpp: *L*
rational_test.cpp: *L*
|regex|
libs/regex/build/
gcc-shared.mak: *C* *L*
libs/regex/example/timer/
input_script.txt: *C* *L*
|regression|
tools/regression/build/
Jamfile.v2: *C* *L*
tools/regression/detail/
tiny_xml_test.txt: *C* *L*
tools/regression/
index.htm: *C* *L*
run_tests.sh: *C* *L*
tools/regression/test/test-cases/general/expected/
results.xml: *C* *L*
tools/regression/test/test-cases/incremental/expected/
results.xml: *C* *L*
tools/regression/test/
test.bat: *C* *L*
tools/regression/xsl_reports/
boostbook_report.py: *C* *L*
tools/regression/xsl_reports/db/
load.py: *C* *L*
test-runs.xsd: *C* *L*
tools/regression/xsl_reports/
empty_expected_results.xml: *C* *L*
tools/regression/xsl_reports/runner/
__init__.py: *C* *L*
default.css: *L*
instructions.html: *L*
instructions.rst: *C* *L*
tools/regression/xsl_reports/test/
common.py: *C* *L*
expected_results.xml: *C* *L*
generate_test_results.py: *C* *L*
generate_test_results_v1.py: *C* *L*
restrict_to_library.xsl: *C* *L*
run_notes_regression.py: *C* *L*
run_v1.py: *C* *L*
tools/regression/xsl_reports/test/test-components/
test.py: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/
compile-fail.xml: *C* *L*
completed.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/
compile-fail.xml: *C* *L*
completed.xml: *C* *L*
lib.xml: *C* *L*
misfire.xml: *C* *L*
no-run.xml: *C* *L*
run_pyd.xml: *C* *L*
test-case.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/
lib.xml: *L*
misfire.xml: *C* *L*
no-run.xml: *C* *L*
run_pyd.xml: *C* *L*
test-case.xml: *L*
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/test-components/test_re_match/expected/
test_re_match.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/expected/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/expected/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/
test.py: *C* *L*
test_boost_wide_report.py: *C* *L*
tools/regression/xsl_reports/
test_results.xsd: *C* *L*
tools/regression/xsl_reports/utils/
__init__.py: *C* *L*
accept_args.py: *C* *L*
char_translation_table.py: *C* *L*
check_existance.py: *C* *L*
checked_system.py: *C* *L*
libxslt.py: *C* *L*
log.py: *C* *L*
makedirs.py: *C* *L*
send_mail.py: *C* *L*
sourceforge.py: *C* *L*
tar.py: *C* *L*
zip.py: *C* *L*
tools/regression/xsl_reports/xsl/v2/
expected_to_1_33_format.xsl: *C* *L*
|release|
tools/release/
utils.py: *C* *L*
|serialization|
libs/serialization/doc/
style.css: *C* *L*
libs/serialization/example/
demo_output.txt: *C* *L*
demo_save.xml: *C* *L*
demofile.txt: *C* *L*
libs/serialization/test/
run_archive_test.bat: *C* *L*
runtest.bat: *C* *L*
runtest.sh: *C* *L*
libs/serialization/vc7ide/
readme.txt: *C* *L*
|signals|
libs/signals/doc/
tutorial.xml: *C* *L*
|smart_ptr|
libs/smart_ptr/
compatibility.htm: *L*
scoped_array.htm: *L*
scoped_ptr.htm: *L*
shared_array.htm: *L*
shared_ptr.htm: *L*
smart_ptr.htm: *L*
smarttests.htm: *L*
weak_ptr.htm: *L*
|test|
boost/test/utils/runtime/cla/detail/
argument_value_usage.hpp: *L*
libs/test/test/auto-link-test/
run_bjam.bat: *C* *L*
|timer|
libs/timer/
timer.htm: *L*
|tr1|
boost/tr1/
tuple.hpp: *C* *L*
|tuple|
libs/tuple/doc/
design_decisions_rationale.html: *L*
tuple_advanced_interface.html: *L*
tuple_users_guide.html: *L*
libs/tuple/test/
README: *C* *L*
|utility|
boost/
shared_container_iterator.hpp: *L*
libs/utility/
OptionalPointee.html: *L*
call_traits.htm: *L*
compressed_pair.htm: *L*
enable_if.html: *L*
libs/utility/test/
Jamfile.v2: *L*
libs/utility/
utility.htm: *L*
value_init.htm: *L*
value_init_test.cpp: *C*
value_init_test_fail1.cpp: *C*
value_init_test_fail2.cpp: *C*
value_init_test_fail3.cpp: *C*
|variant|
libs/variant/doc/
Jamfile.v2: *C* *L*
biblio.xml: *C* *L*
design.xml: *C* *L*
introduction.xml: *C* *L*
misc.xml: *C* *L*
libs/variant/doc/reference/
apply_visitor.xml: *C* *L*
bad_visit.xml: *C* *L*
concepts.xml: *C* *L*
get.xml: *C* *L*
recursive_variant.xml: *C* *L*
recursive_wrapper.xml: *C* *L*
reference.xml: *C* *L*
static_visitor.xml: *C* *L*
variant.xml: *C* *L*
variant_fwd.xml: *C* *L*
visitor_ptr.xml: *C* *L*
libs/variant/doc/tutorial/
advanced.xml: *C* *L*
basic.xml: *C* *L*
tutorial.xml: *C* *L*
libs/variant/doc/
variant.xml: *L*
libs/variant/
index.html: *C* *L*
libs/variant/test/
Jamfile.v2: *L*
1
0
Boost Regression test failures
Report time: 2007-05-28T02:33:17Z
This report lists all regression test failures on release platforms.
Detailed report:
http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/iā¦
30 failures in 4 libraries
date_time (1)
graph (1)
iostreams (1)
serialization (27)
|date_time|
testtime_serialize_std_config: msvc-8.0
|graph|
graphviz_test: gcc-cygwin-3.4.4
|iostreams|
compose_test: gcc-4.1.0_linux_x86_64
|serialization|
test_class_info_load_binary_archive: gcc-4.1.0_linux_x86_64
test_class_info_load_xml_warchive: gcc-4.1.0_linux_x86_64
test_class_info_load_xml_warchive_dll: gcc-4.1.0_linux_x86_64
test_class_info_save_xml_warchive: gcc-4.1.0_linux_x86_64
test_class_info_save_xml_warchive_dll: gcc-4.1.0_linux_x86_64
test_cyclic_ptrs_xml_archive: gcc-4.1.0_linux_x86_64
test_delete_pointer_text_archive_dll: gcc-4.1.0_linux_x86_64
test_demo_dll: gcc-4.1.0_linux_x86_64
test_demo_xml: gcc-4.1.0_linux_x86_64
test_demo_xml_load: gcc-4.1.0_linux_x86_64
test_demo_xml_save: gcc-4.1.0_linux_x86_64
test_deque_xml_archive: gcc-4.1.0_linux_x86_64
test_exported_binary_archive: gcc-4.1.0_linux_x86_64
test_exported_xml_warchive_dll: gcc-4.1.0_linux_x86_64
test_list_ptrs_xml_warchive: gcc-4.1.0_linux_x86_64
test_map_xml_archive: gcc-4.1.0_linux_x86_64
test_no_rtti_xml_warchive: msvc-8.0
test_recursion_xml_archive_dll: gcc-4.1.0_linux_x86_64
test_reset_object_address_dll: gcc-4.1.0_linux_x86_64
test_shared_ptr_132_text_warchive_dll: gcc-4.1.0_linux_x86_64
test_shared_ptr_132_xml_warchive: gcc-4.1.0_linux_x86_64
test_shared_ptr_xml_archive: gcc-4.1.0_linux_x86_64
test_tracking_text_warchive_dll: gcc-4.1.0_linux_x86_64
test_tracking_xml_warchive: gcc-4.1.0_linux_x86_64
test_vector_binary_archive_dll: gcc-4.1.0_linux_x86_64
test_vector_xml_warchive: gcc-4.1.0_linux_x86_64
test_vector_xml_warchive_dll: gcc-4.1.0_linux_x86_64
1
0
Hello,
I've had much use of a small traits class for identifying types that matches
the STL Container concept (roughly) .
Two functions is made available, is_container<T> and
container_category_of<T>.
is_container simply evaluates to true_type or false_type,
container_category_of tries to categorize T with the following tags.
struct non_container_tag {};
struct container_tag {};
struct sequence_container_tag : public container_tag {};
struct associative_container_tag : public container_tag {};
struct hashed_container_tag : public associative_container_tag {};
template<class T, class Tag = container_tag>
struct is_container
It seems to work for STL containers, boost multi index, boost array etc..
haven't tried with ptr_containers yet but they should work, since the
implementation just looks for a couple of member types using
BOOST_MPL_HAS_XXX_TRAIT_DEF.
Writing stream operators for a container can be implemented like
template<class CharType, class CharTrait, class Container>
inline typename boost::enable_if<is_container<Container>,
basic_ostream<CharType, CharTrait>&>::type
operator <<(basic_ostream<CharType, CharTrait>& os, const Container& c)
{
if (!os.good() ) return os;
detail::write_container(os, c, d);
return os;
}
Writing a generic insert() could look something like
namespace detail
{
template<class Container, class T>
bool insert(Container& c, const T& t, sequence_container_tag)
{
c.push_back(t); return true;
}
template<class Container, class T>
bool insert(Container& c, const T& t, associative_container_tag)
{
return c.insert(t).second;
}
}
template<class Container, class T>
bool insert(Container& c, const T& t)
{
return detail::insert(c, t,
container_category_of<Container>::type());
}
Could this be of any use in boost?
/ Christian
4
17
First I posted basically this message to boost-user list on Monday
5/21 and have yet to receive any replies. If re-posting this message
to a different list is inappropriate please forgive me. I do have
some additional information. I installed boost 1.34.0 on a Window XP
machine using mcvs 8.0 and was again able to successfully build all
the boost libraries and received the same errors as on my Mac when I
tried to build the boost python example.
I was able to discover a rule called python-extension in the file
boost_1_34_0/tools/build/v2/python.jam
rule python-extension ( name : sources * : requirements * : default-
build * :
usage-requirements * )
{
....
}
IMPORT python : python-extension : : python-extension ;
I am on a Mac with OS X 10.4 and trying to compile the boost/Python
examples in tutorial or quickstart using Bjam v3.1.14 OS=MACOSX. I
issue the following command in the boost_1_34_0/libs/python/libs/
example directory
bjam --toolset=darwin test
I receive the following errors:
Jamroot:18: in modules.load
rule python-extension unknown in module Jamfile</Users/arthurcoleman/
Boost/boost_1_34_0/libs/python/example>.
/Users/arthurcoleman/Boost/boost_1_34_0/tools/build/v2/build/
project.jam:312: in load-jamfile
/Users/arthurcoleman/Boost/boost_1_34_0/tools/build/v2/build/
project.jam:68: in load
/Users/arthurcoleman/Boost/boost_1_34_0/tools/build/v2/build/
project.jam:170: in project.find
/Users/arthurcoleman/Boost/boost_1_34_0/tools/build/v2/build-
system.jam:237: in load
/Users/arthurcoleman/Boost/boost_1_34_0/libs/python/example/../../../
tools/build/v2/kernel/modules.jam:261: in import
/Users/arthurcoleman/Boost/boost_1_34_0/libs/python/example/../../../
tools/build/v2/kernel/bootstrap.jam:132: in boost-build
/Users/arthurcoleman/Boost/boost_1_34_0/libs/python/example/boost-
build.jam:7: in module scope
Can someone help me since I can't figure out what I'm doing wrong.
By the way, I have tried as a superuser and get the same errors. It
seemed that I was able to successfully install boost from the
boost.../build director with the ./configure --toolset=darwin --show-
libraries ect.
Thanks in advance,
Arthur
3
4
KDE is also a large project with separate subprojects. I thought it
might be a good idea to look at their structure.
Here are some instructions:
http://websvn.kde.org/tags/KDE/3.90.1/kde-common/svn/svn_instructions.txt?rā¦
The instructions points to the tutorial:
http://developer.kde.org/documentation/tutorials/subversion/index.html
Here is the repository: http://websvn.kde.org/
Browsing the tags, I find the main releases of KDE, but I don't easily
see the version numbers of the underlying projects.
This baffles me slightly. But it seems to work well (doesn't it?).
Regarding boost sandbox: I think it is good to be able to checkout one
directory to get the trunk of everything. I.e. The subprojects shall
not contain separate trunk/branches/tags.
How about a trunk with the two subdirectories Boost and Sandbox? The
Boost directory would contain libraries that are to be part of the
next official Boost release, and the Sandbox other libraries.
/$
(disclaimer: I'm new to both Boost and Subversion)
2
1
Hi,
I have tried to contact Doug Gregor about subversion account but with no
lack.
Who is in charge for account creation?
Thanks,
Pavol.
-------- Original Message --------
Subject: SVN & Ticket access
Date: Sun, 27 May 2007 15:19:53 +0200
From: Pavol Droba
To: Douglas Gregor
Hi,
I'm the author/maintainer of the string_algo lib. I'd like to submit
some tickets for 1.34.1 but as far as I understand I need a account at
new svn repository.
So I'd like to ask for one. My SF account name is 'memring' but it would
be nice to have 'pavol_droba' for the svn.
Thanks,
Pavol.
3
3
Hello,
In Bimap and MultiIndex section of Bimap docs (
http://tinyurl.com/2wrb6k ) there is a discussion about the relation
between this two libraries.
I have a new feature in mind for Boost.Bimap but I want to know if it
is the correct path to follow.
Bidirectional relations may have associated information about the relationship.
Suppose we want to represent a books and author bidirectional map.
-----------------------------------------------------------------------------------------------
stuct author {};
struct book_name {};
typedef bimap<
tagged< multiset_of< string >, author >,
tagged< set_of< string >, book_name >
> bm_type;
bm_type bm;
assign::insert( bm )
( "Bjarne Stroustrup" , "The C++ Programming Language")
( "Scott Meyers" , "Effective C++" )
( "Andrei Alexandrescu", "Modern C++ Design by" );
std::cout << bm.by<book_name>().at( "Modern C++ Design by" );
-----------------------------------------------------------------------------------------------
Suppose now that we want to store abstract of each book. There is no
support in bimap for that. So we have two options:
1) Books name are unique identifiers, so we can create a separate
std::map< string, string > that relates books names with abstracts.
2) We can use MultiIndex for the new beast.
Option 1 is the wrong approach, we lost what bimap has won us. We now
have to maintain the logic of two interdependent containers and there is
an extra string stored for each book name. This is far away from being
a good solution.
Option 2 is correct. We start thinking books as entries in a table. So it
makes sense to start using Boost.MultiIndex. We can then add the year
of publication, the price, etc... and we can index this new items too. So
MultiIndex is a sound solution for our problem.
The thing is that there are cases where we want to maintain bimap
semantics (use at() to find an author given a book name and the other way
around) and add information about the relations that we are sure we will not
want to index later (like the abstracts). Option 1 is not possible, option 2
neither.
What I propose is to add support for information hooking to bimaps.
The information will be mutable using iterators.
The interface will be something along this line:
-----------------------------------------------------------------------------------------------
typedef bimap<
tagged< multiset_of< string >, author >,
tagged< set_of< string >, book_name >,
hook_info< string >
> bm_type;
bm_type bm;
// Relations and bimap pairs constructors can take an extra argument
assign::insert( bm )
( "Bjarne Stroustrup" , "The C++ Programming Language",
"For C++ old-timers, the first edition of this book is the one "
"that started it allāthe font of our knowledge." );
bm_type::map_by<book_name>::const_iterator iter =
bm.by<book_name>.find("The C++ Programming Language")
std::cout << iter->info;
// A commodity function is included for unique maps:
std::cout << bm.by<book_name>().info_at("The C++ Programming Language");
-----------------------------------------------------------------------------------------------
I think that it is a good addition to the library, but others may think that
we should encourage the use of Boost.MultiIndex in this cases.
The thing is that there are a lot of bidirectional mappings that have
associated data, and it is a shame not to support them.
This is by no means decided. Comments are welcome.
King Regards
Matias
1
0
Boost Inspection Report
Run Date: 16:11:33 UTC, Sunday 27 May 2007
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:
14249 files scanned
1258 directories scanned (including root)
694 problems reported
Problem counts:
1 files with invalid line endings
0 bookmarks with invalid characters
3 invalid urls
405 broken links
29 unlinked files
131 file/directory names issues
34 files with tabs
54 violations of the Boost min/max guidelines
37 usages of unnamed namespaces in headers (including .ipp files)
Summary:
algorithm (1)
archive (5)
asio (10)
bimap (339)
bind (1)
boost-root (1)
build (1)
circular_buffer (11)
conversion (10)
date_time (5)
doc (2)
dynamic_bitset (1)
filesystem (40)
function_types (2)
fusion (1)
graph (6)
integer (1)
interprocess (45)
iostreams (2)
iterator (1)
lambda (3)
math (8)
more (9)
mpi (8)
mpl (1)
multi_array (2)
numeric (3)
pending (1)
program_options (1)
property_tree (23)
python (9)
quickbook (23)
random (2)
rational (8)
regex (1)
regression (14)
serialization (4)
system (4)
test (80)
thread (2)
tr1 (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/example/http/doc_root/1K.html:
*A* unlinked file
*N* leading character of "1K.html" is not alphabetic
libs/asio/example/http/doc_root/2K.html:
*A* unlinked file
*N* leading character of "2K.html" is not alphabetic
libs/asio/example/http/doc_root/4K.html:
*A* unlinked file
*N* leading character of "4K.html" is not alphabetic
libs/asio/example/http/doc_root/8K.html:
*A* unlinked file
*N* leading character of "8K.html" is not alphabetic
libs/asio/index.html:
*A* broken link: doc/html/index.html
|bimap|
boost/bimap/bimap.hpp:
*T*
boost/bimap/container_adaptor/associative_container_adaptor.hpp:
*N* name exceeds 31 characters
boost/bimap/container_adaptor/ordered_associative_container_adaptor.hpp:
*N* name exceeds 31 characters
boost/bimap/container_adaptor/unordered_associative_container_adaptor.hpp:
*N* name exceeds 31 characters
boost/bimap/detail/bimap_core.hpp:
*T*
boost/bimap/detail/manage_additional_parameters.hpp:
*N* name exceeds 31 characters
boost/bimap/support/lambda.hpp:
*U* unnamed namespace at line 26
boost/bimap/views/list_map_view.hpp:
*T*
boost/bimap/views/map_view.hpp:
*T*
boost/bimap/views/multimap_view.hpp:
*T*
boost/bimap/views/unordered_map_view.hpp:
*T*
boost/bimap/views/unordered_multimap_view.hpp:
*T*
boost/bimap/views/vector_map_view.hpp:
*T*
libs/bimap/doc/html/boost_bimap/acknowledgements.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/bimap_and_boost.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.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
libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/compiler_specifics.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/examples.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.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
libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/future_work.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/history.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/introduction.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/performance.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/rationale.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../doxydoc/index.html
*A* broken link: ../images/bimap/relation.png
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/rationale/additional_features.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/rationale/code.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../doxydoc/index.html
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/reference.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/release_notes.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/test_suite.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/the_tutorial.html:
*A* broken link: ../../../boost.png
*A* broken link: ../../../index.htm
*A* broken link: ../../../more/faq.htm
*A* broken link: ../../../more/index.htm
*A* broken link: ../../../people/people.htm
*A* broken link: ../libraries.html
libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/tutorial_complete_instatiation_scheme.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/tutorial_controlling_collection_types.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/tutorial_differences_with_standard_maps.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.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
libs/bimap/doc/html/boost_bimap/the_tutorial/tutorial_discovering_the_bimap_framework.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.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
libs/bimap/doc/html/boost_bimap/the_tutorial/tutorial_the_collection_of_relations_type.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.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
libs/bimap/doc/html/boost_bimap/the_tutorial/tutorial_unconstrained_sets.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/tutorial_useful_functions.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html:
*A* broken link: ../../../../boost.png
*A* broken link: ../../../../index.htm
*A* broken link: ../../../../more/faq.htm
*A* broken link: ../../../../more/index.htm
*A* broken link: ../../../../people/people.htm
*A* broken link: ../../libraries.html
libs/bimap/doc/html/images/bimap/bimap.structures.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/bimap/boost.bimap.header.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/bimap/boost.bimap.logo.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/bimap/collection.type.of.relation.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/bimap/extended.mapping.framework.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/bimap/more.bimap.structures.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/bimap/simple.bimap.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/bimap/standard.mapping.framework.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/images/callouts/1.png:
*N* leading character of "1.png" is not alphabetic
libs/bimap/doc/html/images/callouts/10.png:
*N* leading character of "10.png" is not alphabetic
libs/bimap/doc/html/images/callouts/11.png:
*N* leading character of "11.png" is not alphabetic
libs/bimap/doc/html/images/callouts/12.png:
*N* leading character of "12.png" is not alphabetic
libs/bimap/doc/html/images/callouts/13.png:
*N* leading character of "13.png" is not alphabetic
libs/bimap/doc/html/images/callouts/14.png:
*N* leading character of "14.png" is not alphabetic
libs/bimap/doc/html/images/callouts/15.png:
*N* leading character of "15.png" is not alphabetic
libs/bimap/doc/html/images/callouts/2.png:
*N* leading character of "2.png" is not alphabetic
libs/bimap/doc/html/images/callouts/3.png:
*N* leading character of "3.png" is not alphabetic
libs/bimap/doc/html/images/callouts/4.png:
*N* leading character of "4.png" is not alphabetic
libs/bimap/doc/html/images/callouts/5.png:
*N* leading character of "5.png" is not alphabetic
libs/bimap/doc/html/images/callouts/6.png:
*N* leading character of "6.png" is not alphabetic
libs/bimap/doc/html/images/callouts/7.png:
*N* leading character of "7.png" is not alphabetic
libs/bimap/doc/html/images/callouts/8.png:
*N* leading character of "8.png" is not alphabetic
libs/bimap/doc/html/images/callouts/9.png:
*N* leading character of "9.png" is not alphabetic
libs/bimap/doc/html/images/extern/boost.blade.logo.png:
*N* name contains more than one dot character ('.')
libs/bimap/doc/html/index.html:
*A* broken link: ../../boost.png
*A* broken link: ../../index.htm
*A* broken link: ../../more/faq.htm
*A* broken link: ../../more/index.htm
*A* broken link: ../../people/people.htm
*A* broken link: libraries.html
libs/bimap/test/test_bimap_convenience_header.cpp:
*N* name exceeds 31 characters
libs/bimap/test/test_bimap_unordered_multiset_of.cpp:
*N* name exceeds 31 characters
|bind|
boost/bind/placeholders.hpp:
*U* unnamed namespace at line 25
|boost-root|
index.htm:
*A* broken link: doc/hmtl/date_time/details.html#changes
|build|
tools/build/v2/test/test_system.html:
*A* unlinked file
|circular_buffer|
boost/circular_buffer/base.hpp:
*M* violation of Boost min/max guidelines on line 2332
*M* violation of Boost min/max guidelines on line 782
*M* violation of Boost min/max guidelines on line 851
boost/circular_buffer/space_optimized.hpp:
*M* violation of Boost min/max guidelines on line 1273
*M* violation of Boost min/max guidelines on line 1282
*M* violation of Boost min/max guidelines on line 1312
*M* violation of Boost min/max guidelines on line 607
libs/circular_buffer/doc/circular_buffer_space_optimized.html:
*N* name exceeds 31 characters
libs/circular_buffer/doc/circular_buffer_space_optimized.png:
*N* name exceeds 31 characters
libs/circular_buffer/doc/circular_buffer_space_optimized.xslt:
*N* name exceeds 31 characters
|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
libs/conversion/test/lexical_cast_noncopyable_test.cpp:
*N* name exceeds 31 characters
|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*
|function_types|
boost/function_types/is_nonmember_callable_builtin.hpp:
*N* name exceeds 31 characters
libs/function_types/test/classification/is_nonmember_callable_builtin.cpp:
*N* name exceeds 31 characters
|fusion|
libs/fusion/test/functional/unfused_typed.cpp:
*T*
|graph|
boost/graph/kolmogorov_max_flow.hpp:
*T*
libs/graph/doc/table_of_contents.html:
*A* broken link: write_dimacs_max_flow.html
libs/graph/example/read_write_dimacs-eg.cpp:
*T*
libs/graph/test/csr_graph_test.cpp:
*T*
libs/graph/test/graphml_test.cpp:
*T*
libs/graph/test/serialize.cpp:
*T*
|integer|
libs/integer/integer.htm:
*A* broken link: ../../../LICENSE_1_0.txt
|interprocess|
boost/interprocess/managed_windows_shared_memory.hpp:
*N* name exceeds 31 characters
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
boost/interprocess/sync/posix/interprocess_recursive_mutex.hpp:
*N* name exceeds 31 characters
libs/interprocess/example/doc_anonymous_condition_shared_data.hpp:
*N* name exceeds 31 characters
libs/interprocess/example/doc_anonymous_mutex_shared_data.hpp:
*N* name exceeds 31 characters
libs/interprocess/example/doc_anonymous_semaphore_shared_data.hpp:
*N* name exceeds 31 characters
libs/interprocess/example/doc_anonymous_upgradable_mutexA.cpp:
*N* name exceeds 31 characters
libs/interprocess/example/doc_anonymous_upgradable_mutexB.cpp:
*N* name exceeds 31 characters
libs/interprocess/example/doc_managed_aligned_allocation.cpp:
*N* name exceeds 31 characters
libs/interprocess/example/doc_named_condition_shared_data.hpp:
*N* name exceeds 31 characters
libs/interprocess/example/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_adaptive_pool_test.vcproj:
*N* name exceeds 31 characters
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/doc_cached_node_allocator.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/doc_managed_aligned_allocation.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/doc_managed_raw_allocation.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/doc_private_adaptive_pool.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/doc_private_node_allocator.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/doc_windows_shared_memory.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/doc_windows_shared_memory2.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/flat_map_index_allocation_test.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/iset_index_allocation_test.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/iunordered_set_index_allocation_test.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/managed_windows_shared_memory.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/map_index_allocation_test.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_adaptive_pool_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/windows_shared_memory_mapping_test.vcproj:
*N* name exceeds 31 characters
libs/interprocess/proj/vc7ide/windows_shared_memory_test.vcproj:
*N* name exceeds 31 characters
libs/interprocess/test/flat_map_index_allocation_test.cpp:
*N* name exceeds 31 characters
libs/interprocess/test/iunordered_set_index_allocation_test.cpp:
*N* name exceeds 31 characters
libs/interprocess/test/managed_windows_shared_memory_test.cpp:
*N* name exceeds 31 characters
libs/interprocess/test/memory_algorithm_test_template.hpp:
*N* name exceeds 31 characters
libs/interprocess/test/message_queue_test.cpp:
*M* violation of Boost min/max guidelines on line 25
*M* violation of Boost min/max guidelines on line 61
libs/interprocess/test/named_allocation_test_template.hpp:
*N* name exceeds 31 characters
libs/interprocess/test/sharable_mutex_test_template.hpp:
*N* name exceeds 31 characters
libs/interprocess/test/windows_shared_memory_mapping_test.cpp:
*N* name exceeds 31 characters
|iostreams|
libs/iostreams/doc/concepts/multi-character.html:
*A* unlinked file
libs/iostreams/doc/installation.html:
*A* broken link: ../../../tools/build/v1/build_system.htm
|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
|math|
libs/math/test/common_factor_test.cpp:
*M* violation of Boost min/max guidelines on line 146
*M* violation of Boost min/max guidelines on line 147
*M* violation of Boost min/max guidelines on line 193
*M* violation of Boost min/max guidelines on line 194
|more|
more/BoostCon07.html:
*A* unlinked file
more/BoostCon07_session_call.html:
*A* unlinked file
more/cvs.html:
*A* unlinked file
more/getting_started/unix-variants.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/getting_started/windows.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/version_history.html:
*A* broken link: ../tools/build/v1/intel-linux-tools.html
*A* broken link: ../tools/build/v1/intel-win32-tools.html
*A* broken link: ../tools/build/v1/msvc-stlport-tools.html
|mpi|
boost/mpi/communicator.hpp:
*T*
boost/mpi/detail/forward_iprimitive.hpp:
*T*
boost/mpi/detail/forward_oprimitive.hpp:
*T*
boost/mpi/detail/forward_skeleton_iarchive.hpp:
*T*
boost/mpi/detail/forward_skeleton_oarchive.hpp:
*T*
boost/mpi/detail/ignore_skeleton_oarchive.hpp:
*T*
boost/mpi/detail/text_skeleton_oarchive.hpp:
*T*
libs/mpi/src/point_to_point.cpp:
*T*
|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/test/manual/sp_resize.cpp:
*T*
|pending|
boost/pending/fibonacci_heap.hpp:
*T*
|program_options|
boost/program_options/positional_options.hpp:
*M* violation of Boost min/max guidelines on line 44
|property_tree|
boost/property_tree/detail/pugxml.hpp:
*M* violation of Boost min/max guidelines on line 1108
*M* violation of Boost min/max guidelines on line 1109
*M* violation of Boost min/max guidelines on line 1110
*M* violation of Boost min/max guidelines on line 1943
*M* violation of Boost min/max guidelines on line 1960
*M* violation of Boost min/max guidelines on line 2426
*M* violation of Boost min/max guidelines on line 2427
*M* violation of Boost min/max guidelines on line 2428
*M* violation of Boost min/max guidelines on line 2429
*M* violation of Boost min/max guidelines on line 2430
*M* violation of Boost min/max guidelines on line 2431
*M* violation of Boost min/max guidelines on line 2949
*M* violation of Boost min/max guidelines on line 3001
*T*
boost/property_tree/detail/rapidxml.hpp:
*T*
boost/property_tree/detail/translator_implementation.hpp:
*T*
libs/property_tree/examples/settings_partially-existent.info:
*N* name exceeds 31 characters
libs/property_tree/test/custom-build/settings_partially-existent.info:
*N* name exceeds 31 characters
libs/property_tree/test/custom-build/test_example_custom_data_type.vcproj:
*N* name exceeds 31 characters
libs/property_tree/test/custom-build/test_example_debug_settings.vcproj:
*N* name exceeds 31 characters
libs/property_tree/test/custom-build/test_example_empty_ptree_trick.vcproj:
*N* name exceeds 31 characters
libs/property_tree/test/test_json_parser.cpp:
*T*
libs/property_tree/test/xml_parser_test_data.hpp:
*T*
|python|
libs/python/doc/building.html:
*A* broken link: ../boost.png
*A* broken link: ../index.htm
libs/python/doc/tutorial/doc/html/python/hello.html:
*A* broken link: ../../../../../example/tutorial/Jamrules
libs/python/doc/tutorial/index.html:
*A* broken link: ../../../LICENSE_1_0.txt
libs/python/doc/v2/May2002.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
*A* broken link: ../../../../tools/build/v1/gen_aix_import_file.py
libs/python/doc/v2/faq.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
|quickbook|
tools/quickbook/doc/html/images/callouts/1.png:
*N* leading character of "1.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/10.png:
*N* leading character of "10.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/11.png:
*N* leading character of "11.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/12.png:
*N* leading character of "12.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/13.png:
*N* leading character of "13.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/14.png:
*N* leading character of "14.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/15.png:
*N* leading character of "15.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/2.png:
*N* leading character of "2.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/3.png:
*N* leading character of "3.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/4.png:
*N* leading character of "4.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/5.png:
*N* leading character of "5.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/6.png:
*N* leading character of "6.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/7.png:
*N* leading character of "7.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/8.png:
*N* leading character of "8.png" is not alphabetic
tools/quickbook/doc/html/images/callouts/9.png:
*N* leading character of "9.png" is not alphabetic
tools/quickbook/doc/html/index.html:
*A* broken link: quickbook/install/macosx.html
tools/quickbook/doc/html/quickbook/install.html:
*A* broken link: install/macosx.html
tools/quickbook/doc/html/quickbook/install/windows.html:
*A* broken link: macosx.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/test/test-cases/incremental/bjam.log.1:
*N* name contains more than one dot character ('.')
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
|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
|type_traits|
libs/type_traits/cxx_type_traits.htm:
*A* unlinked file
|utility|
boost/utility/result_of.hpp:
*T*
1
0
Boost Inspection Report
Run Date: 16:11:43 UTC, Sunday 27 May 2007
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:
14249 files scanned
1258 directories scanned (including root)
2457 problems reported
Problem counts:
1618 files missing Boost license info or having wrong reference text
839 files missing copyright notice
Summary:
algorithm (1)
any (1)
archive (1)
asio (8)
assign (4)
bimap (49)
build (68)
circular_buffer (2)
concept_check (22)
config (2)
conversion (6)
disjoint_sets (2)
doc (54)
dynamic_bitset (4)
filesystem (4)
format (2)
function (15)
function_types (13)
fusion (285)
gil (36)
graph (178)
inspect (1)
integer (6)
interprocess (10)
intrusive (4)
iterator (36)
lambda (10)
libs (6)
litre (4)
logic (2)
math (13)
more (11)
mpi (2)
mpl (926)
multi_array (14)
numeric (192)
optional (1)
people (4)
program_options (41)
property_map (15)
property_tree (20)
ptr_container (110)
python (14)
quickbook (19)
range (18)
rational (5)
regex (4)
regression (84)
release (2)
serialization (16)
signals (28)
smart_ptr (8)
test (5)
timer (1)
tr1 (2)
tuple (7)
utility (14)
variant (43)
xpressive (2)
Details:
*L* missing Boost license info, or wrong reference text
*C* missing copyright notice
|algorithm|
libs/algorithm/string/doc/
external_concepts.html: *L*
|any|
libs/any/doc/
any.xml: *L*
|archive|
boost/archive/detail/
utf8_codecvt_facet.hpp: *L*
|asio|
libs/asio/example/http/doc_root/
1K.html: *C* *L*
2K.html: *C* *L*
4K.html: *C* *L*
8K.html: *C* *L*
|assign|
libs/assign/doc/
style.css: *C* *L*
libs/assign/test/
TODO: *C* *L*
|bimap|
libs/bimap/doc/
directdoxygen.jam: *C* *L*
libs/bimap/doc/html/boost_bimap/
acknowledgements.html: *L*
bimap_and_boost.html: *L*
libs/bimap/doc/html/boost_bimap/bimap_and_boost/
boost_libraries_that_work_well_with_boost_bimap.html: *L*
dependencies.html: *L*
libs/bimap/doc/html/boost_bimap/
compiler_specifics.html: *L*
examples.html: *L*
libs/bimap/doc/html/boost_bimap/examples/
mighty_bimap.html: *L*
multiindex_to_bimap_path___bidirectional_map.html: *L*
multiindex_to_bimap_path___hashed_indices.html: *L*
simple_bimap.html: *L*
libs/bimap/doc/html/boost_bimap/
future_work.html: *L*
history.html: *L*
libs/bimap/doc/html/boost_bimap/history/
multiindex_and_bimap.html: *L*
libs/bimap/doc/html/boost_bimap/
introduction.html: *L*
one_minute_tutorial.html: *L*
performance.html: *L*
rationale.html: *L*
libs/bimap/doc/html/boost_bimap/rationale/
additional_features.html: *L*
code.html: *L*
the_student_and_the_mentor.html: *L*
libs/bimap/doc/html/boost_bimap/
reference.html: *L*
libs/bimap/doc/html/boost_bimap/reference/
bimap_reference.html: *L*
list_of_reference.html: *L*
set_of_reference.html: *L*
unconstrained_set_of_reference.html: *L*
unordered_set_of_reference.html: *L*
vector_of_reference.html: *L*
libs/bimap/doc/html/boost_bimap/
release_notes.html: *L*
test_suite.html: *L*
the_tutorial.html: *L*
libs/bimap/doc/html/boost_bimap/the_tutorial/
bimaps_with_user_defined_names.html: *L*
complete_instantiation_scheme.html: *L*
controlling_collection_types.html: *L*
differences_with_standard_maps.html: *L*
discovering_the_bimap_framework.html: *L*
the_collection_of_relations_type.html: *L*
tutorial_complete_instatiation_scheme.html: *L*
tutorial_controlling_collection_types.html: *L*
tutorial_differences_with_standard_maps.html: *L*
tutorial_discovering_the_bimap_framework.html: *L*
tutorial_the_collection_of_relations_type.html: *L*
tutorial_unconstrained_sets.html: *L*
tutorial_useful_functions.html: *L*
unconstrained_sets.html: *L*
useful_functions.html: *L*
libs/bimap/
index.html: *C* *L*
|build|
tools/build/v2/build/
build-request.jam: *L*
modifiers.jam: *L*
tools/build/v2/doc/
Jamfile.v2: *C* *L*
tools/build/v2/doc/src/
advanced.xml: *C* *L*
architecture.xml: *C* *L*
catalog.xml: *C* *L*
extending.xml: *C* *L*
faq.xml: *C* *L*
fragments.xml: *C* *L*
howto.xml: *C* *L*
install.xml: *C* *L*
recipes.xml: *C* *L*
reference.xml: *C* *L*
standalone.xml: *C* *L*
tutorial.xml: *C* *L*
userman.xml: *C* *L*
tools/build/v2/example/generate/
REAME.txt: *C* *L*
a.cpp: *C* *L*
tools/build/v2/example/generator/
README.txt: *C* *L*
soap.jam: *C* *L*
tools/build/v2/example/python_modules/
python_helpers.jam: *C* *L*
python_helpers.py: *C* *L*
tools/build/v2/test/
abs_workdir.py: *C* *L*
dependency_property.py: *L*
dependency_test.py: *C* *L*
direct_request_test.py: *C* *L*
dll_path.py: *L*
double_loading.py: *L*
duplicate.py: *L*
echo_args.jam: *C* *L*
empty.jam: *C* *L*
expansion.py: *L*
explicit.py: *L*
gcc_runtime.py: *L*
tools/build/v2/test/project-test3/lib3/
Jamfile: *C* *L*
tools/build/v2/test/
readme.txt: *C* *L*
svn_tree.py: *L*
tag.py: *L*
test_system.html: *L*
tools/build/v2/tools/
sun.jam: *L*
xsltproc.jam: *L*
|circular_buffer|
libs/circular_buffer/
index.html: *C* *L*
|concept_check|
libs/concept_check/
bibliography.htm: *L*
concept_check.htm: *L*
concept_covering.htm: *L*
creating_concepts.htm: *L*
libs/concept_check/doc/
Jamfile.v2: *C* *L*
libs/concept_check/doc/reference/
Assignable.xml: *L*
BidirectionalIterator.xml: *L*
CopyConstructible.xml: *L*
DefaultConstructible.xml: *L*
EqualityComparable.xml: *L*
ForwardIterator.xml: *L*
InputIterator.xml: *L*
LessThanComparable.xml: *L*
OutputIterator.xml: *L*
RandomAccessIterator.xml: *L*
SignedInteger.xml: *L*
concepts.xml: *L*
libs/concept_check/
implementation.htm: *L*
prog_with_concepts.htm: *L*
reference.htm: *L*
using_concept_check.htm: *L*
|config|
libs/config/test/link/test/
Jamfile.v2: *C* *L*
|conversion|
libs/conversion/
cast.htm: *L*
index.html: *C* *L*
lexical_cast.htm: *L*
libs/conversion/test/
Jamfile: *L*
Jamfile.v2: *L*
|disjoint_sets|
libs/disjoint_sets/
Jamfile: *C* *L*
|doc|
doc/
Jamfile.v2: *C* *L*
doc/html/
CopyConstructible.html: *C* *L*
any.html: *C* *L*
array.html: *C* *L*
boost_math.html: *C* *L*
doc/html/boost_math/
gcd_lcm.html: *C* *L*
inverse_complex.html: *C* *L*
doc/html/
boost_staticassert.html: *C* *L*
boost_tr1.html: *C* *L*
boost_typetraits.html: *C* *L*
doc/html/boost_typetraits/
background.html: *C* *L*
doc/html/
boostbook.html: *C* *L*
date_time.html: *C* *L*
docutils.css: *L*
foreach.html: *C* *L*
function.html: *C* *L*
functionN.html: *C* *L*
lambda.html: *C* *L*
program_options.html: *C* *L*
ref.html: *C* *L*
signals.html: *C* *L*
string_algo.html: *C* *L*
tribool.html: *C* *L*
variant.html: *C* *L*
who_s_using_boost_.html: *C* *L*
xpressive.html: *C* *L*
doc/src/
boost.xml: *C* *L*
docutils.css: *L*
|dynamic_bitset|
libs/dynamic_bitset/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
|filesystem|
libs/filesystem/doc/
tr2_proposal.html: *L*
libs/filesystem/example/
Jamfile.v2: *C* *L*
libs/filesystem/src/
utf8_codecvt_facet.hpp: *L*
|format|
libs/format/benchmark/
Jamfile: *L*
libs/format/test/
Jamfile: *L*
|function|
boost/function/detail/
gen_maybe_include.pl: *L*
libs/function/doc/
Jamfile.v2: *C* *L*
faq.xml: *C* *L*
history.xml: *C* *L*
misc.xml: *C* *L*
reference.xml: *C* *L*
tests.xml: *C* *L*
tutorial.xml: *C* *L*
|function_types|
libs/function_types/doc/
Jamfile.v2: *C* *L*
libs/function_types/doc/html/boost_functiontypes/
about_tag_types.html: *L*
acknowledgements.html: *L*
introduction.html: *L*
rationale.html: *L*
reference.html: *L*
libs/function_types/doc/html/boost_functiontypes/reference/
classification.html: *L*
decomposition.html: *L*
macros.html: *L*
synthesis.html: *L*
tag_types.html: *L*
libs/function_types/doc/html/boost_functiontypes/
use_cases.html: *L*
|fusion|
libs/fusion/doc/
Jamfile: *C* *L*
acknowledgements.qbk: *C* *L*
algorithms.qbk: *C* *L*
changelog.qbk: *C* *L*
extension.qbk: *C* *L*
functional.qbk: *C* *L*
libs/fusion/doc/html/fusion/
acknowledgements.html: *L*
algorithms.html: *L*
libs/fusion/doc/html/fusion/algorithms/
concepts.html: *L*
libs/fusion/doc/html/fusion/algorithms/concepts/
poly.html: *L*
libs/fusion/doc/html/fusion/algorithms/
iteration.html: *L*
libs/fusion/doc/html/fusion/algorithms/iteration/
functions.html: *L*
libs/fusion/doc/html/fusion/algorithms/iteration/functions/
accumulate.html: *L*
fold.html: *L*
for_each.html: *L*
libs/fusion/doc/html/fusion/algorithms/iteration/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/algorithms/iteration/metafunctions/
accumulate.html: *L*
fold.html: *L*
for_each.html: *L*
libs/fusion/doc/html/fusion/algorithms/
query.html: *L*
libs/fusion/doc/html/fusion/algorithms/query/
functions.html: *L*
libs/fusion/doc/html/fusion/algorithms/query/functions/
all.html: *L*
any.html: *L*
count.html: *L*
count_if.html: *L*
find.html: *L*
find_if.html: *L*
none.html: *L*
libs/fusion/doc/html/fusion/algorithms/query/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/algorithms/query/metafunctions/
all.html: *L*
any.html: *L*
count.html: *L*
count_if.html: *L*
find.html: *L*
find_if.html: *L*
none.html: *L*
libs/fusion/doc/html/fusion/algorithms/
transformation.html: *L*
libs/fusion/doc/html/fusion/algorithms/transformation/
functions.html: *L*
libs/fusion/doc/html/fusion/algorithms/transformation/functions/
clear.html: *L*
erase.html: *L*
erase_key.html: *L*
filter.html: *L*
filter_if.html: *L*
insert.html: *L*
insert_range.html: *L*
join.html: *L*
pop_back.html: *L*
pop_front.html: *L*
push_back.html: *L*
push_front.html: *L*
remove.html: *L*
remove_if.html: *L*
replace.html: *L*
replace_if.html: *L*
reverse.html: *L*
transform.html: *L*
zip.html: *L*
libs/fusion/doc/html/fusion/algorithms/transformation/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/algorithms/transformation/metafunctions/
clear.html: *L*
erase.html: *L*
erase_key.html: *L*
filter.html: *L*
filter_if.html: *L*
insert.html: *L*
insert_range.html: *L*
join.html: *L*
pop_back.html: *L*
pop_front.html: *L*
push_back.html: *L*
push_front.html: *L*
remove.html: *L*
remove_if.html: *L*
replace.html: *L*
replace_if.html: *L*
reverse.html: *L*
transform.html: *L*
zip.html: *L*
libs/fusion/doc/html/fusion/
change_log.html: *L*
extension.html: *L*
functional.html: *L*
libs/fusion/doc/html/fusion/functional/
adapters.html: *L*
libs/fusion/doc/html/fusion/functional/adapters/
fused.html: *L*
fused_function_object.html: *L*
fused_procedure.html: *L*
unfused_generic.html: *L*
unfused_lvalue_args.html: *L*
unfused_rvalue_args.html: *L*
unfused_typed.html: *L*
libs/fusion/doc/html/fusion/functional/
concepts.html: *L*
libs/fusion/doc/html/fusion/functional/concepts/
callable.html: *L*
def_callable.html: *L*
poly.html: *L*
libs/fusion/doc/html/fusion/functional/
generation.html: *L*
libs/fusion/doc/html/fusion/functional/generation/
functions.html: *L*
libs/fusion/doc/html/fusion/functional/generation/functions/
mk_fused.html: *L*
mk_fused_fobj.html: *L*
mk_fused_proc.html: *L*
mk_unfused_genrc.html: *L*
mk_unfused_lvargs.html: *L*
mk_unfused_rvargs.html: *L*
libs/fusion/doc/html/fusion/functional/generation/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/functional/generation/metafunctions/
mk_fused.html: *L*
mk_fused_fobj.html: *L*
mk_fused_proc.html: *L*
mk_unfused_genrc.html: *L*
mk_unfused_lvargs.html: *L*
mk_unfused_rvargs.html: *L*
libs/fusion/doc/html/fusion/functional/
invocation.html: *L*
libs/fusion/doc/html/fusion/functional/invocation/
functions.html: *L*
libs/fusion/doc/html/fusion/functional/invocation/functions/
invoke.html: *L*
invoke_fobj.html: *L*
invoke_proc.html: *L*
libs/fusion/doc/html/fusion/functional/invocation/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/functional/invocation/metafunctions/
invoke.html: *L*
invoke_fobj.html: *L*
invoke_proc.html: *L*
libs/fusion/doc/html/fusion/
introduction.html: *L*
iterators.html: *L*
libs/fusion/doc/html/fusion/iterators/
concepts.html: *L*
libs/fusion/doc/html/fusion/iterators/concepts/
bidirectional_iterator.html: *L*
forward_iterator.html: *L*
random_access_iterator.html: *L*
libs/fusion/doc/html/fusion/iterators/
functions.html: *L*
libs/fusion/doc/html/fusion/iterators/functions/
advance.html: *L*
advance_c.html: *L*
deref.html: *L*
distance.html: *L*
next.html: *L*
prior.html: *L*
libs/fusion/doc/html/fusion/iterators/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/iterators/metafunctions/
advance.html: *L*
advance_c.html: *L*
deref.html: *L*
distance.html: *L*
equal_to.html: *L*
next.html: *L*
prior.html: *L*
value_of.html: *L*
libs/fusion/doc/html/fusion/iterators/
operators.html: *L*
libs/fusion/doc/html/fusion/iterators/operators/
operator_equality.html: *L*
operator_inequality.html: *L*
operator_unary_star.html: *L*
libs/fusion/doc/html/fusion/
notes.html: *L*
organization.html: *L*
preface.html: *L*
quick_start.html: *L*
references.html: *L*
sequences.html: *L*
libs/fusion/doc/html/fusion/sequences/
adapted.html: *L*
libs/fusion/doc/html/fusion/sequences/adapted/
boost__array.html: *L*
boost__tuple.html: *L*
boost__variant.html: *L*
mpl_sequence.html: *L*
std__pair.html: *L*
libs/fusion/doc/html/fusion/sequences/
concepts.html: *L*
libs/fusion/doc/html/fusion/sequences/concepts/
associative_sequence.html: *L*
bidirectional_sequence.html: *L*
forward_sequence.html: *L*
random_access_sequence.html: *L*
libs/fusion/doc/html/fusion/sequences/
containers.html: *L*
libs/fusion/doc/html/fusion/sequences/containers/
cons.html: *L*
list.html: *L*
map.html: *L*
set.html: *L*
vector.html: *L*
libs/fusion/doc/html/fusion/sequences/
conversion.html: *L*
libs/fusion/doc/html/fusion/sequences/conversion/
functions.html: *L*
libs/fusion/doc/html/fusion/sequences/conversion/functions/
as_list.html: *L*
as_map.html: *L*
as_set.html: *L*
as_vector.html: *L*
libs/fusion/doc/html/fusion/sequences/conversion/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/sequences/conversion/metafunctions/
as_list.html: *L*
as_map.html: *L*
as_set.html: *L*
as_vector.html: *L*
libs/fusion/doc/html/fusion/sequences/
generation.html: *L*
libs/fusion/doc/html/fusion/sequences/generation/
functions.html: *L*
libs/fusion/doc/html/fusion/sequences/generation/functions/
list_tie.html: *L*
make_cons.html: *L*
make_list.html: *L*
make_map.html: *L*
make_set.html: *L*
make_vector.html: *L*
tiers.html: *L*
vector_tie.html: *L*
libs/fusion/doc/html/fusion/sequences/generation/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/sequences/generation/metafunctions/
list_tie.html: *L*
make_cons.html: *L*
make_list.html: *L*
make_map.html: *L*
make_set.html: *L*
make_vector.html: *L*
vector_tie.html: *L*
libs/fusion/doc/html/fusion/sequences/
intrinsics.html: *L*
libs/fusion/doc/html/fusion/sequences/intrinsics/
functions.html: *L*
libs/fusion/doc/html/fusion/sequences/intrinsics/functions/
at.html: *L*
at_c.html: *L*
at_key.html: *L*
back.html: *L*
begin.html: *L*
empty.html: *L*
end.html: *L*
front.html: *L*
has_key.html: *L*
size.html: *L*
libs/fusion/doc/html/fusion/sequences/intrinsics/
metafunctions.html: *L*
libs/fusion/doc/html/fusion/sequences/intrinsics/metafunctions/
at.html: *L*
at_c.html: *L*
at_key.html: *L*
back.html: *L*
begin.html: *L*
empty.html: *L*
end.html: *L*
front.html: *L*
has_key.html: *L*
size.html: *L*
value_at.html: *L*
value_at_c.html: *L*
value_at_key.html: *L*
libs/fusion/doc/html/fusion/sequences/
operators.html: *L*
libs/fusion/doc/html/fusion/sequences/operators/
comparison.html: *L*
libs/fusion/doc/html/fusion/sequences/operators/comparison/
equal.html: *L*
greater_than.html: *L*
greater_than_equal.html: *L*
less_than.html: *L*
less_than_equal.html: *L*
not_equal.html: *L*
libs/fusion/doc/html/fusion/sequences/operators/
i_o.html: *L*
libs/fusion/doc/html/fusion/sequences/operators/i_o/
in.html: *L*
out.html: *L*
libs/fusion/doc/html/fusion/sequences/
views.html: *L*
libs/fusion/doc/html/fusion/sequences/views/
filter_view.html: *L*
iterator_range.html: *L*
joint_view.html: *L*
reverse_view.html: *L*
single_view.html: *L*
transform_view.html: *L*
zip_view.html: *L*
libs/fusion/doc/html/fusion/
support.html: *L*
libs/fusion/doc/html/fusion/support/
category_of.html: *L*
deduce.html: *L*
deduce_sequence.html: *L*
is_sequence.html: *L*
is_view.html: *L*
pair.html: *L*
tag_of.html: *L*
libs/fusion/doc/html/fusion/
tuples.html: *L*
libs/fusion/doc/html/fusion/tuples/
class_template_tuple.html: *L*
libs/fusion/doc/html/fusion/tuples/class_template_tuple/
construction.html: *L*
element_access.html: *L*
relational_operators.html: *L*
tuple_creation_functions.html: *L*
tuple_helper_classes.html: *L*
libs/fusion/doc/html/fusion/tuples/
pairs.html: *L*
libs/fusion/doc/
introduction.qbk: *C* *L*
iterators.qbk: *C* *L*
notes.qbk: *C* *L*
organization.qbk: *C* *L*
preface.qbk: *C* *L*
quick_start.qbk: *C* *L*
references.qbk: *C* *L*
sequences.qbk: *C* *L*
support.qbk: *C* *L*
tuples.qbk: *C* *L*
libs/fusion/example/performance/
timings.txt: *C* *L*
libs/fusion/
todo.txt: *C* *L*
|gil|
libs/gil/doc/
index.html: *C* *L*
libs/gil/example/
Makefile: *C* *L*
README.txt: *C* *L*
affine.cpp: *C* *L*
convolution.cpp: *C* *L*
dynamic_image.cpp: *C* *L*
histogram.cpp: *C* *L*
interleaved_ptr.cpp: *C* *L*
interleaved_ptr.hpp: *L*
interleaved_ref.hpp: *L*
mandelbrot.cpp: *C* *L*
packed_pixel.cpp: *C* *L*
resize.cpp: *C* *L*
x_gradient.cpp: *C* *L*
libs/gil/test/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
Makefile: *C* *L*
gil_reference_checksums.txt: *C* *L*
performance.cpp: *C* *L*
|graph|
libs/graph/build/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
libs/graph/doc/
AStarHeuristic.html: *L*
AStarVisitor.html: *L*
AdjacencyGraph.html: *L*
AdjacencyMatrix.html: *L*
BFSVisitor.html: *L*
BasicMatrix.html: *L*
BellmanFordVisitor.html: *L*
BidirectionalGraph.html: *L*
Buffer.html: *L*
ColorValue.html: *L*
DFSVisitor.html: *L*
DijkstraVisitor.html: *L*
EdgeListGraph.html: *L*
EdgeMutableGraph.html: *L*
EventVisitor.html: *L*
EventVisitorList.html: *L*
Graph.html: *L*
IncidenceGraph.html: *L*
IteratorConstructibleGraph.html: *L*
Makefile: *C* *L*
Monoid.html: *L*
MutableGraph.html: *L*
MutablePropertyGraph.html: *L*
PropertyGraph.html: *L*
PropertyTag.html: *L*
VertexAndEdgeListGraph.html: *L*
VertexListGraph.html: *L*
VertexMutableGraph.html: *L*
acknowledgements.html: *L*
adjacency_iterator.html: *L*
adjacency_list.html: *L*
adjacency_list_traits.html: *L*
adjacency_matrix.html: *L*
astar_heuristic.html: *L*
astar_search.html: *L*
astar_visitor.html: *L*
bandwidth.html: *L*
bc_clustering.html: *L*
bellman_ford_shortest.html: *L*
bellman_visitor.html: *L*
betweenness_centrality.html: *L*
bfs_visitor.html: *L*
bgl_named_params.html: *L*
bibliography.html: *L*
breadth_first_search.html: *L*
breadth_first_visit.html: *L*
challenge.html: *L*
circle_layout.html: *L*
compressed_sparse_row.html: *L*
connected_components.html: *L*
constructing_algorithms.html: *L*
copy_graph.html: *L*
cuthill_mckee_ordering.html: *L*
dag_shortest_paths.html: *L*
default.css: *L*
depth_first_search.html: *L*
depth_first_visit.html: *L*
dfs_visitor.html: *L*
dijkstra_shortest_paths.html: *L*
dijkstra_visitor.html: *L*
distance_recorder.html: *L*
edge_list.html: *L*
edmunds_karp_max_flow.html: *L*
exception.html: *L*
faq.html: *L*
libs/graph/doc/figs/
Makefile: *C* *L*
libs/graph/doc/
file_dependency_example.html: *L*
filtered_graph.html: *L*
floyd_warshall_shortest.html: *L*
fruchterman_reingold.html: *L*
graph_coloring.html: *L*
graph_concepts.html: *L*
graph_theory_review.html: *L*
graph_traits.html: *L*
gursoy_atun_layout.html: *L*
history.html: *L*
incident.html: *L*
incremental_components.html: *L*
index.html: *L*
inv_adjacency_iterator.html: *L*
isomorphism.html: *L*
johnson_all_pairs_shortest.html: *L*
jwebfrob.pl: *C* *L*
kamada_kawai_spring_layout.html: *L*
kevin_bacon.html: *L*
king_ordering.html: *L*
known_problems.html: *L*
kruskal_min_spanning_tree.html: *L*
layout_tolerance.html: *C* *L*
leda_conversion.html: *L*
lengauer_tarjan_dominator.htm: *L*
minimum_degree_ordering.html: *L*
null_visitor.html: *L*
opposite.html: *L*
predecessor_recorder.html: *L*
prim_minimum_spanning_tree.html: *L*
profile.htm: *L*
property.html: *L*
property_map.html: *L*
property_writer.html: *L*
publications.html: *L*
push_relabel_max_flow.html: *L*
python.html: *L*
quick_tour.html: *L*
random.html: *L*
random_layout.html: *L*
read_graphml.html: *C* *L*
read_graphml.rst: *C* *L*
read_graphviz.html: *C* *L*
read_graphviz.rst: *C* *L*
reverse_graph.html: *L*
sequential_vertex_coloring.html: *L*
sloan_ordering.htm: *L*
sloan_start_end_vertices.htm: *L*
sparse_matrix_ordering.html: *L*
stanford_graph.html: *L*
strong_components.html: *L*
subgraph.html: *L*
table_of_contents.html: *L*
time_stamper.html: *L*
topological_sort.html: *L*
transitive_closure.html: *L*
transpose_graph.html: *L*
trouble_shooting.html: *L*
undirected_dfs.html: *L*
users.html: *C* *L*
using_adjacency_list.html: *L*
using_property_maps.html: *L*
visitor_concepts.html: *L*
wavefront.htm: *L*
write-graphviz.html: *L*
write_graphml.html: *C* *L*
write_graphml.rst: *C* *L*
libs/graph/example/
Jamfile: *C* *L*
cuthill_mckee_ordering.cpp: *L*
data1.txt: *C* *L*
data2.txt: *C* *L*
data3.txt: *C* *L*
king_ordering.cpp: *L*
property_iterator.cpp: *L*
libs/graph/example/python/
breadth_first_search.py: *C* *L*
vis.py: *C* *L*
libs/graph/example/
regrtest.py: *C* *L*
sloan_ordering.cpp: *L*
libs/graph/test/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
cuthill_mckee_ordering.cpp: *L*
dag_longest_paths.cpp: *C* *L*
graphml_test.xml: *C* *L*
king_ordering.cpp: *L*
serialize.cpp: *C* *L*
|inspect|
tools/inspect/build/
Jamfile.v2: *L*
|integer|
libs/integer/
cstdint.htm: *C* *L*
index.html: *C* *L*
integer_traits.html: *C* *L*
|interprocess|
boost/interprocess/detail/
config_begin.hpp: *C* *L*
config_end.hpp: *C* *L*
boost/interprocess/smart_ptr/detail/
sp_counted_base.hpp: *C* *L*
libs/interprocess/doc/html/
reference.css: *C* *L*
libs/interprocess/
index.html: *C* *L*
|intrusive|
libs/intrusive/doc/html/
reference.css: *C* *L*
libs/intrusive/test/
test_templates.hpp: *C* *L*
|iterator|
libs/iterator/doc/quickbook/
adaptor.qbk: *C* *L*
archetypes.qbk: *C* *L*
concept_checking.qbk: *C* *L*
concepts.qbk: *C* *L*
counting_iterator.qbk: *C* *L*
facade.qbk: *C* *L*
facade_tutorial.qbk: *C* *L*
filter_iterator.qbk: *C* *L*
function_output_iterator.qbk: *C* *L*
indirect_iterator.qbk: *C* *L*
permutation_iterator.qbk: *C* *L*
reverse_iterator.qbk: *C* *L*
shared_container_iterator.qbk: *C* *L*
specialized_adaptors.qbk: *C* *L*
traits.qbk: *C* *L*
transform_iterator.qbk: *C* *L*
utilities.qbk: *C* *L*
zip_iterator.qbk: *C* *L*
|lambda|
libs/lambda/doc/
Jamfile.v2: *C* *L*
libs/lambda/doc/detail/
README: *C* *L*
lambda_doc.xsl: *C* *L*
lambda_doc_chunks.xsl: *C* *L*
libs/lambda/test/
Makefile: *C* *L*
|libs|
libs/
expected_results.xml: *C* *L*
maintainers.txt: *C* *L*
platform_maintainers.txt: *C* *L*
|litre|
tools/litre/
litre.py: *C* *L*
tool.py: *C* *L*
|logic|
libs/logic/doc/
Jamfile.v2: *C* *L*
|math|
boost/math/
common_factor_rt.hpp: *L*
libs/math/doc/
math-background.qbk: *C* *L*
math-gcd.qbk: *C* *L*
math-octonion.qbk: *C* *L*
math-quaternion.qbk: *C* *L*
math-sf.qbk: *C* *L*
math-tr1.qbk: *C* *L*
|more|
more/
error_handling.html: *L*
generic_exception_safety.html: *C* *L*
generic_programming.html: *L*
moderators.html: *C*
regression.html: *C* *L*
report-apr-2006.html: *C* *L*
report-jan-2006.html: *C* *L*
|mpi|
libs/mpi/build/
__init__.py: *C* *L*
|mpl|
libs/mpl/doc/refmanual/
accumulate.html: *C* *L*
acknowledgements.html: *C* *L*
advance.html: *C* *L*
algorithms-concepts.html: *C* *L*
algorithms.html: *C* *L*
always.html: *C* *L*
and.html: *C* *L*
apply-wrap.html: *C* *L*
apply.html: *C* *L*
arg.html: *C* *L*
arithmetic-operations.html: *C* *L*
assert-msg.html: *C* *L*
assert-not.html: *C* *L*
assert-relation.html: *C* *L*
assert.html: *C* *L*
asserts.html: *C* *L*
associative-sequence.html: *C* *L*
at-c.html: *C* *L*
at.html: *C* *L*
aux-lambda-support.html: *C* *L*
back-extensible-sequence.html: *C* *L*
back-inserter.html: *C* *L*
back.html: *C* *L*
begin.html: *C* *L*
bidirectional-iterator.html: *C* *L*
bidirectional-sequence.html: *C* *L*
bind.html: *C* *L*
bitand.html: *C* *L*
bitor.html: *C* *L*
bitwise-operations.html: *C* *L*
bitxor.html: *C* *L*
bool.html: *C* *L*
broken-compiler.html: *C* *L*
categorized-concepts.html: *C* *L*
categorized-index.html: *C* *L*
cfg-no-has-xxx.html: *C* *L*
cfg-no-preprocessed.html: *C* *L*
classes.html: *C* *L*
clear.html: *C* *L*
comparisons.html: *C* *L*
components.html: *C* *L*
composition-and-argument.html: *C* *L*
concepts.html: *C* *L*
configuration.html: *C* *L*
contains.html: *C* *L*
copy-if.html: *C* *L*
copy.html: *C* *L*
count-if.html: *C* *L*
count.html: *C* *L*
data-concepts.html: *C* *L*
data-miscellaneous.html: *C* *L*
data-types.html: *C* *L*
deque.html: *C* *L*
deref.html: *C* *L*
distance.html: *C* *L*
divides.html: *C* *L*
empty-base.html: *C* *L*
empty-sequence.html: *C* *L*
empty.html: *C* *L*
end.html: *C* *L*
equal-to.html: *C* *L*
equal.html: *C* *L*
erase-key.html: *C* *L*
erase.html: *C* *L*
eval-if-c.html: *C* *L*
eval-if.html: *C* *L*
extensible-associative.html: *C* *L*
extensible-sequence.html: *C* *L*
filter-view.html: *C* *L*
find-if.html: *C* *L*
find.html: *C* *L*
fold.html: *C* *L*
forward-iterator.html: *C* *L*
forward-sequence.html: *C* *L*
front-extensible-sequence.html: *C* *L*
front-inserter.html: *C* *L*
front.html: *C* *L*
greater-equal.html: *C* *L*
greater.html: *C* *L*
has-key.html: *C* *L*
has-xxx-trait-def.html: *C* *L*
has-xxx-trait-named-def.html: *C* *L*
identity.html: *C* *L*
if-c.html: *C* *L*
if.html: *C* *L*
inherit-linearly.html: *C* *L*
inherit.html: *C* *L*
insert-range.html: *C* *L*
insert.html: *C* *L*
inserter.html: *C* *L*
inserters-inserter.html: *C* *L*
inserters.html: *C* *L*
int.html: *C* *L*
integral-c.html: *C* *L*
integral-constant.html: *C* *L*
integral-sequence-wrapper.html: *C* *L*
intrinsic-metafunctions.html: *C* *L*
introspection.html: *C* *L*
invocation.html: *C* *L*
is-sequence.html: *C* *L*
iter-fold.html: *C* *L*
iteration-algorithms.html: *C* *L*
iterator-category.html: *C* *L*
iterator-metafunctions.html: *C* *L*
iterator-range.html: *C* *L*
iterators-concepts.html: *C* *L*
iterators.html: *C* *L*
joint-view.html: *C* *L*
key-type.html: *C* *L*
lambda-expression.html: *C* *L*
lambda.html: *C* *L*
less-equal.html: *C* *L*
less.html: *C* *L*
limit-list-size.html: *C* *L*
limit-map-size.html: *C* *L*
limit-metafunction-arity.html: *C* *L*
limit-set-size.html: *C* *L*
limit-unrolling.html: *C* *L*
limit-vector-size.html: *C* *L*
list-c.html: *C* *L*
list.html: *C* *L*
logical-operations.html: *C* *L*
long.html: *C* *L*
lower-bound.html: *C* *L*
macros.html: *C* *L*
map.html: *C* *L*
max-element.html: *C* *L*
max.html: *C* *L*
metafunction-class.html: *C* *L*
metafunction.html: *C* *L*
metafunctions-concepts.html: *C* *L*
metafunctions.html: *C* *L*
min-element.html: *C* *L*
min.html: *C* *L*
minus.html: *C* *L*
miscellaneous.html: *C* *L*
modulus.html: *C* *L*
negate.html: *C* *L*
next.html: *C* *L*
not-equal-to.html: *C* *L*
not.html: *C* *L*
numeric-cast.html: *C* *L*
numeric-metafunction.html: *C* *L*
numeric.html: *C* *L*
or.html: *C* *L*
order.html: *C* *L*
pair.html: *C* *L*
partition.html: *C* *L*
placeholder-expression.html: *C* *L*
placeholders.html: *C* *L*
plus.html: *C* *L*
pop-back.html: *C* *L*
pop-front.html: *C* *L*
prior.html: *C* *L*
protect.html: *C* *L*
push-back.html: *C* *L*
push-front.html: *C* *L*
querying-algorithms.html: *C* *L*
quote.html: *C* *L*
random-access-iterator.html: *C* *L*
random-access-sequence.html: *C* *L*
range-c.html: *C* *L*
refmanual_toc.html: *C* *L*
remove-if.html: *C* *L*
remove.html: *C* *L*
replace-if.html: *C* *L*
replace.html: *C* *L*
reverse-copy-if.html: *C* *L*
reverse-copy.html: *C* *L*
reverse-fold.html: *C* *L*
reverse-iter-fold.html: *C* *L*
reverse-partition.html: *C* *L*
reverse-remove-if.html: *C* *L*
reverse-remove.html: *C* *L*
reverse-replace-if.html: *C* *L*
reverse-replace.html: *C* *L*
reverse-stable-partition.html: *C* *L*
reverse-transform.html: *C* *L*
reverse-unique.html: *C* *L*
reverse.html: *C* *L*
reversible-algorithm.html: *C* *L*
sequence-tag.html: *C* *L*
sequences.html: *C* *L*
set-c.html: *C* *L*
set.html: *C* *L*
shift-left.html: *C* *L*
shift-right.html: *C* *L*
single-view.html: *C* *L*
size-t.html: *C* *L*
size.html: *C* *L*
sizeof.html: *C* *L*
sort.html: *C* *L*
stable-partition.html: *C* *L*
tag-dispatched.html: *C* *L*
terminology.html: *C* *L*
times.html: *C* *L*
transform-view.html: *C* *L*
transform.html: *C* *L*
transformation-algorithms.html: *C* *L*
trivial-metafunction.html: *C* *L*
trivial-metafunctions.html: *C* *L*
trivial.html: *C* *L*
type-selection.html: *C* *L*
unique.html: *C* *L*
unpack-args.html: *C* *L*
upper-bound.html: *C* *L*
value-type.html: *C* *L*
variadic-sequence.html: *C* *L*
vector-c.html: *C* *L*
vector.html: *C* *L*
views.html: *C* *L*
void.html: *C* *L*
zip-view.html: *C* *L*
libs/mpl/doc/src/refmanual/
ASSERT.rst: *C* *L*
ASSERT_MSG.rst: *C* *L*
ASSERT_NOT.rst: *C* *L*
ASSERT_RELATION.rst: *C* *L*
AUX_LAMBDA_SUPPORT.rst: *C* *L*
Acknowledgements.rst: *C* *L*
Algorithms-Iteration.rst: *C* *L*
Algorithms-Querying.rst: *C* *L*
Algorithms-Transformation.rst: *C* *L*
Algorithms.rst: *C* *L*
AssociativeSequence.rst: *C* *L*
BackExtensibleSequence.rst: *C* *L*
BidirectionalIterator.rst: *C* *L*
BidirectionalSequence.rst: *C* *L*
CFG_NO_HAS_XXX.rst: *C* *L*
CFG_NO_PREPROCESSED.rst: *C* *L*
Categorized.rst: *C* *L*
Data.rst: *C* *L*
ExtensibleAssociativeSeq.rst: *C* *L*
ExtensibleSequence.rst: *C* *L*
ForwardIterator.rst: *C* *L*
ForwardSequence.rst: *C* *L*
FrontExtensibleSequence.rst: *C* *L*
HAS_XXX_TRAIT_DEF.rst: *C* *L*
HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L*
Inserter.rst: *C* *L*
IntegralConstant.rst: *C* *L*
IntegralSequenceWrapper.rst: *C* *L*
Iterators-Concepts.rst: *C* *L*
Iterators-Metafunctions.rst: *C* *L*
Iterators.rst: *C* *L*
LIMIT_LIST_SIZE.rst: *C* *L*
LIMIT_MAP_SIZE.rst: *C* *L*
LIMIT_METAFUNCTION_ARITY.rst: *C* *L*
LIMIT_SET_SIZE.rst: *C* *L*
LIMIT_UNROLLING.rst: *C* *L*
LIMIT_VECTOR_SIZE.rst: *C* *L*
LambdaExpression.rst: *C* *L*
Macros-Asserts.rst: *C* *L*
Macros-Configuration.rst: *C* *L*
Macros.rst: *C* *L*
Metafunction.rst: *C* *L*
MetafunctionClass.rst: *C* *L*
Metafunctions-Arithmetic.rst: *C* *L*
Metafunctions-Bitwise.rst: *C* *L*
Metafunctions-Comparisons.rst: *C* *L*
Metafunctions-Composition.rst: *C* *L*
Metafunctions-Conditional.rst: *C* *L*
Metafunctions-Invocation.rst: *C* *L*
Metafunctions-Logical.rst: *C* *L*
Metafunctions-Trivial.rst: *C* *L*
Metafunctions-Type.rst: *C* *L*
Metafunctions.rst: *C* *L*
NumericMetafunction.rst: *C* *L*
PlaceholderExpression.rst: *C* *L*
Placeholders.rst: *C* *L*
RandomAccessIterator.rst: *C* *L*
RandomAccessSequence.rst: *C* *L*
ReversibleAlgorithm.rst: *C* *L*
Sequences-Classes.rst: *C* *L*
Sequences-Concepts.rst: *C* *L*
Sequences-Intrinsic.rst: *C* *L*
Sequences-Views.rst: *C* *L*
Sequences.rst: *C* *L*
TagDispatchedMetafunction.rst: *C* *L*
TrivialMetafunction.rst: *C* *L*
VariadicSequence.rst: *C* *L*
accumulate.rst: *C* *L*
advance.rst: *C* *L*
always.rst: *C* *L*
and_.rst: *C* *L*
apply.rst: *C* *L*
apply_wrap.rst: *C* *L*
arg.rst: *C* *L*
at.rst: *C* *L*
at_c.rst: *C* *L*
back.rst: *C* *L*
back_inserter.rst: *C* *L*
begin.rst: *C* *L*
bind.rst: *C* *L*
bitand_.rst: *C* *L*
bitor_.rst: *C* *L*
bitxor_.rst: *C* *L*
bool_.rst: *C* *L*
clear.rst: *C* *L*
contains.rst: *C* *L*
copy.rst: *C* *L*
copy_if.rst: *C* *L*
count.rst: *C* *L*
count_if.rst: *C* *L*
deque.rst: *C* *L*
deref.rst: *C* *L*
distance.rst: *C* *L*
divides.rst: *C* *L*
empty.rst: *C* *L*
empty_base.rst: *C* *L*
empty_sequence.rst: *C* *L*
end.rst: *C* *L*
equal.rst: *C* *L*
equal_to.rst: *C* *L*
erase.rst: *C* *L*
erase_key.rst: *C* *L*
eval_if.rst: *C* *L*
eval_if_c.rst: *C* *L*
filter_view.rst: *C* *L*
find.rst: *C* *L*
find_if.rst: *C* *L*
fold.rst: *C* *L*
front.rst: *C* *L*
front_inserter.rst: *C* *L*
greater.rst: *C* *L*
greater_equal.rst: *C* *L*
has_key.rst: *C* *L*
identity.rst: *C* *L*
if_.rst: *C* *L*
if_c.rst: *C* *L*
inherit.rst: *C* *L*
inherit_linearly.rst: *C* *L*
insert.rst: *C* *L*
insert_range.rst: *C* *L*
inserter_.rst: *C* *L*
int_.rst: *C* *L*
integral_c.rst: *C* *L*
is_sequence.rst: *C* *L*
iter_fold.rst: *C* *L*
iter_fold_if.rst: *C* *L*
iterator_category.rst: *C* *L*
iterator_range.rst: *C* *L*
joint_view.rst: *C* *L*
key_type.rst: *C* *L*
lambda.rst: *C* *L*
less.rst: *C* *L*
less_equal.rst: *C* *L*
list.rst: *C* *L*
list_c.rst: *C* *L*
long_.rst: *C* *L*
lower_bound.rst: *C* *L*
map.rst: *C* *L*
max.rst: *C* *L*
max_element.rst: *C* *L*
min.rst: *C* *L*
min_element.rst: *C* *L*
minus.rst: *C* *L*
modulus.rst: *C* *L*
multiplies.rst: *C* *L*
negate.rst: *C* *L*
next.rst: *C* *L*
not_.rst: *C* *L*
not_equal_to.rst: *C* *L*
numeric_cast.rst: *C* *L*
or_.rst: *C* *L*
order.rst: *C* *L*
pair.rst: *C* *L*
partition.rst: *C* *L*
plus.rst: *C* *L*
pop_back.rst: *C* *L*
pop_front.rst: *C* *L*
preface.rst: *C* *L*
prior.rst: *C* *L*
protect.rst: *C* *L*
push_back.rst: *C* *L*
push_front.rst: *C* *L*
quote.rst: *C* *L*
range_c.rst: *C* *L*
refmanual.py: *C* *L*
remove.rst: *C* *L*
remove_if.rst: *C* *L*
replace.rst: *C* *L*
replace_if.rst: *C* *L*
reverse.rst: *C* *L*
reverse_copy.rst: *C* *L*
reverse_copy_if.rst: *C* *L*
reverse_fold.rst: *C* *L*
reverse_iter_fold.rst: *C* *L*
reverse_partition.rst: *C* *L*
reverse_remove.rst: *C* *L*
reverse_remove_if.rst: *C* *L*
reverse_replace.rst: *C* *L*
reverse_replace_if.rst: *C* *L*
reverse_stable_partition.rst: *C* *L*
reverse_transform.rst: *C* *L*
reverse_unique.rst: *C* *L*
sequence_tag.rst: *C* *L*
set.rst: *C* *L*
set_c.rst: *C* *L*
shift_left.rst: *C* *L*
shift_right.rst: *C* *L*
single_view.rst: *C* *L*
size.rst: *C* *L*
size_t.rst: *C* *L*
sizeof_.rst: *C* *L*
sort.rst: *C* *L*
stable_partition.rst: *C* *L*
terminology.rst: *C* *L*
times.rst: *C* *L*
transform.rst: *C* *L*
transform_view.rst: *C* *L*
unique.rst: *C* *L*
unpack_args.rst: *C* *L*
upper_bound.rst: *C* *L*
value_type.rst: *C* *L*
vector.rst: *C* *L*
vector_c.rst: *C* *L*
void_.rst: *C* *L*
zip_view.rst: *C* *L*
libs/mpl/doc/
style.css: *L*
libs/mpl/doc/tutorial/
acknowledgements.html: *C* *L*
apply-lambda-semantics.html: *C* *L*
broken-integral-constant.html: *C* *L*
changelog-history.html: *C* *L*
changes-in-boost-1-32-0.html: *C* *L*
dependencies.html: *C* *L*
details.html: *C* *L*
dimensional-analysis.html: *C* *L*
eti.html: *C* *L*
exercises.html: *C* *L*
handling-placeholders.html: *C* *L*
higher-order.html: *C* *L*
implementing-addition-and.html: *C* *L*
implementing-division.html: *C* *L*
implementing.html: *C* *L*
incomplete-support-for.html: *C* *L*
iterator-protocol.html: *C* *L*
lambda-and-non.html: *C* *L*
lambda-details.html: *C* *L*
metafunction-composition.html: *C* *L*
miscellaneous.html: *C* *L*
more-lambda-capabilities.html: *C* *L*
numeric-metafunction.html: *C* *L*
partial-metafunction.html: *C* *L*
physical-structure.html: *C* *L*
placeholder-expression.html: *C* *L*
placeholders.html: *C* *L*
portability.html: *C* *L*
reference-manual.html: *C* *L*
renaming-cleanup.html: *C* *L*
representing-dimensions.html: *C* *L*
representing-quantities.html: *C* *L*
resources.html: *C* *L*
tag-dispatching-protocol.html: *C* *L*
technical-details.html: *C* *L*
the-apply-metafunction.html: *C* *L*
the-importance-of-being.html: *C* *L*
the-lambda-metafunction.html: *C* *L*
tutorial-metafunctions.html: *L*
tutorial_toc.html: *C* *L*
libs/mpl/example/
Jamfile: *C* *L*
libs/mpl/example/fsm/
README.txt: *C* *L*
libs/mpl/test/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
libs/mpl/test/aux_/
Jamfile: *C* *L*
|multi_array|
libs/multi_array/doc/
iterator_categories.html: *C* *L*
reference.html: *L*
libs/multi_array/doc/xml/
MultiArray.xml: *C* *L*
const_multi_array_ref.xml: *C* *L*
multi_array.xml: *C* *L*
multi_array_ref.xml: *C* *L*
reference.xml: *L*
libs/multi_array/test/
Jamfile: *L*
Jamfile.v2: *L*
|numeric|
boost/numeric/ublas/
banded.hpp: *L*
blas.hpp: *L*
boost/numeric/ublas/detail/
concepts.hpp: *L*
config.hpp: *L*
definitions.hpp: *L*
documentation.hpp: *L*
duff.hpp: *L*
iterator.hpp: *L*
matrix_assign.hpp: *L*
raw.hpp: *L*
temporary.hpp: *L*
vector_assign.hpp: *L*
boost/numeric/ublas/
exception.hpp: *L*
expression_types.hpp: *L*
functional.hpp: *L*
fwd.hpp: *L*
hermitian.hpp: *L*
io.hpp: *L*
lu.hpp: *L*
matrix.hpp: *L*
matrix_expression.hpp: *L*
matrix_proxy.hpp: *L*
matrix_sparse.hpp: *L*
operation.hpp: *L*
operation_blocked.hpp: *L*
operation_sparse.hpp: *L*
storage.hpp: *L*
storage_sparse.hpp: *L*
symmetric.hpp: *L*
traits.hpp: *L*
triangular.hpp: *L*
vector.hpp: *L*
vector_expression.hpp: *L*
vector_of_vector.hpp: *L*
vector_proxy.hpp: *L*
vector_sparse.hpp: *L*
libs/numeric/conversion/test/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
test_helpers.cpp: *C*
test_helpers2.cpp: *C*
test_helpers3.cpp: *C*
traits_test.cpp: *C*
udt_example_0.cpp: *C*
udt_support_test.cpp: *C*
libs/numeric/ublas/bench1/
Jamfile: *L*
bench1.cpp: *L*
bench1.hpp: *L*
bench11.cpp: *L*
bench12.cpp: *L*
bench13.cpp: *L*
libs/numeric/ublas/bench2/
Jamfile: *L*
bench2.cpp: *L*
bench2.hpp: *L*
bench21.cpp: *L*
bench22.cpp: *L*
bench23.cpp: *L*
libs/numeric/ublas/bench3/
Jamfile: *L*
bench3.cpp: *L*
bench3.hpp: *L*
bench31.cpp: *L*
bench32.cpp: *L*
bench33.cpp: *L*
libs/numeric/ublas/bench4/
Jamfile: *L*
bench4.cpp: *L*
bench41.cpp: *L*
bench42.cpp: *L*
bench43.cpp: *L*
libs/numeric/ublas/doc/
Release_notes.txt: *C* *L*
banded.htm: *L*
blas.htm: *L*
bounded_array.htm: *C* *L*
container_concept.htm: *L*
doxygen.css: *C* *L*
expression_concept.htm: *L*
hermitian.htm: *L*
index.htm: *L*
iterator_concept.htm: *L*
matrix.htm: *L*
matrix_expression.htm: *L*
matrix_proxy.htm: *L*
matrix_sparse.htm: *L*
operations_overview.htm: *L*
overview.htm: *L*
products.htm: *L*
range.htm: *C* *L*
libs/numeric/ublas/doc/samples/
Jamfile: *L*
banded_adaptor.cpp: *L*
banded_matrix.cpp: *L*
bounded_array.cpp: *L*
compressed_matrix.cpp: *L*
compressed_vector.cpp: *L*
coordinate_matrix.cpp: *L*
coordinate_vector.cpp: *L*
hermitian_adaptor.cpp: *L*
hermitian_matrix.cpp: *L*
identity_matrix.cpp: *L*
map_array.cpp: *L*
mapped_matrix.cpp: *L*
mapped_vector.cpp: *L*
matrix.cpp: *L*
matrix_binary.cpp: *L*
matrix_binary_scalar.cpp: *L*
matrix_column.cpp: *L*
matrix_column_project.cpp: *L*
matrix_matrix_binary.cpp: *L*
matrix_matrix_solve.cpp: *L*
matrix_range.cpp: *L*
matrix_range_project.cpp: *L*
matrix_row.cpp: *L*
matrix_row_project.cpp: *L*
matrix_slice.cpp: *L*
matrix_slice_project.cpp: *L*
matrix_unary.cpp: *L*
matrix_vector_binary.cpp: *L*
matrix_vector_range.cpp: *L*
matrix_vector_slice.cpp: *L*
matrix_vector_solve.cpp: *L*
range.cpp: *L*
slice.cpp: *L*
symmetric_adaptor.cpp: *L*
symmetric_matrix.cpp: *L*
triangular_adaptor.cpp: *L*
triangular_matrix.cpp: *L*
unbounded_array.cpp: *L*
unit_vector.cpp: *L*
vector.cpp: *L*
vector_binary.cpp: *L*
vector_binary_outer.cpp: *L*
vector_binary_redux.cpp: *L*
vector_binary_scalar.cpp: *L*
vector_range.cpp: *L*
vector_range_project.cpp: *L*
vector_slice.cpp: *L*
vector_slice_project.cpp: *L*
vector_unary.cpp: *L*
vector_unary_redux.cpp: *L*
zero_matrix.cpp: *L*
zero_vector.cpp: *L*
libs/numeric/ublas/doc/
storage_concept.htm: *L*
storage_sparse.htm: *L*
symmetric.htm: *L*
triangular.htm: *L*
types_overview.htm: *L*
ublas.css: *C* *L*
unbounded_array.htm: *L*
vector.htm: *L*
vector_expression.htm: *L*
vector_proxy.htm: *L*
vector_sparse.htm: *L*
libs/numeric/ublas/test/
Jamfile: *L*
README: *C* *L*
concepts.cpp: *L*
test1.cpp: *L*
test1.hpp: *L*
test11.cpp: *L*
test12.cpp: *L*
test13.cpp: *L*
test2.cpp: *L*
test2.hpp: *L*
test21.cpp: *L*
test22.cpp: *L*
test23.cpp: *L*
test3.cpp: *L*
test3.hpp: *L*
test31.cpp: *L*
test32.cpp: *L*
test33.cpp: *L*
test4.cpp: *L*
test4.hpp: *L*
test42.cpp: *L*
test43.cpp: *L*
test5.cpp: *L*
test5.hpp: *L*
test52.cpp: *L*
test53.cpp: *L*
test6.cpp: *L*
test6.hpp: *L*
test62.cpp: *L*
test63.cpp: *L*
test7.cpp: *L*
test7.hpp: *L*
test71.cpp: *L*
test72.cpp: *L*
test73.cpp: *L*
|optional|
libs/optional/test/
Jamfile.v2: *L*
|people|
people/
paul_moore.htm: *C* *L*
vesa_karvonen.htm: *C* *L*
|program_options|
boost/program_options/detail/
utf8_codecvt_facet.hpp: *L*
libs/program_options/build/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
libs/program_options/doc/
Jamfile.v2: *C* *L*
acknowledgements.xml: *C* *L*
changes.xml: *C* *L*
design.xml: *C* *L*
glossary.xml: *C* *L*
howto.xml: *C* *L*
overview.xml: *C* *L*
post_review_plan.txt: *C* *L*
todo.txt: *C* *L*
tutorial.xml: *C* *L*
libs/program_options/example/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
libs/program_options/test/
Jamfile: *C* *L*
Jamfile.v2: *C* *L*
program_options_size_test.py: *C* *L*
ucs2.txt: *C* *L*
utf8.txt: *C* *L*
winmain.py: *C* *L*
|property_map|
libs/property_map/
LvaluePropertyMap.html: *L*
ReadWritePropertyMap.html: *L*
ReadablePropertyMap.html: *L*
WritablePropertyMap.html: *L*
associative_property_map.html: *L*
const_assoc_property_map.html: *L*
libs/property_map/doc/
dynamic_property_map.html: *C* *L*
dynamic_property_map.rst: *C* *L*
libs/property_map/
example2.cpp: *L*
identity_property_map.html: *L*
iterator_property_map.html: *L*
property_map.html: *L*
vector_property_map.html: *L*
|property_tree|
boost/property_tree/detail/
pugxml.hpp: *L*
libs/property_tree/examples/
debug_settings.xml: *C* *L*
libs/property_tree/
index.html: *C* *L*
libs/property_tree/test/
Jamfile.v2: *C* *L*
libs/property_tree/test/custom-build/
Makefile: *C* *L*
debug_settings.xml: *C* *L*
gcc.mak: *C* *L*
icc.mak: *C* *L*
vc.mak: *C* *L*
libs/property_tree/test/
sandbox.cpp: *C* *L*
xml_parser_test_data.hpp: *L*
|ptr_container|
libs/ptr_container/doc/
Jamfile.v2: *C* *L*
associative_ptr_container.html: *L*
associative_ptr_container.rst: *L*
comp.sh: *C* *L*
comp_all.sh: *C* *L*
comp_assoc_ptr_container.sh: *C* *L*
comp_conventions.sh: *C* *L*
comp_examples.sh: *C* *L*
comp_faq.sh: *C* *L*
comp_guidelines.sh: *C* *L*
comp_headers.sh: *C* *L*
comp_indirect_fun.sh: *C* *L*
comp_ptr_array.sh: *C* *L*
comp_ptr_container.sh: *C* *L*
comp_ptr_deque.sh: *C* *L*
comp_ptr_list.sh: *C* *L*
comp_ptr_map.sh: *C* *L*
comp_ptr_map_adapter.sh: *C* *L*
comp_ptr_multimap.sh: *C* *L*
comp_ptr_multimap_adapter.sh: *C* *L*
comp_ptr_multiset.sh: *C* *L*
comp_ptr_multiset_adapter.sh: *C* *L*
comp_ptr_sequence_adapter.sh: *C* *L*
comp_ptr_set.sh: *C* *L*
comp_ptr_set_adapter.sh: *C* *L*
comp_ptr_vector.sh: *C* *L*
comp_reference.sh: *C* *L*
comp_rever_ptr_container.sh: *C* *L*
comp_tutorial.sh: *C* *L*
conventions.html: *L*
conventions.rst: *L*
default.css: *L*
examples.html: *L*
examples.rst: *L*
faq.html: *L*
faq.rst: *L*
guidelines.html: *L*
guidelines.rst: *L*
headers.html: *L*
headers.rst: *L*
indirect_fun.html: *L*
indirect_fun.rst: *L*
intro.xml: *C* *L*
ptr_array.html: *L*
ptr_array.rst: *L*
ptr_container.xml: *L*
ptr_deque.html: *L*
ptr_deque.rst: *L*
ptr_list.html: *L*
ptr_list.rst: *L*
ptr_map.html: *L*
ptr_map.rst: *L*
ptr_map_adapter.html: *L*
ptr_map_adapter.rst: *L*
ptr_multimap.html: *L*
ptr_multimap.rst: *L*
ptr_multimap_adapter.html: *L*
ptr_multimap_adapter.rst: *L*
ptr_multiset.html: *L*
ptr_multiset.rst: *L*
ptr_multiset_adapter.html: *L*
ptr_multiset_adapter.rst: *L*
ptr_sequence_adapter.html: *L*
ptr_sequence_adapter.rst: *L*
ptr_set.html: *L*
ptr_set.rst: *L*
ptr_set_adapter.html: *L*
ptr_set_adapter.rst: *L*
ptr_vector.html: *L*
ptr_vector.rst: *L*
reference.html: *L*
reference.rst: *L*
reversible_ptr_container.html: *L*
reversible_ptr_container.rst: *L*
todo.txt: *C* *L*
tutorial.html: *L*
tutorial.rst: *L*
libs/ptr_container/test/
Jamfile.v2: *C* *L*
sequence_point.cpp: *C* *L*
|python|
libs/python/doc/
internals.html: *L*
internals.rst: *L*
libs/python/doc/tutorial/doc/html/python/
embedding.html: *L*
exception.html: *L*
exposing.html: *L*
functions.html: *L*
hello.html: *L*
iterators.html: *L*
object.html: *L*
techniques.html: *L*
libs/python/test/
operators_wrapper.cpp: *C* *L*
operators_wrapper.py: *C* *L*
|quickbook|
tools/quickbook/doc/
Jamfile.v2: *C* *L*
tools/quickbook/doc/html/quickbook/
change_log.html: *L*
editors.html: *L*
tools/quickbook/doc/html/quickbook/editors/
scite.html: *L*
tools/quickbook/doc/html/quickbook/
faq.html: *L*
install.html: *L*
tools/quickbook/doc/html/quickbook/install/
linux.html: *L*
windows.html: *L*
tools/quickbook/doc/html/quickbook/
intro.html: *L*
ref.html: *L*
syntax.html: *L*
tools/quickbook/doc/html/quickbook/syntax/
block.html: *L*
comments.html: *L*
phrase.html: *L*
tools/quickbook/
index.html: *C* *L*
tools/quickbook/test/
stub.xml: *C* *L*
|range|
libs/range/doc/
boost_range.html: *L*
example.cpp: *C* *L*
examples.html: *L*
faq.html: *L*
headers.html: *L*
history_ack.html: *L*
intro.html: *L*
portability.html: *L*
range.html: *L*
style.css: *C* *L*
style.html: *L*
utility_class.html: *L*
libs/range/test/
TODO: *C* *L*
compat1.cpp: *C* *L*
|rational|
boost/
rational.hpp: *L*
libs/rational/
index.html: *L*
rational.html: *L*
rational_example.cpp: *L*
rational_test.cpp: *L*
|regex|
libs/regex/build/
gcc-shared.mak: *C* *L*
libs/regex/example/timer/
input_script.txt: *C* *L*
|regression|
tools/regression/build/
Jamfile.v2: *C* *L*
tools/regression/detail/
tiny_xml_test.txt: *C* *L*
tools/regression/
index.htm: *C* *L*
run_tests.sh: *C* *L*
tools/regression/test/
Jamfile.v2: *C* *L*
tools/regression/test/test-boost-build/ignored_rc/
ignored_rc.jam: *C* *L*
recognized_rc.jam: *C* *L*
tools/regression/test/test-boost-build/missing_dependencies/
Jamfile.v2: *C* *L*
tools/regression/test/test-boost-build/missing_dependencies/lib/
Jamfile.v2: *C* *L*
lib.cpp: *C* *L*
tools/regression/test/test-boost-build/missing_dependencies/
test.cpp: *C* *L*
tools/regression/test/test-cases/Huber2629/expected/
results.xml: *C* *L*
tools/regression/test/test-cases/general/expected/
results.xml: *C* *L*
tools/regression/test/test-cases/incremental/expected/
results.xml: *C* *L*
tools/regression/test/
test.bat: *C* *L*
tools/regression/xsl_reports/
boostbook_report.py: *C* *L*
empty_expected_results.xml: *C* *L*
tools/regression/xsl_reports/runner/
__init__.py: *C* *L*
default.css: *L*
instructions.html: *L*
instructions.rst: *C* *L*
tools/regression/xsl_reports/test/
common.py: *C* *L*
expected_results.xml: *C* *L*
generate_test_results.py: *C* *L*
generate_test_results_v1.py: *C* *L*
restrict_to_library.xsl: *C* *L*
run_notes_regression.py: *C* *L*
run_v1.py: *C* *L*
test.py: *C* *L*
test_boost_wide_report.py: *C* *L*
tools/regression/xsl_reports/
test_results.xsd: *C* *L*
tools/regression/xsl_reports/utils/
__init__.py: *C* *L*
accept_args.py: *C* *L*
char_translation_table.py: *C* *L*
check_existance.py: *C* *L*
checked_system.py: *C* *L*
log.py: *C* *L*
makedirs.py: *C* *L*
send_mail.py: *C* *L*
sourceforge.py: *C* *L*
tar.py: *C* *L*
zip.py: *C* *L*
tools/regression/xsl_reports/xsl/v2/
expected_to_1_33_format.xsl: *C* *L*
|release|
tools/release/
utils.py: *C* *L*
|serialization|
libs/serialization/doc/
style.css: *C* *L*
libs/serialization/example/
demo_output.txt: *C* *L*
demo_save.xml: *C* *L*
demofile.txt: *C* *L*
libs/serialization/test/
run_archive_test.bat: *C* *L*
runtest.bat: *C* *L*
runtest.sh: *C* *L*
libs/serialization/vc7ide/
readme.txt: *C* *L*
|signals|
libs/signals/doc/
Jamfile.v2: *C* *L*
design.xml: *C* *L*
faq.xml: *C* *L*
introduction.xml: *C* *L*
rationale.xml: *C* *L*
libs/signals/doc/reference/
connection.xml: *C* *L*
last_value.xml: *C* *L*
reference.xml: *C* *L*
signal_header.xml: *C* *L*
slot.xml: *C* *L*
trackable.xml: *C* *L*
visit_each.xml: *C* *L*
libs/signals/doc/
tests.xml: *C* *L*
tutorial.xml: *C* *L*
|smart_ptr|
libs/smart_ptr/
compatibility.htm: *L*
scoped_array.htm: *L*
scoped_ptr.htm: *L*
shared_array.htm: *L*
shared_ptr.htm: *L*
smart_ptr.htm: *L*
smarttests.htm: *L*
weak_ptr.htm: *L*
|test|
boost/test/included/
unit_test_framework.hpp: *C* *L*
boost/test/utils/runtime/cla/detail/
argument_value_usage.hpp: *L*
libs/test/test/auto-link-test/
run_bjam.bat: *C* *L*
|timer|
libs/timer/
timer.htm: *L*
|tr1|
boost/tr1/
tuple.hpp: *C* *L*
|tuple|
libs/tuple/doc/
design_decisions_rationale.html: *L*
tuple_advanced_interface.html: *L*
tuple_users_guide.html: *L*
libs/tuple/test/
Jamfile: *C* *L*
README: *C* *L*
|utility|
boost/
shared_container_iterator.hpp: *L*
boost/utility/
value_init.hpp: *C*
libs/utility/
OptionalPointee.html: *L*
call_traits.htm: *L*
compressed_pair.htm: *L*
enable_if.html: *L*
libs/utility/test/
Jamfile: *L*
Jamfile.v2: *L*
libs/utility/
utility.htm: *L*
value_init.htm: *L*
value_init_test.cpp: *C*
value_init_test_fail1.cpp: *C*
value_init_test_fail2.cpp: *C*
value_init_test_fail3.cpp: *C*
|variant|
libs/variant/doc/
Jamfile.v2: *C* *L*
biblio.xml: *C* *L*
design.xml: *C* *L*
introduction.xml: *C* *L*
misc.xml: *C* *L*
libs/variant/doc/reference/
apply_visitor.xml: *C* *L*
bad_visit.xml: *C* *L*
concepts.xml: *C* *L*
get.xml: *C* *L*
recursive_variant.xml: *C* *L*
recursive_wrapper.xml: *C* *L*
reference.xml: *C* *L*
static_visitor.xml: *C* *L*
variant.xml: *C* *L*
variant_fwd.xml: *C* *L*
visitor_ptr.xml: *C* *L*
libs/variant/doc/tutorial/
advanced.xml: *C* *L*
basic.xml: *C* *L*
tutorial.xml: *C* *L*
libs/variant/doc/
variant.xml: *L*
libs/variant/
index.html: *C* *L*
libs/variant/test/
Jamfile: *L*
Jamfile.v2: *L*
|xpressive|
libs/xpressive/proto/doc/
protodoc.xml: *C* *L*
1
0
Boost Inspection Report
Run Date: 16:06:12 UTC, Sunday 27 May 2007
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:
11453 files scanned
909 directories scanned (including root)
1059 problems reported
Problem counts:
661 files missing Boost license info or having wrong reference text
398 files missing copyright notice
Summary:
any (1)
archive (1)
build (68)
concept_check (22)
conversion (5)
doc (1)
filesystem (2)
function (1)
graph (1)
inspect (1)
integer (9)
lambda (10)
libs (6)
logic (2)
math (1)
more (13)
mpl (417)
multi_array (13)
numeric (188)
optional (1)
people (4)
program_options (35)
property_map (15)
ptr_container (8)
python (14)
rational (5)
regex (4)
regression (118)
release (2)
serialization (16)
signals (2)
smart_ptr (8)
test (3)
timer (1)
tr1 (2)
tuple (5)
utility (12)
variant (42)
Details:
*L* missing Boost license info, or wrong reference text
*C* missing copyright notice
|any|
libs/any/doc/
any.xml: *L*
|archive|
boost/archive/detail/
utf8_codecvt_facet.hpp: *L*
|build|
tools/build/v2/build/
build-request.jam: *L*
modifiers.jam: *L*
tools/build/v2/doc/
Jamfile.v2: *C* *L*
tools/build/v2/doc/src/
advanced.xml: *C* *L*
architecture.xml: *C* *L*
catalog.xml: *C* *L*
extending.xml: *C* *L*
faq.xml: *C* *L*
fragments.xml: *C* *L*
howto.xml: *C* *L*
install.xml: *C* *L*
recipes.xml: *C* *L*
reference.xml: *C* *L*
standalone.xml: *C* *L*
tutorial.xml: *C* *L*
userman.xml: *C* *L*
tools/build/v2/example/generate/
REAME.txt: *C* *L*
a.cpp: *C* *L*
tools/build/v2/example/generator/
README.txt: *C* *L*
soap.jam: *C* *L*
tools/build/v2/example/python_modules/
python_helpers.jam: *C* *L*
python_helpers.py: *C* *L*
tools/build/v2/test/
abs_workdir.py: *C* *L*
dependency_property.py: *L*
dependency_test.py: *C* *L*
direct_request_test.py: *C* *L*
dll_path.py: *L*
double_loading.py: *L*
duplicate.py: *L*
echo_args.jam: *C* *L*
empty.jam: *C* *L*
expansion.py: *L*
explicit.py: *L*
gcc_runtime.py: *L*
tools/build/v2/test/project-test3/lib3/
Jamfile: *C* *L*
tools/build/v2/test/
readme.txt: *C* *L*
svn_tree.py: *L*
tag.py: *L*
test_system.html: *L*
tools/build/v2/tools/
sun.jam: *L*
xsltproc.jam: *L*
|concept_check|
libs/concept_check/
bibliography.htm: *L*
concept_check.htm: *L*
concept_covering.htm: *L*
creating_concepts.htm: *L*
libs/concept_check/doc/
Jamfile.v2: *C* *L*
libs/concept_check/doc/reference/
Assignable.xml: *L*
BidirectionalIterator.xml: *L*
CopyConstructible.xml: *L*
DefaultConstructible.xml: *L*
EqualityComparable.xml: *L*
ForwardIterator.xml: *L*
InputIterator.xml: *L*
LessThanComparable.xml: *L*
OutputIterator.xml: *L*
RandomAccessIterator.xml: *L*
SignedInteger.xml: *L*
concepts.xml: *L*
libs/concept_check/
implementation.htm: *L*
prog_with_concepts.htm: *L*
reference.htm: *L*
using_concept_check.htm: *L*
|conversion|
libs/conversion/
cast.htm: *L*
index.html: *C* *L*
lexical_cast.htm: *L*
libs/conversion/test/
Jamfile.v2: *L*
|doc|
doc/html/
docutils.css: *L*
|filesystem|
libs/filesystem/doc/
tr2_proposal.html: *L*
libs/filesystem/src/
utf8_codecvt_facet.hpp: *L*
|function|
boost/function/detail/
gen_maybe_include.pl: *L*
|graph|
libs/graph/doc/
lengauer_tarjan_dominator.htm: *L*
|inspect|
tools/inspect/build/
Jamfile.v2: *L*
|integer|
libs/integer/
cstdint.htm: *C* *L*
libs/integer/doc/
integer_mask.html: *L*
static_min_max.html: *L*
libs/integer/
index.html: *C* *L*
integer.htm: *L*
integer_traits.html: *C* *L*
|lambda|
libs/lambda/doc/
Jamfile.v2: *C* *L*
libs/lambda/doc/detail/
README: *C* *L*
lambda_doc.xsl: *C* *L*
lambda_doc_chunks.xsl: *C* *L*
libs/lambda/test/
Makefile: *C* *L*
|libs|
libs/
expected_results.xml: *C* *L*
maintainers.txt: *C* *L*
platform_maintainers.txt: *C* *L*
|logic|
libs/logic/doc/
Jamfile.v2: *C* *L*
|math|
boost/math/
common_factor_rt.hpp: *L*
|more|
more/
error_handling.html: *L*
generic_exception_safety.html: *C* *L*
generic_programming.html: *L*
getting_started.rst: *C* *L*
moderators.html: *C*
regression.html: *C* *L*
report-apr-2006.html: *C* *L*
report-jan-2006.html: *C* *L*
|mpl|
libs/mpl/doc/src/refmanual/
ASSERT.rst: *C* *L*
ASSERT_MSG.rst: *C* *L*
ASSERT_NOT.rst: *C* *L*
ASSERT_RELATION.rst: *C* *L*
AUX_LAMBDA_SUPPORT.rst: *C* *L*
Acknowledgements.rst: *C* *L*
Algorithms-Iteration.rst: *C* *L*
Algorithms-Querying.rst: *C* *L*
Algorithms-Runtime.rst: *C* *L*
Algorithms-Transformation.rst: *C* *L*
Algorithms.rst: *C* *L*
AssociativeSequence.rst: *C* *L*
BackExtensibleSequence.rst: *C* *L*
BidirectionalIterator.rst: *C* *L*
BidirectionalSequence.rst: *C* *L*
CFG_NO_HAS_XXX.rst: *C* *L*
CFG_NO_PREPROCESSED.rst: *C* *L*
Categorized.rst: *C* *L*
Data.rst: *C* *L*
ExtensibleAssociativeSeq.rst: *C* *L*
ExtensibleSequence.rst: *C* *L*
ForwardIterator.rst: *C* *L*
ForwardSequence.rst: *C* *L*
FrontExtensibleSequence.rst: *C* *L*
HAS_XXX_TRAIT_DEF.rst: *C* *L*
HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L*
Inserter.rst: *C* *L*
IntegralConstant.rst: *C* *L*
IntegralSequenceWrapper.rst: *C* *L*
Iterators-Concepts.rst: *C* *L*
Iterators-Metafunctions.rst: *C* *L*
Iterators.rst: *C* *L*
LIMIT_LIST_SIZE.rst: *C* *L*
LIMIT_MAP_SIZE.rst: *C* *L*
LIMIT_METAFUNCTION_ARITY.rst: *C* *L*
LIMIT_SET_SIZE.rst: *C* *L*
LIMIT_UNROLLING.rst: *C* *L*
LIMIT_VECTOR_SIZE.rst: *C* *L*
LambdaExpression.rst: *C* *L*
Macros-Asserts.rst: *C* *L*
Macros-Configuration.rst: *C* *L*
Macros.rst: *C* *L*
Metafunction.rst: *C* *L*
MetafunctionClass.rst: *C* *L*
Metafunctions-Arithmetic.rst: *C* *L*
Metafunctions-Bitwise.rst: *C* *L*
Metafunctions-Comparisons.rst: *C* *L*
Metafunctions-Composition.rst: *C* *L*
Metafunctions-Conditional.rst: *C* *L*
Metafunctions-Invocation.rst: *C* *L*
Metafunctions-Logical.rst: *C* *L*
Metafunctions-Trivial.rst: *C* *L*
Metafunctions-Type.rst: *C* *L*
Metafunctions.rst: *C* *L*
NumericMetafunction.rst: *C* *L*
PlaceholderExpression.rst: *C* *L*
Placeholders.rst: *C* *L*
RandomAccessIterator.rst: *C* *L*
RandomAccessSequence.rst: *C* *L*
ReversibleAlgorithm.rst: *C* *L*
Sequences-Classes.rst: *C* *L*
Sequences-Concepts.rst: *C* *L*
Sequences-Intrinsic.rst: *C* *L*
Sequences-Views.rst: *C* *L*
Sequences.rst: *C* *L*
TagDispatchedMetafunction.rst: *C* *L*
TrivialMetafunction.rst: *C* *L*
VariadicSequence.rst: *C* *L*
accumulate.rst: *C* *L*
advance.rst: *C* *L*
always.rst: *C* *L*
and_.rst: *C* *L*
apply.rst: *C* *L*
apply_wrap.rst: *C* *L*
arg.rst: *C* *L*
at.rst: *C* *L*
at_c.rst: *C* *L*
back.rst: *C* *L*
back_inserter.rst: *C* *L*
begin.rst: *C* *L*
bind.rst: *C* *L*
bitand_.rst: *C* *L*
bitor_.rst: *C* *L*
bitxor_.rst: *C* *L*
bool_.rst: *C* *L*
clear.rst: *C* *L*
contains.rst: *C* *L*
copy.rst: *C* *L*
copy_if.rst: *C* *L*
count.rst: *C* *L*
count_if.rst: *C* *L*
deque.rst: *C* *L*
deref.rst: *C* *L*
distance.rst: *C* *L*
divides.rst: *C* *L*
empty.rst: *C* *L*
empty_base.rst: *C* *L*
empty_sequence.rst: *C* *L*
end.rst: *C* *L*
equal.rst: *C* *L*
equal_to.rst: *C* *L*
erase.rst: *C* *L*
erase_key.rst: *C* *L*
eval_if.rst: *C* *L*
eval_if_c.rst: *C* *L*
filter_view.rst: *C* *L*
find.rst: *C* *L*
find_if.rst: *C* *L*
fold.rst: *C* *L*
for_each.rst: *C* *L*
front.rst: *C* *L*
front_inserter.rst: *C* *L*
greater.rst: *C* *L*
greater_equal.rst: *C* *L*
has_key.rst: *C* *L*
identity.rst: *C* *L*
if_.rst: *C* *L*
if_c.rst: *C* *L*
inherit.rst: *C* *L*
inherit_linearly.rst: *C* *L*
insert.rst: *C* *L*
insert_range.rst: *C* *L*
inserter_.rst: *C* *L*
int_.rst: *C* *L*
integral_c.rst: *C* *L*
is_sequence.rst: *C* *L*
iter_fold.rst: *C* *L*
iter_fold_if.rst: *C* *L*
iterator_category.rst: *C* *L*
iterator_range.rst: *C* *L*
joint_view.rst: *C* *L*
key_type.rst: *C* *L*
lambda.rst: *C* *L*
less.rst: *C* *L*
less_equal.rst: *C* *L*
list.rst: *C* *L*
list_c.rst: *C* *L*
long_.rst: *C* *L*
lower_bound.rst: *C* *L*
map.rst: *C* *L*
max.rst: *C* *L*
max_element.rst: *C* *L*
min.rst: *C* *L*
min_element.rst: *C* *L*
minus.rst: *C* *L*
modulus.rst: *C* *L*
multiplies.rst: *C* *L*
negate.rst: *C* *L*
next.rst: *C* *L*
not_.rst: *C* *L*
not_equal_to.rst: *C* *L*
numeric_cast.rst: *C* *L*
or_.rst: *C* *L*
order.rst: *C* *L*
pair.rst: *C* *L*
partition.rst: *C* *L*
plus.rst: *C* *L*
pop_back.rst: *C* *L*
pop_front.rst: *C* *L*
preface.rst: *C* *L*
prior.rst: *C* *L*
protect.rst: *C* *L*
push_back.rst: *C* *L*
push_front.rst: *C* *L*
quote.rst: *C* *L*
range_c.rst: *C* *L*
remove.rst: *C* *L*
remove_if.rst: *C* *L*
replace.rst: *C* *L*
replace_if.rst: *C* *L*
reverse.rst: *C* *L*
reverse_copy.rst: *C* *L*
reverse_copy_if.rst: *C* *L*
reverse_fold.rst: *C* *L*
reverse_iter_fold.rst: *C* *L*
reverse_partition.rst: *C* *L*
reverse_remove.rst: *C* *L*
reverse_remove_if.rst: *C* *L*
reverse_replace.rst: *C* *L*
reverse_replace_if.rst: *C* *L*
reverse_stable_partition.rst: *C* *L*
reverse_transform.rst: *C* *L*
reverse_unique.rst: *C* *L*
sequence_tag.rst: *C* *L*
set.rst: *C* *L*
set_c.rst: *C* *L*
shift_left.rst: *C* *L*
shift_right.rst: *C* *L*
single_view.rst: *C* *L*
size.rst: *C* *L*
size_t.rst: *C* *L*
sizeof_.rst: *C* *L*
sort.rst: *C* *L*
stable_partition.rst: *C* *L*
terminology.rst: *C* *L*
times.rst: *C* *L*
transform.rst: *C* *L*
transform_view.rst: *C* *L*
unique.rst: *C* *L*
unpack_args.rst: *C* *L*
upper_bound.rst: *C* *L*
value_type.rst: *C* *L*
vector.rst: *C* *L*
vector_c.rst: *C* *L*
void_.rst: *C* *L*
zip_view.rst: *C* *L*
libs/mpl/doc/
style.css: *L*
libs/mpl/example/fsm/
README.txt: *C* *L*
libs/mpl/test/
Jamfile.v2: *C* *L*
|multi_array|
libs/multi_array/doc/
iterator_categories.html: *C* *L*
reference.html: *L*
libs/multi_array/doc/xml/
MultiArray.xml: *C* *L*
const_multi_array_ref.xml: *C* *L*
multi_array.xml: *C* *L*
multi_array_ref.xml: *C* *L*
reference.xml: *L*
libs/multi_array/test/
Jamfile.v2: *L*
|numeric|
boost/numeric/ublas/
banded.hpp: *L*
blas.hpp: *L*
boost/numeric/ublas/detail/
concepts.hpp: *L*
config.hpp: *L*
definitions.hpp: *L*
documentation.hpp: *L*
duff.hpp: *L*
iterator.hpp: *L*
matrix_assign.hpp: *L*
raw.hpp: *L*
temporary.hpp: *L*
vector_assign.hpp: *L*
boost/numeric/ublas/
exception.hpp: *L*
expression_types.hpp: *L*
functional.hpp: *L*
fwd.hpp: *L*
hermitian.hpp: *L*
io.hpp: *L*
lu.hpp: *L*
matrix.hpp: *L*
matrix_expression.hpp: *L*
matrix_proxy.hpp: *L*
matrix_sparse.hpp: *L*
operation.hpp: *L*
operation_blocked.hpp: *L*
operation_sparse.hpp: *L*
storage.hpp: *L*
storage_sparse.hpp: *L*
symmetric.hpp: *L*
traits.hpp: *L*
triangular.hpp: *L*
vector.hpp: *L*
vector_expression.hpp: *L*
vector_of_vector.hpp: *L*
vector_proxy.hpp: *L*
vector_sparse.hpp: *L*
libs/numeric/conversion/test/
Jamfile.v2: *C* *L*
test_helpers.cpp: *C*
test_helpers2.cpp: *C*
test_helpers3.cpp: *C*
traits_test.cpp: *C*
udt_example_0.cpp: *C*
udt_support_test.cpp: *C*
libs/numeric/ublas/bench1/
bench1.cpp: *L*
bench1.hpp: *L*
bench11.cpp: *L*
bench12.cpp: *L*
bench13.cpp: *L*
libs/numeric/ublas/bench2/
bench2.cpp: *L*
bench2.hpp: *L*
bench21.cpp: *L*
bench22.cpp: *L*
bench23.cpp: *L*
libs/numeric/ublas/bench3/
bench3.cpp: *L*
bench3.hpp: *L*
bench31.cpp: *L*
bench32.cpp: *L*
bench33.cpp: *L*
libs/numeric/ublas/bench4/
bench4.cpp: *L*
bench41.cpp: *L*
bench42.cpp: *L*
bench43.cpp: *L*
libs/numeric/ublas/doc/
Release_notes.txt: *C* *L*
array_adaptor.htm: *C* *L*
banded.htm: *L*
blas.htm: *L*
bounded_array.htm: *C* *L*
container_concept.htm: *L*
doxygen.css: *C* *L*
expression_concept.htm: *L*
hermitian.htm: *L*
index.htm: *L*
iterator_concept.htm: *L*
matrix.htm: *L*
matrix_expression.htm: *L*
matrix_proxy.htm: *L*
matrix_sparse.htm: *L*
operations_overview.htm: *L*
overview.htm: *L*
products.htm: *L*
range.htm: *C* *L*
libs/numeric/ublas/doc/samples/
banded_adaptor.cpp: *L*
banded_matrix.cpp: *L*
bounded_array.cpp: *L*
compressed_matrix.cpp: *L*
compressed_vector.cpp: *L*
coordinate_matrix.cpp: *L*
coordinate_vector.cpp: *L*
hermitian_adaptor.cpp: *L*
hermitian_matrix.cpp: *L*
identity_matrix.cpp: *L*
map_array.cpp: *L*
mapped_matrix.cpp: *L*
mapped_vector.cpp: *L*
matrix.cpp: *L*
matrix_binary.cpp: *L*
matrix_binary_scalar.cpp: *L*
matrix_column.cpp: *L*
matrix_column_project.cpp: *L*
matrix_matrix_binary.cpp: *L*
matrix_matrix_solve.cpp: *L*
matrix_range.cpp: *L*
matrix_range_project.cpp: *L*
matrix_row.cpp: *L*
matrix_row_project.cpp: *L*
matrix_slice.cpp: *L*
matrix_slice_project.cpp: *L*
matrix_unary.cpp: *L*
matrix_vector_binary.cpp: *L*
matrix_vector_range.cpp: *L*
matrix_vector_slice.cpp: *L*
matrix_vector_solve.cpp: *L*
range.cpp: *L*
slice.cpp: *L*
symmetric_adaptor.cpp: *L*
symmetric_matrix.cpp: *L*
triangular_adaptor.cpp: *L*
triangular_matrix.cpp: *L*
unbounded_array.cpp: *L*
unit_vector.cpp: *L*
vector.cpp: *L*
vector_binary.cpp: *L*
vector_binary_outer.cpp: *L*
vector_binary_redux.cpp: *L*
vector_binary_scalar.cpp: *L*
vector_range.cpp: *L*
vector_range_project.cpp: *L*
vector_slice.cpp: *L*
vector_slice_project.cpp: *L*
vector_unary.cpp: *L*
vector_unary_redux.cpp: *L*
zero_matrix.cpp: *L*
zero_vector.cpp: *L*
libs/numeric/ublas/doc/
storage_concept.htm: *C* *L*
storage_sparse.htm: *L*
symmetric.htm: *L*
triangular.htm: *L*
types_overview.htm: *L*
ublas.css: *C* *L*
unbounded_array.htm: *C* *L*
vector.htm: *L*
vector_expression.htm: *L*
vector_proxy.htm: *L*
vector_sparse.htm: *L*
libs/numeric/ublas/test/
README: *C* *L*
concepts.cpp: *L*
test1.cpp: *L*
test1.hpp: *L*
test11.cpp: *L*
test12.cpp: *L*
test13.cpp: *L*
test2.cpp: *L*
test2.hpp: *L*
test21.cpp: *L*
test22.cpp: *L*
test23.cpp: *L*
test3.cpp: *L*
test3.hpp: *L*
test31.cpp: *L*
test32.cpp: *L*
test33.cpp: *L*
test4.cpp: *L*
test4.hpp: *L*
test42.cpp: *L*
test43.cpp: *L*
test5.cpp: *L*
test5.hpp: *L*
test52.cpp: *L*
test53.cpp: *L*
test6.cpp: *L*
test6.hpp: *L*
test62.cpp: *L*
test63.cpp: *L*
test7.cpp: *L*
test7.hpp: *L*
test71.cpp: *L*
test72.cpp: *L*
test73.cpp: *L*
|optional|
libs/optional/test/
Jamfile.v2: *L*
|people|
people/
paul_moore.htm: *C* *L*
vesa_karvonen.htm: *C* *L*
|program_options|
boost/program_options/detail/
utf8_codecvt_facet.hpp: *L*
libs/program_options/build/
Jamfile.v2: *C* *L*
libs/program_options/doc/
Jamfile.v2: *C* *L*
acknowledgements.xml: *C* *L*
changes.xml: *C* *L*
design.xml: *C* *L*
glossary.xml: *C* *L*
howto.xml: *C* *L*
overview.xml: *C* *L*
post_review_plan.txt: *C* *L*
todo.txt: *C* *L*
tutorial.xml: *C* *L*
libs/program_options/example/
Jamfile.v2: *C* *L*
libs/program_options/test/
Jamfile.v2: *C* *L*
program_options_size_test.py: *C* *L*
ucs2.txt: *C* *L*
utf8.txt: *C* *L*
winmain.py: *C* *L*
|property_map|
libs/property_map/
LvaluePropertyMap.html: *L*
ReadWritePropertyMap.html: *L*
ReadablePropertyMap.html: *L*
WritablePropertyMap.html: *L*
associative_property_map.html: *L*
const_assoc_property_map.html: *L*
libs/property_map/doc/
dynamic_property_map.html: *C* *L*
dynamic_property_map.rst: *C* *L*
libs/property_map/
example2.cpp: *L*
identity_property_map.html: *L*
iterator_property_map.html: *L*
property_map.html: *L*
vector_property_map.html: *L*
|ptr_container|
libs/ptr_container/doc/
default.css: *L*
intro.xml: *C* *L*
ptr_container.xml: *L*
libs/ptr_container/test/
Jamfile.v2: *C* *L*
sequence_point.cpp: *C* *L*
|python|
libs/python/doc/
internals.html: *L*
internals.rst: *L*
libs/python/doc/tutorial/doc/html/python/
embedding.html: *L*
exception.html: *L*
exposing.html: *L*
functions.html: *L*
hello.html: *L*
iterators.html: *L*
object.html: *L*
techniques.html: *L*
libs/python/test/
operators_wrapper.cpp: *C* *L*
operators_wrapper.py: *C* *L*
|rational|
boost/
rational.hpp: *L*
libs/rational/
index.html: *L*
rational.html: *L*
rational_example.cpp: *L*
rational_test.cpp: *L*
|regex|
libs/regex/build/
gcc-shared.mak: *C* *L*
libs/regex/example/timer/
input_script.txt: *C* *L*
|regression|
tools/regression/build/
Jamfile.v2: *C* *L*
tools/regression/detail/
tiny_xml_test.txt: *C* *L*
tools/regression/
index.htm: *C* *L*
run_tests.sh: *C* *L*
tools/regression/test/test-cases/general/expected/
results.xml: *C* *L*
tools/regression/test/test-cases/incremental/expected/
results.xml: *C* *L*
tools/regression/test/
test.bat: *C* *L*
tools/regression/xsl_reports/
boostbook_report.py: *C* *L*
tools/regression/xsl_reports/db/
load.py: *C* *L*
test-runs.xsd: *C* *L*
tools/regression/xsl_reports/
empty_expected_results.xml: *C* *L*
tools/regression/xsl_reports/runner/
__init__.py: *C* *L*
default.css: *L*
instructions.html: *L*
instructions.rst: *C* *L*
tools/regression/xsl_reports/test/
common.py: *C* *L*
expected_results.xml: *C* *L*
generate_test_results.py: *C* *L*
generate_test_results_v1.py: *C* *L*
restrict_to_library.xsl: *C* *L*
run_notes_regression.py: *C* *L*
run_v1.py: *C* *L*
tools/regression/xsl_reports/test/test-components/
test.py: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/
compile-fail.xml: *C* *L*
completed.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/
compile-fail.xml: *C* *L*
completed.xml: *C* *L*
lib.xml: *C* *L*
misfire.xml: *C* *L*
no-run.xml: *C* *L*
run_pyd.xml: *C* *L*
test-case.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/
lib.xml: *L*
misfire.xml: *C* *L*
no-run.xml: *C* *L*
run_pyd.xml: *C* *L*
test-case.xml: *L*
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/test-components/test_re_match/expected/
test_re_match.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/expected/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/expected/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/
test.py: *C* *L*
test_boost_wide_report.py: *C* *L*
tools/regression/xsl_reports/
test_results.xsd: *C* *L*
tools/regression/xsl_reports/utils/
__init__.py: *C* *L*
accept_args.py: *C* *L*
char_translation_table.py: *C* *L*
check_existance.py: *C* *L*
checked_system.py: *C* *L*
libxslt.py: *C* *L*
log.py: *C* *L*
makedirs.py: *C* *L*
send_mail.py: *C* *L*
sourceforge.py: *C* *L*
tar.py: *C* *L*
zip.py: *C* *L*
tools/regression/xsl_reports/xsl/v2/
expected_to_1_33_format.xsl: *C* *L*
|release|
tools/release/
utils.py: *C* *L*
|serialization|
libs/serialization/doc/
style.css: *C* *L*
libs/serialization/example/
demo_output.txt: *C* *L*
demo_save.xml: *C* *L*
demofile.txt: *C* *L*
libs/serialization/test/
run_archive_test.bat: *C* *L*
runtest.bat: *C* *L*
runtest.sh: *C* *L*
libs/serialization/vc7ide/
readme.txt: *C* *L*
|signals|
libs/signals/doc/
tutorial.xml: *C* *L*
|smart_ptr|
libs/smart_ptr/
compatibility.htm: *L*
scoped_array.htm: *L*
scoped_ptr.htm: *L*
shared_array.htm: *L*
shared_ptr.htm: *L*
smart_ptr.htm: *L*
smarttests.htm: *L*
weak_ptr.htm: *L*
|test|
boost/test/utils/runtime/cla/detail/
argument_value_usage.hpp: *L*
libs/test/test/auto-link-test/
run_bjam.bat: *C* *L*
|timer|
libs/timer/
timer.htm: *L*
|tr1|
boost/tr1/
tuple.hpp: *C* *L*
|tuple|
libs/tuple/doc/
design_decisions_rationale.html: *L*
tuple_advanced_interface.html: *L*
tuple_users_guide.html: *L*
libs/tuple/test/
README: *C* *L*
|utility|
boost/
shared_container_iterator.hpp: *L*
libs/utility/
OptionalPointee.html: *L*
call_traits.htm: *L*
compressed_pair.htm: *L*
enable_if.html: *L*
libs/utility/test/
Jamfile.v2: *L*
libs/utility/
utility.htm: *L*
value_init.htm: *L*
value_init_test.cpp: *C*
value_init_test_fail1.cpp: *C*
value_init_test_fail2.cpp: *C*
value_init_test_fail3.cpp: *C*
|variant|
libs/variant/doc/
Jamfile.v2: *C* *L*
biblio.xml: *C* *L*
design.xml: *C* *L*
introduction.xml: *C* *L*
misc.xml: *C* *L*
libs/variant/doc/reference/
apply_visitor.xml: *C* *L*
bad_visit.xml: *C* *L*
concepts.xml: *C* *L*
get.xml: *C* *L*
recursive_variant.xml: *C* *L*
recursive_wrapper.xml: *C* *L*
reference.xml: *C* *L*
static_visitor.xml: *C* *L*
variant.xml: *C* *L*
variant_fwd.xml: *C* *L*
visitor_ptr.xml: *C* *L*
libs/variant/doc/tutorial/
advanced.xml: *C* *L*
basic.xml: *C* *L*
tutorial.xml: *C* *L*
libs/variant/doc/
variant.xml: *L*
libs/variant/
index.html: *C* *L*
libs/variant/test/
Jamfile.v2: *L*
1
0
Boost Inspection Report
Run Date: 16:06:06 UTC, Sunday 27 May 2007
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:
11453 files scanned
909 directories scanned (including root)
192 problems reported
Problem counts:
0 files with invalid line endings
0 bookmarks with invalid characters
3 invalid urls
101 broken links
21 unlinked files
22 file/directory names issues
1 files with tabs
9 violations of the Boost min/max guidelines
35 usages of unnamed namespaces in headers (including .ipp files)
Summary:
archive (3)
bind (1)
boost-root (1)
build (1)
date_time (1)
doc (2)
filesystem (33)
graph (2)
iostreams (2)
lambda (3)
math (8)
more (4)
mpl (4)
multi_array (2)
ptr_container (1)
python (8)
regex (1)
regression (32)
serialization (1)
test (81)
type_traits (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
|archive|
boost/archive/basic_streambuf_locale_saver.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
|bind|
boost/bind/placeholders.hpp:
*U* unnamed namespace at line 25
|boost-root|
index.htm:
*A* broken link: doc/hmtl/date_time/details.html#changes
|build|
tools/build/v2/test/test_system.html:
*A* unlinked file
|date_time|
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/jam.html:
*A* unlinked file
|filesystem|
libs/filesystem/doc/do-list.htm:
*A* invalid URL (hardwired file): file://?/
*A* invalid URL (hardwired file): file://?/UNC/
libs/filesystem/doc/i18n.html:
*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: ../build/Jamfile
*A* broken link: convenience.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#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#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
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
|graph|
libs/graph/example/file_dependencies.cpp:
*M* violation of Boost min/max guidelines on line 139
libs/graph/test/serialize.cpp:
*T*
|iostreams|
libs/iostreams/doc/concepts/multi-character.html:
*A* unlinked file
libs/iostreams/doc/installation.html:
*A* broken link: ../../../tools/build/v1/build_system.htm
|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
|math|
libs/math/test/common_factor_test.cpp:
*M* violation of Boost min/max guidelines on line 146
*M* violation of Boost min/max guidelines on line 147
*M* violation of Boost min/max guidelines on line 193
*M* violation of Boost min/max guidelines on line 194
|more|
more/cvs.html:
*A* unlinked file
more/getting_started/unix-variants.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/getting_started/windows.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/separate_compilation.html:
*A* broken link: ../libs/config/test/link/test/Jamfile.v2
|mpl|
boost/mpl/alias.hpp:
*U* unnamed namespace at line 17
libs/mpl/doc/refmanual/for-each.html:
*A* broken link: ./value-initialized.html
|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
|ptr_container|
libs/ptr_container/doc/tutorial_example.html:
*A* unlinked file
|python|
libs/python/doc/building.html:
*A* broken link: ../index.htm
libs/python/doc/tutorial/doc/html/python/hello.html:
*A* broken link: ../../../../../example/tutorial/Jamrules
libs/python/doc/tutorial/index.html:
*A* broken link: ../../../LICENSE_1_0.txt
libs/python/doc/v2/May2002.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
*A* broken link: ../../../../tools/build/v1/gen_aix_import_file.py
libs/python/doc/v2/faq.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
|regex|
libs/regex/performance/input.html:
*A* unlinked file
|regression|
regression/.htaccess:
*N* leading character of ".htaccess" is not alphabetic
tools/regression/test/test-cases/incremental/bjam.log.1:
*N* name contains more than one dot character ('.')
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
*N* name contains more than one dot character ('.')
*N* name exceeds 31 characters
tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
*N* name contains more than one dot character ('.')
*N* name exceeds 31 characters
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/src/basic_xml_grammar.ipp:
*U* unnamed namespace at line 43
|test|
boost/test/floating_point_comparison.hpp:
*U* unnamed namespace at line 206
*U* unnamed namespace at line 228
boost/test/impl/cpp_main.ipp:
*U* unnamed namespace at line 42
boost/test/impl/exception_safety.ipp:
*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 262
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 52
*U* unnamed namespace at line 61
libs/test/build/msvc71_proj/config_file_iterator_test.vcproj:
*N* name exceeds 31 characters
libs/test/doc/components/prg_exec_monitor/compilation.html:
*A* broken link: ../../../build/Jamfile
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/compilation.html:
*A* broken link: ../../../build/Jamfile
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
|type_traits|
libs/type_traits/cxx_type_traits.htm:
*A* unlinked file
1
0
Boost Regression test failures
Report time: 2007-05-26T22:57:17Z
This report lists all regression test failures on release platforms.
Detailed report:
http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/iā¦
30 failures in 4 libraries
date_time (1)
graph (1)
iostreams (1)
serialization (27)
|date_time|
testtime_serialize_std_config: msvc-8.0
|graph|
graphviz_test: gcc-cygwin-3.4.4
|iostreams|
compose_test: gcc-4.1.0_linux_x86_64
|serialization|
test_class_info_load_binary_archive: gcc-4.1.0_linux_x86_64
test_class_info_load_xml_warchive: gcc-4.1.0_linux_x86_64
test_class_info_load_xml_warchive_dll: gcc-4.1.0_linux_x86_64
test_class_info_save_xml_warchive: gcc-4.1.0_linux_x86_64
test_class_info_save_xml_warchive_dll: gcc-4.1.0_linux_x86_64
test_cyclic_ptrs_xml_archive: gcc-4.1.0_linux_x86_64
test_delete_pointer_text_archive_dll: gcc-4.1.0_linux_x86_64
test_demo_dll: gcc-4.1.0_linux_x86_64
test_demo_xml: gcc-4.1.0_linux_x86_64
test_demo_xml_load: gcc-4.1.0_linux_x86_64
test_demo_xml_save: gcc-4.1.0_linux_x86_64
test_deque_xml_archive: gcc-4.1.0_linux_x86_64
test_exported_binary_archive: gcc-4.1.0_linux_x86_64
test_exported_xml_warchive_dll: gcc-4.1.0_linux_x86_64
test_list_ptrs_xml_warchive: gcc-4.1.0_linux_x86_64
test_map_xml_archive: gcc-4.1.0_linux_x86_64
test_no_rtti_xml_warchive: msvc-8.0
test_recursion_xml_archive_dll: gcc-4.1.0_linux_x86_64
test_reset_object_address_dll: gcc-4.1.0_linux_x86_64
test_shared_ptr_132_text_warchive_dll: gcc-4.1.0_linux_x86_64
test_shared_ptr_132_xml_warchive: gcc-4.1.0_linux_x86_64
test_shared_ptr_xml_archive: gcc-4.1.0_linux_x86_64
test_tracking_text_warchive_dll: gcc-4.1.0_linux_x86_64
test_tracking_xml_warchive: gcc-4.1.0_linux_x86_64
test_vector_binary_archive_dll: gcc-4.1.0_linux_x86_64
test_vector_xml_warchive: gcc-4.1.0_linux_x86_64
test_vector_xml_warchive_dll: gcc-4.1.0_linux_x86_64
1
0
Hello,
Change the way operator[] works for map views.
Both John and Thorsten agree that operator[] was implemented in a rather
convoluted way. First a const version of the operator was provided going
against the standard. This version present the semantics of the new C++0x
function for maps:
/* T& at(const key_type& x);
* const T& at(const key_type& x) const;
*
* Returns: A reference to the element whose key is
* equivalent to x, if such an element is present in the map.
*
* Throws: out_of_range if no such element is present.
*/
Thorsten advice was to add the const version to map and remove the
non-standard conforming const version of operator[]. This was changed in the
library.
The non-const version was very complicated because it has to return a proxy
in order to be modified. The only operation the proxy would allow was to used
operator=(data). The rationale was to support the common coding style for
maps:
bimap<int,string> bm;
bm.left[1] = "one";
bm.left[2] = "two";
bm.left[3] = "three";
assert( bm.right["two"] == 2 );
When at() was included the last line has to be coded like
assert( bm.right.at("two") == 2;
So the only reason for non const version of operator[] where the first lines
bm.left[1] = "one";
This line expands to:
if (1,_) is not in the bimap
try to insert (1,"one")
else
try to replace (1,_) with (1,"one")
if (1,"one") was not inserted
throw duplicate_value
The rationale was to respect the standard library and throw an exception
if that was impossible.
This function will be removed for the moment. It can be reintroduce later
with out problems.
The user can also write a helper free function to obtain the same functionality
template< class BimapView >
void force_insertion(BimapView& b,const typename BimapView::value_type& d)
{
typename BimapView::iterator iter = b.find(d.first);
if( ! ( iter == b.end() ? view.insert(d).second : view.replace(d) ) )
{
::boost::throw_exception( std::exception() );
}
}
And then use it like
force_insertion( bm.left, bm_type::left_value_type(1,"one") );
There are some bimaps that allow to provide operator[] and non const version
of at() conforming to the standard. This happens when the data type of the
map view is mutable. For example in bimap< int, list_of<double> >.
In these cases this two function are provided.
Summarizing:
removed --- const data & operator[](const key &) const
removed --- proxy & operator[](const key &)
added --- const data & at(const key &) const
added(*) --- data & at(const key &)
added(*) --- data & operator[](const key &)
(*) Enable if the data_type of the map view is mutable
What do you think of this change?
Best Regards
Matias
1
0
Hi!
I have a library here which I would propose for addition to Boost. It is a
wrapper around a resource handle, just like std::auto_ptr is a wrapper around
a pointer. The main difference to std::auto_ptr is that it doesn't overload
operator-> and that it can (or, rather, must) be customized. Therefore it can
also be used to hold resources like 'int' (a Unix filedescriptor) or 'FILE*'
and also has the known ownership transfer semantics of std::auto_ptr.
A few points I'd like to point out:
* auto_ptr can hold a FILE*, too!
No it can't, because it invokes delete on it while it wasn't allocated with
new.
* shared_ptr could hold a FILE! Yes, provided you give it a suitable deleter.
However, shared_ptr does not provide exclusive ownership semantics and
requires dynamic allocation for the reference counter.
* It has the same size as std::auto_ptr (I'm assuming an implementation of
auto_ptr that only wraps a pointer) and achieves the custom deleting via a
policy type (type traits).
* When wrapping e.g. an int, the type traits force you to specify whether the
int is a timer ID or a filedescriptor, so you even get something like type
safety on top of a type-depraved API.
* When wrapping e.g. a win32 HANDLE (which is a very opaque type used for lots
of things in the win32 API) you can even create traits that tell whether
something is a windows handle or an event handle, even though both use the
same function for releasing the resource.
* You could wrap pointers, too, but since it isn't intended as a smart pointer
the syntax would be a bit awkward. Of course, the way the pointers are
deallocated would then be customizable, e.g. free() or delete[].
* The same type traits could be used to form a shared_ptr equivalent, but the
places where I used this I haven't found the need for this yet. In fact I
call exclusive ownership an advantage sometimes, because you precisely don't
have to care about whether someone else might be accessing the resource.
Also, there is no release() function which I admit is a dangerous function
but it is useful nonetheless. I'd call it a sharp tool.
I wrote something like this once for a Berkeley socket and once for a win32
thread handle before generalizing it into this class template. It is by no
means production-ready (although the idea itself is) so I only want to
present the library and some example code (see below) for discussion here.
cheers
Uli
/* example program for a handle wrapper that behaves like std::auto_ptr
This wrapper class can be customized with a traits type and then handle
resources that are not released with delete, like C's FILE* or Unix
filedescriptors.
The main characteristics are captured by the trait class. For type FILE, a
suitable specialisation is already provided, for other types you can do the
same. For use with e.g. Unix filedescriptors, I wouldn't specialise the
traits because they are plain ints and thus not a safe identifier for this
kind of use (e.g. under win32, you need to differentiate between close() and
closesocket(), depending on where you got the int from). Instead, you can use
the fact that the first template parameter is only used as default for the
traits and not(!) as real storage type. You then simply introduce a special
type (the mere declaration of a simple, dedicated struct is enough) and the
nested typedef inside the traits is the storage type:
// incomplete dummy type, only used as ID for specialisation below
struct filedescriptor;
// specialize resource_traits
template<>
resource_traits<filedescriptor>
{
typedef int handle_type;
...
};
auto_handle<filedescriptor> h(open("/dev/stdout", O_WRONLY));
if(h)
write( *h, "Heya!", strlen("Heya!"));
Note: other than std::auto_ptr, release() doesn't return the resource handle.
The reason is that this first needs to be copied to a safe place (i.e. one
that guarantees no resource leaks) before releasing ownership.
// wrong: if insert() throws, the handle is lost and the
// resource is leaked!
container.insert(h.release());
// correct:
container.insert(h.get());
h.release();
*/
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
/* traits class describing the resource behaviour */
template<typename ResourceHandle>
struct resource_traits
{
/* nested typedef for the handle type
Typically the same as the template parameter. */
typedef ResourceHandle handle_type;
/* invalid signal value
The equivalent of a NULL pointer. */
handle_type get_null() const;
/* check for invalid signal values
This is useed because there are cases where more than one signal value
exists. */
bool is_valid(handle_type h) const;
/* release the resource
This is the equivalent to delete or free() for the resource type. */
void deallocate(handle_type h) const;
};
template<typename ResourceHandle, typename ResourceTraits =
resource_traits<ResourceHandle> >
struct auto_handle:
ResourceTraits
{
typedef ResourceTraits traits_type;
typedef typename traits_type::handle_type handle_type;
auto_handle(): m_handle(traits_type::get_null()) {}
explicit auto_handle(handle_type h): m_handle(h) {}
auto_handle( auto_handle& rhs): m_handle(rhs.get())
{ rhs.release(); }
auto_handle& operator=(auto_handle& rhs)
{
if(this!=&rhs)
{
reset(rhs.get());
rhs.release();
}
return *this;
}
~auto_handle()
{ traits_type::deallocate(m_handle); }
struct ref
{
handle_type h;
};
operator ref()
{
ref r = {m_handle};
release();
return r;
}
auto_handle(ref r): m_handle(r.h) {}
auto_handle& operator=(ref r)
{
reset(r.h);
return *this;
}
handle_type operator*() const
{ return m_handle; }
handle_type get() const
{ return m_handle; }
bool valid() const
{ return traits_type::is_valid(m_handle); }
typedef bool (auto_handle::*boolean_type)() const;
operator boolean_type() const
{
if(traits_type::is_valid(m_handle))
return &auto_handle::valid;
else
return 0;
}
// reset handle without deallocating associated resource
void release()
{
m_handle = traits_type::get_null();
}
// deallocate resource and reset handle
void reset()
{
traits_type::deallocate(m_handle);
m_handle = traits_type::get_null();
}
void reset( handle_type h)
{
traits_type::deallocate(m_handle);
m_handle = h;
}
private:
handle_type m_handle;
};
template<>
struct resource_traits<FILE*>
{
/* nested typedef for the handle type
Typically the same as the template parameter. */
typedef FILE* handle_type;
/* invalid signal value
The equivalent of a NULL pointer. */
static handle_type get_null()
{ return 0; }
/* compare for invalid signal value
This is useful for cases where more than one signal value exists. */
static bool is_valid(handle_type h)
{ return h!=0; }
/* release the resource
This is the equivalent to delete or free() for the resource type. */
static void deallocate(handle_type h)
{
if(is_valid(h))
{
printf("deallocate(%p)\n", h);
fclose(h);
}
}
};
typedef auto_handle<FILE*> auto_file;
auto_file
open_file(char const* path)
{
auto_handle<FILE*> res(fopen(path,"r"));
printf("open_file('%s') = %p\n", path, res.get());
return res;
}
struct filedescriptor;
template<>
struct resource_traits<filedescriptor>
{
typedef int handle_type;
static handle_type get_null()
{ return -1; }
static bool is_valid(handle_type h)
{ return h>=0; }
static void deallocate(handle_type h)
{
if(is_valid(h))
{
printf("deallocate(%d)\n", h);
// TODO: check returnvalue
close(h);
}
}
};
typedef auto_handle<filedescriptor> auto_filedescriptor;
auto_filedescriptor
open_fd(char const* path)
{
auto_filedescriptor res(open( path, O_RDONLY));
printf("open_fd('%s') = %d\n", path, res.get());
return res;
}
int
main()
{
{
auto_handle<FILE*> f = open_file("/dev/null");
if(!f)
printf("failed to open '/dev/null'\n");
f = open_file("/dev/stdout");
if(!f)
printf("failed to open '/dev/stdout'\n");
open_file("/dev/null");
}
{
auto_filedescriptor fd = open_fd("/dev/null");
if(!fd)
printf("failed to open '/dev/null'\n");
fd = open_fd("/dev/stdout");
if(!fd)
printf("failed to open '/dev/stdout'\n");
open_fd("/dev/null");
}
}
1
0
Now that XPressive is part of Boost 1.34 I think the "Getting xpressive"
section of the "Installation xpressive" topic should be updated accoedingly.
2
1

26 May '07
In:
http://boost.cvs.sourceforge.net/boost/boost/libs/xpressive/test/test_cycleā¦
the regexp_impl<...>::instances variable is not reset to 0 between
tests; so, if the first fails, the test will indicate that all
fail, AFAICT.
2
1
Boost Regression test failures
Report time: 2007-05-26T04:23:37Z
This report lists all regression test failures on release platforms.
Detailed report:
http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/iā¦
3 failures in 3 libraries
date_time (1)
graph (1)
serialization (1)
|date_time|
testtime_serialize_std_config: msvc-8.0
|graph|
graphviz_test: gcc-cygwin-3.4.4
|serialization|
test_no_rtti_xml_warchive: msvc-8.0
4
3
Boost Inspection Report
Run Date: 16:05:21 UTC, Saturday 26 May 2007
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:
11453 files scanned
909 directories scanned (including root)
1059 problems reported
Problem counts:
661 files missing Boost license info or having wrong reference text
398 files missing copyright notice
Summary:
any (1)
archive (1)
build (68)
concept_check (22)
conversion (5)
doc (1)
filesystem (2)
function (1)
graph (1)
inspect (1)
integer (9)
lambda (10)
libs (6)
logic (2)
math (1)
more (13)
mpl (417)
multi_array (13)
numeric (188)
optional (1)
people (4)
program_options (35)
property_map (15)
ptr_container (8)
python (14)
rational (5)
regex (4)
regression (118)
release (2)
serialization (16)
signals (2)
smart_ptr (8)
test (3)
timer (1)
tr1 (2)
tuple (5)
utility (12)
variant (42)
Details:
*L* missing Boost license info, or wrong reference text
*C* missing copyright notice
|any|
libs/any/doc/
any.xml: *L*
|archive|
boost/archive/detail/
utf8_codecvt_facet.hpp: *L*
|build|
tools/build/v2/build/
build-request.jam: *L*
modifiers.jam: *L*
tools/build/v2/doc/
Jamfile.v2: *C* *L*
tools/build/v2/doc/src/
advanced.xml: *C* *L*
architecture.xml: *C* *L*
catalog.xml: *C* *L*
extending.xml: *C* *L*
faq.xml: *C* *L*
fragments.xml: *C* *L*
howto.xml: *C* *L*
install.xml: *C* *L*
recipes.xml: *C* *L*
reference.xml: *C* *L*
standalone.xml: *C* *L*
tutorial.xml: *C* *L*
userman.xml: *C* *L*
tools/build/v2/example/generate/
REAME.txt: *C* *L*
a.cpp: *C* *L*
tools/build/v2/example/generator/
README.txt: *C* *L*
soap.jam: *C* *L*
tools/build/v2/example/python_modules/
python_helpers.jam: *C* *L*
python_helpers.py: *C* *L*
tools/build/v2/test/
abs_workdir.py: *C* *L*
dependency_property.py: *L*
dependency_test.py: *C* *L*
direct_request_test.py: *C* *L*
dll_path.py: *L*
double_loading.py: *L*
duplicate.py: *L*
echo_args.jam: *C* *L*
empty.jam: *C* *L*
expansion.py: *L*
explicit.py: *L*
gcc_runtime.py: *L*
tools/build/v2/test/project-test3/lib3/
Jamfile: *C* *L*
tools/build/v2/test/
readme.txt: *C* *L*
svn_tree.py: *L*
tag.py: *L*
test_system.html: *L*
tools/build/v2/tools/
sun.jam: *L*
xsltproc.jam: *L*
|concept_check|
libs/concept_check/
bibliography.htm: *L*
concept_check.htm: *L*
concept_covering.htm: *L*
creating_concepts.htm: *L*
libs/concept_check/doc/
Jamfile.v2: *C* *L*
libs/concept_check/doc/reference/
Assignable.xml: *L*
BidirectionalIterator.xml: *L*
CopyConstructible.xml: *L*
DefaultConstructible.xml: *L*
EqualityComparable.xml: *L*
ForwardIterator.xml: *L*
InputIterator.xml: *L*
LessThanComparable.xml: *L*
OutputIterator.xml: *L*
RandomAccessIterator.xml: *L*
SignedInteger.xml: *L*
concepts.xml: *L*
libs/concept_check/
implementation.htm: *L*
prog_with_concepts.htm: *L*
reference.htm: *L*
using_concept_check.htm: *L*
|conversion|
libs/conversion/
cast.htm: *L*
index.html: *C* *L*
lexical_cast.htm: *L*
libs/conversion/test/
Jamfile.v2: *L*
|doc|
doc/html/
docutils.css: *L*
|filesystem|
libs/filesystem/doc/
tr2_proposal.html: *L*
libs/filesystem/src/
utf8_codecvt_facet.hpp: *L*
|function|
boost/function/detail/
gen_maybe_include.pl: *L*
|graph|
libs/graph/doc/
lengauer_tarjan_dominator.htm: *L*
|inspect|
tools/inspect/build/
Jamfile.v2: *L*
|integer|
libs/integer/
cstdint.htm: *C* *L*
libs/integer/doc/
integer_mask.html: *L*
static_min_max.html: *L*
libs/integer/
index.html: *C* *L*
integer.htm: *L*
integer_traits.html: *C* *L*
|lambda|
libs/lambda/doc/
Jamfile.v2: *C* *L*
libs/lambda/doc/detail/
README: *C* *L*
lambda_doc.xsl: *C* *L*
lambda_doc_chunks.xsl: *C* *L*
libs/lambda/test/
Makefile: *C* *L*
|libs|
libs/
expected_results.xml: *C* *L*
maintainers.txt: *C* *L*
platform_maintainers.txt: *C* *L*
|logic|
libs/logic/doc/
Jamfile.v2: *C* *L*
|math|
boost/math/
common_factor_rt.hpp: *L*
|more|
more/
error_handling.html: *L*
generic_exception_safety.html: *C* *L*
generic_programming.html: *L*
getting_started.rst: *C* *L*
moderators.html: *C*
regression.html: *C* *L*
report-apr-2006.html: *C* *L*
report-jan-2006.html: *C* *L*
|mpl|
libs/mpl/doc/src/refmanual/
ASSERT.rst: *C* *L*
ASSERT_MSG.rst: *C* *L*
ASSERT_NOT.rst: *C* *L*
ASSERT_RELATION.rst: *C* *L*
AUX_LAMBDA_SUPPORT.rst: *C* *L*
Acknowledgements.rst: *C* *L*
Algorithms-Iteration.rst: *C* *L*
Algorithms-Querying.rst: *C* *L*
Algorithms-Runtime.rst: *C* *L*
Algorithms-Transformation.rst: *C* *L*
Algorithms.rst: *C* *L*
AssociativeSequence.rst: *C* *L*
BackExtensibleSequence.rst: *C* *L*
BidirectionalIterator.rst: *C* *L*
BidirectionalSequence.rst: *C* *L*
CFG_NO_HAS_XXX.rst: *C* *L*
CFG_NO_PREPROCESSED.rst: *C* *L*
Categorized.rst: *C* *L*
Data.rst: *C* *L*
ExtensibleAssociativeSeq.rst: *C* *L*
ExtensibleSequence.rst: *C* *L*
ForwardIterator.rst: *C* *L*
ForwardSequence.rst: *C* *L*
FrontExtensibleSequence.rst: *C* *L*
HAS_XXX_TRAIT_DEF.rst: *C* *L*
HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L*
Inserter.rst: *C* *L*
IntegralConstant.rst: *C* *L*
IntegralSequenceWrapper.rst: *C* *L*
Iterators-Concepts.rst: *C* *L*
Iterators-Metafunctions.rst: *C* *L*
Iterators.rst: *C* *L*
LIMIT_LIST_SIZE.rst: *C* *L*
LIMIT_MAP_SIZE.rst: *C* *L*
LIMIT_METAFUNCTION_ARITY.rst: *C* *L*
LIMIT_SET_SIZE.rst: *C* *L*
LIMIT_UNROLLING.rst: *C* *L*
LIMIT_VECTOR_SIZE.rst: *C* *L*
LambdaExpression.rst: *C* *L*
Macros-Asserts.rst: *C* *L*
Macros-Configuration.rst: *C* *L*
Macros.rst: *C* *L*
Metafunction.rst: *C* *L*
MetafunctionClass.rst: *C* *L*
Metafunctions-Arithmetic.rst: *C* *L*
Metafunctions-Bitwise.rst: *C* *L*
Metafunctions-Comparisons.rst: *C* *L*
Metafunctions-Composition.rst: *C* *L*
Metafunctions-Conditional.rst: *C* *L*
Metafunctions-Invocation.rst: *C* *L*
Metafunctions-Logical.rst: *C* *L*
Metafunctions-Trivial.rst: *C* *L*
Metafunctions-Type.rst: *C* *L*
Metafunctions.rst: *C* *L*
NumericMetafunction.rst: *C* *L*
PlaceholderExpression.rst: *C* *L*
Placeholders.rst: *C* *L*
RandomAccessIterator.rst: *C* *L*
RandomAccessSequence.rst: *C* *L*
ReversibleAlgorithm.rst: *C* *L*
Sequences-Classes.rst: *C* *L*
Sequences-Concepts.rst: *C* *L*
Sequences-Intrinsic.rst: *C* *L*
Sequences-Views.rst: *C* *L*
Sequences.rst: *C* *L*
TagDispatchedMetafunction.rst: *C* *L*
TrivialMetafunction.rst: *C* *L*
VariadicSequence.rst: *C* *L*
accumulate.rst: *C* *L*
advance.rst: *C* *L*
always.rst: *C* *L*
and_.rst: *C* *L*
apply.rst: *C* *L*
apply_wrap.rst: *C* *L*
arg.rst: *C* *L*
at.rst: *C* *L*
at_c.rst: *C* *L*
back.rst: *C* *L*
back_inserter.rst: *C* *L*
begin.rst: *C* *L*
bind.rst: *C* *L*
bitand_.rst: *C* *L*
bitor_.rst: *C* *L*
bitxor_.rst: *C* *L*
bool_.rst: *C* *L*
clear.rst: *C* *L*
contains.rst: *C* *L*
copy.rst: *C* *L*
copy_if.rst: *C* *L*
count.rst: *C* *L*
count_if.rst: *C* *L*
deque.rst: *C* *L*
deref.rst: *C* *L*
distance.rst: *C* *L*
divides.rst: *C* *L*
empty.rst: *C* *L*
empty_base.rst: *C* *L*
empty_sequence.rst: *C* *L*
end.rst: *C* *L*
equal.rst: *C* *L*
equal_to.rst: *C* *L*
erase.rst: *C* *L*
erase_key.rst: *C* *L*
eval_if.rst: *C* *L*
eval_if_c.rst: *C* *L*
filter_view.rst: *C* *L*
find.rst: *C* *L*
find_if.rst: *C* *L*
fold.rst: *C* *L*
for_each.rst: *C* *L*
front.rst: *C* *L*
front_inserter.rst: *C* *L*
greater.rst: *C* *L*
greater_equal.rst: *C* *L*
has_key.rst: *C* *L*
identity.rst: *C* *L*
if_.rst: *C* *L*
if_c.rst: *C* *L*
inherit.rst: *C* *L*
inherit_linearly.rst: *C* *L*
insert.rst: *C* *L*
insert_range.rst: *C* *L*
inserter_.rst: *C* *L*
int_.rst: *C* *L*
integral_c.rst: *C* *L*
is_sequence.rst: *C* *L*
iter_fold.rst: *C* *L*
iter_fold_if.rst: *C* *L*
iterator_category.rst: *C* *L*
iterator_range.rst: *C* *L*
joint_view.rst: *C* *L*
key_type.rst: *C* *L*
lambda.rst: *C* *L*
less.rst: *C* *L*
less_equal.rst: *C* *L*
list.rst: *C* *L*
list_c.rst: *C* *L*
long_.rst: *C* *L*
lower_bound.rst: *C* *L*
map.rst: *C* *L*
max.rst: *C* *L*
max_element.rst: *C* *L*
min.rst: *C* *L*
min_element.rst: *C* *L*
minus.rst: *C* *L*
modulus.rst: *C* *L*
multiplies.rst: *C* *L*
negate.rst: *C* *L*
next.rst: *C* *L*
not_.rst: *C* *L*
not_equal_to.rst: *C* *L*
numeric_cast.rst: *C* *L*
or_.rst: *C* *L*
order.rst: *C* *L*
pair.rst: *C* *L*
partition.rst: *C* *L*
plus.rst: *C* *L*
pop_back.rst: *C* *L*
pop_front.rst: *C* *L*
preface.rst: *C* *L*
prior.rst: *C* *L*
protect.rst: *C* *L*
push_back.rst: *C* *L*
push_front.rst: *C* *L*
quote.rst: *C* *L*
range_c.rst: *C* *L*
remove.rst: *C* *L*
remove_if.rst: *C* *L*
replace.rst: *C* *L*
replace_if.rst: *C* *L*
reverse.rst: *C* *L*
reverse_copy.rst: *C* *L*
reverse_copy_if.rst: *C* *L*
reverse_fold.rst: *C* *L*
reverse_iter_fold.rst: *C* *L*
reverse_partition.rst: *C* *L*
reverse_remove.rst: *C* *L*
reverse_remove_if.rst: *C* *L*
reverse_replace.rst: *C* *L*
reverse_replace_if.rst: *C* *L*
reverse_stable_partition.rst: *C* *L*
reverse_transform.rst: *C* *L*
reverse_unique.rst: *C* *L*
sequence_tag.rst: *C* *L*
set.rst: *C* *L*
set_c.rst: *C* *L*
shift_left.rst: *C* *L*
shift_right.rst: *C* *L*
single_view.rst: *C* *L*
size.rst: *C* *L*
size_t.rst: *C* *L*
sizeof_.rst: *C* *L*
sort.rst: *C* *L*
stable_partition.rst: *C* *L*
terminology.rst: *C* *L*
times.rst: *C* *L*
transform.rst: *C* *L*
transform_view.rst: *C* *L*
unique.rst: *C* *L*
unpack_args.rst: *C* *L*
upper_bound.rst: *C* *L*
value_type.rst: *C* *L*
vector.rst: *C* *L*
vector_c.rst: *C* *L*
void_.rst: *C* *L*
zip_view.rst: *C* *L*
libs/mpl/doc/
style.css: *L*
libs/mpl/example/fsm/
README.txt: *C* *L*
libs/mpl/test/
Jamfile.v2: *C* *L*
|multi_array|
libs/multi_array/doc/
iterator_categories.html: *C* *L*
reference.html: *L*
libs/multi_array/doc/xml/
MultiArray.xml: *C* *L*
const_multi_array_ref.xml: *C* *L*
multi_array.xml: *C* *L*
multi_array_ref.xml: *C* *L*
reference.xml: *L*
libs/multi_array/test/
Jamfile.v2: *L*
|numeric|
boost/numeric/ublas/
banded.hpp: *L*
blas.hpp: *L*
boost/numeric/ublas/detail/
concepts.hpp: *L*
config.hpp: *L*
definitions.hpp: *L*
documentation.hpp: *L*
duff.hpp: *L*
iterator.hpp: *L*
matrix_assign.hpp: *L*
raw.hpp: *L*
temporary.hpp: *L*
vector_assign.hpp: *L*
boost/numeric/ublas/
exception.hpp: *L*
expression_types.hpp: *L*
functional.hpp: *L*
fwd.hpp: *L*
hermitian.hpp: *L*
io.hpp: *L*
lu.hpp: *L*
matrix.hpp: *L*
matrix_expression.hpp: *L*
matrix_proxy.hpp: *L*
matrix_sparse.hpp: *L*
operation.hpp: *L*
operation_blocked.hpp: *L*
operation_sparse.hpp: *L*
storage.hpp: *L*
storage_sparse.hpp: *L*
symmetric.hpp: *L*
traits.hpp: *L*
triangular.hpp: *L*
vector.hpp: *L*
vector_expression.hpp: *L*
vector_of_vector.hpp: *L*
vector_proxy.hpp: *L*
vector_sparse.hpp: *L*
libs/numeric/conversion/test/
Jamfile.v2: *C* *L*
test_helpers.cpp: *C*
test_helpers2.cpp: *C*
test_helpers3.cpp: *C*
traits_test.cpp: *C*
udt_example_0.cpp: *C*
udt_support_test.cpp: *C*
libs/numeric/ublas/bench1/
bench1.cpp: *L*
bench1.hpp: *L*
bench11.cpp: *L*
bench12.cpp: *L*
bench13.cpp: *L*
libs/numeric/ublas/bench2/
bench2.cpp: *L*
bench2.hpp: *L*
bench21.cpp: *L*
bench22.cpp: *L*
bench23.cpp: *L*
libs/numeric/ublas/bench3/
bench3.cpp: *L*
bench3.hpp: *L*
bench31.cpp: *L*
bench32.cpp: *L*
bench33.cpp: *L*
libs/numeric/ublas/bench4/
bench4.cpp: *L*
bench41.cpp: *L*
bench42.cpp: *L*
bench43.cpp: *L*
libs/numeric/ublas/doc/
Release_notes.txt: *C* *L*
array_adaptor.htm: *C* *L*
banded.htm: *L*
blas.htm: *L*
bounded_array.htm: *C* *L*
container_concept.htm: *L*
doxygen.css: *C* *L*
expression_concept.htm: *L*
hermitian.htm: *L*
index.htm: *L*
iterator_concept.htm: *L*
matrix.htm: *L*
matrix_expression.htm: *L*
matrix_proxy.htm: *L*
matrix_sparse.htm: *L*
operations_overview.htm: *L*
overview.htm: *L*
products.htm: *L*
range.htm: *C* *L*
libs/numeric/ublas/doc/samples/
banded_adaptor.cpp: *L*
banded_matrix.cpp: *L*
bounded_array.cpp: *L*
compressed_matrix.cpp: *L*
compressed_vector.cpp: *L*
coordinate_matrix.cpp: *L*
coordinate_vector.cpp: *L*
hermitian_adaptor.cpp: *L*
hermitian_matrix.cpp: *L*
identity_matrix.cpp: *L*
map_array.cpp: *L*
mapped_matrix.cpp: *L*
mapped_vector.cpp: *L*
matrix.cpp: *L*
matrix_binary.cpp: *L*
matrix_binary_scalar.cpp: *L*
matrix_column.cpp: *L*
matrix_column_project.cpp: *L*
matrix_matrix_binary.cpp: *L*
matrix_matrix_solve.cpp: *L*
matrix_range.cpp: *L*
matrix_range_project.cpp: *L*
matrix_row.cpp: *L*
matrix_row_project.cpp: *L*
matrix_slice.cpp: *L*
matrix_slice_project.cpp: *L*
matrix_unary.cpp: *L*
matrix_vector_binary.cpp: *L*
matrix_vector_range.cpp: *L*
matrix_vector_slice.cpp: *L*
matrix_vector_solve.cpp: *L*
range.cpp: *L*
slice.cpp: *L*
symmetric_adaptor.cpp: *L*
symmetric_matrix.cpp: *L*
triangular_adaptor.cpp: *L*
triangular_matrix.cpp: *L*
unbounded_array.cpp: *L*
unit_vector.cpp: *L*
vector.cpp: *L*
vector_binary.cpp: *L*
vector_binary_outer.cpp: *L*
vector_binary_redux.cpp: *L*
vector_binary_scalar.cpp: *L*
vector_range.cpp: *L*
vector_range_project.cpp: *L*
vector_slice.cpp: *L*
vector_slice_project.cpp: *L*
vector_unary.cpp: *L*
vector_unary_redux.cpp: *L*
zero_matrix.cpp: *L*
zero_vector.cpp: *L*
libs/numeric/ublas/doc/
storage_concept.htm: *C* *L*
storage_sparse.htm: *L*
symmetric.htm: *L*
triangular.htm: *L*
types_overview.htm: *L*
ublas.css: *C* *L*
unbounded_array.htm: *C* *L*
vector.htm: *L*
vector_expression.htm: *L*
vector_proxy.htm: *L*
vector_sparse.htm: *L*
libs/numeric/ublas/test/
README: *C* *L*
concepts.cpp: *L*
test1.cpp: *L*
test1.hpp: *L*
test11.cpp: *L*
test12.cpp: *L*
test13.cpp: *L*
test2.cpp: *L*
test2.hpp: *L*
test21.cpp: *L*
test22.cpp: *L*
test23.cpp: *L*
test3.cpp: *L*
test3.hpp: *L*
test31.cpp: *L*
test32.cpp: *L*
test33.cpp: *L*
test4.cpp: *L*
test4.hpp: *L*
test42.cpp: *L*
test43.cpp: *L*
test5.cpp: *L*
test5.hpp: *L*
test52.cpp: *L*
test53.cpp: *L*
test6.cpp: *L*
test6.hpp: *L*
test62.cpp: *L*
test63.cpp: *L*
test7.cpp: *L*
test7.hpp: *L*
test71.cpp: *L*
test72.cpp: *L*
test73.cpp: *L*
|optional|
libs/optional/test/
Jamfile.v2: *L*
|people|
people/
paul_moore.htm: *C* *L*
vesa_karvonen.htm: *C* *L*
|program_options|
boost/program_options/detail/
utf8_codecvt_facet.hpp: *L*
libs/program_options/build/
Jamfile.v2: *C* *L*
libs/program_options/doc/
Jamfile.v2: *C* *L*
acknowledgements.xml: *C* *L*
changes.xml: *C* *L*
design.xml: *C* *L*
glossary.xml: *C* *L*
howto.xml: *C* *L*
overview.xml: *C* *L*
post_review_plan.txt: *C* *L*
todo.txt: *C* *L*
tutorial.xml: *C* *L*
libs/program_options/example/
Jamfile.v2: *C* *L*
libs/program_options/test/
Jamfile.v2: *C* *L*
program_options_size_test.py: *C* *L*
ucs2.txt: *C* *L*
utf8.txt: *C* *L*
winmain.py: *C* *L*
|property_map|
libs/property_map/
LvaluePropertyMap.html: *L*
ReadWritePropertyMap.html: *L*
ReadablePropertyMap.html: *L*
WritablePropertyMap.html: *L*
associative_property_map.html: *L*
const_assoc_property_map.html: *L*
libs/property_map/doc/
dynamic_property_map.html: *C* *L*
dynamic_property_map.rst: *C* *L*
libs/property_map/
example2.cpp: *L*
identity_property_map.html: *L*
iterator_property_map.html: *L*
property_map.html: *L*
vector_property_map.html: *L*
|ptr_container|
libs/ptr_container/doc/
default.css: *L*
intro.xml: *C* *L*
ptr_container.xml: *L*
libs/ptr_container/test/
Jamfile.v2: *C* *L*
sequence_point.cpp: *C* *L*
|python|
libs/python/doc/
internals.html: *L*
internals.rst: *L*
libs/python/doc/tutorial/doc/html/python/
embedding.html: *L*
exception.html: *L*
exposing.html: *L*
functions.html: *L*
hello.html: *L*
iterators.html: *L*
object.html: *L*
techniques.html: *L*
libs/python/test/
operators_wrapper.cpp: *C* *L*
operators_wrapper.py: *C* *L*
|rational|
boost/
rational.hpp: *L*
libs/rational/
index.html: *L*
rational.html: *L*
rational_example.cpp: *L*
rational_test.cpp: *L*
|regex|
libs/regex/build/
gcc-shared.mak: *C* *L*
libs/regex/example/timer/
input_script.txt: *C* *L*
|regression|
tools/regression/build/
Jamfile.v2: *C* *L*
tools/regression/detail/
tiny_xml_test.txt: *C* *L*
tools/regression/
index.htm: *C* *L*
run_tests.sh: *C* *L*
tools/regression/test/test-cases/general/expected/
results.xml: *C* *L*
tools/regression/test/test-cases/incremental/expected/
results.xml: *C* *L*
tools/regression/test/
test.bat: *C* *L*
tools/regression/xsl_reports/
boostbook_report.py: *C* *L*
tools/regression/xsl_reports/db/
load.py: *C* *L*
test-runs.xsd: *C* *L*
tools/regression/xsl_reports/
empty_expected_results.xml: *C* *L*
tools/regression/xsl_reports/runner/
__init__.py: *C* *L*
default.css: *L*
instructions.html: *L*
instructions.rst: *C* *L*
tools/regression/xsl_reports/test/
common.py: *C* *L*
expected_results.xml: *C* *L*
generate_test_results.py: *C* *L*
generate_test_results_v1.py: *C* *L*
restrict_to_library.xsl: *C* *L*
run_notes_regression.py: *C* *L*
run_v1.py: *C* *L*
tools/regression/xsl_reports/test/test-components/
test.py: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/
compile-fail.xml: *C* *L*
completed.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/
compile-fail.xml: *C* *L*
completed.xml: *C* *L*
lib.xml: *C* *L*
misfire.xml: *C* *L*
no-run.xml: *C* *L*
run_pyd.xml: *C* *L*
test-case.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/
lib.xml: *L*
misfire.xml: *C* *L*
no-run.xml: *C* *L*
run_pyd.xml: *C* *L*
test-case.xml: *L*
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/test-components/test_re_match/expected/
test_re_match.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/expected/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_case_status/
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/expected/
a.xml: *C* *L*
tools/regression/xsl_reports/test/test-components/test_test_structure/
test-driver.xsl: *C* *L*
tools/regression/xsl_reports/test/
test.py: *C* *L*
test_boost_wide_report.py: *C* *L*
tools/regression/xsl_reports/
test_results.xsd: *C* *L*
tools/regression/xsl_reports/utils/
__init__.py: *C* *L*
accept_args.py: *C* *L*
char_translation_table.py: *C* *L*
check_existance.py: *C* *L*
checked_system.py: *C* *L*
libxslt.py: *C* *L*
log.py: *C* *L*
makedirs.py: *C* *L*
send_mail.py: *C* *L*
sourceforge.py: *C* *L*
tar.py: *C* *L*
zip.py: *C* *L*
tools/regression/xsl_reports/xsl/v2/
expected_to_1_33_format.xsl: *C* *L*
|release|
tools/release/
utils.py: *C* *L*
|serialization|
libs/serialization/doc/
style.css: *C* *L*
libs/serialization/example/
demo_output.txt: *C* *L*
demo_save.xml: *C* *L*
demofile.txt: *C* *L*
libs/serialization/test/
run_archive_test.bat: *C* *L*
runtest.bat: *C* *L*
runtest.sh: *C* *L*
libs/serialization/vc7ide/
readme.txt: *C* *L*
|signals|
libs/signals/doc/
tutorial.xml: *C* *L*
|smart_ptr|
libs/smart_ptr/
compatibility.htm: *L*
scoped_array.htm: *L*
scoped_ptr.htm: *L*
shared_array.htm: *L*
shared_ptr.htm: *L*
smart_ptr.htm: *L*
smarttests.htm: *L*
weak_ptr.htm: *L*
|test|
boost/test/utils/runtime/cla/detail/
argument_value_usage.hpp: *L*
libs/test/test/auto-link-test/
run_bjam.bat: *C* *L*
|timer|
libs/timer/
timer.htm: *L*
|tr1|
boost/tr1/
tuple.hpp: *C* *L*
|tuple|
libs/tuple/doc/
design_decisions_rationale.html: *L*
tuple_advanced_interface.html: *L*
tuple_users_guide.html: *L*
libs/tuple/test/
README: *C* *L*
|utility|
boost/
shared_container_iterator.hpp: *L*
libs/utility/
OptionalPointee.html: *L*
call_traits.htm: *L*
compressed_pair.htm: *L*
enable_if.html: *L*
libs/utility/test/
Jamfile.v2: *L*
libs/utility/
utility.htm: *L*
value_init.htm: *L*
value_init_test.cpp: *C*
value_init_test_fail1.cpp: *C*
value_init_test_fail2.cpp: *C*
value_init_test_fail3.cpp: *C*
|variant|
libs/variant/doc/
Jamfile.v2: *C* *L*
biblio.xml: *C* *L*
design.xml: *C* *L*
introduction.xml: *C* *L*
misc.xml: *C* *L*
libs/variant/doc/reference/
apply_visitor.xml: *C* *L*
bad_visit.xml: *C* *L*
concepts.xml: *C* *L*
get.xml: *C* *L*
recursive_variant.xml: *C* *L*
recursive_wrapper.xml: *C* *L*
reference.xml: *C* *L*
static_visitor.xml: *C* *L*
variant.xml: *C* *L*
variant_fwd.xml: *C* *L*
visitor_ptr.xml: *C* *L*
libs/variant/doc/tutorial/
advanced.xml: *C* *L*
basic.xml: *C* *L*
tutorial.xml: *C* *L*
libs/variant/doc/
variant.xml: *L*
libs/variant/
index.html: *C* *L*
libs/variant/test/
Jamfile.v2: *L*
1
0
Boost Inspection Report
Run Date: 16:05:14 UTC, Saturday 26 May 2007
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:
11453 files scanned
909 directories scanned (including root)
192 problems reported
Problem counts:
0 files with invalid line endings
0 bookmarks with invalid characters
3 invalid urls
101 broken links
21 unlinked files
22 file/directory names issues
1 files with tabs
9 violations of the Boost min/max guidelines
35 usages of unnamed namespaces in headers (including .ipp files)
Summary:
archive (3)
bind (1)
boost-root (1)
build (1)
date_time (1)
doc (2)
filesystem (33)
graph (2)
iostreams (2)
lambda (3)
math (8)
more (4)
mpl (4)
multi_array (2)
ptr_container (1)
python (8)
regex (1)
regression (32)
serialization (1)
test (81)
type_traits (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
|archive|
boost/archive/basic_streambuf_locale_saver.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
|bind|
boost/bind/placeholders.hpp:
*U* unnamed namespace at line 25
|boost-root|
index.htm:
*A* broken link: doc/hmtl/date_time/details.html#changes
|build|
tools/build/v2/test/test_system.html:
*A* unlinked file
|date_time|
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/jam.html:
*A* unlinked file
|filesystem|
libs/filesystem/doc/do-list.htm:
*A* invalid URL (hardwired file): file://?/
*A* invalid URL (hardwired file): file://?/UNC/
libs/filesystem/doc/i18n.html:
*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: ../build/Jamfile
*A* broken link: convenience.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#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#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
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
|graph|
libs/graph/example/file_dependencies.cpp:
*M* violation of Boost min/max guidelines on line 139
libs/graph/test/serialize.cpp:
*T*
|iostreams|
libs/iostreams/doc/concepts/multi-character.html:
*A* unlinked file
libs/iostreams/doc/installation.html:
*A* broken link: ../../../tools/build/v1/build_system.htm
|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
|math|
libs/math/test/common_factor_test.cpp:
*M* violation of Boost min/max guidelines on line 146
*M* violation of Boost min/max guidelines on line 147
*M* violation of Boost min/max guidelines on line 193
*M* violation of Boost min/max guidelines on line 194
|more|
more/cvs.html:
*A* unlinked file
more/getting_started/unix-variants.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/getting_started/windows.html:
*A* broken link: ../../doc/html/thread/build.html#thread.build
more/separate_compilation.html:
*A* broken link: ../libs/config/test/link/test/Jamfile.v2
|mpl|
boost/mpl/alias.hpp:
*U* unnamed namespace at line 17
libs/mpl/doc/refmanual/for-each.html:
*A* broken link: ./value-initialized.html
|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
|ptr_container|
libs/ptr_container/doc/tutorial_example.html:
*A* unlinked file
|python|
libs/python/doc/building.html:
*A* broken link: ../index.htm
libs/python/doc/tutorial/doc/html/python/hello.html:
*A* broken link: ../../../../../example/tutorial/Jamrules
libs/python/doc/tutorial/index.html:
*A* broken link: ../../../LICENSE_1_0.txt
libs/python/doc/v2/May2002.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
*A* broken link: ../../../../tools/build/v1/gen_aix_import_file.py
libs/python/doc/v2/faq.html:
*A* broken link: ../../../../tools/build/v1/build_system.htm
|regex|
libs/regex/performance/input.html:
*A* unlinked file
|regression|
regression/.htaccess:
*N* leading character of ".htaccess" is not alphabetic
tools/regression/test/test-cases/incremental/bjam.log.1:
*N* name contains more than one dot character ('.')
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
*N* name contains more than one dot character ('.')
*N* name exceeds 31 characters
tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test:
*N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/
*N* name contains more than one dot character ('.')
*N* name exceeds 31 characters
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/src/basic_xml_grammar.ipp:
*U* unnamed namespace at line 43
|test|
boost/test/floating_point_comparison.hpp:
*U* unnamed namespace at line 206
*U* unnamed namespace at line 228
boost/test/impl/cpp_main.ipp:
*U* unnamed namespace at line 42
boost/test/impl/exception_safety.ipp:
*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 262
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 52
*U* unnamed namespace at line 61
libs/test/build/msvc71_proj/config_file_iterator_test.vcproj:
*N* name exceeds 31 characters
libs/test/doc/components/prg_exec_monitor/compilation.html:
*A* broken link: ../../../build/Jamfile
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/compilation.html:
*A* broken link: ../../../build/Jamfile
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
|type_traits|
libs/type_traits/cxx_type_traits.htm:
*A* unlinked file
1
0
Troy, Doug, and others,
I just moved the boost/sandbox/troy subdir to
boost/sandbox-branches/troy. This was to fix two problems:
a) That dir has svn externals which point to the dev/write side of the
svn repo. This makes it impossible for read-only checkouts to work as it
asks for user name and password as soon as it hits those externals.
b) It's a very large tree containing multiple "copies" of the 1.34.0
sources. I know copies are a "cheap" operation on SVN, but they are not
cheap operations on users hard drives. (In my personal case svn ends up
having memory failures as it tries to do the checkout, and leads to
corrupt partial checkouts, and corrupt a file system.)
My suggestion is to restrict to putting library projects only in the
boost/sandbox dir. And under no circumstances use externals. They just
don't seem to work as one might expect.
--
-- 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
12
43
Boost Regression test failures
Report time: 2007-05-23T23:21:36Z
This report lists all regression test failures on release platforms.
Detailed report:
http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/iā¦
184 failures in 5 libraries
functional/hash (72)
multi_index (48)
test (11)
tr1 (52)
utility (1)
|functional/hash|
books: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_built_in_array_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_custom_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_deque_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_float_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_friend_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_function_pointer_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_fwd_test_1: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_global_namespace_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_list_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_map_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_no_ext_macro_1: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_no_ext_macro_2: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_number_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_pointer_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_range_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_set_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_string_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_value_array_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
hash_vector_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
link_ext_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
link_test: cw-9.4 intel-vc71-win-9.1 msvc-8.0
point: cw-9.4 intel-vc71-win-9.1 msvc-8.0
portable: cw-9.4 intel-vc71-win-9.1 msvc-8.0
|multi_index|
test_basic: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_capacity: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_comparison: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_composite_key: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_conv_iterators: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_copy_assignment: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_hash_ops: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_iterators: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_modifiers: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_observers: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_projection: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_safe_mode: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_serialization: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_set_ops: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_special_set_ops: cw-9.4 intel-vc71-win-9.1 msvc-8.0
test_update: cw-9.4 intel-vc71-win-9.1 msvc-8.0
|test|
boost_check_equal_str: cw-9.4
errors_handling_test: cw-9.4
fixed_mapping_test: cw-9.4
ifstream_line_iterator_test: cw-9.4
online_test: cw-9.4
output_test_stream_test: cw-9.4
parameterized_test_test: cw-9.4
result_report_test: cw-9.4
test_case_template_test: cw-9.4
test_fp_comparisons: cw-9.4
token_iterator_test: cw-9.4
|tr1|
std_run_complex_overloads: intel-vc71-win-9.1 msvc-8.0
std_run_random: intel-vc71-win-9.1 msvc-8.0
std_test_bind: intel-vc71-win-9.1 msvc-8.0
std_test_function: intel-vc71-win-9.1 msvc-8.0
std_test_hash: intel-vc71-win-9.1 msvc-8.0
std_test_hash_header: intel-vc71-win-9.1 msvc-8.0
std_test_mem_fn: intel-vc71-win-9.1 msvc-8.0
std_test_reference_wrapper: intel-vc71-win-9.1 msvc-8.0
std_test_regex: intel-vc71-win-9.1 msvc-8.0
std_test_result_of: intel-vc71-win-9.1 msvc-8.0
std_test_shared_array_header: intel-vc71-win-9.1 msvc-8.0
std_test_shared_ptr_header: intel-vc71-win-9.1 msvc-8.0
std_test_tr1_include: intel-vc71-win-9.1 msvc-8.0
std_test_tuple: intel-vc71-win-9.1 msvc-8.0
std_test_tuple_tricky: intel-vc71-win-9.1 msvc-8.0
test_bind: intel-vc71-win-9.1 msvc-8.0
test_function: intel-vc71-win-9.1 msvc-8.0
test_functional_std_header: intel-vc71-win-9.1 msvc-8.0
test_hash: intel-vc71-win-9.1 msvc-8.0
test_hash_header: intel-vc71-win-9.1 msvc-8.0
test_mem_fn: intel-vc71-win-9.1 msvc-8.0
test_reference_wrapper: intel-vc71-win-9.1 msvc-8.0
test_result_of: intel-vc71-win-9.1 msvc-8.0
test_tr1_include: intel-vc71-win-9.1 msvc-8.0
test_tuple: intel-vc71-win-9.1 msvc-8.0
test_tuple_tricky: intel-vc71-win-9.1 msvc-8.0
|utility|
binary_search_test: cw-9.4
2
1
I have seen several discussions regarding adding a small
typeid/type_info library similar to
the one introduced by Alexandrescu in Modern C++ Design.
Has there been any progress on this issue?
see:
http://lists.boost.org/Archives/boost/2005/02/80969.php
Best Regards, Johan Torp
2
2