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

[Boost-bugs] [ boost-Feature Requests-1545187 ] [jam] HardLink rule on NT platform
by SourceForge.net 23 Aug '06

23 Aug '06

Feature Requests item #1545187, was opened at 2006-08-23 03:16 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1545187&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: [jam] HardLink rule on NT platform Initial Comment: I've installed boost and noticed that HardLink rule on NT copies file although NT has support for hardlinks (on NTFS, of course). To use this feature while installing boost i've created file hardlink.bat with following contents: fsutil hardlink create %2 %1 and put it into %WINDIR%\system32 also i've changed line 194 of tools\build\v1\allyourbase.jam file from LN ?= $(CP) ; to LN ?= hardlink ; these changes allowed me to save about 600 M of my harddisk space. Not a big deal, yes, but otherwise these 600M would exceed my disk space :-) I think my solution is not ideal, but it could be helpful for people. So maybe it will be included in boost distibution, when adapted. Thanks. mailto: forums (dog here) green dot nsk dot ru ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=357586&aid=1545187&group_… ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[Boost-bugs] [ boost-Support Requests-1545133 ] Boost.Format doesn't work on MSVC with /vd2 compiler option
by SourceForge.net 23 Aug '06

23 Aug '06

Support Requests item #1545133, was opened at 2006-08-23 12:50 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1545133&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: SMART_n (smart_n) Assigned to: Nobody/Anonymous (nobody) Summary: Boost.Format doesn't work on MSVC with /vd2 compiler option Initial Comment: The problem is that Boost.Format doesn't work(raise exception) with /vd2 compiler option on Microsoft Visual Studio 2005. Is it possible to use Boost.Format with this compiler option? ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1545133&group_… ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Presentation of Boost.Process (SoC project)
by Julio M. Merino Vidal 23 Aug '06

23 Aug '06

Hello, During the past two-three months Jeff Garland (as mentor) and I have been working on the Boost Summer of Code project whose goal was to implement a library to spawn and manage child processes. A little introduction and a link to the source code can be found here: https://www.boost-consulting.com:8443/trac/soc/wiki/process But you'll probably want to go straight to the documentation which includes, among many other information, a couple of tutorials and multiple examples. I'm keeping an up-to-date snapshot at the following URL: http://www.NetBSD.org/~jmmv/process/ If it wasn't for the imminent SoC deadline (next Monday), I wouldn't present it just yet because there are still a couple of important issues that I would like to see resolved as soon as possible: First is the lack of a "design decisions" chapter in the documentation. This is not an extremely big issue because the Wiki page linked above already contains many discussions on the library's current design. In other words, that chapter will end up summarizing the information in there and adding few new things. Second, and very important, is the "need" to integrate the library with Boost.Asio to allow asynchronous management of communication streams and process termination. Unfortunately it does not support such asynchronous events yet, and integrating with Boost.Asio sounds like a reasonable approach to cover this area. Anyway, I wouldn't like this to discourage you from taking a look at the documentation and code. The library is already big enough to let you get a general idea on its focus and design. You can start criticising now! ;-) Sincerely, any constructive comments will be certainly appreciated. Thank you. PS: I'd be great if you could attempt to run the test suite on any platform not listed in the "Platforms and compilers" chapter. PSS: I hope to continue working on it after SoC is officially over. -- Julio M. Merino Vidal <jmmv84(a)gmail.com> The Julipedia - http://julipedia.blogspot.com/

5 11

[facets] strict_num_put design problem
by Johan Råde 23 Aug '06

23 Aug '06

Robert Ramey has evicted my facets for non-finite numbers from the serialization namespace :-) They clearly don't belong there. So I've moved them to a new facets namespace. I have moved the code in the vault from the Serialization folder to a new Facets folder. And I have started a new thread. ------------------------------------------------------------------------- There is a serious problem with the design of the facets strict_num_put and strict_num_get. These facets are supposed to set the failbit of the stream when they encounter non-finite numbers. This may not be a good idea, because Facets derived from std::num_put and std::num_get should do formatting and parsing, not data validation. The designers of the standard library made the following assumptions: 1. Facets derived from std::num_put do formatting. 2. Facets derived from std::num_get do parsing. 3. Formatting always succeeds. 4. Parsing may fail. This led them to the following design decisions: 5. Facets derived from std::num_put do not have access to the stream state. 6. Facets derived from std::num_get do have access to the stream state. The facets strict_num_put and and strict_num_get violate assumptions 1 and 2. The facet strict_num_put does validation and formatting. The facet strict_num_get does parsing and validation. This makes it difficult to implement strict_num_put. What should it do when validation fails? It can not set the failbit of the stream. The only thing it can do, is to throw an exception. The stream will catch that exception and set the badbit! At least with VC++ 7.1. Why? The stream probably assumes that formatting facets do not throw exceptions, so it concludes that the exception was thrown by the stream buffer. When the stream buffer is corrupted, the stream sets the badbit. However, setting the badbit when data validation fails, is a bad idea. Suggested solution: Throw out the facets strict_num_put and strict_num_get. Comments? The documentation of the library has been updated to reflect this problem. --Johan Råde

3 5

fixed-point math library?
by Michael Marcin 22 Aug '06

22 Aug '06

Does boost have a fixed-point math library? -- Michael Marcin Method Solutions, Programmer

1 0

Yet another concept checker
by Chad Parry 22 Aug '06

22 Aug '06

I would like to know if many people in the community think the following library would be useful. I would like to define concepts using this syntax: template<typename left_type, typename right_type = left_type> struct less_than_comparable { static var<left_type const> left; static var<right_type const> right; static var<bool> b; typedef CONCEPTS_USE_PATTERN(b = (left < right)) constraints; }; In the code above the less_than_comparable<T, U> concept is defined. The var<> type is meant to resemble the Var<> in Stroustrup's concept proposals. The CONCEPTS_USE_PATTERN(EXP) macro expands to BOOST_TYPEOF(EXP). The b, left and right variables have lambda-like capabilities where you can apply any operation on them and they return a complex type that remembers what operations have been applied. Functions that want to enforce concepts would use this syntax: template<typename operand_type> bool my_less_than(operand_type left, operand_type right) { // Enforce the model. typedef less_than_comparable<operand_type> model; BOOST_STATIC_ASSERT(is_match<model>::value); constrained_proxy<1, model> constrained_left(constrain<1, model>(left)); constrained_proxy<2, model> constrained_right(constrain<2, model>(right)); // Use the constrained proxies just like regular types. return (constrained_left < constrained_right); } Obviously this syntax is more cumbersome than the current Boost Concept Check Library's. But it offers more power too: 1) The author doesn't have to hand-craft an archetype class! The model knows what operations should be allowed and the constrained_proxy<> class enforces that only those operations are taken. 2) It is possible to check whether a model is valid without causing a fatal error. That's what the is_match<model> metapredicate is for. This could be used to dispatch different optimized code depending on which concepts the type is known to model. Now, there are some things that can't be detected by library code (like the presence of a default constructor) so I would have to rely on authors to provide hints about those. I'm planning on just assuming that any requirements I can't detect are fulfilled, and then the compiler will complain if that's wrong. 3) The concepts can be built up from primitives using and_ and or_ and not_ operations, just like in Stroustrup's proposals. For example, the concept above could have included this statement instead: "typedef and_<CONCEPTS_USE_PATTERN(b = left < right), CONCEPTS_USE_PATTERN(b = right < left), copy_constructible<left> > constraints;" 4) This use pattern syntax more closely resembles the C++0x use pattern proposals than any other existing library. 5) The constrained_proxy class prevents certain errors where a pathological type behaves unexpectedly. I'm talking about functions like "evil_bool_proxy operator<(mytype, mytype)" where evil_bool_proxy defines its own && and || operators. In the expression, "(a < b) && (c < d)" the constrained_proxy enforces that the && operation gets applied to bool values, not to evil_bool_proxy values. 6) This mechanism allows you to express that a model has important semantic implications also. The library assumes that a model is valid if it is a structural match. But you can override that by saying, "template<typename value_type> declare_match<forward_iterator<istream_iterator<value_type> > > : false_ { };" 7) Traits classes could potentially be added to this library so that authors could express mappings such as that the constrained_proxy should call a free function "push_back(my_seq, elem)" instead of the normal "my_seq.push_back (elem)" for a given sequence type. So far I have gotten var<> and declare_match<> and is_match<> to compile. I've also finished and_<>, or_<> and not_<>. I'm working on constrained_proxy<>. -- chad

3 4

Re: [boost] Windows invalid chars in file names
by Yitzhak Sapir 22 Aug '06

22 Aug '06

Bronek Kozicki wrote: > Yes and no - there are platform specific limtations that apply to > any filesystem attached to the machine you run your program on, > and there are also filesystem specific limitations. I have nothing > against library enforcing platform specific limitations, however it > should not try to enforce limitations that not always apply - > instead just go and try to create the file, and report error > (presumably via exception) if that fails. It appears to me that the issue in our code is going to be solved by using the boost portability checker rather than the boost native checker. However, your statements in the last mail show some (in my opinion) misunderstandings, and the discussion suggests that the boost filesystem only goes halfway towards fulfilling its goals. To start off, it could be understood from you that the reason question marks or asterisks are not allowed is that they are problematic for the filesystem but not the operating system. Looking at the invalid set of characters in your URL -- "< > : " / \ |" it becomes quite clear that the logic behind these is that they are reserved tokens in the command shell. But, in fact, so is "question mark" or "asterisk." The NTFS filesystem itself probably could care less if the filename has a question mark but certain operating system utilities such as the command shell, the file search dialog, or the FindFirstFile and related functions will not operate properly if it could be allowed. Furthermore, to quote one of the basic requirements of the boost::filesystem Library as listed in: http://boost.org/libs/filesystem/doc/design.htm "Interface smoothly with current C++ Standard Library input/output facilities. For example, paths should work in std::basic_fstream constructors. "Rationale: One of the most common uses of file system functionality is to manipulate paths for eventual use in input/output operations. Thus the need to interface smoothly with standard library I/O." I can't see how "work" fits in with a constructor throwing an exception because the path is invalid. Naturally, if no checker was used to construct the boost::filesystem::path object, then the library safeguards against this have been bypassed. But if the user provides the native checker why shouldn't the library identify a problem such as an asterisk or question mark inappropriately placed in the path? Furthermore, the library identifies the need to work within the reality that "Some operating systems allow file systems with different characteristics to be "mounted" within a directory tree. Thus a ISO-9660 or Windows file system may end up as a sub-tree of a POSIX directory tree." If an operating system allows multiple filesystems, the boost filesystem should identify and allow for this reality. In an ideal scenario, the boost filesystem "native" checker will: A) identify whether the path is legal for the operating system B) identify which filesystem the path references C) identify whether the path is legal for the referenced filesystem Fulfilling (A) alone requires a user to provide himself the functionality of (B) and (C). Simply hoping for an exception in the constructor of fstream falls short of the stated goal of smooth interfacing with the standard i/o library. Various scenarios can also be produced that show shortcomings in such a method. For example, a mail system with a GUI interface that stores mail in directories or files named according to the name of the user. The GUI interface, when asked to create a new user, should not permit creation of a username whose name is not valid in the filesystem. But only if the user presses OK, should the filesystem be expected to create the user file and if it exists ask whether the user directory should be overwritten. There is a very wide pattern here that is used in all sorts of applications, whether it is a firefox profile, an IDE project name, or a mail directory or inbox file. The filesystem as it exists now requires each one of these to write their own logic to handle (B) and (C) above, whereas this should be expected of a purported all- purpose "standard" filesystem library. Yitzhak Sapir

2 1

[config] Dinkumware 4.0.2 has hash containers
by Pavel Vozenilek 22 Aug '06

22 Aug '06

Dinkumware used in Borland BDS 2006 contains hash containers but Boost.Config does not know about it. dinkumware.hpp could be updated: #if (defined _CPPLIB_VER) && (_CPPLIB_VER >= 402) # ifdef __BORLANDC__ // BDS 2006 STL has hash containers # define BOOST_HAS_HASH # endif #endif Possibly this is true for other systems than BCB but I do not have access to these. /Pavel

2 1

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

22 Aug '06

Boost Inspection Report Run Date: 16:06:59 UTC, Tuesday 22 August 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: 11646 files scanned 901 directories scanned 248 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 146 broken links 28 unlinked files 11 file names too long 15 files with tabs 3 violations of the Boost min/max guidelines 42 usages of unnamed namespaces in headers (including .ipp files) Summary: archive (3) assign (1) bind (1) boost-root (3) build (9) date_time (2) doc (5) filesystem (36) graph (9) inspect (1) iostreams (2) iterator (8) lambda (3) libs (6) more (34) mpl (1) multi_array (2) numeric (4) parameter (5) ptr_container (1) quickbook (4) range (1) regex (1) regression (13) serialization (1) spirit (2) test (79) thread (3) tr1 (1) type_traits (1) typeof (6) 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 *U* unnamed namespace in header |archive| boost/archive/basic_streambuf_locale_saver.hpp: *N* filename > 31 chars boost/archive/impl/xml_wiarchive_impl.ipp: *U* unnamed namespace at line 53 boost/archive/iterators/remove_whitespace.hpp: *U* unnamed namespace at line 57 |assign| libs/assign/test/ptr_map_inserter.cpp: *T* |bind| boost/bind/placeholders.hpp: *U* unnamed namespace at line 25 |boost-root| index.htm: *A* broken link: doc/html/typeof.html *A* broken link: libs/filesystem/doc/convenience.htm#basic_recursive_directory_iterator *A* broken link: sorted_erdos_renyi_generator.html |build| tools/build/v1/variables.html: *A* unlinked file 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/doc/index.html: *A* broken link: ../../LICENSE_1_0.txt 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 doc/html/foreach.html: *A* broken link: index.html doc/html/xpressive.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 |graph| boost/graph/maximum_cardinality_matching.hpp: *M* violation of Boost min/max guidelines on line 755 *N* filename > 31 chars 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* |inspect| tools/inspect/unnamed_namespace_check.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 |lambda| boost/lambda/core.hpp: *U* unnamed namespace at line 62 boost/lambda/detail/lambda_functors.hpp: *U* unnamed namespace at line 25 boost/lambda/exceptions.hpp: *U* unnamed namespace at line 24 |libs| 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 |more| more/feature_model_diagrams.htm: *A* broken link: FeatureDescriptions more/formal_review_schedule.html: *A* broken link: report-apr-2006.html 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 |mpl| boost/mpl/alias.hpp: *U* unnamed namespace at line 17 |multi_array| boost/multi_array/base.hpp: *U* unnamed namespace at line 69 libs/multi_array/test/generative_tests.hpp: *U* unnamed namespace at line 57 |numeric| 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* |parameter| libs/parameter/doc/html/index.html: *A* broken link: ../../../libs/bind/index.html *A* broken link: ../../../property_map/doc/ReadWritePropertyMap.html *A* broken link: ../../../property_map/doc/ReadablePropertyMap.html *A* broken link: tag::index *A* broken link: tag::name |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |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 |serialization| libs/serialization/src/basic_xml_grammar.ipp: *U* unnamed namespace at line 43 |spirit| boost/spirit/utility/rule_parser.hpp: *U* unnamed namespace at line 70 libs/spirit/test/impl/string_length.hpp: *U* unnamed namespace at line 16 |test| boost/test/floating_point_comparison.hpp: *U* unnamed namespace at line 206 *U* unnamed namespace at line 228 boost/test/impl/cpp_main.ipp: *U* unnamed namespace at line 42 boost/test/impl/exception_safety.ipp: *U* unnamed namespace at line 400 boost/test/impl/framework.ipp: *U* unnamed namespace at line 199 boost/test/impl/plain_report_formatter.ipp: *U* unnamed namespace at line 45 boost/test/impl/progress_monitor.ipp: *U* unnamed namespace at line 38 boost/test/impl/results_collector.ipp: *U* unnamed namespace at line 106 boost/test/impl/results_reporter.ipp: *U* unnamed namespace at line 48 boost/test/impl/unit_test_log.ipp: *U* unnamed namespace at line 79 boost/test/impl/unit_test_monitor.ipp: *U* unnamed namespace at line 35 boost/test/impl/unit_test_parameters.ipp: *U* unnamed namespace at line 50 boost/test/results_collector.hpp: *U* unnamed namespace at line 40 boost/test/test_tools.hpp: *U* unnamed namespace at line 255 boost/test/utils/iterator/token_iterator.hpp: *U* unnamed namespace at line 166 boost/test/utils/named_params.hpp: *U* unnamed namespace at line 216 boost/test/utils/runtime/cla/dual_name_parameter.ipp: *U* unnamed namespace at line 43 boost/test/utils/runtime/cla/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/env/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/file/config_file.hpp: *U* unnamed namespace at line 169 *U* unnamed namespace at line 64 *U* unnamed namespace at line 74 boost/test/utils/runtime/file/config_file_iterator.hpp: *U* unnamed namespace at line 68 boost/test/utils/trivial_singleton.hpp: *U* unnamed namespace at line 52 *U* unnamed namespace at line 61 libs/test/build/msvc71_proj/config_file_iterator_test.vcproj: *N* 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 |thread| libs/thread/src/mutex.inl: *U* unnamed namespace at line 12 libs/thread/src/timeconv.inl: *U* unnamed namespace at line 12 libs/thread/test/util.inl: *U* unnamed namespace at line 24 |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: *U* unnamed namespace at line 13 boost/typeof/increment_registration_group.hpp: *N* filename > 31 chars libs/typeof/test/Jamfile: *T* libs/typeof/test/odr.hpp: *U* unnamed namespace at line 8 libs/typeof/test/odr_no_uns1.cpp: *T* libs/typeof/test/odr_no_uns2.cpp: *T*

1 0

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

22 Aug '06

Boost Inspection Report Run Date: 16:07:10 UTC, Tuesday 22 August 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: 11646 files scanned 901 directories scanned 3221 problems reported Problem counts: 2059 files missing Boost license info or having wrong reference text 1162 files missing copyrights Summary: any (3) archive (1) array (3) assign (6) bind (9) boost-root (8) boostbook (70) build (436) compatibility (2) compose (2) concept_check (28) conversion (5) detail (4) disjoint_sets (6) doc (58) filesystem (7) format (12) function (17) functional (8) graph (184) inspect (1) integer (9) io (2) iostreams (2) iterator (152) 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 (92) pool (32) 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) test (5) thread (117) timer (3) tokenizer (9) tools (6) tuple (9) typeof (56) unknown (1) utility (27) variant (43) wiki (2) xpressive (13) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright |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* mem_fn.html: *L* ref.html: *C* *L* libs/bind/test/ Jamfile: *L* 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* boostbook.xml: *L* documenting.xml: *C* *L* reference.xml: *L* together.xml: *C* *L* tools/boostbook/ setup_boostbook.py: *C* *L* setup_boostbook.sh: *C* *L* tools/boostbook/xsl/ admon.xsl: *C* *L* annotation.xsl: *C* *L* tools/boostbook/xsl/caramel/ concept2docbook.xsl: *L* cpp-operators.xml: *L* unparser.xsl: *L* tools/boostbook/xsl/ chunk-common.xsl: *C* *L* docbook-layout.xsl: *C* *L* docbook.xsl: *C* *L* tools/boostbook/xsl/doxygen/ collect.xsl: *C* *L* doxygen2boostbook.xsl: *C* *L* tools/boostbook/xsl/dtd/ dtd2boostbook.xsl: *C* *L* tools/boostbook/xsl/ error.xsl: *C* *L* fo.xsl: *C* *L* function.xsl: *C* *L* global.xsl: *C* *L* html-single.xsl: *C* *L* html.xsl: *L* index.xsl: *C* *L* library.xsl: *L* lookup.xsl: *C* *L* macro.xsl: *C* *L* manpages.xsl: *C* *L* navbar.xsl: *C* *L* reference.xsl: *C* *L* relative-href.xsl: *C* *L* source-highlight.xsl: *C* *L* template.xsl: *C* *L* tools/boostbook/xsl/testing/ Jamfile.xsl: *L* testsuite.xsl: *C* *L* tools/boostbook/xsl/ type.xsl: *C* *L* utility.xsl: *C* *L* xref.xsl: *C* *L* |build| tools/build/v1/ gcc-nocygwin-tools.html: *L* gcc-nocygwin-tools.jam: *L* stlport.jam: *L* sunpro-stlport-tools.jam: *L* tools/build/v1/test/ test-testing.jam: *L* tools/build/v1/ vacpp-tools.jam: *L* tools/build/v2/ boost-build.jam: *C* *L* boost.css: *C* *L* build-system.jam: *L* tools/build/v2/build/ alias.jam: *L* build-request.jam: *L* feature.jam: *L* modifiers.jam: *L* project.jam: *L* property-set.jam: *L* property.jam: *L* readme.txt: *C* *L* scanner.jam: *L* toolset.jam: *L* type.jam: *L* version.jam: *L* virtual-target.jam: *L* tools/build/v2/ changes.txt: *C* *L* tools/build/v2/doc/ Jamfile.v2: *C* *L* development_plan.html: *L* tools/build/v2/doc/src/ advanced.xml: *C* *L* architecture.xml: *C* *L* catalog.xml: *C* *L* extending.xml: *C* *L* faq.xml: *C* *L* howto.xml: *C* *L* install.xml: *C* *L* recipes.xml: *C* *L* reference.xml: *C* *L* standalone.xml: *C* *L* tutorial.xml: *C* *L* userman.xml: *C* *L* tools/build/v2/doc/ tools.html: *L* tools/build/v2/example/ boost-build.jam: *C* *L* tools/build/v2/example/customization/ Jamfile: *C* *L* inline_file.py: *L* project-root.jam: *C* *L* readme.txt: *C* *L* verbatim.jam: *L* tools/build/v2/example/gettext/ Jamfile: *C* *L* project-root.jam: *C* *L* 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* readme.txt: *C* *L* tools/build/v2/example/versioned/ jamfile.jam: *L* project-root.jam: *L* tools/build/v2/ generators_prototype.py: *L* hacking.txt: *C* *L* index.html: *L* tools/build/v2/kernel/ boost-build.jam: *L* bootstrap.jam: *L* class.jam: *L* errors.jam: *L* modules.jam: *L* tools/build/v2/ nightly.sh: *C* *L* tools/build/v2/notes/ README.txt: *C* *L* build_dir_option.txt: *C* *L* relative_source_paths.txt: *C* *L* tools/build/v2/options/ help.jam: *L* tools/build/v2/ release_procedure.txt: *C* *L* roll.sh: *C* *L* site-config.jam: *L* tools/build/v2/test/ BoostBuild.py: *C* *L* Jamfile: *C* *L* TestCmd.py: *L* abs_workdir.py: *C* *L* absolute_sources.py: *C* *L* alias.py: *C* *L* alternatives.py: *C* *L* assert-equal.jam: *C* *L* bad_dirname.py: *L* boost-build.jam: *C* *L* boostbook.py: *L* tools/build/v2/test/boostbook/ a.hpp: *C* *L* docs.xml: *L* tools/build/v2/test/ build_dir.py: *C* *L* c_file.py: *L* chain.py: *C* *L* check-arguments.jam: *L* check-bindrule.jam: *C* *L* check-jam-patches.jam: *C* *L* check-test-tools.jam: *C* *L* composite.py: *L* conditionals.py: *C* *L* conditionals2.py: *L* conditionals3.py: *L* core_d12.py: *C* *L* core_delete_module.py: *C* *L* core_dependencies.py: *C* *L* core_import_module.py: *L* core_modifiers.py: *C* *L* core_typecheck.py: *C* *L* core_varnames.py: *C* *L* custom_generator.py: *L* default_build.py: *C* *L* default_features.py: *L* tools/build/v2/test/dependency-test/ Jamfile: *C* *L* foo.jam: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/dependency-test/src1/ z.h: *C* *L* tools/build/v2/test/ dependency_property.py: *L* dependency_test.py: *C* *L* tools/build/v2/test/direct-request-test/ Jamfile: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/ direct_request_test.py: *C* *L* dll_path.py: *L* double_loading.py: *L* duplicate.py: *L* echo_args.jam: *C* *L* empty.jam: *C* *L* expansion.py: *L* explicit.py: *L* gcc_runtime.py: *L* tools/build/v2/test/generators-test/ Jamfile: *C* *L* extra.jam: *C* *L* lex.jam: *L* tools/build/v2/test/generators-test/lib/ Jamfile: *C* *L* tools/build/v2/test/generators-test/ nm.jam: *C* *L* project-root.jam: *C* *L* qt.jam: *C* *L* tools/build/v2/test/ generators_test.py: *C* *L* glob.py: *L* inherit_toolset.py: *L* inline.py: *L* library_chain.py: *L* library_order.py: *L* library_property.py: *L* loop.py: *L* m1-01.py: *C* *L* m1-02.py: *C* *L* m1-03.py: *C* *L* make_rule.py: *C* *L* tools/build/v2/test/module-actions/ boost-build.jam: *C* *L* bootstrap.jam: *C* *L* tools/build/v2/test/ module_actions.py: *C* *L* ndebug.py: *L* no_type.py: *C* *L* ordered_properties.py: *L* path_features.py: *C* *L* prebuilt.py: *C* *L* tools/build/v2/test/prebuilt/ Jamfile: *C* *L* tools/build/v2/test/prebuilt/ext/ Jamfile: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/prebuilt/ project-root.jam: *C* *L* tools/build/v2/test/ print.py: *C* *L* 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* project-root.jam: *C* *L* tools/build/v2/test/project-test1/ project-root.jam: *C* *L* project-test1.jam: *C* *L* readme.txt: *C* *L* 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* project-root.jam: *C* *L* tools/build/v2/test/project-test3/ project-root.jam: *C* *L* 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* readme.txt: *C* *L* tools/build/v2/test/ project_dependencies.py: *C* *L* project_root_constants.py: *L* project_test1.py: *C* *L* project_test3.py: *C* *L* project_test4.py: *C* *L* property_expansion.py: *L* 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* rebuilds.py: *C* *L* recursive.jam: *L* regression.py: *L* relative_sources.py: *C* *L* searched_lib.py: *C* *L* skipping.py: *L* stage.py: *C* *L* 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* 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* startup_v2.py: *C* *L* suffix.py: *L* svn_tree.py: *L* symlink.py: *C* *L* tag.py: *L* test-config-example.jam: *C* *L* test.jam: *C* *L* test1.py: *C* *L* test2.py: *C* *L* tools/build/v2/test/test2/ Jamfile: *C* *L* tools/build/v2/test/ test_all.py: *C* *L* test_nt_line_length.jam: *L* test_system.html: *L* tools/build/v2/test/testing-primitives/ boost-build.jam: *C* *L* bootstrap.jam: *C* *L* tools/build/v2/test/ testing_primitives.py: *C* *L* tree.py: *L* unit-tests.jam: *L* unit_test.py: *L* unit_tests.py: *C* *L* unused.py: *C* *L* tools/build/v2/test/unused/ Jamfile: *C* *L* b.cpp: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/ use_requirements.py: *C* *L* tools/build/v2/test/v1-testing/ Jamfile: *C* *L* boost-build.jam: *C* *L* tools/build/v2/test/ v1_testing.py: *C* *L* tools/build/v2/test/v1_testing/ Jamfile: *C* *L* boost-build.jam: *C* *L* project-root.jam: *C* *L* tools/build/v2/test/ wrapper.py: *L* tools/build/v2/tools/ bison.jam: *L* boostbook.jam: *L* borland.jam: *L* builtin.jam: *L* common.jam: *L* como-linux.jam: *L* darwin.jam: *L* doxygen.jam: *L* gettext.jam: *L* kylix.jam: *L* lex.jam: *L* make.jam: *L* qt3.jam: *L* stage.jam: *L* stlport.jam: *L* sun.jam: *L* symlink.jam: *L* testing.jam: *L* xsltproc.jam: *L* tools/build/v2/ user-config.jam: *L* tools/build/v2/util/ assert.jam: *L* container.jam: *L* doc.jam: *L* indirect.jam: *L* numbers.jam: *L* os.jam: *L* path.jam: *L* print.jam: *L* regex.jam: *L* sequence.jam: *L* set.jam: *L* string.jam: *L* utility.jam: *L* |compatibility| libs/compatibility/ generate_cpp_c_headers.py: *L* index.html: *L* |compose| libs/compose/ index.htm: *C* *L* |concept_check| libs/concept_check/ Jamfile: *C* *L* Jamfile.v2: *C* *L* bibliography.htm: *L* concept_check.htm: *L* concept_covering.htm: *L* creating_concepts.htm: *L* libs/concept_check/doc/ Jamfile.v2: *C* *L* libs/concept_check/doc/reference/ Assignable.xml: *L* BidirectionalIterator.xml: *L* CopyConstructible.xml: *L* DefaultConstructible.xml: *L* EqualityComparable.xml: *L* ForwardIterator.xml: *L* InputIterator.xml: *L* LessThanComparable.xml: *L* OutputIterator.xml: *L* RandomAccessIterator.xml: *L* SignedInteger.xml: *L* concepts.xml: *L* libs/concept_check/ implementation.htm: *L* index.html: *C* *L* prog_with_concepts.htm: *L* reference.htm: *L* using_concept_check.htm: *L* |conversion| libs/conversion/ cast.htm: *L* index.html: *C* *L* lexical_cast.htm: *L* libs/conversion/test/ Jamfile.v2: *L* |detail| boost/detail/ algorithm.hpp: *L* endian.hpp: *L* limits.hpp: *L* utf8_codecvt_facet.hpp: *L* |disjoint_sets| libs/disjoint_sets/ Jamfile: *C* *L* bibliography.html: *L* disjoint_sets.html: *L* index.html: *C* *L* |doc| doc/ Jamfile.v2: *C* *L* doc/html/ CopyConstructible.html: *C* *L* any.html: *C* *L* array.html: *C* *L* boost_math.html: *C* *L* doc/html/boost_math/ greatest_common_divisor_and_least_common_multiple.html: *C* *L* inverse_complex.html: *C* *L* doc/html/ boost_staticassert.html: *C* *L* boost_tr1.html: *C* *L* boost_typetraits.html: *C* *L* doc/html/boost_typetraits/ background.html: *C* *L* doc/html/ boostbook.html: *C* *L* date_time.html: *C* *L* foreach.html: *C* *L* function.html: *C* *L* functionN.html: *C* *L* hash.html: *C* *L* lambda.html: *C* *L* program_options.html: *C* *L* ref.html: *C* *L* reference.css: *C* *L* signals.html: *C* *L* string_algo.html: *C* *L* threads.html: *C* *L* tribool.html: *C* *L* variant.html: *C* *L* who_s_using_boost_.html: *C* *L* xpressive.html: *C* *L* doc/src/ boost.xml: *C* *L* |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* |format| libs/format/ Jamfile: *L* libs/format/benchmark/ Jamfile: *L* bench_format.cpp: *C* results.txt: *C* *L* libs/format/doc/ choices.html: *L* format.html: *C* libs/format/example/ Jamfile: *L* libs/format/ index.html: *C* *L* libs/format/test/ Jamfile: *L* Jamfile.v2: *L* |function| boost/function/detail/ gen_maybe_include.pl: *L* libs/function/doc/ Jamfile.v2: *C* *L* faq.xml: *C* *L* history.xml: *C* *L* misc.xml: *C* *L* reference.xml: *C* *L* tests.xml: *C* *L* tutorial.xml: *C* *L* libs/function/ index.html: *C* *L* |functional| boost/ functional.hpp: *L* libs/functional/ binders.html: *L* function_test.cpp: *L* function_traits.html: *L* index.html: *L* mem_fun.html: *L* negators.html: *L* ptr_fun.html: *L* |graph| libs/graph/build/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/graph/doc/ AStarHeuristic.html: *L* AStarVisitor.html: *L* AdjacencyGraph.html: *L* AdjacencyMatrix.html: *L* BFSVisitor.html: *L* BasicMatrix.html: *L* BellmanFordVisitor.html: *L* BidirectionalGraph.html: *L* Buffer.html: *L* ColorValue.html: *L* DFSVisitor.html: *L* DijkstraVisitor.html: *L* EdgeListGraph.html: *L* EdgeMutableGraph.html: *L* EventVisitor.html: *L* EventVisitorList.html: *L* Graph.html: *L* IncidenceGraph.html: *L* IteratorConstructibleGraph.html: *L* Makefile: *C* *L* Monoid.html: *L* MutableGraph.html: *L* MutablePropertyGraph.html: *L* PropertyGraph.html: *L* PropertyTag.html: *L* VertexAndEdgeListGraph.html: *L* VertexListGraph.html: *L* VertexMutableGraph.html: *L* acknowledgements.html: *L* adjacency_iterator.html: *L* adjacency_list.html: *L* adjacency_list_traits.html: *L* adjacency_matrix.html: *L* astar_heuristic.html: *L* astar_search.html: *L* astar_visitor.html: *L* bandwidth.html: *L* bc_clustering.html: *L* bellman_ford_shortest.html: *L* bellman_visitor.html: *L* betweenness_centrality.html: *L* bfs_visitor.html: *L* bgl_named_params.html: *L* bibliography.html: *L* biconnected_components.html: *L* breadth_first_search.html: *L* breadth_first_visit.html: *L* challenge.html: *L* circle_layout.html: *L* compressed_sparse_row.html: *L* connected_components.html: *L* constructing_algorithms.html: *L* copy_graph.html: *L* cuthill_mckee_ordering.html: *L* dag_shortest_paths.html: *L* default.css: *L* depth_first_search.html: *L* depth_first_visit.html: *L* dfs_visitor.html: *L* dijkstra_shortest_paths.html: *L* dijkstra_visitor.html: *L* distance_recorder.html: *L* edge_list.html: *L* edmunds_karp_max_flow.html: *L* erdos_renyi_generator.html: *L* exception.html: *L* faq.html: *L* libs/graph/doc/figs/ Makefile: *C* *L* libs/graph/doc/ file_dependency_example.html: *L* filtered_graph.html: *L* floyd_warshall_shortest.html: *L* fruchterman_reingold.html: *L* graph_coloring.html: *L* graph_concepts.html: *L* graph_theory_review.html: *L* graph_traits.html: *L* gursoy_atun_layout.html: *L* history.html: *L* incident.html: *L* incremental_components.html: *L* index.html: *L* inv_adjacency_iterator.html: *L* isomorphism.html: *L* johnson_all_pairs_shortest.html: *L* jwebfrob.pl: *C* *L* kamada_kawai_spring_layout.html: *L* kevin_bacon.html: *L* king_ordering.html: *L* known_problems.html: *L* kruskal_min_spanning_tree.html: *L* layout_tolerance.html: *C* *L* leda_conversion.html: *L* lengauer_tarjan_dominator_tree.htm: *L* maximum_matching.html: *L* minimum_degree_ordering.html: *L* null_visitor.html: *L* opposite.html: *L* plod_generator.html: *L* predecessor_recorder.html: *L* prim_minimum_spanning_tree.html: *L* profile.htm: *L* property.html: *L* property_map.html: *L* property_writer.html: *L* publications.html: *L* push_relabel_max_flow.html: *L* python.html: *L* quick_tour.html: *L* random.html: *L* random_layout.html: *L* read_graphviz.html: *C* *L* read_graphviz.rst: *C* *L* reverse_graph.html: *L* sequential_vertex_coloring.html: *L* sloan_ordering.htm: *L* sloan_start_end_vertices.htm: *L* small_world_generator.html: *L* sorted_erdos_renyi_generator.html: *L* sparse_matrix_ordering.html: *L* stanford_graph.html: *L* strong_components.html: *L* subgraph.html: *L* table_of_contents.html: *L* time_stamper.html: *L* topological_sort.html: *L* transitive_closure.html: *L* transpose_graph.html: *L* trouble_shooting.html: *L* undirected_dfs.html: *L* users.html: *C* *L* using_adjacency_list.html: *L* using_property_maps.html: *L* visitor_concepts.html: *L* wavefront.htm: *L* write-graphviz.html: *L* libs/graph/example/ Jamfile: *C* *L* cuthill_mckee_ordering.cpp: *L* data1.txt: *C* *L* data2.txt: *C* *L* data3.txt: *C* *L* king_ordering.cpp: *L* property_iterator.cpp: *L* libs/graph/example/python/ breadth_first_search.py: *C* *L* vis.py: *C* *L* libs/graph/example/ regrtest.py: *C* *L* sloan_ordering.cpp: *L* libs/graph/ index.html: *C* *L* libs/graph/src/ Makefile: *C* *L* README: *C* *L* graphviz_digraph_lex.cpp: *L* graphviz_digraph_parser.hpp: *C* *L* graphviz_graph_lex.cpp: *L* graphviz_graph_parser.hpp: *C* *L* libs/graph/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* cuthill_mckee_ordering.cpp: *L* dag_longest_paths.cpp: *C* *L* 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* static_min_max.html: *L* libs/integer/ index.html: *C* *L* integer.htm: *L* 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* BidirectionalTraversal.rst: *C* *L* ForwardTraversal.html: *C* *L* ForwardTraversal.rst: *C* *L* IncrementableIterator.html: *C* *L* IncrementableIterator.rst: *C* *L* InteroperableIterator.rst: *C* *L* LvalueIterator.html: *C* *L* LvalueIterator.rst: *C* *L* RandomAccessTraversal.html: *C* *L* RandomAccessTraversal.rst: *C* *L* ReadableIterator.html: *C* *L* ReadableIterator.rst: *C* *L* SinglePassIterator.html: *C* *L* SinglePassIterator.rst: *C* *L* SwappableIterator.html: *C* *L* SwappableIterator.rst: *C* *L* WritableIterator.html: *C* *L* WritableIterator.rst: *C* *L* counting_iterator.html: *L* counting_iterator.rst: *L* counting_iterator_abstract.rst: *C* *L* counting_iterator_eg.rst: *C* *L* counting_iterator_ref.rst: *C* *L* default.css: *L* facade-and-adaptor.rst: *L* filter_iterator.html: *L* filter_iterator.rst: *L* filter_iterator_abstract.rst: *C* *L* filter_iterator_eg.rst: *C* *L* filter_iterator_ref.html: *L* filter_iterator_ref.rst: *L* func_output_iter_abstract.rst: *C* *L* func_output_iter_ref.rst: *C* *L* function_output_iterator.html: *L* function_output_iterator.rst: *L* function_output_iterator_eg.rst: *C* *L* index.html: *L* index.rst: *L* indirect_iterator.html: *L* indirect_iterator.rst: *L* indirect_iterator_abstract.rst: *C* *L* indirect_iterator_eg.rst: *C* *L* indirect_iterator_ref.html: *C* *L* indirect_iterator_ref.rst: *C* *L* interoperability-revisited.rst: *L* iter-issue-list.rst: *C* *L* iterator_adaptor.rst: *L* iterator_adaptor_abstract.rst: *L* iterator_adaptor_body.rst: *L* iterator_adaptor_ref.html: *L* iterator_adaptor_ref.rst: *L* iterator_archetypes.html: *L* iterator_archetypes.rst: *L* iterator_concepts.html: *L* iterator_concepts.rst: *L* iterator_facade.rst: *L* iterator_facade_abstract.rst: *C* *L* iterator_facade_body.rst: *L* iterator_facade_ref.rst: *L* iterator_traits.html: *L* iterator_traits.rst: *L* make_counting_iterator.rst: *C* *L* make_filter_iterator.html: *C* *L* make_filter_iterator.rst: *C* *L* make_reverse_iterator.rst: *C* *L* make_transform_iterator.rst: *C* *L* make_zip_iterator.rst: *C* *L* new-iter-concepts.html: *L* new-iter-concepts.rst: *L* permutation_iter_abstract.rst: *C* *L* permutation_iterator.html: *L* permutation_iterator.rst: *L* permutation_iterator_body.rst: *C* *L* permutation_iterator_eg.rst: *C* *L* permutation_iterator_ref.rst: *C* *L* pointee.rst: *L* reverse_iterator.html: *L* reverse_iterator.rst: *L* reverse_iterator_abstract.rst: *C* *L* reverse_iterator_eg.rst: *C* *L* reverse_iterator_ref.rst: *C* *L* transform_iterator.html: *L* transform_iterator.rst: *L* transform_iterator_abstract.rst: *C* *L* transform_iterator_eg.rst: *C* *L* transform_iterator_ref.rst: *C* *L* zip_iterator.html: *L* zip_iterator.rst: *L* zip_iterator_abstract.rst: *C* *L* zip_iterator_eg.rst: *C* *L* zip_iterator_ref.rst: *C* *L* libs/iterator/example/ Jamfile: *C* *L* libs/iterator/ index.html: *C* *L* libs/iterator/test/ Jamfile: *L* Jamfile.v2: *L* zip_iterator_test.cpp: *L* |lambda| libs/lambda/doc/ Jamfile.v2: *C* *L* libs/lambda/doc/detail/ README: *C* *L* lambda_doc.xsl: *C* *L* lambda_doc_chunks.xsl: *C* *L* libs/lambda/doc/ index.html: *C* *L* libs/lambda/ index.html: *C* *L* libs/lambda/test/ Makefile: *C* *L* |libs| libs/ expected_results.xml: *C* *L* index.html: *C* *L* maintainers.txt: *C* *L* platform_maintainers.txt: *C* *L* |logic| libs/logic/doc/ Jamfile.v2: *C* *L* |math| boost/math/ common_factor_rt.hpp: *L* |mem_fn| libs/mem_fn/ index.html: *C* *L* |more| more/ blanket-permission.txt: *C* borland_cpp.html: *C* *L* count_bdy.htm: *L* discussion_policy.htm: *C* error_handling.html: *L* generic_exception_safety.html: *C* *L* generic_programming.html: *L* microsoft_vcpp.html: *C* *L* moderators.html: *C* regression.html: *C* *L* report-jan-2006.html: *C* *L* more/writingdoc/ design.html: *L* index.html: *L* introduction.html: *L* structure.html: *L* more/writingdoc/template/ acknowledgments.html: *L* bibliography.html: *L* configuration.html: *L* definitions.html: *L* faq.html: *L* header.html: *L* index.html: *L* overview.html: *L* rationale.html: *L* |mpl| libs/mpl/doc/refmanual/ accumulate.html: *C* *L* acknowledgements.html: *C* *L* advance.html: *C* *L* algorithms-concepts.html: *C* *L* algorithms.html: *C* *L* always.html: *C* *L* and.html: *C* *L* apply-wrap.html: *C* *L* apply.html: *C* *L* arg.html: *C* *L* arithmetic-operations.html: *C* *L* assert-msg.html: *C* *L* assert-not.html: *C* *L* assert-relation.html: *C* *L* assert.html: *C* *L* asserts.html: *C* *L* associative-sequence.html: *C* *L* at-c.html: *C* *L* at.html: *C* *L* aux-lambda-support.html: *C* *L* back-extensible-sequence.html: *C* *L* back-inserter.html: *C* *L* back.html: *C* *L* begin.html: *C* *L* bidirectional-iterator.html: *C* *L* bidirectional-sequence.html: *C* *L* bind.html: *C* *L* bitand.html: *C* *L* bitor.html: *C* *L* bitwise-operations.html: *C* *L* bitxor.html: *C* *L* bool.html: *C* *L* broken-compiler.html: *C* *L* categorized-concepts.html: *C* *L* categorized-index.html: *C* *L* cfg-no-has-xxx.html: *C* *L* cfg-no-preprocessed.html: *C* *L* classes.html: *C* *L* clear.html: *C* *L* comparisons.html: *C* *L* components.html: *C* *L* composition-and-argument.html: *C* *L* concepts.html: *C* *L* configuration.html: *C* *L* contains.html: *C* *L* copy-if.html: *C* *L* copy.html: *C* *L* count-if.html: *C* *L* count.html: *C* *L* data-concepts.html: *C* *L* data-miscellaneous.html: *C* *L* data-types.html: *C* *L* deque.html: *C* *L* deref.html: *C* *L* distance.html: *C* *L* divides.html: *C* *L* empty-base.html: *C* *L* empty-sequence.html: *C* *L* empty.html: *C* *L* end.html: *C* *L* equal-to.html: *C* *L* equal.html: *C* *L* erase-key.html: *C* *L* erase.html: *C* *L* eval-if-c.html: *C* *L* eval-if.html: *C* *L* extensible-associative.html: *C* *L* extensible-sequence.html: *C* *L* filter-view.html: *C* *L* find-if.html: *C* *L* find.html: *C* *L* fold.html: *C* *L* forward-iterator.html: *C* *L* forward-sequence.html: *C* *L* front-extensible-sequence.html: *C* *L* front-inserter.html: *C* *L* front.html: *C* *L* greater-equal.html: *C* *L* greater.html: *C* *L* has-key.html: *C* *L* has-xxx-trait-def.html: *C* *L* has-xxx-trait-named-def.html: *C* *L* identity.html: *C* *L* if-c.html: *C* *L* if.html: *C* *L* inherit-linearly.html: *C* *L* inherit.html: *C* *L* insert-range.html: *C* *L* insert.html: *C* *L* inserter.html: *C* *L* inserters-inserter.html: *C* *L* inserters.html: *C* *L* int.html: *C* *L* integral-c.html: *C* *L* integral-constant.html: *C* *L* integral-sequence-wrapper.html: *C* *L* intrinsic-metafunctions.html: *C* *L* introspection.html: *C* *L* invocation.html: *C* *L* is-sequence.html: *C* *L* iter-fold.html: *C* *L* iteration-algorithms.html: *C* *L* iterator-category.html: *C* *L* iterator-metafunctions.html: *C* *L* iterator-range.html: *C* *L* iterators-concepts.html: *C* *L* iterators.html: *C* *L* joint-view.html: *C* *L* key-type.html: *C* *L* lambda-expression.html: *C* *L* lambda.html: *C* *L* less-equal.html: *C* *L* less.html: *C* *L* limit-list-size.html: *C* *L* limit-map-size.html: *C* *L* limit-metafunction-arity.html: *C* *L* limit-set-size.html: *C* *L* limit-unrolling.html: *C* *L* limit-vector-size.html: *C* *L* list-c.html: *C* *L* list.html: *C* *L* logical-operations.html: *C* *L* long.html: *C* *L* lower-bound.html: *C* *L* macros.html: *C* *L* map.html: *C* *L* max-element.html: *C* *L* max.html: *C* *L* metafunction-class.html: *C* *L* metafunction.html: *C* *L* metafunctions-concepts.html: *C* *L* metafunctions.html: *C* *L* min-element.html: *C* *L* min.html: *C* *L* minus.html: *C* *L* miscellaneous.html: *C* *L* modulus.html: *C* *L* negate.html: *C* *L* next.html: *C* *L* not-equal-to.html: *C* *L* not.html: *C* *L* numeric-cast.html: *C* *L* numeric-metafunction.html: *C* *L* numeric.html: *C* *L* or.html: *C* *L* order.html: *C* *L* pair.html: *C* *L* partition.html: *C* *L* placeholder-expression.html: *C* *L* placeholders.html: *C* *L* plus.html: *C* *L* pop-back.html: *C* *L* pop-front.html: *C* *L* prior.html: *C* *L* protect.html: *C* *L* push-back.html: *C* *L* push-front.html: *C* *L* querying-algorithms.html: *C* *L* quote.html: *C* *L* random-access-iterator.html: *C* *L* random-access-sequence.html: *C* *L* range-c.html: *C* *L* refmanual_toc.html: *C* *L* remove-if.html: *C* *L* remove.html: *C* *L* replace-if.html: *C* *L* replace.html: *C* *L* reverse-copy-if.html: *C* *L* reverse-copy.html: *C* *L* reverse-fold.html: *C* *L* reverse-iter-fold.html: *C* *L* reverse-partition.html: *C* *L* reverse-remove-if.html: *C* *L* reverse-remove.html: *C* *L* reverse-replace-if.html: *C* *L* reverse-replace.html: *C* *L* reverse-stable-partition.html: *C* *L* reverse-transform.html: *C* *L* reverse-unique.html: *C* *L* reverse.html: *C* *L* reversible-algorithm.html: *C* *L* sequence-tag.html: *C* *L* sequences.html: *C* *L* set-c.html: *C* *L* set.html: *C* *L* shift-left.html: *C* *L* shift-right.html: *C* *L* single-view.html: *C* *L* size-t.html: *C* *L* size.html: *C* *L* sizeof.html: *C* *L* sort.html: *C* *L* stable-partition.html: *C* *L* tag-dispatched.html: *C* *L* terminology.html: *C* *L* times.html: *C* *L* transform-view.html: *C* *L* transform.html: *C* *L* transformation-algorithms.html: *C* *L* trivial-metafunction.html: *C* *L* trivial-metafunctions.html: *C* *L* trivial.html: *C* *L* type-selection.html: *C* *L* unique.html: *C* *L* unpack-args.html: *C* *L* upper-bound.html: *C* *L* value-type.html: *C* *L* variadic-sequence.html: *C* *L* vector-c.html: *C* *L* vector.html: *C* *L* views.html: *C* *L* void.html: *C* *L* zip-view.html: *C* *L* libs/mpl/doc/src/refmanual/ ASSERT.rst: *C* *L* ASSERT_MSG.rst: *C* *L* ASSERT_NOT.rst: *C* *L* ASSERT_RELATION.rst: *C* *L* AUX_LAMBDA_SUPPORT.rst: *C* *L* Acknowledgements.rst: *C* *L* Algorithms-Iteration.rst: *C* *L* Algorithms-Querying.rst: *C* *L* Algorithms-Transformation.rst: *C* *L* Algorithms.rst: *C* *L* AssociativeSequence.rst: *C* *L* BackExtensibleSequence.rst: *C* *L* BidirectionalIterator.rst: *C* *L* BidirectionalSequence.rst: *C* *L* CFG_NO_HAS_XXX.rst: *C* *L* CFG_NO_PREPROCESSED.rst: *C* *L* Categorized.rst: *C* *L* Data.rst: *C* *L* ExtensibleAssociativeSeq.rst: *C* *L* ExtensibleSequence.rst: *C* *L* ForwardIterator.rst: *C* *L* ForwardSequence.rst: *C* *L* FrontExtensibleSequence.rst: *C* *L* HAS_XXX_TRAIT_DEF.rst: *C* *L* HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L* Inserter.rst: *C* *L* IntegralConstant.rst: *C* *L* IntegralSequenceWrapper.rst: *C* *L* Iterators-Concepts.rst: *C* *L* Iterators-Metafunctions.rst: *C* *L* Iterators.rst: *C* *L* LIMIT_LIST_SIZE.rst: *C* *L* LIMIT_MAP_SIZE.rst: *C* *L* LIMIT_METAFUNCTION_ARITY.rst: *C* *L* LIMIT_SET_SIZE.rst: *C* *L* LIMIT_UNROLLING.rst: *C* *L* LIMIT_VECTOR_SIZE.rst: *C* *L* LambdaExpression.rst: *C* *L* Macros-Asserts.rst: *C* *L* Macros-Configuration.rst: *C* *L* Macros.rst: *C* *L* Metafunction.rst: *C* *L* MetafunctionClass.rst: *C* *L* Metafunctions-Arithmetic.rst: *C* *L* Metafunctions-Bitwise.rst: *C* *L* Metafunctions-Comparisons.rst: *C* *L* Metafunctions-Composition.rst: *C* *L* Metafunctions-Conditional.rst: *C* *L* Metafunctions-Invocation.rst: *C* *L* Metafunctions-Logical.rst: *C* *L* Metafunctions-Trivial.rst: *C* *L* Metafunctions-Type.rst: *C* *L* Metafunctions.rst: *C* *L* NumericMetafunction.rst: *C* *L* PlaceholderExpression.rst: *C* *L* Placeholders.rst: *C* *L* RandomAccessIterator.rst: *C* *L* RandomAccessSequence.rst: *C* *L* ReversibleAlgorithm.rst: *C* *L* Sequences-Classes.rst: *C* *L* Sequences-Concepts.rst: *C* *L* Sequences-Intrinsic.rst: *C* *L* Sequences-Views.rst: *C* *L* Sequences.rst: *C* *L* TagDispatchedMetafunction.rst: *C* *L* TrivialMetafunction.rst: *C* *L* VariadicSequence.rst: *C* *L* accumulate.rst: *C* *L* advance.rst: *C* *L* always.rst: *C* *L* and_.rst: *C* *L* apply.rst: *C* *L* apply_wrap.rst: *C* *L* arg.rst: *C* *L* at.rst: *C* *L* at_c.rst: *C* *L* back.rst: *C* *L* back_inserter.rst: *C* *L* begin.rst: *C* *L* bind.rst: *C* *L* bitand_.rst: *C* *L* bitor_.rst: *C* *L* bitxor_.rst: *C* *L* bool_.rst: *C* *L* clear.rst: *C* *L* contains.rst: *C* *L* copy.rst: *C* *L* copy_if.rst: *C* *L* count.rst: *C* *L* count_if.rst: *C* *L* deque.rst: *C* *L* deref.rst: *C* *L* distance.rst: *C* *L* divides.rst: *C* *L* empty.rst: *C* *L* empty_base.rst: *C* *L* empty_sequence.rst: *C* *L* end.rst: *C* *L* equal.rst: *C* *L* equal_to.rst: *C* *L* erase.rst: *C* *L* erase_key.rst: *C* *L* eval_if.rst: *C* *L* eval_if_c.rst: *C* *L* filter_view.rst: *C* *L* find.rst: *C* *L* find_if.rst: *C* *L* fold.rst: *C* *L* front.rst: *C* *L* front_inserter.rst: *C* *L* greater.rst: *C* *L* greater_equal.rst: *C* *L* has_key.rst: *C* *L* identity.rst: *C* *L* if_.rst: *C* *L* if_c.rst: *C* *L* inherit.rst: *C* *L* inherit_linearly.rst: *C* *L* insert.rst: *C* *L* insert_range.rst: *C* *L* inserter_.rst: *C* *L* int_.rst: *C* *L* integral_c.rst: *C* *L* is_sequence.rst: *C* *L* iter_fold.rst: *C* *L* iter_fold_if.rst: *C* *L* iterator_category.rst: *C* *L* iterator_range.rst: *C* *L* joint_view.rst: *C* *L* key_type.rst: *C* *L* lambda.rst: *C* *L* less.rst: *C* *L* less_equal.rst: *C* *L* list.rst: *C* *L* list_c.rst: *C* *L* long_.rst: *C* *L* lower_bound.rst: *C* *L* map.rst: *C* *L* max.rst: *C* *L* max_element.rst: *C* *L* min.rst: *C* *L* min_element.rst: *C* *L* minus.rst: *C* *L* modulus.rst: *C* *L* multiplies.rst: *C* *L* negate.rst: *C* *L* next.rst: *C* *L* not_.rst: *C* *L* not_equal_to.rst: *C* *L* numeric_cast.rst: *C* *L* or_.rst: *C* *L* order.rst: *C* *L* pair.rst: *C* *L* partition.rst: *C* *L* plus.rst: *C* *L* pop_back.rst: *C* *L* pop_front.rst: *C* *L* preface.rst: *C* *L* prior.rst: *C* *L* protect.rst: *C* *L* push_back.rst: *C* *L* push_front.rst: *C* *L* quote.rst: *C* *L* range_c.rst: *C* *L* refmanual.py: *C* *L* remove.rst: *C* *L* remove_if.rst: *C* *L* replace.rst: *C* *L* replace_if.rst: *C* *L* reverse.rst: *C* *L* reverse_copy.rst: *C* *L* reverse_copy_if.rst: *C* *L* reverse_fold.rst: *C* *L* reverse_iter_fold.rst: *C* *L* reverse_partition.rst: *C* *L* reverse_remove.rst: *C* *L* reverse_remove_if.rst: *C* *L* reverse_replace.rst: *C* *L* reverse_replace_if.rst: *C* *L* reverse_stable_partition.rst: *C* *L* reverse_transform.rst: *C* *L* reverse_unique.rst: *C* *L* sequence_tag.rst: *C* *L* set.rst: *C* *L* set_c.rst: *C* *L* shift_left.rst: *C* *L* shift_right.rst: *C* *L* single_view.rst: *C* *L* size.rst: *C* *L* size_t.rst: *C* *L* sizeof_.rst: *C* *L* sort.rst: *C* *L* stable_partition.rst: *C* *L* terminology.rst: *C* *L* times.rst: *C* *L* transform.rst: *C* *L* transform_view.rst: *C* *L* unique.rst: *C* *L* unpack_args.rst: *C* *L* upper_bound.rst: *C* *L* value_type.rst: *C* *L* vector.rst: *C* *L* vector_c.rst: *C* *L* void_.rst: *C* *L* zip_view.rst: *C* *L* libs/mpl/doc/ style.css: *L* libs/mpl/doc/tutorial/ acknowledgements.html: *C* *L* apply-lambda-semantics.html: *C* *L* broken-integral-constant.html: *C* *L* changelog-history.html: *C* *L* changes-in-boost-1-32-0.html: *C* *L* dependencies.html: *C* *L* details.html: *C* *L* dimensional-analysis.html: *C* *L* eti.html: *C* *L* exercises.html: *C* *L* handling-placeholders.html: *C* *L* higher-order.html: *C* *L* implementing-addition-and.html: *C* *L* implementing-division.html: *C* *L* implementing.html: *C* *L* incomplete-support-for.html: *C* *L* iterator-protocol.html: *C* *L* lambda-and-non.html: *C* *L* lambda-details.html: *C* *L* metafunction-composition.html: *C* *L* miscellaneous.html: *C* *L* more-lambda-capabilities.html: *C* *L* numeric-metafunction.html: *C* *L* partial-metafunction.html: *C* *L* physical-structure.html: *C* *L* placeholder-expression.html: *C* *L* placeholders.html: *C* *L* portability.html: *C* *L* reference-manual.html: *C* *L* renaming-cleanup.html: *C* *L* representing-dimensions.html: *C* *L* representing-quantities.html: *C* *L* resources.html: *C* *L* tag-dispatching-protocol.html: *C* *L* technical-details.html: *C* *L* the-apply-metafunction.html: *C* *L* the-importance-of-being.html: *C* *L* the-lambda-metafunction.html: *C* *L* tutorial-metafunctions.html: *L* tutorial_toc.html: *C* *L* libs/mpl/example/ Jamfile: *C* *L* libs/mpl/ index.html: *C* *L* libs/mpl/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/mpl/test/aux_/ Jamfile: *C* *L* |multi_array| libs/multi_array/doc/ index.html: *L* iterator_categories.html: *C* *L* notes.html: *L* reference.html: *L* test_cases.html: *L* user.html: *L* libs/multi_array/doc/xml/ MultiArray.xml: *C* *L* const_multi_array_ref.xml: *C* *L* multi_array.xml: *C* *L* multi_array_ref.xml: *C* *L* reference.xml: *L* libs/multi_array/ index.html: *C* *L* libs/multi_array/test/ Jamfile: *L* Jamfile.v2: *L* |numeric| boost/numeric/ublas/ banded.hpp: *L* blas.hpp: *L* boost/numeric/ublas/detail/ concepts.hpp: *L* config.hpp: *L* definitions.hpp: *L* documentation.hpp: *L* duff.hpp: *L* iterator.hpp: *L* matrix_assign.hpp: *L* raw.hpp: *L* returntype_deduction.hpp: *L* temporary.hpp: *L* vector_assign.hpp: *L* boost/numeric/ublas/ exception.hpp: *L* expression_types.hpp: *L* functional.hpp: *L* fwd.hpp: *L* hermitian.hpp: *L* io.hpp: *L* lu.hpp: *L* matrix.hpp: *L* matrix_expression.hpp: *L* matrix_proxy.hpp: *L* matrix_sparse.hpp: *L* operation.hpp: *L* operation_blocked.hpp: *L* operation_sparse.hpp: *L* storage.hpp: *L* storage_sparse.hpp: *L* symmetric.hpp: *L* traits.hpp: *L* triangular.hpp: *L* vector.hpp: *L* vector_expression.hpp: *L* vector_of_vector.hpp: *L* vector_proxy.hpp: *L* vector_sparse.hpp: *L* libs/numeric/conversion/ index.html: *C* *L* libs/numeric/conversion/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* test_helpers.cpp: *C* test_helpers2.cpp: *C* test_helpers3.cpp: *C* traits_test.cpp: *C* udt_example_0.cpp: *C* udt_support_test.cpp: *C* libs/numeric/ index.html: *C* *L* libs/numeric/interval/doc/ checking.htm: *L* comparisons.htm: *L* examples.htm: *L* guide.htm: *L* includes.htm: *L* index.html: *C* *L* interval.htm: *L* numbers.htm: *L* policies.htm: *L* rounding.htm: *L* todo.htm: *L* libs/numeric/ublas/bench1/ Jamfile: *L* bench1.cpp: *L* bench1.hpp: *L* bench11.cpp: *L* bench12.cpp: *L* bench13.cpp: *L* libs/numeric/ublas/bench2/ Jamfile: *L* bench2.cpp: *L* bench2.hpp: *L* bench21.cpp: *L* bench22.cpp: *L* bench23.cpp: *L* libs/numeric/ublas/bench3/ Jamfile: *L* bench3.cpp: *L* bench3.hpp: *L* bench31.cpp: *L* bench32.cpp: *L* bench33.cpp: *L* libs/numeric/ublas/bench4/ Jamfile: *L* bench4.cpp: *L* bench41.cpp: *L* bench42.cpp: *L* bench43.cpp: *L* libs/numeric/ublas/doc/ Release_notes.txt: *C* *L* array_adaptor.htm: *C* *L* banded.htm: *L* blas.htm: *L* bounded_array.htm: *C* *L* container_concept.htm: *L* doxygen.css: *C* *L* expression_concept.htm: *L* hermitian.htm: *L* index.htm: *L* iterator_concept.htm: *L* matrix.htm: *L* matrix_expression.htm: *L* matrix_proxy.htm: *L* matrix_sparse.htm: *L* operations_overview.htm: *L* overview.htm: *L* products.htm: *L* range.htm: *C* *L* libs/numeric/ublas/doc/samples/ Jamfile: *L* banded_adaptor.cpp: *L* banded_matrix.cpp: *L* bounded_array.cpp: *L* compressed_matrix.cpp: *L* compressed_vector.cpp: *L* coordinate_matrix.cpp: *L* coordinate_vector.cpp: *L* hermitian_adaptor.cpp: *L* hermitian_matrix.cpp: *L* identity_matrix.cpp: *L* map_array.cpp: *L* mapped_matrix.cpp: *L* mapped_vector.cpp: *L* matrix.cpp: *L* matrix_binary.cpp: *L* matrix_binary_scalar.cpp: *L* matrix_column.cpp: *L* matrix_column_project.cpp: *L* matrix_matrix_binary.cpp: *L* matrix_matrix_solve.cpp: *L* matrix_range.cpp: *L* matrix_range_project.cpp: *L* matrix_row.cpp: *L* matrix_row_project.cpp: *L* matrix_slice.cpp: *L* matrix_slice_project.cpp: *L* matrix_unary.cpp: *L* matrix_vector_binary.cpp: *L* matrix_vector_range.cpp: *L* matrix_vector_slice.cpp: *L* matrix_vector_solve.cpp: *L* range.cpp: *L* slice.cpp: *L* symmetric_adaptor.cpp: *L* symmetric_matrix.cpp: *L* triangular_adaptor.cpp: *L* triangular_matrix.cpp: *L* unbounded_array.cpp: *L* unit_vector.cpp: *L* vector.cpp: *L* vector_binary.cpp: *L* vector_binary_outer.cpp: *L* vector_binary_redux.cpp: *L* vector_binary_scalar.cpp: *L* vector_range.cpp: *L* vector_range_project.cpp: *L* vector_slice.cpp: *L* vector_slice_project.cpp: *L* vector_unary.cpp: *L* vector_unary_redux.cpp: *L* zero_matrix.cpp: *L* zero_vector.cpp: *L* libs/numeric/ublas/doc/ storage_concept.htm: *C* *L* storage_sparse.htm: *L* symmetric.htm: *L* triangular.htm: *L* types_overview.htm: *L* ublas.css: *C* *L* unbounded_array.htm: *C* *L* vector.htm: *L* vector_expression.htm: *L* vector_proxy.htm: *L* vector_sparse.htm: *L* libs/numeric/ublas/ index.html: *C* *L* libs/numeric/ublas/test/ Jamfile: *L* README: *C* *L* concepts.cpp: *L* test1.cpp: *L* test1.hpp: *L* test11.cpp: *L* test12.cpp: *L* test13.cpp: *L* test2.cpp: *L* test2.hpp: *L* test21.cpp: *L* test22.cpp: *L* test23.cpp: *L* test3.cpp: *L* test3.hpp: *L* test31.cpp: *L* test32.cpp: *L* test33.cpp: *L* test4.cpp: *L* test4.hpp: *L* test42.cpp: *L* test43.cpp: *L* test5.cpp: *L* test5.hpp: *L* test52.cpp: *L* test53.cpp: *L* test6.cpp: *L* test6.hpp: *L* test62.cpp: *L* test63.cpp: *L* test7.cpp: *L* test7.hpp: *L* test71.cpp: *L* test72.cpp: *L* test73.cpp: *L* |optional| libs/optional/ 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* Jamfile.v2: *C* *L* python.py: *C* *L* |people| people/ aleksey_gurtovoy.htm: *C* *L* andreas_huber.html: *C* *L* beman_dawes.html: *C* *L* darin_adler.htm: *C* *L* daryle_walker.html: *C* *L* dave_abrahams.htm: *C* *L* dietmar_kuehl.htm: *C* *L* doug_gregor.html: *C* *L* ed_brey.htm: *C* *L* eric_friedman.htm: *C* *L* fernando_cacciola.html: *C* *L* gary_powell.htm: *C* *L* gennadiy_rozental.htm: *C* *L* greg_colvin.htm: *C* *L* hartmut_kaiser.htm: *C* *L* herve_bronnimann.htm: *C* *L* howard_hinnant.htm: *C* *L* hubert_holin.html: *C* *L* jaakko_jarvi.htm: *C* *L* jeff_garland.html: *C* *L* jens_maurer.htm: *C* *L* jeremy_siek.htm: *C* *L* joaquin_lopez.htm: *C* *L* joel_de_guzman.htm: *C* *L* john_maddock.htm: *C* *L* jonathan_turkanis.htm: *C* *L* kevlin_henney.htm: *C* *L* liequan_lee.htm: *C* *L* mac_murrett.htm: *C* *L* mark_rodgers.htm: *C* *L* mat_marcus.htm: *C* *L* paul_mensonides.htm: *C* *L* paul_moore.htm: *C* *L* pavol_droba.htm: *C* *L* people.htm: *C* *L* peter_dimov.htm: *C* *L* ralf_w_grosse_kunstleve.htm: *C* *L* rene_rivera.htm: *C* *L* robert_ramey.htm: *C* *L* ronald_garcia.htm: *C* *L* samuel_krempp.htm: *C* *L* thomas_witt.html: *C* *L* thorsten_ottosen.html: *C* *L* vesa_karvonen.htm: *C* *L* vladimir_prus.htm: *C* *L* william_kempf.htm: *C* *L* |pool| boost/pool/detail/ pool_construct.bat: *L* pool_construct.sh: *L* pool_construct_simple.bat: *L* pool_construct_simple.sh: *L* libs/pool/ TODO.txt: *C* *L* libs/pool/doc/ concepts.html: *L* copyright.html: *L* libs/pool/doc/implementation/ alignment.html: *L* ct_gcd_lcm.html: *L* for.html: *L* gcd_lcm.html: *L* guard.html: *L* mutex.html: *L* object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* pool_construct.html: *L* simple_segregated_storage.html: *L* singleton.html: *L* singleton_pool.html: *L* libs/pool/doc/ index.html: *L* interfaces.html: *L* libs/pool/doc/interfaces/ object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* simple_segregated_storage.html: *L* singleton_pool.html: *L* user_allocator.html: *L* libs/pool/doc/ pool.css: *L* libs/pool/ index.html: *C* *L* |program_options| boost/program_options/detail/ utf8_codecvt_facet.hpp: *L* libs/program_options/build/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/program_options/doc/ Jamfile.v2: *C* *L* acknowledgements.xml: *C* *L* changes.xml: *C* *L* design.xml: *C* *L* glossary.xml: *C* *L* howto.xml: *C* *L* index.html: *C* *L* overview.xml: *C* *L* post_review_plan.txt: *C* *L* todo.txt: *C* *L* tutorial.xml: *C* *L* libs/program_options/example/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/program_options/ index.html: *C* *L* libs/program_options/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* program_options_size_test.py: *C* *L* ucs2.txt: *C* *L* utf8.txt: *C* *L* winmain.py: *C* *L* |property_map| libs/property_map/ LvaluePropertyMap.html: *L* ReadWritePropertyMap.html: *L* ReadablePropertyMap.html: *L* WritablePropertyMap.html: *L* associative_property_map.html: *L* const_assoc_property_map.html: *L* libs/property_map/doc/ dynamic_property_map.html: *C* *L* dynamic_property_map.rst: *C* *L* libs/property_map/ example2.cpp: *L* identity_property_map.html: *L* index.html: *C* *L* iterator_property_map.html: *L* property_map.html: *L* vector_property_map.html: *L* |ptr_container| libs/ptr_container/doc/ Jamfile.v2: *C* *L* associative_ptr_container.html: *L* associative_ptr_container.rst: *L* comp.sh: *C* *L* comp_all.sh: *C* *L* comp_assoc_ptr_container.sh: *C* *L* comp_conventions.sh: *C* *L* comp_examples.sh: *C* *L* comp_faq.sh: *C* *L* comp_guidelines.sh: *C* *L* comp_headers.sh: *C* *L* comp_indirect_fun.sh: *C* *L* comp_ptr_array.sh: *C* *L* comp_ptr_container.sh: *C* *L* comp_ptr_deque.sh: *C* *L* comp_ptr_list.sh: *C* *L* comp_ptr_map.sh: *C* *L* comp_ptr_map_adapter.sh: *C* *L* comp_ptr_multimap.sh: *C* *L* comp_ptr_multimap_adapter.sh: *C* *L* comp_ptr_multiset.sh: *C* *L* comp_ptr_multiset_adapter.sh: *C* *L* comp_ptr_sequence_adapter.sh: *C* *L* comp_ptr_set.sh: *C* *L* comp_ptr_set_adapter.sh: *C* *L* comp_ptr_vector.sh: *C* *L* comp_reference.sh: *C* *L* comp_rever_ptr_container.sh: *C* *L* comp_tutorial.sh: *C* *L* conventions.html: *L* conventions.rst: *L* default.css: *L* examples.rst: *L* faq.html: *L* faq.rst: *L* guidelines.html: *L* guidelines.rst: *L* headers.html: *L* headers.rst: *L* indirect_fun.html: *L* indirect_fun.rst: *L* intro.xml: *C* *L* ptr_array.html: *L* ptr_array.rst: *L* ptr_container.xml: *L* ptr_deque.html: *L* ptr_deque.rst: *L* ptr_list.html: *L* ptr_list.rst: *L* ptr_map.html: *L* ptr_map.rst: *L* ptr_map_adapter.html: *L* ptr_map_adapter.rst: *L* ptr_multimap.html: *L* ptr_multimap.rst: *L* ptr_multimap_adapter.html: *L* ptr_multimap_adapter.rst: *L* ptr_multiset.html: *L* ptr_multiset.rst: *L* ptr_multiset_adapter.html: *L* ptr_multiset_adapter.rst: *L* ptr_sequence_adapter.html: *L* ptr_sequence_adapter.rst: *L* ptr_set.html: *L* ptr_set.rst: *L* ptr_set_adapter.html: *L* ptr_set_adapter.rst: *L* ptr_vector.html: *L* ptr_vector.rst: *L* reference.html: *L* reference.rst: *L* reversible_ptr_container.html: *L* reversible_ptr_container.rst: *L* style.css: *C* *L* todo.txt: *C* *L* tutorial.html: *L* tutorial.rst: *L* libs/ptr_container/ index.html: *C* *L* libs/ptr_container/test/ Jamfile.v2: *C* *L* sequence_point.cpp: *C* *L* |python| boost/python/detail/ python22_fixed.h: *L* libs/python/build/ Jamfile: *L* Jamfile.v2: *C* *L* libs/python/doc/PyConDC_2003/ bpl.html: *C* *L* bpl.txt: *C* *L* bpl_mods.txt: *L* default.css: *L* libs/python/doc/ boost.css: *C* *L* building.html: *L* index.html: *L* internals.html: *L* internals.rst: *L* polymorphism.txt: *C* *L* projects.html: *L* support.html: *L* libs/python/doc/tutorial/doc/ Jamfile.v2: *C* *L* libs/python/doc/tutorial/doc/html/python/ embedding.html: *L* exception.html: *L* exposing.html: *L* functions.html: *L* hello.html: *L* iterators.html: *L* object.html: *L* techniques.html: *L* libs/python/doc/tutorial/ index.html: *C* *L* libs/python/doc/v2/ Apr2002.html: *L* CallPolicies.html: *L* Dereferenceable.html: *L* Extractor.html: *L* HolderGenerator.html: *L* Jun2002.html: *L* Mar2002.html: *L* May2002.html: *L* ObjectWrapper.html: *L* ResultConverter.html: *L* acknowledgments.html: *L* args.html: *L* call.html: *L* call_method.html: *L* callbacks.html: *L* callbacks.txt: *C* *L* class.html: *L* configuration.html: *L* copy_const_reference.html: *L* copy_non_const_reference.html: *L* data_members.html: *L* def.html: *L* def_visitor.html: *L* default_call_policies.html: *L* definitions.html: *L* dict.html: *L* docstring_options.html: *L* enum.html: *L* errors.html: *L* exception_translator.html: *L* exec.html: *L* extract.html: *L* faq.html: *L* feb2002.html: *L* handle.html: *L* has_back_reference.html: *L* implicit.html: *L* import.html: *L* index.html: *C* *L* indexing.html: *L* init.html: *L* instance_holder.html: *L* iterator.html: *L* list.html: *L* long.html: *L* lvalue_from_pytype.html: *L* make_function.html: *L* manage_new_object.html: *L* module.html: *L* numeric.html: *L* object.html: *L* opaque_pointer_converter.html: *L* operators.html: *L* overloads.html: *L* pickle.html: *L* platforms.html: *L* pointee.html: *L* progress_reports.html: *L* ptr.html: *L* python.html: *L* raw_function.html: *L* reference.html: *L* reference_existing_object.html: *L* register_ptr_to_python.html: *L* return_arg.html: *L* return_by_value.html: *L* return_internal_reference.html: *L* return_opaque_pointer.html: *L* return_value_policy.html: *L* scope.html: *L* stl_iterator.html: *L* str.html: *L* to_python_converter.html: *L* to_python_indirect.html: *L* to_python_value.html: *L* tuple.html: *L* type_id.html: *L* with_custodian_and_ward.html: *L* wrapper.html: *L* libs/python/example/ Jamfile: *L* Jamfile.v2: *C* *L* README: *C* *L* boost-build.jam: *L* test_getting_started1.py: *C* *L* test_getting_started2.py: *C* *L* test_std_pair.py: *C* *L* libs/python/ index.html: *C* *L* libs/python/pyste/ NEWS: *C* *L* README: *C* *L* TODO: *C* *L* libs/python/pyste/dist/ create_build.py: *C* *L* setup.py: *C* *L* libs/python/pyste/doc/ adding_new_methods.html: *L* exporting_an_entire_header.html: *L* global_variables.html: *L* inserting_code.html: *L* introduction.html: *L* policies.html: *L* pyste.txt: *C* *L* renaming_and_excluding.html: *L* running_pyste.html: *L* smart_pointers.html: *L* templates.html: *L* 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* setup.py: *C* *L* libs/python/ release_notes.txt: *C* *L* libs/python/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* andreas_beyer.cpp: *C* *L* crossmod_exception.py: *L* exec.py: *C* *L* opaque.py: *L* pointer_vector.cpp: *C* *L* |quickbook| tools/quickbook/doc/ Jamfile.v2: *C* *L* tools/quickbook/doc/html/quickbook/ change_log.html: *L* intro.html: *L* ref.html: *L* syntax.html: *L* tools/quickbook/doc/html/quickbook/syntax/ block.html: *L* comments.html: *L* phrase.html: *L* tools/quickbook/ index.html: *C* *L* |random| libs/random/ index.html: *C* *L* nondet_random.html: *C* *L* random-concepts.html: *C* *L* random-distributions.html: *C* *L* random-generators.html: *C* *L* random-misc.html: *C* *L* random-performance.html: *C* *L* random-variate.html: *C* *L* libs/random/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/random/ wg21-proposal.html: *C* *L* |range| libs/range/doc/ boost_range.html: *L* example.cpp: *C* *L* examples.html: *L* faq.html: *L* headers.html: *L* history_ack.html: *L* intro.html: *L* portability.html: *L* range.html: *L* style.css: *C* *L* style.html: *L* utility_class.html: *L* libs/range/test/ TODO: *C* *L* compat1.cpp: *C* *L* |rational| boost/ rational.hpp: *L* libs/rational/ index.html: *L* rational.html: *L* rational_example.cpp: *L* rational_test.cpp: *L* |regex| libs/regex/build/ gcc-shared.mak: *C* *L* libs/regex/example/timer/ input_script.txt: *C* *L* |regression| tools/regression/build/ Jamfile: *C* *L* Jamfile.v2: *C* *L* tools/regression/detail/ tiny_xml_test.txt: *C* *L* tools/regression/ index.htm: *C* *L* regression-logs.pl: *L* run_tests.sh: *C* *L* tools/regression/test/ Jamfile: *L* test.bat: *C* *L* tools/regression/xsl_reports/ empty_expected_results.xml: *C* *L* tools/regression/xsl_reports/runner/ __init__.py: *C* *L* default.css: *L* instructions.html: *L* instructions.rst: *C* *L* tools/regression/xsl_reports/test/ common.py: *C* *L* expected_results.xml: *C* *L* generate_test_results.py: *C* *L* generate_test_results_v1.py: *C* *L* restrict_to_library.xsl: *C* *L* run_notes_regression.py: *C* *L* run_v1.py: *C* *L* test.py: *C* *L* test_boost_wide_report.py: *C* *L* tools/regression/xsl_reports/ test_results.xsd: *C* *L* tools/regression/xsl_reports/utils/ __init__.py: *C* *L* accept_args.py: *C* *L* char_translation_table.py: *C* *L* check_existance.py: *C* *L* checked_system.py: *C* *L* libxslt.py: *C* *L* log.py: *C* *L* makedirs.py: *C* *L* send_mail.py: *C* *L* sourceforge.py: *C* *L* tar.py: *C* *L* zip.py: *C* *L* tools/regression/xsl_reports/xsl/v2/ expected_to_1_33_format.xsl: *C* *L* |release| tools/release/ user-config.jam: *L* utils.py: *C* *L* |serialization| libs/serialization/doc/ style.css: *C* *L* libs/serialization/example/ demo_output.txt: *C* *L* demo_save.xml: *C* *L* demofile.txt: *C* *L* libs/serialization/test/ run_archive_test.bat: *C* *L* runtest.bat: *C* *L* runtest.sh: *C* *L* libs/serialization/vc7ide/ readme.txt: *C* *L* |signals| libs/signals/doc/ Jamfile.v2: *C* *L* design.xml: *C* *L* faq.xml: *C* *L* index.html: *C* *L* introduction.xml: *C* *L* rationale.xml: *C* *L* libs/signals/doc/reference/ connection.xml: *C* *L* last_value.xml: *C* *L* reference.xml: *C* *L* signal_header.xml: *C* *L* slot.xml: *C* *L* trackable.xml: *C* *L* visit_each.xml: *C* *L* libs/signals/doc/ tests.xml: *C* *L* tutorial.xml: *C* *L* libs/signals/ index.html: *C* *L* |smart_ptr| libs/smart_ptr/ compatibility.htm: *L* enable_shared_from_this.html: *L* index.html: *C* *L* intrusive_ptr.html: *L* scoped_array.htm: *L* scoped_ptr.htm: *L* shared_array.htm: *L* shared_ptr.htm: *L* smart_ptr.htm: *L* smarttests.htm: *L* sp_techniques.html: *L* libs/smart_ptr/test/ Jamfile: *L* Jamfile.v2: *L* libs/smart_ptr/ weak_ptr.htm: *L* |test| boost/test/utils/runtime/cla/detail/ argument_value_usage.hpp: *L* libs/test/example/ unit_test_example_01.cpp: *C* *L* libs/test/test/auto-link-test/ run_bjam.bat: *C* *L* |thread| boost/thread/ barrier.hpp: *L* condition.hpp: *L* boost/thread/detail/ config.hpp: *L* lock.hpp: *L* read_write_lock.hpp: *L* boost/thread/ exceptions.hpp: *L* mutex.hpp: *L* once.hpp: *L* read_write_mutex.hpp: *L* recursive_mutex.hpp: *L* thread.hpp: *L* tss.hpp: *L* xtime.hpp: *L* libs/thread/build/ Jamfile: *L* Jamfile.v2: *C* *L* threads.jam: *L* libs/thread/doc/ Jamfile.v2: *C* *L* acknowledgements.xml: *C* *L* barrier-ref.xml: *C* *L* bibliography.xml: *L* build.xml: *C* *L* concepts.xml: *C* *L* condition-ref.xml: *C* *L* configuration.xml: *C* *L* design.xml: *C* *L* entities.xml: *C* *L* exceptions-ref.xml: *C* *L* faq.xml: *C* *L* glossary.xml: *C* *L* implementation_notes.xml: *C* *L* index.html: *C* *L* mutex-ref.xml: *C* *L* once-ref.xml: *C* *L* overview.xml: *C* *L* rationale.xml: *C* *L* read_write_mutex-ref.xml: *C* *L* recursive_mutex-ref.xml: *C* *L* reference.xml: *C* *L* release_notes.xml: *C* *L* thread-ref.xml: *C* *L* thread.xml: *L* tss-ref.xml: *C* *L* xtime-ref.xml: *C* *L* libs/thread/example/ Jamfile: *L* Jamfile.v2: *C* *L* condition.cpp: *L* monitor.cpp: *L* mutex.cpp: *L* once.cpp: *L* recursive_mutex.cpp: *L* starvephil.cpp: *L* tennis.cpp: *L* thread.cpp: *L* thread_group.cpp: *L* tss.cpp: *L* xtime.cpp: *L* libs/thread/ index.html: *C* *L* libs/thread/src/ barrier.cpp: *L* condition.cpp: *L* exceptions.cpp: *L* mutex.cpp: *L* once.cpp: *L* read_write_mutex.cpp: *L* recursive_mutex.cpp: *L* thread.cpp: *L* tss.cpp: *L* xtime.cpp: *L* libs/thread/test/ Jamfile: *L* Jamfile.v2: *L* test_barrier.cpp: *L* test_condition.cpp: *L* test_mutex.cpp: *L* test_once.cpp: *L* test_read_write_mutex.cpp: *L* test_thread.cpp: *L* test_tss.cpp: *L* test_xtime.cpp: *L* libs/thread/tutorial/ Jamfile: *L* bounded_buffer.cpp: *L* counter.cpp: *L* factorial.cpp: *L* factorial2.cpp: *L* factorial3.cpp: *L* helloworld.cpp: *L* helloworld2.cpp: *L* helloworld3.cpp: *L* helloworld4.cpp: *L* once.cpp: *L* tss.cpp: *L* |timer| libs/timer/ index.html: *C* *L* timer.htm: *L* |tokenizer| libs/tokenizer/ char_delimiters_separator.htm: *L* char_separator.htm: *L* escaped_list_separator.htm: *L* index.html: *L* introduc.htm: *L* offset_separator.htm: *L* token_iterator.htm: *L* tokenizer.htm: *L* tokenizerfunction.htm: *L* |tools| tools/ Jamfile.v2: *C* *L* index.html: *C* *L* make-cputime-page.pl: *C* *L* |tuple| libs/tuple/doc/ design_decisions_rationale.html: *L* tuple_advanced_interface.html: *L* tuple_users_guide.html: *L* libs/tuple/ index.html: *C* *L* libs/tuple/test/ Jamfile: *C* *L* README: *C* *L* |typeof| libs/typeof/ index.html: *C* *L* libs/typeof/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* data_member.cpp: *C* *L* function.cpp: *C* *L* function_binding.cpp: *C* *L* function_ptr.cpp: *C* *L* function_ptr_from_tpl.cpp: *C* *L* function_ref.cpp: *C* *L* member_function.cpp: *C* *L* modifiers.cpp: *C* *L* nested_typedef.cpp: *C* *L* noncopyable.cpp: *C* *L* odr.hpp: *C* *L* odr1.cpp: *C* *L* odr2.cpp: *C* *L* odr_no_uns1.cpp: *C* *L* odr_no_uns1.hpp: *C* *L* odr_no_uns2.cpp: *C* *L* odr_no_uns2.hpp: *C* *L* std.cpp: *C* *L* template_dependent.cpp: *C* *L* template_enum.cpp: *C* *L* template_int.cpp: *C* *L* template_multiword.cpp: *C* *L* template_tpl.cpp: *C* *L* template_type.cpp: *C* *L* type.cpp: *C* *L* |unknown| boost/ thread.hpp: *L* |utility| shared_container_iterator.hpp: *L* libs/utility/ Assignable.html: *L* Collection.html: *L* CopyConstructible.html: *L* LessThanComparable.html: *L* MultiPassInputIterator.html: *L* OptionalPointee.html: *L* assert.html: *L* call_traits.htm: *L* checked_delete.html: *L* compressed_pair.htm: *L* current_function.html: *L* enable_if.html: *L* generator_iterator.htm: *C* *L* index.html: *C* *L* iterator_adaptors.htm: *L* libs/utility/test/ Jamfile: *L* Jamfile.v2: *L* libs/utility/ throw_exception.html: *L* utility.htm: *L* value_init.htm: *L* value_init_test.cpp: *C* value_init_test_fail1.cpp: *C* value_init_test_fail2.cpp: *C* value_init_test_fail3.cpp: *C* |variant| libs/variant/doc/ Jamfile.v2: *C* *L* biblio.xml: *C* *L* design.xml: *C* *L* introduction.xml: *C* *L* misc.xml: *C* *L* libs/variant/doc/reference/ apply_visitor.xml: *C* *L* bad_visit.xml: *C* *L* concepts.xml: *C* *L* get.xml: *C* *L* recursive_variant.xml: *C* *L* recursive_wrapper.xml: *C* *L* reference.xml: *C* *L* static_visitor.xml: *C* *L* variant.xml: *C* *L* variant_fwd.xml: *C* *L* visitor_ptr.xml: *C* *L* libs/variant/doc/tutorial/ advanced.xml: *C* *L* basic.xml: *C* *L* tutorial.xml: *C* *L* libs/variant/doc/ variant.xml: *L* libs/variant/ index.html: *C* *L* libs/variant/test/ Jamfile: *L* Jamfile.v2: *L* |wiki| wiki/ index.html: *C* *L* |xpressive| libs/xpressive/perf/gcc/ long_twain_search.xml: *C* *L* short_matches.xml: *C* *L* short_twain_search.xml: *C* *L* libs/xpressive/perf/msvc/ long_twain_search.xml: *C* *L* short_matches.xml: *C* *L* short_twain_search.xml: *C* *L* libs/xpressive/test/ regress.txt: *L*

1 0