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

Typos in source (refered and prefered are used instead of referred and preferred)
by Domenico Andreoli 20 Jul '06

20 Jul '06

hi, debian user and developer Roger Leigh reported some typos in Boost sources. i'm attaching his patch against your CVS. full debian bug report is available at http://bugs.debian.org/378016. please fix it before 1.34.0. thank you domenico -----[ Domenico Andreoli, aka cavok --[ http://people.debian.org/~cavok/gpgkey.asc ---[ 3A0F 2F80 F79C 678A 8936 4FEE 0677 9033 A20E BC50

2 1

Fw: Is there interest for iterator based conversion library? attempt #2
by Alexander A Potocki 20 Jul '06

20 Jul '06

No comments during about 2 weeks. what's wrong? > Hi boost community! > > I would like to propose my iterator based conversion library. > It allows declaring and using transformations by following way: > > std::wstring utf16string(L”some sequence to convert”); > > typedef cvt::encoder<wchar_t, char> coder_t; > coder_t coder = cvt::utf16() >> cvt::utf8(); > > That piece of code declares converter from wchar_t to char sequences and > then instantiate such converter by utf16 to utf8 transformation. > > Then that converter instance can be used by following way: > typedef cvt::convert_input_iterator<coder_t, std::wstring::const_iterator > > it_t; > - declaration of input iterator > > std::string result; > std::copy( > it_t(coder, utf16string.begin(), utf16string.end()), > it_t(coder, utf16string.end(), utf16string.end()), > std::back_inserter(result) > ); > Now we have utf8 encoded string in result container. That’s all. > > Library contains implementation for following transformations/algorithms: > utf7, utf8, utf16(be/le), utf32(be, le), Unicode simple folding, base64, > rc5(cipher/decipher). > Library allows creating pipeline converters, e.g.: > > typedef cvt::encoder<char, char> coder_t; // char to char sequence > transformation > coder_t coder = cvt::utf7() >> cvt::utf16() >> cvt::utf8() / cvt::int8() > >> cvt::rc5<32,12,8>(key) / cvt::int8() >> cvt::base64(); > > That expression defines pipeline transformation. Utf7 encoded sequence > transforms to utf16 encoded sequence, then to utf8 encoded, then performs > rc5 cipher with specified key, then performs base64 encoding. > > Library can be found at http://sourceforge.net/projects/trotter-cvt/ > > > Alexander Potocki

2 1

[asio] Modified SSL client to reproduce error
by Scott 20 Jul '06

20 Jul '06

Chris, I took the existing SSL client.cpp code and added a thread to it. I removed the code to prompt the user for a string to send to the server and instead it will randomly pick one of 3 messages to constantly send them. In the 2nd thread, it basically does the same thing, but sends 1 of 3 different messages. Both threads are using the same socket. The first thread is using async IO to read and write the messages. The 2nd thread only sends synchronous messages at random intervals (the first thread picks up the responses from the 2nd thread's asio::write). This program fails rather quickly on Windows XP using MSVS 7.1. First off, did I program this correctly? If so, then I think it can be used to determine some of the SSL issues. :) Thanks, Scott

3 2

Boost.Build V2, Milestone 11 released
by Vladimir Prus 20 Jul '06

20 Jul '06

I'm pleased to announce that the next milestone release of Boost.Build V2 is available at http://prdownloads.sourceforge.net/boost/boost-build-2.0-m11.tar.bz2 http://prdownloads.sourceforge.net/boost/boost-build-2.0-m11.zip See also http://boost.org/boost-build2/ for online docs (a copy is included in distribution). Changes in this release: - New C++ compilers: IBM xlf, HP aCC, HP CXX, Intel fortran compiler. - New tools: Qt4 support, MS message compiler and IDL compiler. - New main targets: 'notfile' and 'cast'. - Core changes: - Only one file required at top level of a project, named Jamroot. - Jamfiles can now contain project-specific help messages. - "Indirect conditional requirements" introduced (http://tinyurl.com/mn3jp) - Strip suffix in main target names when computing names of generated files (URL) - The 'source-location' project attribute can contain several directories. - Usage requirements are propagated not only direct dependents, but to indirect dependents. - Command line option changes (see http://tinyurl.com/zbycz) - New option --build-dir - The --clean option cleans only target below the current directory, not globally. - New --clean-all option was added. - New option --debug-building - Running "bjam some_directory" works even if there's no Jamfile in the current directory. - Toolset improvements: - Assembling support with gcc, borland and msvc. - Support amd64/ia64 cross-compiling with msvc. - Improved, registry-based autodetection for msvc. - Serialize execution of gcc.link actions - Precompiled headers supported on MSVC (Need documentation) - New features <warnings> and <warnings-as-errors> - The 'glob' rule accepts wildcards in directory names. - The 'stage' rule was renamed to 'install' (the old name still available for compatibility) - The <tag> feature can accept user-defined function as value (URL) - The 'install' rule can install a directory hierarchy preserving relative paths. - The 'install' rule no longer allows to change library name during install. - The Jamfile referred via 'use-project' may declare project id different from the one in 'use-project'. - The 'using' rule now searches the directory of containing Jamfile. The following bugs were fixed: - The <library> feature was ignored for static linking - Fix #include scanning for C files. - Child projects were sometimes loaded before parent projects. - Fix project references with absolute paths on Windows. - The <dependency> feature was ignored for 'install' targets. - A generator having the same type in sources and targets was causing hang. - Use 'icpc' command for Intel, fixing errors with 8.1 and higher. - Generation of PS files with the FOP tool really produces .PS files. - No dependency scanning was done for C files. - The 'constant' and 'path-constant' rules did not accept multi-element value. - Don't pass -fcoalesce-templates to gcc on OSX 10.4 - Fix static lib suffix on OSX. - Fix rpath setting on Intel/Linux. - The 'install' rule don't unnecessary scans #includes in installed headers. Developer visible changes: - Ability to customize type's prefix depending on build properties. - Generator's 'run' method can return usage-requirements. - Main target rule is automatically declared for each new target type. - 'Link incompatible' feature attribute was removed - Generators no longer bypass unhandled sources, they just ignore them. - If there are several applicable generators, immediately report ambiguity. Provide a way to explicitly resolve conflicts between generators. - The 'flags' rule can match absense of feature. - Great improvement in response files handling - The 'toolset.flags' rules allows value-less feature to signify absense of this feature (fix hack-hack). - Automatically declare main target rule for each declared target type. - When inheriting types, inherit generators for the base type, as opposed to using various hacks to invoke base generators when needed. - Improve diagnostic for "duplicate actual target" and generator ambiguity. - Volodya -- Vladimir Prus http://vladimir_prus.blogspot.com Boost.Build V2: http://boost.org/boost-build2

1 0

Boost regression notification (2006-07-19 [RC_1_34_0])
by Douglas Gregor 19 Jul '06

19 Jul '06

Boost Regression test failures Report time: 2006-07-19T11:39:31Z 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… 243 failures in 24 libraries algorithm/string (1) concept_check (1) filesystem (2) graph (6) integer (3) io (1) iostreams (39) mpl (7) numeric/conversion (4) numeric/interval (1) numeric/ublas (7) parameter (30) pool (3) program_options (9) python (25) random (1) rational (4) serialization (30) signals (16) spirit (2) test (2) tr1 (41) typeof (7) utility (1) |algorithm/string| regex: borland-5_6_4 |concept_check| class_concept_check_test: vc-7_1-stlport |filesystem| operations_test: vc-7_1-stlport operations_test_dll: vc-7_1-stlport |graph| adjacency_matrix_test: vc-7_0 bidir_remove_edge: vc-7_0 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport matching_test: msvc-8.0 |integer| integer_traits_test: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| array_test: vc-6_5 auto_close_test: vc-6_5 buffer_size_test: vc-6_5 bzip2_test: msvc-7.1 msvc-8.0 code_converter_test: vc-6_5 component_access_test: vc-6_5 compose_test: borland-5_6_4 vc-6_5 copy_test: vc-6_5 counter_test: vc-6_5 direct_adapter_test: vc-6_5 example_test: vc-6_5 vc-6_5-stlport file_descriptor_test: vc-6_5 file_test: vc-6_5 filtering_stream_test: vc-6_5 vc-7_1-stlport finite_state_filter_test: cw-9.4 flush_test: vc-6_5 gzip_test: msvc-7.1 msvc-8.0 invert_test: vc-6_5 line_filter_test: vc-6_5 mapped_file_test: vc-6_5 newline_test: vc-6_5 null_test: vc-6_5 pipeline_test: vc-6_5 positioning_test: vc-6_5 regex_filter_test: vc-6_5 restrict_test: vc-6_5 seekable_file_test: vc-6_5 seekable_filter_test: vc-6_5 stdio_filter_test: vc-6_5 symmetric_filter_test: vc-6_5 tee_test: vc-6_5 wide_stream_test: vc-6_5 zlib_test: msvc-7.1 msvc-8.0 |mpl| apply: gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| test_float: vc-7_1-stlport |numeric/ublas| concepts: vc-7_1-stlport vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |parameter| basics: borland-5_6_4 borland-5_8_2 duplicates: borland-5_6_4 borland-5_8_2 earwicker: borland-5_6_4 borland-5_8_2 macros: borland-5_6_4 borland-5_8_2 maybe: vc-6_5 vc-6_5-stlport vc-7_0 mpl: borland-5_6_4 borland-5_8_2 preprocessor: borland-5_6_4 borland-5_8_2 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_6_4 borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |pool| test_pool_alloc: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp |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: borland-5_8_2 cw-9.4 variable_map_test_dll: borland-5_8_2 cw-9.4 winmain_dll: cw-9.4 |python| bases: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux exec: cw-9.4 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp pointee: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux pointer_type_id_test: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux select_from_python_test: darwin-4.0.1 qcc-3.3.5_cpp qcc-3.3.5_gpp upcast: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 vc-6_5 vc-6_5-stlport vc-7_0 |serialization| test_class_info_load_text_warchive: vc-6_5 test_codecvt_null: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_utf8_codecvt: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp 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: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |spirit| loops_tests_debug: msvc-8.0 scanner_value_type_tests: intel-linux-9.0 |test| parameterized_test_test: vc-6_5 vc-6_5-stlport |tr1| std_test_bind: darwin-4.0.1 std_test_ref_wrapper_tricky: borland-5_6_4 borland-5_8_2 darwin-4.0.1 gcc-3.4.3_sunos gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc hp_cxx-71_006_tru64 msvc-7.1 msvc-8.0 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_gpp test_bind: darwin-4.0.1 test_boost: vc-7_1-stlport test_hash: vc-7_1-stlport test_random: vc-7_1-stlport test_ref_wrapper_tricky: borland-5_6_4 borland-5_8_2 darwin-4.0.1 gcc-3.4.3_sunos gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc hp_cxx-71_006_tru64 msvc-7.1 msvc-8.0 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_gpp test_regex: vc-7_1-stlport tr1_has_trivial_destr_test: borland-5_6_4 tr1_has_virtual_destr_test: borland-5_6_4 tr1_tky_abstract_type_test: borland-5_6_4 tr1_tky_function_type_test: borland-5_6_4 tr1_tky_incomplete_type_test: borland-5_6_4 borland-5_8_2 tr1_tky_partial_spec_test: borland-5_6_4 |typeof| function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 nested_typedef_emulation: cw-9.4 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 |utility| operators_test: gcc-3.4.5_linux_x86_64

2 1

Re: [boost] boost::array support for runtime-sized arrays
by Sohail Somani 19 Jul '06

19 Jul '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Steven Burns > Sent: Wednesday, July 19, 2006 12:56 PM > To: boost(a)lists.boost.org > Subject: [boost] boost::array support for runtime-sized arrays > > I realize you could simply use std::vector, but sometimes all > you want is a > fixed-size array (but sized at runtime). Besides, I am not > sure about the > overhead involved with std::vector for these simple scenarios. I doubt it would be much more if at all slower to use vector so long as you only allocate once.

2 1

Re: [boost] Exception Visitor
by Ames Andreas 19 Jul '06

19 Jul '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Andreas Huber > Sent: Tuesday, July 18, 2006 10:05 PM > Subject: Re: [boost] Exception Visitor > > // Untested code > #include <stdexcept> > > // Generic handler function > void HandleException() > { > try > { > throw; > } > catch (const std::logic_error &) > { > // whatever > } > catch (const std::exception &) > { > // whatever > } > } > > int main() > { > try > { > // throwing code > } > catch (...) > { > HandleException(); > } > > return 0; > } If you forget to handle a relevant exception in HandleException, is your debugger able to show you the 'right' backtrace (i.e. where the exception really occurred)? I don't think the op's idea has that problem. cheers, aa -- Andreas Ames | Programmer | Comergo GmbH | Voice: +49 69 7505 3213 | ames AT avaya DOT com

3 2

Generic Trees
by Manfred Doudar 19 Jul '06

19 Jul '06

Hi all: Lately I've taken look at the available material re Boost SoC Generic Tree container, and find many parallels in what I am trying to attempt here at work (with seemingly one exception, see query below), and making good headway with a relatively robust and generic design (, though I'd hate to be reinventing the wheel). However, what I could not pick out is whether or not the proposed tree can or intends to support a node owning multiple parents(?) Apologies to all others for the noise, but I wasn't sure where else to post the question. Cheers, -- Manfred Doudar - Research Engineer National ICT Australia - Canberra Research Lab | www.nicta.com.au Research School of Information Sciences and Engineering (RSISE) The Australian National University - Canberra, ACT 0200 AUSTRALIA

8 11

Re: [boost] Is there a one-to-one map class in boost?
by Wang Weiwei 19 Jul '06

19 Jul '06

>Meanwhile you can have a look at the bidirectional map implementation using >B.MI here: > >http://www.boost.org/libs/multi_index/example/bimap.cpp > > SeskaPeel > yes, It's a nice stuff, even though a little bit complicated in syntax. Thanks. Max

1 0

Re: [boost] Please don't define a fake "operator <" justfor ordered containers
by Sohail Somani 19 Jul '06

19 Jul '06

> No. For pointers going into the same array segment > (including one-past-end) > or the same access-level class block, operator "<" is > defined. Using the > operator is unspecified if the pointers are from different spans. The > "std::less<T*>" specializations have to give the same results as the > operator when the operator is defined, but must give a total > ordering so > pointers from different spans (or NULL) can be compared. Due > to potential > exclusivities in comparison domains, it's possible that the > operator and the > class template use separate definitions. I must leave it in your capable hands to provide a summary and solution for this thread. It would be very interesting.

2 1

Release procedures
by Fernando Cacciola 19 Jul '06

19 Jul '06

Hi, I must be doing something wrong or I'm expecting something I shouldn't: (1) I updated from the trunk (HEAD) (2) Fixed a couple of things (3) Commited to the trunk (4) Updated from RC_1_34 (over the same working folder) (5) Merged "merged_from_RC_1_34" and "HEAD" into working folder. For step 5 I'm using ToroiseCVS 1.8.26 using the merge dialog as follow: Start: merged_from_RC_1_34 End: HEAD After that I get lots of updated, and even conflicted, files, way beside those which are mine. Is that expected? I figured I would get only my files merged. If it is, is it OK to just commit my files and not the others? What about the tag? TIA Fernando Cacciola

8 14

Boost inspection notification (2006-07-18/RC_1_34_0) *X*
by Rene Rivera 19 Jul '06

19 Jul '06

Boost Inspection Report Run Date: 20:04:59 UTC, Tuesday 18 July 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: 11601 files scanned 900 directories scanned 243 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 146 broken links 28 unlinked files 14 file names too long 38 files with tabs 14 violations of the Boost min/max guidelines Summary: algorithm (1) archive (1) assign (1) boost-root (6) build (12) date_time (1) doc (3) filesystem (37) foreach (1) graph (15) iostreams (2) iterator (8) jam (1) libs (6) math (6) more (32) numeric (4) program_options (1) ptr_container (1) python (5) quickbook (4) range (1) regex (1) regression (13) statechart (2) test (55) tr1 (1) type_traits (1) typeof (16) xpressive (5) Details: *R* invalid (cr only) line-ending *A* invalid bookmarks, invalid urls, broken links, unlinked files *N* file names too long *T* tabs in file *M* uses of min and max that have not been protected from the min/max macros |algorithm| libs/algorithm/string/doc/external_concepts.html: *A* unlinked file |archive| boost/archive/basic_streambuf_locale_saver.hpp: *N* filename > 31 chars |assign| libs/assign/test/ptr_map_inserter.cpp: *T* |boost-root| index.htm: *A* broken link: doc/html/foreach.html *A* broken link: doc/html/typeof.html *A* broken link: doc/html/xpressive.html *A* broken link: libs/filesystem/doc/convenience.htm#basic_recursive_directory_iterator *A* broken link: libs/wave/doc/index.html *A* broken link: sorted_erdos_renyi_generator.html |build| tools/build/v1/build_system.htm: *A* broken link: ../../../doc/html/jam/language.html#jam.language.flow_of_control tools/build/v1/qcc-3.3.1-tools.jam: *N* filename contains more than one dot character ('.') tools/build/v1/qcc-3.3.5-cpp-tools.jam: *N* filename contains more than one dot character ('.') tools/build/v1/qcc-3.3.5-gpp-tools.jam: *N* filename contains more than one dot character ('.') tools/build/v2/example/libraries/util/foo/include/lib1.h: *N* file's directory depth will exceed 8 levels if placed on a CD tools/build/v2/example/make/main.cpp.pro: *N* filename contains more than one dot character ('.') tools/build/v2/index.html: *A* broken link: ../../../doc/html/bbv2.html *A* broken link: ../../../doc/html/bbv2/installation.html tools/build/v2/test/indirect_conditional.py: *T* tools/build/v2/test/project-test3/lib3/Jamfile: *T* 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/greatest_common_divisor_and_least_common_multiple.html: *N* filename > 31 chars doc/html/boost_math/inverse_complex.html: *A* unlinked file doc/html/boost_tr1.html: *A* broken link: index.html |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: convenience.htm *A* broken link: fstream.htm *A* broken link: operations.htm#create_directory *A* broken link: operations.htm#create_hard_link *A* broken link: operations.htm#current_path *A* broken link: operations.htm#directory_iterator *A* broken link: operations.htm#equivalent *A* broken link: operations.htm#file_size *A* broken link: operations.htm#initial_path *A* broken link: operations.htm#is_file *A* broken link: operations.htm#is_symlink *A* broken link: operations.htm#status *A* broken link: operations.htm#symlink_status *A* broken link: path.htm#Canonical *A* broken link: path.htm#Grammar *A* broken link: path.htm#Normalized *A* broken link: path.htm#default_name_check *A* broken link: path.htm#name_check_mechanism *A* broken link: path.htm#normalize *A* broken link: path.htm#operator_eq *A* broken link: path.htm#synopsis libs/filesystem/doc/portability_guide.htm: *A* broken link: path.htm#name_check_typedef libs/filesystem/doc/tr2_proposal.html: *A* invalid URL (hardwired file): file:///C|/boost/site/libs/filesystem/doc/operations.htm#complete_note libs/filesystem/src/operations.cpp: *T* |foreach| libs/foreach/index.html: *A* broken link: ../../doc/html/foreach.html |graph| boost/graph/adj_list_serialize.hpp: *T* boost/graph/dominator_tree.hpp: *M* violation of Boost min/max guidelines on line 221 *T* boost/graph/erdos_renyi_generator.hpp: *T* boost/graph/maximum_cardinality_matching.hpp: *M* violation of Boost min/max guidelines on line 755 *N* filename > 31 chars *T* boost/graph/plod_generator.hpp: *T* libs/graph/doc/lengauer_tarjan_dominator_tree.htm: *N* filename > 31 chars libs/graph/doc/sorted_erdos_renyi_generator.html: *N* filename > 31 chars libs/graph/example/kevin-bacon2.cpp: *T* libs/graph/test/csr_graph_test.cpp: *T* libs/graph/test/dominator_tree_test.cpp: *T* libs/graph/test/matching_test.cpp: *T* libs/graph/test/random_matching_test.cpp: *T* |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file |iterator| libs/iterator/doc/filter_iterator_ref.html: *A* unlinked file libs/iterator/doc/indirect_iterator_ref.html: *A* unlinked file libs/iterator/doc/issues.html: *A* unlinked file libs/iterator/doc/iter-issue-list.html: *A* unlinked file libs/iterator/doc/iterator_adaptor_ref.html: *A* unlinked file libs/iterator/doc/iterator_traits.html: *A* broken link: ../../../doc/html/boost_typetraits/category.html#boost_typetraits.transform libs/iterator/doc/make_filter_iterator.html: *A* unlinked file libs/iterator/doc/ref_problem.html: *A* unlinked file |jam| tools/jam/index.html: *A* broken link: ../../doc/html/jam.html |libs| libs/libraries.htm: *A* broken link: math/octonion/index.html *A* broken link: math/quaternion/index.html *A* broken link: math/special_functions/index.html |math| boost/math/complex/acos.hpp: *M* violation of Boost min/max guidelines on line 107 *M* violation of Boost min/max guidelines on line 193 boost/math/complex/asin.hpp: *M* violation of Boost min/max guidelines on line 117 *M* violation of Boost min/max guidelines on line 203 |more| more/getting_started.html: *A* broken link: ../doc/html/jam/building.html more/version_history.html: *A* broken link: ../doc/html/date_time/date_time_io.html *A* broken link: ../doc/html/date_time/details.html#date_time.changes *A* broken link: ../doc/html/date_time/local_time.html *A* broken link: ../libs/math/octonion/index.html *A* broken link: ../libs/math/quaternion/index.html *A* broken link: ../libs/math/special_functions/index.html *A* broken link: doc/html/any.html *A* broken link: libs/bind/bind.html *A* broken link: libs/bind/bind.html#operators *A* broken link: libs/config/index.html *A* broken link: libs/functional/hash/index.html *A* broken link: libs/graph/doc/cuthill_mckee_ordering.html *A* broken link: libs/graph/doc/king_ordering.html *A* broken link: libs/graph/doc/table_of_contents.html *A* broken link: libs/iostreams/doc/index.html *A* broken link: libs/python/doc/index.html *A* broken link: libs/regex/doc/history.html *A* broken link: libs/regex/doc/index.html *A* broken link: libs/signals/doc/index.html *A* broken link: libs/smart_ptr/index.html *A* broken link: libs/thread/doc/index.html *A* broken link: libs/wave/ChangeLog *A* broken link: libs/wave/index.html *A* broken link: more/boost_1_33_0.jpg *A* broken link: people/doug_gregor.html |numeric| boost/numeric/conversion/detail/old_numeric_cast.hpp: *M* violation of Boost min/max guidelines on line 159 *M* violation of Boost min/max guidelines on line 192 libs/numeric/ublas/test/placement_new.cpp: *T* libs/numeric/ublas/test/test11.cpp: *T* |program_options| boost/program_options/positional_options.hpp: *M* violation of Boost min/max guidelines on line 44 |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |python| boost/python/with_custodian_and_ward.hpp: *M* violation of Boost min/max guidelines on line 93 libs/python/src/converter/type_id.cpp: *T* libs/python/src/exec.cpp: *T* libs/python/test/exec.cpp: *T* libs/python/test/voidptr.cpp: *T* |quickbook| tools/quickbook/doc/html/quickbook/syntax/block.html: *A* broken link: ../../images/caution.png *A* broken link: ../../images/important.png *A* broken link: ../../images/warning.png *A* broken link: ../highlight.html |range| libs/range/test/iterator_range.cpp: *T* |regex| libs/regex/performance/input.html: *A* unlinked file |regression| regression/.htaccess: *N* leading character of one of the path compontents is not alphabetic tools/regression/xsl_reports/xsl/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html: *A* unlinked file |statechart| libs/statechart/index.html: *A* broken link: ../../../LICENSE_1_0.txt *A* broken link: contact.html |test| boost/test/impl/exception_safety.ipp: *M* violation of Boost min/max guidelines on line 129 libs/test/build/msvc71_proj/config_file_iterator_test.vcproj: *N* filename > 31 chars 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 |tr1| libs/tr1/test/type_traits/tr1_tky_incomplete_type_test.cpp: *N* filename > 31 chars |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file |typeof| boost/typeof/encode_decode.hpp: *T* boost/typeof/encode_decode_params.hpp: *T* boost/typeof/increment_registration_group.hpp: *N* filename > 31 chars boost/typeof/integral_template_param.hpp: *T* boost/typeof/modifiers.hpp: *T* boost/typeof/register_functions_iterate.hpp: *T* boost/typeof/template_encoding.hpp: *T* boost/typeof/template_template_param.hpp: *T* boost/typeof/type_encoding.hpp: *T* boost/typeof/type_template_param.hpp: *T* boost/typeof/typeof.hpp: *T* boost/typeof/typeof_impl.hpp: *T* libs/typeof/index.html: *A* broken link: ../../doc/html/xpressive.html libs/typeof/test/Jamfile: *T* libs/typeof/test/odr_no_uns1.cpp: *T* libs/typeof/test/odr_no_uns2.cpp: *T* |xpressive| boost/xpressive/detail/static/static.hpp: *T* boost/xpressive/detail/utility/tracking_ptr.hpp: *T* boost/xpressive/traits/detail/c_ctype.hpp: *T* libs/xpressive/index.html: *A* broken link: ../../doc/html/xpressive.html libs/xpressive/perf/regex_comparison.hpp: *M* violation of Boost min/max guidelines on line 64

4 6

Re: [boost] Is there a one-to-one map class in boost?
by Wang Weiwei 19 Jul '06

19 Jul '06

>On 7/17/06, Felipe Magno de Almeida <felipe.m.almeida(a)gmail.com> wrote: >> On 7/17/06, Wang Weiwei <wwwang(a)ccsdl.org> wrote: >> > Hello, >> > >> > Now I'm finding a one-to-one map class, say map1, that support the following syntax: >> > >> > map1 m; >> > >> > m.insert(std::make_pair(k1, v1)); >> > ... >> > key k; >> > value v; >> > >> > v = m[k]; >> > k = m[v]; >> > >> > I know a pair of std::map could provide such functionality. But I think a single obj, if that class >> > exists, would be more elegant. >> > >> > Is there such a class in boost? >> >> Look for multi_index library. There are examples of such usage. > >I am doing a bidirectional map as one of the boost SoC projects (The >class you are looking for is a particular case of it). Basically it is >a stl map like wrapper around Boost.MultiIndex. I will present a first >release to the list as soon as possible. I invite you to participate >in the discussion that will surely follows. >Just give me a few more days :) Another good news! Of course I could struggle to use a pair of class as a temp/ugly solution, and with in mind that a perfert solution is waiting for me. A few days is not a long time. :-) Thanks in advance. > >Best Regards >Matias Capeletto

2 1

[range][string_algo][string_cvt] string concept
by Oleg Abrosimov 19 Jul '06

19 Jul '06

Hello Pavol and Thorsten! In boost 1.33.1 release string_algo was adopted to use boost::range to deal with string abstraction. but in the current release support for null-terminated strings is deprecated and will disappear from range library in the upcoming 1.34.0 release, as stated in current range' documentation. I'm working on string_cvt library for boost, and it has the same need to express a string type or char sequence type in a general way. My question is - what is a planned replacement for boost::range in a relation to null-terminated strings stuff? What you Pavol is planning to do in string_algo to workaround the deprecation mentioned? And maybe what you Thorsten is planning to provide some special range type that can be used to fill this gap? Thanks in advance, Oleg Abrosimov.

2 1

Fw: [BGL] graph coloring
by Wang Weiwei 19 Jul '06

19 Jul '06

>Hello, > >I'm coloring my graph with the following code: > > typedef std::set<std::pair<int, int> > panel_conn_set_t; > panel_conn_set_t panel_conn_set; > > for(...) > { > // get the information of vertices connectivities > // vertices are referred to with int > panel_conn_set.insert(std::make_pair([some int], [some int])); > } > > typedef boost::adjacency_list<boost::vecS, boost::vecS, > boost::undirectedS, > // use the default color map > property<vertex_color_t, default_color_type>, > no_property> graph_t; > typedef property_map<graph_t, vertex_color_t>::type vertex_color_map_t; > typedef boost::graph_traits<graph_t>::vertex_descriptor vertex_descriptor; > typedef boost::graph_traits<graph_t>::edge_descriptor edge_descriptor; > typedef boost::graph_traits<graph_t>::vertex_iterator vertex_iterator; > typedef boost::graph_traits<graph_t>::vertices_size_type vertices_size_type; > > // the only graph object > graph_t g; > > vertex_color_map_t& vertex_color_map = boost::get(vertex_color, g); > > for(panel_conn_set_t::const_iterator it=panel_conn_set.begin(); it!=panel_conn_set.end(); ++it) > { > // using int directly as vecter descriptor > boost::add_edge((*it).first, (*it).second, g); > } > > // ****** method A ****** > vertices_size_type num_colors = boost::sequential_vertex_coloring(g, vertex_color_map); > > // ****** method B ****** > std::vector<vertices_size_type> color_vec(boost::num_vertices(g)); > boost::iterator_property_map<vertices_size_type*, vertex_index_map> > color(&color_vec.front(), get(vertex_index, g)); > vertices_size_type num_colors = boost::sequential_vertex_coloring(g, color); > >The code for 'method A' does not compile, but those for 'method B'(borrowed from the BGL doc, >seems to be an exterior property map implementation) works well. > >Why? Any help will be appreciated. > >Max > Or, the question may be, how to make the method A code work? that means I want to use an internal color property map associated to the graph obj. Another question here is, as was told in the doc, the result from the above code would not necessarily be the optimum/minimum number of colors. And in the 'Graph Coloring ' section of the doc, an ordering implementation, smallest_last_ordering(), is introduced. Unfortunately, I don't know how to make the code to co-operate with above code to get a better result. As information for your reference, one of my graph running in my program has about 28000 vertices, the result I got from the above code, for this example, is that I can color all of the vertices with 9 distinctive colors. Even though it's not optimum, but it's a fairly good result for me. Of course, any better number will be prefered. Thanks for you concern and help. P.S. Probably, I think I've still not clearly understood that how the boot.PropertyMap lib works with BGL, but definitely I will get it. Thanks again. Max

1 0

[system] system_error first draft
by Beman Dawes 19 Jul '06

19 Jul '06

The filesystem proposal accepted by the LWG for TR2 also includes a <system_error> header with a bit of error reporting machinery. In particular, class error_code to encapsulate error codes from the operating system and class system_error to be thrown by exceptions. See http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n1975.html#Diagnost… The plan is to use these classes uniformly in TR2. Presumably we will want Boost implementations, and use them in other Boost libraries besides Boost.Filesystem. Because there are likely to be other small operating system dependent components in the future, I'm suggesting that they go in a separate Boost.System library. I'm about to post a CPU timer component that would also fit nicely into Boost.System IMO. There is an early version of Boost.System stuff in the vault. Go to the System directory at http://boost-consulting.com/vault/ for system-0.1.zip. The preliminary error_code/system_error docs can be viewed online at http://mysite.verizon.net/beman/system_error.html Note some changes from the TR2 version: * Use of the unspecified-bool-type idom to test an error_code object to see if there is a non-zero error code. * Name changes. The problem with naming is that there are functions whose most obvious name is "errno", given the long C, C++, and POSIX tradition. But 17.4.1.2 of the C++ standard specifically says that errno shall be a macro! Boo. Hiss. So that name is out. I'm very curious to hear if people think the newer names are an improvement over the TR2 versions. And any other comments are welcome! --Beman

7 17

Re: [boost] [BGL] graph coloring
by Wang Weiwei 19 Jul '06

19 Jul '06

>> I'm coloring my graph with the following code: >> >> ��vertex_color_map_t& vertex_color_map = boost::get(vertex_color, g); > But this line didn't cause problem. >I wouldn't have expected the above to compile at all; aren't property maps >returned by value? > >D.

1 0

Re: [boost] [BGL] graph coloring
by Wang Weiwei 19 Jul '06

19 Jul '06

>> The code for 'method A' does not compile > >What error message do you get from the compiler ? Thanks, the very first message is: boost_1_33_1\boost\graph\sequential_vertex_coloring.hpp(50) : error C2440: initialization : cannot convert from "int" to "size_type" Max

1 0

Re: [boost] Please don't define a fake "operator <" justfor orderedcontainers
by Martin Bonner 18 Jul '06

18 Jul '06

----Original Message---- From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] On Behalf Of Peter Dimov Sent: 11 July 2006 11:18 To: boost(a)lists.boost.org Subject: Re: [boost] Please don't define a fake "operator <" justfor orderedcontainers > Daryle Walker wrote: > >> [1] If you make a fake order for "std::complex<>", would you compare >> real components then imaginary components, or would you use magnitude >> then angle? > > Real, then imaginary. Compare with: Interesting. I would have chosen magnitude and then angle. Why components. > > "If you make a FAKE order for std::string, would you compare left to > right or right to left?" I don't think that is a legitimate comparison. In my world view, strings have a natural order but complex numbers don't. Now admittedly, operator <() for std::string doesn't actually correspond to my natural ordering (Zoë should be less than Zoo, but it isn't), but it is close enough for most purposes and much cheaper than a locale sensitive comparison. -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 203894

4 6

Re: [boost] Please don't define a fake "operator <" just forordered containers
by Martin Bonner 18 Jul '06

18 Jul '06

> Daryle Walker wrote: >> ??? Wrote >>> Because operator== has only one purpose in C++: comparison for >>> equality. Operator<, on the other hand, has two common roles. >>> >>> For classes that have natural ordering, it should define this >>> ordering, and then all the other operators (> <= >=) should be >>> defined as well. Classes that doesn't have this natural ordering, >>> often still define operator< just to be able to be used in ordered >>> containers. In such cases, operator< doesn't define a natural >>> ordering because there isn't any. Instead, it just defines an >>> ordering "that works" for ordered containers, nothing more. It >>> doesn't need to compatible with operator== and !=, and defining >>> operators >, <=, >= is misleading and should be avoided. >> >> The later role is invalid. The reason is that the version of STL >> that made it into the Standard specifies an extra parameter for >> ordered containers for a comparison operation. It allows two >> containers of the same element type to use different comparison >> criteria (at compile- and/or run-time). This invalidates the need >> for a fake "operator <" since you can always package the comparison >> routine in an extra parameter. >> Conversely, calling code must not >> hard code use of "operator <" agreed. >> or "std::less<>", disagree >> unless that code >> requires types with a natural ordering. (The standard algorithms >> have variants that either assume "operator <" or take in a >> comparison parameter.) I think specializing std::less<> for types that don't have a natural order is /exactly/ the right way to enable such types to be stored in an associative container. The algorithms are a different case. sort doesn't make sense for a type that doesn't have a natural order, and in that case the user needs to provide an appropriate comparison. >> >> Making a fake "operator <" just for ordered containers invalidates >> the work of those who added comparison parameters in standard >> classes/functions. > > You have a point there, no doubt. On the other hand, Library writers > should supply some kind of functor to be used with their types in > conjunction with ordered containers (when appropriate, and > boost::variant is of course appropriate). How should this functor be > called? You might say there should be some convention, but there isn't > any right now, and some libraries use operator< for this purpose. Is > it > that bad if operator< is the convention? I'm not sure. It's sure is > convenient to use ordered containers like that... And it seems to me > that there is no major drawback to this, because no other order > operator > is provided. But I guess it's highly dependent on taste... > >> The issue is different for the "==" and "!=" operators because two >> objects can have their state checked for equivalence without having >> a standardized order. The "std::complex<>" template classes are an >> example. > > std::complex doesn't have operator<. std::tr1::shared_ptr does. So it > seems the standard isn't very helpfully consistent here... > >>> boost::shared_ptr is a good example of such a class with no natural >>> ordering, with operator== and !=, with operator<, but without the >>> other operators. And shared_ptr is of TR1 strength... >> >> Ordering for pointers is generally defined if both pointers are part >> of the same array segment. (Either one or both of the pointers can >> be at the "one-past-the-end" point of said segment.) If two >> "shared_ptr" objects can be used for points in an array segment[1], >> then comparison can be allowed with ALL four operators ("<", ">", >> "<=", and ">="). Otherwise, none of those operators should be >> defined and any current existence of such operators should be >> considered a bug. > > I didn't quite understand that last paragraph. shared_ptrs doesn't > have > to point to objects in array (actually, they better not), but there > can > be arrays of shared_ptrs. So should the shared_ptr class provide order > operators or shouldn't it? Anyway, the committee already made up it > mind > about the answer to this question... > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 203894

5 7

Re: [boost] Please don't define a fake "operator <" justfororderedcontainers
by Sohail Somani 18 Jul '06

18 Jul '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of me22 > Sent: Monday, July 10, 2006 5:07 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] Please don't define a fake "operator <" > justfororderedcontainers > > On 7/10/06, Sohail Somani <s.somani(a)fincad.com> wrote: > > Isn't shared_ptr<T> is supposed to be like T* which has ordering? In > > this case, it's a non-issue no? > > > My understanding is that < is only well-defined for pointers into the > same array and that < between to arbitrary pointers is otherwise some > sort of UB. > > It's less<T*> that provides a full ordering for arbitrary T*s. (By > specialising std::less.) Sorry for the double email, but I guess with this information atleast we can verify that operator < is using less?

2 1

[variant] wish list
by Yuval Ronen 18 Jul '06

18 Jul '06

Hi Eric! It's good to see that you've got back to the list. For a long time now, there was no one to answer users' questions and comments, So I'm taking this (rare :-) ) opportunity to present my wish list for Boost.Variant. First of all, I'd like to say that I think it's a great library. I've become addicted to it... However, there are some things I think are missing. 1. add operator != There's operator==, and adding operator!= would be both easy and useful. 2. apply_visitor should accept the visitor by value std algorithms (such as for_each) accept their functors by value, not by [const] reference. I think that visitors should be considered as variant's equivalent to std functors, and thus be passed by value. This will allow me to pass temporary visitor objects, which is a very common use case, just as with std functors. It will also allow you to delete the two versions of apply_visitor (one taking a reference, one taking a const reference), and leave only one. 3. add support for non-copyable types, a-la Boost.Optional's in-place factory I found myself needing a variant of non-copyable types, and had to resort to dynamic allocation to solve it. Luckily for me, it wasn't a performance-critical code, so I could live with it. But of course it's not optimal... 4. add more flavours of get() Currently the get<T>() function has the semantics of "return current value only if it is of type implicitly convertible to T". But there are other usages, even more useful than this (and if there are other get()s, the name of the original get() should be changed to, for example, get_implicit). One of them is "return current value only if it is exactly of type T (using type_info)". The function will not compile if T is not any of the variant's types. A possible name for it could be get_exact(), but of course there might be better names. Another usage I found useful is when all of the variant's types are implicitly convertible to a common T (e.g, they all inherit from T). This function will not compile if any of the variant's types can't be implicitly convertible to T, but if it does compile, then it ensures it can't fail in run-time (in contrast to get_implicit and get_exact, which can fail in run-time). A possible name is get_common(). I've attached a file containing my implementation of get_exact and get_common, in case you're interested. All the preprocessor magic there is beyond my understanding, I just copied it from your code, and hope I didn't make any mistakes... 5. support for reference types I don't know if Boost.Variant currently supports reference types, nor am I certain it should, but it's a possibility... There was a debate about Boost.Optional's support for reference types, which reached no clear conclusion. Maybe you're familiar with the details, but if not, in short, the problem is with code such as int a = ...; int b = ...; optional<int &> x; // x in initialized to 'empty' x = a; // x is binded to a's reference x = b; // is x rebinded to b's reference, or is a assigned the value in b? The reason I bring it up here, is because I think it's relevant to Boost.Variant as well. Variant of reference types will raise the exact same questions, which should probably get the exact same answers. IOW, both the question of whether to support reference types, and the question of how to support them, should apply to both Boost.Optional and Boost.Variant uniformly. It's an open issue. 6. propose it for TR2 For the benefit of all of us... Thanks again for a great library, Yuval #ifndef VariantGet_h #define VariantGet_h #include <Utils/Variant.h> #include <boost/mpl/assert.hpp> #include <boost/mpl/contains.hpp> namespace boost { template <typename T> struct get_common_visitor : public static_visitor<T> { T operator()(T t) { return t; } }; template <typename T, typename Variant> typename add_reference<T>::type get_common(Variant &v) { get_common_visitor<typename add_reference<T>::type> visitor; return v.apply_visitor(visitor); } template <typename T, typename Variant> typename add_reference<const T>::type get_common(const Variant &v) { get_common_visitor<typename add_reference<const T>::type> visitor; return v.apply_visitor(visitor); } template <typename T, typename Variant> void assert_variant_has_type(const Variant &) { BOOST_MPL_ASSERT((mpl::contains<typename Variant::types, T>)); } template <typename T> struct get_exact_visitor : public static_visitor<T> { T operator()(T t) { return t; } }; template <typename U, BOOST_VARIANT_ENUM_PARAMS(typename T) > inline typename add_pointer::type get_exact( boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) >* operand BOOST_VARIANT_AUX_GET_EXPLICIT_TEMPLATE_TYPE(U)) { assert_variant_has_type(*operand); typedef typename add_pointer::type U_ptr; if (!operand) return static_cast<U_ptr>(0); if (operand->type() != typeid(U)) return static_cast<U_ptr>(0); detail::variant::get_visitor v; return operand->apply_visitor(v); } template <typename U, BOOST_VARIANT_ENUM_PARAMS(typename T) > inline typename add_pointer<const U>::type get_exact( const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) >* operand BOOST_VARIANT_AUX_GET_EXPLICIT_TEMPLATE_TYPE(U)) { assert_variant_has_type(*operand); typedef typename add_pointer<const U>::type U_ptr; if (!operand) return static_cast<U_ptr>(0); if (operand->type() != typeid(U)) return static_cast<U_ptr>(0); detail::variant::get_visitor<const U> v; return operand->apply_visitor(v); } template <typename U, BOOST_VARIANT_ENUM_PARAMS(typename T) > inline typename add_reference::type get_exact( boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) >& operand BOOST_VARIANT_AUX_GET_EXPLICIT_TEMPLATE_TYPE(U)) { typedef typename add_pointer::type U_ptr; U_ptr result = get_exact(&operand); if (!result) throw bad_get(); return *result; } template <typename U, BOOST_VARIANT_ENUM_PARAMS(typename T) > inline typename add_reference<const U>::type get_exact( const boost::variant< BOOST_VARIANT_ENUM_PARAMS(T) >& operand BOOST_VARIANT_AUX_GET_EXPLICIT_TEMPLATE_TYPE(U)) { typedef typename add_pointer<const U>::type U_ptr; U_ptr result = get_exact<const U>(&operand); if (!result) throw bad_get(); return *result; } } // namespace #endif /* ! defined VariantGet_h */

6 13

Boost inspection notification (2006-07-18/RC_1_34_0) *LC*
by Rene Rivera 18 Jul '06

18 Jul '06

Boost Inspection Report Run Date: 20:05:31 UTC, Tuesday 18 July 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: 11601 files scanned 900 directories scanned 4211 problems reported Problem counts: 2560 files missing Boost license info 1651 files missing copyrights Summary: algorithm (21) any (3) archive (1) array (3) assign (6) bind (9) boost-root (8) boostbook (70) build (472) compatibility (2) compose (2) concept_check (28) conversion (5) date_time (17) detail (4) disjoint_sets (6) doc (54) filesystem (7) foreach (2) format (12) function (17) functional (10) graph (184) inspect (1) integer (9) io (2) iostreams (2) iterator (152) jam (2) lambda (14) libs (8) logic (2) math (1) mem_fn (2) more (29) mpl (926) multi_array (20) numeric (215) optional (3) parameter (11) people (90) pool (32) preprocessor (887) program_options (45) property_map (17) ptr_container (113) python (171) quickbook (11) random (22) range (18) rational (5) regex (4) regression (68) release (3) serialization (16) signals (32) smart_ptr (15) spirit (10) test (7) thread (117) timer (3) tokenizer (9) tools (6) tuple (9) typeof (56) unknown (1) utility (28) variant (43) wiki (2) xpressive (29) Details: *L* missing Boost license info *C* missing copyright |algorithm| libs/algorithm/string/doc/concept.xml: *C* *L* libs/algorithm/string/doc/credits.xml: *C* *L* libs/algorithm/string/doc/design.xml: *C* *L* libs/algorithm/string/doc/environment.xml: *C* *L* libs/algorithm/string/doc/external_concepts.html: *L* libs/algorithm/string/doc/intro.xml: *C* *L* libs/algorithm/string/doc/quickref.xml: *C* *L* libs/algorithm/string/doc/rationale.xml: *C* *L* libs/algorithm/string/doc/release_notes.xml: *C* *L* libs/algorithm/string/doc/usage.xml: *C* *L* libs/algorithm/string/index.html: *C* *L* |any| libs/any/doc/any.xml: *L* libs/any/index.html: *C* *L* |archive| boost/archive/detail/utf8_codecvt_facet.hpp: *L* |array| libs/array/doc/array.xml: *L* libs/array/index.html: *C* *L* |assign| libs/assign/doc/style.css: *C* *L* libs/assign/index.html: *C* *L* libs/assign/test/TODO: *C* *L* |bind| libs/bind/bind.html: *L* libs/bind/doc/ref.xml: *L* libs/bind/index.html: *C* *L* libs/bind/mem_fn.html: *L* libs/bind/ref.html: *C* *L* libs/bind/test/Jamfile: *L* libs/bind/test/Jamfile.v2: *L* |boost-root| Jamfile.v2: *C* *L* README: *C* boost.css: *C* *L* project-root.jam: *C* *L* rst.css: *L* |boostbook| tools/boostbook/doc/Jamfile.v2: *C* *L* tools/boostbook/doc/boostbook.xml: *L* tools/boostbook/doc/documenting.xml: *C* *L* tools/boostbook/doc/reference.xml: *L* tools/boostbook/doc/together.xml: *C* *L* tools/boostbook/setup_boostbook.py: *C* *L* tools/boostbook/setup_boostbook.sh: *C* *L* tools/boostbook/xsl/admon.xsl: *C* *L* tools/boostbook/xsl/annotation.xsl: *C* *L* tools/boostbook/xsl/caramel/concept2docbook.xsl: *L* tools/boostbook/xsl/caramel/cpp-operators.xml: *L* tools/boostbook/xsl/caramel/unparser.xsl: *L* tools/boostbook/xsl/chunk-common.xsl: *C* *L* tools/boostbook/xsl/docbook-layout.xsl: *C* *L* tools/boostbook/xsl/docbook.xsl: *C* *L* tools/boostbook/xsl/doxygen/collect.xsl: *C* *L* tools/boostbook/xsl/doxygen/doxygen2boostbook.xsl: *C* *L* tools/boostbook/xsl/dtd/dtd2boostbook.xsl: *C* *L* tools/boostbook/xsl/error.xsl: *C* *L* tools/boostbook/xsl/fo.xsl: *C* *L* tools/boostbook/xsl/function.xsl: *C* *L* tools/boostbook/xsl/global.xsl: *C* *L* tools/boostbook/xsl/html-single.xsl: *C* *L* tools/boostbook/xsl/html.xsl: *L* tools/boostbook/xsl/index.xsl: *C* *L* tools/boostbook/xsl/library.xsl: *L* tools/boostbook/xsl/lookup.xsl: *C* *L* tools/boostbook/xsl/macro.xsl: *C* *L* tools/boostbook/xsl/manpages.xsl: *C* *L* tools/boostbook/xsl/navbar.xsl: *C* *L* tools/boostbook/xsl/reference.xsl: *C* *L* tools/boostbook/xsl/relative-href.xsl: *C* *L* tools/boostbook/xsl/source-highlight.xsl: *C* *L* tools/boostbook/xsl/template.xsl: *C* *L* tools/boostbook/xsl/testing/Jamfile.xsl: *L* tools/boostbook/xsl/testing/testsuite.xsl: *C* *L* tools/boostbook/xsl/type.xsl: *C* *L* tools/boostbook/xsl/utility.xsl: *C* *L* tools/boostbook/xsl/xref.xsl: *C* *L* |build| tools/build/boost.css: *C* *L* tools/build/index.html: *C* *L* tools/build/v1/como-tools.jam: *L* tools/build/v1/edg-tools.html: *C* tools/build/v1/gcc-nocygwin-tools.html: *C* *L* tools/build/v1/gcc-nocygwin-tools.jam: *L* tools/build/v1/gen_aix_import_file.py: *C* *L* tools/build/v1/hacking.txt: *C* *L* tools/build/v1/mipspro-tools.jam: *C* *L* tools/build/v1/msvc-tools.html: *C* tools/build/v1/python.jam: *C* *L* tools/build/v1/stlport.jam: *L* tools/build/v1/sunpro-stlport-tools.jam: *L* tools/build/v1/sunpro-tools.html: *C* *L* tools/build/v1/sunpro-tools.jam: *L* tools/build/v1/test/test-testing.jam: *C* *L* tools/build/v1/vacpp-tools.jam: *L* tools/build/v1/vc-7_1-stlport-tools.jam: *C* *L* tools/build/v1/vc-7_1-tools.jam: *C* *L* tools/build/v1/vc-8_0-amd64-tools.jam: *C* *L* tools/build/v1/vc-8_0-tools.jam: *C* *L* tools/build/v1/vc-8_0-x86_amd64-tools.jam: *C* *L* tools/build/v1/vc7-stlport-tools.jam: *C* *L* tools/build/v1/vc7-tools.jam: *C* *L* tools/build/v2/boost-build.jam: *C* *L* tools/build/v2/boost.css: *C* *L* tools/build/v2/build-system.jam: *L* tools/build/v2/build/alias.jam: *L* tools/build/v2/build/build-request.jam: *L* tools/build/v2/build/feature.jam: *L* tools/build/v2/build/generators.jam: *L* tools/build/v2/build/modifiers.jam: *L* tools/build/v2/build/project.jam: *L* tools/build/v2/build/property-set.jam: *L* tools/build/v2/build/property.jam: *L* tools/build/v2/build/readme.txt: *C* *L* tools/build/v2/build/scanner.jam: *L* tools/build/v2/build/targets.jam: *L* tools/build/v2/build/toolset.jam: *L* tools/build/v2/build/type.jam: *L* tools/build/v2/build/version.jam: *L* tools/build/v2/build/virtual-target.jam: *L* tools/build/v2/changes.txt: *C* *L* tools/build/v2/doc/Jamfile.v2: *C* *L* tools/build/v2/doc/development_plan.html: *L* tools/build/v2/doc/src/advanced.xml: *C* *L* tools/build/v2/doc/src/architecture.xml: *C* *L* tools/build/v2/doc/src/catalog.xml: *C* *L* tools/build/v2/doc/src/extending.xml: *C* *L* tools/build/v2/doc/src/faq.xml: *C* *L* tools/build/v2/doc/src/howto.xml: *C* *L* tools/build/v2/doc/src/install.xml: *C* *L* tools/build/v2/doc/src/recipes.xml: *C* *L* tools/build/v2/doc/src/reference.xml: *C* *L* tools/build/v2/doc/src/standalone.xml: *C* *L* tools/build/v2/doc/src/tutorial.xml: *C* *L* tools/build/v2/doc/src/userman.xml: *C* *L* tools/build/v2/doc/tools.html: *L* tools/build/v2/example/boost-build.jam: *C* *L* tools/build/v2/example/customization/Jamfile: *C* *L* tools/build/v2/example/customization/inline_file.py: *L* tools/build/v2/example/customization/project-root.jam: *C* *L* tools/build/v2/example/customization/readme.txt: *C* *L* tools/build/v2/example/customization/verbatim.jam: *L* tools/build/v2/example/gettext/Jamfile: *C* *L* tools/build/v2/example/gettext/project-root.jam: *C* *L* tools/build/v2/example/gettext/readme.txt: *C* *L* tools/build/v2/example/libraries/app/Jamfile: *C* *L* tools/build/v2/example/libraries/util/foo/Jamfile: *C* *L* tools/build/v2/example/make/readme.txt: *C* *L* tools/build/v2/example/qt/README.txt: *C* *L* tools/build/v2/example/variant/Jamfile: *C* *L* tools/build/v2/example/variant/libs/Jamfile: *C* *L* tools/build/v2/example/variant/project-root.jam: *C* *L* tools/build/v2/example/variant/readme.txt: *C* *L* tools/build/v2/example/versioned/jamfile.jam: *L* tools/build/v2/example/versioned/project-root.jam: *L* tools/build/v2/generators_prototype.py: *L* tools/build/v2/hacking.txt: *C* *L* tools/build/v2/index.html: *L* tools/build/v2/kernel/boost-build.jam: *L* tools/build/v2/kernel/bootstrap.jam: *L* tools/build/v2/kernel/class.jam: *L* tools/build/v2/kernel/errors.jam: *L* tools/build/v2/kernel/modules.jam: *L* tools/build/v2/nightly.sh: *C* *L* tools/build/v2/notes/README.txt: *C* *L* tools/build/v2/notes/build_dir_option.txt: *C* *L* tools/build/v2/notes/relative_source_paths.txt: *C* *L* tools/build/v2/options/help.jam: *L* tools/build/v2/release_procedure.txt: *C* *L* tools/build/v2/roll.sh: *C* *L* tools/build/v2/site-config.jam: *L* tools/build/v2/test/BoostBuild.py: *C* *L* tools/build/v2/test/Jamfile: *C* *L* tools/build/v2/test/TestCmd.py: *L* tools/build/v2/test/abs_workdir.py: *C* *L* tools/build/v2/test/absolute_sources.py: *C* *L* tools/build/v2/test/alias.py: *C* *L* tools/build/v2/test/alternatives.py: *C* *L* tools/build/v2/test/assert-equal.jam: *C* *L* tools/build/v2/test/bad_dirname.py: *L* tools/build/v2/test/boost-build.jam: *C* *L* tools/build/v2/test/boostbook.py: *L* tools/build/v2/test/boostbook/a.hpp: *C* *L* tools/build/v2/test/boostbook/docs.xml: *L* tools/build/v2/test/build_dir.py: *C* *L* tools/build/v2/test/c_file.py: *L* tools/build/v2/test/chain.py: *C* *L* tools/build/v2/test/check-arguments.jam: *L* tools/build/v2/test/check-bindrule.jam: *C* *L* tools/build/v2/test/check-jam-patches.jam: *C* *L* tools/build/v2/test/check-test-tools.jam: *C* *L* tools/build/v2/test/composite.py: *L* tools/build/v2/test/conditionals.py: *C* *L* tools/build/v2/test/conditionals2.py: *L* tools/build/v2/test/conditionals3.py: *L* tools/build/v2/test/core_d12.py: *C* *L* tools/build/v2/test/core_delete_module.py: *C* *L* tools/build/v2/test/core_dependencies.py: *C* *L* tools/build/v2/test/core_import_module.py: *L* tools/build/v2/test/core_modifiers.py: *C* *L* tools/build/v2/test/core_typecheck.py: *C* *L* tools/build/v2/test/core_varnames.py: *C* *L* tools/build/v2/test/custom_generator.py: *L* tools/build/v2/test/default_build.py: *C* *L* tools/build/v2/test/default_features.py: *L* tools/build/v2/test/dependency-test/Jamfile: *C* *L* tools/build/v2/test/dependency-test/foo.jam: *C* *L* tools/build/v2/test/dependency-test/project-root.jam: *C* *L* tools/build/v2/test/dependency-test/src1/z.h: *C* *L* tools/build/v2/test/dependency_property.py: *L* tools/build/v2/test/dependency_test.py: *C* *L* tools/build/v2/test/direct-request-test/Jamfile: *C* *L* tools/build/v2/test/direct-request-test/project-root.jam: *C* *L* tools/build/v2/test/direct_request_test.py: *C* *L* tools/build/v2/test/dll_path.py: *L* tools/build/v2/test/double_loading.py: *L* tools/build/v2/test/duplicate.py: *L* tools/build/v2/test/echo_args.jam: *C* *L* tools/build/v2/test/empty.jam: *C* *L* tools/build/v2/test/expansion.py: *L* tools/build/v2/test/explicit.py: *L* tools/build/v2/test/gcc_runtime.py: *L* tools/build/v2/test/generators-test/Jamfile: *C* *L* tools/build/v2/test/generators-test/extra.jam: *C* *L* tools/build/v2/test/generators-test/lex.jam: *L* tools/build/v2/test/generators-test/lib/Jamfile: *C* *L* tools/build/v2/test/generators-test/nm.jam: *C* *L* tools/build/v2/test/generators-test/project-root.jam: *C* *L* tools/build/v2/test/generators-test/qt.jam: *C* *L* tools/build/v2/test/generators_test.py: *C* *L* tools/build/v2/test/glob.py: *L* tools/build/v2/test/inherit_toolset.py: *L* tools/build/v2/test/inline.py: *L* tools/build/v2/test/library_chain.py: *L* tools/build/v2/test/library_order.py: *L* tools/build/v2/test/library_property.py: *L* tools/build/v2/test/loop.py: *L* tools/build/v2/test/m1-01.py: *C* *L* tools/build/v2/test/m1-02.py: *C* *L* tools/build/v2/test/m1-03.py: *C* *L* tools/build/v2/test/make_rule.py: *C* *L* tools/build/v2/test/module-actions/boost-build.jam: *C* *L* tools/build/v2/test/module-actions/bootstrap.jam: *C* *L* tools/build/v2/test/module_actions.py: *C* *L* tools/build/v2/test/ndebug.py: *L* tools/build/v2/test/no_type.py: *C* *L* tools/build/v2/test/ordered_properties.py: *L* tools/build/v2/test/path_features.py: *C* *L* tools/build/v2/test/prebuilt.py: *C* *L* tools/build/v2/test/prebuilt/Jamfile: *C* *L* tools/build/v2/test/prebuilt/ext/Jamfile: *C* *L* tools/build/v2/test/prebuilt/ext/project-root.jam: *C* *L* tools/build/v2/test/prebuilt/project-root.jam: *C* *L* tools/build/v2/test/print.py: *C* *L* tools/build/v2/test/project-test1.jam: *C* *L* tools/build/v2/test/project-test1/Jamfile: *C* *L* tools/build/v2/test/project-test1/dir/Jamfile: *C* *L* tools/build/v2/test/project-test1/dir2/Jamfile: *C* *L* tools/build/v2/test/project-test1/dir2/project-root.jam: *C* *L* tools/build/v2/test/project-test1/project-root.jam: *C* *L* tools/build/v2/test/project-test1/project-test1.jam: *C* *L* tools/build/v2/test/project-test1/readme.txt: *C* *L* tools/build/v2/test/project-test1/standalone-project.jam: *C* *L* tools/build/v2/test/project-test3/Jamfile: *C* *L* tools/build/v2/test/project-test3/lib/Jamfile: *C* *L* tools/build/v2/test/project-test3/lib2/Jamfile: *C* *L* tools/build/v2/test/project-test3/lib2/helper/Jamfile: *C* *L* tools/build/v2/test/project-test3/lib3/Jamfile: *C* *L* tools/build/v2/test/project-test3/lib3/project-root.jam: *C* *L* tools/build/v2/test/project-test3/project-root.jam: *C* *L* tools/build/v2/test/project-test3/readme.txt: *C* *L* tools/build/v2/test/project-test4/Jamfile: *C* *L* tools/build/v2/test/project-test4/lib/Jamfile: *C* *L* tools/build/v2/test/project-test4/lib2/Jamfile: *C* *L* tools/build/v2/test/project-test4/project-root.jam: *C* *L* tools/build/v2/test/project-test4/readme.txt: *C* *L* tools/build/v2/test/project_dependencies.py: *C* *L* tools/build/v2/test/project_root_constants.py: *L* tools/build/v2/test/project_test1.py: *C* *L* tools/build/v2/test/project_test3.py: *C* *L* tools/build/v2/test/project_test4.py: *C* *L* tools/build/v2/test/property_expansion.py: *L* tools/build/v2/test/railsys.py: *L* tools/build/v2/test/railsys/libx/project-root.jam: *C* *L* tools/build/v2/test/railsys/libx/src/Jamfile: *L* tools/build/v2/test/railsys/program/Jamfile: *L* tools/build/v2/test/railsys/program/liba/Jamfile: *L* tools/build/v2/test/railsys/program/main/Jamfile: *L* tools/build/v2/test/railsys/program/project-root.jam: *C* *L* tools/build/v2/test/readme.txt: *C* *L* tools/build/v2/test/rebuilds.py: *C* *L* tools/build/v2/test/recursive.jam: *L* tools/build/v2/test/regression.py: *L* tools/build/v2/test/relative_sources.py: *C* *L* tools/build/v2/test/searched_lib.py: *C* *L* tools/build/v2/test/skipping.py: *L* tools/build/v2/test/stage.py: *C* *L* tools/build/v2/test/standalone.py: *L* tools/build/v2/test/startup/boost-root/boost-build.jam: *C* *L* tools/build/v2/test/startup/boost-root/build/boost-build.jam: *C* *L* tools/build/v2/test/startup/boost-root/build/bootstrap.jam: *C* *L* tools/build/v2/test/startup/bootstrap-env/boost-build.jam: *C* *L* tools/build/v2/test/startup/bootstrap-explicit/boost-build.jam: *C* *L* tools/build/v2/test/startup/bootstrap-implicit/readme.txt: *C* *L* tools/build/v2/test/startup/no-bootstrap1/boost-build.jam: *C* *L* tools/build/v2/test/startup/no-bootstrap1/subdir/readme.txt: *C* *L* tools/build/v2/test/startup/no-bootstrap2/boost-build.jam: *C* *L* tools/build/v2/test/startup/no-bootstrap3/boost-build.jam: *C* *L* tools/build/v2/test/startup_v1.py: *C* *L* tools/build/v2/test/startup_v2.py: *C* *L* tools/build/v2/test/suffix.py: *L* tools/build/v2/test/svn_tree.py: *L* tools/build/v2/test/symlink.py: *C* *L* tools/build/v2/test/tag.py: *L* tools/build/v2/test/test-config-example.jam: *C* *L* tools/build/v2/test/test.jam: *C* *L* tools/build/v2/test/test1.py: *C* *L* tools/build/v2/test/test2.py: *C* *L* tools/build/v2/test/test2/Jamfile: *C* *L* tools/build/v2/test/test_all.py: *C* *L* tools/build/v2/test/test_nt_line_length.jam: *L* tools/build/v2/test/test_system.html: *L* tools/build/v2/test/testing-primitives/boost-build.jam: *C* *L* tools/build/v2/test/testing-primitives/bootstrap.jam: *C* *L* tools/build/v2/test/testing_primitives.py: *C* *L* tools/build/v2/test/tree.py: *L* tools/build/v2/test/unit-tests.jam: *L* tools/build/v2/test/unit_test.py: *L* tools/build/v2/test/unit_tests.py: *C* *L* tools/build/v2/test/unused.py: *C* *L* tools/build/v2/test/unused/Jamfile: *C* *L* tools/build/v2/test/unused/b.cpp: *C* *L* tools/build/v2/test/unused/project-root.jam: *C* *L* tools/build/v2/test/use_requirements.py: *C* *L* tools/build/v2/test/v1-testing/Jamfile: *C* *L* tools/build/v2/test/v1-testing/boost-build.jam: *C* *L* tools/build/v2/test/v1_testing.py: *C* *L* tools/build/v2/test/v1_testing/Jamfile: *C* *L* tools/build/v2/test/v1_testing/boost-build.jam: *C* *L* tools/build/v2/test/v1_testing/project-root.jam: *C* *L* tools/build/v2/test/wrapper.py: *L* tools/build/v2/tools/bison.jam: *L* tools/build/v2/tools/boostbook.jam: *L* tools/build/v2/tools/borland.jam: *L* tools/build/v2/tools/builtin.jam: *L* tools/build/v2/tools/common.jam: *L* tools/build/v2/tools/como-linux.jam: *L* tools/build/v2/tools/darwin.jam: *L* tools/build/v2/tools/doxygen.jam: *L* tools/build/v2/tools/gettext.jam: *L* tools/build/v2/tools/kylix.jam: *L* tools/build/v2/tools/lex.jam: *L* tools/build/v2/tools/make.jam: *L* tools/build/v2/tools/qt3.jam: *L* tools/build/v2/tools/stage.jam: *L* tools/build/v2/tools/stlport.jam: *L* tools/build/v2/tools/sun.jam: *L* tools/build/v2/tools/symlink.jam: *L* tools/build/v2/tools/testing.jam: *L* tools/build/v2/tools/xsltproc.jam: *L* tools/build/v2/user-config.jam: *L* tools/build/v2/util/assert.jam: *L* tools/build/v2/util/container.jam: *L* tools/build/v2/util/doc.jam: *L* tools/build/v2/util/indirect.jam: *L* tools/build/v2/util/numbers.jam: *L* tools/build/v2/util/os.jam: *L* tools/build/v2/util/path.jam: *L* tools/build/v2/util/print.jam: *L* tools/build/v2/util/regex.jam: *L* tools/build/v2/util/sequence.jam: *L* tools/build/v2/util/set.jam: *L* tools/build/v2/util/string.jam: *L* tools/build/v2/util/utility.jam: *L* |compatibility| libs/compatibility/generate_cpp_c_headers.py: *L* libs/compatibility/index.html: *L* |compose| libs/compose/index.htm: *C* *L* |concept_check| libs/concept_check/Jamfile: *C* *L* libs/concept_check/Jamfile.v2: *C* *L* libs/concept_check/bibliography.htm: *L* libs/concept_check/concept_check.htm: *L* libs/concept_check/concept_covering.htm: *L* libs/concept_check/creating_concepts.htm: *L* libs/concept_check/doc/Jamfile.v2: *C* *L* libs/concept_check/doc/reference/Assignable.xml: *L* libs/concept_check/doc/reference/BidirectionalIterator.xml: *L* libs/concept_check/doc/reference/CopyConstructible.xml: *L* libs/concept_check/doc/reference/DefaultConstructible.xml: *L* libs/concept_check/doc/reference/EqualityComparable.xml: *L* libs/concept_check/doc/reference/ForwardIterator.xml: *L* libs/concept_check/doc/reference/InputIterator.xml: *L* libs/concept_check/doc/reference/LessThanComparable.xml: *L* libs/concept_check/doc/reference/OutputIterator.xml: *L* libs/concept_check/doc/reference/RandomAccessIterator.xml: *L* libs/concept_check/doc/reference/SignedInteger.xml: *L* libs/concept_check/doc/reference/concepts.xml: *L* libs/concept_check/implementation.htm: *L* libs/concept_check/index.html: *C* *L* libs/concept_check/prog_with_concepts.htm: *L* libs/concept_check/reference.htm: *L* libs/concept_check/using_concept_check.htm: *L* |conversion| libs/conversion/cast.htm: *L* libs/conversion/index.html: *C* *L* libs/conversion/lexical_cast.htm: *L* libs/conversion/test/Jamfile.v2: *L* |date_time| libs/date_time/build/Jamfile.v2: *L* libs/date_time/doc/index.html: *C* *L* libs/date_time/example/gregorian/Jamfile.v2: *C* *L* libs/date_time/example/posix_time/Jamfile.v2: *C* *L* libs/date_time/index.html: *C* *L* libs/date_time/xmldoc/Jamfile.v2: *L* libs/date_time/xmldoc/README: *C* *L* libs/date_time/xmldoc/exclusive_date_time.xml: *C* *L* libs/date_time/xmldoc/license.xml: *L* libs/date_time/xmldoc/motivation.xml: *C* *L* |detail| boost/detail/algorithm.hpp: *L* boost/detail/endian.hpp: *L* boost/detail/limits.hpp: *L* boost/detail/utf8_codecvt_facet.hpp: *L* |disjoint_sets| libs/disjoint_sets/Jamfile: *C* *L* libs/disjoint_sets/bibliography.html: *L* libs/disjoint_sets/disjoint_sets.html: *L* libs/disjoint_sets/index.html: *C* *L* |doc| doc/Jamfile.v2: *C* *L* doc/html/CopyConstructible.html: *C* *L* doc/html/any.html: *C* *L* doc/html/array.html: *C* *L* doc/html/boost_math.html: *C* *L* doc/html/boost_math/greatest_common_divisor_and_least_common_multiple.html: *C* *L* doc/html/boost_math/inverse_complex.html: *C* *L* doc/html/boost_staticassert.html: *C* *L* doc/html/boost_tr1.html: *C* *L* doc/html/boost_typetraits.html: *C* *L* doc/html/boost_typetraits/background.html: *C* *L* doc/html/boostbook.html: *C* *L* doc/html/date_time.html: *C* *L* doc/html/function.html: *C* *L* doc/html/functionN.html: *C* *L* doc/html/hash.html: *C* *L* doc/html/lambda.html: *C* *L* doc/html/program_options.html: *C* *L* doc/html/ref.html: *C* *L* doc/html/reference.css: *C* *L* doc/html/signals.html: *C* *L* doc/html/string_algo.html: *C* *L* doc/html/threads.html: *C* *L* doc/html/tribool.html: *C* *L* doc/html/variant.html: *C* *L* doc/html/who_s_using_boost_.html: *C* *L* doc/src/boost.xml: *C* *L* |filesystem| libs/filesystem/build/Jamfile.v2: *C* *L* libs/filesystem/doc/tr2_proposal.html: *L* libs/filesystem/example/Jamfile.v2: *C* *L* libs/filesystem/src/utf8_codecvt_facet.hpp: *L* libs/filesystem/test/Jamfile.v2: *L* |foreach| libs/foreach/index.html: *C* *L* |format| libs/format/Jamfile: *L* libs/format/benchmark/Jamfile: *L* libs/format/benchmark/bench_format.cpp: *C* libs/format/benchmark/results.txt: *C* *L* libs/format/doc/choices.html: *L* libs/format/doc/format.html: *C* libs/format/example/Jamfile: *L* libs/format/index.html: *C* *L* libs/format/test/Jamfile: *L* libs/format/test/Jamfile.v2: *L* |function| boost/function/detail/gen_maybe_include.pl: *L* libs/function/doc/Jamfile.v2: *C* *L* libs/function/doc/faq.xml: *C* *L* libs/function/doc/history.xml: *C* *L* libs/function/doc/misc.xml: *C* *L* libs/function/doc/reference.xml: *C* *L* libs/function/doc/tests.xml: *C* *L* libs/function/doc/tutorial.xml: *C* *L* libs/function/index.html: *C* *L* |functional| boost/functional.hpp: *L* libs/functional/binders.html: *L* libs/functional/function_test.cpp: *L* libs/functional/function_traits.html: *L* libs/functional/hash/doc/ref.xml: *C* *L* libs/functional/index.html: *L* libs/functional/mem_fun.html: *L* libs/functional/negators.html: *L* libs/functional/ptr_fun.html: *L* |graph| libs/graph/build/Jamfile: *C* *L* libs/graph/build/Jamfile.v2: *C* *L* libs/graph/doc/AStarHeuristic.html: *L* libs/graph/doc/AStarVisitor.html: *L* libs/graph/doc/AdjacencyGraph.html: *L* libs/graph/doc/AdjacencyMatrix.html: *L* libs/graph/doc/BFSVisitor.html: *L* libs/graph/doc/BasicMatrix.html: *L* libs/graph/doc/BellmanFordVisitor.html: *L* libs/graph/doc/BidirectionalGraph.html: *L* libs/graph/doc/Buffer.html: *L* libs/graph/doc/ColorValue.html: *L* libs/graph/doc/DFSVisitor.html: *L* libs/graph/doc/DijkstraVisitor.html: *L* libs/graph/doc/EdgeListGraph.html: *L* libs/graph/doc/EdgeMutableGraph.html: *L* libs/graph/doc/EventVisitor.html: *L* libs/graph/doc/EventVisitorList.html: *L* libs/graph/doc/Graph.html: *L* libs/graph/doc/IncidenceGraph.html: *L* libs/graph/doc/IteratorConstructibleGraph.html: *L* libs/graph/doc/Makefile: *C* *L* libs/graph/doc/Monoid.html: *L* libs/graph/doc/MutableGraph.html: *L* libs/graph/doc/MutablePropertyGraph.html: *L* libs/graph/doc/PropertyGraph.html: *L* libs/graph/doc/PropertyTag.html: *L* libs/graph/doc/VertexAndEdgeListGraph.html: *L* libs/graph/doc/VertexListGraph.html: *L* libs/graph/doc/VertexMutableGraph.html: *L* libs/graph/doc/acknowledgements.html: *L* libs/graph/doc/adjacency_iterator.html: *L* libs/graph/doc/adjacency_list.html: *L* libs/graph/doc/adjacency_list_traits.html: *L* libs/graph/doc/adjacency_matrix.html: *L* libs/graph/doc/astar_heuristic.html: *L* libs/graph/doc/astar_search.html: *L* libs/graph/doc/astar_visitor.html: *L* libs/graph/doc/bandwidth.html: *L* libs/graph/doc/bc_clustering.html: *L* libs/graph/doc/bellman_ford_shortest.html: *L* libs/graph/doc/bellman_visitor.html: *L* libs/graph/doc/betweenness_centrality.html: *L* libs/graph/doc/bfs_visitor.html: *L* libs/graph/doc/bgl_named_params.html: *L* libs/graph/doc/bibliography.html: *L* libs/graph/doc/biconnected_components.html: *L* libs/graph/doc/breadth_first_search.html: *L* libs/graph/doc/breadth_first_visit.html: *L* libs/graph/doc/challenge.html: *L* libs/graph/doc/circle_layout.html: *L* libs/graph/doc/compressed_sparse_row.html: *L* libs/graph/doc/connected_components.html: *L* libs/graph/doc/constructing_algorithms.html: *L* libs/graph/doc/copy_graph.html: *L* libs/graph/doc/cuthill_mckee_ordering.html: *L* libs/graph/doc/dag_shortest_paths.html: *L* libs/graph/doc/default.css: *L* libs/graph/doc/depth_first_search.html: *L* libs/graph/doc/depth_first_visit.html: *L* libs/graph/doc/dfs_visitor.html: *L* libs/graph/doc/dijkstra_shortest_paths.html: *L* libs/graph/doc/dijkstra_visitor.html: *L* libs/graph/doc/distance_recorder.html: *L* libs/graph/doc/edge_list.html: *L* libs/graph/doc/edmunds_karp_max_flow.html: *L* libs/graph/doc/erdos_renyi_generator.html: *L* libs/graph/doc/exception.html: *L* libs/graph/doc/faq.html: *L* libs/graph/doc/figs/Makefile: *C* *L* libs/graph/doc/file_dependency_example.html: *L* libs/graph/doc/filtered_graph.html: *L* libs/graph/doc/floyd_warshall_shortest.html: *L* libs/graph/doc/fruchterman_reingold.html: *L* libs/graph/doc/graph_coloring.html: *L* libs/graph/doc/graph_concepts.html: *L* libs/graph/doc/graph_theory_review.html: *L* libs/graph/doc/graph_traits.html: *L* libs/graph/doc/gursoy_atun_layout.html: *L* libs/graph/doc/history.html: *L* libs/graph/doc/incident.html: *L* libs/graph/doc/incremental_components.html: *L* libs/graph/doc/index.html: *L* libs/graph/doc/inv_adjacency_iterator.html: *L* libs/graph/doc/isomorphism.html: *L* libs/graph/doc/johnson_all_pairs_shortest.html: *L* libs/graph/doc/jwebfrob.pl: *C* *L* libs/graph/doc/kamada_kawai_spring_layout.html: *L* libs/graph/doc/kevin_bacon.html: *L* libs/graph/doc/king_ordering.html: *L* libs/graph/doc/known_problems.html: *L* libs/graph/doc/kruskal_min_spanning_tree.html: *L* libs/graph/doc/layout_tolerance.html: *C* *L* libs/graph/doc/leda_conversion.html: *L* libs/graph/doc/lengauer_tarjan_dominator_tree.htm: *L* libs/graph/doc/maximum_matching.html: *L* libs/graph/doc/minimum_degree_ordering.html: *L* libs/graph/doc/null_visitor.html: *L* libs/graph/doc/opposite.html: *L* libs/graph/doc/plod_generator.html: *L* libs/graph/doc/predecessor_recorder.html: *L* libs/graph/doc/prim_minimum_spanning_tree.html: *L* libs/graph/doc/profile.htm: *L* libs/graph/doc/property.html: *L* libs/graph/doc/property_map.html: *L* libs/graph/doc/property_writer.html: *L* libs/graph/doc/publications.html: *L* libs/graph/doc/push_relabel_max_flow.html: *L* libs/graph/doc/python.html: *L* libs/graph/doc/quick_tour.html: *L* libs/graph/doc/random.html: *L* libs/graph/doc/random_layout.html: *L* libs/graph/doc/read_graphviz.html: *C* *L* libs/graph/doc/read_graphviz.rst: *C* *L* libs/graph/doc/reverse_graph.html: *L* libs/graph/doc/sequential_vertex_coloring.html: *L* libs/graph/doc/sloan_ordering.htm: *L* libs/graph/doc/sloan_start_end_vertices.htm: *L* libs/graph/doc/small_world_generator.html: *L* libs/graph/doc/sorted_erdos_renyi_generator.html: *L* libs/graph/doc/sparse_matrix_ordering.html: *L* libs/graph/doc/stanford_graph.html: *L* libs/graph/doc/strong_components.html: *L* libs/graph/doc/subgraph.html: *L* libs/graph/doc/table_of_contents.html: *L* libs/graph/doc/time_stamper.html: *L* libs/graph/doc/topological_sort.html: *L* libs/graph/doc/transitive_closure.html: *L* libs/graph/doc/transpose_graph.html: *L* libs/graph/doc/trouble_shooting.html: *L* libs/graph/doc/undirected_dfs.html: *L* libs/graph/doc/users.html: *C* *L* libs/graph/doc/using_adjacency_list.html: *L* libs/graph/doc/using_property_maps.html: *L* libs/graph/doc/visitor_concepts.html: *L* libs/graph/doc/wavefront.htm: *L* libs/graph/doc/write-graphviz.html: *L* libs/graph/example/Jamfile: *C* *L* libs/graph/example/cuthill_mckee_ordering.cpp: *L* libs/graph/example/data1.txt: *C* *L* libs/graph/example/data2.txt: *C* *L* libs/graph/example/data3.txt: *C* *L* libs/graph/example/king_ordering.cpp: *L* libs/graph/example/property_iterator.cpp: *L* libs/graph/example/python/breadth_first_search.py: *C* *L* libs/graph/example/python/vis.py: *C* *L* libs/graph/example/regrtest.py: *C* *L* libs/graph/example/sloan_ordering.cpp: *L* libs/graph/index.html: *C* *L* libs/graph/src/Makefile: *C* *L* libs/graph/src/README: *C* *L* libs/graph/src/graphviz_digraph_lex.cpp: *L* libs/graph/src/graphviz_digraph_parser.hpp: *C* *L* libs/graph/src/graphviz_graph_lex.cpp: *L* libs/graph/src/graphviz_graph_parser.hpp: *C* *L* libs/graph/test/Jamfile: *C* *L* libs/graph/test/Jamfile.v2: *C* *L* libs/graph/test/cuthill_mckee_ordering.cpp: *L* libs/graph/test/dag_longest_paths.cpp: *C* *L* libs/graph/test/king_ordering.cpp: *L* |inspect| tools/inspect/build/Jamfile.v2: *L* |integer| libs/integer/cstdint.htm: *C* *L* libs/integer/doc/integer_mask.html: *L* libs/integer/doc/static_min_max.html: *L* libs/integer/index.html: *C* *L* libs/integer/integer.htm: *L* libs/integer/integer_traits.html: *C* *L* |io| libs/io/index.html: *C* *L* |iostreams| libs/iostreams/doc/menu.html: *C* libs/iostreams/test/detail/utf8_codecvt_facet.hpp: *L* |iterator| boost/iterator/zip_iterator.hpp: *L* libs/iterator/doc/BidirectionalTraversal.html: *C* *L* libs/iterator/doc/BidirectionalTraversal.rst: *C* *L* libs/iterator/doc/ForwardTraversal.html: *C* *L* libs/iterator/doc/ForwardTraversal.rst: *C* *L* libs/iterator/doc/IncrementableIterator.html: *C* *L* libs/iterator/doc/IncrementableIterator.rst: *C* *L* libs/iterator/doc/InteroperableIterator.rst: *C* *L* libs/iterator/doc/LvalueIterator.html: *C* *L* libs/iterator/doc/LvalueIterator.rst: *C* *L* libs/iterator/doc/RandomAccessTraversal.html: *C* *L* libs/iterator/doc/RandomAccessTraversal.rst: *C* *L* libs/iterator/doc/ReadableIterator.html: *C* *L* libs/iterator/doc/ReadableIterator.rst: *C* *L* libs/iterator/doc/SinglePassIterator.html: *C* *L* libs/iterator/doc/SinglePassIterator.rst: *C* *L* libs/iterator/doc/SwappableIterator.html: *C* *L* libs/iterator/doc/SwappableIterator.rst: *C* *L* libs/iterator/doc/WritableIterator.html: *C* *L* libs/iterator/doc/WritableIterator.rst: *C* *L* libs/iterator/doc/counting_iterator.html: *L* libs/iterator/doc/counting_iterator.rst: *L* libs/iterator/doc/counting_iterator_abstract.rst: *C* *L* libs/iterator/doc/counting_iterator_eg.rst: *C* *L* libs/iterator/doc/counting_iterator_ref.rst: *C* *L* libs/iterator/doc/default.css: *L* libs/iterator/doc/facade-and-adaptor.rst: *L* libs/iterator/doc/filter_iterator.html: *L* libs/iterator/doc/filter_iterator.rst: *L* libs/iterator/doc/filter_iterator_abstract.rst: *C* *L* libs/iterator/doc/filter_iterator_eg.rst: *C* *L* libs/iterator/doc/filter_iterator_ref.html: *L* libs/iterator/doc/filter_iterator_ref.rst: *L* libs/iterator/doc/func_output_iter_abstract.rst: *C* *L* libs/iterator/doc/func_output_iter_ref.rst: *C* *L* libs/iterator/doc/function_output_iterator.html: *L* libs/iterator/doc/function_output_iterator.rst: *L* libs/iterator/doc/function_output_iterator_eg.rst: *C* *L* libs/iterator/doc/index.html: *L* libs/iterator/doc/index.rst: *L* libs/iterator/doc/indirect_iterator.html: *L* libs/iterator/doc/indirect_iterator.rst: *L* libs/iterator/doc/indirect_iterator_abstract.rst: *C* *L* libs/iterator/doc/indirect_iterator_eg.rst: *C* *L* libs/iterator/doc/indirect_iterator_ref.html: *C* *L* libs/iterator/doc/indirect_iterator_ref.rst: *C* *L* libs/iterator/doc/interoperability-revisited.rst: *L* libs/iterator/doc/iter-issue-list.rst: *C* *L* libs/iterator/doc/iterator_adaptor.rst: *L* libs/iterator/doc/iterator_adaptor_abstract.rst: *L* libs/iterator/doc/iterator_adaptor_body.rst: *L* libs/iterator/doc/iterator_adaptor_ref.html: *L* libs/iterator/doc/iterator_adaptor_ref.rst: *L* libs/iterator/doc/iterator_archetypes.html: *L* libs/iterator/doc/iterator_archetypes.rst: *L* libs/iterator/doc/iterator_concepts.html: *L* libs/iterator/doc/iterator_concepts.rst: *L* libs/iterator/doc/iterator_facade.rst: *L* libs/iterator/doc/iterator_facade_abstract.rst: *C* *L* libs/iterator/doc/iterator_facade_body.rst: *L* libs/iterator/doc/iterator_facade_ref.rst: *L* libs/iterator/doc/iterator_traits.html: *L* libs/iterator/doc/iterator_traits.rst: *L* libs/iterator/doc/make_counting_iterator.rst: *C* *L* libs/iterator/doc/make_filter_iterator.html: *C* *L* libs/iterator/doc/make_filter_iterator.rst: *C* *L* libs/iterator/doc/make_reverse_iterator.rst: *C* *L* libs/iterator/doc/make_transform_iterator.rst: *C* *L* libs/iterator/doc/make_zip_iterator.rst: *C* *L* libs/iterator/doc/new-iter-concepts.html: *L* libs/iterator/doc/new-iter-concepts.rst: *L* libs/iterator/doc/permutation_iter_abstract.rst: *C* *L* libs/iterator/doc/permutation_iterator.html: *L* libs/iterator/doc/permutation_iterator.rst: *L* libs/iterator/doc/permutation_iterator_body.rst: *C* *L* libs/iterator/doc/permutation_iterator_eg.rst: *C* *L* libs/iterator/doc/permutation_iterator_ref.rst: *C* *L* libs/iterator/doc/pointee.rst: *L* libs/iterator/doc/reverse_iterator.html: *L* libs/iterator/doc/reverse_iterator.rst: *L* libs/iterator/doc/reverse_iterator_abstract.rst: *C* *L* libs/iterator/doc/reverse_iterator_eg.rst: *C* *L* libs/iterator/doc/reverse_iterator_ref.rst: *C* *L* libs/iterator/doc/transform_iterator.html: *L* libs/iterator/doc/transform_iterator.rst: *L* libs/iterator/doc/transform_iterator_abstract.rst: *C* *L* libs/iterator/doc/transform_iterator_eg.rst: *C* *L* libs/iterator/doc/transform_iterator_ref.rst: *C* *L* libs/iterator/doc/zip_iterator.html: *L* libs/iterator/doc/zip_iterator.rst: *L* libs/iterator/doc/zip_iterator_abstract.rst: *C* *L* libs/iterator/doc/zip_iterator_eg.rst: *C* *L* libs/iterator/doc/zip_iterator_ref.rst: *C* *L* libs/iterator/example/Jamfile: *C* *L* libs/iterator/index.html: *C* *L* libs/iterator/test/Jamfile: *L* libs/iterator/test/Jamfile.v2: *L* libs/iterator/test/zip_iterator_test.cpp: *L* |jam| tools/jam/index.html: *C* *L* |lambda| libs/lambda/doc/Jamfile.v2: *C* *L* libs/lambda/doc/detail/README: *C* *L* libs/lambda/doc/detail/lambda_doc.xsl: *C* *L* libs/lambda/doc/detail/lambda_doc_chunks.xsl: *C* *L* libs/lambda/doc/index.html: *C* *L* libs/lambda/index.html: *C* *L* libs/lambda/test/Makefile: *C* *L* |libs| libs/expected_results.xml: *C* *L* libs/index.html: *C* *L* libs/maintainers.txt: *C* *L* libs/platform_maintainers.txt: *C* *L* |logic| libs/logic/doc/Jamfile.v2: *C* *L* |math| boost/math/common_factor_rt.hpp: *L* |mem_fn| libs/mem_fn/index.html: *C* *L* |more| more/blanket-permission.txt: *C* more/borland_cpp.html: *C* *L* more/count_bdy.htm: *L* more/discussion_policy.htm: *C* more/error_handling.html: *L* more/generic_exception_safety.html: *C* *L* more/generic_programming.html: *L* more/microsoft_vcpp.html: *C* *L* more/moderators.html: *C* more/regression.html: *C* *L* more/report-jan-2006.html: *C* *L* more/writingdoc/design.html: *L* more/writingdoc/index.html: *L* more/writingdoc/introduction.html: *L* more/writingdoc/structure.html: *L* more/writingdoc/template/acknowledgments.html: *L* more/writingdoc/template/bibliography.html: *L* more/writingdoc/template/configuration.html: *L* more/writingdoc/template/definitions.html: *L* more/writingdoc/template/faq.html: *L* more/writingdoc/template/header.html: *L* more/writingdoc/template/index.html: *L* more/writingdoc/template/overview.html: *L* more/writingdoc/template/rationale.html: *L* |mpl| libs/mpl/doc/refmanual/accumulate.html: *C* *L* libs/mpl/doc/refmanual/acknowledgements.html: *C* *L* libs/mpl/doc/refmanual/advance.html: *C* *L* libs/mpl/doc/refmanual/algorithms-concepts.html: *C* *L* libs/mpl/doc/refmanual/algorithms.html: *C* *L* libs/mpl/doc/refmanual/always.html: *C* *L* libs/mpl/doc/refmanual/and.html: *C* *L* libs/mpl/doc/refmanual/apply-wrap.html: *C* *L* libs/mpl/doc/refmanual/apply.html: *C* *L* libs/mpl/doc/refmanual/arg.html: *C* *L* libs/mpl/doc/refmanual/arithmetic-operations.html: *C* *L* libs/mpl/doc/refmanual/assert-msg.html: *C* *L* libs/mpl/doc/refmanual/assert-not.html: *C* *L* libs/mpl/doc/refmanual/assert-relation.html: *C* *L* libs/mpl/doc/refmanual/assert.html: *C* *L* libs/mpl/doc/refmanual/asserts.html: *C* *L* libs/mpl/doc/refmanual/associative-sequence.html: *C* *L* libs/mpl/doc/refmanual/at-c.html: *C* *L* libs/mpl/doc/refmanual/at.html: *C* *L* libs/mpl/doc/refmanual/aux-lambda-support.html: *C* *L* libs/mpl/doc/refmanual/back-extensible-sequence.html: *C* *L* libs/mpl/doc/refmanual/back-inserter.html: *C* *L* libs/mpl/doc/refmanual/back.html: *C* *L* libs/mpl/doc/refmanual/begin.html: *C* *L* libs/mpl/doc/refmanual/bidirectional-iterator.html: *C* *L* libs/mpl/doc/refmanual/bidirectional-sequence.html: *C* *L* libs/mpl/doc/refmanual/bind.html: *C* *L* libs/mpl/doc/refmanual/bitand.html: *C* *L* libs/mpl/doc/refmanual/bitor.html: *C* *L* libs/mpl/doc/refmanual/bitwise-operations.html: *C* *L* libs/mpl/doc/refmanual/bitxor.html: *C* *L* libs/mpl/doc/refmanual/bool.html: *C* *L* libs/mpl/doc/refmanual/broken-compiler.html: *C* *L* libs/mpl/doc/refmanual/categorized-concepts.html: *C* *L* libs/mpl/doc/refmanual/categorized-index.html: *C* *L* libs/mpl/doc/refmanual/cfg-no-has-xxx.html: *C* *L* libs/mpl/doc/refmanual/cfg-no-preprocessed.html: *C* *L* libs/mpl/doc/refmanual/classes.html: *C* *L* libs/mpl/doc/refmanual/clear.html: *C* *L* libs/mpl/doc/refmanual/comparisons.html: *C* *L* libs/mpl/doc/refmanual/components.html: *C* *L* libs/mpl/doc/refmanual/composition-and-argument.html: *C* *L* libs/mpl/doc/refmanual/concepts.html: *C* *L* libs/mpl/doc/refmanual/configuration.html: *C* *L* libs/mpl/doc/refmanual/contains.html: *C* *L* libs/mpl/doc/refmanual/copy-if.html: *C* *L* libs/mpl/doc/refmanual/copy.html: *C* *L* libs/mpl/doc/refmanual/count-if.html: *C* *L* libs/mpl/doc/refmanual/count.html: *C* *L* libs/mpl/doc/refmanual/data-concepts.html: *C* *L* libs/mpl/doc/refmanual/data-miscellaneous.html: *C* *L* libs/mpl/doc/refmanual/data-types.html: *C* *L* libs/mpl/doc/refmanual/deque.html: *C* *L* libs/mpl/doc/refmanual/deref.html: *C* *L* libs/mpl/doc/refmanual/distance.html: *C* *L* libs/mpl/doc/refmanual/divides.html: *C* *L* libs/mpl/doc/refmanual/empty-base.html: *C* *L* libs/mpl/doc/refmanual/empty-sequence.html: *C* *L* libs/mpl/doc/refmanual/empty.html: *C* *L* libs/mpl/doc/refmanual/end.html: *C* *L* libs/mpl/doc/refmanual/equal-to.html: *C* *L* libs/mpl/doc/refmanual/equal.html: *C* *L* libs/mpl/doc/refmanual/erase-key.html: *C* *L* libs/mpl/doc/refmanual/erase.html: *C* *L* libs/mpl/doc/refmanual/eval-if-c.html: *C* *L* libs/mpl/doc/refmanual/eval-if.html: *C* *L* libs/mpl/doc/refmanual/extensible-associative.html: *C* *L* libs/mpl/doc/refmanual/extensible-sequence.html: *C* *L* libs/mpl/doc/refmanual/filter-view.html: *C* *L* libs/mpl/doc/refmanual/find-if.html: *C* *L* libs/mpl/doc/refmanual/find.html: *C* *L* libs/mpl/doc/refmanual/fold.html: *C* *L* libs/mpl/doc/refmanual/forward-iterator.html: *C* *L* libs/mpl/doc/refmanual/forward-sequence.html: *C* *L* libs/mpl/doc/refmanual/front-extensible-sequence.html: *C* *L* libs/mpl/doc/refmanual/front-inserter.html: *C* *L* libs/mpl/doc/refmanual/front.html: *C* *L* libs/mpl/doc/refmanual/greater-equal.html: *C* *L* libs/mpl/doc/refmanual/greater.html: *C* *L* libs/mpl/doc/refmanual/has-key.html: *C* *L* libs/mpl/doc/refmanual/has-xxx-trait-def.html: *C* *L* libs/mpl/doc/refmanual/has-xxx-trait-named-def.html: *C* *L* libs/mpl/doc/refmanual/identity.html: *C* *L* libs/mpl/doc/refmanual/if-c.html: *C* *L* libs/mpl/doc/refmanual/if.html: *C* *L* libs/mpl/doc/refmanual/inherit-linearly.html: *C* *L* libs/mpl/doc/refmanual/inherit.html: *C* *L* libs/mpl/doc/refmanual/insert-range.html: *C* *L* libs/mpl/doc/refmanual/insert.html: *C* *L* libs/mpl/doc/refmanual/inserter.html: *C* *L* libs/mpl/doc/refmanual/inserters-inserter.html: *C* *L* libs/mpl/doc/refmanual/inserters.html: *C* *L* libs/mpl/doc/refmanual/int.html: *C* *L* libs/mpl/doc/refmanual/integral-c.html: *C* *L* libs/mpl/doc/refmanual/integral-constant.html: *C* *L* libs/mpl/doc/refmanual/integral-sequence-wrapper.html: *C* *L* libs/mpl/doc/refmanual/intrinsic-metafunctions.html: *C* *L* libs/mpl/doc/refmanual/introspection.html: *C* *L* libs/mpl/doc/refmanual/invocation.html: *C* *L* libs/mpl/doc/refmanual/is-sequence.html: *C* *L* libs/mpl/doc/refmanual/iter-fold.html: *C* *L* libs/mpl/doc/refmanual/iteration-algorithms.html: *C* *L* libs/mpl/doc/refmanual/iterator-category.html: *C* *L* libs/mpl/doc/refmanual/iterator-metafunctions.html: *C* *L* libs/mpl/doc/refmanual/iterator-range.html: *C* *L* libs/mpl/doc/refmanual/iterators-concepts.html: *C* *L* libs/mpl/doc/refmanual/iterators.html: *C* *L* libs/mpl/doc/refmanual/joint-view.html: *C* *L* libs/mpl/doc/refmanual/key-type.html: *C* *L* libs/mpl/doc/refmanual/lambda-expression.html: *C* *L* libs/mpl/doc/refmanual/lambda.html: *C* *L* libs/mpl/doc/refmanual/less-equal.html: *C* *L* libs/mpl/doc/refmanual/less.html: *C* *L* libs/mpl/doc/refmanual/limit-list-size.html: *C* *L* libs/mpl/doc/refmanual/limit-map-size.html: *C* *L* libs/mpl/doc/refmanual/limit-metafunction-arity.html: *C* *L* libs/mpl/doc/refmanual/limit-set-size.html: *C* *L* libs/mpl/doc/refmanual/limit-unrolling.html: *C* *L* libs/mpl/doc/refmanual/limit-vector-size.html: *C* *L* libs/mpl/doc/refmanual/list-c.html: *C* *L* libs/mpl/doc/refmanual/list.html: *C* *L* libs/mpl/doc/refmanual/logical-operations.html: *C* *L* libs/mpl/doc/refmanual/long.html: *C* *L* libs/mpl/doc/refmanual/lower-bound.html: *C* *L* libs/mpl/doc/refmanual/macros.html: *C* *L* libs/mpl/doc/refmanual/map.html: *C* *L* libs/mpl/doc/refmanual/max-element.html: *C* *L* libs/mpl/doc/refmanual/max.html: *C* *L* libs/mpl/doc/refmanual/metafunction-class.html: *C* *L* libs/mpl/doc/refmanual/metafunction.html: *C* *L* libs/mpl/doc/refmanual/metafunctions-concepts.html: *C* *L* libs/mpl/doc/refmanual/metafunctions.html: *C* *L* libs/mpl/doc/refmanual/min-element.html: *C* *L* libs/mpl/doc/refmanual/min.html: *C* *L* libs/mpl/doc/refmanual/minus.html: *C* *L* libs/mpl/doc/refmanual/miscellaneous.html: *C* *L* libs/mpl/doc/refmanual/modulus.html: *C* *L* libs/mpl/doc/refmanual/negate.html: *C* *L* libs/mpl/doc/refmanual/next.html: *C* *L* libs/mpl/doc/refmanual/not-equal-to.html: *C* *L* libs/mpl/doc/refmanual/not.html: *C* *L* libs/mpl/doc/refmanual/numeric-cast.html: *C* *L* libs/mpl/doc/refmanual/numeric-metafunction.html: *C* *L* libs/mpl/doc/refmanual/numeric.html: *C* *L* libs/mpl/doc/refmanual/or.html: *C* *L* libs/mpl/doc/refmanual/order.html: *C* *L* libs/mpl/doc/refmanual/pair.html: *C* *L* libs/mpl/doc/refmanual/partition.html: *C* *L* libs/mpl/doc/refmanual/placeholder-expression.html: *C* *L* libs/mpl/doc/refmanual/placeholders.html: *C* *L* libs/mpl/doc/refmanual/plus.html: *C* *L* libs/mpl/doc/refmanual/pop-back.html: *C* *L* libs/mpl/doc/refmanual/pop-front.html: *C* *L* libs/mpl/doc/refmanual/prior.html: *C* *L* libs/mpl/doc/refmanual/protect.html: *C* *L* libs/mpl/doc/refmanual/push-back.html: *C* *L* libs/mpl/doc/refmanual/push-front.html: *C* *L* libs/mpl/doc/refmanual/querying-algorithms.html: *C* *L* libs/mpl/doc/refmanual/quote.html: *C* *L* libs/mpl/doc/refmanual/random-access-iterator.html: *C* *L* libs/mpl/doc/refmanual/random-access-sequence.html: *C* *L* libs/mpl/doc/refmanual/range-c.html: *C* *L* libs/mpl/doc/refmanual/refmanual_toc.html: *C* *L* libs/mpl/doc/refmanual/remove-if.html: *C* *L* libs/mpl/doc/refmanual/remove.html: *C* *L* libs/mpl/doc/refmanual/replace-if.html: *C* *L* libs/mpl/doc/refmanual/replace.html: *C* *L* libs/mpl/doc/refmanual/reverse-copy-if.html: *C* *L* libs/mpl/doc/refmanual/reverse-copy.html: *C* *L* libs/mpl/doc/refmanual/reverse-fold.html: *C* *L* libs/mpl/doc/refmanual/reverse-iter-fold.html: *C* *L* libs/mpl/doc/refmanual/reverse-partition.html: *C* *L* libs/mpl/doc/refmanual/reverse-remove-if.html: *C* *L* libs/mpl/doc/refmanual/reverse-remove.html: *C* *L* libs/mpl/doc/refmanual/reverse-replace-if.html: *C* *L* libs/mpl/doc/refmanual/reverse-replace.html: *C* *L* libs/mpl/doc/refmanual/reverse-stable-partition.html: *C* *L* libs/mpl/doc/refmanual/reverse-transform.html: *C* *L* libs/mpl/doc/refmanual/reverse-unique.html: *C* *L* libs/mpl/doc/refmanual/reverse.html: *C* *L* libs/mpl/doc/refmanual/reversible-algorithm.html: *C* *L* libs/mpl/doc/refmanual/sequence-tag.html: *C* *L* libs/mpl/doc/refmanual/sequences.html: *C* *L* libs/mpl/doc/refmanual/set-c.html: *C* *L* libs/mpl/doc/refmanual/set.html: *C* *L* libs/mpl/doc/refmanual/shift-left.html: *C* *L* libs/mpl/doc/refmanual/shift-right.html: *C* *L* libs/mpl/doc/refmanual/single-view.html: *C* *L* libs/mpl/doc/refmanual/size-t.html: *C* *L* libs/mpl/doc/refmanual/size.html: *C* *L* libs/mpl/doc/refmanual/sizeof.html: *C* *L* libs/mpl/doc/refmanual/sort.html: *C* *L* libs/mpl/doc/refmanual/stable-partition.html: *C* *L* libs/mpl/doc/refmanual/tag-dispatched.html: *C* *L* libs/mpl/doc/refmanual/terminology.html: *C* *L* libs/mpl/doc/refmanual/times.html: *C* *L* libs/mpl/doc/refmanual/transform-view.html: *C* *L* libs/mpl/doc/refmanual/transform.html: *C* *L* libs/mpl/doc/refmanual/transformation-algorithms.html: *C* *L* libs/mpl/doc/refmanual/trivial-metafunction.html: *C* *L* libs/mpl/doc/refmanual/trivial-metafunctions.html: *C* *L* libs/mpl/doc/refmanual/trivial.html: *C* *L* libs/mpl/doc/refmanual/type-selection.html: *C* *L* libs/mpl/doc/refmanual/unique.html: *C* *L* libs/mpl/doc/refmanual/unpack-args.html: *C* *L* libs/mpl/doc/refmanual/upper-bound.html: *C* *L* libs/mpl/doc/refmanual/value-type.html: *C* *L* libs/mpl/doc/refmanual/variadic-sequence.html: *C* *L* libs/mpl/doc/refmanual/vector-c.html: *C* *L* libs/mpl/doc/refmanual/vector.html: *C* *L* libs/mpl/doc/refmanual/views.html: *C* *L* libs/mpl/doc/refmanual/void.html: *C* *L* libs/mpl/doc/refmanual/zip-view.html: *C* *L* libs/mpl/doc/src/refmanual/ASSERT.rst: *C* *L* libs/mpl/doc/src/refmanual/ASSERT_MSG.rst: *C* *L* libs/mpl/doc/src/refmanual/ASSERT_NOT.rst: *C* *L* libs/mpl/doc/src/refmanual/ASSERT_RELATION.rst: *C* *L* libs/mpl/doc/src/refmanual/AUX_LAMBDA_SUPPORT.rst: *C* *L* libs/mpl/doc/src/refmanual/Acknowledgements.rst: *C* *L* libs/mpl/doc/src/refmanual/Algorithms-Iteration.rst: *C* *L* libs/mpl/doc/src/refmanual/Algorithms-Querying.rst: *C* *L* libs/mpl/doc/src/refmanual/Algorithms-Transformation.rst: *C* *L* libs/mpl/doc/src/refmanual/Algorithms.rst: *C* *L* libs/mpl/doc/src/refmanual/AssociativeSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/BackExtensibleSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/BidirectionalIterator.rst: *C* *L* libs/mpl/doc/src/refmanual/BidirectionalSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/CFG_NO_HAS_XXX.rst: *C* *L* libs/mpl/doc/src/refmanual/CFG_NO_PREPROCESSED.rst: *C* *L* libs/mpl/doc/src/refmanual/Categorized.rst: *C* *L* libs/mpl/doc/src/refmanual/Data.rst: *C* *L* libs/mpl/doc/src/refmanual/ExtensibleAssociativeSeq.rst: *C* *L* libs/mpl/doc/src/refmanual/ExtensibleSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/ForwardIterator.rst: *C* *L* libs/mpl/doc/src/refmanual/ForwardSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/FrontExtensibleSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/HAS_XXX_TRAIT_DEF.rst: *C* *L* libs/mpl/doc/src/refmanual/HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L* libs/mpl/doc/src/refmanual/Inserter.rst: *C* *L* libs/mpl/doc/src/refmanual/IntegralConstant.rst: *C* *L* libs/mpl/doc/src/refmanual/IntegralSequenceWrapper.rst: *C* *L* libs/mpl/doc/src/refmanual/Iterators-Concepts.rst: *C* *L* libs/mpl/doc/src/refmanual/Iterators-Metafunctions.rst: *C* *L* libs/mpl/doc/src/refmanual/Iterators.rst: *C* *L* libs/mpl/doc/src/refmanual/LIMIT_LIST_SIZE.rst: *C* *L* libs/mpl/doc/src/refmanual/LIMIT_MAP_SIZE.rst: *C* *L* libs/mpl/doc/src/refmanual/LIMIT_METAFUNCTION_ARITY.rst: *C* *L* libs/mpl/doc/src/refmanual/LIMIT_SET_SIZE.rst: *C* *L* libs/mpl/doc/src/refmanual/LIMIT_UNROLLING.rst: *C* *L* libs/mpl/doc/src/refmanual/LIMIT_VECTOR_SIZE.rst: *C* *L* libs/mpl/doc/src/refmanual/LambdaExpression.rst: *C* *L* libs/mpl/doc/src/refmanual/Macros-Asserts.rst: *C* *L* libs/mpl/doc/src/refmanual/Macros-Configuration.rst: *C* *L* libs/mpl/doc/src/refmanual/Macros.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunction.rst: *C* *L* libs/mpl/doc/src/refmanual/MetafunctionClass.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Arithmetic.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Bitwise.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Comparisons.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Composition.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Conditional.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Invocation.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Logical.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Trivial.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions-Type.rst: *C* *L* libs/mpl/doc/src/refmanual/Metafunctions.rst: *C* *L* libs/mpl/doc/src/refmanual/NumericMetafunction.rst: *C* *L* libs/mpl/doc/src/refmanual/PlaceholderExpression.rst: *C* *L* libs/mpl/doc/src/refmanual/Placeholders.rst: *C* *L* libs/mpl/doc/src/refmanual/RandomAccessIterator.rst: *C* *L* libs/mpl/doc/src/refmanual/RandomAccessSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/ReversibleAlgorithm.rst: *C* *L* libs/mpl/doc/src/refmanual/Sequences-Classes.rst: *C* *L* libs/mpl/doc/src/refmanual/Sequences-Concepts.rst: *C* *L* libs/mpl/doc/src/refmanual/Sequences-Intrinsic.rst: *C* *L* libs/mpl/doc/src/refmanual/Sequences-Views.rst: *C* *L* libs/mpl/doc/src/refmanual/Sequences.rst: *C* *L* libs/mpl/doc/src/refmanual/TagDispatchedMetafunction.rst: *C* *L* libs/mpl/doc/src/refmanual/TrivialMetafunction.rst: *C* *L* libs/mpl/doc/src/refmanual/VariadicSequence.rst: *C* *L* libs/mpl/doc/src/refmanual/accumulate.rst: *C* *L* libs/mpl/doc/src/refmanual/advance.rst: *C* *L* libs/mpl/doc/src/refmanual/always.rst: *C* *L* libs/mpl/doc/src/refmanual/and_.rst: *C* *L* libs/mpl/doc/src/refmanual/apply.rst: *C* *L* libs/mpl/doc/src/refmanual/apply_wrap.rst: *C* *L* libs/mpl/doc/src/refmanual/arg.rst: *C* *L* libs/mpl/doc/src/refmanual/at.rst: *C* *L* libs/mpl/doc/src/refmanual/at_c.rst: *C* *L* libs/mpl/doc/src/refmanual/back.rst: *C* *L* libs/mpl/doc/src/refmanual/back_inserter.rst: *C* *L* libs/mpl/doc/src/refmanual/begin.rst: *C* *L* libs/mpl/doc/src/refmanual/bind.rst: *C* *L* libs/mpl/doc/src/refmanual/bitand_.rst: *C* *L* libs/mpl/doc/src/refmanual/bitor_.rst: *C* *L* libs/mpl/doc/src/refmanual/bitxor_.rst: *C* *L* libs/mpl/doc/src/refmanual/bool_.rst: *C* *L* libs/mpl/doc/src/refmanual/clear.rst: *C* *L* libs/mpl/doc/src/refmanual/contains.rst: *C* *L* libs/mpl/doc/src/refmanual/copy.rst: *C* *L* libs/mpl/doc/src/refmanual/copy_if.rst: *C* *L* libs/mpl/doc/src/refmanual/count.rst: *C* *L* libs/mpl/doc/src/refmanual/count_if.rst: *C* *L* libs/mpl/doc/src/refmanual/deque.rst: *C* *L* libs/mpl/doc/src/refmanual/deref.rst: *C* *L* libs/mpl/doc/src/refmanual/distance.rst: *C* *L* libs/mpl/doc/src/refmanual/divides.rst: *C* *L* libs/mpl/doc/src/refmanual/empty.rst: *C* *L* libs/mpl/doc/src/refmanual/empty_base.rst: *C* *L* libs/mpl/doc/src/refmanual/empty_sequence.rst: *C* *L* libs/mpl/doc/src/refmanual/end.rst: *C* *L* libs/mpl/doc/src/refmanual/equal.rst: *C* *L* libs/mpl/doc/src/refmanual/equal_to.rst: *C* *L* libs/mpl/doc/src/refmanual/erase.rst: *C* *L* libs/mpl/doc/src/refmanual/erase_key.rst: *C* *L* libs/mpl/doc/src/refmanual/eval_if.rst: *C* *L* libs/mpl/doc/src/refmanual/eval_if_c.rst: *C* *L* libs/mpl/doc/src/refmanual/filter_view.rst: *C* *L* libs/mpl/doc/src/refmanual/find.rst: *C* *L* libs/mpl/doc/src/refmanual/find_if.rst: *C* *L* libs/mpl/doc/src/refmanual/fold.rst: *C* *L* libs/mpl/doc/src/refmanual/front.rst: *C* *L* libs/mpl/doc/src/refmanual/front_inserter.rst: *C* *L* libs/mpl/doc/src/refmanual/greater.rst: *C* *L* libs/mpl/doc/src/refmanual/greater_equal.rst: *C* *L* libs/mpl/doc/src/refmanual/has_key.rst: *C* *L* libs/mpl/doc/src/refmanual/identity.rst: *C* *L* libs/mpl/doc/src/refmanual/if_.rst: *C* *L* libs/mpl/doc/src/refmanual/if_c.rst: *C* *L* libs/mpl/doc/src/refmanual/inherit.rst: *C* *L* libs/mpl/doc/src/refmanual/inherit_linearly.rst: *C* *L* libs/mpl/doc/src/refmanual/insert.rst: *C* *L* libs/mpl/doc/src/refmanual/insert_range.rst: *C* *L* libs/mpl/doc/src/refmanual/inserter_.rst: *C* *L* libs/mpl/doc/src/refmanual/int_.rst: *C* *L* libs/mpl/doc/src/refmanual/integral_c.rst: *C* *L* libs/mpl/doc/src/refmanual/is_sequence.rst: *C* *L* libs/mpl/doc/src/refmanual/iter_fold.rst: *C* *L* libs/mpl/doc/src/refmanual/iter_fold_if.rst: *C* *L* libs/mpl/doc/src/refmanual/iterator_category.rst: *C* *L* libs/mpl/doc/src/refmanual/iterator_range.rst: *C* *L* libs/mpl/doc/src/refmanual/joint_view.rst: *C* *L* libs/mpl/doc/src/refmanual/key_type.rst: *C* *L* libs/mpl/doc/src/refmanual/lambda.rst: *C* *L* libs/mpl/doc/src/refmanual/less.rst: *C* *L* libs/mpl/doc/src/refmanual/less_equal.rst: *C* *L* libs/mpl/doc/src/refmanual/list.rst: *C* *L* libs/mpl/doc/src/refmanual/list_c.rst: *C* *L* libs/mpl/doc/src/refmanual/long_.rst: *C* *L* libs/mpl/doc/src/refmanual/lower_bound.rst: *C* *L* libs/mpl/doc/src/refmanual/map.rst: *C* *L* libs/mpl/doc/src/refmanual/max.rst: *C* *L* libs/mpl/doc/src/refmanual/max_element.rst: *C* *L* libs/mpl/doc/src/refmanual/min.rst: *C* *L* libs/mpl/doc/src/refmanual/min_element.rst: *C* *L* libs/mpl/doc/src/refmanual/minus.rst: *C* *L* libs/mpl/doc/src/refmanual/modulus.rst: *C* *L* libs/mpl/doc/src/refmanual/multiplies.rst: *C* *L* libs/mpl/doc/src/refmanual/negate.rst: *C* *L* libs/mpl/doc/src/refmanual/next.rst: *C* *L* libs/mpl/doc/src/refmanual/not_.rst: *C* *L* libs/mpl/doc/src/refmanual/not_equal_to.rst: *C* *L* libs/mpl/doc/src/refmanual/numeric_cast.rst: *C* *L* libs/mpl/doc/src/refmanual/or_.rst: *C* *L* libs/mpl/doc/src/refmanual/order.rst: *C* *L* libs/mpl/doc/src/refmanual/pair.rst: *C* *L* libs/mpl/doc/src/refmanual/partition.rst: *C* *L* libs/mpl/doc/src/refmanual/plus.rst: *C* *L* libs/mpl/doc/src/refmanual/pop_back.rst: *C* *L* libs/mpl/doc/src/refmanual/pop_front.rst: *C* *L* libs/mpl/doc/src/refmanual/preface.rst: *C* *L* libs/mpl/doc/src/refmanual/prior.rst: *C* *L* libs/mpl/doc/src/refmanual/protect.rst: *C* *L* libs/mpl/doc/src/refmanual/push_back.rst: *C* *L* libs/mpl/doc/src/refmanual/push_front.rst: *C* *L* libs/mpl/doc/src/refmanual/quote.rst: *C* *L* libs/mpl/doc/src/refmanual/range_c.rst: *C* *L* libs/mpl/doc/src/refmanual/refmanual.py: *C* *L* libs/mpl/doc/src/refmanual/remove.rst: *C* *L* libs/mpl/doc/src/refmanual/remove_if.rst: *C* *L* libs/mpl/doc/src/refmanual/replace.rst: *C* *L* libs/mpl/doc/src/refmanual/replace_if.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_copy.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_copy_if.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_fold.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_iter_fold.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_partition.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_remove.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_remove_if.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_replace.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_replace_if.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_stable_partition.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_transform.rst: *C* *L* libs/mpl/doc/src/refmanual/reverse_unique.rst: *C* *L* libs/mpl/doc/src/refmanual/sequence_tag.rst: *C* *L* libs/mpl/doc/src/refmanual/set.rst: *C* *L* libs/mpl/doc/src/refmanual/set_c.rst: *C* *L* libs/mpl/doc/src/refmanual/shift_left.rst: *C* *L* libs/mpl/doc/src/refmanual/shift_right.rst: *C* *L* libs/mpl/doc/src/refmanual/single_view.rst: *C* *L* libs/mpl/doc/src/refmanual/size.rst: *C* *L* libs/mpl/doc/src/refmanual/size_t.rst: *C* *L* libs/mpl/doc/src/refmanual/sizeof_.rst: *C* *L* libs/mpl/doc/src/refmanual/sort.rst: *C* *L* libs/mpl/doc/src/refmanual/stable_partition.rst: *C* *L* libs/mpl/doc/src/refmanual/terminology.rst: *C* *L* libs/mpl/doc/src/refmanual/times.rst: *C* *L* libs/mpl/doc/src/refmanual/transform.rst: *C* *L* libs/mpl/doc/src/refmanual/transform_view.rst: *C* *L* libs/mpl/doc/src/refmanual/unique.rst: *C* *L* libs/mpl/doc/src/refmanual/unpack_args.rst: *C* *L* libs/mpl/doc/src/refmanual/upper_bound.rst: *C* *L* libs/mpl/doc/src/refmanual/value_type.rst: *C* *L* libs/mpl/doc/src/refmanual/vector.rst: *C* *L* libs/mpl/doc/src/refmanual/vector_c.rst: *C* *L* libs/mpl/doc/src/refmanual/void_.rst: *C* *L* libs/mpl/doc/src/refmanual/zip_view.rst: *C* *L* libs/mpl/doc/style.css: *L* libs/mpl/doc/tutorial/acknowledgements.html: *C* *L* libs/mpl/doc/tutorial/apply-lambda-semantics.html: *C* *L* libs/mpl/doc/tutorial/broken-integral-constant.html: *C* *L* libs/mpl/doc/tutorial/changelog-history.html: *C* *L* libs/mpl/doc/tutorial/changes-in-boost-1-32-0.html: *C* *L* libs/mpl/doc/tutorial/dependencies.html: *C* *L* libs/mpl/doc/tutorial/details.html: *C* *L* libs/mpl/doc/tutorial/dimensional-analysis.html: *C* *L* libs/mpl/doc/tutorial/eti.html: *C* *L* libs/mpl/doc/tutorial/exercises.html: *C* *L* libs/mpl/doc/tutorial/handling-placeholders.html: *C* *L* libs/mpl/doc/tutorial/higher-order.html: *C* *L* libs/mpl/doc/tutorial/implementing-addition-and.html: *C* *L* libs/mpl/doc/tutorial/implementing-division.html: *C* *L* libs/mpl/doc/tutorial/implementing.html: *C* *L* libs/mpl/doc/tutorial/incomplete-support-for.html: *C* *L* libs/mpl/doc/tutorial/iterator-protocol.html: *C* *L* libs/mpl/doc/tutorial/lambda-and-non.html: *C* *L* libs/mpl/doc/tutorial/lambda-details.html: *C* *L* libs/mpl/doc/tutorial/metafunction-composition.html: *C* *L* libs/mpl/doc/tutorial/miscellaneous.html: *C* *L* libs/mpl/doc/tutorial/more-lambda-capabilities.html: *C* *L* libs/mpl/doc/tutorial/numeric-metafunction.html: *C* *L* libs/mpl/doc/tutorial/partial-metafunction.html: *C* *L* libs/mpl/doc/tutorial/physical-structure.html: *C* *L* libs/mpl/doc/tutorial/placeholder-expression.html: *C* *L* libs/mpl/doc/tutorial/placeholders.html: *C* *L* libs/mpl/doc/tutorial/portability.html: *C* *L* libs/mpl/doc/tutorial/reference-manual.html: *C* *L* libs/mpl/doc/tutorial/renaming-cleanup.html: *C* *L* libs/mpl/doc/tutorial/representing-dimensions.html: *C* *L* libs/mpl/doc/tutorial/representing-quantities.html: *C* *L* libs/mpl/doc/tutorial/resources.html: *C* *L* libs/mpl/doc/tutorial/tag-dispatching-protocol.html: *C* *L* libs/mpl/doc/tutorial/technical-details.html: *C* *L* libs/mpl/doc/tutorial/the-apply-metafunction.html: *C* *L* libs/mpl/doc/tutorial/the-importance-of-being.html: *C* *L* libs/mpl/doc/tutorial/the-lambda-metafunction.html: *C* *L* libs/mpl/doc/tutorial/tutorial-metafunctions.html: *L* libs/mpl/doc/tutorial/tutorial_toc.html: *C* *L* libs/mpl/example/Jamfile: *C* *L* libs/mpl/index.html: *C* *L* libs/mpl/test/Jamfile: *C* *L* libs/mpl/test/Jamfile.v2: *C* *L* libs/mpl/test/aux_/Jamfile: *C* *L* |multi_array| libs/multi_array/doc/index.html: *L* libs/multi_array/doc/iterator_categories.html: *C* *L* libs/multi_array/doc/notes.html: *L* libs/multi_array/doc/reference.html: *L* libs/multi_array/doc/test_cases.html: *L* libs/multi_array/doc/user.html: *L* libs/multi_array/doc/xml/MultiArray.xml: *C* *L* libs/multi_array/doc/xml/const_multi_array_ref.xml: *C* *L* libs/multi_array/doc/xml/multi_array.xml: *C* *L* libs/multi_array/doc/xml/multi_array_ref.xml: *C* *L* libs/multi_array/doc/xml/reference.xml: *L* libs/multi_array/index.html: *C* *L* libs/multi_array/test/Jamfile: *L* libs/multi_array/test/Jamfile.v2: *L* |numeric| boost/numeric/ublas/banded.hpp: *L* boost/numeric/ublas/blas.hpp: *L* boost/numeric/ublas/detail/concepts.hpp: *L* boost/numeric/ublas/detail/config.hpp: *L* boost/numeric/ublas/detail/definitions.hpp: *L* boost/numeric/ublas/detail/documentation.hpp: *L* boost/numeric/ublas/detail/duff.hpp: *L* boost/numeric/ublas/detail/iterator.hpp: *L* boost/numeric/ublas/detail/matrix_assign.hpp: *L* boost/numeric/ublas/detail/raw.hpp: *L* boost/numeric/ublas/detail/returntype_deduction.hpp: *L* boost/numeric/ublas/detail/temporary.hpp: *L* boost/numeric/ublas/detail/vector_assign.hpp: *L* boost/numeric/ublas/exception.hpp: *L* boost/numeric/ublas/expression_types.hpp: *L* boost/numeric/ublas/functional.hpp: *L* boost/numeric/ublas/fwd.hpp: *L* boost/numeric/ublas/hermitian.hpp: *L* boost/numeric/ublas/io.hpp: *L* boost/numeric/ublas/lu.hpp: *L* boost/numeric/ublas/matrix.hpp: *L* boost/numeric/ublas/matrix_expression.hpp: *L* boost/numeric/ublas/matrix_proxy.hpp: *L* boost/numeric/ublas/matrix_sparse.hpp: *L* boost/numeric/ublas/operation.hpp: *L* boost/numeric/ublas/operation_blocked.hpp: *L* boost/numeric/ublas/operation_sparse.hpp: *L* boost/numeric/ublas/storage.hpp: *L* boost/numeric/ublas/storage_sparse.hpp: *L* boost/numeric/ublas/symmetric.hpp: *L* boost/numeric/ublas/traits.hpp: *L* boost/numeric/ublas/triangular.hpp: *L* boost/numeric/ublas/vector.hpp: *L* boost/numeric/ublas/vector_expression.hpp: *L* boost/numeric/ublas/vector_of_vector.hpp: *L* boost/numeric/ublas/vector_proxy.hpp: *L* boost/numeric/ublas/vector_sparse.hpp: *L* libs/numeric/conversion/index.html: *C* *L* libs/numeric/conversion/test/Jamfile: *C* *L* libs/numeric/conversion/test/Jamfile.v2: *C* *L* libs/numeric/conversion/test/test_helpers.cpp: *C* libs/numeric/conversion/test/test_helpers2.cpp: *C* libs/numeric/conversion/test/test_helpers3.cpp: *C* libs/numeric/conversion/test/traits_test.cpp: *C* libs/numeric/conversion/test/udt_example_0.cpp: *C* libs/numeric/conversion/test/udt_support_test.cpp: *C* libs/numeric/index.html: *C* *L* libs/numeric/interval/doc/checking.htm: *L* libs/numeric/interval/doc/comparisons.htm: *L* libs/numeric/interval/doc/examples.htm: *L* libs/numeric/interval/doc/guide.htm: *L* libs/numeric/interval/doc/includes.htm: *L* libs/numeric/interval/doc/index.html: *C* *L* libs/numeric/interval/doc/interval.htm: *L* libs/numeric/interval/doc/numbers.htm: *L* libs/numeric/interval/doc/policies.htm: *L* libs/numeric/interval/doc/rounding.htm: *L* libs/numeric/interval/doc/todo.htm: *L* libs/numeric/ublas/bench1/Jamfile: *L* libs/numeric/ublas/bench1/bench1.cpp: *L* libs/numeric/ublas/bench1/bench1.hpp: *L* libs/numeric/ublas/bench1/bench11.cpp: *L* libs/numeric/ublas/bench1/bench12.cpp: *L* libs/numeric/ublas/bench1/bench13.cpp: *L* libs/numeric/ublas/bench2/Jamfile: *L* libs/numeric/ublas/bench2/bench2.cpp: *L* libs/numeric/ublas/bench2/bench2.hpp: *L* libs/numeric/ublas/bench2/bench21.cpp: *L* libs/numeric/ublas/bench2/bench22.cpp: *L* libs/numeric/ublas/bench2/bench23.cpp: *L* libs/numeric/ublas/bench3/Jamfile: *L* libs/numeric/ublas/bench3/bench3.cpp: *L* libs/numeric/ublas/bench3/bench3.hpp: *L* libs/numeric/ublas/bench3/bench31.cpp: *L* libs/numeric/ublas/bench3/bench32.cpp: *L* libs/numeric/ublas/bench3/bench33.cpp: *L* libs/numeric/ublas/bench4/Jamfile: *L* libs/numeric/ublas/bench4/bench4.cpp: *L* libs/numeric/ublas/bench4/bench41.cpp: *L* libs/numeric/ublas/bench4/bench42.cpp: *L* libs/numeric/ublas/bench4/bench43.cpp: *L* libs/numeric/ublas/doc/Release_notes.txt: *C* *L* libs/numeric/ublas/doc/array_adaptor.htm: *C* *L* libs/numeric/ublas/doc/banded.htm: *L* libs/numeric/ublas/doc/blas.htm: *L* libs/numeric/ublas/doc/bounded_array.htm: *C* *L* libs/numeric/ublas/doc/container_concept.htm: *L* libs/numeric/ublas/doc/doxygen.css: *C* *L* libs/numeric/ublas/doc/expression_concept.htm: *L* libs/numeric/ublas/doc/hermitian.htm: *L* libs/numeric/ublas/doc/index.htm: *L* libs/numeric/ublas/doc/iterator_concept.htm: *L* libs/numeric/ublas/doc/matrix.htm: *L* libs/numeric/ublas/doc/matrix_expression.htm: *L* libs/numeric/ublas/doc/matrix_proxy.htm: *L* libs/numeric/ublas/doc/matrix_sparse.htm: *L* libs/numeric/ublas/doc/operations_overview.htm: *L* libs/numeric/ublas/doc/overview.htm: *L* libs/numeric/ublas/doc/products.htm: *L* libs/numeric/ublas/doc/range.htm: *C* *L* libs/numeric/ublas/doc/samples/Jamfile: *L* libs/numeric/ublas/doc/samples/banded_adaptor.cpp: *L* libs/numeric/ublas/doc/samples/banded_matrix.cpp: *L* libs/numeric/ublas/doc/samples/bounded_array.cpp: *L* libs/numeric/ublas/doc/samples/compressed_matrix.cpp: *L* libs/numeric/ublas/doc/samples/compressed_vector.cpp: *L* libs/numeric/ublas/doc/samples/coordinate_matrix.cpp: *L* libs/numeric/ublas/doc/samples/coordinate_vector.cpp: *L* libs/numeric/ublas/doc/samples/hermitian_adaptor.cpp: *L* libs/numeric/ublas/doc/samples/hermitian_matrix.cpp: *L* libs/numeric/ublas/doc/samples/identity_matrix.cpp: *L* libs/numeric/ublas/doc/samples/map_array.cpp: *L* libs/numeric/ublas/doc/samples/mapped_matrix.cpp: *L* libs/numeric/ublas/doc/samples/mapped_vector.cpp: *L* libs/numeric/ublas/doc/samples/matrix.cpp: *L* libs/numeric/ublas/doc/samples/matrix_binary.cpp: *L* libs/numeric/ublas/doc/samples/matrix_binary_scalar.cpp: *L* libs/numeric/ublas/doc/samples/matrix_column.cpp: *L* libs/numeric/ublas/doc/samples/matrix_column_project.cpp: *L* libs/numeric/ublas/doc/samples/matrix_matrix_binary.cpp: *L* libs/numeric/ublas/doc/samples/matrix_matrix_solve.cpp: *L* libs/numeric/ublas/doc/samples/matrix_range.cpp: *L* libs/numeric/ublas/doc/samples/matrix_range_project.cpp: *L* libs/numeric/ublas/doc/samples/matrix_row.cpp: *L* libs/numeric/ublas/doc/samples/matrix_row_project.cpp: *L* libs/numeric/ublas/doc/samples/matrix_slice.cpp: *L* libs/numeric/ublas/doc/samples/matrix_slice_project.cpp: *L* libs/numeric/ublas/doc/samples/matrix_unary.cpp: *L* libs/numeric/ublas/doc/samples/matrix_vector_binary.cpp: *L* libs/numeric/ublas/doc/samples/matrix_vector_range.cpp: *L* libs/numeric/ublas/doc/samples/matrix_vector_slice.cpp: *L* libs/numeric/ublas/doc/samples/matrix_vector_solve.cpp: *L* libs/numeric/ublas/doc/samples/range.cpp: *L* libs/numeric/ublas/doc/samples/slice.cpp: *L* libs/numeric/ublas/doc/samples/symmetric_adaptor.cpp: *L* libs/numeric/ublas/doc/samples/symmetric_matrix.cpp: *L* libs/numeric/ublas/doc/samples/triangular_adaptor.cpp: *L* libs/numeric/ublas/doc/samples/triangular_matrix.cpp: *L* libs/numeric/ublas/doc/samples/unbounded_array.cpp: *L* libs/numeric/ublas/doc/samples/unit_vector.cpp: *L* libs/numeric/ublas/doc/samples/vector.cpp: *L* libs/numeric/ublas/doc/samples/vector_binary.cpp: *L* libs/numeric/ublas/doc/samples/vector_binary_outer.cpp: *L* libs/numeric/ublas/doc/samples/vector_binary_redux.cpp: *L* libs/numeric/ublas/doc/samples/vector_binary_scalar.cpp: *L* libs/numeric/ublas/doc/samples/vector_range.cpp: *L* libs/numeric/ublas/doc/samples/vector_range_project.cpp: *L* libs/numeric/ublas/doc/samples/vector_slice.cpp: *L* libs/numeric/ublas/doc/samples/vector_slice_project.cpp: *L* libs/numeric/ublas/doc/samples/vector_unary.cpp: *L* libs/numeric/ublas/doc/samples/vector_unary_redux.cpp: *L* libs/numeric/ublas/doc/samples/zero_matrix.cpp: *L* libs/numeric/ublas/doc/samples/zero_vector.cpp: *L* libs/numeric/ublas/doc/storage_concept.htm: *C* *L* libs/numeric/ublas/doc/storage_sparse.htm: *L* libs/numeric/ublas/doc/symmetric.htm: *L* libs/numeric/ublas/doc/triangular.htm: *L* libs/numeric/ublas/doc/types_overview.htm: *L* libs/numeric/ublas/doc/ublas.css: *C* *L* libs/numeric/ublas/doc/unbounded_array.htm: *C* *L* libs/numeric/ublas/doc/vector.htm: *L* libs/numeric/ublas/doc/vector_expression.htm: *L* libs/numeric/ublas/doc/vector_proxy.htm: *L* libs/numeric/ublas/doc/vector_sparse.htm: *L* libs/numeric/ublas/index.html: *C* *L* libs/numeric/ublas/test/Jamfile: *L* libs/numeric/ublas/test/README: *C* *L* libs/numeric/ublas/test/concepts.cpp: *L* libs/numeric/ublas/test/test1.cpp: *L* libs/numeric/ublas/test/test1.hpp: *L* libs/numeric/ublas/test/test11.cpp: *L* libs/numeric/ublas/test/test12.cpp: *L* libs/numeric/ublas/test/test13.cpp: *L* libs/numeric/ublas/test/test2.cpp: *L* libs/numeric/ublas/test/test2.hpp: *L* libs/numeric/ublas/test/test21.cpp: *L* libs/numeric/ublas/test/test22.cpp: *L* libs/numeric/ublas/test/test23.cpp: *L* libs/numeric/ublas/test/test3.cpp: *L* libs/numeric/ublas/test/test3.hpp: *L* libs/numeric/ublas/test/test31.cpp: *L* libs/numeric/ublas/test/test32.cpp: *L* libs/numeric/ublas/test/test33.cpp: *L* libs/numeric/ublas/test/test4.cpp: *L* libs/numeric/ublas/test/test4.hpp: *L* libs/numeric/ublas/test/test42.cpp: *L* libs/numeric/ublas/test/test43.cpp: *L* libs/numeric/ublas/test/test5.cpp: *L* libs/numeric/ublas/test/test5.hpp: *L* libs/numeric/ublas/test/test52.cpp: *L* libs/numeric/ublas/test/test53.cpp: *L* libs/numeric/ublas/test/test6.cpp: *L* libs/numeric/ublas/test/test6.hpp: *L* libs/numeric/ublas/test/test62.cpp: *L* libs/numeric/ublas/test/test63.cpp: *L* libs/numeric/ublas/test/test7.cpp: *L* libs/numeric/ublas/test/test7.hpp: *L* libs/numeric/ublas/test/test71.cpp: *L* libs/numeric/ublas/test/test72.cpp: *L* libs/numeric/ublas/test/test73.cpp: *L* |optional| libs/optional/index.html: *C* *L* libs/optional/test/Jamfile.v2: *L* |parameter| libs/parameter/doc/Jamfile.v2: *C* *L* libs/parameter/doc/html/rst.css: *C* *L* libs/parameter/index.html: *L* libs/parameter/test/Jamfile: *C* *L* libs/parameter/test/Jamfile.v2: *C* *L* libs/parameter/test/python.py: *C* *L* |people| people/aleksey_gurtovoy.htm: *C* *L* people/beman_dawes.html: *C* *L* people/darin_adler.htm: *C* *L* people/daryle_walker.html: *C* *L* people/dave_abrahams.htm: *C* *L* people/dietmar_kuehl.htm: *C* *L* people/doug_gregor.html: *C* *L* people/ed_brey.htm: *C* *L* people/eric_friedman.htm: *C* *L* people/fernando_cacciola.html: *C* *L* people/gary_powell.htm: *C* *L* people/gennadiy_rozental.htm: *C* *L* people/greg_colvin.htm: *C* *L* people/hartmut_kaiser.htm: *C* *L* people/herve_bronnimann.htm: *C* *L* people/howard_hinnant.htm: *C* *L* people/hubert_holin.html: *C* *L* people/jaakko_jarvi.htm: *C* *L* people/jeff_garland.html: *C* *L* people/jens_maurer.htm: *C* *L* people/jeremy_siek.htm: *C* *L* people/joaquin_lopez.htm: *C* *L* people/joel_de_guzman.htm: *C* *L* people/john_maddock.htm: *C* *L* people/jonathan_turkanis.htm: *C* *L* people/kevlin_henney.htm: *C* *L* people/liequan_lee.htm: *C* *L* people/mac_murrett.htm: *C* *L* people/mark_rodgers.htm: *C* *L* people/mat_marcus.htm: *C* *L* people/paul_mensonides.htm: *C* *L* people/paul_moore.htm: *C* *L* people/pavol_droba.htm: *C* *L* people/people.htm: *C* *L* people/peter_dimov.htm: *C* *L* people/ralf_w_grosse_kunstleve.htm: *C* *L* people/rene_rivera.htm: *C* *L* people/robert_ramey.htm: *C* *L* people/ronald_garcia.htm: *C* *L* people/samuel_krempp.htm: *C* *L* people/thomas_witt.html: *C* *L* people/thorsten_ottosen.html: *C* *L* people/vesa_karvonen.htm: *C* *L* people/vladimir_prus.htm: *C* *L* people/william_kempf.htm: *C* *L* |pool| boost/pool/detail/pool_construct.bat: *L* boost/pool/detail/pool_construct.sh: *L* boost/pool/detail/pool_construct_simple.bat: *L* boost/pool/detail/pool_construct_simple.sh: *L* libs/pool/TODO.txt: *C* *L* libs/pool/doc/concepts.html: *L* libs/pool/doc/copyright.html: *L* libs/pool/doc/implementation/alignment.html: *L* libs/pool/doc/implementation/ct_gcd_lcm.html: *L* libs/pool/doc/implementation/for.html: *L* libs/pool/doc/implementation/gcd_lcm.html: *L* libs/pool/doc/implementation/guard.html: *L* libs/pool/doc/implementation/mutex.html: *L* libs/pool/doc/implementation/object_pool.html: *L* libs/pool/doc/implementation/pool.html: *L* libs/pool/doc/implementation/pool_alloc.html: *L* libs/pool/doc/implementation/pool_construct.html: *L* libs/pool/doc/implementation/simple_segregated_storage.html: *L* libs/pool/doc/implementation/singleton.html: *L* libs/pool/doc/implementation/singleton_pool.html: *L* libs/pool/doc/index.html: *L* libs/pool/doc/interfaces.html: *L* libs/pool/doc/interfaces/object_pool.html: *L* libs/pool/doc/interfaces/pool.html: *L* libs/pool/doc/interfaces/pool_alloc.html: *L* libs/pool/doc/interfaces/simple_segregated_storage.html: *L* libs/pool/doc/interfaces/singleton_pool.html: *L* libs/pool/doc/interfaces/user_allocator.html: *L* libs/pool/doc/pool.css: *L* libs/pool/index.html: *C* *L* |preprocessor| libs/preprocessor/doc/acknowledgements.html: *L* libs/preprocessor/doc/bibliography.html: *L* libs/preprocessor/doc/contents.html: *C* *L* libs/preprocessor/doc/data.html: *C* *L* libs/preprocessor/doc/data/arrays.html: *C* *L* libs/preprocessor/doc/data/lists.html: *C* *L* libs/preprocessor/doc/data/sequences.html: *C* *L* libs/preprocessor/doc/data/tuples.html: *C* *L* libs/preprocessor/doc/examples.html: *C* *L* libs/preprocessor/doc/headers.html: *C* *L* libs/preprocessor/doc/headers/arithmetic.html: *C* *L* libs/preprocessor/doc/headers/arithmetic/add.html: *C* *L* libs/preprocessor/doc/headers/arithmetic/dec.html: *C* *L* libs/preprocessor/doc/headers/arithmetic/div.html: *C* *L* libs/preprocessor/doc/headers/arithmetic/inc.html: *C* *L* libs/preprocessor/doc/headers/arithmetic/mod.html: *C* *L* libs/preprocessor/doc/headers/arithmetic/mul.html: *C* *L* libs/preprocessor/doc/headers/arithmetic/sub.html: *C* *L* libs/preprocessor/doc/headers/array.html: *C* *L* libs/preprocessor/doc/headers/array/data.html: *C* *L* libs/preprocessor/doc/headers/array/elem.html: *C* *L* libs/preprocessor/doc/headers/array/insert.html: *C* *L* libs/preprocessor/doc/headers/array/pop_back.html: *C* *L* libs/preprocessor/doc/headers/array/pop_front.html: *C* *L* libs/preprocessor/doc/headers/array/push_back.html: *C* *L* libs/preprocessor/doc/headers/array/push_front.html: *C* *L* libs/preprocessor/doc/headers/array/remove.html: *C* *L* libs/preprocessor/doc/headers/array/replace.html: *C* *L* libs/preprocessor/doc/headers/array/reverse.html: *C* *L* libs/preprocessor/doc/headers/array/size.html: *C* *L* libs/preprocessor/doc/headers/assert_msg.html: *C* *L* libs/preprocessor/doc/headers/cat.html: *C* *L* libs/preprocessor/doc/headers/comma.html: *C* *L* libs/preprocessor/doc/headers/comma_if.html: *C* *L* libs/preprocessor/doc/headers/comparison.html: *C* *L* libs/preprocessor/doc/headers/comparison/equal.html: *C* *L* libs/preprocessor/doc/headers/comparison/greater.html: *C* *L* libs/preprocessor/doc/headers/comparison/greater_equal.html: *C* *L* libs/preprocessor/doc/headers/comparison/less.html: *C* *L* libs/preprocessor/doc/headers/comparison/less_equal.html: *C* *L* libs/preprocessor/doc/headers/comparison/not_equal.html: *C* *L* libs/preprocessor/doc/headers/config/limits.html: *C* *L* libs/preprocessor/doc/headers/control.html: *C* *L* libs/preprocessor/doc/headers/control/deduce_d.html: *C* *L* libs/preprocessor/doc/headers/control/expr_if.html: *C* *L* libs/preprocessor/doc/headers/control/expr_iif.html: *C* *L* libs/preprocessor/doc/headers/control/if.html: *C* *L* libs/preprocessor/doc/headers/control/iif.html: *C* *L* libs/preprocessor/doc/headers/control/while.html: *C* *L* libs/preprocessor/doc/headers/debug.html: *C* *L* libs/preprocessor/doc/headers/debug/assert.html: *C* *L* libs/preprocessor/doc/headers/debug/line.html: *C* *L* libs/preprocessor/doc/headers/dec.html: *C* *L* libs/preprocessor/doc/headers/empty.html: *C* *L* libs/preprocessor/doc/headers/enum.html: *C* *L* libs/preprocessor/doc/headers/enum_params.html: *C* *L* libs/preprocessor/doc/headers/enum_shifted.html: *C* *L* libs/preprocessor/doc/headers/enum_shifted_params.html: *C* *L* libs/preprocessor/doc/headers/epwad.html: *C* *L* libs/preprocessor/doc/headers/epwd.html: *C* *L* libs/preprocessor/doc/headers/expand.html: *C* *L* libs/preprocessor/doc/headers/expr_if.html: *C* *L* libs/preprocessor/doc/headers/facilities.html: *C* *L* libs/preprocessor/doc/headers/facilities/apply.html: *C* *L* libs/preprocessor/doc/headers/facilities/empty.html: *C* *L* libs/preprocessor/doc/headers/facilities/expand.html: *C* *L* libs/preprocessor/doc/headers/facilities/identity.html: *C* *L* libs/preprocessor/doc/headers/facilities/intercept.html: *C* *L* libs/preprocessor/doc/headers/for.html: *C* *L* libs/preprocessor/doc/headers/identity.html: *C* *L* libs/preprocessor/doc/headers/if.html: *C* *L* libs/preprocessor/doc/headers/inc.html: *C* *L* libs/preprocessor/doc/headers/iterate.html: *C* *L* libs/preprocessor/doc/headers/iteration.html: *C* *L* libs/preprocessor/doc/headers/iteration/iterate.html: *C* *L* libs/preprocessor/doc/headers/iteration/local.html: *C* *L* libs/preprocessor/doc/headers/iteration/self.html: *C* *L* libs/preprocessor/doc/headers/library.html: *C* *L* libs/preprocessor/doc/headers/limits.html: *C* *L* libs/preprocessor/doc/headers/list.html: *C* *L* libs/preprocessor/doc/headers/list/adt.html: *C* *L* libs/preprocessor/doc/headers/list/append.html: *C* *L* libs/preprocessor/doc/headers/list/at.html: *C* *L* libs/preprocessor/doc/headers/list/cat.html: *C* *L* libs/preprocessor/doc/headers/list/enum.html: *C* *L* libs/preprocessor/doc/headers/list/filter.html: *C* *L* libs/preprocessor/doc/headers/list/first_n.html: *C* *L* libs/preprocessor/doc/headers/list/fold_left.html: *C* *L* libs/preprocessor/doc/headers/list/fold_right.html: *C* *L* libs/preprocessor/doc/headers/list/for_each.html: *C* *L* libs/preprocessor/doc/headers/list/for_each_i.html: *C* *L* libs/preprocessor/doc/headers/list/for_each_product.html: *C* *L* libs/preprocessor/doc/headers/list/rest_n.html: *C* *L* libs/preprocessor/doc/headers/list/reverse.html: *C* *L* libs/preprocessor/doc/headers/list/size.html: *C* *L* libs/preprocessor/doc/headers/list/to_tuple.html: *C* *L* libs/preprocessor/doc/headers/list/transform.html: *C* *L* libs/preprocessor/doc/headers/logical.html: *C* *L* libs/preprocessor/doc/headers/logical/and.html: *C* *L* libs/preprocessor/doc/headers/logical/bitand.html: *C* *L* libs/preprocessor/doc/headers/logical/bitnor.html: *C* *L* libs/preprocessor/doc/headers/logical/bitor.html: *C* *L* libs/preprocessor/doc/headers/logical/bitxor.html: *C* *L* libs/preprocessor/doc/headers/logical/bool.html: *C* *L* libs/preprocessor/doc/headers/logical/compl.html: *C* *L* libs/preprocessor/doc/headers/logical/nor.html: *C* *L* libs/preprocessor/doc/headers/logical/not.html: *C* *L* libs/preprocessor/doc/headers/logical/or.html: *C* *L* libs/preprocessor/doc/headers/logical/xor.html: *C* *L* libs/preprocessor/doc/headers/max.html: *C* *L* libs/preprocessor/doc/headers/min.html: *C* *L* libs/preprocessor/doc/headers/preprocessor.html: *C* *L* libs/preprocessor/doc/headers/punctuation.html: *C* *L* libs/preprocessor/doc/headers/punctuation/comma.html: *C* *L* libs/preprocessor/doc/headers/punctuation/comma_if.html: *C* *L* libs/preprocessor/doc/headers/punctuation/paren.html: *C* *L* libs/preprocessor/doc/headers/punctuation/paren_if.html: *C* *L* libs/preprocessor/doc/headers/repeat.html: *C* *L* libs/preprocessor/doc/headers/repeat_2nd.html: *C* *L* libs/preprocessor/doc/headers/repeat_3rd.html: *C* *L* libs/preprocessor/doc/headers/repeat_from_to.html: *C* *L* libs/preprocessor/doc/headers/repeat_from_to_2nd.html: *C* *L* libs/preprocessor/doc/headers/repeat_from_to_3rd.html: *C* *L* libs/preprocessor/doc/headers/repetition.html: *C* *L* libs/preprocessor/doc/headers/repetition/deduce_r.html: *C* *L* libs/preprocessor/doc/headers/repetition/deduce_z.html: *C* *L* libs/preprocessor/doc/headers/repetition/enum.html: *C* *L* libs/preprocessor/doc/headers/repetition/enum_binary_params.html: *C* *L* libs/preprocessor/doc/headers/repetition/enum_params.html: *C* *L* libs/preprocessor/doc/headers/repetition/enum_shifted.html: *C* *L* libs/preprocessor/doc/headers/repetition/enum_shifted_params.html: *C* *L* libs/preprocessor/doc/headers/repetition/enum_trailing.html: *C* *L* libs/preprocessor/doc/headers/repetition/enum_trailing_params.html: *C* *L* libs/preprocessor/doc/headers/repetition/epwad.html: *C* *L* libs/preprocessor/doc/headers/repetition/epwd.html: *C* *L* libs/preprocessor/doc/headers/repetition/esbp.html: *C* *L* libs/preprocessor/doc/headers/repetition/etbp.html: *C* *L* libs/preprocessor/doc/headers/repetition/for.html: *C* *L* libs/preprocessor/doc/headers/repetition/repeat.html: *C* *L* libs/preprocessor/doc/headers/repetition/repeat_from_to.html: *C* *L* libs/preprocessor/doc/headers/selection.html: *C* *L* libs/preprocessor/doc/headers/selection/max.html: *C* *L* libs/preprocessor/doc/headers/selection/min.html: *C* *L* libs/preprocessor/doc/headers/seq.html: *C* *L* libs/preprocessor/doc/headers/seq/cat.html: *C* *L* libs/preprocessor/doc/headers/seq/elem.html: *C* *L* libs/preprocessor/doc/headers/seq/enum.html: *C* *L* libs/preprocessor/doc/headers/seq/filter.html: *C* *L* libs/preprocessor/doc/headers/seq/first_n.html: *C* *L* libs/preprocessor/doc/headers/seq/fold_left.html: *C* *L* libs/preprocessor/doc/headers/seq/fold_right.html: *C* *L* libs/preprocessor/doc/headers/seq/for_each.html: *C* *L* libs/preprocessor/doc/headers/seq/for_each_i.html: *C* *L* libs/preprocessor/doc/headers/seq/for_each_product.html: *C* *L* libs/preprocessor/doc/headers/seq/insert.html: *C* *L* libs/preprocessor/doc/headers/seq/pop_back.html: *C* *L* libs/preprocessor/doc/headers/seq/pop_front.html: *C* *L* libs/preprocessor/doc/headers/seq/push_back.html: *C* *L* libs/preprocessor/doc/headers/seq/push_front.html: *C* *L* libs/preprocessor/doc/headers/seq/remove.html: *C* *L* libs/preprocessor/doc/headers/seq/replace.html: *C* *L* libs/preprocessor/doc/headers/seq/rest_n.html: *C* *L* libs/preprocessor/doc/headers/seq/reverse.html: *C* *L* libs/preprocessor/doc/headers/seq/seq.html: *C* *L* libs/preprocessor/doc/headers/seq/size.html: *C* *L* libs/preprocessor/doc/headers/seq/subseq.html: *C* *L* libs/preprocessor/doc/headers/seq/to_array.html: *C* *L* libs/preprocessor/doc/headers/seq/to_tuple.html: *C* *L* libs/preprocessor/doc/headers/seq/transform.html: *C* *L* libs/preprocessor/doc/headers/slot.html: *C* *L* libs/preprocessor/doc/headers/slot/counter.html: *C* *L* libs/preprocessor/doc/headers/slot/slot.html: *C* *L* libs/preprocessor/doc/headers/stringize.html: *C* *L* libs/preprocessor/doc/headers/tuple.html: *C* *L* libs/preprocessor/doc/headers/tuple/eat.html: *C* *L* libs/preprocessor/doc/headers/tuple/elem.html: *C* *L* libs/preprocessor/doc/headers/tuple/rem.html: *C* *L* libs/preprocessor/doc/headers/tuple/reverse.html: *C* *L* libs/preprocessor/doc/headers/tuple/to_list.html: *C* *L* libs/preprocessor/doc/headers/tuple/to_seq.html: *C* *L* libs/preprocessor/doc/headers/while.html: *C* *L* libs/preprocessor/doc/headers/wstringize.html: *C* *L* libs/preprocessor/doc/index.html: *C* *L* libs/preprocessor/doc/miscellanea.html: *C* *L* libs/preprocessor/doc/ref.html: *C* *L* libs/preprocessor/doc/ref/add.html: *C* *L* libs/preprocessor/doc/ref/add_d.html: *C* *L* libs/preprocessor/doc/ref/and.html: *C* *L* libs/preprocessor/doc/ref/apply.html: *C* *L* libs/preprocessor/doc/ref/array_data.html: *C* *L* libs/preprocessor/doc/ref/array_elem.html: *C* *L* libs/preprocessor/doc/ref/array_insert.html: *C* *L* libs/preprocessor/doc/ref/array_insert_d.html: *C* *L* libs/preprocessor/doc/ref/array_pop_back.html: *C* *L* libs/preprocessor/doc/ref/array_pop_back_z.html: *C* *L* libs/preprocessor/doc/ref/array_pop_front.html: *C* *L* libs/preprocessor/doc/ref/array_pop_front_z.html: *C* *L* libs/preprocessor/doc/ref/array_push_back.html: *C* *L* libs/preprocessor/doc/ref/array_push_front.html: *C* *L* libs/preprocessor/doc/ref/array_remove.html: *C* *L* libs/preprocessor/doc/ref/array_remove_d.html: *C* *L* libs/preprocessor/doc/ref/array_replace.html: *C* *L* libs/preprocessor/doc/ref/array_replace_d.html: *C* *L* libs/preprocessor/doc/ref/array_reverse.html: *C* *L* libs/preprocessor/doc/ref/array_size.html: *C* *L* libs/preprocessor/doc/ref/assert.html: *C* *L* libs/preprocessor/doc/ref/assert_msg.html: *C* *L* libs/preprocessor/doc/ref/assign_slot.html: *C* *L* libs/preprocessor/doc/ref/bitand.html: *C* *L* libs/preprocessor/doc/ref/bitnor.html: *C* *L* libs/preprocessor/doc/ref/bitor.html: *C* *L* libs/preprocessor/doc/ref/bitxor.html: *C* *L* libs/preprocessor/doc/ref/bool.html: *C* *L* libs/preprocessor/doc/ref/cat.html: *C* *L* libs/preprocessor/doc/ref/comma.html: *C* *L* libs/preprocessor/doc/ref/comma_if.html: *C* *L* libs/preprocessor/doc/ref/compl.html: *C* *L* libs/preprocessor/doc/ref/config_extended_line_info.html: *C* *L* libs/preprocessor/doc/ref/counter.html: *C* *L* libs/preprocessor/doc/ref/dec.html: *C* *L* libs/preprocessor/doc/ref/deduce_d.html: *C* *L* libs/preprocessor/doc/ref/deduce_r.html: *C* *L* libs/preprocessor/doc/ref/deduce_z.html: *C* *L* libs/preprocessor/doc/ref/div.html: *C* *L* libs/preprocessor/doc/ref/div_d.html: *C* *L* libs/preprocessor/doc/ref/empty.html: *C* *L* libs/preprocessor/doc/ref/enum.html: *C* *L* libs/preprocessor/doc/ref/enum_binary_params.html: *C* *L* libs/preprocessor/doc/ref/enum_binary_params_z.html: *C* *L* libs/preprocessor/doc/ref/enum_params.html: *C* *L* libs/preprocessor/doc/ref/enum_params_with_a_default.html: *C* *L* libs/preprocessor/doc/ref/enum_params_with_defaults.html: *C* *L* libs/preprocessor/doc/ref/enum_params_z.html: *C* *L* libs/preprocessor/doc/ref/enum_shifted.html: *C* *L* libs/preprocessor/doc/ref/enum_shifted_params.html: *C* *L* libs/preprocessor/doc/ref/enum_shifted_params_z.html: *C* *L* libs/preprocessor/doc/ref/enum_shifted_z.html: *C* *L* libs/preprocessor/doc/ref/enum_trailing.html: *C* *L* libs/preprocessor/doc/ref/enum_trailing_params.html: *C* *L* libs/preprocessor/doc/ref/enum_trailing_params_z.html: *C* *L* libs/preprocessor/doc/ref/enum_trailing_z.html: *C* *L* libs/preprocessor/doc/ref/enum_z.html: *C* *L* libs/preprocessor/doc/ref/equal.html: *C* *L* libs/preprocessor/doc/ref/equal_d.html: *C* *L* libs/preprocessor/doc/ref/esbp.html: *C* *L* libs/preprocessor/doc/ref/esbpz.html: *C* *L* libs/preprocessor/doc/ref/etbp.html: *C* *L* libs/preprocessor/doc/ref/etbpz.html: *C* *L* libs/preprocessor/doc/ref/expand.html: *C* *L* libs/preprocessor/doc/ref/expr_if.html: *C* *L* libs/preprocessor/doc/ref/expr_iif.html: *C* *L* libs/preprocessor/doc/ref/filename_x.html: *C* *L* libs/preprocessor/doc/ref/for.html: *C* *L* libs/preprocessor/doc/ref/for_r.html: *C* *L* libs/preprocessor/doc/ref/frame_finish.html: *C* *L* libs/preprocessor/doc/ref/frame_flags.html: *C* *L* libs/preprocessor/doc/ref/frame_iteration.html: *C* *L* libs/preprocessor/doc/ref/frame_start.html: *C* *L* libs/preprocessor/doc/ref/greater.html: *C* *L* libs/preprocessor/doc/ref/greater_d.html: *C* *L* libs/preprocessor/doc/ref/greater_equal.html: *C* *L* libs/preprocessor/doc/ref/greater_equal_d.html: *C* *L* libs/preprocessor/doc/ref/identity.html: *C* *L* libs/preprocessor/doc/ref/if.html: *C* *L* libs/preprocessor/doc/ref/iif.html: *C* *L* libs/preprocessor/doc/ref/inc.html: *C* *L* libs/preprocessor/doc/ref/include_self.html: *C* *L* libs/preprocessor/doc/ref/indirect_self.html: *C* *L* libs/preprocessor/doc/ref/intercept.html: *C* *L* libs/preprocessor/doc/ref/is_iterating.html: *C* *L* libs/preprocessor/doc/ref/is_selfish.html: *C* *L* libs/preprocessor/doc/ref/iterate.html: *C* *L* libs/preprocessor/doc/ref/iteration.html: *C* *L* libs/preprocessor/doc/ref/iteration_depth.html: *C* *L* libs/preprocessor/doc/ref/iteration_finish.html: *C* *L* libs/preprocessor/doc/ref/iteration_flags.html: *C* *L* libs/preprocessor/doc/ref/iteration_limits.html: *C* *L* libs/preprocessor/doc/ref/iteration_params_x.html: *C* *L* libs/preprocessor/doc/ref/iteration_start.html: *C* *L* libs/preprocessor/doc/ref/less.html: *C* *L* libs/preprocessor/doc/ref/less_d.html: *C* *L* libs/preprocessor/doc/ref/less_equal.html: *C* *L* libs/preprocessor/doc/ref/less_equal_d.html: *C* *L* libs/preprocessor/doc/ref/limit_dim.html: *C* *L* libs/preprocessor/doc/ref/limit_for.html: *C* *L* libs/preprocessor/doc/ref/limit_iteration.html: *C* *L* libs/preprocessor/doc/ref/limit_iteration_dim.html: *C* *L* libs/preprocessor/doc/ref/limit_mag.html: *C* *L* libs/preprocessor/doc/ref/limit_repeat.html: *C* *L* libs/preprocessor/doc/ref/limit_seq.html: *C* *L* libs/preprocessor/doc/ref/limit_slot_count.html: *C* *L* libs/preprocessor/doc/ref/limit_slot_sig.html: *C* *L* libs/preprocessor/doc/ref/limit_tuple.html: *C* *L* libs/preprocessor/doc/ref/limit_while.html: *C* *L* libs/preprocessor/doc/ref/line.html: *C* *L* libs/preprocessor/doc/ref/list_append.html: *C* *L* libs/preprocessor/doc/ref/list_append_d.html: *C* *L* libs/preprocessor/doc/ref/list_at.html: *C* *L* libs/preprocessor/doc/ref/list_at_d.html: *C* *L* libs/preprocessor/doc/ref/list_cat.html: *C* *L* libs/preprocessor/doc/ref/list_cat_d.html: *C* *L* libs/preprocessor/doc/ref/list_cons.html: *C* *L* libs/preprocessor/doc/ref/list_enum.html: *C* *L* libs/preprocessor/doc/ref/list_enum_r.html: *C* *L* libs/preprocessor/doc/ref/list_filter.html: *C* *L* libs/preprocessor/doc/ref/list_filter_d.html: *C* *L* libs/preprocessor/doc/ref/list_first.html: *C* *L* libs/preprocessor/doc/ref/list_first_n.html: *C* *L* libs/preprocessor/doc/ref/list_first_n_d.html: *C* *L* libs/preprocessor/doc/ref/list_fold_left.html: *C* *L* libs/preprocessor/doc/ref/list_fold_left_2nd.html: *C* *L* libs/preprocessor/doc/ref/list_fold_left_2nd_d.html: *C* *L* libs/preprocessor/doc/ref/list_fold_left_d.html: *C* *L* libs/preprocessor/doc/ref/list_fold_left_d_old.html: *C* *L* libs/preprocessor/doc/ref/list_fold_right.html: *C* *L* libs/preprocessor/doc/ref/list_fold_right_2nd.html: *C* *L* libs/preprocessor/doc/ref/list_fold_right_2nd_d.html: *C* *L* libs/preprocessor/doc/ref/list_fold_right_d.html: *C* *L* libs/preprocessor/doc/ref/list_fold_right_d_old.html: *C* *L* libs/preprocessor/doc/ref/list_for_each.html: *C* *L* libs/preprocessor/doc/ref/list_for_each_i.html: *C* *L* libs/preprocessor/doc/ref/list_for_each_i_r.html: *C* *L* libs/preprocessor/doc/ref/list_for_each_product.html: *C* *L* libs/preprocessor/doc/ref/list_for_each_product_r.html: *C* *L* libs/preprocessor/doc/ref/list_for_each_r.html: *C* *L* libs/preprocessor/doc/ref/list_is_cons.html: *C* *L* libs/preprocessor/doc/ref/list_is_nil.html: *C* *L* libs/preprocessor/doc/ref/list_nil.html: *C* *L* libs/preprocessor/doc/ref/list_rest.html: *C* *L* libs/preprocessor/doc/ref/list_rest_n.html: *C* *L* libs/preprocessor/doc/ref/list_rest_n_d.html: *C* *L* libs/preprocessor/doc/ref/list_reverse.html: *C* *L* libs/preprocessor/doc/ref/list_reverse_d.html: *C* *L* libs/preprocessor/doc/ref/list_size.html: *C* *L* libs/preprocessor/doc/ref/list_size_d.html: *C* *L* libs/preprocessor/doc/ref/list_to_tuple.html: *C* *L* libs/preprocessor/doc/ref/list_to_tuple_r.html: *C* *L* libs/preprocessor/doc/ref/list_transform.html: *C* *L* libs/preprocessor/doc/ref/list_transform_d.html: *C* *L* libs/preprocessor/doc/ref/local_iterate.html: *C* *L* libs/preprocessor/doc/ref/local_limits.html: *C* *L* libs/preprocessor/doc/ref/local_macro.html: *C* *L* libs/preprocessor/doc/ref/lparen.html: *C* *L* libs/preprocessor/doc/ref/lparen_if.html: *C* *L* libs/preprocessor/doc/ref/max.html: *C* *L* libs/preprocessor/doc/ref/max_d.html: *C* *L* libs/preprocessor/doc/ref/min.html: *C* *L* libs/preprocessor/doc/ref/min_d.html: *C* *L* libs/preprocessor/doc/ref/mod.html: *C* *L* libs/preprocessor/doc/ref/mod_d.html: *C* *L* libs/preprocessor/doc/ref/mul.html: *C* *L* libs/preprocessor/doc/ref/mul_d.html: *C* *L* libs/preprocessor/doc/ref/nil.html: *C* *L* libs/preprocessor/doc/ref/nor.html: *C* *L* libs/preprocessor/doc/ref/not.html: *C* *L* libs/preprocessor/doc/ref/not_equal.html: *C* *L* libs/preprocessor/doc/ref/not_equal_d.html: *C* *L* libs/preprocessor/doc/ref/or.html: *C* *L* libs/preprocessor/doc/ref/relative_finish.html: *C* *L* libs/preprocessor/doc/ref/relative_flags.html: *C* *L* libs/preprocessor/doc/ref/relative_iteration.html: *C* *L* libs/preprocessor/doc/ref/relative_start.html: *C* *L* libs/preprocessor/doc/ref/repeat.html: *C* *L* libs/preprocessor/doc/ref/repeat_1st.html: *C* *L* libs/preprocessor/doc/ref/repeat_2nd.html: *C* *L* libs/preprocessor/doc/ref/repeat_3rd.html: *C* *L* libs/preprocessor/doc/ref/repeat_from_to.html: *C* *L* libs/preprocessor/doc/ref/repeat_from_to_1st.html: *C* *L* libs/preprocessor/doc/ref/repeat_from_to_2nd.html: *C* *L* libs/preprocessor/doc/ref/repeat_from_to_3rd.html: *C* *L* libs/preprocessor/doc/ref/repeat_from_to_d.html: *C* *L* libs/preprocessor/doc/ref/repeat_from_to_d_z.html: *C* *L* libs/preprocessor/doc/ref/repeat_from_to_z.html: *C* *L* libs/preprocessor/doc/ref/repeat_z.html: *C* *L* libs/preprocessor/doc/ref/rparen.html: *C* *L* libs/preprocessor/doc/ref/rparen_if.html: *C* *L* libs/preprocessor/doc/ref/seq_cat.html: *C* *L* libs/preprocessor/doc/ref/seq_cat_s.html: *C* *L* libs/preprocessor/doc/ref/seq_elem.html: *C* *L* libs/preprocessor/doc/ref/seq_enum.html: *C* *L* libs/preprocessor/doc/ref/seq_filter.html: *C* *L* libs/preprocessor/doc/ref/seq_filter_s.html: *C* *L* libs/preprocessor/doc/ref/seq_first_n.html: *C* *L* libs/preprocessor/doc/ref/seq_fold_left.html: *C* *L* libs/preprocessor/doc/ref/seq_fold_left_s.html: *C* *L* libs/preprocessor/doc/ref/seq_fold_right.html: *C* *L* libs/preprocessor/doc/ref/seq_fold_right_s.html: *C* *L* libs/preprocessor/doc/ref/seq_for_each.html: *C* *L* libs/preprocessor/doc/ref/seq_for_each_i.html: *C* *L* libs/preprocessor/doc/ref/seq_for_each_i_r.html: *C* *L* libs/preprocessor/doc/ref/seq_for_each_product.html: *C* *L* libs/preprocessor/doc/ref/seq_for_each_product_r.html: *C* *L* libs/preprocessor/doc/ref/seq_for_each_r.html: *C* *L* libs/preprocessor/doc/ref/seq_head.html: *C* *L* libs/preprocessor/doc/ref/seq_insert.html: *C* *L* libs/preprocessor/doc/ref/seq_nil.html: *C* *L* libs/preprocessor/doc/ref/seq_pop_back.html: *C* *L* libs/preprocessor/doc/ref/seq_pop_front.html: *C* *L* libs/preprocessor/doc/ref/seq_push_back.html: *C* *L* libs/preprocessor/doc/ref/seq_push_front.html: *C* *L* libs/preprocessor/doc/ref/seq_remove.html: *C* *L* libs/preprocessor/doc/ref/seq_replace.html: *C* *L* libs/preprocessor/doc/ref/seq_rest_n.html: *C* *L* libs/preprocessor/doc/ref/seq_reverse.html: *C* *L* libs/preprocessor/doc/ref/seq_reverse_s.html: *C* *L* libs/preprocessor/doc/ref/seq_size.html: *C* *L* libs/preprocessor/doc/ref/seq_subseq.html: *C* *L* libs/preprocessor/doc/ref/seq_tail.html: *C* *L* libs/preprocessor/doc/ref/seq_to_array.html: *C* *L* libs/preprocessor/doc/ref/seq_to_tuple.html: *C* *L* libs/preprocessor/doc/ref/seq_transform.html: *C* *L* libs/preprocessor/doc/ref/seq_transform_s.html: *C* *L* libs/preprocessor/doc/ref/slot.html: *C* *L* libs/preprocessor/doc/ref/stringize.html: *C* *L* libs/preprocessor/doc/ref/sub.html: *C* *L* libs/preprocessor/doc/ref/sub_d.html: *C* *L* libs/preprocessor/doc/ref/tuple_eat.html: *C* *L* libs/preprocessor/doc/ref/tuple_elem.html: *C* *L* libs/preprocessor/doc/ref/tuple_rem.html: *C* *L* libs/preprocessor/doc/ref/tuple_rem_ctor.html: *C* *L* libs/preprocessor/doc/ref/tuple_reverse.html: *C* *L* libs/preprocessor/doc/ref/tuple_to_list.html: *C* *L* libs/preprocessor/doc/ref/tuple_to_seq.html: *C* *L* libs/preprocessor/doc/ref/update_counter.html: *C* *L* libs/preprocessor/doc/ref/value.html: *C* *L* libs/preprocessor/doc/ref/while.html: *C* *L* libs/preprocessor/doc/ref/while_d.html: *C* *L* libs/preprocessor/doc/ref/wstringize.html: *C* *L* libs/preprocessor/doc/ref/xor.html: *C* *L* libs/preprocessor/doc/styles.css: *C* *L* libs/preprocessor/doc/syntax.html: *C* *L* libs/preprocessor/doc/terms.html: *C* *L* libs/preprocessor/doc/terms/evaluated.html: *C* *L* libs/preprocessor/doc/terms/named_external.html: *C* *L* libs/preprocessor/doc/title.html: *C* *L* libs/preprocessor/doc/top.html: *C* *L* libs/preprocessor/doc/topics.html: *C* *L* libs/preprocessor/doc/topics/evaluated_slots.html: *C* *L* libs/preprocessor/doc/topics/file_iteration.html: *C* *L* libs/preprocessor/doc/topics/incompatible.html: *C* *L* libs/preprocessor/doc/topics/local_iteration.html: *C* *L* libs/preprocessor/doc/topics/motivation.html: *L* libs/preprocessor/doc/topics/problems.html: *L* libs/preprocessor/doc/topics/reentrancy.html: *C* *L* libs/preprocessor/doc/topics/techniques.html: *L* libs/preprocessor/index.html: *C* *L* |program_options| boost/program_options/detail/utf8_codecvt_facet.hpp: *L* libs/program_options/build/Jamfile: *C* *L* libs/program_options/build/Jamfile.v2: *C* *L* libs/program_options/doc/Jamfile.v2: *C* *L* libs/program_options/doc/acknowledgements.xml: *C* *L* libs/program_options/doc/changes.xml: *C* *L* libs/program_options/doc/design.xml: *C* *L* libs/program_options/doc/glossary.xml: *C* *L* libs/program_options/doc/howto.xml: *C* *L* libs/program_options/doc/index.html: *C* *L* libs/program_options/doc/overview.xml: *C* *L* libs/program_options/doc/post_review_plan.txt: *C* *L* libs/program_options/doc/todo.txt: *C* *L* libs/program_options/doc/tutorial.xml: *C* *L* libs/program_options/example/Jamfile: *C* *L* libs/program_options/example/Jamfile.v2: *C* *L* libs/program_options/index.html: *C* *L* libs/program_options/test/Jamfile: *C* *L* libs/program_options/test/Jamfile.v2: *C* *L* libs/program_options/test/program_options_size_test.py: *C* *L* libs/program_options/test/ucs2.txt: *C* *L* libs/program_options/test/utf8.txt: *C* *L* libs/program_options/test/winmain.py: *C* *L* |property_map| libs/property_map/LvaluePropertyMap.html: *L* libs/property_map/ReadWritePropertyMap.html: *L* libs/property_map/ReadablePropertyMap.html: *L* libs/property_map/WritablePropertyMap.html: *L* libs/property_map/associative_property_map.html: *L* libs/property_map/const_assoc_property_map.html: *L* libs/property_map/doc/dynamic_property_map.html: *C* *L* libs/property_map/doc/dynamic_property_map.rst: *C* *L* libs/property_map/example2.cpp: *L* libs/property_map/identity_property_map.html: *L* libs/property_map/index.html: *C* *L* libs/property_map/iterator_property_map.html: *L* libs/property_map/property_map.html: *L* libs/property_map/vector_property_map.html: *L* |ptr_container| libs/ptr_container/doc/Jamfile.v2: *C* *L* libs/ptr_container/doc/associative_ptr_container.html: *L* libs/ptr_container/doc/associative_ptr_container.rst: *L* libs/ptr_container/doc/comp.sh: *C* *L* libs/ptr_container/doc/comp_all.sh: *C* *L* libs/ptr_container/doc/comp_assoc_ptr_container.sh: *C* *L* libs/ptr_container/doc/comp_conventions.sh: *C* *L* libs/ptr_container/doc/comp_examples.sh: *C* *L* libs/ptr_container/doc/comp_faq.sh: *C* *L* libs/ptr_container/doc/comp_guidelines.sh: *C* *L* libs/ptr_container/doc/comp_headers.sh: *C* *L* libs/ptr_container/doc/comp_indirect_fun.sh: *C* *L* libs/ptr_container/doc/comp_ptr_array.sh: *C* *L* libs/ptr_container/doc/comp_ptr_container.sh: *C* *L* libs/ptr_container/doc/comp_ptr_deque.sh: *C* *L* libs/ptr_container/doc/comp_ptr_list.sh: *C* *L* libs/ptr_container/doc/comp_ptr_map.sh: *C* *L* libs/ptr_container/doc/comp_ptr_map_adapter.sh: *C* *L* libs/ptr_container/doc/comp_ptr_multimap.sh: *C* *L* libs/ptr_container/doc/comp_ptr_multimap_adapter.sh: *C* *L* libs/ptr_container/doc/comp_ptr_multiset.sh: *C* *L* libs/ptr_container/doc/comp_ptr_multiset_adapter.sh: *C* *L* libs/ptr_container/doc/comp_ptr_sequence_adapter.sh: *C* *L* libs/ptr_container/doc/comp_ptr_set.sh: *C* *L* libs/ptr_container/doc/comp_ptr_set_adapter.sh: *C* *L* libs/ptr_container/doc/comp_ptr_vector.sh: *C* *L* libs/ptr_container/doc/comp_reference.sh: *C* *L* libs/ptr_container/doc/comp_rever_ptr_container.sh: *C* *L* libs/ptr_container/doc/comp_tutorial.sh: *C* *L* libs/ptr_container/doc/conventions.html: *L* libs/ptr_container/doc/conventions.rst: *L* libs/ptr_container/doc/default.css: *L* libs/ptr_container/doc/examples.rst: *L* libs/ptr_container/doc/faq.html: *L* libs/ptr_container/doc/faq.rst: *L* libs/ptr_container/doc/guidelines.html: *L* libs/ptr_container/doc/guidelines.rst: *L* libs/ptr_container/doc/headers.html: *L* libs/ptr_container/doc/headers.rst: *L* libs/ptr_container/doc/indirect_fun.html: *L* libs/ptr_container/doc/indirect_fun.rst: *L* libs/ptr_container/doc/intro.xml: *C* *L* libs/ptr_container/doc/ptr_array.html: *L* libs/ptr_container/doc/ptr_array.rst: *L* libs/ptr_container/doc/ptr_container.xml: *L* libs/ptr_container/doc/ptr_deque.html: *L* libs/ptr_container/doc/ptr_deque.rst: *L* libs/ptr_container/doc/ptr_list.html: *L* libs/ptr_container/doc/ptr_list.rst: *L* libs/ptr_container/doc/ptr_map.html: *L* libs/ptr_container/doc/ptr_map.rst: *L* libs/ptr_container/doc/ptr_map_adapter.html: *L* libs/ptr_container/doc/ptr_map_adapter.rst: *L* libs/ptr_container/doc/ptr_multimap.html: *L* libs/ptr_container/doc/ptr_multimap.rst: *L* libs/ptr_container/doc/ptr_multimap_adapter.html: *L* libs/ptr_container/doc/ptr_multimap_adapter.rst: *L* libs/ptr_container/doc/ptr_multiset.html: *L* libs/ptr_container/doc/ptr_multiset.rst: *L* libs/ptr_container/doc/ptr_multiset_adapter.html: *L* libs/ptr_container/doc/ptr_multiset_adapter.rst: *L* libs/ptr_container/doc/ptr_sequence_adapter.html: *L* libs/ptr_container/doc/ptr_sequence_adapter.rst: *L* libs/ptr_container/doc/ptr_set.html: *L* libs/ptr_container/doc/ptr_set.rst: *L* libs/ptr_container/doc/ptr_set_adapter.html: *L* libs/ptr_container/doc/ptr_set_adapter.rst: *L* libs/ptr_container/doc/ptr_vector.html: *L* libs/ptr_container/doc/ptr_vector.rst: *L* libs/ptr_container/doc/reference.html: *L* libs/ptr_container/doc/reference.rst: *L* libs/ptr_container/doc/reversible_ptr_container.html: *L* libs/ptr_container/doc/reversible_ptr_container.rst: *L* libs/ptr_container/doc/style.css: *C* *L* libs/ptr_container/doc/todo.txt: *C* *L* libs/ptr_container/doc/tutorial.html: *L* libs/ptr_container/doc/tutorial.rst: *L* libs/ptr_container/index.html: *C* *L* libs/ptr_container/test/Jamfile.v2: *C* *L* libs/ptr_container/test/sequence_point.cpp: *C* *L* |python| boost/python/detail/python22_fixed.h: *L* libs/python/build/Jamfile: *L* libs/python/build/Jamfile.v2: *C* *L* libs/python/doc/PyConDC_2003/bpl.html: *C* *L* libs/python/doc/PyConDC_2003/bpl.txt: *C* *L* libs/python/doc/PyConDC_2003/bpl_mods.txt: *L* libs/python/doc/PyConDC_2003/default.css: *L* libs/python/doc/boost.css: *C* *L* libs/python/doc/building.html: *L* libs/python/doc/index.html: *L* libs/python/doc/internals.html: *L* libs/python/doc/internals.rst: *L* libs/python/doc/polymorphism.txt: *C* *L* libs/python/doc/projects.html: *L* libs/python/doc/support.html: *L* libs/python/doc/tutorial/doc/Jamfile.v2: *C* *L* libs/python/doc/tutorial/doc/html/python/embedding.html: *L* libs/python/doc/tutorial/doc/html/python/exception.html: *L* libs/python/doc/tutorial/doc/html/python/exposing.html: *L* libs/python/doc/tutorial/doc/html/python/functions.html: *L* libs/python/doc/tutorial/doc/html/python/hello.html: *L* libs/python/doc/tutorial/doc/html/python/iterators.html: *L* libs/python/doc/tutorial/doc/html/python/object.html: *L* libs/python/doc/tutorial/doc/html/python/techniques.html: *L* libs/python/doc/tutorial/index.html: *C* *L* libs/python/doc/v2/Apr2002.html: *L* libs/python/doc/v2/CallPolicies.html: *L* libs/python/doc/v2/Dereferenceable.html: *L* libs/python/doc/v2/Extractor.html: *L* libs/python/doc/v2/HolderGenerator.html: *L* libs/python/doc/v2/Jun2002.html: *L* libs/python/doc/v2/Mar2002.html: *L* libs/python/doc/v2/May2002.html: *L* libs/python/doc/v2/ObjectWrapper.html: *L* libs/python/doc/v2/ResultConverter.html: *L* libs/python/doc/v2/acknowledgments.html: *L* libs/python/doc/v2/args.html: *L* libs/python/doc/v2/call.html: *L* libs/python/doc/v2/call_method.html: *L* libs/python/doc/v2/callbacks.html: *L* libs/python/doc/v2/callbacks.txt: *C* *L* libs/python/doc/v2/class.html: *L* libs/python/doc/v2/configuration.html: *L* libs/python/doc/v2/copy_const_reference.html: *L* libs/python/doc/v2/copy_non_const_reference.html: *L* libs/python/doc/v2/data_members.html: *L* libs/python/doc/v2/def.html: *L* libs/python/doc/v2/def_visitor.html: *L* libs/python/doc/v2/default_call_policies.html: *L* libs/python/doc/v2/definitions.html: *L* libs/python/doc/v2/dict.html: *L* libs/python/doc/v2/docstring_options.html: *L* libs/python/doc/v2/enum.html: *L* libs/python/doc/v2/errors.html: *L* libs/python/doc/v2/exception_translator.html: *L* libs/python/doc/v2/exec.html: *L* libs/python/doc/v2/extract.html: *L* libs/python/doc/v2/faq.html: *L* libs/python/doc/v2/feb2002.html: *L* libs/python/doc/v2/handle.html: *L* libs/python/doc/v2/has_back_reference.html: *L* libs/python/doc/v2/implicit.html: *L* libs/python/doc/v2/import.html: *L* libs/python/doc/v2/index.html: *C* *L* libs/python/doc/v2/indexing.html: *L* libs/python/doc/v2/init.html: *L* libs/python/doc/v2/instance_holder.html: *L* libs/python/doc/v2/iterator.html: *L* libs/python/doc/v2/list.html: *L* libs/python/doc/v2/long.html: *L* libs/python/doc/v2/lvalue_from_pytype.html: *L* libs/python/doc/v2/make_function.html: *L* libs/python/doc/v2/manage_new_object.html: *L* libs/python/doc/v2/module.html: *L* libs/python/doc/v2/numeric.html: *L* libs/python/doc/v2/object.html: *L* libs/python/doc/v2/opaque_pointer_converter.html: *L* libs/python/doc/v2/operators.html: *L* libs/python/doc/v2/overloads.html: *L* libs/python/doc/v2/pickle.html: *L* libs/python/doc/v2/platforms.html: *L* libs/python/doc/v2/pointee.html: *L* libs/python/doc/v2/progress_reports.html: *L* libs/python/doc/v2/ptr.html: *L* libs/python/doc/v2/python.html: *L* libs/python/doc/v2/raw_function.html: *L* libs/python/doc/v2/reference.html: *L* libs/python/doc/v2/reference_existing_object.html: *L* libs/python/doc/v2/register_ptr_to_python.html: *L* libs/python/doc/v2/return_arg.html: *L* libs/python/doc/v2/return_by_value.html: *L* libs/python/doc/v2/return_internal_reference.html: *L* libs/python/doc/v2/return_opaque_pointer.html: *L* libs/python/doc/v2/return_value_policy.html: *L* libs/python/doc/v2/scope.html: *L* libs/python/doc/v2/stl_iterator.html: *L* libs/python/doc/v2/str.html: *L* libs/python/doc/v2/to_python_converter.html: *L* libs/python/doc/v2/to_python_indirect.html: *L* libs/python/doc/v2/to_python_value.html: *L* libs/python/doc/v2/tuple.html: *L* libs/python/doc/v2/type_id.html: *L* libs/python/doc/v2/with_custodian_and_ward.html: *L* libs/python/doc/v2/wrapper.html: *L* libs/python/example/Jamfile: *L* libs/python/example/Jamfile.v2: *C* *L* libs/python/example/README: *C* *L* libs/python/example/boost-build.jam: *L* libs/python/example/test_getting_started1.py: *C* *L* libs/python/example/test_getting_started2.py: *C* *L* libs/python/example/test_std_pair.py: *C* *L* libs/python/index.html: *C* *L* libs/python/pyste/NEWS: *C* *L* libs/python/pyste/README: *C* *L* libs/python/pyste/TODO: *C* *L* libs/python/pyste/dist/create_build.py: *C* *L* libs/python/pyste/dist/setup.py: *C* *L* libs/python/pyste/doc/adding_new_methods.html: *L* libs/python/pyste/doc/exporting_an_entire_header.html: *L* libs/python/pyste/doc/global_variables.html: *L* libs/python/pyste/doc/inserting_code.html: *L* libs/python/pyste/doc/introduction.html: *L* libs/python/pyste/doc/policies.html: *L* libs/python/pyste/doc/pyste.txt: *C* *L* libs/python/pyste/doc/renaming_and_excluding.html: *L* libs/python/pyste/doc/running_pyste.html: *L* libs/python/pyste/doc/smart_pointers.html: *L* libs/python/pyste/doc/templates.html: *L* libs/python/pyste/doc/the_interface_files.html: *L* libs/python/pyste/doc/theme/style.css: *L* libs/python/pyste/doc/wrappers.html: *L* libs/python/pyste/index.html: *L* libs/python/pyste/install/pyste.py: *C* *L* libs/python/pyste/install/setup.py: *C* *L* libs/python/release_notes.txt: *C* *L* libs/python/test/Jamfile: *C* *L* libs/python/test/Jamfile.v2: *C* *L* libs/python/test/andreas_beyer.cpp: *C* *L* libs/python/test/crossmod_exception.py: *L* libs/python/test/exec.py: *C* *L* libs/python/test/opaque.py: *L* libs/python/test/pointer_vector.cpp: *C* *L* |quickbook| tools/quickbook/doc/Jamfile.v2: *C* *L* tools/quickbook/doc/html/quickbook/change_log.html: *L* tools/quickbook/doc/html/quickbook/intro.html: *L* tools/quickbook/doc/html/quickbook/ref.html: *L* tools/quickbook/doc/html/quickbook/syntax.html: *L* tools/quickbook/doc/html/quickbook/syntax/block.html: *L* tools/quickbook/doc/html/quickbook/syntax/comments.html: *L* tools/quickbook/doc/html/quickbook/syntax/phrase.html: *L* tools/quickbook/index.html: *C* *L* |random| libs/random/index.html: *C* *L* libs/random/nondet_random.html: *C* *L* libs/random/random-concepts.html: *C* *L* libs/random/random-distributions.html: *C* *L* libs/random/random-generators.html: *C* *L* libs/random/random-misc.html: *C* *L* libs/random/random-performance.html: *C* *L* libs/random/random-variate.html: *C* *L* libs/random/test/Jamfile: *C* *L* libs/random/test/Jamfile.v2: *C* *L* libs/random/wg21-proposal.html: *C* *L* |range| libs/range/doc/boost_range.html: *L* libs/range/doc/example.cpp: *C* *L* libs/range/doc/examples.html: *L* libs/range/doc/faq.html: *L* libs/range/doc/headers.html: *L* libs/range/doc/history_ack.html: *L* libs/range/doc/intro.html: *L* libs/range/doc/portability.html: *L* libs/range/doc/range.html: *L* libs/range/doc/style.css: *C* *L* libs/range/doc/style.html: *L* libs/range/doc/utility_class.html: *L* libs/range/test/TODO: *C* *L* libs/range/test/compat1.cpp: *C* *L* |rational| boost/rational.hpp: *L* libs/rational/index.html: *L* libs/rational/rational.html: *L* libs/rational/rational_example.cpp: *L* libs/rational/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: *C* *L* tools/regression/build/Jamfile.v2: *C* *L* tools/regression/detail/tiny_xml_test.txt: *C* *L* tools/regression/index.htm: *C* *L* tools/regression/regression-logs.pl: *L* tools/regression/run_tests.sh: *C* *L* tools/regression/test/Jamfile: *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* tools/regression/xsl_reports/runner/default.css: *L* tools/regression/xsl_reports/runner/instructions.html: *L* tools/regression/xsl_reports/runner/instructions.rst: *C* *L* tools/regression/xsl_reports/test/common.py: *C* *L* tools/regression/xsl_reports/test/expected_results.xml: *C* *L* tools/regression/xsl_reports/test/generate_test_results.py: *C* *L* tools/regression/xsl_reports/test/generate_test_results_v1.py: *C* *L* tools/regression/xsl_reports/test/restrict_to_library.xsl: *C* *L* tools/regression/xsl_reports/test/run_notes_regression.py: *C* *L* tools/regression/xsl_reports/test/run_v1.py: *C* *L* tools/regression/xsl_reports/test/test.py: *C* *L* tools/regression/xsl_reports/test/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* tools/regression/xsl_reports/utils/accept_args.py: *C* *L* tools/regression/xsl_reports/utils/char_translation_table.py: *C* *L* tools/regression/xsl_reports/utils/check_existance.py: *C* *L* tools/regression/xsl_reports/utils/checked_system.py: *C* *L* tools/regression/xsl_reports/utils/libxslt.py: *C* *L* tools/regression/xsl_reports/utils/log.py: *C* *L* tools/regression/xsl_reports/utils/makedirs.py: *C* *L* tools/regression/xsl_reports/utils/send_mail.py: *C* *L* tools/regression/xsl_reports/utils/sourceforge.py: *C* *L* tools/regression/xsl_reports/utils/tar.py: *C* *L* tools/regression/xsl_reports/utils/zip.py: *C* *L* tools/regression/xsl_reports/xsl/v2/expected_to_1_33_format.xsl: *C* *L* |release| tools/release/user-config.jam: *L* tools/release/utils.py: *C* *L* |serialization| libs/serialization/doc/style.css: *C* *L* libs/serialization/example/demo_output.txt: *C* *L* libs/serialization/example/demo_save.xml: *C* *L* libs/serialization/example/demofile.txt: *C* *L* libs/serialization/test/run_archive_test.bat: *C* *L* libs/serialization/test/runtest.bat: *C* *L* libs/serialization/test/runtest.sh: *C* *L* libs/serialization/vc7ide/readme.txt: *C* *L* |signals| libs/signals/doc/Jamfile.v2: *C* *L* libs/signals/doc/design.xml: *C* *L* libs/signals/doc/faq.xml: *C* *L* libs/signals/doc/index.html: *C* *L* libs/signals/doc/introduction.xml: *C* *L* libs/signals/doc/rationale.xml: *C* *L* libs/signals/doc/reference/connection.xml: *C* *L* libs/signals/doc/reference/last_value.xml: *C* *L* libs/signals/doc/reference/reference.xml: *C* *L* libs/signals/doc/reference/signal_header.xml: *C* *L* libs/signals/doc/reference/slot.xml: *C* *L* libs/signals/doc/reference/trackable.xml: *C* *L* libs/signals/doc/reference/visit_each.xml: *C* *L* libs/signals/doc/tests.xml: *C* *L* libs/signals/doc/tutorial.xml: *C* *L* libs/signals/index.html: *C* *L* |smart_ptr| libs/smart_ptr/compatibility.htm: *L* libs/smart_ptr/enable_shared_from_this.html: *L* libs/smart_ptr/index.html: *C* *L* libs/smart_ptr/intrusive_ptr.html: *L* libs/smart_ptr/scoped_array.htm: *L* libs/smart_ptr/scoped_ptr.htm: *L* libs/smart_ptr/shared_array.htm: *L* libs/smart_ptr/shared_ptr.htm: *L* libs/smart_ptr/smart_ptr.htm: *L* libs/smart_ptr/smarttests.htm: *L* libs/smart_ptr/sp_techniques.html: *L* libs/smart_ptr/test/Jamfile: *L* libs/smart_ptr/test/Jamfile.v2: *L* libs/smart_ptr/weak_ptr.htm: *L* |spirit| libs/spirit/example/intermediate/simple_xml/actions.hpp: *C* *L* libs/spirit/example/intermediate/simple_xml/driver.cpp: *C* *L* libs/spirit/example/intermediate/simple_xml/tag.cpp: *C* *L* libs/spirit/example/intermediate/simple_xml/xml_g.hpp: *C* *L* libs/spirit/fusion/test/pair_tests.cpp: *C* *L* |test| boost/test/included/unit_test_framework.hpp: *C* *L* 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* |thread| boost/thread/barrier.hpp: *L* boost/thread/condition.hpp: *L* boost/thread/detail/config.hpp: *L* boost/thread/detail/lock.hpp: *L* boost/thread/detail/read_write_lock.hpp: *L* boost/thread/exceptions.hpp: *L* boost/thread/mutex.hpp: *L* boost/thread/once.hpp: *L* boost/thread/read_write_mutex.hpp: *L* boost/thread/recursive_mutex.hpp: *L* boost/thread/thread.hpp: *L* boost/thread/tss.hpp: *L* boost/thread/xtime.hpp: *L* libs/thread/build/Jamfile: *L* libs/thread/build/Jamfile.v2: *C* *L* libs/thread/build/threads.jam: *L* libs/thread/doc/Jamfile.v2: *C* *L* libs/thread/doc/acknowledgements.xml: *C* *L* libs/thread/doc/barrier-ref.xml: *C* *L* libs/thread/doc/bibliography.xml: *L* libs/thread/doc/build.xml: *C* *L* libs/thread/doc/concepts.xml: *C* *L* libs/thread/doc/condition-ref.xml: *C* *L* libs/thread/doc/configuration.xml: *C* *L* libs/thread/doc/design.xml: *C* *L* libs/thread/doc/entities.xml: *C* *L* libs/thread/doc/exceptions-ref.xml: *C* *L* libs/thread/doc/faq.xml: *C* *L* libs/thread/doc/glossary.xml: *C* *L* libs/thread/doc/implementation_notes.xml: *C* *L* libs/thread/doc/index.html: *C* *L* libs/thread/doc/mutex-ref.xml: *C* *L* libs/thread/doc/once-ref.xml: *C* *L* libs/thread/doc/overview.xml: *C* *L* libs/thread/doc/rationale.xml: *C* *L* libs/thread/doc/read_write_mutex-ref.xml: *C* *L* libs/thread/doc/recursive_mutex-ref.xml: *C* *L* libs/thread/doc/reference.xml: *C* *L* libs/thread/doc/release_notes.xml: *C* *L* libs/thread/doc/thread-ref.xml: *C* *L* libs/thread/doc/thread.xml: *L* libs/thread/doc/tss-ref.xml: *C* *L* libs/thread/doc/xtime-ref.xml: *C* *L* libs/thread/example/Jamfile: *L* libs/thread/example/Jamfile.v2: *C* *L* libs/thread/example/condition.cpp: *L* libs/thread/example/monitor.cpp: *L* libs/thread/example/mutex.cpp: *L* libs/thread/example/once.cpp: *L* libs/thread/example/recursive_mutex.cpp: *L* libs/thread/example/starvephil.cpp: *L* libs/thread/example/tennis.cpp: *L* libs/thread/example/thread.cpp: *L* libs/thread/example/thread_group.cpp: *L* libs/thread/example/tss.cpp: *L* libs/thread/example/xtime.cpp: *L* libs/thread/index.html: *C* *L* libs/thread/src/barrier.cpp: *L* libs/thread/src/condition.cpp: *L* libs/thread/src/exceptions.cpp: *L* libs/thread/src/mutex.cpp: *L* libs/thread/src/once.cpp: *L* libs/thread/src/read_write_mutex.cpp: *L* libs/thread/src/recursive_mutex.cpp: *L* libs/thread/src/thread.cpp: *L* libs/thread/src/tss.cpp: *L* libs/thread/src/xtime.cpp: *L* libs/thread/test/Jamfile: *L* libs/thread/test/Jamfile.v2: *L* libs/thread/test/test_barrier.cpp: *L* libs/thread/test/test_condition.cpp: *L* libs/thread/test/test_mutex.cpp: *L* libs/thread/test/test_once.cpp: *L* libs/thread/test/test_read_write_mutex.cpp: *L* libs/thread/test/test_thread.cpp: *L* libs/thread/test/test_tss.cpp: *L* libs/thread/test/test_xtime.cpp: *L* libs/thread/tutorial/Jamfile: *L* libs/thread/tutorial/bounded_buffer.cpp: *L* libs/thread/tutorial/counter.cpp: *L* libs/thread/tutorial/factorial.cpp: *L* libs/thread/tutorial/factorial2.cpp: *L* libs/thread/tutorial/factorial3.cpp: *L* libs/thread/tutorial/helloworld.cpp: *L* libs/thread/tutorial/helloworld2.cpp: *L* libs/thread/tutorial/helloworld3.cpp: *L* libs/thread/tutorial/helloworld4.cpp: *L* libs/thread/tutorial/once.cpp: *L* libs/thread/tutorial/tss.cpp: *L* |timer| libs/timer/index.html: *C* *L* libs/timer/timer.htm: *L* |tokenizer| libs/tokenizer/char_delimiters_separator.htm: *L* libs/tokenizer/char_separator.htm: *L* libs/tokenizer/escaped_list_separator.htm: *L* libs/tokenizer/index.html: *L* libs/tokenizer/introduc.htm: *L* libs/tokenizer/offset_separator.htm: *L* libs/tokenizer/token_iterator.htm: *L* libs/tokenizer/tokenizer.htm: *L* libs/tokenizer/tokenizerfunction.htm: *L* |tools| tools/Jamfile.v2: *C* *L* tools/index.html: *C* *L* tools/make-cputime-page.pl: *C* *L* |tuple| libs/tuple/doc/design_decisions_rationale.html: *L* libs/tuple/doc/tuple_advanced_interface.html: *L* libs/tuple/doc/tuple_users_guide.html: *L* libs/tuple/index.html: *C* *L* libs/tuple/test/Jamfile: *C* *L* libs/tuple/test/README: *C* *L* |typeof| libs/typeof/index.html: *C* *L* libs/typeof/test/Jamfile: *C* *L* libs/typeof/test/Jamfile.v2: *C* *L* libs/typeof/test/data_member.cpp: *C* *L* libs/typeof/test/function.cpp: *C* *L* libs/typeof/test/function_binding.cpp: *C* *L* libs/typeof/test/function_ptr.cpp: *C* *L* libs/typeof/test/function_ptr_from_tpl.cpp: *C* *L* libs/typeof/test/function_ref.cpp: *C* *L* libs/typeof/test/member_function.cpp: *C* *L* libs/typeof/test/modifiers.cpp: *C* *L* libs/typeof/test/nested_typedef.cpp: *C* *L* libs/typeof/test/noncopyable.cpp: *C* *L* libs/typeof/test/odr.hpp: *C* *L* libs/typeof/test/odr1.cpp: *C* *L* libs/typeof/test/odr2.cpp: *C* *L* libs/typeof/test/odr_no_uns1.cpp: *C* *L* libs/typeof/test/odr_no_uns1.hpp: *C* *L* libs/typeof/test/odr_no_uns2.cpp: *C* *L* libs/typeof/test/odr_no_uns2.hpp: *C* *L* libs/typeof/test/std.cpp: *C* *L* libs/typeof/test/template_dependent.cpp: *C* *L* libs/typeof/test/template_enum.cpp: *C* *L* libs/typeof/test/template_int.cpp: *C* *L* libs/typeof/test/template_multiword.cpp: *C* *L* libs/typeof/test/template_tpl.cpp: *C* *L* libs/typeof/test/template_type.cpp: *C* *L* libs/typeof/test/type.cpp: *C* *L* |unknown| boost/thread.hpp: *L* |utility| boost/shared_container_iterator.hpp: *L* boost/utility/value_init.hpp: *C* libs/utility/Assignable.html: *L* libs/utility/Collection.html: *L* libs/utility/CopyConstructible.html: *L* libs/utility/LessThanComparable.html: *L* libs/utility/MultiPassInputIterator.html: *L* libs/utility/OptionalPointee.html: *L* libs/utility/assert.html: *L* libs/utility/call_traits.htm: *L* libs/utility/checked_delete.html: *L* libs/utility/compressed_pair.htm: *L* libs/utility/current_function.html: *L* libs/utility/enable_if.html: *L* libs/utility/generator_iterator.htm: *C* *L* libs/utility/index.html: *C* *L* libs/utility/iterator_adaptors.htm: *L* libs/utility/test/Jamfile: *L* libs/utility/test/Jamfile.v2: *L* libs/utility/throw_exception.html: *L* libs/utility/utility.htm: *L* libs/utility/value_init.htm: *L* libs/utility/value_init_test.cpp: *C* libs/utility/value_init_test_fail1.cpp: *C* libs/utility/value_init_test_fail2.cpp: *C* libs/utility/value_init_test_fail3.cpp: *C* |variant| libs/variant/doc/Jamfile.v2: *C* *L* libs/variant/doc/biblio.xml: *C* *L* libs/variant/doc/design.xml: *C* *L* libs/variant/doc/introduction.xml: *C* *L* libs/variant/doc/misc.xml: *C* *L* libs/variant/doc/reference/apply_visitor.xml: *C* *L* libs/variant/doc/reference/bad_visit.xml: *C* *L* libs/variant/doc/reference/concepts.xml: *C* *L* libs/variant/doc/reference/get.xml: *C* *L* libs/variant/doc/reference/recursive_variant.xml: *C* *L* libs/variant/doc/reference/recursive_wrapper.xml: *C* *L* libs/variant/doc/reference/reference.xml: *C* *L* libs/variant/doc/reference/static_visitor.xml: *C* *L* libs/variant/doc/reference/variant.xml: *C* *L* libs/variant/doc/reference/variant_fwd.xml: *C* *L* libs/variant/doc/reference/visitor_ptr.xml: *C* *L* libs/variant/doc/tutorial/advanced.xml: *C* *L* libs/variant/doc/tutorial/basic.xml: *C* *L* libs/variant/doc/tutorial/tutorial.xml: *C* *L* libs/variant/doc/variant.xml: *L* libs/variant/index.html: *C* *L* libs/variant/test/Jamfile: *L* libs/variant/test/Jamfile.v2: *L* |wiki| wiki/index.html: *C* *L* |xpressive| libs/xpressive/index.html: *C* *L* libs/xpressive/perf/Jamfile.v2: *C* *L* libs/xpressive/perf/command_line.cpp: *C* *L* libs/xpressive/perf/gcc/long_twain_search.xml: *C* *L* libs/xpressive/perf/gcc/short_matches.xml: *C* *L* libs/xpressive/perf/gcc/short_twain_search.xml: *C* *L* libs/xpressive/perf/main.cpp: *L* libs/xpressive/perf/msvc/long_twain_search.xml: *C* *L* libs/xpressive/perf/msvc/short_matches.xml: *C* *L* libs/xpressive/perf/msvc/short_twain_search.xml: *C* *L* libs/xpressive/perf/regex_comparison.hpp: *L* libs/xpressive/perf/time_boost.cpp: *L* libs/xpressive/perf/time_dynamic_xpressive.cpp: *L* libs/xpressive/perf/time_static_xpressive.cpp: *L* libs/xpressive/test/multiple_defs1.cpp: *C* *L* libs/xpressive/test/multiple_defs2.cpp: *C* *L* libs/xpressive/test/regress.txt: *C* *L*

1 0

Re: [boost] Exception Visitor
by Sohail Somani 18 Jul '06

18 Jul '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Jeremy Day > Sent: Tuesday, July 18, 2006 10:56 AM > To: boost(a)lists.boost.org > Subject: Re: [boost] Exception Visitor > > On 7/18/06, Sohail Somani <s.somani(a)fincad.com> wrote: > > > > I just don't see the point, except as an academic exercise > > > The point is partly academic, as I am working on learning > MPL. However, I > think that this technique, or some derivation thereof, can > help make code > more maintainable, since you can reuse my_exception_handler > whenever you > want to handle the same exception in the same way, even > though you catch it > in a different place. With catch blocks the only recourse, > so far as I can > tell, is to basically copy-and-paste the catch code to each > location where > you need the exception handling code. This is true. Though I personally tend to use macros for this specific instance.

1 0

[format] Handling of char
by Philipp Henkel 18 Jul '06

18 Jul '06

Dear all, I wondered about boost::format's printf behaviour regarding char's. There seems to be no difference between the two format pattern "%c" and "%d". boost::format does not interpret chars as decimal values when using "%d". Please take a look a the following example: unsigned char foo = 65; printf("foo = %d", foo); // output is "foo = 65" std::string bar = (boost::format("foo = %d\n") % foo).str(); printf(bar.c_str()); // output is "foo = A" which is what I want when using "%c" Is this behaviour intended? From my point of view it's dangerous because printf users do not expect it. Furthermore it may lead to string truncations because of string terminators (char is 0) which are inserted by accident. Did I overlook something? I'm using boost 1.33.1 / VC8. Best regards, Philipp

2 1