- Boost - lists.boost.org

Boost regression notification (2006-11-09 [RC_1_34_0])
by Douglas Gregor 09 Nov '06

09 Nov '06

Boost Regression test failures Report time: 2006-11-09T14:10:41Z 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… 267 failures in 28 libraries algorithm/minmax (1) algorithm/string (6) date_time (42) disjoint_sets (1) filesystem (6) foreach (1) graph (2) iostreams (37) iterator (13) math (4) mpl (59) parameter (16) program_options (7) random (2) range (8) rational (1) regex (2) serialization (14) signals (5) spirit (1) statechart (4) test (3) thread (1) tokenizer (6) tr1 (14) utility (2) variant (8) xpressive (1) |algorithm/minmax| minmax_element: borland-5.8.2 |algorithm/string| conv: borland-5.8.2 find: borland-5.8.2 join: borland-5.8.2 predicate: borland-5.8.2 replace: borland-5.8.2 split: borland-5.8.2 |date_time| testc_local_adjustor: borland-5.8.2 testclock: borland-5.8.2 testcustom_time_zone: borland-5.8.2 testdate: borland-5.8.2 testdate_dll: borland-5.8.2 testdate_duration: borland-5.8.2 testdate_duration_dll: borland-5.8.2 testdate_input_facet: borland-5.8.2 testdate_input_facet_dll: borland-5.8.2 testdate_iterator: borland-5.8.2 testdate_iterator_dll: borland-5.8.2 testdst_rules: borland-5.8.2 testdst_transition_day_rule: borland-5.8.2 testduration: borland-5.8.2 testfiletime_functions: borland-5.8.2 testformatters: borland-5.8.2 testformatters_dll: borland-5.8.2 testgenerators: borland-5.8.2 testgenerators_dll: borland-5.8.2 testgreg_duration_operators: borland-5.8.2 testgreg_durations: borland-5.8.2 testgreg_durations_dll: borland-5.8.2 testgreg_serialize: borland-5.8.2 testgreg_serialize_dll: borland-5.8.2 testgreg_serialize_xml: borland-5.8.2 testiterator: borland-5.8.2 testlocal_adjustor: borland-5.8.2 testmicrosec_time_clock: borland-5.8.2 testparse_time: borland-5.8.2 testperiod: borland-5.8.2 testperiod_dll: borland-5.8.2 testposix_time_zone: borland-5.8.2 testtime: borland-5.8.2 testtime_formatters: borland-5.8.2 testtime_period: borland-5.8.2 testtime_serialize: borland-5.8.2 testtime_serialize_std_config: borland-5.8.2 testtime_serialize_xml: borland-5.8.2 testtime_serialize_xml_std_config: borland-5.8.2 testtz_database: borland-5.8.2 testwcustom_time_zone: borland-5.8.2 testwposix_time_zone: borland-5.8.2 |disjoint_sets| disjoint_set_test: borland-5.8.2 |filesystem| convenience_test: borland-5.8.2 fstream_test: borland-5.8.2 large_file_support_test: borland-5.8.2 operations_test: borland-5.8.2 path_test: borland-5.8.2 simple_ls: borland-5.8.2 |foreach| noncopyable: borland-5.8.2 |graph| adj_list_cc: qcc-3.3.5_gpp king_ordering: gcc-3.4.5_linux |iostreams| array_test: borland-5.8.2 auto_close_test: borland-5.8.2 buffer_size_test: borland-5.8.2 bzip2_test: msvc-7.1 msvc-8.0 code_converter_test: borland-5.8.2 component_access_test: borland-5.8.2 compose_test: borland-5.8.2 copy_test: borland-5.8.2 counter_test: borland-5.8.2 direct_adapter_test: borland-5.8.2 example_test: borland-5.8.2 file_descriptor_test: borland-5.8.2 cw-9.4 file_test: borland-5.8.2 filtering_stream_test: borland-5.8.2 finite_state_filter_test: cw-9.4 flush_test: borland-5.8.2 gzip_test: msvc-7.1 msvc-8.0 invert_test: borland-5.8.2 line_filter_test: borland-5.8.2 mapped_file_test: borland-5.8.2 cw-9.4 newline_test: borland-5.8.2 null_test: borland-5.8.2 pipeline_test: borland-5.8.2 regex_filter_test: borland-5.8.2 restrict_test: borland-5.8.2 seekable_file_test: borland-5.8.2 seekable_filter_test: borland-5.8.2 stdio_filter_test: borland-5.8.2 symmetric_filter_test: borland-5.8.2 tee_test: borland-5.8.2 wide_stream_test: borland-5.8.2 zlib_test: msvc-7.1 msvc-8.0 |iterator| concept_tests: borland-5.8.2 counting_iterator_test: borland-5.8.2 filter_iterator_test: borland-5.8.2 indirect_iterator_test: borland-5.8.2 interoperable: borland-5.8.2 iterator_adaptor_cc: borland-5.8.2 iterator_adaptor_test: borland-5.8.2 iterator_archetype_cc: borland-5.8.2 iterator_facade: borland-5.8.2 permutation_iterator_test: borland-5.8.2 reverse_iterator_test: borland-5.8.2 transform_iterator_test: borland-5.8.2 unit_tests: borland-5.8.2 |math| octonion_test: borland-5.8.2 quaternion_mult_incl_test: borland-5.8.2 quaternion_test: borland-5.8.2 special_functions_test: borland-5.8.2 |mpl| always: borland-5.8.2 apply_wrap: borland-5.8.2 bind: borland-5.8.2 contains: borland-5.8.2 copy: borland-5.8.2 copy_if: borland-5.8.2 count: borland-5.8.2 count_if: borland-5.8.2 deque: borland-5.8.2 distance: borland-5.8.2 equal: borland-5.8.2 erase: borland-5.8.2 erase_range: borland-5.8.2 filter_view: borland-5.8.2 find: borland-5.8.2 find_if: borland-5.8.2 fold: borland-5.8.2 for_each: borland-5.8.2 identity: borland-5.8.2 index_of: borland-5.8.2 insert: borland-5.8.2 insert_range: borland-5.8.2 int: borland-5.8.2 integral_c: borland-5.8.2 is_placeholder: borland-5.8.2 joint_view: borland-5.8.2 lambda: borland-5.8.2 lambda_args: borland-5.8.2 list: borland-5.8.2 list_c: borland-5.8.2 lower_bound: borland-5.8.2 max_element: borland-5.8.2 multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc pair_view: borland-5.8.2 partition: borland-5.8.2 pop_front: borland-5.8.2 push_front: borland-5.8.2 range_c: borland-5.8.2 remove: borland-5.8.2 remove_if: borland-5.8.2 replace: borland-5.8.2 replace_if: borland-5.8.2 reverse: borland-5.8.2 same_as: borland-5.8.2 single_view: borland-5.8.2 size: borland-5.8.2 size_t: borland-5.8.2 sort: borland-5.8.2 stable_partition: borland-5.8.2 transform: borland-5.8.2 transform_view: borland-5.8.2 unique: borland-5.8.2 unpack_args: borland-5.8.2 upper_bound: borland-5.8.2 vector: borland-5.8.2 vector_c: borland-5.8.2 |parameter| basics: borland-5.8.2 compose: borland-5.8.2 deduced: borland-5.8.2 deduced_dependent_predicate: borland-5.8.2 duplicates: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc earwicker: borland-5.8.2 efficiency: borland-5.8.2 macros: borland-5.8.2 mpl: borland-5.8.2 ntp: borland-5.8.2 preprocessor: borland-5.8.2 singular: borland-5.8.2 tutorial: borland-5.8.2 |program_options| cmdline_test_dll: cw-9.4 options_description_test_dll: cw-9.4 parsers_test_dll: cw-9.4 positional_options_test_dll: cw-9.4 unicode_test_dll: cw-9.4 variable_map_test_dll: cw-9.4 winmain_dll: cw-9.4 |random| random_demo: borland-5.8.2 random_test: intel-linux-9.0 |range| algorithm_example: borland-5.8.2 const_ranges: borland-5.8.2 extension_mechanism: borland-5.8.2 iterator_pair: borland-5.8.2 iterator_range: borland-5.8.2 reversible_range: borland-5.8.2 std_container: borland-5.8.2 sub_range: borland-5.8.2 |rational| rational_test: borland-5.8.2 |regex| concept_check: qcc-3.3.5_cpp unicode_iterator_test: borland-5.8.2 |serialization| test_codecvt_null: borland-5.8.2 test_iterators: borland-5.8.2 test_iterators_base64: borland-5.8.2 test_utf8_codecvt: borland-5.8.2 test_variant_binary_archive: borland-5.8.2 test_variant_binary_archive_dll: borland-5.8.2 test_variant_text_archive: borland-5.8.2 test_variant_text_archive_dll: borland-5.8.2 test_variant_text_warchive: borland-5.8.2 test_variant_text_warchive_dll: borland-5.8.2 test_variant_xml_archive: borland-5.8.2 test_variant_xml_archive_dll: borland-5.8.2 test_variant_xml_warchive: borland-5.8.2 test_variant_xml_warchive_dll: borland-5.8.2 |signals| dead_slot_test: borland-5.8.2 deletion_test: borland-5.8.2 ordering_test: borland-5.8.2 signal_n_test: borland-5.8.2 trackable_test: borland-5.8.2 |spirit| switch_tests_eps_default: intel-linux-9.0 |statechart| TransitionTestBoth: qcc-3.3.5_gpp qcc-3.3.5_gpp TransitionTestRelaxed: qcc-3.3.5_gpp qcc-3.3.5_gpp |test| basic_cstring_test: borland-5.8.2 ifstream_line_iterator_test: borland-5.8.2 test_case_template_test: borland-5.8.2 |thread| test_tss_lib: borland-5.8.2 |tokenizer| examples: borland-5.8.2 simple_example_1: borland-5.8.2 simple_example_2: borland-5.8.2 simple_example_3: borland-5.8.2 simple_example_4: borland-5.8.2 simple_example_5: borland-5.8.2 |tr1| std_test_tr1_include: borland-5.8.2 std_test_type_traits: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_tr1_include: borland-5.8.2 test_type_traits: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp tr1_is_abstract_test: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp |utility| operators_test: gcc-3.4.5_linux_x86_64 shared_iterator_test: borland-5.8.2 |variant| variant_comparison_test: borland-5.8.2 variant_reference_test: borland-5.8.2 variant_test2: borland-5.8.2 variant_test3: borland-5.8.2 variant_test4: borland-5.8.2 variant_test6: borland-5.8.2 variant_test7: borland-5.8.2 variant_test8: borland-5.8.2 |xpressive| c_traits: gcc-4.1.0_linux

1 0

Extension of boost::variant?
by James 09 Nov '06

09 Nov '06

All, I am interested in using boost::variant to represent various field types in a performance-critical piece of software. I need the ability to perform nontrivial operations on fields, and would like to embed the loop within the visitor portion of the code for performance reasons. As a simple example, say I have > typedef std::vector<double> A; > typedef std::vector<int> B; > typedef boost::variant< A, B, ... > FieldVariant; > > FieldVariant x, y, z; > // assign x, y ... > z = sqrt(x)+x*y+5.38*y^2.0; Here I could overload the ³+² operator for various types in the FieldVariant. The overloaded + operator would implement a binary visitor which would loop over the entries and sum them (remember that the types in the variant are vectors of objects). The same thing could be done for other operators. This is highly inefficient, however, since it requires multiple loops and multiple step assembly of z. What I would like is a way to compute ³z² in a highly efficient manner. The binary visitor does not allow this Is there a good way to extend boost::variant to support efficient operations as outlined above? James

1 0

((atomic)+(POD)+(C++)) = { atomic initialization, of static C++ objects };
by Chris Thomasson 09 Nov '06

09 Nov '06

I have posted a couple parts of a paper that will show how to realize strongly thread-safe construction and destruction of C++ objects on the fly, in multi-threaded environment. The basic technique is fairly straightforward IMHO. You can use a POD from a C API that can be made up of: extern "C" { /*-- the following types/declarations, --*/ typedef struct pod_s pod_t; typedef pod_t volatile podbase_t; typedef podbase_t *podbaseptr_t; typedef intword_t podref_t; typedef uintword_t podrefadj_t; static int pod_refadd(podbaseptr_t, podrefadj_t); static int pod_refsub(podbaseptr_t, podrefadj_t); /*-- a defeinition of the following pod_t --*/ struct pod_s { podref_t count; void *state; }; /*-- which is staticaly initialized with ---*/ #define PODINIT() {0, 0} /*-- and modified by --*/ int pod_refadd(podbaseptr_t _this, podrefadj_t count) { return /* refcount add logic */; } int pod_refsub(podbaseptr_t _this, podrefadj_t count) { return /* refcount sub logic */; } } //-- as a static member of a static C++ template -- namespace static_pod { template<typename T> struct impl { static podbase_t s_thispodbase; //-- which only has to static API functions that -- //-- operate on integer words and pointers -- static T* acquire(impl<T>*, podrefadj_t); static T* release(impl<T>*, podrefadj_t); }; //-- to its static member and type as -- template<typename T> podbase_t impl<T>::s_thispodbase = PODINIT(); template<typename T> T* impl<T>::acquire(impl<T> *_this, podrefadj_t count) { //-- the parameters for the C API -- int ret = pod_refadd(&impl<T>::s_thispodbase, count) //-- that tells us when to call into the-- if (ret) { //-- constructor logic -- } return ...; } template<typename T> void impl<T>::release(impl<T> *_this, podrefadj_t count) { int ret = pod_refsub(&impl<T>::s_thispodbase, count) if (ret) { //-- or destructor logic-- } return ...; } } of C++ objects in a multi-threaded environment. I think I solved this one. My paper will soon be updated with information on how to fully implement and use my algorithm... I can't really think of another solution that can do what this does... Humm... The paper I am working on will include implementation details' for every aspect of the algorithm. It should updated with a lot more information during the next week... Any thoughts?

1 0

[asio] Breaking changes committed to cvs HEAD
by Christopher Kohlhoff 09 Nov '06

09 Nov '06

I have just committed some asio changes to cvs HEAD that will break application code. These changes are part of what's needed to bring the interface into sync with the TR2 proposal. The big change is to the error handling classes, as described below. An async handler of the form: void my_handler(const boost::asio::error& e); becomes: void my_handler(const boost::system::error_code& e); Synchronous error handling like this: boost::asio::error e; sock.connect(ep, boost::asio::assign_error(e)); becomes: boost::system::error_code e; sock.connect(ep, e); And where previously a boost::asio::error exception was thrown, the new exception thrown is boost::system::system_error. Error constants like boost::asio::error::eof stay as they are, i.e.: void my_handler(const boost::system::error_code& e) { if (e == boost::asio::error::eof) { ... } } Programs will now need to link against the boost.system library (which is where boost::system::error_code and boost::system::system_error reside). Once I do a few more TR2-related changes I will post regenerated doxygen documentation to the vault. Stay tuned. Cheers, Chris

4 6

[mpl] patches for outdated workarounds for aCC6
by Boris Gubenko 08 Nov '06

08 Nov '06

Three mpl headers -- integral_c.hpp, integral_c_fwd.hpp and integral_wrapper.hpp -- contain outdated workarounds for HP-UX aCC. When compiled with aCC6, these workarounds are causing compilation errors because the resulting code looks like the following: template< typename T, long N > struct integral_c { //#if BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800)) static const T value = N; //#else // the correct code // static const T value = (T) N; //#endif }; enum udt_builtin_mixture_enum {}; integral_c<udt_builtin_mixture_enum, 0> x; A typical compilation error is: "../../../boost/mpl/aux_/integral_wrapper.hpp", line 45: error #2144: a value of type "long" cannot be used to initialize an entity of type "const boost::numeric::sign_mixture_enum" BOOST_STATIC_CONSTANT(AUX_WRAPPER_VALUE_TYPE, value = N); Attached patches change invocation of BOOST_WORKAROUND macro in the aforementioned mpl headers from: #if BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800)) to: #if BOOST_WORKAROUND(__HP_aCC, <= 53800) With patches below, the following tests that previously failed to compile with "error #2144", compile and pass: Library Test ------------------ --------------------- conversion numeric_cast_test numeric/conversion traits_test numeric/conversion converter_test numeric/conversion udt_support_test numeric/conversion numeric_cast_test numeric/conversion udt_example_0 python builtin_converters python vector_indexing_suite python pointer_vector xpressive regress xpressive c_traits xpressive misc1 xpressive test_dynamic xpressive multiple_defs Can the three patches below be applied to both the HEAD and the RC branch? Thanks, Boris Index: integral_c.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/mpl/integral_c.hpp,v retrieving revision 1.22 diff -r1.22 integral_c.hpp 22c22 < #if BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800)) --- > #if BOOST_WORKAROUND(__HP_aCC, <= 53800) Index: integral_c_fwd.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/mpl/integral_c_fwd.hpp,v retrieving revision 1.4 diff -r1.4 integral_c_fwd.hpp 22c22 < #if BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800)) --- > #if BOOST_WORKAROUND(__HP_aCC, <= 53800) Index: integral_wrapper.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/mpl/aux_/integral_wrapper.hpp,v retrieving revision 1.10 diff -r1.10 integral_wrapper.hpp 68c68 < || BOOST_WORKAROUND(__HP_aCC, BOOST_TESTED_AT(53800)) --- > || BOOST_WORKAROUND(__HP_aCC, <= 53800)

2 2

Re: [boost] asio & variable number of worker threads
by Christopher Kohlhoff 08 Nov '06

08 Nov '06

Hi Chris, Chris Richards <chris.richards(a)yellowfeather.co.uk> wrote: [...] > What happens is that the expection is caught in one thread, > and that thread exits gracefully, but also the handler for the > async_accpet is called with an error stating "The I/O > operation has been aborted because of either a thread exit or > an application request.", causing that thread to exit as well. Yep, that's the way it works on Windows. Overlapped I/O operations are tied to the thread that starts them, and so if that thread exits the operations are cancelled. The effect of thread-exit on asynchronous operations is deliberately specified as "implementation-defined" in asio for this reason. For portability you'll probably have to look at a different way of structuring it, e.g. an io_service with a fixed sized pool for handling I/O operations, plus an additional io_service with a variable pool for handling CPU intensive tasks. BTW, in CVS the io_service now has member functions run_one(), poll() and poll_one() in addition to run(). These might offer you an alternative way of controlling how many threads are in the pool. Cheers, Chris

1 0

Re: [boost] 2D Matrix
by james.jones＠firstinvestors.com 08 Nov '06

08 Nov '06

From: Jason Kraftcheck <kraftche(a)cae.wisc.edu> > The TVMET library seems to define implementations of every libm function for > matrices (sin, pow, etc.). It implements them by applying the equivalent scalar > function to each matrix element. This kind of stuff results in a lot of noise > in the library, is unlikely to be very useful, and the theoretical meaning of > these operations is dubious. For example, mathematically, pow( M, 3 ) for a > matrix M means M * M * M, which is not the same as cubing each element of M. Worse still, there is a mathematical definition for exp(M), sin(M), etc., involving power series expansion, which is used from time to time. So defining it differently in a library is quite misleading. It's sometimes useful to apply a function to every element of a matrix, but this should be done via an analog of for_each (IMO). - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

1 0

asio & variable number of worker threads
by Chris Richards 08 Nov '06

08 Nov '06

I have implemented a simple tcp server using asio. I wish to be able to dynamically add and remove threads from the io_service thread pool, so that when the server is heavily loaded it can be given more threads to cope with the load, but when the load reduces it can release the threads back to the OS. I've tried posting to the io_service a handler which just throws an exception so that the thread exits, but it also resets the tcp connection and causes the acceptor thread to exit as well. Is there a way of cleanly stopping just a single io_service::run method which would then cause the thread to exit?

2 3

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

08 Nov '06

Boost Inspection Report Run Date: 17:02:54 UTC, Wednesday 08 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11424 files scanned 892 directories scanned (including root) 243 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 176 broken links 21 unlinked files 7 file/directory names issues 1 files with tabs 0 violations of the Boost min/max guidelines 35 usages of unnamed namespaces in headers (including .ipp files) Summary: archive (3) asio (1) bind (2) boost-root (1) build (2) date_time (1) doc (2) filesystem (37) fusion (1) graph (3) inspect (1) interprocess (1) iostreams (2) lambda (4) more (66) mpl (1) multi_array (2) numeric (1) parameter (2) program_options (1) ptr_container (1) python (7) regex (1) regression (14) serialization (1) signals (1) test (81) tuple (1) type_traits (1) utility (1) Details: *R* invalid (cr only) line-ending *A* invalid bookmarks, invalid urls, broken links, unlinked files *N* file/directory names issues *T* tabs in file *M* uses of min or max that have not been protected from the min/max macros, or unallowed #undef-s *U* unnamed namespace in header |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 |asio| libs/asio/index.html: *A* broken link: doc/html/index.html |bind| boost/bind/placeholders.hpp: *U* unnamed namespace at line 25 libs/bind/index.html: *A* broken link: ../../site/LICENSE_1_0.txt |boost-root| index.htm: *A* broken link: ../doc/html/signals.html |build| tools/build/v2/example/make/main.cpp.pro: *N* name contains more than one dot character ('.') tools/build/v2/test/test_system.html: *A* unlinked file |date_time| libs/date_time/xmldoc/date_time_docs_howto.html: *A* unlinked file |doc| doc/html/boost_math/inverse_complex.html: *A* unlinked file doc/html/jam.html: *A* unlinked file |filesystem| libs/filesystem/doc/do-list.htm: *A* invalid URL (hardwired file): file://?/ *A* invalid URL (hardwired file): file://?/UNC/ libs/filesystem/doc/i18n.html: *A* broken link: convenience.htm#basic_recursive_directory_iterator *A* broken link: exception.htm *A* broken link: operations.htm *A* broken link: operations.htm#Do-the-right-thing *A* broken link: operations.htm#is_directory *A* broken link: operations.htm#is_file *A* broken link: operations.htm#status libs/filesystem/doc/index.htm: *A* broken link: ../build/Jamfile *A* broken link: convenience.htm *A* broken link: fstream.htm *A* broken link: operations.htm#create_directory *A* broken link: operations.htm#create_hard_link *A* broken link: operations.htm#current_path *A* broken link: operations.htm#directory_iterator *A* broken link: operations.htm#equivalent *A* broken link: operations.htm#file_size *A* broken link: operations.htm#initial_path *A* broken link: operations.htm#is_file *A* broken link: operations.htm#is_symlink *A* broken link: operations.htm#status *A* broken link: operations.htm#symlink_status *A* broken link: path.htm#Canonical *A* broken link: path.htm#Grammar *A* broken link: path.htm#Normalized *A* broken link: path.htm#default_name_check *A* broken link: path.htm#name_check_mechanism *A* broken link: path.htm#normalize *A* broken link: path.htm#operator_eq *A* broken link: path.htm#synopsis libs/filesystem/doc/portability_guide.htm: *A* broken link: path.htm#name_check_typedef libs/filesystem/doc/tr2_proposal.html: *A* invalid URL (hardwired file): file:///C|/boost/site/libs/filesystem/doc/operations.htm#complete_note |fusion| libs/fusion/index.html: *A* broken link: doc/html/index.html |graph| boost/graph/maximum_cardinality_matching.hpp: *N* name exceeds 31 characters libs/graph/doc/lengauer_tarjan_dominator_tree.htm: *N* name exceeds 31 characters libs/graph/doc/sorted_erdos_renyi_generator.html: *N* name exceeds 31 characters |inspect| tools/inspect/index.html: *A* broken link: build/Jamfile |interprocess| libs/interprocess/index.html: *A* broken link: doc/html/index.html |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file |lambda| boost/lambda/core.hpp: *U* unnamed namespace at line 62 boost/lambda/detail/lambda_functors.hpp: *U* unnamed namespace at line 25 boost/lambda/exceptions.hpp: *U* unnamed namespace at line 24 libs/lambda/doc/index.html: *A* broken link: ../../LICENSE_1_0.txt |more| more/getting_started.html: *A* broken link: ../Jamfile *A* broken link: ../tools/build/v1/borland-tools.html *A* broken link: ../tools/build/v1/build_system.htm *A* broken link: ../tools/build/v1/build_system.htm#build *A* broken link: ../tools/build/v1/como-tools.html *A* broken link: ../tools/build/v1/cw-tools.html *A* broken link: ../tools/build/v1/darwin-tools.html *A* broken link: ../tools/build/v1/dmc-stlport-tools.html *A* broken link: ../tools/build/v1/dmc-tools.html *A* broken link: ../tools/build/v1/edg-tools.html *A* broken link: ../tools/build/v1/gcc-nocygwin-tools.html *A* broken link: ../tools/build/v1/gcc-stlport-tools.html *A* broken link: ../tools/build/v1/gcc-tools.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/kcc-tools.html *A* broken link: ../tools/build/v1/kylix-tools.html *A* broken link: ../tools/build/v1/mingw-stlport-tools.html *A* broken link: ../tools/build/v1/mingw-tools.html *A* broken link: ../tools/build/v1/mipspro-tools.html *A* broken link: ../tools/build/v1/msvc-stlport-tools.html *A* broken link: ../tools/build/v1/msvc-tools.html *A* broken link: ../tools/build/v1/sunpro-tools.html *A* broken link: ../tools/build/v1/tru64cxx-tools.html *A* broken link: ../tools/build/v1/vacpp-tools.html *A* broken link: ../tools/build/v1/vc-7_1-stlport-tools.html *A* broken link: ../tools/build/v1/vc-7_1-tools.html *A* broken link: ../tools/build/v1/vc-8_0-tools.html *A* broken link: ../tools/build/v1/vc7-stlport-tools.html *A* broken link: ../tools/build/v1/vc7-tools.html more/version_history.html: *A* broken link: ../tools/build/v1/intel-linux-tools.html *A* broken link: ../tools/build/v1/intel-win32-tools.html *A* broken link: ../tools/build/v1/msvc-stlport-tools.html |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/index.html: *A* broken link: ../../LICENSE_1_0.txt |parameter| libs/parameter/doc/html/python.html: *A* broken link: tag::x(int *A* broken link: tag::y*(int |program_options| libs/program_options/doc/index.html: *A* broken link: ../.../../LICENSE_1_0.txt |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |python| libs/python/doc/building.html: *A* broken link: ../../../tools/build/v1/build_system.htm *A* broken link: ../../../tools/build/v1/build_system.htm#user_globals *A* broken link: ../../../tools/build/v1/build_system.htm#variants 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/index.htm: *A* broken link: build/Jamfile 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 |signals| boost/signals/detail/named_slot_map.hpp: *T* |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 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 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 |tuple| libs/tuple/index.html: *A* broken link: ../../site/LICENSE_1_0.txt |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file |utility| libs/utility/index.html: *A* broken link: ../../site/LICENSE_1_0.txt

1 0

Boost inspection notification (2006-11-08/RC_1_34_0) *LC*
by Rene Rivera 08 Nov '06

08 Nov '06

Boost Inspection Report Run Date: 17:03:10 UTC, Wednesday 08 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11424 files scanned 892 directories scanned (including root) 1345 problems reported Problem counts: 877 files missing Boost license info or having wrong reference text 468 files missing copyright notice Summary: any (1) archive (1) array (1) assign (2) bind (6) boost-root (4) build (58) compatibility (2) concept_check (22) conversion (5) detail (4) disjoint_sets (2) doc (2) filesystem (2) format (8) function (1) functional (8) inspect (1) integer (9) iostreams (2) lambda (10) libs (6) logic (2) math (1) more (30) mpl (417) multi_array (13) numeric (198) optional (1) people (90) pool (30) program_options (35) property_map (15) ptr_container (111) python (6) quickbook (11) random (20) range (18) rational (5) regex (4) regression (64) release (2) serialization (16) smart_ptr (12) test (5) timer (1) tokenizer (9) tr1 (2) tuple (5) utility (23) 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* |array| libs/array/doc/ array.xml: *L* |assign| libs/assign/doc/ style.css: *L* libs/assign/ index.html: *L* |bind| libs/bind/ bind.html: *L* libs/bind/doc/ ref.xml: *L* libs/bind/ mem_fn.html: *L* ref.html: *C* *L* libs/bind/test/ Jamfile.v2: *L* |boost-root| / README: *C* boost.css: *C* *L* rst.css: *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* 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/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* |compatibility| libs/compatibility/ generate_cpp_c_headers.py: *L* index.html: *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* |detail| boost/detail/ algorithm.hpp: *L* endian.hpp: *L* limits.hpp: *L* utf8_codecvt_facet.hpp: *L* |disjoint_sets| libs/disjoint_sets/ bibliography.html: *L* disjoint_sets.html: *L* |doc| doc/html/ reference.css: *C* *L* |filesystem| libs/filesystem/doc/ tr2_proposal.html: *L* libs/filesystem/src/ utf8_codecvt_facet.hpp: *L* |format| libs/format/benchmark/ bench_format.cpp: *C* results.txt: *C* *L* libs/format/doc/ choices.html: *L* format.html: *C* libs/format/ index.html: *C* *L* libs/format/test/ Jamfile.v2: *L* |function| boost/function/detail/ gen_maybe_include.pl: *L* |functional| boost/ functional.hpp: *L* libs/functional/ binders.html: *L* function_test.cpp: *L* function_traits.html: *L* index.html: *L* mem_fun.html: *L* negators.html: *L* ptr_fun.html: *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* |iostreams| libs/iostreams/doc/ menu.html: *C* libs/iostreams/test/detail/ utf8_codecvt_facet.hpp: *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/ borland_cpp.html: *C* *L* count_bdy.htm: *L* discussion_policy.htm: *C* error_handling.html: *L* generic_exception_safety.html: *C* *L* generic_programming.html: *L* microsoft_vcpp.html: *C* *L* moderators.html: *C* regression.html: *C* *L* report-apr-2006.html: *C* *L* report-jan-2006.html: *C* *L* more/writingdoc/ design.html: *L* index.html: *L* introduction.html: *L* structure.html: *L* more/writingdoc/template/ acknowledgments.html: *L* bibliography.html: *L* configuration.html: *L* definitions.html: *L* faq.html: *L* header.html: *L* index.html: *L* overview.html: *L* rationale.html: *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* 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/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/interval/doc/ checking.htm: *L* comparisons.htm: *L* examples.htm: *L* guide.htm: *L* includes.htm: *L* interval.htm: *L* numbers.htm: *L* policies.htm: *L* rounding.htm: *L* todo.htm: *L* 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/ aleksey_gurtovoy.htm: *C* *L* andreas_huber.html: *C* *L* beman_dawes.html: *C* *L* darin_adler.htm: *C* *L* daryle_walker.html: *C* *L* dietmar_kuehl.htm: *C* *L* doug_gregor.html: *C* *L* ed_brey.htm: *C* *L* eric_friedman.htm: *C* *L* fernando_cacciola.html: *C* *L* gary_powell.htm: *C* *L* gennadiy_rozental.htm: *C* *L* greg_colvin.htm: *C* *L* hartmut_kaiser.htm: *C* *L* herve_bronnimann.htm: *C* *L* howard_hinnant.htm: *C* *L* hubert_holin.html: *C* *L* jaakko_jarvi.htm: *C* *L* jeff_garland.html: *C* *L* jens_maurer.htm: *C* *L* jeremy_siek.htm: *C* *L* joaquin_lopez.htm: *C* *L* joel_de_guzman.htm: *C* *L* john_maddock.htm: *C* *L* jonathan_turkanis.htm: *C* *L* kevlin_henney.htm: *C* *L* liequan_lee.htm: *C* *L* mac_murrett.htm: *C* *L* mark_rodgers.htm: *C* *L* mat_marcus.htm: *C* *L* paul_mensonides.htm: *C* *L* paul_moore.htm: *C* *L* pavol_droba.htm: *C* *L* people.htm: *C* *L* peter_dimov.htm: *C* *L* ralf_w_grosse_kunstleve.htm: *C* *L* rene_rivera.htm: *C* *L* robert_ramey.htm: *C* *L* ronald_garcia.htm: *C* *L* samuel_krempp.htm: *C* *L* thomas_witt.html: *C* *L* thorsten_ottosen.html: *C* *L* vesa_karvonen.htm: *C* *L* vladimir_prus.htm: *C* *L* william_kempf.htm: *C* *L* |pool| boost/pool/detail/ pool_construct.bat: *L* pool_construct.sh: *L* pool_construct_simple.bat: *L* pool_construct_simple.sh: *L* libs/pool/ TODO.txt: *C* *L* libs/pool/doc/ concepts.html: *L* copyright.html: *L* libs/pool/doc/implementation/ alignment.html: *L* ct_gcd_lcm.html: *L* for.html: *L* gcd_lcm.html: *L* guard.html: *L* mutex.html: *L* object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* pool_construct.html: *L* simple_segregated_storage.html: *L* singleton.html: *L* singleton_pool.html: *L* libs/pool/doc/ index.html: *L* interfaces.html: *L* libs/pool/doc/interfaces/ object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* simple_segregated_storage.html: *L* singleton_pool.html: *L* user_allocator.html: *L* libs/pool/doc/ pool.css: *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/ 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.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* style.css: *C* *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/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* 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* |random| libs/random/ index.html: *C* *L* nondet_random.html: *C* *L* random-concepts.html: *C* *L* random-distributions.html: *C* *L* random-generators.html: *C* *L* random-misc.html: *C* *L* random-performance.html: *C* *L* random-variate.html: *C* *L* libs/random/test/ Jamfile.v2: *C* *L* libs/random/ wg21-proposal.html: *C* *L* |range| libs/range/doc/ boost_range.html: *L* example.cpp: *C* *L* examples.html: *L* faq.html: *L* headers.html: *L* history_ack.html: *L* intro.html: *L* portability.html: *L* range.html: *L* style.css: *C* *L* style.html: *L* utility_class.html: *L* libs/range/test/ TODO: *C* *L* compat1.cpp: *C* *L* |rational| boost/ rational.hpp: *L* libs/rational/ index.html: *L* rational.html: *L* rational_example.cpp: *L* rational_test.cpp: *L* |regex| libs/regex/build/ gcc-shared.mak: *C* *L* libs/regex/example/timer/ input_script.txt: *C* *L* |regression| tools/regression/build/ Jamfile.v2: *C* *L* tools/regression/detail/ tiny_xml_test.txt: *C* *L* tools/regression/ index.htm: *C* *L* run_tests.sh: *C* *L* tools/regression/test/ test.bat: *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* 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* |smart_ptr| libs/smart_ptr/ compatibility.htm: *L* enable_shared_from_this.html: *L* intrusive_ptr.html: *L* scoped_array.htm: *L* scoped_ptr.htm: *L* shared_array.htm: *L* shared_ptr.htm: *L* smart_ptr.htm: *L* smarttests.htm: *L* sp_techniques.html: *L* libs/smart_ptr/test/ Jamfile.v2: *L* libs/smart_ptr/ weak_ptr.htm: *L* |test| boost/test/utils/runtime/cla/detail/ argument_value_usage.hpp: *L* libs/test/example/ unit_test_example_01.cpp: *C* *L* libs/test/test/auto-link-test/ run_bjam.bat: *C* *L* |timer| libs/timer/ timer.htm: *L* |tokenizer| libs/tokenizer/ char_delimiters_separator.htm: *L* char_separator.htm: *L* escaped_list_separator.htm: *L* index.html: *L* introduc.htm: *L* offset_separator.htm: *L* token_iterator.htm: *L* tokenizer.htm: *L* tokenizerfunction.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/ Assignable.html: *L* Collection.html: *L* CopyConstructible.html: *L* LessThanComparable.html: *L* MultiPassInputIterator.html: *L* OptionalPointee.html: *L* assert.html: *L* call_traits.htm: *L* checked_delete.html: *L* compressed_pair.htm: *L* current_function.html: *L* enable_if.html: *L* generator_iterator.htm: *C* *L* libs/utility/test/ Jamfile.v2: *L* libs/utility/ throw_exception.html: *L* 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