Boost
Threads by month
- ----- 2026 -----
- October
- September
- August
- July
- June
- May
- April
- March
- February
- January
- ----- 2025 -----
- December
- November
- October
- September
- August
- 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
- 6 participants
- 33414 discussions
The proposed library by "Emil Dotchevski" needs a review manager.
The library is available here:
http://www.revergestudios.com/boost-exception/boost-exception.zip
The library is well documented, with samples and is packaged in the
boost folder structure. I havn't compiled the samples, but the
library appears to well done. I'm not an expert in exception handling
beyond having used "std::exception". However, This library appears
to be an interesting extension to the standard library and worthy of
consideration as a "boost" library
If no one volunteers to be the "review manager" within the next couple
of weeks, I'll volunteer and put it up for review in august.
This library has been in the reivew queue for at least nine months.
Thanks to the "Emil" for being patient.
I copied an interesting "snippit" from the libraries documentation.
<snippit>
Why bother with Boost Exception? When I design my exception class
hierarchy, I can ensure that the types I throw can pack all the
information available when I throw; I don't need boost::exception for
that.
The problem is that exceptions are caught by the client code, and
you (the designer of the library that throws exceptions) cannot always
provide all the information that is necessary to format a meaningful
message for the user. Consider this Boost Exception usage:
#include <boost/exception.hpp>
#include <string>
#include <stdio.h>
class error: public boost::exception, public std::exception { };
class io_error: public error { };
class file_open_error: public io_error { };
class file_read_error: public io_error { };
class file_write_error: public io_error { };
struct tag_io_source_name: boost::error_info_value<std::string> { };
struct tag_io_destination_name: boost::error_info_value<std::string> { };
//Throws file_open_error.
boost::shared_ptr<FILE> file_open( char const * name, char const * mode );
//Throws file_read_error, file_write_error.
void copy_content( FILE * source, FILE * destination );
void copy_file( char const * source, char const * destination )
{
boost::shared_ptr<FILE> f1 = file_open(source,"rb");
boost::shared_ptr<FILE> f2 = file_open(destination,"wb");
try
{
copy_content( f1.get(), f2.get() );
}
catch( boost::exception & x )
{
x <<
boost::error_info<tag_io_source_name>(source) <<
boost::error_info<tag_io_destination_name>(destination);
throw;
}
}
</snippit>
1
0
Hi,
When I call erase on a shmem map it doesn't seem to be removing the item. Has
anyone else experienced this?
1
1
Boost Inspection Report
Run Date: 16:28:29 UTC, Sunday 15 July 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:
14469 files scanned
1290 directories scanned (including root)
2658 problems reported
Problem counts:
1766 files missing Boost license info or having wrong reference text
892 files missing copyright notice
Summary:
algorithm (1)
any (1)
archive (1)
asio (8)
assign (4)
bimap (43)
build (68)
concept_check (22)
config (6)
conversion (6)
disjoint_sets (2)
doc (54)
dynamic_bitset (4)
filesystem (4)
format (2)
function (15)
function_types (13)
fusion (289)
gil (36)
graph (178)
inspect (1)
integer (6)
interprocess (10)
intrusive (6)
iterator (36)
lambda (10)
libs (6)
litre (4)
logic (2)
math (13)
more (11)
mpi (2)
mpl (926)
multi_array (14)
numeric (201)
optional (16)
people (4)
program_options (41)
property_map (15)
property_tree (20)
ptr_container (110)
python (14)
quickbook (20)
range (18)
rational (5)
regex (185)
regression (84)
release (2)
serialization (16)
signals (28)
smart_ptr (1)
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*
hooking_information.html: *L*
the_collection_of_relations_type.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*
|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/doc/html/boost_config/
acknowledgements.html: *L*
boost_macro_reference.html: *L*
guidelines_for_boost_authors.html: *L*
rationale.html: *L*
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: *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|
boost/fusion/algorithm/iteration/detail/
fold.hpp: *C* *L*
boost/fusion/support/
void.hpp: *C* *L*
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/
index.html: *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/doc/html/boost_numericconversion/
bounds___traits_class.html: *L*
conversion_traits___traits_class.html: *L*
converter___function_object.html: *L*
definitions.html: *L*
improved_numeric_cast__.html: *L*
numeric_converter_policy_classes.html: *L*
type_requirements_and_user_defined_types_support.html: *L*
libs/numeric/conversion/doc/html/numeric_conversion/
bibliography.html: *L*
history_and_acknowledgments.html: *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/doc/html/boost_optional/
a_note_about_optional_bool_.html: *L*
acknowledgments.html: *L*
dependencies_and_portability.html: *L*
detailed_semantics.html: *L*
development.html: *L*
examples.html: *L*
exception_safety_guarantees.html: *L*
implementation_notes.html: *L*
in_place_factories.html: *L*
optional_references.html: *L*
rebinding_semantics_for_assignment_of_optional_references.html: *L*
synopsis.html: *L*
type_requirements.html: *L*
libs/optional/doc/
special_cases.qbk: *C* *L*
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/
kde_support.html: *L*
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/doc/
acknowledgements.qbk: *C* *L*
bad_expression.qbk: *C* *L*
basic_regex.qbk: *C* *L*
captures.qbk: *C* *L*
character_class_names.qbk: *C* *L*
collating_names.qbk: *C* *L*
concepts.qbk: *C* *L*
configuration.qbk: *C* *L*
error_type.qbk: *C* *L*
examples.qbk: *C* *L*
faq.qbk: *C* *L*
format_boost_syntax.qbk: *C* *L*
format_perl_syntax.qbk: *C* *L*
format_sed_syntax.qbk: *C* *L*
format_syntax.qbk: *C* *L*
further_info.qbk: *C* *L*
headers.qbk: *C* *L*
history.qbk: *C* *L*
libs/regex/doc/html/boost_regex/
background_information.html: *L*
libs/regex/doc/html/boost_regex/background_information/
acknowledgements.html: *L*
examples.html: *L*
faq.html: *L*
futher.html: *L*
headers.html: *L*
history.html: *L*
locale.html: *L*
performance.html: *L*
redist.html: *L*
standards.html: *L*
thread_safety.html: *L*
libs/regex/doc/html/boost_regex/
captures.html: *L*
configuration.html: *L*
libs/regex/doc/html/boost_regex/configuration/
algorithm.html: *L*
compiler.html: *L*
linkage.html: *L*
locale.html: *L*
tuning.html: *L*
libs/regex/doc/html/boost_regex/
format.html: *L*
libs/regex/doc/html/boost_regex/format/
boost_format_syntax.html: *L*
perl_format.html: *L*
sed_format.html: *L*
libs/regex/doc/html/boost_regex/
install.html: *L*
introduction_and_overview.html: *L*
partial_matches.html: *L*
ref.html: *L*
libs/regex/doc/html/boost_regex/ref/
bad_expression.html: *L*
basic_regex.html: *L*
concepts.html: *L*
libs/regex/doc/html/boost_regex/ref/concepts/
charT_concept.html: *L*
iterator_concepts.html: *L*
traits_concept.html: *L*
libs/regex/doc/html/boost_regex/ref/
deprecated_interfaces.html: *L*
libs/regex/doc/html/boost_regex/ref/deprecated_interfaces/
old_regex.html: *L*
regex_format.html: *L*
regex_grep.html: *L*
regex_split.html: *L*
libs/regex/doc/html/boost_regex/ref/
error_type.html: *L*
match_flag_type.html: *L*
match_results.html: *L*
non_std_strings.html: *L*
libs/regex/doc/html/boost_regex/ref/non_std_strings/
icu.html: *L*
libs/regex/doc/html/boost_regex/ref/non_std_strings/icu/
intro.html: *L*
unicode_algo.html: *L*
unicode_iter.html: *L*
unicode_types.html: *L*
libs/regex/doc/html/boost_regex/ref/non_std_strings/
mfc_strings.html: *L*
libs/regex/doc/html/boost_regex/ref/non_std_strings/mfc_strings/
mfc_algo.html: *L*
mfc_intro.html: *L*
mfc_iter.html: *L*
mfc_regex_create.html: *L*
mfc_regex_types.html: *L*
libs/regex/doc/html/boost_regex/ref/
posix.html: *L*
regex_iterator.html: *L*
regex_match.html: *L*
regex_replace.html: *L*
regex_search.html: *L*
regex_token_iterator.html: *L*
regex_traits.html: *L*
sub_match.html: *L*
syntax_option_type.html: *L*
libs/regex/doc/html/boost_regex/ref/syntax_option_type/
syntax_option_type_basic.html: *L*
syntax_option_type_extended.html: *L*
syntax_option_type_literal.html: *L*
syntax_option_type_overview.html: *L*
syntax_option_type_perl.html: *L*
syntax_option_type_synopsis.html: *L*
libs/regex/doc/html/boost_regex/
syntax.html: *L*
libs/regex/doc/html/boost_regex/syntax/
basic_extended.html: *L*
basic_syntax.html: *L*
character_classes.html: *L*
libs/regex/doc/html/boost_regex/syntax/character_classes/
optional_char_class_names.html: *L*
std_char_clases.html: *L*
libs/regex/doc/html/boost_regex/syntax/
collating_names.html: *L*
libs/regex/doc/html/boost_regex/syntax/collating_names/
digraphs.html: *L*
named_unicode.html: *L*
posix_symbolic_names.html: *L*
libs/regex/doc/html/boost_regex/syntax/
leftmost_longest_rule.html: *L*
perl_syntax.html: *L*
libs/regex/doc/html/boost_regex/
unicode.html: *L*
libs/regex/doc/
icu_strings.qbk: *C* *L*
install.qbk: *C* *L*
introduction.qbk: *C* *L*
leftmost_longest.qbk: *C* *L*
locale.qbk: *C* *L*
match_flag_type.qbk: *C* *L*
match_result.qbk: *C* *L*
mfc_strings.qbk: *C* *L*
non_std_strings.qbk: *C* *L*
old_regex.qbk: *C* *L*
partial_matches.qbk: *C* *L*
performance.qbk: *C* *L*
posix_api.qbk: *C* *L*
redistributables.qbk: *C* *L*
regex_format.qbk: *C* *L*
regex_grep.qbk: *C* *L*
regex_iterator.qbk: *C* *L*
regex_match.qbk: *C* *L*
regex_replace.qbk: *C* *L*
regex_search.qbk: *C* *L*
regex_split.qbk: *C* *L*
regex_token_iterator.qbk: *C* *L*
regex_traits.qbk: *C* *L*
standards.qbk: *C* *L*
sub_match.qbk: *C* *L*
syntax.qbk: *C* *L*
syntax_basic.qbk: *C* *L*
syntax_extended.qbk: *C* *L*
syntax_option_type.qbk: *C* *L*
syntax_perl.qbk: *C* *L*
thread_safety.qbk: *C* *L*
unicode.qbk: *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/
smarttests.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:28:19 UTC, Sunday 15 July 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:
14469 files scanned
1290 directories scanned (including root)
954 problems reported
Problem counts:
1 files with invalid line endings
0 bookmarks with invalid characters
3 invalid urls
630 broken links
29 unlinked files
170 file/directory names issues
38 files with tabs
46 violations of the Boost min/max guidelines
37 usages of unnamed namespaces in headers (including .ipp files)
Summary:
algorithm (1)
archive (5)
asio (10)
bcp (1)
bimap (308)
bind (1)
boost-root (1)
build (1)
config (1)
conversion (10)
date_time (5)
doc (2)
dynamic_bitset (1)
filesystem (6)
function_types (2)
fusion (39)
graph (6)
integer (1)
interprocess (47)
intrusive (1)
iostreams (2)
iterator (1)
lambda (3)
math (8)
more (12)
mpi (8)
mpl (1)
multi_array (2)
numeric (165)
optional (105)
pending (1)
program_options (1)
property_tree (23)
python (9)
quickbook (26)
random (2)
rational (8)
regex (5)
regression (14)
serialization (4)
system (4)
test (80)
thread (2)
tr1 (1)
type_traits (1)
utility (1)
xpressive (16)
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
|bcp|
tools/bcp/bcp.html:
*A* broken link: ../../libs/regex/doc/uarrow.gif
|bimap|
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/detail/set_view_base.hpp:
*T*
boost/bimap/list_of.hpp:
*T*
boost/bimap/multiset_of.hpp:
*T*
boost/bimap/set_of.hpp:
*T*
boost/bimap/support/lambda.hpp:
*U* unnamed namespace at line 26
boost/bimap/unconstrained_set_of.hpp:
*T*
boost/bimap/unordered_multiset_of.hpp:
*T*
boost/bimap/unordered_set_of.hpp:
*T*
boost/bimap/vector_of.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
*A* broken link: the_tutorial/additional_information.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: ../images/bimap/relation.and.pair.png
*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
*A* broken link: the_tutorial/additional_information.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
*A* broken link: additional_information.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: ../../images/bimap/relation.and.pair.png
*A* broken link: ../../libraries.html
*N* name exceeds 31 characters
libs/bimap/doc/html/boost_bimap/the_tutorial/hooking_information.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/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/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
*A* broken link: additional_information.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: boost_bimap/the_tutorial/additional_information.html
*A* broken link: libraries.html
libs/bimap/example/user_defined_names.cpp:
*T*
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
|config|
libs/config/doc/html/boost_config/guidelines_for_boost_authors.html:
*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/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/doc/html/fusion/algorithms/iteration/functions/for_each.html:
*A* broken link: ../../../functional/concepts/reg_callable.html
libs/fusion/doc/html/fusion/functional.html:
*A* broken link: functional/concepts/reg_callable.html
libs/fusion/doc/html/fusion/functional/concepts.html:
*A* broken link: concepts/reg_callable.html
libs/fusion/doc/html/fusion/functional/concepts/callable.html:
*A* broken link: reg_callable.html
libs/fusion/doc/html/fusion/functional/concepts/def_callable.html:
*A* broken link: reg_callable.html
libs/fusion/doc/html/fusion/functional/concepts/poly.html:
*A* broken link: reg_callable.html
libs/fusion/doc/html/fusion/sequences/conversion.html:
*A* broken link: generation/metafunctions/map_tie.html
libs/fusion/doc/html/fusion/sequences/generation.html:
*A* broken link: intrinsics/metafunctions/swap.html
libs/fusion/doc/html/fusion/sequences/generation/functions.html:
*A* broken link: functions/map_tie.html
libs/fusion/doc/html/fusion/sequences/generation/functions/vector_tie.html:
*A* broken link: map_tie.html
libs/fusion/doc/html/fusion/sequences/generation/metafunctions.html:
*A* broken link: functions/map_tie.html
*A* broken link: metafunctions/map_tie.html
libs/fusion/doc/html/fusion/sequences/generation/metafunctions/vector_tie.html:
*A* broken link: map_tie.html
libs/fusion/doc/html/fusion/sequences/intrinsics/functions.html:
*A* broken link: functions/swap.html
libs/fusion/doc/html/fusion/sequences/intrinsics/functions/at_key.html:
*A* broken link: swap.html
libs/fusion/doc/html/fusion/sequences/intrinsics/metafunctions.html:
*A* broken link: functions/swap.html
*A* broken link: metafunctions/swap.html
libs/fusion/doc/html/fusion/sequences/intrinsics/metafunctions/value_at_key.html:
*A* broken link: swap.html
libs/fusion/doc/html/index.html:
*A* broken link: fusion/functional/concepts/reg_callable.html
|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/containers/string.hpp:
*T*
boost/interprocess/containers/vector.hpp:
*T*
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/interprocess.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
|intrusive|
libs/intrusive/index.html:
*A* broken link: ../../doc/html/intrusive
|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: ../libs/regex/doc/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/doc/html/boost_numericconversion/bounds___traits_class.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: ../images/home.png
*A* broken link: ../images/next.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/up.png
*A* broken link: ../libraries.html
libs/numeric/conversion/doc/html/boost_numericconversion/conversion_traits___traits_class.html:
*A* broken link: ../../../../../mpl/refmanual/integral-constant.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: ../images/home.png
*A* broken link: ../images/next.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/up.png
*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/numeric/conversion/doc/html/boost_numericconversion/converter___function_object.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: ../images/home.png
*A* broken link: ../images/next.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/space.png
*A* broken link: ../images/up.png
*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/numeric/conversion/doc/html/boost_numericconversion/definitions.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: ../images/home.png
*A* broken link: ../images/next.png
*A* broken link: ../images/note.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/space.png
*A* broken link: ../images/up.png
*A* broken link: ../libraries.html
libs/numeric/conversion/doc/html/boost_numericconversion/improved_numeric_cast__.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: ../images/home.png
*A* broken link: ../images/next.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/up.png
*A* broken link: ../libraries.html
libs/numeric/conversion/doc/html/boost_numericconversion/numeric_converter_policy_classes.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: ../images/home.png
*A* broken link: ../images/important.png
*A* broken link: ../images/next.png
*A* broken link: ../images/note.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/up.png
*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/numeric/conversion/doc/html/boost_numericconversion/type_requirements_and_user_defined_types_support.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: ../images/home.png
*A* broken link: ../images/next.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/up.png
*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/numeric/conversion/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: images/next.png
*A* broken link: libraries.html
libs/numeric/conversion/doc/html/numeric_conversion/bibliography.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: ../images/home.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/up.png
*A* broken link: ../libraries.html
libs/numeric/conversion/doc/html/numeric_conversion/history_and_acknowledgments.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: ../images/home.png
*A* broken link: ../images/next.png
*A* broken link: ../images/prev.png
*A* broken link: ../images/up.png
*A* broken link: ../libraries.html
*N* name exceeds 31 characters
libs/numeric/conversion/index.html:
*A* broken link: ../../LICENSE_1_0.txt
libs/numeric/ublas/test/manual/sp_resize.cpp:
*T*
|optional|
libs/optional/doc/html/boost_optional/a_note_about_optional_bool_.html:
*A* broken link: ../../../../tribool/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
*N* name exceeds 31 characters
libs/optional/doc/html/boost_optional/acknowledgments.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/optional/doc/html/boost_optional/dependencies_and_portability.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/optional/doc/html/boost_optional/detailed_semantics.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/optional/doc/html/boost_optional/development.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/optional/doc/html/boost_optional/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/optional/doc/html/boost_optional/exception_safety_guarantees.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/optional/doc/html/boost_optional/implementation_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/optional/doc/html/boost_optional/in_place_factories.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/optional/doc/html/boost_optional/optional_references.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/optional/doc/html/boost_optional/rebinding_semantics_for_assignment_of_optional_references.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/optional/doc/html/boost_optional/synopsis.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/optional/doc/html/boost_optional/type_requirements.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/optional/doc/html/images/callouts/1.png:
*N* leading character of "1.png" is not alphabetic
libs/optional/doc/html/images/callouts/10.png:
*N* leading character of "10.png" is not alphabetic
libs/optional/doc/html/images/callouts/11.png:
*N* leading character of "11.png" is not alphabetic
libs/optional/doc/html/images/callouts/12.png:
*N* leading character of "12.png" is not alphabetic
libs/optional/doc/html/images/callouts/13.png:
*N* leading character of "13.png" is not alphabetic
libs/optional/doc/html/images/callouts/14.png:
*N* leading character of "14.png" is not alphabetic
libs/optional/doc/html/images/callouts/15.png:
*N* leading character of "15.png" is not alphabetic
libs/optional/doc/html/images/callouts/2.png:
*N* leading character of "2.png" is not alphabetic
libs/optional/doc/html/images/callouts/3.png:
*N* leading character of "3.png" is not alphabetic
libs/optional/doc/html/images/callouts/4.png:
*N* leading character of "4.png" is not alphabetic
libs/optional/doc/html/images/callouts/5.png:
*N* leading character of "5.png" is not alphabetic
libs/optional/doc/html/images/callouts/6.png:
*N* leading character of "6.png" is not alphabetic
libs/optional/doc/html/images/callouts/7.png:
*N* leading character of "7.png" is not alphabetic
libs/optional/doc/html/images/callouts/8.png:
*N* leading character of "8.png" is not alphabetic
libs/optional/doc/html/images/callouts/9.png:
*N* leading character of "9.png" is not alphabetic
libs/optional/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
|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/images/extra/katepart/boost.hs.logo.png:
*N* name contains more than one dot character ('.')
tools/quickbook/doc/html/images/extra/katepart/table.boost.hs.png:
*N* name contains more than one dot character ('.')
tools/quickbook/doc/html/images/extra/katepart/table.text.editor.png:
*N* name contains more than one dot character ('.')
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/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_extended.html:
*N* name exceeds 31 characters
libs/regex/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_overview.html:
*N* name exceeds 31 characters
libs/regex/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_synopsis.html:
*N* name exceeds 31 characters
libs/regex/doc/index.html:
*A* broken link: ../../LICENSE_1_0.txt
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*
|xpressive|
libs/xpressive/proto/doc/html/images/callouts/1.png:
*N* leading character of "1.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/10.png:
*N* leading character of "10.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/11.png:
*N* leading character of "11.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/12.png:
*N* leading character of "12.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/13.png:
*N* leading character of "13.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/14.png:
*N* leading character of "14.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/15.png:
*N* leading character of "15.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/2.png:
*N* leading character of "2.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/3.png:
*N* leading character of "3.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/4.png:
*N* leading character of "4.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/5.png:
*N* leading character of "5.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/6.png:
*N* leading character of "6.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/7.png:
*N* leading character of "7.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/8.png:
*N* leading character of "8.png" is not alphabetic
libs/xpressive/proto/doc/html/images/callouts/9.png:
*N* leading character of "9.png" is not alphabetic
libs/xpressive/test/test_symbols.cpp:
*T*
1
0
Boost Inspection Report
Run Date: 16:13:06 UTC, Sunday 15 July 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:
11452 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:13:00 UTC, Sunday 15 July 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:
11452 files scanned
909 directories scanned (including root)
162 problems reported
Problem counts:
0 files with invalid line endings
0 bookmarks with invalid characters
3 invalid urls
70 broken links
21 unlinked files
22 file/directory names issues
2 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)
build (1)
date_time (1)
doc (2)
filesystem (3)
graph (3)
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
|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/tr2_proposal.html:
*A* invalid URL (hardwired file): file:///C|/boost/site/libs/filesystem/doc/operations.htm#complete_note
|graph|
boost/graph/relax.hpp:
*T*
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-07-15T04:05:30Z
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…
No failures! Yay!
1
0
Boost Regression test failures
Report time: 2007-07-14T18:28:24Z
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…
No failures! Yay!
1
0
On Mon, 11 Jun 2007, Jake Voytko wrote
>In a paper(http://goanna.cs.rmit.edu.au/~jz/fulltext/acsc03sz.pdf
<http://goanna.cs.rmit.edu.au/%7Ejz/fulltext/acsc03sz.pdf>), the
>creators say that it is essentially a most-significant-digit radix sort,
but
>that the implementation of the radix-sort is based on a "burst trie" (
>http://goanna.cs.rmit.edu.au/~jz/fulltext/acmtois02.pdf<http://goanna.cs.rmit.edu.au/%7Ejz/fulltext/acmtois02.pdf>)
instead of a tree.
>As far as novelty goes I'm not going to make a call, but the sorting method
>itself is old, and the data structure it sits on is designed to quickly
>process strings.
>
>Jake
>
>On 6/11/07, Michael Marcin <mmarcin(a)method-solutions.com > wrote:
>> A while ago there was talk of a sorting library on this list.
>>
>> I just ran across:
>>
>> http://sourceforge.net/projects/burstsort/
>>
>> Anyone know if this is truly a novel algorithm?
>> This implementation is GPL'ed which makes it pretty useless to me.
>> If it really is good perhaps someone could provide a Boost
implementation.
>>
>> Thanks,
>>
>> Michael Marcin
>>
>>
>>
>>
I began the sorting library, and one of the functions in the library,
multikey quicksort, is very good for sorting arrrays of strings and probably
has better worst and best case time than burstsort time if it is true that
burstsort is an MSD radix sort. This is because multikey quicksort is a
variation of MSD radix sort that does not waste time on empty buckets,
unlike traditional MSD radix sort. See Algorithms in C++, third edition, for
a much more detailed explanation of multikey quicksort (in the book it is
called three way radix quicksort). Also, I have improved the library, and
will post new code as soon as possible.
1
0
Eric,
Several newbie questions here.
I'm trying to understand how the proto::arg transform works.
Looking at the Mixed example, I see this:
template<typename Grammar>
struct begin
: Grammar
{
template<typename Expr, typename State, typename Visitor>
struct apply
: proto::terminal<
iterator_wrapper<
typename proto::result_of::arg<Expr>::type::const_iterator
>
>
{};
template<typename Expr, typename State, typename Visitor>
static typename apply<Expr, State, Visitor>::type
call(Expr const &expr, State const &state, Visitor &visitor)
{
return proto::as_expr(cbegin(proto::arg(expr)));
}
};
Not knowing exactly what cbegin does, I think this makes sense to me.
Given a grammar like this:
// Here is the grammar for if_ statements
// matches if_(e1)[e2]
struct IfGrammar
: boost::proto::subscript<
boost::proto::unary_expr<
tag::If,
ExpressionGrammar
>,
StatementGrammar
> {};
I want to create an AST node representing the statement. So I wrote a
custom transform like this:
// Transform a two-operand node
template<typename Grammar, typename NodeType>
struct ConstructBinaryLeftNested {
: Grammar {
template<typename Expr, typename State, typename Visitor>
struct apply {
typedef typename Ptr<NodeType>::type type;
};
template<typename Expr, typename State, typename Visitor>
static typename apply<Expr, State, Visitor>::type
call(Expr const &expr, State const &state, Visitor &visitor) {
return(new typename apply<Expr, State, Visitor>::type(
Grammar::call(proto::arg(proto::left(expr)),state,visitor),
Grammar::call(proto::right(expr),state,visitor)));
}
}
}
And use it like this:
struct StatementGrammar
: boost::proto::or<
ConstructBinaryLeftNested<IfGrammar, IfStatement>, ...
Essentially, I want to generate code like this:
new IfStatement(
transformed arg of unary_expr, // The condition
transformed arg of subscript); // The statement block
So several questions arise:
- Is this use of arg/left allowed and correct?
- If not, do I have to use identity instead to pass up the grandchild?
- If not, what should I do?
Something's telling me I'm not understanding something really fundamental.
In particular, I don't understand the use of arg in the run-time code of Mixed
vs. the use of arg as a compile-time transform.
Some annotated examples of how proto transforms work with runtime code would
be helpful. The calc transform examples are all pure compile-time code.
Also, how do I get the arity of an expression at compile time? I need to be
able to construct an AST node representing a function call which could have
any number of arguments:
struct CallGrammar
: boost::proto::function<ExpressionGrammar,
boost::proto::vararg<ExpressionGrammar> > {};
I need a transform that looks something like this:
// Transform an n-ary node
template<typename Grammar, typename NodeType>
struct ConstructNary {
: Grammar {
template<typename Expr, typename State, typename Visitor>
struct apply {
typedef typename Ptr<NodeType>::type type;
};
template<typename Expr, typename State, typename Visitor>
static typename apply<Expr, State, Visitor>::type
call(Expr const &expr, State const &state, Visitor &visitor) {
func = new typename apply<Expr, State, Visitor>::type(
// Function name
Grammar::call(proto::arg<0>(expr),state,visitor));
// Generate func->addArgument(arg<i>(expr)) for each child
ct_for<numargs(expr)-1>::exec(expr, func);
return(func);
}
}
}
Does this make sense? Is it possible?
Thanks for your help.
-Dave
2
4