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

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

02 Nov '06

Boost Inspection Report Run Date: 17:02:49 UTC, Thursday 02 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11675 files scanned 906 directories scanned (including root) 2169 problems reported Problem counts: 1414 files missing Boost license info or having wrong reference text 755 files missing copyright notice Summary: any (3) archive (1) array (3) assign (2) bind (9) boost-root (4) boostbook (70) build (423) compatibility (2) compose (2) concept_check (24) conversion (5) detail (4) disjoint_sets (6) doc (56) filesystem (7) format (12) function (17) functional (8) graph (180) inspect (1) integer (9) io (2) iostreams (2) lambda (14) libs (8) logic (2) math (1) mem_fn (2) more (31) mpl (425) multi_array (16) numeric (214) optional (3) people (90) pool (32) program_options (45) property_map (17) ptr_container (113) python (6) quickbook (11) random (22) range (18) rational (5) regex (4) regression (67) release (3) serialization (16) signals (32) smart_ptr (15) test (5) timer (3) tokenizer (9) tools (6) tr1 (2) tuple (9) utility (26) variant (43) wiki (2) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright notice |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: *L* libs/assign/ index.html: *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| / README: *C* boost.css: *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* tasks.xml: *C* *L* tutorial.xml: *C* *L* userman.xml: *C* *L* v1_vs_v2.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/ 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* 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/ 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* readme.txt: *C* *L* rebuilds.py: *C* *L* recursive.jam: *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_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* 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/ 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* doc/html/bbv2/ installation.html: *C* *L* doc/html/ boost_math.html: *C* *L* doc/html/boost_math/ gcd_lcm.html: *C* *L* inverse_complex.html: *C* *L* doc/html/ boost_staticassert.html: *C* *L* boost_tr1.html: *C* *L* boost_typetraits.html: *C* *L* doc/html/boost_typetraits/ background.html: *C* *L* doc/html/ boostbook.html: *C* *L* date_time.html: *C* *L* foreach.html: *C* *L* function.html: *C* *L* functionN.html: *C* *L* lambda.html: *C* *L* program_options.html: *C* *L* ref.html: *C* *L* reference.css: *C* *L* signals.html: *C* *L* string_algo.html: *C* *L* tribool.html: *C* *L* variant.html: *C* *L* who_s_using_boost_.html: *C* *L* xpressive.html: *C* *L* doc/src/ boost.xml: *C* *L* |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* breadth_first_search.html: *L* breadth_first_visit.html: *L* challenge.html: *L* circle_layout.html: *L* compressed_sparse_row.html: *L* connected_components.html: *L* constructing_algorithms.html: *L* copy_graph.html: *L* cuthill_mckee_ordering.html: *L* dag_shortest_paths.html: *L* default.css: *L* depth_first_search.html: *L* depth_first_visit.html: *L* dfs_visitor.html: *L* dijkstra_shortest_paths.html: *L* dijkstra_visitor.html: *L* distance_recorder.html: *L* edge_list.html: *L* edmunds_karp_max_flow.html: *L* exception.html: *L* faq.html: *L* libs/graph/doc/figs/ Makefile: *C* *L* libs/graph/doc/ file_dependency_example.html: *L* filtered_graph.html: *L* floyd_warshall_shortest.html: *L* fruchterman_reingold.html: *L* graph_coloring.html: *L* graph_concepts.html: *L* graph_theory_review.html: *L* graph_traits.html: *L* gursoy_atun_layout.html: *L* history.html: *L* incident.html: *L* incremental_components.html: *L* index.html: *L* inv_adjacency_iterator.html: *L* isomorphism.html: *L* johnson_all_pairs_shortest.html: *L* jwebfrob.pl: *C* *L* kamada_kawai_spring_layout.html: *L* kevin_bacon.html: *L* king_ordering.html: *L* known_problems.html: *L* kruskal_min_spanning_tree.html: *L* layout_tolerance.html: *C* *L* leda_conversion.html: *L* lengauer_tarjan_dominator_tree.htm: *L* minimum_degree_ordering.html: *L* null_visitor.html: *L* opposite.html: *L* predecessor_recorder.html: *L* prim_minimum_spanning_tree.html: *L* profile.htm: *L* property.html: *L* property_map.html: *L* property_writer.html: *L* publications.html: *L* push_relabel_max_flow.html: *L* python.html: *L* quick_tour.html: *L* random.html: *L* random_layout.html: *L* read_graphviz.html: *C* *L* read_graphviz.rst: *C* *L* reverse_graph.html: *L* sequential_vertex_coloring.html: *L* sloan_ordering.htm: *L* sloan_start_end_vertices.htm: *L* sparse_matrix_ordering.html: *L* stanford_graph.html: *L* strong_components.html: *L* subgraph.html: *L* table_of_contents.html: *L* time_stamper.html: *L* topological_sort.html: *L* transitive_closure.html: *L* transpose_graph.html: *L* trouble_shooting.html: *L* undirected_dfs.html: *L* users.html: *C* *L* using_adjacency_list.html: *L* using_property_maps.html: *L* visitor_concepts.html: *L* wavefront.htm: *L* write-graphviz.html: *L* 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* serialize.cpp: *C* *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* |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-apr-2006.html: *C* *L* report-jan-2006.html: *C* *L* more/writingdoc/ design.html: *L* index.html: *L* introduction.html: *L* structure.html: *L* more/writingdoc/template/ acknowledgments.html: *L* bibliography.html: *L* configuration.html: *L* definitions.html: *L* faq.html: *L* header.html: *L* index.html: *L* overview.html: *L* rationale.html: *L* |mpl| libs/mpl/doc/src/refmanual/ ASSERT.rst: *C* *L* ASSERT_MSG.rst: *C* *L* ASSERT_NOT.rst: *C* *L* ASSERT_RELATION.rst: *C* *L* AUX_LAMBDA_SUPPORT.rst: *C* *L* Acknowledgements.rst: *C* *L* Algorithms-Iteration.rst: *C* *L* Algorithms-Querying.rst: *C* *L* Algorithms-Runtime.rst: *C* *L* Algorithms-Transformation.rst: *C* *L* Algorithms.rst: *C* *L* AssociativeSequence.rst: *C* *L* BackExtensibleSequence.rst: *C* *L* BidirectionalIterator.rst: *C* *L* BidirectionalSequence.rst: *C* *L* CFG_NO_HAS_XXX.rst: *C* *L* CFG_NO_PREPROCESSED.rst: *C* *L* Categorized.rst: *C* *L* Data.rst: *C* *L* ExtensibleAssociativeSeq.rst: *C* *L* ExtensibleSequence.rst: *C* *L* ForwardIterator.rst: *C* *L* ForwardSequence.rst: *C* *L* FrontExtensibleSequence.rst: *C* *L* HAS_XXX_TRAIT_DEF.rst: *C* *L* HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L* Inserter.rst: *C* *L* IntegralConstant.rst: *C* *L* IntegralSequenceWrapper.rst: *C* *L* Iterators-Concepts.rst: *C* *L* Iterators-Metafunctions.rst: *C* *L* Iterators.rst: *C* *L* LIMIT_LIST_SIZE.rst: *C* *L* LIMIT_MAP_SIZE.rst: *C* *L* LIMIT_METAFUNCTION_ARITY.rst: *C* *L* LIMIT_SET_SIZE.rst: *C* *L* LIMIT_UNROLLING.rst: *C* *L* LIMIT_VECTOR_SIZE.rst: *C* *L* LambdaExpression.rst: *C* *L* Macros-Asserts.rst: *C* *L* Macros-Configuration.rst: *C* *L* Macros.rst: *C* *L* Metafunction.rst: *C* *L* MetafunctionClass.rst: *C* *L* Metafunctions-Arithmetic.rst: *C* *L* Metafunctions-Bitwise.rst: *C* *L* Metafunctions-Comparisons.rst: *C* *L* Metafunctions-Composition.rst: *C* *L* Metafunctions-Conditional.rst: *C* *L* Metafunctions-Invocation.rst: *C* *L* Metafunctions-Logical.rst: *C* *L* Metafunctions-Trivial.rst: *C* *L* Metafunctions-Type.rst: *C* *L* Metafunctions.rst: *C* *L* NumericMetafunction.rst: *C* *L* PlaceholderExpression.rst: *C* *L* Placeholders.rst: *C* *L* RandomAccessIterator.rst: *C* *L* RandomAccessSequence.rst: *C* *L* ReversibleAlgorithm.rst: *C* *L* Sequences-Classes.rst: *C* *L* Sequences-Concepts.rst: *C* *L* Sequences-Intrinsic.rst: *C* *L* Sequences-Views.rst: *C* *L* Sequences.rst: *C* *L* TagDispatchedMetafunction.rst: *C* *L* TrivialMetafunction.rst: *C* *L* VariadicSequence.rst: *C* *L* accumulate.rst: *C* *L* advance.rst: *C* *L* always.rst: *C* *L* and_.rst: *C* *L* apply.rst: *C* *L* apply_wrap.rst: *C* *L* arg.rst: *C* *L* at.rst: *C* *L* at_c.rst: *C* *L* back.rst: *C* *L* back_inserter.rst: *C* *L* begin.rst: *C* *L* bind.rst: *C* *L* bitand_.rst: *C* *L* bitor_.rst: *C* *L* bitxor_.rst: *C* *L* bool_.rst: *C* *L* clear.rst: *C* *L* contains.rst: *C* *L* copy.rst: *C* *L* copy_if.rst: *C* *L* count.rst: *C* *L* count_if.rst: *C* *L* deque.rst: *C* *L* deref.rst: *C* *L* distance.rst: *C* *L* divides.rst: *C* *L* empty.rst: *C* *L* empty_base.rst: *C* *L* empty_sequence.rst: *C* *L* end.rst: *C* *L* equal.rst: *C* *L* equal_to.rst: *C* *L* erase.rst: *C* *L* erase_key.rst: *C* *L* eval_if.rst: *C* *L* eval_if_c.rst: *C* *L* filter_view.rst: *C* *L* find.rst: *C* *L* find_if.rst: *C* *L* fold.rst: *C* *L* for_each.rst: *C* *L* front.rst: *C* *L* front_inserter.rst: *C* *L* greater.rst: *C* *L* greater_equal.rst: *C* *L* has_key.rst: *C* *L* identity.rst: *C* *L* if_.rst: *C* *L* if_c.rst: *C* *L* inherit.rst: *C* *L* inherit_linearly.rst: *C* *L* insert.rst: *C* *L* insert_range.rst: *C* *L* inserter_.rst: *C* *L* int_.rst: *C* *L* integral_c.rst: *C* *L* is_sequence.rst: *C* *L* iter_fold.rst: *C* *L* iter_fold_if.rst: *C* *L* iterator_category.rst: *C* *L* iterator_range.rst: *C* *L* joint_view.rst: *C* *L* key_type.rst: *C* *L* lambda.rst: *C* *L* less.rst: *C* *L* less_equal.rst: *C* *L* list.rst: *C* *L* list_c.rst: *C* *L* long_.rst: *C* *L* lower_bound.rst: *C* *L* map.rst: *C* *L* max.rst: *C* *L* max_element.rst: *C* *L* min.rst: *C* *L* min_element.rst: *C* *L* minus.rst: *C* *L* modulus.rst: *C* *L* multiplies.rst: *C* *L* negate.rst: *C* *L* next.rst: *C* *L* not_.rst: *C* *L* not_equal_to.rst: *C* *L* numeric_cast.rst: *C* *L* or_.rst: *C* *L* order.rst: *C* *L* pair.rst: *C* *L* partition.rst: *C* *L* plus.rst: *C* *L* pop_back.rst: *C* *L* pop_front.rst: *C* *L* preface.rst: *C* *L* prior.rst: *C* *L* protect.rst: *C* *L* push_back.rst: *C* *L* push_front.rst: *C* *L* quote.rst: *C* *L* range_c.rst: *C* *L* refmanual.py: *C* *L* remove.rst: *C* *L* remove_if.rst: *C* *L* replace.rst: *C* *L* replace_if.rst: *C* *L* reverse.rst: *C* *L* reverse_copy.rst: *C* *L* reverse_copy_if.rst: *C* *L* reverse_fold.rst: *C* *L* reverse_iter_fold.rst: *C* *L* reverse_partition.rst: *C* *L* reverse_remove.rst: *C* *L* reverse_remove_if.rst: *C* *L* reverse_replace.rst: *C* *L* reverse_replace_if.rst: *C* *L* reverse_stable_partition.rst: *C* *L* reverse_transform.rst: *C* *L* reverse_unique.rst: *C* *L* sequence_tag.rst: *C* *L* set.rst: *C* *L* set_c.rst: *C* *L* shift_left.rst: *C* *L* shift_right.rst: *C* *L* single_view.rst: *C* *L* size.rst: *C* *L* size_t.rst: *C* *L* sizeof_.rst: *C* *L* sort.rst: *C* *L* stable_partition.rst: *C* *L* terminology.rst: *C* *L* times.rst: *C* *L* transform.rst: *C* *L* transform_view.rst: *C* *L* unique.rst: *C* *L* unpack_args.rst: *C* *L* upper_bound.rst: *C* *L* value_type.rst: *C* *L* vector.rst: *C* *L* vector_c.rst: *C* *L* void_.rst: *C* *L* zip_view.rst: *C* *L* libs/mpl/doc/ style.css: *L* libs/mpl/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/ iterator_categories.html: *C* *L* reference.html: *L* libs/multi_array/doc/xml/ MultiArray.xml: *C* *L* const_multi_array_ref.xml: *C* *L* multi_array.xml: *C* *L* multi_array_ref.xml: *C* *L* reference.xml: *L* libs/multi_array/ 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* 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* |people| people/ aleksey_gurtovoy.htm: *C* *L* andreas_huber.html: *C* *L* beman_dawes.html: *C* *L* darin_adler.htm: *C* *L* daryle_walker.html: *C* *L* dietmar_kuehl.htm: *C* *L* doug_gregor.html: *C* *L* ed_brey.htm: *C* *L* eric_friedman.htm: *C* *L* fernando_cacciola.html: *C* *L* gary_powell.htm: *C* *L* gennadiy_rozental.htm: *C* *L* greg_colvin.htm: *C* *L* hartmut_kaiser.htm: *C* *L* herve_bronnimann.htm: *C* *L* howard_hinnant.htm: *C* *L* hubert_holin.html: *C* *L* jaakko_jarvi.htm: *C* *L* jeff_garland.html: *C* *L* jens_maurer.htm: *C* *L* jeremy_siek.htm: *C* *L* joaquin_lopez.htm: *C* *L* joel_de_guzman.htm: *C* *L* john_maddock.htm: *C* *L* jonathan_turkanis.htm: *C* *L* kevlin_henney.htm: *C* *L* liequan_lee.htm: *C* *L* mac_murrett.htm: *C* *L* mark_rodgers.htm: *C* *L* mat_marcus.htm: *C* *L* paul_mensonides.htm: *C* *L* paul_moore.htm: *C* *L* pavol_droba.htm: *C* *L* people.htm: *C* *L* peter_dimov.htm: *C* *L* ralf_w_grosse_kunstleve.htm: *C* *L* rene_rivera.htm: *C* *L* robert_ramey.htm: *C* *L* ronald_garcia.htm: *C* *L* samuel_krempp.htm: *C* *L* thomas_witt.html: *C* *L* thorsten_ottosen.html: *C* *L* vesa_karvonen.htm: *C* *L* vladimir_prus.htm: *C* *L* william_kempf.htm: *C* *L* |pool| boost/pool/detail/ pool_construct.bat: *L* pool_construct.sh: *L* pool_construct_simple.bat: *L* pool_construct_simple.sh: *L* libs/pool/ TODO.txt: *C* *L* libs/pool/doc/ concepts.html: *L* copyright.html: *L* libs/pool/doc/implementation/ alignment.html: *L* ct_gcd_lcm.html: *L* for.html: *L* gcd_lcm.html: *L* guard.html: *L* mutex.html: *L* object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* pool_construct.html: *L* simple_segregated_storage.html: *L* singleton.html: *L* singleton_pool.html: *L* libs/pool/doc/ index.html: *L* interfaces.html: *L* libs/pool/doc/interfaces/ object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* simple_segregated_storage.html: *L* singleton_pool.html: *L* user_allocator.html: *L* libs/pool/doc/ pool.css: *L* 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| libs/python/doc/ internals.html: *L* internals.rst: *L* libs/python/test/ operators_wrapper.cpp: *C* *L* operators_wrapper.py: *C* *L* |quickbook| tools/quickbook/doc/ Jamfile.v2: *C* *L* tools/quickbook/doc/html/quickbook/ change_log.html: *L* intro.html: *L* ref.html: *L* syntax.html: *L* tools/quickbook/doc/html/quickbook/syntax/ block.html: *L* comments.html: *L* phrase.html: *L* tools/quickbook/ index.html: *C* *L* |random| libs/random/ index.html: *C* *L* nondet_random.html: *C* *L* random-concepts.html: *C* *L* random-distributions.html: *C* *L* random-generators.html: *C* *L* random-misc.html: *C* *L* random-performance.html: *C* *L* random-variate.html: *C* *L* libs/random/test/ Jamfile: *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* 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* |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* |tr1| boost/tr1/ tuple.hpp: *C* *L* |tuple| libs/tuple/doc/ design_decisions_rationale.html: *L* tuple_advanced_interface.html: *L* tuple_users_guide.html: *L* libs/tuple/ index.html: *C* *L* libs/tuple/test/ Jamfile: *C* *L* README: *C* *L* |utility| boost/ shared_container_iterator.hpp: *L* libs/utility/ Assignable.html: *L* Collection.html: *L* CopyConstructible.html: *L* LessThanComparable.html: *L* MultiPassInputIterator.html: *L* OptionalPointee.html: *L* assert.html: *L* call_traits.htm: *L* checked_delete.html: *L* compressed_pair.htm: *L* current_function.html: *L* enable_if.html: *L* generator_iterator.htm: *C* *L* index.html: *C* *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*

1 0

[Boost-bugs] [ boost-Patches-1438991 ] rational::operator<(rational) fails due to overflow
by SourceForge.net 02 Nov '06

02 Nov '06

Patches item #1438991, was opened at 2006-02-26 07:54 Message generated for change (Comment added) made by dlwalker You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1438991&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: Closed >Resolution: Duplicate Priority: 5 Private: No Submitted By: David Benbennick (dbenbenn) Assigned to: Jonathan Turkanis (turkanis) Summary: rational::operator<(rational) fails due to overflow Initial Comment: Consider boost::rational<long>. Pick two objects of that type at random (that's well defined, since there are only finitely many objects of that type), and pick them to both have the same sign. Call them a and b. Then the expression "a < b" returns the wrong value 50% of the time! The problem is that the calculation in rational.hpp can overflow, and that overflow actually happens most of the time. Here's a patch that implements operator< without overflow. It's somewhat less efficient (I haven't benchmarked it) but it gives the right answer. Possibly the new version of operator< has bugs. I've run a few hundred million random tests, with the right answer every time (I've used bc to check the answers), but there might be a subtle problem. In particular, the new code assumes that integer division always truncates towards 0, even when dividing negative integers. Perhaps that is not true on some obscure platforms/compilers? ---------------------------------------------------------------------- >Comment By: Daryle L. Walker (dlwalker) Date: 2006-11-02 11:28 Message: Logged In: YES user_id=551024 The problem was also described as bug #798357. Your issue should be fixed since I've fixed the other bug. I used continued-fraction expansion, with the components found by the Euclidean GCD algorithm and forcibly floor-rounding division & modulus. ---------------------------------------------------------------------- Comment By: David Benbennick (dbenbenn) Date: 2006-03-07 16:08 Message: Logged In: YES user_id=95581 Here's a new patch that uses std::numeric_limits to select the more efficient, direct comparison method for unbounded types, and only uses the overflow-avoiding method for types that can overflow. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1438991&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

[asio] Unrecoverable errors upon connecting to a SSL server via a non-SSL client
by Scott 02 Nov '06

02 Nov '06

I've been testing our server for robustness by attempting invalid connections to it. If the server is running without SSL and a client attempts to connect via SSL, then the connection is basically refused and everything is fine. However, if the server is SSL and the client attempts a non-SSL connection, problems start to appear. On the first attempt, everything *seems* to be fine. The client gets a connection closed message (end of file) and the server closes the connection because of a failed SSL handshake. On the 2nd attempt, things go really bad. Inside the server session constructor, the attempt to create a SSL context fails on use_certificate_chain_file(): typedef boost::asio::ssl::context Context; typedef boost::shared_ptr<Context> ContextPtr; sslContext = nw::Connection::ContextPtr( new nw::Connection::Context(ioservice, boost::asio::ssl::context::sslv23)); sslContext->set_options( boost::asio::ssl::context::default_workarounds | boost::asio::ssl::context::no_sslv2 | boost::asio::ssl::context::single_dh_use); sslContext->use_certificate_chain_file(chain); A boost::error is thrown with a code of 10022, "An invalid argument was supplied". It's basically happening in openssl_context_service.hpp: if (::SSL_CTX_use_certificate_chain_file(impl, filename.c_str()) != 1) { boost::asio::error e(boost::asio::error::invalid_argument); error_handler(e); return; } However, it's the exact same arguments I used previously that worked fine. Call Stack: kernel32.dll!7c81eb33() kernel32.dll!7c81eb33() msvcr71.dll!__crtExitProcess(int status=2089872920) Line 463 + 0x9 C 0012f6f4() ntdll.dll!7c91056d() msvcr71.dll!free(void * pBlock=0x0012f714) Line 103 C > NwEngineD.exe!boost::throw_exception<boost::asio::error>(const boost::asio::error & e={...}) Line 40 C++ NwEngineD.exe!boost::asio::detail::throw_error_t::operator()<boost::asio::er ror>() Line 49 + 0x9 C++ NwEngineD.exe!boost::asio::ssl::detail::openssl_context_service::use_certifi cate_chain_file<boost::asio::detail::throw_error_t>() Line 215 C++ NwEngineD.exe!boost::asio::ssl::context_service::use_certificate_chain_file< boost::asio::detail::throw_error_t>() Line 127 C++ NwEngineD.exe!boost::asio::ssl::basic_context<boost::asio::ssl::context_serv ice>::use_certificate_chain_file(const std::basic_string<char,std::char_traits<char>,std::allocator<char> > & filename={...}) Line 271 C++ Any help would be greatly appreciated. Thanks, Scott

2 1

[Boost-bugs] [ boost-Patches-1434821 ] rational::operator< fails for unsigned value types
by SourceForge.net 02 Nov '06

02 Nov '06

Patches item #1434821, was opened at 2006-02-19 16:24 Message generated for change (Comment added) made by dlwalker You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1434821&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: Closed >Resolution: Fixed Priority: 5 Private: No Submitted By: David Benbennick (dbenbenn) Assigned to: Jonathan Turkanis (turkanis) Summary: rational::operator< fails for unsigned value types Initial Comment: There's a minor bug in rational.hpp when using unsigned values. Consider the following simple program: int main(void) { boost::rational<unsigned int> x = 0; assert(x.operator<(1)); } The assertion fails. The reason is that in rational.hpp::rational<IntType>::operator< (param_type i) are the lines if (num > zero) return (num/den) < i; else return -i < (-num/den); The last line is bogus for unsigned types if num == 0 and i > 0. The problem can be fixed by changing (num > zero) to (num >= zero). Another issue with the same section of code is that it uses up to 5 comparisons of IntType values. Attached is a patch that fixes the bug described, and also makes the function only perform up to 3 comparisons. That can make a difference, of course, if IntType is a complicated type with a slow comparison operator. ---------------------------------------------------------------------- >Comment By: Daryle L. Walker (dlwalker) Date: 2006-11-02 11:03 Message: Logged In: YES user_id=551024 An extra change while fixing bug #798357 fixes this issue, without using this patch. The current solution performs a floor-rounding division and modulus, followed by a comparison. The floor division involves either one or two extra comparisons, for possibly converting from a truncating division. (The assert currently there uses another comparison.) ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1434821&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

Re: [boost] [proposal] Sequence container with O(log n) random access _and_ O(log n) insertion/removal (wherever)
by Martin Knoblauch Revuelta 02 Nov '06

02 Nov '06

Rene Rivera wrote: > Martin Knoblauch Revuelta wrote: > > How about a sequence container [..]. > > I was wondering how long it would take this to make it from the usenet > groups to here :-) > > I've mentioned this type of container here in the past, under the name > of "rank_tree". Very soon now I will have the version I wrote, and use, > ported to the framework that Bernhard produced for the SoC tree project. > You can look at the draft TR > <https://boost-consulting.com:8443/trac/soc/browser/boost/soc/2006/tree/trun…> > that mentions it, and other trees. > > I don't have time to look at your implementation right now. But perhaps > you could comment on how you think your implementation might fit within > the above. And of course if there's something we haven't thought about. Well, maybe the most important thing is the experimental feature NPSV that I added in version 1.1. I described it briefly in my message, but there's a detailed description in the notes for version 1.1 of stlavlarray.h. The example program in npsvexample.cpp shows it's behaviour. Example where NPSV would be useful: a simple avl_array (or rank_tree) would waste a lot of memory when used for small contained types. This can be solved with NPSV, by storing more than one contained type element in every tree node. The 'width' of the node would be the number of occupied elements in the node, which would contain a circular buffer. Additionally, avl_array has the next characteristics (use it as a check list): * On iterators, ++ and -- are O(1) * begin(), end(), rbegin() and rend() are all O(1) * Copy constructor, assignment operator and destructor are O(n) * Other constructors, where the number of elements is known, are O(n) * Comparison operators are all O(n) * reverse(), merge(), and unique are O(n) * avl_array swap is O(1) * element swap is O(1) unless when NPSV is used _and_ the elements' widths don't match (then it is O(log n)) * element swap also works between two different avl_arrays * resize, range-insert and range-erase take O(m log n) when m is small, but O(n) when m is reasonably significant compared to n. (m: number of elements to insert/erase; n: size of the array) * move() is O(log n) unless it is a single-position move, in which case it is done with a swap * both sort() and stable_sort() are provided with O(n log n) * search tree methods are provided * insert_anywhere() inserts without rotations favouring balance (though still O(log n)) * Iterators follow their referenced elements, even when theese are moved from an avl_array to another one Can all this be done with generic trees while keeping them simple, efficient and usable for other purposes where the hierarchy is visible to the user? Regards, Martin Knoblauch Revuelta

9 27

[proposal] Sequence container with O(log n) random access _and_ O(log n) insertion/removal (wherever)
by Martin Knoblauch Revuelta 02 Nov '06

02 Nov '06

- How about a sequence container (like a vector) with the advantage of logarithmic time insertion/removal at any point of the sequence? The disadvantage is that random access takes logarithmic time too (instead of the usual constant time random access of a vector). Here it is: http://sourceforge.net/projects/avl-array It is implemented with a tree, but it is _not_ a map. The 'position' of elements in avl_array are always natural numbers (0, 1, 2... up to size()-1). When an element is inserted/removed, it changes automatically the position of all elements after it in the sequence (in logarithmic time!). A simple experiment realized consisted in populating a container by inserting random numbers in random positions, and then removing numbers from random positions, showing the value of the last one for checking. In this test AVL Arrays completely outperform list, vector and deque. The test code and the results are in sourceforge too. Version 1.1 includes a new experimental feature that I call "Non-Proportional Sequence View". In the normal sequence, every element occupies a position of size 1. Additionally, elements can be viewed as a sequence where the 'width' of every element can be changed (in O(log n) time), being the position of every element the sum of the widths of all previous elements in the sequence. Negative widths are forbidden, but zero widths are valid. The type used for the width is a template parameter, so any class supporting some operators can be used, not only unsigned or double. I've tried to adapt it to the boost requirements, but I'm sure there's still a lot of things to change. If you are interested, please take a look at it, and tell me your opinion. Regards, Martin Knoblauch Revuelta Universidad de Alcala

4 11

[config] patch for config/compiler/hp_acc.hpp
by Boris Gubenko 02 Nov '06

02 Nov '06

Attached a small patch for hp_acc.hpp configuration header. It fixes all but one failure in parameter library (the remaining failure is python_test which is, most likely, some configuration problem with python). The tests would not compile with the old header because it defines BOOST_NO_TEMPLATE_TEMPLATES macro which is inappropriate for aCC6 compiler. The patch also fixes test failures in statechart library, this library now has zero failures. I also verified, that the patch does not introduce any regressions. I think, the changes are obvious, but I can comment, if necessary. The only question I can envision is: why inclusion of "common_edg.hpp" is conditionalized with '#if (__HP_aCC >= 61200)' and not with, say, '> 60000' ? After all, aCC6 is EDG-based compiler since day one. The reason is that before A.06.12, the compiler does not predefine __EDG__ and __EDG_VERSION__ macros. It was corrected in A.06.12. Since "common_edg.hpp" checks if __EDG_VERSION__ is defined, it cannot be included if a pre-A.06.12 compiler is used. Of course, I could use '#ifdef __EDG_VERSION__' condition, but I thought, that a specific compiler version in hp_acc.hpp header is more appropriate. Can the patch below be applied to both the HEAD and the RC 1.34 branch? Thanks, Boris Index: hp_acc.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/config/compiler/hp_acc.hpp,v retrieving revision 1.20 diff -r1.20 hp_acc.hpp 5a6 > // (C) Copyright Boris Gubenko 2006. 13a15,18 > #if (__HP_aCC >= 61200) > #include "boost/config/compiler/common_edg.hpp" > #endif > 30,31c35 < // This version check is way to high, but we don't know the right one to use: < #if (__HP_aCC < 60700) --- > #if (__HP_aCC < 60000) 62c66 < #if (__HP_aCC > 53800) --- > #if (__HP_aCC > 61300)

2 1

[program_options] Potential bug in options_description.cpp
by Stas Khirman 02 Nov '06

02 Nov '06

While reviewing diff of options_description.cpp rev 1.14 and 1.17 , I came across of potential bug in line 417: 417 : (line_length - indent) / 2) However, line_length already had been decrease by "indent" in line 332 ( introduced in rev 1.15) I assume that correction is: 417 : (line_length) / 2) Regards Stas Khirman

1 0

Boost regression notification (2006-10-31 [RC_1_34_0])
by Douglas Gregor 02 Nov '06

02 Nov '06

Boost Regression test failures Report time: 2006-10-31T11:56:09Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 36 failures in 7 libraries date_time (1) iostreams (10) mpl (4) program_options (7) random (1) serialization (12) utility (1) |date_time| testgreg_serialize_xml: msvc-8.0 |iostreams| bzip2_test: msvc-7.1 msvc-8.0 example_test: vc-6_5-stlport file_descriptor_test: cw-9.4 finite_state_filter_test: cw-9.4 gzip_test: msvc-7.1 msvc-8.0 mapped_file_test: cw-9.4 zlib_test: msvc-7.1 msvc-8.0 |mpl| multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc |program_options| cmdline_test_dll: cw-9.4 options_description_test_dll: cw-9.4 parsers_test_dll: cw-9.4 positional_options_test_dll: cw-9.4 unicode_test_dll: cw-9.4 variable_map_test_dll: cw-9.4 winmain_dll: cw-9.4 |random| random_test: intel-linux-9.0 |serialization| test_class_info_load_text_warchive: vc-6_5 test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 |utility| operators_test: gcc-3.4.5_linux_x86_64

3 2

[thread] Question about MT API C++0X N2094
by Roland Schwarz 01 Nov '06

01 Nov '06

I'd like to know the rationale behind mutex concept requiring explicit locking signatures. Are users of the library "allowed" to access them directly? If yes why? Isn't this redundant to locks? Not requiring them, but letting them be implementation defined will allow the implementor more freedom. The only required concept should be: being able to take the address of the mutex. (Because this makes it unique.) E.g. the requirement for these N2094 mutex concepts would make implementation of my proposed POD mutex variant impossible. E.g. the current boost mutex also does not need to make these explicit functions. Sorry if I misunderstood the document. I would be glad if someone (H. Hinnant?) could explain to me. Thank you. Roland

5 21

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

01 Nov '06

Boost Regression test failures Report time: 2006-11-01T10:24:34Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 31 failures in 7 libraries iostreams (10) mpl (4) program_options (7) random (1) serialization (7) spirit (1) utility (1) |iostreams| bzip2_test: msvc-7.1 msvc-8.0 example_test: vc-6_5-stlport file_descriptor_test: cw-9.4 finite_state_filter_test: cw-9.4 gzip_test: msvc-7.1 msvc-8.0 mapped_file_test: cw-9.4 zlib_test: msvc-7.1 msvc-8.0 |mpl| multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc |program_options| cmdline_test_dll: cw-9.4 options_description_test_dll: cw-9.4 parsers_test_dll: cw-9.4 positional_options_test_dll: cw-9.4 unicode_test_dll: cw-9.4 variable_map_test_dll: cw-9.4 winmain_dll: cw-9.4 |random| random_test: intel-linux-9.0 |serialization| test_class_info_load_text_warchive: vc-6_5 test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 |spirit| scanner_value_type_tests: gcc-4.1.0_linux |utility| operators_test: gcc-3.4.5_linux_x86_64

3 2

Re: [boost] Quicktime v210 format support (Re: GIL Review)
by Lubomir Bourdev 01 Nov '06

01 Nov '06

Lubomir Bourdev wrote: > 2. Now that we have writing out of the way, we can create a > model of an r-value channel reference (ChannelConcept, but > not MutableChannelConcept) that takes two channels and > returns a value half-way in between (or if generalization is > important, an arbitrary interpolation). Lets call it > InterpolatingChannel Of course, the moment I submitted the post I came up with a much simpler alternative. We don't need any InterpolatingChannel. We simply need to create a subbyte channel value. Synopsis: // Represents a channel *value* whose size is not byte-divisible // Models ChannelValueConcept template <typename UnpackedChannelValue, int NumBits> class packed_channel_value { public: typedef ChannelValue value_type; packed_channel_value(const value_type& data) : _data(data) {} packed_channel_value(const packed_channel_value& c) : _data(c._data) {} operator value_type() const { return _data&MAX_VALUE; } packed_channel_value& operator=(const value_type& data) { // warning: using this method may indicate a bug in your code! _data=data; return *this; } ... private: value_type _data; static const value_type MAX_VALUE = (1<<NumBits)-1; }; The difference between this and the packed_channel_reference class is that this one holds a copy of the data, whereas the packed channel reference holds a reference to the data which is located remotely. Now our channel type is simply: typedef packed_channel_value<uint16_t,10> v210_channel_t; Our pixel model is simply: typedef pixel<v210_channel_t, ycbcr_t> v210_pixel_t; We keep the same model of pixel iterator I outlined earlier. But we simply instantiate it with the correct values: reference v120_pixel_ptr::dereference() const { switch (index) { ... case 3: return reference( v120_channel_t(Y3), v120_channel_t((CB1+CB2)/2), v120_channel_t((CR1+CR2)/2)); } } Where "reference" is the same type as "value_type" (since this is an immutable view) Y3,CB1,CB2,CR1 and CR2 are the values of the corresponding 10-bit channels (some shift and mask math necessary) In short, dropping the requirement to write pixel-by-pixel into v210 (which is not a well defined operation anyway) results in a simpler and faster implementation. Lubomir

1 0

[xml] XML Reader Interface
by Sebastian Redl 01 Nov '06

01 Nov '06

Hi, Once again I'm turning to the list for discussion about a design issue in the XML library. This time I hope to avoid any discussion about the implementation on the library and focus on interface only. The interface in question is the reader interface, also known as pull interface. Like SAX, the pull interface is an event-based interface. There are a few event types (roughly, StartElement, EndElement, Characters, and a few more for other XML features), all of which provide come with some additional data: the element name, the character data, etc. There are two types of reader interfaces currently in use that I've found. I've come up with a third. I wonder which the people on this list would prefer, where they see their weaknesses and strengths. The names that I've given them are my own creation. 1) The Monolithic Interface Examples: .Net XMLReader, libxml2 XMLReader (modeled after the .Net one), Java Common API for XML Pull Parsing (XmlPull) (don't confuse with JSR 173 "StAX") In the monolithic interface, the XML parser acts as a cursor over the event stream. You call next() and it points to the next event in the stream. From there, you can query its type (usually some integral constants) and call some methods to retrieve the data. All methods are always available on the object; calling one that is not appropriate for the current event (e.g. getTagName() for a Characters event) returns a null value or signals an error. Pro: Event objects do not need to be allocated. The parser itself contains the entire state and can, for example, be passed down a recursive function group. Contra: You cannot store raw events: calling next() overwrites the current data. The parser contains a lot of state. This interface does not protect you in any way from calling inappropriate methods. 2) The Inheritance Interface Examples: JSR 173 "StAX" In the inheritance interface, the event types are modeled as a group of classes that all inherit from an Event base class. The parser acts as an iterator, Java style; calling next() returns a reference/pointer to the event object for this event. You use RTTI or a similar mechanism to find the type of the event, then cast the reference to the appropriate subclass. The subclasses then provide access to the data that is actually available for this event type. Pro: Cannot call methods that are inappropriate for the event. Event objects are independent of the parser and can be stored as they are. This is especially interesting if you have an event-based output system that uses the same event type: in this case, you can store the events, shuffle them, edit them, then pass them on to the writer. A proper analog to the stateful parser is harder to design. The parser contains less state, as it does not need to store the data that is currently queried. Contra: Event objects need to be allocated on the heap. In a non-GC language like C++, this is even more of a problem than in Java, as you have to use either a smart pointer or have the user responsible for deleting the object. The scenario of a group of functions as mentioned above is limited insofar as that if some functions want to process the same event, they need to be passed the current event along with the parser. 3) The Variant Interface Examples: None. I believe I came up with this entirely on my own. The variant interface seeks to combine the strengths of the other two interfaces. It uses a non-monolithic interface, that is, the parser acts like an iterator and the data is not stored within it. It does not return a reference to the event object, though, but instead a boost::variant of all possible events. This way, heap allocation of the event object is avoided, together with all the trouble coming with that. The event type can be determined either by calling variant::which, or with a variant visitor (type-safe!), or with a special get_base() function that works like get() but can retrieve a reference to a common base of all the variant types. (This is possible, although an implementation does not exist in Boost.) Pro: Cannot call methods that are inappropriate. The visitor system allows type-safe usage. (Of course, it also loses you part of the advantage of a pull interface over a push interface.) Does not need heap allocation if the event classes are properly designed (i.e. not trigger the case where the variant allocates heap memory.) Events can be stored, copied (another advantage over the inheritance interface, which would require a clone() method for that), and manipulated at will. They can be pre-allocated, a reference passed to next(), to save even the stack allocation. Contra: The issue about a group of function still applies. Independently of the type of interface chosen, another issue is important: the scope of the interface. Should it report all XML events, including those coming from DTD parsing? Should this be a user choice, or should there perhaps be two interfaces, one "high-level" and one "low-level"? Should errors be reported as error events, or as exceptions? Should this, too, be a user choice? How about warnings: exceptions are inappropriate for them. Should it be possible to disable them completely? All comments are welcome. Sebastian Redl

8 19

[Boost-bugs] [ boost-Bugs-1588713 ] log normal dist - error in _nsigma equation?
by SourceForge.net 01 Nov '06

01 Nov '06

Bugs item #1588713, was opened at 2006-11-01 09:09 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1588713&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: random Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Jens Maurer (jmaurer) Summary: log normal dist - error in _nsigma equation? Initial Comment: Is there an extra "/_mean" in the equation for _nsigma on line 104 of lognormal_distribution.hpp? i.e. shouldn't it be: _nsigma = sqrt(log(_sigma*_sigma/_mean+result_type (1))); instead of: _nsigma = sqrt(log (_sigma*_sigma/_mean/_mean+result_type(1))); ?? Thanks for the great lib, John Eddy (jpeddy(a)sandia.gov) ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1588713&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 inspection notification (2006-11-01/RC_1_34_0) *X*
by Rene Rivera 01 Nov '06

01 Nov '06

Boost Inspection Report Run Date: 17:02:33 UTC, Wednesday 01 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11675 files scanned 906 directories scanned (including root) 157 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 89 broken links 22 unlinked files 7 file/directory names issues 1 files with tabs 0 violations of the Boost min/max guidelines 35 usages of unnamed namespaces in headers (including .ipp files) Summary: archive (3) bind (1) boost-root (1) build (3) date_time (1) doc (2) filesystem (36) graph (3) iostreams (2) lambda (3) mpl (1) multi_array (2) parameter (2) ptr_container (1) regex (1) regression (13) serialization (1) signals (1) test (79) type_traits (1) Details: *R* invalid (cr only) line-ending *A* invalid bookmarks, invalid urls, broken links, unlinked files *N* file/directory names issues *T* tabs in file *M* uses of min or max that have not been protected from the min/max macros, or unallowed #undef-s *U* unnamed namespace in header |archive| boost/archive/basic_streambuf_locale_saver.hpp: *N* name exceeds 31 characters boost/archive/impl/xml_wiarchive_impl.ipp: *U* unnamed namespace at line 53 boost/archive/iterators/remove_whitespace.hpp: *U* unnamed namespace at line 57 |bind| boost/bind/placeholders.hpp: *U* unnamed namespace at line 25 |boost-root| index.htm: *A* broken link: ../doc/html/signals.html |build| tools/build/v1/variables.html: *A* unlinked file tools/build/v2/example/make/main.cpp.pro: *N* name contains more than one dot character ('.') tools/build/v2/test/test_system.html: *A* unlinked file |date_time| libs/date_time/xmldoc/date_time_docs_howto.html: *A* unlinked file |doc| doc/html/boost_math/inverse_complex.html: *A* unlinked file doc/html/jam.html: *A* unlinked file |filesystem| libs/filesystem/doc/do-list.htm: *A* invalid URL (hardwired file): file://?/ *A* invalid URL (hardwired file): file://?/UNC/ libs/filesystem/doc/i18n.html: *A* broken link: convenience.htm#basic_recursive_directory_iterator *A* broken link: exception.htm *A* broken link: operations.htm *A* broken link: operations.htm#Do-the-right-thing *A* broken link: operations.htm#is_directory *A* broken link: operations.htm#is_file *A* broken link: operations.htm#status libs/filesystem/doc/index.htm: *A* broken link: 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: *N* name exceeds 31 characters libs/graph/doc/lengauer_tarjan_dominator_tree.htm: *N* name exceeds 31 characters libs/graph/doc/sorted_erdos_renyi_generator.html: *N* name exceeds 31 characters |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file |lambda| boost/lambda/core.hpp: *U* unnamed namespace at line 62 boost/lambda/detail/lambda_functors.hpp: *U* unnamed namespace at line 25 boost/lambda/exceptions.hpp: *U* unnamed namespace at line 24 |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 |parameter| libs/parameter/doc/html/python.html: *A* broken link: tag::x(int *A* broken link: tag::y*(int |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |regex| libs/regex/performance/input.html: *A* unlinked file |regression| regression/.htaccess: *N* leading character of ".htaccess" 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 |signals| boost/signals/detail/named_slot_map.hpp: *T* |test| boost/test/floating_point_comparison.hpp: *U* unnamed namespace at line 206 *U* unnamed namespace at line 228 boost/test/impl/cpp_main.ipp: *U* unnamed namespace at line 42 boost/test/impl/exception_safety.ipp: *U* unnamed namespace at line 400 boost/test/impl/framework.ipp: *U* unnamed namespace at line 199 boost/test/impl/plain_report_formatter.ipp: *U* unnamed namespace at line 45 boost/test/impl/progress_monitor.ipp: *U* unnamed namespace at line 38 boost/test/impl/results_collector.ipp: *U* unnamed namespace at line 106 boost/test/impl/results_reporter.ipp: *U* unnamed namespace at line 48 boost/test/impl/unit_test_log.ipp: *U* unnamed namespace at line 79 boost/test/impl/unit_test_monitor.ipp: *U* unnamed namespace at line 35 boost/test/impl/unit_test_parameters.ipp: *U* unnamed namespace at line 50 boost/test/results_collector.hpp: *U* unnamed namespace at line 40 boost/test/test_tools.hpp: *U* unnamed namespace at line 255 boost/test/utils/iterator/token_iterator.hpp: *U* unnamed namespace at line 166 boost/test/utils/named_params.hpp: *U* unnamed namespace at line 216 boost/test/utils/runtime/cla/dual_name_parameter.ipp: *U* unnamed namespace at line 43 boost/test/utils/runtime/cla/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/env/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/file/config_file.hpp: *U* unnamed namespace at line 169 *U* unnamed namespace at line 64 *U* unnamed namespace at line 74 boost/test/utils/runtime/file/config_file_iterator.hpp: *U* unnamed namespace at line 68 boost/test/utils/trivial_singleton.hpp: *U* unnamed namespace at line 52 *U* unnamed namespace at line 61 libs/test/build/msvc71_proj/config_file_iterator_test.vcproj: *N* name exceeds 31 characters libs/test/doc/components/prg_exec_monitor/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 |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file

1 0

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

01 Nov '06

Boost Inspection Report Run Date: 17:02:49 UTC, Wednesday 01 November 2006 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11675 files scanned 906 directories scanned (including root) 2169 problems reported Problem counts: 1414 files missing Boost license info or having wrong reference text 755 files missing copyright notice Summary: any (3) archive (1) array (3) assign (2) bind (9) boost-root (4) boostbook (70) build (423) compatibility (2) compose (2) concept_check (24) conversion (5) detail (4) disjoint_sets (6) doc (56) filesystem (7) format (12) function (17) functional (8) graph (180) inspect (1) integer (9) io (2) iostreams (2) lambda (14) libs (8) logic (2) math (1) mem_fn (2) more (31) mpl (425) multi_array (16) numeric (214) optional (3) people (90) pool (32) program_options (45) property_map (17) ptr_container (113) python (6) quickbook (11) random (22) range (18) rational (5) regex (4) regression (67) release (3) serialization (16) signals (32) smart_ptr (15) test (5) timer (3) tokenizer (9) tools (6) tr1 (2) tuple (9) utility (26) variant (43) wiki (2) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright notice |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: *L* libs/assign/ index.html: *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| / README: *C* boost.css: *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* tasks.xml: *C* *L* tutorial.xml: *C* *L* userman.xml: *C* *L* v1_vs_v2.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/ 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* 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/ 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* readme.txt: *C* *L* rebuilds.py: *C* *L* recursive.jam: *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_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* 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/ 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* doc/html/bbv2/ installation.html: *C* *L* doc/html/ boost_math.html: *C* *L* doc/html/boost_math/ gcd_lcm.html: *C* *L* inverse_complex.html: *C* *L* doc/html/ boost_staticassert.html: *C* *L* boost_tr1.html: *C* *L* boost_typetraits.html: *C* *L* doc/html/boost_typetraits/ background.html: *C* *L* doc/html/ boostbook.html: *C* *L* date_time.html: *C* *L* foreach.html: *C* *L* function.html: *C* *L* functionN.html: *C* *L* lambda.html: *C* *L* program_options.html: *C* *L* ref.html: *C* *L* reference.css: *C* *L* signals.html: *C* *L* string_algo.html: *C* *L* tribool.html: *C* *L* variant.html: *C* *L* who_s_using_boost_.html: *C* *L* xpressive.html: *C* *L* doc/src/ boost.xml: *C* *L* |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* breadth_first_search.html: *L* breadth_first_visit.html: *L* challenge.html: *L* circle_layout.html: *L* compressed_sparse_row.html: *L* connected_components.html: *L* constructing_algorithms.html: *L* copy_graph.html: *L* cuthill_mckee_ordering.html: *L* dag_shortest_paths.html: *L* default.css: *L* depth_first_search.html: *L* depth_first_visit.html: *L* dfs_visitor.html: *L* dijkstra_shortest_paths.html: *L* dijkstra_visitor.html: *L* distance_recorder.html: *L* edge_list.html: *L* edmunds_karp_max_flow.html: *L* exception.html: *L* faq.html: *L* libs/graph/doc/figs/ Makefile: *C* *L* libs/graph/doc/ file_dependency_example.html: *L* filtered_graph.html: *L* floyd_warshall_shortest.html: *L* fruchterman_reingold.html: *L* graph_coloring.html: *L* graph_concepts.html: *L* graph_theory_review.html: *L* graph_traits.html: *L* gursoy_atun_layout.html: *L* history.html: *L* incident.html: *L* incremental_components.html: *L* index.html: *L* inv_adjacency_iterator.html: *L* isomorphism.html: *L* johnson_all_pairs_shortest.html: *L* jwebfrob.pl: *C* *L* kamada_kawai_spring_layout.html: *L* kevin_bacon.html: *L* king_ordering.html: *L* known_problems.html: *L* kruskal_min_spanning_tree.html: *L* layout_tolerance.html: *C* *L* leda_conversion.html: *L* lengauer_tarjan_dominator_tree.htm: *L* minimum_degree_ordering.html: *L* null_visitor.html: *L* opposite.html: *L* predecessor_recorder.html: *L* prim_minimum_spanning_tree.html: *L* profile.htm: *L* property.html: *L* property_map.html: *L* property_writer.html: *L* publications.html: *L* push_relabel_max_flow.html: *L* python.html: *L* quick_tour.html: *L* random.html: *L* random_layout.html: *L* read_graphviz.html: *C* *L* read_graphviz.rst: *C* *L* reverse_graph.html: *L* sequential_vertex_coloring.html: *L* sloan_ordering.htm: *L* sloan_start_end_vertices.htm: *L* sparse_matrix_ordering.html: *L* stanford_graph.html: *L* strong_components.html: *L* subgraph.html: *L* table_of_contents.html: *L* time_stamper.html: *L* topological_sort.html: *L* transitive_closure.html: *L* transpose_graph.html: *L* trouble_shooting.html: *L* undirected_dfs.html: *L* users.html: *C* *L* using_adjacency_list.html: *L* using_property_maps.html: *L* visitor_concepts.html: *L* wavefront.htm: *L* write-graphviz.html: *L* 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* serialize.cpp: *C* *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* |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-apr-2006.html: *C* *L* report-jan-2006.html: *C* *L* more/writingdoc/ design.html: *L* index.html: *L* introduction.html: *L* structure.html: *L* more/writingdoc/template/ acknowledgments.html: *L* bibliography.html: *L* configuration.html: *L* definitions.html: *L* faq.html: *L* header.html: *L* index.html: *L* overview.html: *L* rationale.html: *L* |mpl| libs/mpl/doc/src/refmanual/ ASSERT.rst: *C* *L* ASSERT_MSG.rst: *C* *L* ASSERT_NOT.rst: *C* *L* ASSERT_RELATION.rst: *C* *L* AUX_LAMBDA_SUPPORT.rst: *C* *L* Acknowledgements.rst: *C* *L* Algorithms-Iteration.rst: *C* *L* Algorithms-Querying.rst: *C* *L* Algorithms-Runtime.rst: *C* *L* Algorithms-Transformation.rst: *C* *L* Algorithms.rst: *C* *L* AssociativeSequence.rst: *C* *L* BackExtensibleSequence.rst: *C* *L* BidirectionalIterator.rst: *C* *L* BidirectionalSequence.rst: *C* *L* CFG_NO_HAS_XXX.rst: *C* *L* CFG_NO_PREPROCESSED.rst: *C* *L* Categorized.rst: *C* *L* Data.rst: *C* *L* ExtensibleAssociativeSeq.rst: *C* *L* ExtensibleSequence.rst: *C* *L* ForwardIterator.rst: *C* *L* ForwardSequence.rst: *C* *L* FrontExtensibleSequence.rst: *C* *L* HAS_XXX_TRAIT_DEF.rst: *C* *L* HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L* Inserter.rst: *C* *L* IntegralConstant.rst: *C* *L* IntegralSequenceWrapper.rst: *C* *L* Iterators-Concepts.rst: *C* *L* Iterators-Metafunctions.rst: *C* *L* Iterators.rst: *C* *L* LIMIT_LIST_SIZE.rst: *C* *L* LIMIT_MAP_SIZE.rst: *C* *L* LIMIT_METAFUNCTION_ARITY.rst: *C* *L* LIMIT_SET_SIZE.rst: *C* *L* LIMIT_UNROLLING.rst: *C* *L* LIMIT_VECTOR_SIZE.rst: *C* *L* LambdaExpression.rst: *C* *L* Macros-Asserts.rst: *C* *L* Macros-Configuration.rst: *C* *L* Macros.rst: *C* *L* Metafunction.rst: *C* *L* MetafunctionClass.rst: *C* *L* Metafunctions-Arithmetic.rst: *C* *L* Metafunctions-Bitwise.rst: *C* *L* Metafunctions-Comparisons.rst: *C* *L* Metafunctions-Composition.rst: *C* *L* Metafunctions-Conditional.rst: *C* *L* Metafunctions-Invocation.rst: *C* *L* Metafunctions-Logical.rst: *C* *L* Metafunctions-Trivial.rst: *C* *L* Metafunctions-Type.rst: *C* *L* Metafunctions.rst: *C* *L* NumericMetafunction.rst: *C* *L* PlaceholderExpression.rst: *C* *L* Placeholders.rst: *C* *L* RandomAccessIterator.rst: *C* *L* RandomAccessSequence.rst: *C* *L* ReversibleAlgorithm.rst: *C* *L* Sequences-Classes.rst: *C* *L* Sequences-Concepts.rst: *C* *L* Sequences-Intrinsic.rst: *C* *L* Sequences-Views.rst: *C* *L* Sequences.rst: *C* *L* TagDispatchedMetafunction.rst: *C* *L* TrivialMetafunction.rst: *C* *L* VariadicSequence.rst: *C* *L* accumulate.rst: *C* *L* advance.rst: *C* *L* always.rst: *C* *L* and_.rst: *C* *L* apply.rst: *C* *L* apply_wrap.rst: *C* *L* arg.rst: *C* *L* at.rst: *C* *L* at_c.rst: *C* *L* back.rst: *C* *L* back_inserter.rst: *C* *L* begin.rst: *C* *L* bind.rst: *C* *L* bitand_.rst: *C* *L* bitor_.rst: *C* *L* bitxor_.rst: *C* *L* bool_.rst: *C* *L* clear.rst: *C* *L* contains.rst: *C* *L* copy.rst: *C* *L* copy_if.rst: *C* *L* count.rst: *C* *L* count_if.rst: *C* *L* deque.rst: *C* *L* deref.rst: *C* *L* distance.rst: *C* *L* divides.rst: *C* *L* empty.rst: *C* *L* empty_base.rst: *C* *L* empty_sequence.rst: *C* *L* end.rst: *C* *L* equal.rst: *C* *L* equal_to.rst: *C* *L* erase.rst: *C* *L* erase_key.rst: *C* *L* eval_if.rst: *C* *L* eval_if_c.rst: *C* *L* filter_view.rst: *C* *L* find.rst: *C* *L* find_if.rst: *C* *L* fold.rst: *C* *L* for_each.rst: *C* *L* front.rst: *C* *L* front_inserter.rst: *C* *L* greater.rst: *C* *L* greater_equal.rst: *C* *L* has_key.rst: *C* *L* identity.rst: *C* *L* if_.rst: *C* *L* if_c.rst: *C* *L* inherit.rst: *C* *L* inherit_linearly.rst: *C* *L* insert.rst: *C* *L* insert_range.rst: *C* *L* inserter_.rst: *C* *L* int_.rst: *C* *L* integral_c.rst: *C* *L* is_sequence.rst: *C* *L* iter_fold.rst: *C* *L* iter_fold_if.rst: *C* *L* iterator_category.rst: *C* *L* iterator_range.rst: *C* *L* joint_view.rst: *C* *L* key_type.rst: *C* *L* lambda.rst: *C* *L* less.rst: *C* *L* less_equal.rst: *C* *L* list.rst: *C* *L* list_c.rst: *C* *L* long_.rst: *C* *L* lower_bound.rst: *C* *L* map.rst: *C* *L* max.rst: *C* *L* max_element.rst: *C* *L* min.rst: *C* *L* min_element.rst: *C* *L* minus.rst: *C* *L* modulus.rst: *C* *L* multiplies.rst: *C* *L* negate.rst: *C* *L* next.rst: *C* *L* not_.rst: *C* *L* not_equal_to.rst: *C* *L* numeric_cast.rst: *C* *L* or_.rst: *C* *L* order.rst: *C* *L* pair.rst: *C* *L* partition.rst: *C* *L* plus.rst: *C* *L* pop_back.rst: *C* *L* pop_front.rst: *C* *L* preface.rst: *C* *L* prior.rst: *C* *L* protect.rst: *C* *L* push_back.rst: *C* *L* push_front.rst: *C* *L* quote.rst: *C* *L* range_c.rst: *C* *L* refmanual.py: *C* *L* remove.rst: *C* *L* remove_if.rst: *C* *L* replace.rst: *C* *L* replace_if.rst: *C* *L* reverse.rst: *C* *L* reverse_copy.rst: *C* *L* reverse_copy_if.rst: *C* *L* reverse_fold.rst: *C* *L* reverse_iter_fold.rst: *C* *L* reverse_partition.rst: *C* *L* reverse_remove.rst: *C* *L* reverse_remove_if.rst: *C* *L* reverse_replace.rst: *C* *L* reverse_replace_if.rst: *C* *L* reverse_stable_partition.rst: *C* *L* reverse_transform.rst: *C* *L* reverse_unique.rst: *C* *L* sequence_tag.rst: *C* *L* set.rst: *C* *L* set_c.rst: *C* *L* shift_left.rst: *C* *L* shift_right.rst: *C* *L* single_view.rst: *C* *L* size.rst: *C* *L* size_t.rst: *C* *L* sizeof_.rst: *C* *L* sort.rst: *C* *L* stable_partition.rst: *C* *L* terminology.rst: *C* *L* times.rst: *C* *L* transform.rst: *C* *L* transform_view.rst: *C* *L* unique.rst: *C* *L* unpack_args.rst: *C* *L* upper_bound.rst: *C* *L* value_type.rst: *C* *L* vector.rst: *C* *L* vector_c.rst: *C* *L* void_.rst: *C* *L* zip_view.rst: *C* *L* libs/mpl/doc/ style.css: *L* libs/mpl/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/ iterator_categories.html: *C* *L* reference.html: *L* libs/multi_array/doc/xml/ MultiArray.xml: *C* *L* const_multi_array_ref.xml: *C* *L* multi_array.xml: *C* *L* multi_array_ref.xml: *C* *L* reference.xml: *L* libs/multi_array/ 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* 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* |people| people/ aleksey_gurtovoy.htm: *C* *L* andreas_huber.html: *C* *L* beman_dawes.html: *C* *L* darin_adler.htm: *C* *L* daryle_walker.html: *C* *L* dietmar_kuehl.htm: *C* *L* doug_gregor.html: *C* *L* ed_brey.htm: *C* *L* eric_friedman.htm: *C* *L* fernando_cacciola.html: *C* *L* gary_powell.htm: *C* *L* gennadiy_rozental.htm: *C* *L* greg_colvin.htm: *C* *L* hartmut_kaiser.htm: *C* *L* herve_bronnimann.htm: *C* *L* howard_hinnant.htm: *C* *L* hubert_holin.html: *C* *L* jaakko_jarvi.htm: *C* *L* jeff_garland.html: *C* *L* jens_maurer.htm: *C* *L* jeremy_siek.htm: *C* *L* joaquin_lopez.htm: *C* *L* joel_de_guzman.htm: *C* *L* john_maddock.htm: *C* *L* jonathan_turkanis.htm: *C* *L* kevlin_henney.htm: *C* *L* liequan_lee.htm: *C* *L* mac_murrett.htm: *C* *L* mark_rodgers.htm: *C* *L* mat_marcus.htm: *C* *L* paul_mensonides.htm: *C* *L* paul_moore.htm: *C* *L* pavol_droba.htm: *C* *L* people.htm: *C* *L* peter_dimov.htm: *C* *L* ralf_w_grosse_kunstleve.htm: *C* *L* rene_rivera.htm: *C* *L* robert_ramey.htm: *C* *L* ronald_garcia.htm: *C* *L* samuel_krempp.htm: *C* *L* thomas_witt.html: *C* *L* thorsten_ottosen.html: *C* *L* vesa_karvonen.htm: *C* *L* vladimir_prus.htm: *C* *L* william_kempf.htm: *C* *L* |pool| boost/pool/detail/ pool_construct.bat: *L* pool_construct.sh: *L* pool_construct_simple.bat: *L* pool_construct_simple.sh: *L* libs/pool/ TODO.txt: *C* *L* libs/pool/doc/ concepts.html: *L* copyright.html: *L* libs/pool/doc/implementation/ alignment.html: *L* ct_gcd_lcm.html: *L* for.html: *L* gcd_lcm.html: *L* guard.html: *L* mutex.html: *L* object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* pool_construct.html: *L* simple_segregated_storage.html: *L* singleton.html: *L* singleton_pool.html: *L* libs/pool/doc/ index.html: *L* interfaces.html: *L* libs/pool/doc/interfaces/ object_pool.html: *L* pool.html: *L* pool_alloc.html: *L* simple_segregated_storage.html: *L* singleton_pool.html: *L* user_allocator.html: *L* libs/pool/doc/ pool.css: *L* 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| libs/python/doc/ internals.html: *L* internals.rst: *L* libs/python/test/ operators_wrapper.cpp: *C* *L* operators_wrapper.py: *C* *L* |quickbook| tools/quickbook/doc/ Jamfile.v2: *C* *L* tools/quickbook/doc/html/quickbook/ change_log.html: *L* intro.html: *L* ref.html: *L* syntax.html: *L* tools/quickbook/doc/html/quickbook/syntax/ block.html: *L* comments.html: *L* phrase.html: *L* tools/quickbook/ index.html: *C* *L* |random| libs/random/ index.html: *C* *L* nondet_random.html: *C* *L* random-concepts.html: *C* *L* random-distributions.html: *C* *L* random-generators.html: *C* *L* random-misc.html: *C* *L* random-performance.html: *C* *L* random-variate.html: *C* *L* libs/random/test/ Jamfile: *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* 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* |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* |tr1| boost/tr1/ tuple.hpp: *C* *L* |tuple| libs/tuple/doc/ design_decisions_rationale.html: *L* tuple_advanced_interface.html: *L* tuple_users_guide.html: *L* libs/tuple/ index.html: *C* *L* libs/tuple/test/ Jamfile: *C* *L* README: *C* *L* |utility| boost/ shared_container_iterator.hpp: *L* libs/utility/ Assignable.html: *L* Collection.html: *L* CopyConstructible.html: *L* LessThanComparable.html: *L* MultiPassInputIterator.html: *L* OptionalPointee.html: *L* assert.html: *L* call_traits.htm: *L* checked_delete.html: *L* compressed_pair.htm: *L* current_function.html: *L* enable_if.html: *L* generator_iterator.htm: *C* *L* index.html: *C* *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*

1 0

Bug Report
by Marshall Clow 01 Nov '06

01 Nov '06

[ Up from 89 ] Bug count: 90 13 dgregor 9 jsiek 8 vladimir_prus 6 beman_dawes 6 az_sw_dude 5 shammah 4 samuel_k 4 nobody 4 nesotto 4 grafik 3 jbandela 3 djowel 2 turkanis 2 mistevens 2 jmaurer 2 hubert_holin 2 alnsn 2 agurtovoy 1 urzuga 1 ramey 1 mclow 1 johnmaddock 1 fcacciola 1 ebf 1 dlwalker 1 daniel_wallin 1 chris_kohlhoff Assignee: agurtovoy <http://sourceforge.net/users/agurtovoy/> Summary: mpl::remove compile error with gcc 4.1.0 Bug #: 1453180 <http://sourceforge.net/tracker/index.php?func=detail&aid=1453180&group_id=7…> Assignee: agurtovoy <http://sourceforge.net/users/agurtovoy/> Summary: documentation mistake Bug #: 1497329 <http://sourceforge.net/tracker/index.php?func=detail&aid=1497329&group_id=7…> Assignee: alnsn <http://sourceforge.net/users/alnsn/> Summary: lexical_cast & pure virtual functions & VC 8 STL Bug #: 1358600 <http://sourceforge.net/tracker/index.php?func=detail&aid=1358600&group_id=7…> Assignee: alnsn <http://sourceforge.net/users/alnsn/> Summary: boost::any - typeid comparison across shared boundaries Bug #: 1577259 <http://sourceforge.net/tracker/index.php?func=detail&aid=1577259&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: wrong usage of ios_base::narrow Bug #: 989487 <http://sourceforge.net/tracker/index.php?func=detail&aid=989487&group_id=75…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: date_time type conversion warning Bug #: 1069225 <http://sourceforge.net/tracker/index.php?func=detail&aid=1069225&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: from_ftime incorrectly processes FILETIME filled with zeros Bug #: 1471025 <http://sourceforge.net/tracker/index.php?func=detail&aid=1471025&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: memory leak with boost::gregorian::date_facet Bug #: 1486232 <http://sourceforge.net/tracker/index.php?func=detail&aid=1486232&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: operator<< for gregorian::date_duration not found Bug #: 1498778 <http://sourceforge.net/tracker/index.php?func=detail&aid=1498778&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: local_time_facet error in VS2005 Win2003 Bug #: 1551784 <http://sourceforge.net/tracker/index.php?func=detail&aid=1551784&group_id=7…> Assignee: beman_dawes <http://sourceforge.net/users/beman_dawes/> Summary: linker error mingw 3.4.5 Bug #: 1426819 <http://sourceforge.net/tracker/index.php?func=detail&aid=1426819&group_id=7…> Assignee: beman_dawes <http://sourceforge.net/users/beman_dawes/> Summary: VC8 can't find windows.h even though environment is correct! Bug #: 1468124 <http://sourceforge.net/tracker/index.php?func=detail&aid=1468124&group_id=7…> Assignee: beman_dawes <http://sourceforge.net/users/beman_dawes/> Summary: Log level names wrong in documentation Bug #: 1475886 <http://sourceforge.net/tracker/index.php?func=detail&aid=1475886&group_id=7…> Assignee: beman_dawes <http://sourceforge.net/users/beman_dawes/> Summary: [filesystem] portable_posix_name() may fail on premain call Bug #: 1509633 <http://sourceforge.net/tracker/index.php?func=detail&aid=1509633&group_id=7…> Assignee: beman_dawes <http://sourceforge.net/users/beman_dawes/> Summary: significantly different timer class behaviour on Win and Lin Bug #: 1520489 <http://sourceforge.net/tracker/index.php?func=detail&aid=1520489&group_id=7…> Assignee: beman_dawes <http://sourceforge.net/users/beman_dawes/> Summary: directory_iterator doesn't work with catch Bug #: 1576175 <http://sourceforge.net/tracker/index.php?func=detail&aid=1576175&group_id=7…> Assignee: chris_kohlhoff <http://sourceforge.net/users/chris_kohlhoff/> Summary: asio redefine FD_SETSIZE macro Bug #: 1542376 <http://sourceforge.net/tracker/index.php?func=detail&aid=1542376&group_id=7…> Assignee: daniel_wallin <http://sourceforge.net/users/daniel_wallin/> Summary: [Parameter] Docco error section 2.7.2 Bug #: 1378446 <http://sourceforge.net/tracker/index.php?func=detail&aid=1378446&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: LEDA graph adaptors do not handle hidden nodes properly Bug #: 1168431 <http://sourceforge.net/tracker/index.php?func=detail&aid=1168431&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: random_vertex/random_edge are unnecessarily inefficient Bug #: 1204684 <http://sourceforge.net/tracker/index.php?func=detail&aid=1204684&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Document copy_component Bug #: 1204688 <http://sourceforge.net/tracker/index.php?func=detail&aid=1204688&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: reverse_graph and constness of property maps Bug #: 1246336 <http://sourceforge.net/tracker/index.php?func=detail&aid=1246336&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Bundled graph properties Bug #: 1420498 <http://sourceforge.net/tracker/index.php?func=detail&aid=1420498&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Dijkstra no_init version should not require VertexListGraph Bug #: 1540116 <http://sourceforge.net/tracker/index.php?func=detail&aid=1540116&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: GraphViz reader ignores graph properties Bug #: 1567797 <http://sourceforge.net/tracker/index.php?func=detail&aid=1567797&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Johnson All-Pairs needs better 'no path' information Bug #: 1567811 <http://sourceforge.net/tracker/index.php?func=detail&aid=1567811&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Numbered headers don't work with 'preferred' syntax Bug #: 1567812 <http://sourceforge.net/tracker/index.php?func=detail&aid=1567812&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Fruchterman-Reingold grid performance can be improved Bug #: 1567818 <http://sourceforge.net/tracker/index.php?func=detail&aid=1567818&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Const correctness violation Bug #: 1567821 <http://sourceforge.net/tracker/index.php?func=detail&aid=1567821&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Memory leaks in adjacency_list? Bug #: 1567828 <http://sourceforge.net/tracker/index.php?func=detail&aid=1567828&group_id=7…> Assignee: dgregor <http://sourceforge.net/users/dgregor/> Summary: Memory leaks with signal::connect? Bug #: 1567829 <http://sourceforge.net/tracker/index.php?func=detail&aid=1567829&group_id=7…> Assignee: djowel <http://sourceforge.net/users/djowel/> Summary: Miss ' = ParserT()' Bug #: 907299 <http://sourceforge.net/tracker/index.php?func=detail&aid=907299&group_id=75…> Assignee: djowel <http://sourceforge.net/users/djowel/> Summary: spirit insert_key_actor.hpp Bug #: 1059936 <http://sourceforge.net/tracker/index.php?func=detail&aid=1059936&group_id=7…> Assignee: djowel <http://sourceforge.net/users/djowel/> Summary: crash in boost::spirit::parse Bug #: 1509978 <http://sourceforge.net/tracker/index.php?func=detail&aid=1509978&group_id=7…> Assignee: dlwalker <http://sourceforge.net/users/dlwalker/> Summary: boost/crc.hpp uses non-standard conforming syntax Bug #: 1478435 <http://sourceforge.net/tracker/index.php?func=detail&aid=1478435&group_id=7…> Assignee: ebf <http://sourceforge.net/users/ebf/> Summary: ambiguous overloads in boost::variant source code Bug #: 1456780 <http://sourceforge.net/tracker/index.php?func=detail&aid=1456780&group_id=7…> Assignee: fcacciola <http://sourceforge.net/users/fcacciola/> Summary: Numeric Conversion Documentation minor bug Bug #: 1480954 <http://sourceforge.net/tracker/index.php?func=detail&aid=1480954&group_id=7…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: boost jam problem with parallel builds Bug #: 1234224 <http://sourceforge.net/tracker/index.php?func=detail&aid=1234224&group_id=7…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: boost.build needs fixes for HP/UX Bug #: 1395924 <http://sourceforge.net/tracker/index.php?func=detail&aid=1395924&group_id=7…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: Wrong .bat name in vc-8_0-x86_amd64-tools.jam Bug #: 1548427 <http://sourceforge.net/tracker/index.php?func=detail&aid=1548427&group_id=7…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: Generated files '@()' don't work in regular expressions. Bug #: 1549607 <http://sourceforge.net/tracker/index.php?func=detail&aid=1549607&group_id=7…> Assignee: hubert_holin <http://sourceforge.net/users/hubert_holin/> Summary: Cannot compile octonion_test.cpp because of bug in sinc.hpp Bug #: 751289 <http://sourceforge.net/tracker/index.php?func=detail&aid=751289&group_id=75…> Assignee: hubert_holin <http://sourceforge.net/users/hubert_holin/> Summary: octonion documentation bug Bug #: 1499814 <http://sourceforge.net/tracker/index.php?func=detail&aid=1499814&group_id=7…> Assignee: jbandela <http://sourceforge.net/users/jbandela/> Summary: Compiler error for tokenizer on Solaris Bug #: 976241 <http://sourceforge.net/tracker/index.php?func=detail&aid=976241&group_id=75…> Assignee: jbandela <http://sourceforge.net/users/jbandela/> Summary: token_iterator::at_end() result is inversed Bug #: 1338326 <http://sourceforge.net/tracker/index.php?func=detail&aid=1338326&group_id=7…> Assignee: jbandela <http://sourceforge.net/users/jbandela/> Summary: bug in char_separator Bug #: 1510041 <http://sourceforge.net/tracker/index.php?func=detail&aid=1510041&group_id=7…> Assignee: jmaurer <http://sourceforge.net/users/jmaurer/> Summary: Diff in state of mersenne_twister gen between GCC3.41 & CW9 Bug #: 1115124 <http://sourceforge.net/tracker/index.php?func=detail&aid=1115124&group_id=7…> Assignee: jmaurer <http://sourceforge.net/users/jmaurer/> Summary: uniform_01 copies engine instead of using a reference Bug #: 1464566 <http://sourceforge.net/tracker/index.php?func=detail&aid=1464566&group_id=7…> Assignee: johnmaddock <http://sourceforge.net/users/johnmaddock/> Summary: Adding boost::is_complex to type_traits.hpp Bug #: 1315712 <http://sourceforge.net/tracker/index.php?func=detail&aid=1315712&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: invalid result for File Dependency Examp Bug #: 551110 <http://sourceforge.net/tracker/index.php?func=detail&aid=551110&group_id=75…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: Spelling of Edmonds-Karp-Algorithm Bug #: 1226292 <http://sourceforge.net/tracker/index.php?func=detail&aid=1226292&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: g++ v3.2.3 inker error for read_graphviz ih boost v1.33.1 Bug #: 1378907 <http://sourceforge.net/tracker/index.php?func=detail&aid=1378907&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: Calling subgraph::global_to_local on a root graph Bug #: 1444271 <http://sourceforge.net/tracker/index.php?func=detail&aid=1444271&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: Calling subgraph::global_to_local on a root graph Bug #: 1444293 <http://sourceforge.net/tracker/index.php?func=detail&aid=1444293&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: strange compiling problem for transitive_closure Bug #: 1489545 <http://sourceforge.net/tracker/index.php?func=detail&aid=1489545&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: 'edmunds_karps' Bug #: 1497880 <http://sourceforge.net/tracker/index.php?func=detail&aid=1497880&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: boost::none redifinition Bug #: 1571176 <http://sourceforge.net/tracker/index.php?func=detail&aid=1571176&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: boost::none redifinition Bug #: 1571188 <http://sourceforge.net/tracker/index.php?func=detail&aid=1571188&group_id=7…> Assignee: mclow <http://sourceforge.net/users/mclow/> Summary: Solaris - once.cpp compile error Bug #: 549162 <http://sourceforge.net/tracker/index.php?func=detail&aid=549162&group_id=75…> Assignee: mistevens <http://sourceforge.net/users/mistevens/> Summary: does uBLAS provide some advanse methods Bug #: 1516834 <http://sourceforge.net/tracker/index.php?func=detail&aid=1516834&group_id=7…> Assignee: mistevens <http://sourceforge.net/users/mistevens/> Summary: ublas: bug in mapped_vector_of_mapped_vector Bug #: 1528178 <http://sourceforge.net/tracker/index.php?func=detail&aid=1528178&group_id=7…> Assignee: nesotto <http://sourceforge.net/users/nesotto/> Summary: boost.range and 'const char[]'. Bug #: 1272315 <http://sourceforge.net/tracker/index.php?func=detail&aid=1272315&group_id=7…> Assignee: nesotto <http://sourceforge.net/users/nesotto/> Summary: [Boost.Range]boost::const_begin calls non-qualified 'begin' Bug #: 1361686 <http://sourceforge.net/tracker/index.php?func=detail&aid=1361686&group_id=7…> Assignee: nesotto <http://sourceforge.net/users/nesotto/> Summary: bug in boost::range_detail Bug #: 1484477 <http://sourceforge.net/tracker/index.php?func=detail&aid=1484477&group_id=7…> Assignee: nesotto <http://sourceforge.net/users/nesotto/> Summary: The ptr_map iterator cannot be dereference to value type Bug #: 1566672 <http://sourceforge.net/tracker/index.php?func=detail&aid=1566672&group_id=7…> Assignee: nobody Summary: Shmem serious bugs Bug #: 1518563 <http://sourceforge.net/tracker/index.php?func=detail&aid=1518563&group_id=7…> Assignee: nobody Summary: Changing size of memory-mapped file on Windows Bug #: 1532684 <http://sourceforge.net/tracker/index.php?func=detail&aid=1532684&group_id=7…> Assignee: nobody Summary: optional documentation Bug #: 1587134 <http://sourceforge.net/tracker/index.php?func=detail&aid=1587134&group_id=7…> Assignee: nobody Summary: 'Bug' in comment Bug #: 1588359 <http://sourceforge.net/tracker/index.php?func=detail&aid=1588359&group_id=7…> Assignee: ramey <http://sourceforge.net/users/ramey/> Summary: xml serialization fails when using namespace Bug #: 1580489 <http://sourceforge.net/tracker/index.php?func=detail&aid=1580489&group_id=7…> Assignee: samuel_k <http://sourceforge.net/users/samuel_k/> Summary: format: assert when parsing invalid pattern Bug #: 1326132 <http://sourceforge.net/tracker/index.php?func=detail&aid=1326132&group_id=7…> Assignee: samuel_k <http://sourceforge.net/users/samuel_k/> Summary: boost::format parse method doesn't work Bug #: 1439607 <http://sourceforge.net/tracker/index.php?func=detail&aid=1439607&group_id=7…> Assignee: samuel_k <http://sourceforge.net/users/samuel_k/> Summary: 64 bit compile warning/error for boost::format Bug #: 1451470 <http://sourceforge.net/tracker/index.php?func=detail&aid=1451470&group_id=7…> Assignee: samuel_k <http://sourceforge.net/users/samuel_k/> Summary: format zero length string msvc-8 Bug #: 1537844 <http://sourceforge.net/tracker/index.php?func=detail&aid=1537844&group_id=7…> Assignee: shammah <http://sourceforge.net/users/shammah/> Summary: ct_gcd_lcm.hpp compilation error Bug #: 558174 <http://sourceforge.net/tracker/index.php?func=detail&aid=558174&group_id=75…> Assignee: shammah <http://sourceforge.net/users/shammah/> Summary: pool::purge_memory() does not reset next_size Bug #: 984124 <http://sourceforge.net/tracker/index.php?func=detail&aid=984124&group_id=75…> Assignee: shammah <http://sourceforge.net/users/shammah/> Summary: Borland compiler error with Pool, boost::pool_allocator Bug #: 988124 <http://sourceforge.net/tracker/index.php?func=detail&aid=988124&group_id=75…> Assignee: shammah <http://sourceforge.net/users/shammah/> Summary: perfomance: memory cleanup for pool takes too long Bug #: 995270 <http://sourceforge.net/tracker/index.php?func=detail&aid=995270&group_id=75…> Assignee: shammah <http://sourceforge.net/users/shammah/> Summary: boost::pool_allocator breaks with vector of vectors Bug #: 1179641 <http://sourceforge.net/tracker/index.php?func=detail&aid=1179641&group_id=7…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: rational operator&lt; can overflow Bug #: 798357 <http://sourceforge.net/tracker/index.php?func=detail&aid=798357&group_id=75…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: problem with boost::iostreams when compiled with Visual C++ Bug #: 1365752 <http://sourceforge.net/tracker/index.php?func=detail&aid=1365752&group_id=7…> Assignee: urzuga <http://sourceforge.net/users/urzuga/> Summary: [boost::lambda] Compile error with libstdc++ debug mode Bug #: 1444052 <http://sourceforge.net/tracker/index.php?func=detail&aid=1444052&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: multitoken broken in program_options 1.33 Bug #: 1266877 <http://sourceforge.net/tracker/index.php?func=detail&aid=1266877&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: Fixes for build on IBM pSeries for AIX and Linux Bug #: 1446471 <http://sourceforge.net/tracker/index.php?func=detail&aid=1446471&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: Boost Jam, and non english directorys Bug #: 1480900 <http://sourceforge.net/tracker/index.php?func=detail&aid=1480900&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: program_options: format_paragraph assert fails on long line Bug #: 1485069 <http://sourceforge.net/tracker/index.php?func=detail&aid=1485069&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: boost 1.33.1 build error Bug #: 1487256 <http://sourceforge.net/tracker/index.php?func=detail&aid=1487256&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: [program_options] Endless loop with long default arguments Bug #: 1528399 <http://sourceforge.net/tracker/index.php?func=detail&aid=1528399&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: Parameter reversal in program_options documentation Bug #: 1574213 <http://sourceforge.net/tracker/index.php?func=detail&aid=1574213&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: Function name error in program_options documentation Bug #: 1574751 <http://sourceforge.net/tracker/index.php?func=detail&aid=1574751&group_id=7…> -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

Patches report
by Marshall Clow 01 Nov '06

01 Nov '06

[ Unchanged ] Patch count: 18 4 turkanis 3 vladimir_prus 3 nobody 1 rogeeff 1 rgarcia 1 ramey 1 pdimov 1 johnmaddock 1 dlwalker 1 david_abrahams 1 agurtovoy Assignee: agurtovoy <http://sourceforge.net/users/agurtovoy/> Summary: Adjusts mpl::pair concept to be compatible with STL pairs Bug #: 1489713 <http://sourceforge.net/tracker/index.php?func=detail&aid=1489713&group_id=7…> Assignee: david_abrahams <http://sourceforge.net/users/david_abrahams/> Summary: opaque_pointer bug fix + enhancement Bug #: 1557285 <http://sourceforge.net/tracker/index.php?func=detail&aid=1557285&group_id=7…> Assignee: dlwalker <http://sourceforge.net/users/dlwalker/> Summary: [integer] add support for integers longer than long Bug #: 1507034 <http://sourceforge.net/tracker/index.php?func=detail&aid=1507034&group_id=7…> Assignee: johnmaddock <http://sourceforge.net/users/johnmaddock/> Summary: [config] evc4 port Bug #: 1489359 <http://sourceforge.net/tracker/index.php?func=detail&aid=1489359&group_id=7…> Assignee: nobody Summary: [thread] evc4 port Bug #: 1498914 <http://sourceforge.net/tracker/index.php?func=detail&aid=1498914&group_id=7…> Assignee: nobody Summary: [mpl] evc4 port Bug #: 1583396 <http://sourceforge.net/tracker/index.php?func=detail&aid=1583396&group_id=7…> Assignee: nobody Summary: [test] evc4 issue with SEH support Bug #: 1583399 <http://sourceforge.net/tracker/index.php?func=detail&aid=1583399&group_id=7…> Assignee: pdimov <http://sourceforge.net/users/pdimov/> Summary: [shared_ptr] support for STLport 5's no-iostreams mode Bug #: 1551992 <http://sourceforge.net/tracker/index.php?func=detail&aid=1551992&group_id=7…> Assignee: ramey <http://sourceforge.net/users/ramey/> Summary: [serialization] comment out unused variables Bug #: 1506528 <http://sourceforge.net/tracker/index.php?func=detail&aid=1506528&group_id=7…> Assignee: rgarcia <http://sourceforge.net/users/rgarcia/> Summary: [concept_check.hpp] remove unused variable warning in msvc Bug #: 1388901 <http://sourceforge.net/tracker/index.php?func=detail&aid=1388901&group_id=7…> Assignee: rogeeff <http://sourceforge.net/users/rogeeff/> Summary: [test] no eh exception handling functions on evc4 Bug #: 1499418 <http://sourceforge.net/tracker/index.php?func=detail&aid=1499418&group_id=7…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: rational::operator< fails for unsigned value types Bug #: 1434821 <http://sourceforge.net/tracker/index.php?func=detail&aid=1434821&group_id=7…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: rational.hpp::gcd returns a negative value sometimes Bug #: 1438626 <http://sourceforge.net/tracker/index.php?func=detail&aid=1438626&group_id=7…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: rational::operator<(rational) fails due to overflow Bug #: 1438991 <http://sourceforge.net/tracker/index.php?func=detail&aid=1438991&group_id=7…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: iostreams // file_descriptor::seek BUG on files > 4 GB Bug #: 1452698 <http://sourceforge.net/tracker/index.php?func=detail&aid=1452698&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: [program_options] static const variable on evc4 Bug #: 1499420 <http://sourceforge.net/tracker/index.php?func=detail&aid=1499420&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: [program_options] putenv on Solaris Bug #: 1568191 <http://sourceforge.net/tracker/index.php?func=detail&aid=1568191&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: VC80-Compatible String Processing in format_paragraph() Bug #: 1580068 <http://sourceforge.net/tracker/index.php?func=detail&aid=1580068&group_id=7…> -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

Support requests report
by Marshall Clow 01 Nov '06

01 Nov '06

[ Unchanged ] Support count: 54 26 nobody 4 grafik 4 az_sw_dude 3 vladimir_prus 3 jsiek 2 turkanis 2 mistevens 2 johnmaddock 2 djowel 1 urzuga 1 speedsnail 1 samuel_k 1 ramey 1 jbandela 1 fcacciola Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: Boost 1.32.0: Compiler erros for msvc-stlport toolset Bug #: 1106566 <http://sourceforge.net/tracker/index.php?func=detail&aid=1106566&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: Building errors on windows with vc71stlport Bug #: 1205155 <http://sourceforge.net/tracker/index.php?func=detail&aid=1205155&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: support new 2007 DST rules for timezone db Bug #: 1471723 <http://sourceforge.net/tracker/index.php?func=detail&aid=1471723&group_id=7…> Assignee: az_sw_dude <http://sourceforge.net/users/az_sw_dude/> Summary: new timezone db file for #1471723 - 2007 DST support Bug #: 1478619 <http://sourceforge.net/tracker/index.php?func=detail&aid=1478619&group_id=7…> Assignee: djowel <http://sourceforge.net/users/djowel/> Summary: Spirit does not compile on aCC Bug #: 1098070 <http://sourceforge.net/tracker/index.php?func=detail&aid=1098070&group_id=7…> Assignee: djowel <http://sourceforge.net/users/djowel/> Summary: spirit Bug #: 1481295 <http://sourceforge.net/tracker/index.php?func=detail&aid=1481295&group_id=7…> Assignee: fcacciola <http://sourceforge.net/users/fcacciola/> Summary: boost::optional<enum> fails with /CLR Bug #: 973424 <http://sourceforge.net/tracker/index.php?func=detail&aid=973424&group_id=75…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: Jam Fails to Build Bug #: 954048 <http://sourceforge.net/tracker/index.php?func=detail&aid=954048&group_id=75…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: Compiling only needed version Bug #: 1377001 <http://sourceforge.net/tracker/index.php?func=detail&aid=1377001&group_id=7…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: libraries won't build Bug #: 1524001 <http://sourceforge.net/tracker/index.php?func=detail&aid=1524001&group_id=7…> Assignee: grafik <http://sourceforge.net/users/grafik/> Summary: Having some trouble building boost Bug #: 1534701 <http://sourceforge.net/tracker/index.php?func=detail&aid=1534701&group_id=7…> Assignee: jbandela <http://sourceforge.net/users/jbandela/> Summary: Visual C++ 'Language Extensions' support Bug #: 1039338 <http://sourceforge.net/tracker/index.php?func=detail&aid=1039338&group_id=7…> Assignee: johnmaddock <http://sourceforge.net/users/johnmaddock/> Summary: Regex Bug #: 1156957 <http://sourceforge.net/tracker/index.php?func=detail&aid=1156957&group_id=7…> Assignee: johnmaddock <http://sourceforge.net/users/johnmaddock/> Summary: regex - perl syntax affects what gets matched Bug #: 1519824 <http://sourceforge.net/tracker/index.php?func=detail&aid=1519824&group_id=7…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: Boost with Dinkumware C++ Library !? Bug #: 531963 <http://sourceforge.net/tracker/index.php?func=detail&aid=531963&group_id=75…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: creating my own properties Bug #: 619615 <http://sourceforge.net/tracker/index.php?func=detail&aid=619615&group_id=75…> Assignee: jsiek <http://sourceforge.net/users/jsiek/> Summary: Max Flow Algorithm Bug #: 1445526 <http://sourceforge.net/tracker/index.php?func=detail&aid=1445526&group_id=7…> Assignee: mistevens <http://sourceforge.net/users/mistevens/> Summary: ublas extendability1 Bug #: 1091151 <http://sourceforge.net/tracker/index.php?func=detail&aid=1091151&group_id=7…> Assignee: mistevens <http://sourceforge.net/users/mistevens/> Summary: ublas extendability 2 Bug #: 1091153 <http://sourceforge.net/tracker/index.php?func=detail&aid=1091153&group_id=7…> Assignee: nobody Summary: configure problem with aCC Bug #: 811040 <http://sourceforge.net/tracker/index.php?func=detail&aid=811040&group_id=75…> Assignee: nobody Summary: Problem compiling :/ Bug #: 942349 <http://sourceforge.net/tracker/index.php?func=detail&aid=942349&group_id=75…> Assignee: nobody Summary: boost for ARM platform? Bug #: 957850 <http://sourceforge.net/tracker/index.php?func=detail&aid=957850&group_id=75…> Assignee: nobody Summary: problem with debug builds on Solaris Bug #: 965747 <http://sourceforge.net/tracker/index.php?func=detail&aid=965747&group_id=75…> Assignee: nobody Summary: SLOOOWW tokenizer compilation on VC++6.0 Bug #: 969590 <http://sourceforge.net/tracker/index.php?func=detail&aid=969590&group_id=75…> Assignee: nobody Summary: BOOST ON WIN CE Bug #: 1101724 <http://sourceforge.net/tracker/index.php?func=detail&aid=1101724&group_id=7…> Assignee: nobody Summary: Error: Template with C linkage Bug #: 1109438 <http://sourceforge.net/tracker/index.php?func=detail&aid=1109438&group_id=7…> Assignee: nobody Summary: Link VC6 to Boost Bug #: 1118381 <http://sourceforge.net/tracker/index.php?func=detail&aid=1118381&group_id=7…> Assignee: nobody Summary: Boost on opteron AMD Bug #: 1200700 <http://sourceforge.net/tracker/index.php?func=detail&aid=1200700&group_id=7…> Assignee: nobody Summary: Linker Problems with VC .NET 2003 / STLPort / Boost Bug #: 1292345 <http://sourceforge.net/tracker/index.php?func=detail&aid=1292345&group_id=7…> Assignee: nobody Summary: Unable to build boost with Dinkumware STL version 4.02 Bug #: 1336312 <http://sourceforge.net/tracker/index.php?func=detail&aid=1336312&group_id=7…> Assignee: nobody Summary: Problem running configure for unsupported platform Bug #: 1339778 <http://sourceforge.net/tracker/index.php?func=detail&aid=1339778&group_id=7…> Assignee: nobody Summary: Configuration Bug #: 1380808 <http://sourceforge.net/tracker/index.php?func=detail&aid=1380808&group_id=7…> Assignee: nobody Summary: Embedded python won't compile Bug #: 1391956 <http://sourceforge.net/tracker/index.php?func=detail&aid=1391956&group_id=7…> Assignee: nobody Summary: Building universal binary on MacOSX Bug #: 1409774 <http://sourceforge.net/tracker/index.php?func=detail&aid=1409774&group_id=7…> Assignee: nobody Summary: symbian os Bug #: 1428189 <http://sourceforge.net/tracker/index.php?func=detail&aid=1428189&group_id=7…> Assignee: nobody Summary: Cross compiling boost for Windows CE (ARM) from VS2005 Bug #: 1457763 <http://sourceforge.net/tracker/index.php?func=detail&aid=1457763&group_id=7…> Assignee: nobody Summary: compiler is out of heap space in pass 2 Bug #: 1481122 <http://sourceforge.net/tracker/index.php?func=detail&aid=1481122&group_id=7…> Assignee: nobody Summary: Boost.Build v2 build script help for evc4 Bug #: 1498919 <http://sourceforge.net/tracker/index.php?func=detail&aid=1498919&group_id=7…> Assignee: nobody Summary: Compiling Shmem Bug #: 1504379 <http://sourceforge.net/tracker/index.php?func=detail&aid=1504379&group_id=7…> Assignee: nobody Summary: Bjam build should support attachment of individual build ids Bug #: 1530168 <http://sourceforge.net/tracker/index.php?func=detail&aid=1530168&group_id=7…> Assignee: nobody Summary: Having problems with building boost Bug #: 1545941 <http://sourceforge.net/tracker/index.php?func=detail&aid=1545941&group_id=7…> Assignee: nobody Summary: Building Boost with Open Watcom Compiler Bug #: 1547257 <http://sourceforge.net/tracker/index.php?func=detail&aid=1547257&group_id=7…> Assignee: nobody Summary: '-shared' not supported for linking under MacOS X Bug #: 1553825 <http://sourceforge.net/tracker/index.php?func=detail&aid=1553825&group_id=7…> Assignee: nobody Summary: failing on 6 targets in MacOS X Bug #: 1572712 <http://sourceforge.net/tracker/index.php?func=detail&aid=1572712&group_id=7…> Assignee: nobody Summary: bjam: command not found Bug #: 1586479 <http://sourceforge.net/tracker/index.php?func=detail&aid=1586479&group_id=7…> Assignee: ramey <http://sourceforge.net/users/ramey/> Summary: Serialization lib missing Bug #: 1301634 <http://sourceforge.net/tracker/index.php?func=detail&aid=1301634&group_id=7…> Assignee: samuel_k <http://sourceforge.net/users/samuel_k/> Summary: Boost.Format doesn't work on MSVC with /vd2 compiler option Bug #: 1545133 <http://sourceforge.net/tracker/index.php?func=detail&aid=1545133&group_id=7…> Assignee: speedsnail <http://sourceforge.net/users/speedsnail/> Summary: Multithreaded process pausing but not deadlocking or crashin Bug #: 1280829 <http://sourceforge.net/tracker/index.php?func=detail&aid=1280829&group_id=7…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: Boost.Iostreams and newline translation Bug #: 1299123 <http://sourceforge.net/tracker/index.php?func=detail&aid=1299123&group_id=7…> Assignee: turkanis <http://sourceforge.net/users/turkanis/> Summary: boost.iostreams file_descriptor and sharing Bug #: 1445474 <http://sourceforge.net/tracker/index.php?func=detail&aid=1445474&group_id=7…> Assignee: urzuga <http://sourceforge.net/users/urzuga/> Summary: lambda vs pure virtual functions Bug #: 1231445 <http://sourceforge.net/tracker/index.php?func=detail&aid=1231445&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: program_options Can one have options with optional values? Bug #: 1102652 <http://sourceforge.net/tracker/index.php?func=detail&aid=1102652&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: program_options Can one have options with optional values? Bug #: 1102664 <http://sourceforge.net/tracker/index.php?func=detail&aid=1102664&group_id=7…> Assignee: vladimir_prus <http://sourceforge.net/users/vladimir_prus/> Summary: program_options bug? Bug #: 1114084 <http://sourceforge.net/tracker/index.php?func=detail&aid=1114084&group_id=7…> -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0

[thread] A simply static initializeable mutex
by Roland Schwarz 01 Nov '06

01 Nov '06

Triggered by the question how to do static initialization of a mutex, I tried to write one that is. The most basic initialization that wil be performed by the compiler, is zero initialization of static (POD) objects. This kind of initialization will take place before any other initializations. Consequently the mutex is initialized by its mere declaration. However this does come at a price: 1) Since the mutex has no ctor, one must not forget to initialize it when using it as a member of some containing object. But this is the same as with other POD's. 2) Altough the mutex is copyable this does not make any sense. The identifying property of a mutex is its memory address. Trying to lock a copied mutex will get you in trouble. It is not possible to protect against such usage since we have no ctor that could be declared private. On the other side you can make a object that contains a mutex copyable by simply reinitializing it to zero, which is not possible with the current mutex, since copying is strictly prohibited. I appended to this mail my first attempt to implement such a mutex . The code is commented and a pingpong test is included as example. So far this is only for windows. I would be very interested to get feedback about this idea. Roland // Copyright (C) 2006 Roland Schwarz // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef MUTEX_HPP__ #define MUTEX_HPP__ class scoped_lock; class semaphore; typedef scoped_lock* volatile mutex; class scoped_lock { public: scoped_lock(mutex& m, bool initially_locked = true); ~scoped_lock(); void lock(); void unlock(); private: bool is_locked; mutex* pmutex; scoped_lock* next_lock; scoped_lock* pred_lock; semaphore* volatile next_flag; semaphore* volatile sema_flag; semaphore* sema; void set(semaphore* volatile* pflag); void wait_for(semaphore* volatile* pflag); }; #endif // Copyright (C) 2006 Roland Schwarz // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // This is an experimental implementation of a mutex // that is of type POD. I.e. typedef scoped_lock* volatile mutex; // An unowned mutex has value 0. Consequently there is no need // for dynamic initialization, which solves the static // initialization problem. // Furthermore it also is not necessary to e.g. // mutex mx = 0; because static objects are zero initialized // by default, before any other initializations take place. // As such, availability of this mutex type makes a once // function unnecessary. // // Memory and resource management is fully automatic. I.e. // no leaks under normal usage. (In the basic version no cleanup // in the atexit handler is required.) The implementation needs // availability of some atomic primitives and semaphores // from the operating system. // // The required data structures are all within a scoped_lock // object. Destruction of the lock also frees up the resources. // // Typical usage: // mutex mx; // void foo() // { // scoped_lock lk(mx); // ... // } // // How does it work: // The scoped_lock object contains a doubly linked list. // The mutex is pointing to the head of this list. When // the mutex is zero the list ist empty and the mutex // unowned. // Locking the mutex means putting a list entry to the // head of the list. This is done atomically. Concurrent // requests are queued up, and each put on a separate // semaphore. This scheme already could be used by itself // (see e.g mcs-locks in win32 pthreads), however it // imposes a FIFO scheduling behaviour. // This implementation instead uses this queue only during // the build up, and then hands over the waiting to a // shared semaphore, to let the system scheduler wake up // the threads. The doubly linked list makes it possible // to remove list items from the list in an arbitrary // order. // // Performance: // I did only a minimalistic "pingpong" test, which showed // comparable performance to the current boost::mutex. // I expect that the performance can be improved, if the // semaphore objects are not completeley destroyed after // temporary use, but instead put in a lock free container // for later reuse. This however would raise the requirement // to destroy them during atexit. // // Missing parts: // I havent tried yet if it is possible to also provide // try and timed lock variants. // Altough I tried to take care of the necessary memory // barriers for SMP, I am not convinced yet that I got it // straight in this first attempt. // Also I have not yet been able to prove the correctness of // the algorithm. #include "mutex.hpp" // The operating system dependent part #include <windows.h> #include <limits.h> #include <cassert> template<class T> inline T* atomic_swap_full(T* volatile * p, T* a) { return (T*)InterlockedExchangePointer(p,a); } template<class T> inline T* atomic_load_full(T* volatile *p) { return (T*)InterlockedExchangeAdd((LPLONG)p,0); } template<class T> inline bool atomic_bool_compare_and_swap_full(T* volatile *p, T* c, T* s) { return (c == (T*)InterlockedCompareExchange((LPLONG)p,(LONG)s,(LONG)c)); } template<class T> inline T* atomic_compare_and_swap_full(T* volatile *p, T* c, T* s) { return (T*)InterlockedCompareExchange((LPLONG)p,(LONG)s,(LONG)c); } class semaphore { public: // The open and close functions could be extended // to put the closed items onto a lock free // container instead. static semaphore* open(int count = 0) { return new semaphore(count); } static void close(semaphore* sema) { delete sema; } void post() { ReleaseSemaphore(sem, 1, NULL); } void wait() { WaitForSingleObject(sem, INFINITE); } private: semaphore(int count) { sem = CreateSemaphore(NULL, count, LONG_MAX, NULL); } ~semaphore() { CloseHandle(sem); } HANDLE sem; }; // The following should be operating system independent scoped_lock::scoped_lock(mutex& m, bool initially_locked) : is_locked(false) { pmutex = &m; if (initially_locked) lock(); } scoped_lock::~scoped_lock() { if (is_locked) unlock(); } void scoped_lock::lock() { assert(!is_locked); next_lock = 0; pred_lock = 0; sema_flag = 0; next_flag = 0; scoped_lock* pred = atomic_swap_full(pmutex, this); if (0 != pred) { pred_lock = pred; pred->next_lock = this; wait_for(&pred->sema_flag); // pass on the shared semaphore sema = pred->sema; set(&sema_flag); set(&pred->next_flag); sema->wait(); } else { // create the shared semaphore sema = semaphore::open(); set(&sema_flag); } is_locked = true; } void scoped_lock::unlock() { assert(is_locked); scoped_lock* n = atomic_load_full(&next_lock); if (0 == n) { if (0 != pred_lock) { pred_lock->next_lock = 0; pred_lock->next_flag = 0; } if (atomic_bool_compare_and_swap_full(pmutex,this,pred_lock)) { if (0 == pred_lock) { // We have no predecessor and are the last // to hold this semaphore. Sucessors wil get // a fresh semaphore for this mutex. // Release it. semaphore::close(sema); } else { // We have been removed from the head, but have // a predecessor to wake up. sema->post(); } is_locked = false; return; } wait_for(&next_flag); n = atomic_load_full(&next_lock); } else { wait_for(&next_flag); } if (0 != pred_lock) pred_lock->next_lock = n; n->pred_lock = pred_lock; sema->post(); is_locked = false; } void scoped_lock::set(semaphore* volatile* pflag) { // If unflagged the value is 0. // The special value -1 is getting used when set is called // before a wait takes place. Since this is an illegal memory // address be careful not to call set again without having // reset the flag in between! semaphore* f = atomic_compare_and_swap_full(pflag,(semaphore*)0,(semaphore*)-1); if (0 != f) { f->post(); } } void scoped_lock::wait_for(semaphore* volatile* pflag) { if (0 == atomic_load_full(pflag)) { semaphore* f = semaphore::open(); if (atomic_bool_compare_and_swap_full(pflag,(semaphore*)0,f)) { f->wait(); } semaphore::close(f); } } // Copyright (C) 2006 Roland Schwarz // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #include "mutex.hpp" #include <iostream> #include <ctime> #include <boost/thread/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/condition.hpp> #include <boost/bind.hpp> // set to 0 if you want to test against boost::mutex #if 1 typedef mutex test_mutex; typedef scoped_lock test_lock; #else typedef boost::mutex test_mutex; typedef boost::mutex::scoped_lock test_lock; #endif test_mutex mtx0; test_mutex mtx1; test_mutex mtx2; test_mutex mtx3; boost::mutex smx; boost::condition cs; bool start = false; void pingpong(long int turns) { test_lock lk0(mtx0, false); test_lock lk1(mtx1, true); test_lock lk2(mtx2, false); test_lock lk3(mtx3, true); boost::mutex::scoped_lock lkstart(smx); start = true; cs.notify_one(); lkstart.unlock(); for (long int i=0; i<turns; ++i) { lk0.lock(); lk1.unlock(); lk2.lock(); lk3.unlock(); lk1.lock(); lk0.unlock(); lk3.lock(); lk2.unlock(); } } // this needed about 30 sec on my machine const long int N = 1000000; int main(int argc, char* argv[]) { // pingpong timing test test_lock lk0(mtx0, true); test_lock lk1(mtx1, false); test_lock lk2(mtx2, true); test_lock lk3(mtx3, false); boost::mutex::scoped_lock lkstart(smx); boost::thread thd(boost::bind(pingpong, N)); while (!start) cs.wait(lkstart); std::time_t t0 = std::time(0); for (long int i=0; i<N; ++i) { lk0.unlock(); lk1.lock(); lk2.unlock(); lk3.lock(); lk1.unlock(); lk0.lock(); lk3.unlock(); lk2.lock(); } std::time_t t1 = std::time(0); std::cout << "time: " << t1-t0 << std::endl; thd.join(); return 0; }

6 29

[Boost-bugs] [ boost-Bugs-1588359 ] "Bug" in comment
by SourceForge.net 01 Nov '06

01 Nov '06

Bugs item #1588359, was opened at 2006-10-31 18:54 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1588359&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 Private: No Submitted By: Alexis Wilke (alexis_wilke) Assigned to: Nobody/Anonymous (nobody) Summary: "Bug" in comment Initial Comment: This is very low priority! Hey guys, In this file: http://boost.org/boost/integer.hpp there is the following comment which says '9=unsigned long' and the code says '9=unsigned char'. Should someone get rid of that comment or fix it? // specializatons: 1=long, 2=int, 3=short, 4=signed char, // 6=unsigned long, 7=unsigned int, 8=unsigned short, 9=unsigned long // no specializations for 0 and 5: requests for a type > long are in error template<> struct int_least_helper<1> { typedef long least; }; template<> struct int_least_helper<2> { typedef int least; }; template<> struct int_least_helper<3> { typedef short least; }; template<> struct int_least_helper<4> { typedef signed char least; }; template<> struct int_least_helper<6> { typedef unsigned long least; }; template<> struct int_least_helper<7> { typedef unsigned int least; }; template<> struct int_least_helper<8> { typedef unsigned short least; }; template<> struct int_least_helper<9> { typedef unsigned char least; }; ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1588359&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

2 1

Re: [boost] [fusion] random access views?
by dan marsden 01 Nov '06

01 Nov '06

Eric Niebler wrote:>dan marsden wrote: >> Eric Niebler wrote: >>> A fusion transform_view of a random access sequence should itself be a >>> random access sequence, and its category is random access, but it >>> doesn't seem to implement the complete interface. For instance: >> >> The at_impl had been completed omitted. I've fixed this in the cvs, and added >> covering tests. >> > >value_at for transform_view still seems to be missing. Sorry, I missed that one. I've corrected now in CVS, with covering test. Thanks for spotting again. Cheers Dan Send instant messages to your online friends http://uk.messenger.yahoo.com

1 0

[proto] interface changes
by Eric Niebler 01 Nov '06

01 Nov '06

To all those currently using the proto expression template toolkit at boost/xpressive/proto (all 2 of you, you know who you are), this is a heads up that the code has been rewritten, and the interfaces changed considerably. The changes have been committed to HEAD. The goals of the rewrite were many, but to sum up, the new code has a simpler, more uniform interface, integrates better with Fusion, and seamlessly supports ET nodes stored by value or reference. As a perk, xpressive now compiles 2x faster with vc7.1, and 25% faster with vc8. (No significant change with gcc.) The people most interested would be the Spirit people. The changes are specifically to make proto a better platform upon which to build Spirit-2. Now that I have an interface I can live with, I'm more inclined to write docs, and I will. The old proto v1 code from 1.34 now lives at boost/xpressive/proto/v1_ in the boost::proto1 namespace. -- Eric Niebler Boost Consulting www.boost-consulting.com

4 4