|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r64186 - in branches/release: . boost boost/algorithm/string boost/archive boost/bimap boost/config boost/detail boost/filesystem boost/functional/hash boost/fusion boost/gil boost/graph boost/integer boost/interprocess boost/intrusive boost/io boost/iostreams boost/math boost/msm boost/numeric/ublas boost/program_options boost/property_tree boost/python boost/range boost/regex boost/serialization boost/signals boost/signals2 boost/spirit boost/spirit/home boost/spirit/home/karma boost/spirit/home/support boost/statechart boost/system boost/thread boost/tr1 boost/type_traits boost/unordered boost/utility boost/uuid boost/variant boost/wave doc doc/html doc/test/gold doc/test/gold/boost doc/test/gold/boost/accumulators/extract doc/test/gold/boost/accumulators/impl doc/test/gold/boost/accumulators/tag doc/test/gold/document_to_test_formatting doc/test/gold/images/accumulators libs libs/algorithm/string libs/array/doc libs/array/test libs/bimap libs/bimap/doc/html libs/bimap/doc/html/boost_bimap libs/bimap/doc/html/boost_bimap/bimap_and_boost libs/bimap/doc/html/boost_bimap/examples libs/bimap/doc/html/boost_bimap/history libs/bimap/doc/html/boost_bimap/rationale libs/bimap/doc/html/boost_bimap/reference libs/bimap/doc/html/boost_bimap/the_tutorial libs/config libs/config/test libs/filesystem libs/functional/hash libs/fusion libs/graph_parallel libs/integer libs/interprocess libs/intrusive libs/iostreams libs/math libs/mpl/doc/refmanual libs/mpl/doc/src/refmanual libs/msm libs/numeric/conversion/doc libs/numeric/ublas libs/numeric/ublas/doc libs/optional/doc libs/program_options libs/property_map/doc libs/property_tree libs/python libs/range libs/range/doc/html/range/reference libs/range/doc/html/range/reference/adaptors libs/range/doc/html/range/reference/algorithms libs/range/doc/html/range/reference/concept_implementation libs/range/doc/html/range/reference/ranges libs/range/doc/html/range/reference/ranges/reference libs/range/doc/html/range/reference/semantics libs/range/doc/html/range/upgrade libs/range/doc/html/range/utilities libs/regex libs/regex/doc libs/serialization libs/serialization/test libs/signals libs/signals2 libs/spirit libs/spirit/classic/example libs/spirit/doc libs/spirit/example libs/spirit/phoenix libs/spirit/phoenix/doc/html libs/spirit/phoenix/doc/html/phoenix libs/spirit/repository/doc/html libs/spirit/repository/doc/html/spirit_repository libs/spirit/repository/doc/html/spirit_repository/karma_components libs/spirit/repository/doc/html/spirit_repository/karma_components/directives libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal libs/spirit/repository/doc/html/spirit_repository/qi_components libs/spirit/repository/doc/html/spirit_repository/qi_components/directives libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive libs/spirit/test libs/spirit/test/qi libs/statechart libs/static_assert libs/system libs/thread libs/timer libs/tr1 libs/type_traits libs/type_traits/doc libs/unordered libs/utility libs/utility/swap/test libs/uuid libs/wave more more/getting_started status tools tools/bcp tools/boostbook tools/boostbook/doc tools/build/v2 tools/inspect tools/jam tools/quickbook tools/quickbook/doc tools/regression tools/release tools/wave
From: daniel_james_at_[hidden]
Date: 2010-07-19 19:29:21
Author: danieljames
Date: 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
New Revision: 64186
URL: http://svn.boost.org/trac/boost/changeset/64186
Log:
Merge documentation changes.
Added:
branches/release/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330298.html
- copied unchanged from r64173, /trunk/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id330298.html
Removed:
branches/release/doc/html/boostbook.css
branches/release/doc/html/docutils.css
branches/release/doc/html/minimal.css
branches/release/doc/html/reference.css
branches/release/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_general_requirements.html
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html
branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html
branches/release/libs/range/doc/html/range/reference/algorithms/non.html
branches/release/libs/range/doc/html/range/reference/concept_implementation/overview.html
branches/release/libs/range/doc/html/range/reference/range_algorithm.html
branches/release/libs/range/doc/html/range/reference/ranges/introduction.html
branches/release/libs/range/doc/html/range/reference/ranges/reference.html
branches/release/libs/range/doc/html/range/reference/ranges/reference/counting_range.html
branches/release/libs/range/doc/html/range/reference/ranges/reference/irange.html
branches/release/libs/range/doc/html/range/reference/ranges/reference/istream_range.html
branches/release/libs/range/doc/html/range/reference/semantics/functions.html
branches/release/libs/range/doc/html/range/reference/semantics/metafunctions.html
branches/release/libs/range/doc/html/range/reference/synopsis.html
branches/release/libs/range/doc/html/range/upgrade/upgrade_1_34_to_1_35.html
branches/release/libs/range/doc/html/range/utilities/iterator_range.html
branches/release/libs/range/doc/html/range/utilities/join.html
branches/release/libs/range/doc/html/range/utilities/sub_range.html
Properties modified:
branches/release/ (props changed)
branches/release/INSTALL (props changed)
branches/release/Jamroot (props changed)
branches/release/LICENSE_1_0.txt (props changed)
branches/release/boost/ (props changed)
branches/release/boost-build.jam (props changed)
branches/release/boost.css (props changed)
branches/release/boost.png (props changed)
branches/release/boost/algorithm/string/ (props changed)
branches/release/boost/archive/ (props changed)
branches/release/boost/array.hpp (props changed)
branches/release/boost/bimap/ (props changed)
branches/release/boost/config/ (props changed)
branches/release/boost/config.hpp (props changed)
branches/release/boost/detail/ (props changed)
branches/release/boost/detail/endian.hpp (props changed)
branches/release/boost/filesystem/ (props changed)
branches/release/boost/filesystem.hpp (props changed)
branches/release/boost/functional/hash/ (props changed)
branches/release/boost/fusion/ (props changed)
branches/release/boost/gil/ (props changed)
branches/release/boost/graph/ (props changed)
branches/release/boost/integer/ (props changed)
branches/release/boost/interprocess/ (props changed)
branches/release/boost/intrusive/ (props changed)
branches/release/boost/io/ (props changed)
branches/release/boost/iostreams/ (props changed)
branches/release/boost/math/ (props changed)
branches/release/boost/math_fwd.hpp (props changed)
branches/release/boost/msm/ (props changed)
branches/release/boost/numeric/ublas/ (props changed)
branches/release/boost/numeric/ublas/functional.hpp (props changed)
branches/release/boost/program_options/ (props changed)
branches/release/boost/property_tree/ (props changed)
branches/release/boost/python/ (props changed)
branches/release/boost/range/ (props changed)
branches/release/boost/regex/ (props changed)
branches/release/boost/serialization/ (props changed)
branches/release/boost/signals/ (props changed)
branches/release/boost/signals2/ (props changed)
branches/release/boost/spirit/ (props changed)
branches/release/boost/spirit/home/ (props changed)
branches/release/boost/spirit/home/karma/ (props changed)
branches/release/boost/spirit/home/support/attributes.hpp (props changed)
branches/release/boost/statechart/ (props changed)
branches/release/boost/system/ (props changed)
branches/release/boost/thread/ (props changed)
branches/release/boost/thread.hpp (props changed)
branches/release/boost/tr1/ (props changed)
branches/release/boost/type_traits/ (props changed)
branches/release/boost/unordered/ (props changed)
branches/release/boost/utility/ (props changed)
branches/release/boost/utility/value_init.hpp (props changed)
branches/release/boost/uuid/ (props changed)
branches/release/boost/variant/ (props changed)
branches/release/boost/version.hpp (props changed)
branches/release/boost/wave/ (props changed)
branches/release/bootstrap.bat (props changed)
branches/release/bootstrap.sh (props changed)
branches/release/doc/ (props changed)
branches/release/index.htm (props changed)
branches/release/index.html (props changed)
branches/release/libs/ (props changed)
branches/release/libs/algorithm/string/ (props changed)
branches/release/libs/array/doc/array.xml (props changed)
branches/release/libs/array/test/array0.cpp (props changed)
branches/release/libs/array/test/array2.cpp (props changed)
branches/release/libs/bimap/ (props changed)
branches/release/libs/config/ (props changed)
branches/release/libs/config/test/boost_no_com_value_init.ipp (props changed)
branches/release/libs/filesystem/ (props changed)
branches/release/libs/functional/hash/ (props changed)
branches/release/libs/fusion/ (props changed)
branches/release/libs/graph_parallel/ (props changed)
branches/release/libs/integer/ (props changed)
branches/release/libs/interprocess/ (props changed)
branches/release/libs/intrusive/ (props changed)
branches/release/libs/iostreams/ (props changed)
branches/release/libs/libraries.htm (props changed)
branches/release/libs/maintainers.txt (props changed)
branches/release/libs/math/ (props changed)
branches/release/libs/mpl/doc/refmanual/broken-compiler-workarounds.html (props changed)
branches/release/libs/mpl/doc/refmanual/categorized-index-concepts.html (props changed)
branches/release/libs/mpl/doc/refmanual/cfg-no-preprocessed-headers.html (props changed)
branches/release/libs/mpl/doc/refmanual/composition-and-argument-binding.html (props changed)
branches/release/libs/mpl/doc/refmanual/data-types-concepts.html (props changed)
branches/release/libs/mpl/doc/refmanual/data-types-miscellaneous.html (props changed)
branches/release/libs/mpl/doc/refmanual/extensible-associative-sequence.html (props changed)
branches/release/libs/mpl/doc/refmanual/inserter-class.html (props changed)
branches/release/libs/mpl/doc/refmanual/tag-dispatched-metafunction.html (props changed)
branches/release/libs/mpl/doc/refmanual/trivial-metafunctions-summary.html (props changed)
branches/release/libs/mpl/doc/src/refmanual/Iterators-Iterator.rst (props changed)
branches/release/libs/msm/ (props changed)
branches/release/libs/numeric/ublas/ (props changed)
branches/release/libs/numeric/ublas/doc/ (props changed)
branches/release/libs/program_options/ (props changed)
branches/release/libs/property_tree/ (props changed)
branches/release/libs/python/ (props changed)
branches/release/libs/range/ (props changed)
branches/release/libs/regex/ (props changed)
branches/release/libs/regex/doc/ (props changed)
branches/release/libs/serialization/ (props changed)
branches/release/libs/serialization/test/ (props changed)
branches/release/libs/serialization/test/A.cpp (props changed)
branches/release/libs/serialization/test/A.hpp (props changed)
branches/release/libs/serialization/test/A.ipp (props changed)
branches/release/libs/serialization/test/B.hpp (props changed)
branches/release/libs/serialization/test/C.hpp (props changed)
branches/release/libs/serialization/test/D.hpp (props changed)
branches/release/libs/serialization/test/J.hpp (props changed)
branches/release/libs/serialization/test/Jamfile.v2 (props changed)
branches/release/libs/serialization/test/base.hpp (props changed)
branches/release/libs/serialization/test/binary_archive.hpp (props changed)
branches/release/libs/serialization/test/binary_warchive.hpp (props changed)
branches/release/libs/serialization/test/derived2.hpp (props changed)
branches/release/libs/serialization/test/dll_a.cpp (props changed)
branches/release/libs/serialization/test/dll_base.cpp (props changed)
branches/release/libs/serialization/test/dll_derived2.cpp (props changed)
branches/release/libs/serialization/test/polymorphic_array_binary_archive.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_base.cpp (props changed)
branches/release/libs/serialization/test/polymorphic_base.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_binary_archive.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_derived1.cpp (props changed)
branches/release/libs/serialization/test/polymorphic_derived1.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_derived2.cpp (props changed)
branches/release/libs/serialization/test/polymorphic_derived2.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_text_archive.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_text_warchive.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_xml_archive.hpp (props changed)
branches/release/libs/serialization/test/polymorphic_xml_warchive.hpp (props changed)
branches/release/libs/serialization/test/portable_binary_archive.hpp (props changed)
branches/release/libs/serialization/test/test_array.cpp (props changed)
branches/release/libs/serialization/test/test_binary.cpp (props changed)
branches/release/libs/serialization/test/test_bitset.cpp (props changed)
branches/release/libs/serialization/test/test_check.cpp (props changed)
branches/release/libs/serialization/test/test_class_info_load.cpp (props changed)
branches/release/libs/serialization/test/test_class_info_save.cpp (props changed)
branches/release/libs/serialization/test/test_codecvt_null.cpp (props changed)
branches/release/libs/serialization/test/test_complex.cpp (props changed)
branches/release/libs/serialization/test/test_const_load_fail1.cpp (props changed)
branches/release/libs/serialization/test/test_const_load_fail1_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_const_load_fail2.cpp (props changed)
branches/release/libs/serialization/test/test_const_load_fail2_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_const_load_fail3.cpp (props changed)
branches/release/libs/serialization/test/test_const_load_fail3_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_const_pass.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn1.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn1_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn2.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn2_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn3.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn3_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn4.cpp (props changed)
branches/release/libs/serialization/test/test_const_save_warn4_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_contained_class.cpp (props changed)
branches/release/libs/serialization/test/test_cyclic_ptrs.cpp (props changed)
branches/release/libs/serialization/test/test_decl.hpp (props changed)
branches/release/libs/serialization/test/test_delete_pointer.cpp (props changed)
branches/release/libs/serialization/test/test_deque.cpp (props changed)
branches/release/libs/serialization/test/test_derived.cpp (props changed)
branches/release/libs/serialization/test/test_derived_class.cpp (props changed)
branches/release/libs/serialization/test/test_derived_class_ptr.cpp (props changed)
branches/release/libs/serialization/test/test_diamond.cpp (props changed)
branches/release/libs/serialization/test/test_diamond_complex.cpp (props changed)
branches/release/libs/serialization/test/test_dll_exported.cpp (props changed)
branches/release/libs/serialization/test/test_dll_plugin.cpp (props changed)
branches/release/libs/serialization/test/test_dll_simple.cpp (props changed)
branches/release/libs/serialization/test/test_exported.cpp (props changed)
branches/release/libs/serialization/test/test_inclusion.cpp (props changed)
branches/release/libs/serialization/test/test_iterators.cpp (props changed)
branches/release/libs/serialization/test/test_iterators_base64.cpp (props changed)
branches/release/libs/serialization/test/test_list.cpp (props changed)
branches/release/libs/serialization/test/test_list_ptrs.cpp (props changed)
branches/release/libs/serialization/test/test_map.cpp (props changed)
branches/release/libs/serialization/test/test_mi.cpp (props changed)
branches/release/libs/serialization/test/test_mult_archive_types.cpp (props changed)
branches/release/libs/serialization/test/test_multiple_inheritance.cpp (props changed)
branches/release/libs/serialization/test/test_multiple_ptrs.cpp (props changed)
branches/release/libs/serialization/test/test_new_operator.cpp (props changed)
branches/release/libs/serialization/test/test_no_rtti.cpp (props changed)
branches/release/libs/serialization/test/test_non_default_ctor.cpp (props changed)
branches/release/libs/serialization/test/test_non_default_ctor2.cpp (props changed)
branches/release/libs/serialization/test/test_non_intrusive.cpp (props changed)
branches/release/libs/serialization/test/test_not_serializable.cpp (props changed)
branches/release/libs/serialization/test/test_null_ptr.cpp (props changed)
branches/release/libs/serialization/test/test_nvp.cpp (props changed)
branches/release/libs/serialization/test/test_object.cpp (props changed)
branches/release/libs/serialization/test/test_optional.cpp (props changed)
branches/release/libs/serialization/test/test_pimpl.cpp (props changed)
branches/release/libs/serialization/test/test_polymorphic.cpp (props changed)
branches/release/libs/serialization/test/test_polymorphic2.cpp (props changed)
branches/release/libs/serialization/test/test_polymorphic2.hpp (props changed)
branches/release/libs/serialization/test/test_polymorphic2imp.cpp (props changed)
branches/release/libs/serialization/test/test_polymorphic_A.cpp (props changed)
branches/release/libs/serialization/test/test_polymorphic_A.hpp (props changed)
branches/release/libs/serialization/test/test_primitive.cpp (props changed)
branches/release/libs/serialization/test/test_private_base.cpp (props changed)
branches/release/libs/serialization/test/test_private_ctor.cpp (props changed)
branches/release/libs/serialization/test/test_recursion.cpp (props changed)
branches/release/libs/serialization/test/test_registered.cpp (props changed)
branches/release/libs/serialization/test/test_reset_object_address.cpp (props changed)
branches/release/libs/serialization/test/test_set.cpp (props changed)
branches/release/libs/serialization/test/test_shared_ptr.cpp (props changed)
branches/release/libs/serialization/test/test_shared_ptr_132.cpp (props changed)
branches/release/libs/serialization/test/test_shared_ptr_multi_base.cpp (props changed)
branches/release/libs/serialization/test/test_simple_class.cpp (props changed)
branches/release/libs/serialization/test/test_simple_class_ptr.cpp (props changed)
branches/release/libs/serialization/test/test_singleton.cpp (props changed)
branches/release/libs/serialization/test/test_smart_cast.cpp (props changed)
branches/release/libs/serialization/test/test_split.cpp (props changed)
branches/release/libs/serialization/test/test_static_warning.cpp (props changed)
branches/release/libs/serialization/test/test_tools.hpp (props changed)
branches/release/libs/serialization/test/test_tracking.cpp (props changed)
branches/release/libs/serialization/test/test_traits_fail.cpp (props changed)
branches/release/libs/serialization/test/test_traits_pass.cpp (props changed)
branches/release/libs/serialization/test/test_unregistered.cpp (props changed)
branches/release/libs/serialization/test/test_utf8_codecvt.cpp (props changed)
branches/release/libs/serialization/test/test_valarray.cpp (props changed)
branches/release/libs/serialization/test/test_variant.cpp (props changed)
branches/release/libs/serialization/test/test_vector.cpp (props changed)
branches/release/libs/serialization/test/test_void_cast.cpp (props changed)
branches/release/libs/serialization/test/text_archive.hpp (props changed)
branches/release/libs/serialization/test/text_warchive.hpp (props changed)
branches/release/libs/serialization/test/xml_archive.hpp (props changed)
branches/release/libs/serialization/test/xml_warchive.hpp (props changed)
branches/release/libs/signals/ (props changed)
branches/release/libs/signals2/ (props changed)
branches/release/libs/spirit/ (props changed)
branches/release/libs/spirit/classic/example/ (props changed)
branches/release/libs/spirit/doc/ (props changed)
branches/release/libs/spirit/example/ (props changed)
branches/release/libs/spirit/phoenix/ (props changed)
branches/release/libs/spirit/test/ (props changed)
branches/release/libs/spirit/test/qi/optional.cpp (props changed)
branches/release/libs/statechart/ (props changed)
branches/release/libs/static_assert/ (props changed)
branches/release/libs/system/ (props changed)
branches/release/libs/thread/ (props changed)
branches/release/libs/timer/ (props changed)
branches/release/libs/tr1/ (props changed)
branches/release/libs/type_traits/ (props changed)
branches/release/libs/type_traits/doc/ (props changed)
branches/release/libs/unordered/ (props changed)
branches/release/libs/utility/ (props changed)
branches/release/libs/utility/swap.html (props changed)
branches/release/libs/utility/swap/test/std_bitset.cpp (props changed)
branches/release/libs/utility/value_init.htm (props changed)
branches/release/libs/utility/value_init_test.cpp (props changed)
branches/release/libs/uuid/ (props changed)
branches/release/libs/wave/ (props changed)
branches/release/more/ (props changed)
branches/release/more/getting_started/ (props changed)
branches/release/rst.css (props changed)
branches/release/status/ (props changed)
branches/release/status/Jamfile.v2 (props changed)
branches/release/tools/ (props changed)
branches/release/tools/bcp/ (props changed)
branches/release/tools/boostbook/ (props changed)
branches/release/tools/build/v2/ (props changed)
branches/release/tools/inspect/ (props changed)
branches/release/tools/jam/ (props changed)
branches/release/tools/quickbook/ (props changed)
branches/release/tools/regression/ (props changed)
branches/release/tools/release/ (props changed)
branches/release/tools/wave/ (props changed)
Binary files modified:
branches/release/doc/test/gold/images/accumulators/form_2.png
branches/release/doc/test/gold/images/accumulators/form_5.png
branches/release/doc/test/gold/images/accumulators/form_6.png
Text files modified:
branches/release/doc/Jamfile.v2 | 3
branches/release/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html | 22
branches/release/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html | 28
branches/release/doc/test/gold/boost/array.html | 478 +++++-----
branches/release/doc/test/gold/document_to_test_formatting/accumulators.html | 50
branches/release/doc/test/gold/document_to_test_formatting/array.html | 172 +-
branches/release/doc/test/gold/document_to_test_formatting/basic_formatting.html | 109 +-
branches/release/doc/test/gold/document_to_test_formatting/blurbs.html | 30
branches/release/doc/test/gold/document_to_test_formatting/code_blocks.html | 80
branches/release/doc/test/gold/document_to_test_formatting/images.html | 14
branches/release/doc/test/gold/document_to_test_formatting/lists_and_tables.html | 562 ++++++------
branches/release/doc/test/gold/document_to_test_formatting/remez.html | 140 +-
branches/release/doc/test/gold/document_to_test_formatting/test.html | 24
branches/release/doc/test/gold/index.html | 24
branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html | 20
branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html | 77 -
branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html | 400 +++----
branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html | 569 ++++++------
branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html | 326 +++---
branches/release/libs/bimap/doc/html/boost_bimap/examples.html | 511 +++++-----
branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html | 20
branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html | 52
branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html | 30
branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html | 47
branches/release/libs/bimap/doc/html/boost_bimap/future_work.html | 18
branches/release/libs/bimap/doc/html/boost_bimap/history.html | 100 +-
branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html | 670 ++++---------
branches/release/libs/bimap/doc/html/boost_bimap/introduction.html | 171 +-
branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html | 126 +-
branches/release/libs/bimap/doc/html/boost_bimap/performance.html | 16
branches/release/libs/bimap/doc/html/boost_bimap/rationale.html | 48
branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html | 66
branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html | 184 +--
branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html | 1851 +++++++++++++--------------------------
branches/release/libs/bimap/doc/html/boost_bimap/reference.html | 70
branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html | 741 +++++++--------
branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html | 1328 +++++++++++++--------------
branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html | 1156 ++++++++++++------------
branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html | 60
branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html | 1112 +++++++++++------------
branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html | 1374 ++++++++++++++---------------
branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html | 16
branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html | 447 ++++----
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html | 120 +-
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html | 54
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html | 268 ++--
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html | 159 +-
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html | 385 ++++----
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html | 366 +++----
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html | 168 +-
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html | 194 ++--
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html | 74 -
branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html | 121 -
branches/release/libs/bimap/doc/html/index.html | 32
branches/release/libs/numeric/conversion/doc/Jamfile.v2 | 1
branches/release/libs/optional/doc/Jamfile.v2 | 1
branches/release/libs/property_map/doc/dynamic_property_map.html | 2
branches/release/libs/spirit/phoenix/doc/html/index.html | 205 ++--
branches/release/libs/spirit/phoenix/doc/html/phoenix/acknowledgement.html | 117 +-
branches/release/libs/spirit/phoenix/doc/html/phoenix/actors.html | 52
branches/release/libs/spirit/phoenix/doc/html/phoenix/algorithm.html | 1221 +++++++++++++------------
branches/release/libs/spirit/phoenix/doc/html/phoenix/basics.html | 178 +-
branches/release/libs/spirit/phoenix/doc/html/phoenix/composite.html | 1095 ++++++++++------------
branches/release/libs/spirit/phoenix/doc/html/phoenix/container.html | 734 +++++++-------
branches/release/libs/spirit/phoenix/doc/html/phoenix/inside_phoenix.html | 768 ++++++++--------
branches/release/libs/spirit/phoenix/doc/html/phoenix/introduction.html | 25
branches/release/libs/spirit/phoenix/doc/html/phoenix/organization.html | 384 ++++----
branches/release/libs/spirit/phoenix/doc/html/phoenix/primitives.html | 259 ++---
branches/release/libs/spirit/phoenix/doc/html/phoenix/references.html | 117 +-
branches/release/libs/spirit/phoenix/doc/html/phoenix/starter_kit.html | 385 ++++---
branches/release/libs/spirit/phoenix/doc/html/phoenix/wrap_up.html | 47
branches/release/libs/spirit/repository/doc/html/index.html | 18
branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components.html | 12
branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives.html | 12
branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives/karma_confix_generator.html | 122 +-
branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal.html | 12
branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal/subrule.html | 286 ++---
branches/release/libs/spirit/repository/doc/html/spirit_repository/preface.html | 189 ++--
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components.html | 12
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives.html | 12
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/confix.html | 116 +-
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/distinct.html | 104 -
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal.html | 12
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal/subrule.html | 717 +++++++-------
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive.html | 12
branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive/flush_multi_pass.html | 48
branches/release/tools/boostbook/doc/boostbook.xml | 14
branches/release/tools/quickbook/doc/quickbook.qbk | 6
branches/release/tools/release/index.html | 2
89 files changed, 10554 insertions(+), 12026 deletions(-)
Modified: branches/release/doc/Jamfile.v2
==============================================================================
--- branches/release/doc/Jamfile.v2 (original)
+++ branches/release/doc/Jamfile.v2 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -76,13 +76,10 @@
<xsl:param>boost.libraries=../../libs/libraries.htm
- <dependency>css
<dependency>images
<dependency>callouts
;
-install css : [ glob src/*.css ] : <location>html ;
-explicit css ;
install images : [ glob src/images/*.png ] : <location>html/images ;
explicit images ;
install callouts : [ glob src/images/callouts/*.png ] : <location>html/images/callouts ;
Deleted: branches/release/doc/html/boostbook.css
==============================================================================
--- branches/release/doc/html/boostbook.css 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,601 +0,0 @@
-/*=============================================================================
- Copyright (c) 2004 Joel de Guzman
- http://spirit.sourceforge.net/
-
- Distributed under the Boost Software License, Version 1.0. (See accompany-
- ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-=============================================================================*/
-
-/*=============================================================================
- Body defaults
-=============================================================================*/
-
- body
- {
- margin: 1em;
- font-family: sans-serif;
- }
-
-/*=============================================================================
- Paragraphs
-=============================================================================*/
-
- p
- {
- text-align: left;
- font-size: 10pt;
- line-height: 1.15;
- }
-
-/*=============================================================================
- Program listings
-=============================================================================*/
-
- /* Code on paragraphs */
- p tt.computeroutput
- {
- font-size: 9pt;
- }
-
- pre.synopsis
- {
- font-size: 9pt;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
- .programlisting,
- .screen
- {
- font-size: 9pt;
- display: block;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
- /* Program listings in tables don't get borders */
- td .programlisting,
- td .screen
- {
- margin: 0pc 0pc 0pc 0pc;
- padding: 0pc 0pc 0pc 0pc;
- }
-
-/*=============================================================================
- Headings
-=============================================================================*/
-
- h1, h2, h3, h4, h5, h6
- {
- text-align: left;
- margin: 1em 0em 0.5em 0em;
- font-weight: bold;
- }
-
- h1 { font: 140% }
- h2 { font: bold 140% }
- h3 { font: bold 130% }
- h4 { font: bold 120% }
- h5 { font: italic 110% }
- h6 { font: italic 100% }
-
- /* Top page titles */
- title,
- h1.title,
- h2.title
- h3.title,
- h4.title,
- h5.title,
- h6.title,
- .refentrytitle
- {
- font-weight: bold;
- margin-bottom: 1pc;
- }
-
- h1.title { font-size: 140% }
- h2.title { font-size: 140% }
- h3.title { font-size: 130% }
- h4.title { font-size: 120% }
- h5.title { font-size: 110% }
- h6.title { font-size: 100% }
-
- .section h1
- {
- margin: 0em 0em 0.5em 0em;
- font-size: 140%;
- }
-
- .section h2 { font-size: 140% }
- .section h3 { font-size: 130% }
- .section h4 { font-size: 120% }
- .section h5 { font-size: 110% }
- .section h6 { font-size: 100% }
-
- /* Code on titles */
- h1 tt.computeroutput { font-size: 140% }
- h2 tt.computeroutput { font-size: 140% }
- h3 tt.computeroutput { font-size: 130% }
- h4 tt.computeroutput { font-size: 130% }
- h5 tt.computeroutput { font-size: 130% }
- h6 tt.computeroutput { font-size: 130% }
-
-
-/*=============================================================================
- Author
-=============================================================================*/
-
- h3.author
- {
- font-size: 100%
- }
-
-/*=============================================================================
- Lists
-=============================================================================*/
-
- li
- {
- font-size: 10pt;
- line-height: 1.3;
- }
-
- /* Unordered lists */
- ul
- {
- text-align: left;
- }
-
- /* Ordered lists */
- ol
- {
- text-align: left;
- }
-
-/*=============================================================================
- Links
-=============================================================================*/
-
- a
- {
- text-decoration: none; /* no underline */
- }
-
- a:hover
- {
- text-decoration: underline;
- }
-
-/*=============================================================================
- Spirit style navigation
-=============================================================================*/
-
- .spirit-nav
- {
- text-align: right;
- }
-
- .spirit-nav a
- {
- color: white;
- padding-left: 0.5em;
- }
-
- .spirit-nav img
- {
- border-width: 0px;
- }
-
-/*=============================================================================
- Copyright footer
-=============================================================================*/
- .copyright-footer
- {
- text-align: right;
- font-size: 70%;
- }
-
- .copyright-footer p
- {
- text-align: right;
- font-size: 80%;
- }
-
-/*=============================================================================
- Table of contents
-=============================================================================*/
-
- .toc
- {
- margin: 1pc 4% 0pc 4%;
- padding: 0.1pc 1pc 0.1pc 1pc;
- font-size: 80%;
- line-height: 1.15;
- }
-
- .boost-toc
- {
- float: right;
- padding: 0.5pc;
- }
-
- /* Code on toc */
- .toc .computeroutput { font-size: 120% }
-
-/*=============================================================================
- Tables
-=============================================================================*/
-
- .table-title,
- div.table p.title
- {
- margin-left: 4%;
- padding-right: 0.5em;
- padding-left: 0.5em;
- }
-
- .informaltable table,
- .table table
- {
- width: 92%;
- margin-left: 4%;
- margin-right: 4%;
- }
-
- div.informaltable table,
- div.table table
- {
- padding: 4px;
- }
-
- /* Table Cells */
- div.informaltable table tr td,
- div.table table tr td
- {
- padding: 0.5em;
- text-align: left;
- font-size: 9pt;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- padding: 0.5em 0.5em 0.5em 0.5em;
- border: 1pt solid white;
- font-size: 80%;
- }
-
- table.simplelist
- {
- width: auto !important;
- margin: 0em !important;
- padding: 0em !important;
- border: none !important;
- }
- table.simplelist td
- {
- margin: 0em !important;
- padding: 0em !important;
- text-align: left !important;
- font-size: 9pt !important;
- border: none !important;
- }
-
-/*=============================================================================
- Blurbs
-=============================================================================*/
-
- div.note,
- div.tip,
- div.important,
- div.caution,
- div.warning,
- p.blurb
- {
- font-size: 9pt; /* A little bit smaller than the main text */
- line-height: 1.2;
- display: block;
- margin: 1pc 4% 0pc 4%;
- padding: 0.5pc 0.5pc 0.5pc 0.5pc;
- }
-
- p.blurb img
- {
- padding: 1pt;
- }
-
-/*=============================================================================
- Variable Lists
-=============================================================================*/
-
- div.variablelist
- {
- margin: 1em 0;
- }
-
- /* Make the terms in definition lists bold */
- div.variablelist dl dt,
- span.term
- {
- font-weight: bold;
- font-size: 10pt;
- }
-
- div.variablelist table tbody tr td
- {
- text-align: left;
- vertical-align: top;
- padding: 0em 2em 0em 0em;
- font-size: 10pt;
- margin: 0em 0em 0.5em 0em;
- line-height: 1;
- }
-
- div.variablelist dl dt
- {
- margin-bottom: 0.2em;
- }
-
- div.variablelist dl dd
- {
- margin: 0em 0em 0.5em 2em;
- font-size: 10pt;
- }
-
- div.variablelist table tbody tr td p,
- div.variablelist dl dd p
- {
- margin: 0em 0em 0.5em 0em;
- line-height: 1;
- }
-
-/*=============================================================================
- Misc
-=============================================================================*/
-
- /* Title of books and articles in bibliographies */
- span.title
- {
- font-style: italic;
- }
-
- span.underline
- {
- text-decoration: underline;
- }
-
- span.strikethrough
- {
- text-decoration: line-through;
- }
-
- /* Copyright, Legal Notice */
- div div.legalnotice p
- {
- text-align: left
- }
-
-/*=============================================================================
- Colors
-=============================================================================*/
-
- @media screen
- {
- body {
- background-color: #FFFFFF;
- color: #000000;
- }
-
- /* Syntax Highlighting */
- .keyword { color: #0000AA; }
- .identifier { color: #000000; }
- .special { color: #707070; }
- .preprocessor { color: #402080; }
- .char { color: teal; }
- .comment { color: #800000; }
- .string { color: teal; }
- .number { color: teal; }
- .white_bkd { background-color: #FFFFFF; }
- .dk_grey_bkd { background-color: #999999; }
-
- /* Links */
- a, a .keyword, a .identifier, a .special, a .preprocessor
- a .char, a .comment, a .string, a .number
- {
- color: #005a9c;
- }
-
- a:visited, a:visited .keyword, a:visited .identifier,
- a:visited .special, a:visited .preprocessor a:visited .char,
- a:visited .comment, a:visited .string, a:visited .number
- {
- color: #9c5a9c;
- }
-
- h1 a, h2 a, h3 a, h4 a, h5 a, h6 a,
- h1 a:hover, h2 a:hover, h3 a:hover, h4 a:hover, h5 a:hover, h6 a:hover,
- h1 a:visited, h2 a:visited, h3 a:visited, h4 a:visited, h5 a:visited, h6 a:visited
- {
- text-decoration: none; /* no underline */
- color: #000000;
- }
-
- /* Copyright, Legal Notice */
- .copyright
- {
- color: #666666;
- font-size: small;
- }
-
- div div.legalnotice p
- {
- color: #666666;
- }
-
- /* Program listing */
- pre.synopsis
- {
- border: 1px solid #DCDCDC;
- }
-
- .programlisting,
- .screen
- {
- border: 1px solid #DCDCDC;
- }
-
- td .programlisting,
- td .screen
- {
- border: 0px solid #DCDCDC;
- }
-
- /* Blurbs */
- div.note,
- div.tip,
- div.important,
- div.caution,
- div.warning,
- p.blurb
- {
- border: 1px solid #DCDCDC;
- }
-
- /* Table of contents */
- .toc
- {
- border: 1px solid #DCDCDC;
- }
-
- /* Tables */
- div.informaltable table tr td,
- div.table table tr td
- {
- border: 1px solid #DCDCDC;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- background-color: #F0F0F0;
- border: 1px solid #DCDCDC;
- }
-
- .copyright-footer
- {
- color: #8F8F8F;
- }
-
- /* Misc */
- span.highlight
- {
- color: #00A000;
- }
- }
-
- @media print
- {
- /* Links */
- a
- {
- color: black;
- }
-
- a:visited
- {
- color: black;
- }
-
- .spirit-nav
- {
- display: none;
- }
-
- /* Program listing */
- pre.synopsis
- {
- border: 1px solid gray;
- }
-
- .programlisting,
- .screen
- {
- border: 1px solid gray;
- }
-
- td .programlisting,
- td .screen
- {
- border: 0px solid #DCDCDC;
- }
-
- /* Table of contents */
- .toc
- {
- border: 1px solid gray;
- }
-
- .informaltable table,
- .table table
- {
- border: 1px solid gray;
- border-collapse: collapse;
- }
-
- /* Tables */
- div.informaltable table tr td,
- div.table table tr td
- {
- border: 1px solid gray;
- }
-
- div.informaltable table tr th,
- div.table table tr th
- {
- border: 1px solid gray;
- }
-
- table.simplelist tr td
- {
- border: none !important;
- }
-
- /* Misc */
- span.highlight
- {
- font-weight: bold;
- }
- }
-
-/*=============================================================================
- Images
-=============================================================================*/
-
- span.inlinemediaobject img
- {
- vertical-align: middle;
- }
-
-/*==============================================================================
- Super and Subscript: style so that line spacing isn't effected, see
- http://www.adobe.com/cfusion/communityengine/index.cfm?event=showdetails&productId=1&postId=5341
-==============================================================================*/
-
-sup,
-sub {
- height: 0;
- line-height: 1;
- vertical-align: baseline;
- _vertical-align: bottom;
- position: relative;
-
-}
-
-sup {
- bottom: 1ex;
-}
-
-sub {
- top: .5ex;
-}
-
Deleted: branches/release/doc/html/docutils.css
==============================================================================
--- branches/release/doc/html/docutils.css 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,275 +0,0 @@
-/*
-:Author: David Goodger
-:Contact: goodger_at_[hidden]
-:Date: $Date$
-:Revision: $Revision$
-:Copyright: This stylesheet has been placed in the public domain.
-
-Default cascading style sheet for the HTML output of Docutils.
-
-See http://docutils.sf.net/docs/howto/html-stylesheets.html for how to
-customize this style sheet.
-*/
-
-/* used to remove borders from tables and images */
-.borderless, table.borderless td, table.borderless th {
- border: 0 }
-
-table.borderless td, table.borderless th {
- /* Override padding for "table.docutils td" with "! important".
- The right padding separates the table cells. */
- padding: 0 0.5em 0 0 ! important }
-
-.first {
- /* Override more specific margin styles with "! important". */
- margin-top: 0 ! important }
-
-.last, .with-subtitle {
- margin-bottom: 0 ! important }
-
-.hidden {
- display: none }
-
-a.toc-backref {
- text-decoration: none ;
- color: black }
-
-blockquote.epigraph {
- margin: 2em 5em ; }
-
-dl.docutils dd {
- margin-bottom: 0.5em }
-
-/* Uncomment (and remove this text!) to get bold-faced definition list terms
-dl.docutils dt {
- font-weight: bold }
-*/
-
-div.abstract {
- margin: 2em 5em }
-
-div.abstract p.topic-title {
- font-weight: bold ;
- text-align: center }
-
-div.admonition, div.attention, div.caution, div.danger, div.error,
-div.hint, div.important, div.note, div.tip, div.warning {
- margin: 2em ;
- border: medium outset ;
- padding: 1em }
-
-div.admonition p.admonition-title, div.hint p.admonition-title,
-div.important p.admonition-title, div.note p.admonition-title,
-div.tip p.admonition-title {
- font-weight: bold ;
- font-family: sans-serif }
-
-div.attention p.admonition-title, div.caution p.admonition-title,
-div.danger p.admonition-title, div.error p.admonition-title,
-div.warning p.admonition-title {
- color: red ;
- font-weight: bold ;
- font-family: sans-serif }
-
-/* Uncomment (and remove this text!) to get reduced vertical space in
- compound paragraphs.
-div.compound .compound-first, div.compound .compound-middle {
- margin-bottom: 0.5em }
-
-div.compound .compound-last, div.compound .compound-middle {
- margin-top: 0.5em }
-*/
-
-div.dedication {
- margin: 2em 5em ;
- text-align: center ;
- font-style: italic }
-
-div.dedication p.topic-title {
- font-weight: bold ;
- font-style: normal }
-
-div.figure {
- margin-left: 2em ;
- margin-right: 2em }
-
-div.footer, div.header {
- clear: both;
- font-size: smaller }
-
-div.line-block {
- display: block ;
- margin-top: 1em ;
- margin-bottom: 1em }
-
-div.line-block div.line-block {
- margin-top: 0 ;
- margin-bottom: 0 ;
- margin-left: 1.5em }
-
-div.sidebar {
- margin-left: 1em ;
- border: medium outset ;
- padding: 1em ;
- background-color: #ffffee ;
- width: 40% ;
- float: right ;
- clear: right }
-
-div.sidebar p.rubric {
- font-family: sans-serif ;
- font-size: medium }
-
-div.system-messages {
- margin: 5em }
-
-div.system-messages h1 {
- color: red }
-
-div.system-message {
- border: medium outset ;
- padding: 1em }
-
-div.system-message p.system-message-title {
- color: red ;
- font-weight: bold }
-
-div.topic {
- margin: 2em }
-
-h1.section-subtitle, h2.section-subtitle, h3.section-subtitle,
-h4.section-subtitle, h5.section-subtitle, h6.section-subtitle {
- margin-top: 0.4em }
-
-h1.title {
- text-align: center }
-
-h2.subtitle {
- text-align: center }
-
-hr.docutils {
- width: 75% }
-
-img.align-left {
- clear: left }
-
-img.align-right {
- clear: right }
-
-ol.simple, ul.simple {
- margin-bottom: 1em }
-
-ol.arabic {
- list-style: decimal }
-
-ol.loweralpha {
- list-style: lower-alpha }
-
-ol.upperalpha {
- list-style: upper-alpha }
-
-ol.lowerroman {
- list-style: lower-roman }
-
-ol.upperroman {
- list-style: upper-roman }
-
-p.attribution {
- text-align: right ;
- margin-left: 50% }
-
-p.caption {
- font-style: italic }
-
-p.credits {
- font-style: italic ;
- font-size: smaller }
-
-p.label {
- white-space: nowrap }
-
-p.rubric {
- font-weight: bold ;
- font-size: larger ;
- color: maroon ;
- text-align: center }
-
-p.sidebar-title {
- font-family: sans-serif ;
- font-weight: bold ;
- font-size: larger }
-
-p.sidebar-subtitle {
- font-family: sans-serif ;
- font-weight: bold }
-
-p.topic-title {
- font-weight: bold }
-
-pre.address {
- margin-bottom: 0 ;
- margin-top: 0 ;
- font-family: serif ;
- font-size: 100% }
-
-pre.literal-block, pre.doctest-block {
- margin-left: 2em ;
- margin-right: 2em }
-
-span.classifier {
- font-family: sans-serif ;
- font-style: oblique }
-
-span.classifier-delimiter {
- font-family: sans-serif ;
- font-weight: bold }
-
-span.interpreted {
- font-family: sans-serif }
-
-span.option {
- white-space: nowrap }
-
-span.pre {
- white-space: pre }
-
-span.problematic {
- color: red }
-
-span.section-subtitle {
- /* font-size relative to parent (h1..h6 element) */
- font-size: 80% }
-
-table.citation {
- border-left: solid 1px gray;
- margin-left: 1px }
-
-table.docinfo {
- margin: 2em 4em }
-
-table.docutils {
- margin-top: 0.5em ;
- margin-bottom: 0.5em }
-
-table.footnote {
- border-left: solid 1px black;
- margin-left: 1px }
-
-table.docutils td, table.docutils th,
-table.docinfo td, table.docinfo th {
- padding-left: 0.5em ;
- padding-right: 0.5em ;
- vertical-align: top }
-
-table.docutils th.field-name, table.docinfo th.docinfo-name {
- font-weight: bold ;
- text-align: left ;
- white-space: nowrap ;
- padding-left: 0 }
-
-h1 tt.docutils, h2 tt.docutils, h3 tt.docutils,
-h4 tt.docutils, h5 tt.docutils, h6 tt.docutils {
- font-size: 100% }
-
-ul.auto-toc {
- list-style-type: none }
Deleted: branches/release/doc/html/minimal.css
==============================================================================
--- branches/release/doc/html/minimal.css 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,29 +0,0 @@
-/*
-
- © Copyright Beman Dawes, 2007
-
- Distributed under the Boost Software License, Version 1.0.
- See www.boost.org/LICENSE_1_0.txt
-
-*/
-
-/*******************************************************************************
- Body
-*******************************************************************************/
-
-body { font-family: sans-serif; margin: 1em; }
-
-/*******************************************************************************
- Table
-*******************************************************************************/
-
-table { margin: 0.5em; }
-
-/*******************************************************************************
- Font sizes
-*******************************************************************************/
-
-p, td, li, blockquote { font-size: 10pt; }
-pre { font-size: 9pt; }
-
-/*** end ***/
\ No newline at end of file
Deleted: branches/release/doc/html/reference.css
==============================================================================
--- branches/release/doc/html/reference.css 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,11 +0,0 @@
-/*============================================================================
- Copyright 2003-2004 Douglas Gregor
- Distributed under the Boost Software License, Version 1.0. (See accompany-
- ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-============================================================================*/
-
-PRE.synopsis {
- background-color: #e0ffff;
- border: thin solid blue;
- padding: 1em
-}
\ No newline at end of file
Modified: branches/release/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html
==============================================================================
--- branches/release/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html (original)
+++ branches/release/doc/test/gold/boost/accumulators/extract/weighted_tail_quantile.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,13 +1,13 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Global weighted_tail_quantile</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Document To Test Formatting">
-<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp" title="Header <boost/git/doc/test/weighted_tail_quantile.hpp>">
<link rel="prev" href="../../../document_to_test_formatting/accumulators.html" title="Accumulators Example Doxygen Documentation">
-<link rel="next" href="../impl/weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">
+<link rel="next" href="../impl/weighted_tail_quantile__id330298.html" title="Struct template weighted_tail_quantile_impl">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,22 +20,22 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../../../document_to_test_formatting/accumulators.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../../../document_to_test_formatting/accumulators.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id330298.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="refentry" lang="en">
+<div class="refentry">
<a name="boost.accumulators.extract.weighted_tail_quantile"></a><div class="titlepage"></div>
<div class="refnamediv">
<h2><span class="refentrytitle">Global weighted_tail_quantile</span></h2>
<p>boost::accumulators::extract::weighted_tail_quantile</p>
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="emphasis"><em>// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">boost/trunk/doc/test/weighted_tail_quantile.hpp</a>>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp" title="Header <boost/git/doc/test/weighted_tail_quantile.hpp>">boost/git/doc/test/weighted_tail_quantile.hpp</a>>
-</em></span>extractor< tag::quantile > const weighted_tail_quantile;</pre></div>
+</span>extractor<span class="special"><</span> <span class="identifier">tag</span><span class="special">::</span><span class="identifier">quantile</span> <span class="special">></span> <span class="keyword">const</span> weighted_tail_quantile<span class="special">;</span></pre></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -44,7 +44,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../../../document_to_test_formatting/accumulators.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../../../document_to_test_formatting/accumulators.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../impl/weighted_tail_quantile__id330298.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Deleted: branches/release/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html
==============================================================================
--- branches/release/doc/test/gold/boost/accumulators/impl/weighted_tail_quantile__id226526.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,91 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Struct template weighted_tail_quantile_impl</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
-<link rel="home" href="../../../index.html" title="Document To Test Formatting">
-<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">
-<link rel="prev" href="../extract/weighted_tail_quantile.html" title="Global weighted_tail_quantile">
-<link rel="next" href="../tag/weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../extract/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../tag/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="refentry" lang="en">
-<a name="boost.accumulators.impl.weighted_tail_quantile__id226526"></a><div class="titlepage"></div>
-<div class="refnamediv">
-<h2><span class="refentrytitle">Struct template weighted_tail_quantile_impl</span></h2>
-<p>boost::accumulators::impl::weighted_tail_quantile_impl — Tail quantile estimation based on order statistics of weighted samples (for both left and right tails). </p>
-</div>
-<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="emphasis"><em>// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">boost/trunk/doc/test/weighted_tail_quantile.hpp</a>>
-
-</em></span><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> Sample, <span class="bold"><strong>typename</strong></span> Weight, <span class="bold"><strong>typename</strong></span> LeftRight>
-<span class="bold"><strong>struct</strong></span> <a class="link" href="weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">weighted_tail_quantile_impl</a> {
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> numeric::functional::average< Weight, std::size_t >::result_type <a name="boost.accumulators.impl.weighted_tail_quantile__id226526.float_type"></a>float_type;
- <span class="bold"><strong>typedef</strong></span> Sample <a name="boost.accumulators.impl.weighted_tail_quantile__id226526.result_type"></a>result_type;
-
- <span class="emphasis"><em>// <a class="link" href="weighted_tail_quantile__id226526.html#boost.accumulators.impl.weighted_tail_quantile__id226526construct-copy-destruct">construct/copy/destruct</a></em></span>
- <a class="link" href="weighted_tail_quantile__id226526.html#id226362-bb">weighted_tail_quantile_impl</a>(dont_care);
-
- <span class="emphasis"><em>// <a class="link" href="weighted_tail_quantile__id226526.html#id226739-bb">public member functions</a></em></span>
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> Args> <span class="type">result_type</span> <a class="link" href="weighted_tail_quantile__id226526.html#id226647-bb">result</a>(Args <span class="bold"><strong>const</strong></span> &) <span class="bold"><strong>const</strong></span>;
-};</pre></div>
-<div class="refsect1" lang="en">
-<a name="id545120"></a><h2>Description</h2>
-<p>An estimator <span class="inlinemediaobject"><img src="../../../images/accumulators/form_0.png"></span> of tail quantiles with level <span class="inlinemediaobject"><img src="../../../images/accumulators/form_1.png"></span> based on order statistics <span class="inlinemediaobject"><img src="../../../images/accumulators/form_2.png"></span> of weighted samples are given by <span class="inlinemediaobject"><img src="../../../images/accumulators/form_3.png"></span> (left tail) and <span class="inlinemediaobject"><img src="../../../images/accumulators/form_4.png"></span> (right tail), where</p>
-<div class="equation">
-<a name="id545243"></a><p class="title"><b>Equation 1. </b></p>
-<div class="equation-contents"><div class="mediaobject" align="center"><img src="../../../images/accumulators/form_5.png" align="middle"></div></div>
-</div>
-<p><br class="equation-break"></p>
-<p>and</p>
-<div class="equation">
-<a name="id545273"></a><p class="title"><b>Equation 2. </b></p>
-<div class="equation-contents"><div class="mediaobject" align="center"><img src="../../../images/accumulators/form_6.png" align="middle"></div></div>
-</div>
-<p><br class="equation-break"></p>
-<p><span class="inlinemediaobject"><img src="../../../images/accumulators/form_7.png"></span> being the number of samples and <span class="inlinemediaobject"><img src="../../../images/accumulators/form_8.png"></span> the sum of all weights.</p>
-<p>
-</p>
-<div class="refsect2" lang="en">
-<a name="id545349"></a><h3>
-<a name="boost.accumulators.impl.weighted_tail_quantile__id226526construct-copy-destruct"></a><code class="computeroutput">weighted_tail_quantile_impl</code>
- public
- construct/copy/destruct</h3>
-<div class="orderedlist"><ol type="1"><li><pre class="literallayout"><a name="id226362-bb"></a>weighted_tail_quantile_impl(dont_care);</pre></li></ol></div>
-</div>
-<div class="refsect2" lang="en">
-<a name="id545388"></a><h3>
-<a name="id226739-bb"></a><code class="computeroutput">weighted_tail_quantile_impl</code> public member functions</h3>
-<div class="orderedlist"><ol type="1"><li><pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> Args> <span class="type">result_type</span> <a name="id226647-bb"></a>result(Args <span class="bold"><strong>const</strong></span> & args) <span class="bold"><strong>const</strong></span>;</pre></li></ol></div>
-</div>
-</div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
- Capeletto<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../extract/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../tag/weighted_tail_quantile.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
Modified: branches/release/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html
==============================================================================
--- branches/release/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html (original)
+++ branches/release/doc/test/gold/boost/accumulators/tag/weighted_tail_quantile.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,12 +1,12 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Struct template weighted_tail_quantile</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Document To Test Formatting">
-<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">
-<link rel="prev" href="../impl/weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">
+<link rel="up" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp" title="Header <boost/git/doc/test/weighted_tail_quantile.hpp>">
+<link rel="prev" href="../impl/weighted_tail_quantile__id330298.html" title="Struct template weighted_tail_quantile_impl">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -19,25 +19,25 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="../impl/weighted_tail_quantile__id330298.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="refentry" lang="en">
+<div class="refentry">
<a name="boost.accumulators.tag.weighted_tail_quantile"></a><div class="titlepage"></div>
<div class="refnamediv">
<h2><span class="refentrytitle">Struct template weighted_tail_quantile</span></h2>
<p>boost::accumulators::tag::weighted_tail_quantile</p>
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="emphasis"><em>// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp" title="Header <boost/trunk/doc/test/weighted_tail_quantile.hpp>">boost/trunk/doc/test/weighted_tail_quantile.hpp</a>>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp" title="Header <boost/git/doc/test/weighted_tail_quantile.hpp>">boost/git/doc/test/weighted_tail_quantile.hpp</a>>
-</em></span><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> LeftRight>
-<span class="bold"><strong>struct</strong></span> <a class="link" href="weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">weighted_tail_quantile</a> : <span class="bold"><strong>public</strong></span> boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >
-{
-};</pre></div>
+</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> LeftRight<span class="special">></span>
+<span class="keyword">struct</span> <a class="link" href="weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">weighted_tail_quantile</a> <span class="special">:</span> <span class="keyword">public</span> boost::accumulators::depends_on< sum_of_weights, tail_weights< LeftRight > >
+<span class="special">{</span>
+<span class="special">}</span><span class="special">;</span></pre></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -46,7 +46,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../impl/weighted_tail_quantile__id226526.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.trunk.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="../impl/weighted_tail_quantile__id330298.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../document_to_test_formatting/accumulators.html#header.boost.git.doc.test.weighted_tail_quantile_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/boost/array.html
==============================================================================
--- branches/release/doc/test/gold/boost/array.html (original)
+++ branches/release/doc/test/gold/boost/array.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template array</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../document_to_test_formatting/array.html#header.boost.array_hpp" title="Header <boost/array.hpp>">
<link rel="prev" href="../document_to_test_formatting/array.html" title="Array Example Boostbook XML Documentation">
@@ -20,165 +20,165 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../document_to_test_formatting/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../document_to_test_formatting/array.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="refentry" lang="en">
+<div class="refentry">
<a name="boost.array"></a><div class="titlepage"></div>
<div class="refnamediv">
<h2><span class="refentrytitle">Class template array</span></h2>
<p>boost::array — STL compliant container wrapper for arrays of constant size</p>
</div>
<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
-<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="emphasis"><em>// In header: <<a class="link" href="../document_to_test_formatting/array.html#header.boost.array_hpp" title="Header <boost/array.hpp>">boost/array.hpp</a>>
+<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../document_to_test_formatting/array.html#header.boost.array_hpp" title="Header <boost/array.hpp>">boost/array.hpp</a>>
-</em></span><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
-<span class="bold"><strong>class</strong></span> <a class="link" href="array.html" title="Class template array">array</a> {
-<span class="bold"><strong>public</strong></span>:
- <span class="emphasis"><em>// types</em></span>
- <span class="bold"><strong>typedef</strong></span> T <a name="boost.array.value_type"></a>value_type;
- <span class="bold"><strong>typedef</strong></span> T* <a name="boost.array.iterator"></a>iterator;
- <span class="bold"><strong>typedef</strong></span> <span class="bold"><strong>const</strong></span> T* <a name="boost.array.const_iterator"></a>const_iterator;
- <span class="bold"><strong>typedef</strong></span>
- std::reverse_iterator<iterator>
- <a name="boost.array.reverse_iterator"></a>reverse_iterator;
- <span class="bold"><strong>typedef</strong></span>
- std::reverse_iterator<const_iterator>
- <a name="boost.array.const_reverse_iterator"></a>const_reverse_iterator;
- <span class="bold"><strong>typedef</strong></span> T& <a name="boost.array.reference"></a>reference;
- <span class="bold"><strong>typedef</strong></span> <span class="bold"><strong>const</strong></span> T& <a name="boost.array.const_reference"></a>const_reference;
- <span class="bold"><strong>typedef</strong></span> std::size_t <a name="boost.array.size_type"></a>size_type;
- <span class="bold"><strong>typedef</strong></span> std::ptrdiff_t <a name="boost.array.difference_type"></a>difference_type;
+</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+<span class="keyword">class</span> <a class="link" href="array.html" title="Class template array">array</a> <span class="special">{</span>
+<span class="keyword">public</span><span class="special">:</span>
+ <span class="comment">// types</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span> <a name="boost.array.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span><span class="special">*</span> <a name="boost.array.iterator"></a><span class="identifier">iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">*</span> <a name="boost.array.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span>
+ std::reverse_iterator<span class="special"><</span><span class="identifier">iterator</span><span class="special">></span>
+ <a name="boost.array.reverse_iterator"></a><span class="identifier">reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span>
+ std::reverse_iterator<span class="special"><</span><span class="identifier">const_iterator</span><span class="special">></span>
+ <a name="boost.array.const_reverse_iterator"></a><span class="identifier">const_reverse_iterator</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span><span class="special">&</span> <a name="boost.array.reference"></a><span class="identifier">reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <a name="boost.array.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <a name="boost.array.size_type"></a><span class="identifier">size_type</span><span class="special">;</span>
+ <span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">ptrdiff_t</span> <a name="boost.array.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span>
- <span class="emphasis"><em>// static constants</em></span>
- <span class="bold"><strong>static</strong></span> <span class="bold"><strong>const</strong></span> <span class="type">size_type</span> static_size = N;
+ <span class="comment">// static constants</span>
+ <span class="keyword">static</span> <span class="keyword">const</span> <span class="identifier">size_type</span> <span class="identifier">static_size</span> = <span class="identifier">N</span><span class="special">;</span>
- <span class="emphasis"><em>// <a class="link" href="array.html#boost.arrayconstruct-copy-destruct">construct/copy/destruct</a></em></span>
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> U>
- array& <a class="link" href="array.html#id225116-bb"><span class="bold"><strong>operator</strong></span>=</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><U, N>&
- );
+ <span class="comment">// <a class="link" href="array.html#boost.arrayconstruct-copy-destruct">construct/copy/destruct</a></span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span>
+ array& <a class="link" href="array.html#id330697-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">U</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
- <span class="emphasis"><em>// <a class="link" href="array.html#id225163-bb">iterator support</a></em></span>
- <span class="type">iterator</span> <a class="link" href="array.html#id225172-bb">begin</a>();
- <span class="type">const_iterator</span> <a class="link" href="array.html#id225179-bb">begin</a>() <span class="bold"><strong>const</strong></span>;
- <span class="type">iterator</span> <a class="link" href="array.html#id225209-bb">end</a>();
- <span class="type">const_iterator</span> <a class="link" href="array.html#id185009-bb">end</a>() <span class="bold"><strong>const</strong></span>;
+ <span class="comment">// <a class="link" href="array.html#id330738-bb">iterator support</a></span>
+ <span class="identifier">iterator</span> <a class="link" href="array.html#id330746-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> <a class="link" href="array.html#id330753-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">iterator</span> <a class="link" href="array.html#id330779-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_iterator</span> <a class="link" href="array.html#id330785-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="emphasis"><em>// <a class="link" href="array.html#id185036-bb">reverse iterator support</a></em></span>
- <span class="type">reverse_iterator</span> <a class="link" href="array.html#id185046-bb">rbegin</a>();
- <span class="type">const_reverse_iterator</span> <a class="link" href="array.html#id185053-bb">rbegin</a>() <span class="bold"><strong>const</strong></span>;
- <span class="type">reverse_iterator</span> <a class="link" href="array.html#id185076-bb">rend</a>();
- <span class="type">const_reverse_iterator</span> <a class="link" href="array.html#id185084-bb">rend</a>() <span class="bold"><strong>const</strong></span>;
+ <span class="comment">// <a class="link" href="array.html#id330809-bb">reverse iterator support</a></span>
+ <span class="identifier">reverse_iterator</span> <a class="link" href="array.html#id330817-bb"><span class="identifier">rbegin</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> <a class="link" href="array.html#id330824-bb"><span class="identifier">rbegin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reverse_iterator</span> <a class="link" href="array.html#id330845-bb"><span class="identifier">rend</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reverse_iterator</span> <a class="link" href="array.html#id330851-bb"><span class="identifier">rend</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="emphasis"><em>// <a class="link" href="array.html#id185103-bb">capacity</a></em></span>
- <span class="type">size_type</span> <a class="link" href="array.html#id185107-bb">size</a>();
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="array.html#id185128-bb">empty</a>();
- <span class="type">size_type</span> <a class="link" href="array.html#id185156-bb">max_size</a>();
+ <span class="comment">// <a class="link" href="array.html#id330868-bb">capacity</a></span>
+ <span class="identifier">size_type</span> <a class="link" href="array.html#id330872-bb"><span class="identifier">size</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="keyword">bool</span> <a class="link" href="array.html#id330890-bb"><span class="identifier">empty</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">size_type</span> <a class="link" href="array.html#id330914-bb"><span class="identifier">max_size</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
- <span class="emphasis"><em>// <a class="link" href="array.html#id155125-bb">element access</a></em></span>
- <span class="type">reference</span> <a class="link" href="array.html#id155134-bb"><span class="bold"><strong>operator</strong></span>[]</a>(size_type);
- <span class="type">const_reference</span> <a class="link" href="array.html#id155151-bb"><span class="bold"><strong>operator</strong></span>[]</a>(size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> <a class="link" href="array.html#id155207-bb">at</a>(size_type);
- <span class="type">const_reference</span> <a class="link" href="array.html#id155224-bb">at</a>(size_type) <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> <a class="link" href="array.html#id155281-bb">front</a>();
- <span class="type">const_reference</span> <a class="link" href="array.html#id155288-bb">front</a>() <span class="bold"><strong>const</strong></span>;
- <span class="type">reference</span> <a class="link" href="array.html#id155329-bb">back</a>();
- <span class="type">const_reference</span> <a class="link" href="array.html#id155336-bb">back</a>() <span class="bold"><strong>const</strong></span>;
- <span class="type"><span class="bold"><strong>const</strong></span> T*</span> <a class="link" href="array.html#id155372-bb">data</a>() <span class="bold"><strong>const</strong></span>;
- <span class="type">T*</span> <a class="link" href="array.html#id227218-bb">c_array</a>();
+ <span class="comment">// <a class="link" href="array.html#id330939-bb">element access</a></span>
+ <span class="identifier">reference</span> <a class="link" href="array.html#id330947-bb"><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> <a class="link" href="array.html#id330962-bb"><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> <a class="link" href="array.html#id331010-bb"><span class="identifier">at</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> <a class="link" href="array.html#id331025-bb"><span class="identifier">at</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> <a class="link" href="array.html#id331085-bb"><span class="identifier">front</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> <a class="link" href="array.html#id331093-bb"><span class="identifier">front</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">reference</span> <a class="link" href="array.html#id331140-bb"><span class="identifier">back</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">const_reference</span> <a class="link" href="array.html#id331148-bb"><span class="identifier">back</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="keyword">const</span> <span class="identifier">T</span><span class="special">*</span> <a class="link" href="array.html#id331189-bb"><span class="identifier">data</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="identifier">T</span><span class="special">*</span> <a class="link" href="array.html#id331222-bb"><span class="identifier">c_array</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
- <span class="emphasis"><em>// <a class="link" href="array.html#id227247-bb">modifiers</a></em></span>
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a class="link" href="array.html#id227252-bb">swap</a>(
- <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a class="link" href="array.html#id227310-bb">assign</a>(<span class="bold"><strong>const</strong></span> T&);
- <span class="type">T</span> elems[N];
-};
+ <span class="comment">// <a class="link" href="array.html#id331255-bb">modifiers</a></span>
+ <span class="keyword">void</span> <a class="link" href="array.html#id331260-bb"><span class="identifier">swap</span></a><span class="special">(</span>
+ <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+ <span class="keyword">void</span> <a class="link" href="array.html#id331322-bb"><span class="identifier">assign</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span><span class="special">)</span><span class="special">;</span>
+ <span class="identifier">T</span> elems[N]<span class="special">;</span>
+<span class="special">}</span><span class="special">;</span>
-<span class="emphasis"><em>// <a class="link" href="array.html#id227358-bb">specialized algorithms</a></em></span>
-<span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a class="link" href="array.html#boost.swap">swap</a>(
- <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- ,
+<span class="comment">// <a class="link" href="array.html#id331374-bb">specialized algorithms</a></span>
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">void</span> <a class="link" href="array.html#boost.array.swap"><span class="identifier">swap</span></a><span class="special">(</span>
+ <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );
+ <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
-<span class="emphasis"><em>// <a class="link" href="array.html#id227444-bb">comparisons</a></em></span>
-<span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="array.html#boost.operator=="><span class="bold"><strong>operator</strong></span>==</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- ,
+<span class="comment">// <a class="link" href="array.html#id331464-bb">comparisons</a></span>
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="array.html#boost.array.operator=="><span class="keyword">operator</span><span class="special">==</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );
-<span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="array.html#boost.operator!="><span class="bold"><strong>operator</strong></span>!=</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="array.html#boost.array.operator!="><span class="keyword">operator</span><span class="special">!=</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );
-<span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="array.html#boost.operator_id227596"><span class="bold"><strong>operator</strong></span><</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="array.html#boost.array.operator_id331625"><span class="keyword">operator</span><span class="special"><</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );
-<span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="array.html#boost.operator_id227679"><span class="bold"><strong>operator</strong></span>></a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="array.html#boost.array.operator_id331712"><span class="keyword">operator</span><span class="special">></span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );
-<span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="array.html#boost.operator_=_id227747"><span class="bold"><strong>operator</strong></span><=</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="array.html#boost.array.operator_=_id332055"><span class="keyword">operator</span><span class="special"><=</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );
-<span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="array.html#boost.operator_=_id227814"><span class="bold"><strong>operator</strong></span>>=</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="array.html#boost.array.operator_=_id332127"><span class="keyword">operator</span><span class="special">>=</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- );</pre></div>
-<div class="refsect1" lang="en">
-<a name="id542541"></a><h2>Description</h2>
-<div class="refsect2" lang="en">
-<a name="id542545"></a><h3>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span></pre></div>
+<div class="refsect1">
+<a name="id776079"></a><h2>Description</h2>
+<div class="refsect2">
+<a name="id776083"></a><h3>
<a name="boost.arrayconstruct-copy-destruct"></a><code class="computeroutput">array</code>
public
construct/copy/destruct</h3>
-<div class="orderedlist"><ol type="1"><li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> U>
- array& <a name="id225116-bb"></a><span class="bold"><strong>operator</strong></span>=(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><U, N>&
- other);</pre>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span>
+ array& <a name="id330697-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">U</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ other<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
<td><p><span class="term">Effects:</span></p></td>
<td>
<code class="computeroutput">
- std::copy(rhs.<a class="link" href="array.html#id225167-bb">begin</a>(),rhs.<a class="link" href="array.html#id225205-bb">end</a>(), <a class="link" href="array.html#id225167-bb">begin</a>())
+ std::copy(rhs.<a class="link" href="array.html#id330742-bb">begin</a>(),rhs.<a class="link" href="array.html#id330775-bb">end</a>(), <a class="link" href="array.html#id330742-bb">begin</a>())
</code>
</td>
</tr></tbody>
</table></div>
</li></ol></div>
</div>
-<div class="refsect2" lang="en">
-<a name="id542665"></a><h3>
-<a name="id225163-bb"></a><code class="computeroutput">array</code> iterator support</h3>
-<div class="orderedlist"><ol type="1">
-<li>
-<pre class="literallayout"><a name="id225167-bb"></a><span class="type">iterator</span> <a name="id225172-bb"></a>begin();
-<span class="type">const_iterator</span> <a name="id225179-bb"></a>begin() <span class="bold"><strong>const</strong></span>;</pre>
+<div class="refsect2">
+<a name="id776239"></a><h3>
+<a name="id330738-bb"></a><code class="computeroutput">array</code> iterator support</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><a name="id330742-bb"></a><span class="identifier">iterator</span> <a name="id330746-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_iterator</span> <a name="id330753-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -193,9 +193,9 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><a name="id225205-bb"></a><span class="type">iterator</span> <a name="id225209-bb"></a>end();
-<span class="type">const_iterator</span> <a name="id185009-bb"></a>end() <span class="bold"><strong>const</strong></span>;</pre>
+<li class="listitem">
+<pre class="literallayout"><a name="id330775-bb"></a><span class="identifier">iterator</span> <a name="id330779-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_iterator</span> <a name="id330785-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -212,13 +212,13 @@
</li>
</ol></div>
</div>
-<div class="refsect2" lang="en">
-<a name="id542810"></a><h3>
-<a name="id185036-bb"></a><code class="computeroutput">array</code> reverse iterator support</h3>
-<div class="orderedlist"><ol type="1">
-<li>
-<pre class="literallayout"><a name="id185041-bb"></a><span class="type">reverse_iterator</span> <a name="id185046-bb"></a>rbegin();
-<span class="type">const_reverse_iterator</span> <a name="id185053-bb"></a>rbegin() <span class="bold"><strong>const</strong></span>;</pre>
+<div class="refsect2">
+<a name="id776441"></a><h3>
+<a name="id330809-bb"></a><code class="computeroutput">array</code> reverse iterator support</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><a name="id330813-bb"></a><span class="identifier">reverse_iterator</span> <a name="id330817-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_reverse_iterator</span> <a name="id330824-bb"></a><span class="identifier">rbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
@@ -227,9 +227,9 @@
</tr></tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><a name="id185072-bb"></a><span class="type">reverse_iterator</span> <a name="id185076-bb"></a>rend();
-<span class="type">const_reverse_iterator</span> <a name="id185084-bb"></a>rend() <span class="bold"><strong>const</strong></span>;</pre>
+<li class="listitem">
+<pre class="literallayout"><a name="id330841-bb"></a><span class="identifier">reverse_iterator</span> <a name="id330845-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_reverse_iterator</span> <a name="id330851-bb"></a><span class="identifier">rend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
@@ -240,12 +240,12 @@
</li>
</ol></div>
</div>
-<div class="refsect2" lang="en">
-<a name="id542942"></a><h3>
-<a name="id185103-bb"></a><code class="computeroutput">array</code> capacity</h3>
-<div class="orderedlist"><ol type="1">
-<li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id185107-bb"></a>size();</pre>
+<div class="refsect2">
+<a name="id776632"></a><h3>
+<a name="id330868-bb"></a><code class="computeroutput">array</code> capacity</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id330872-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
@@ -256,8 +256,8 @@
</tr></tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="id185128-bb"></a>empty();</pre>
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">bool</span> <a name="id330890-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -274,8 +274,8 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="type">size_type</span> <a name="id185156-bb"></a>max_size();</pre>
+<li class="listitem">
+<pre class="literallayout"><span class="identifier">size_type</span> <a name="id330914-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -294,13 +294,13 @@
</li>
</ol></div>
</div>
-<div class="refsect2" lang="en">
-<a name="id543096"></a><h3>
-<a name="id155125-bb"></a><code class="computeroutput">array</code> element access</h3>
-<div class="orderedlist"><ol type="1">
-<li>
-<pre class="literallayout"><a name="id155129-bb"></a><span class="type">reference</span> <a name="id155134-bb"></a><span class="bold"><strong>operator</strong></span>[](size_type i);
-<span class="type">const_reference</span> <a name="id155151-bb"></a><span class="bold"><strong>operator</strong></span>[](size_type i) <span class="bold"><strong>const</strong></span>;</pre>
+<div class="refsect2">
+<a name="id776819"></a><h3>
+<a name="id330939-bb"></a><code class="computeroutput">array</code> element access</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><a name="id330943-bb"></a><span class="identifier">reference</span> <a name="id330947-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="identifier">size_type</span> i<span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_reference</span> <a name="id330962-bb"></a><span class="keyword">operator</span><span class="special">[</span><span class="special">]</span><span class="special">(</span><span class="identifier">size_type</span> i<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -323,9 +323,9 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><a name="id155202-bb"></a><span class="type">reference</span> <a name="id155207-bb"></a>at(size_type i);
-<span class="type">const_reference</span> <a name="id155224-bb"></a>at(size_type i) <span class="bold"><strong>const</strong></span>;</pre>
+<li class="listitem">
+<pre class="literallayout"><a name="id331006-bb"></a><span class="identifier">reference</span> <a name="id331010-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="identifier">size_type</span> i<span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_reference</span> <a name="id331025-bb"></a><span class="identifier">at</span><span class="special">(</span><span class="identifier">size_type</span> i<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -346,9 +346,9 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><a name="id155276-bb"></a><span class="type">reference</span> <a name="id155281-bb"></a>front();
-<span class="type">const_reference</span> <a name="id155288-bb"></a>front() <span class="bold"><strong>const</strong></span>;</pre>
+<li class="listitem">
+<pre class="literallayout"><a name="id331080-bb"></a><span class="identifier">reference</span> <a name="id331085-bb"></a><span class="identifier">front</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_reference</span> <a name="id331093-bb"></a><span class="identifier">front</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -369,9 +369,9 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><a name="id155324-bb"></a><span class="type">reference</span> <a name="id155329-bb"></a>back();
-<span class="type">const_reference</span> <a name="id155336-bb"></a>back() <span class="bold"><strong>const</strong></span>;</pre>
+<li class="listitem">
+<pre class="literallayout"><a name="id331135-bb"></a><span class="identifier">reference</span> <a name="id331140-bb"></a><span class="identifier">back</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
+<span class="identifier">const_reference</span> <a name="id331148-bb"></a><span class="identifier">back</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -392,8 +392,8 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>const</strong></span> T*</span> <a name="id155372-bb"></a>data() <span class="bold"><strong>const</strong></span>;</pre>
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">const</span> <span class="identifier">T</span><span class="special">*</span> <a name="id331189-bb"></a><span class="identifier">data</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -410,8 +410,8 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="type">T*</span> <a name="id227218-bb"></a>c_array();</pre>
+<li class="listitem">
+<pre class="literallayout"><span class="identifier">T</span><span class="special">*</span> <a name="id331222-bb"></a><span class="identifier">c_array</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -430,14 +430,14 @@
</li>
</ol></div>
</div>
-<div class="refsect2" lang="en">
-<a name="id543547"></a><h3>
-<a name="id227247-bb"></a><code class="computeroutput">array</code> modifiers</h3>
-<div class="orderedlist"><ol type="1">
-<li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id227252-bb"></a>swap(
- <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- other);</pre>
+<div class="refsect2">
+<a name="id777440"></a><h3>
+<a name="id331255-bb"></a><code class="computeroutput">array</code> modifiers</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">void</span> <a name="id331260-bb"></a><span class="identifier">swap</span><span class="special">(</span>
+ <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ other<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -445,7 +445,7 @@
<td><p><span class="term">Effects:</span></p></td>
<td>
<code class="computeroutput">
- std::swap_ranges(<a class="link" href="array.html#id225167-bb">begin</a>(), <a class="link" href="array.html#id225205-bb">end</a>(), other.<a class="link" href="array.html#id225167-bb">begin</a>())
+ std::swap_ranges(<a class="link" href="array.html#id330742-bb">begin</a>(), <a class="link" href="array.html#id330775-bb">end</a>(), other.<a class="link" href="array.html#id330742-bb">begin</a>())
</code>
</td>
</tr>
@@ -458,15 +458,15 @@
</tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="type"><span class="bold"><strong>void</strong></span></span> <a name="id227310-bb"></a>assign(<span class="bold"><strong>const</strong></span> T& value);</pre>
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">void</span> <a name="id331322-bb"></a><span class="identifier">assign</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> value<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
<td><p><span class="term">Effects:</span></p></td>
<td>
<code class="computeroutput">
- std::fill_n(<a class="link" href="array.html#id225167-bb">begin</a>(), N, value)
+ std::fill_n(<a class="link" href="array.html#id330742-bb">begin</a>(), N, value)
</code>
</td>
</tr></tbody>
@@ -474,17 +474,17 @@
</li>
</ol></div>
</div>
-<div class="refsect2" lang="en">
-<a name="id543718"></a><h3>
-<a name="id227358-bb"></a><code class="computeroutput">array</code> specialized algorithms</h3>
-<div class="orderedlist"><ol type="1"><li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a name="boost.swap"></a>swap(
- <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- x,
+<div class="refsect2">
+<a name="id777654"></a><h3>
+<a name="id331374-bb"></a><code class="computeroutput">array</code> specialized algorithms</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">void</span> <a name="boost.array.swap"></a><span class="identifier">swap</span><span class="special">(</span>
+ <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ x<span class="special">,</span>
- <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- y);</pre>
+ <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ y<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody>
@@ -492,7 +492,7 @@
<td><p><span class="term">Effects:</span></p></td>
<td>
<code class="computeroutput">
- x.<a class="link" href="array.html#id227252-bb">swap</a>(y)
+ x.<a class="link" href="array.html#id331260-bb">swap</a>(y)
</code>
</td>
</tr>
@@ -504,38 +504,38 @@
</table></div>
</li></ol></div>
</div>
-<div class="refsect2" lang="en">
-<a name="id543830"></a><h3>
-<a name="id227444-bb"></a><code class="computeroutput">array</code> comparisons</h3>
-<div class="orderedlist"><ol type="1">
-<li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="boost.operator=="></a><span class="bold"><strong>operator</strong></span>==(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- x,
+<div class="refsect2">
+<a name="id777853"></a><h3>
+<a name="id331464-bb"></a><code class="computeroutput">array</code> comparisons</h3>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a name="boost.array.operator=="></a><span class="keyword">operator</span><span class="special">==</span><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ x<span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- y);</pre>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ y<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
<td><p><span class="term">Returns:</span></p></td>
<td>
<code class="computeroutput">
- std::equal(x.<a class="link" href="array.html#id225167-bb">begin</a>(), x.<a class="link" href="array.html#id225205-bb">end</a>(), y.<a class="link" href="array.html#id225167-bb">begin</a>())
+ std::equal(x.<a class="link" href="array.html#id330742-bb">begin</a>(), x.<a class="link" href="array.html#id330775-bb">end</a>(), y.<a class="link" href="array.html#id330742-bb">begin</a>())
</code>
</td>
</tr></tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="boost.operator!="></a><span class="bold"><strong>operator</strong></span>!=(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- x,
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a name="boost.array.operator!="></a><span class="keyword">operator</span><span class="special">!=</span><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ x<span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- y);</pre>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ y<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
@@ -546,34 +546,34 @@
</tr></tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="boost.operator_id227596"></a><span class="bold"><strong>operator</strong></span><(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- x,
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a name="boost.array.operator_id331625"></a><span class="keyword">operator</span><span class="special"><</span><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ x<span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- y);</pre>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ y<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
<td><p><span class="term">Returns:</span></p></td>
<td>
<code class="computeroutput">
- std::lexicographical_compare(x.<a class="link" href="array.html#id225167-bb">begin</a>(), x.<a class="link" href="array.html#id225205-bb">end</a>(), y.<a class="link" href="array.html#id225167-bb">begin</a>(), y.<a class="link" href="array.html#id225205-bb">end</a>())
+ std::lexicographical_compare(x.<a class="link" href="array.html#id330742-bb">begin</a>(), x.<a class="link" href="array.html#id330775-bb">end</a>(), y.<a class="link" href="array.html#id330742-bb">begin</a>(), y.<a class="link" href="array.html#id330775-bb">end</a>())
</code>
</td>
</tr></tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="boost.operator_id227679"></a><span class="bold"><strong>operator</strong></span>>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- x,
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a name="boost.array.operator_id331712"></a><span class="keyword">operator</span><span class="special">></span><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ x<span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- y);</pre>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ y<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
@@ -584,14 +584,14 @@
</tr></tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="boost.operator_=_id227747"></a><span class="bold"><strong>operator</strong></span><=(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- x,
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a name="boost.array.operator_=_id332055"></a><span class="keyword">operator</span><span class="special"><=</span><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ x<span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- y);</pre>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ y<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
@@ -602,14 +602,14 @@
</tr></tbody>
</table></div>
</li>
-<li>
-<pre class="literallayout"><span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a name="boost.operator_=_id227814"></a><span class="bold"><strong>operator</strong></span>>=(
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- x,
+<li class="listitem">
+<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a name="boost.array.operator_=_id332127"></a><span class="keyword">operator</span><span class="special">>=</span><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ x<span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="array.html" title="Class template array">array</a><T, N>&
- y);</pre>
+ <span class="keyword">const</span> <a class="link" href="array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ y<span class="special">)</span><span class="special">;</span></pre>
<div class="variablelist"><table border="0">
<col align="left" valign="top">
<tbody><tr>
@@ -626,7 +626,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -635,7 +635,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../document_to_test_formatting/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../document_to_test_formatting/array.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../document_to_test_formatting/array.html#header.boost.array_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../document_to_test_formatting/accumulators.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/accumulators.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/accumulators.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/accumulators.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Accumulators Example Doxygen Documentation</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="../boost/array.html" title="Class template array">
@@ -20,41 +20,41 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../boost/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../boost/array.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.accumulators"></a><a class="link" href="accumulators.html" title="Accumulators Example Doxygen Documentation"> Accumulators
Example Doxygen Documentation</a>
</h2></div></div></div>
<div class="toc"><dl><dt><span class="section">Statistics Library Reference</span></dt></dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="statistics_library_reference"></a>Statistics Library Reference</h3></div></div></div>
-<div class="toc"><dl><dt><span class="section">Header <boost/trunk/doc/test/weighted_tail_quantile.hpp></span></dt></dl></div>
-<div class="section" lang="en">
+<div class="toc"><dl><dt><span class="section">Header <boost/git/doc/test/weighted_tail_quantile.hpp></span></dt></dl></div>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="header.boost.trunk.doc.test.weighted_tail_quantile_hpp"></a>Header <boost/trunk/doc/test/weighted_tail_quantile.hpp></h4></div></div></div>
-<pre class="synopsis"><span class="bold"><strong>namespace</strong></span> boost {
- <span class="bold"><strong>namespace</strong></span> accumulators {
- <span class="bold"><strong>namespace</strong></span> extract {
- extractor< tag::quantile > const <a class="link" href="../boost/accumulators/extract/weighted_tail_quantile.html" title="Global weighted_tail_quantile">weighted_tail_quantile</a>;
- }
- <span class="bold"><strong>namespace</strong></span> impl {
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> Sample, <span class="bold"><strong>typename</strong></span> Weight, <span class="bold"><strong>typename</strong></span> LeftRight>
- <span class="bold"><strong>struct</strong></span> <a class="link" href="../boost/accumulators/impl/weighted_tail_quantile__id226526.html" title="Struct template weighted_tail_quantile_impl">weighted_tail_quantile_impl</a>;
- }
- <span class="bold"><strong>namespace</strong></span> tag {
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> LeftRight> <span class="bold"><strong>struct</strong></span> <a class="link" href="../boost/accumulators/tag/weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">weighted_tail_quantile</a>;
- }
- }
-}</pre>
+<a name="header.boost.git.doc.test.weighted_tail_quantile_hpp"></a>Header <boost/git/doc/test/weighted_tail_quantile.hpp></h4></div></div></div>
+<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span>
+ <span class="keyword">namespace</span> <span class="identifier">accumulators</span> <span class="special">{</span>
+ <span class="keyword">namespace</span> <span class="identifier">extract</span> <span class="special">{</span>
+ extractor<span class="special"><</span> <span class="identifier">tag</span><span class="special">::</span><span class="identifier">quantile</span> <span class="special">></span> <span class="keyword">const</span> <a class="link" href="../boost/accumulators/extract/weighted_tail_quantile.html" title="Global weighted_tail_quantile">weighted_tail_quantile</a><span class="special">;</span>
+ <span class="special">}</span>
+ <span class="keyword">namespace</span> <span class="identifier">impl</span> <span class="special">{</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Sample<span class="special">,</span> <span class="keyword">typename</span> Weight<span class="special">,</span> <span class="keyword">typename</span> LeftRight<span class="special">></span>
+ <span class="keyword">struct</span> <a class="link" href="../boost/accumulators/impl/weighted_tail_quantile__id330298.html" title="Struct template weighted_tail_quantile_impl">weighted_tail_quantile_impl</a><span class="special">;</span>
+ <span class="special">}</span>
+ <span class="keyword">namespace</span> <span class="identifier">tag</span> <span class="special">{</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> LeftRight<span class="special">></span> <span class="keyword">struct</span> <a class="link" href="../boost/accumulators/tag/weighted_tail_quantile.html" title="Struct template weighted_tail_quantile">weighted_tail_quantile</a><span class="special">;</span>
+ <span class="special">}</span>
+ <span class="special">}</span>
+<span class="special">}</span></pre>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -63,7 +63,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../boost/array.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../boost/array.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/accumulators/extract/weighted_tail_quantile.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/array.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/array.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/array.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Array Example Boostbook XML Documentation</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="remez.html" title="Sample Article (The Remez Method)">
@@ -20,21 +20,21 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="remez.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="remez.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.array"></a><a class="link" href="array.html" title="Array Example Boostbook XML Documentation"> Array Example Boostbook
XML Documentation</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section">Introduction</span></dt>
-<dt><span class="section">Reference</span></dt>
+<dt><span class="section">Reference</span></dt>
<dt><span class="section">Design Rationale</span></dt>
<dt><span class="section">For more information...</span></dt>
<dt><span class="section">Acknowledgements</span></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="array.intro"></a>Introduction</h3></div></div></div>
<p>The C++ Standard Template Library STL as part of the C++
@@ -70,90 +70,90 @@
Standard). The reasons array is not an reversible STL container is
because:
</p>
-<div class="itemizedlist"><ul type="disc" compact>
-<li>No constructors are provided.</li>
-<li>Elements may have an undetermined initial value (see <a class="xref" href="array.html#array.rationale" title="Design Rationale">the section called “Design Rationale”</a>).</li>
-<li>
-<code class="computeroutput"><a class="link" href="../boost/array.html#boost.swap">swap</a></code>() has no constant complexity.</li>
-<li>
-<code class="computeroutput"><a class="link" href="../boost/array.html#id185107-bb">size</a></code>() is always constant, based on the second template argument of the type.</li>
-<li>The container provides no allocator support.</li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc" compact>
+<li class="listitem">No constructors are provided.</li>
+<li class="listitem">Elements may have an undetermined initial value (see <a class="xref" href="array.html#array.rationale" title="Design Rationale">the section called “Design Rationale”</a>).</li>
+<li class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#boost.array.swap">swap</a></code>() has no constant complexity.</li>
+<li class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#id330872-bb">size</a></code>() is always constant, based on the second template argument of the type.</li>
+<li class="listitem">The container provides no allocator support.</li>
</ul></div>
<p>
</p>
<p>It doesn't fulfill the requirements of a "sequence" (see Section 23.1.1, [lib.sequence.reqmts] of the C++ Standard), except that:
</p>
-<div class="itemizedlist"><ul type="disc" compact>
-<li>
-<code class="computeroutput"><a class="link" href="../boost/array.html#id155276-bb">front</a></code>() and <code class="computeroutput"><a class="link" href="../boost/array.html#id155324-bb">back</a></code>() are provided.</li>
-<li>
-<code class="computeroutput"><a class="link" href="../boost/array.html#id155129-bb">operator[]</a></code> and <code class="computeroutput"><a class="link" href="../boost/array.html#id155202-bb">at</a></code>() are provided.</li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc" compact>
+<li class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#id331080-bb">front</a></code>() and <code class="computeroutput"><a class="link" href="../boost/array.html#id331135-bb">back</a></code>() are provided.</li>
+<li class="listitem">
+<code class="computeroutput"><a class="link" href="../boost/array.html#id330943-bb">operator[]</a></code> and <code class="computeroutput"><a class="link" href="../boost/array.html#id331006-bb">at</a></code>() are provided.</li>
</ul></div>
<p>
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="id540764"></a>Reference</h3></div></div></div>
+<a name="id772289"></a>Reference</h3></div></div></div>
<div class="toc"><dl><dt><span class="section">Header <boost/array.hpp></span></dt></dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="header.boost.array_hpp"></a>Header <boost/array.hpp></h4></div></div></div>
-<pre class="synopsis"><span class="bold"><strong>namespace</strong></span> boost {
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N> <span class="bold"><strong>class</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a>;
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>void</strong></span></span> <a class="link" href="../boost/array.html#boost.swap">swap</a>(
- <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- ,
+<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span> <span class="keyword">class</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special">;</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">void</span> <a class="link" href="../boost/array.html#boost.array.swap"><span class="identifier">swap</span></a><span class="special">(</span>
+ <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- );
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="../boost/array.html#boost.operator=="><span class="bold"><strong>operator</strong></span>==</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- ,
+ <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="../boost/array.html#boost.array.operator=="><span class="keyword">operator</span><span class="special">==</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- );
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="../boost/array.html#boost.operator!="><span class="bold"><strong>operator</strong></span>!=</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="../boost/array.html#boost.array.operator!="><span class="keyword">operator</span><span class="special">!=</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- );
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="../boost/array.html#boost.operator_id227596"><span class="bold"><strong>operator</strong></span><</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="../boost/array.html#boost.array.operator_id331625"><span class="keyword">operator</span><span class="special"><</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- );
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="../boost/array.html#boost.operator_id227679"><span class="bold"><strong>operator</strong></span>></a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="../boost/array.html#boost.array.operator_id331712"><span class="keyword">operator</span><span class="special">></span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- );
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="../boost/array.html#boost.operator_=_id227747"><span class="bold"><strong>operator</strong></span><=</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="../boost/array.html#boost.array.operator_=_id332055"><span class="keyword">operator</span><span class="special"><=</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- );
- <span class="bold"><strong>template</strong></span><<span class="bold"><strong>typename</strong></span> T, std::size_t N>
- <span class="type"><span class="bold"><strong>bool</strong></span></span> <a class="link" href="../boost/array.html#boost.operator_=_id227814"><span class="bold"><strong>operator</strong></span>>=</a>(
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- ,
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+ <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> N<span class="special">></span>
+ <span class="keyword">bool</span> <a class="link" href="../boost/array.html#boost.array.operator_=_id332127"><span class="keyword">operator</span><span class="special">>=</span></a><span class="special">(</span>
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">,</span>
- <span class="bold"><strong>const</strong></span> <a class="link" href="../boost/array.html" title="Class template array">array</a><T, N>&
- );
-}</pre>
+ <span class="keyword">const</span> <a class="link" href="../boost/array.html" title="Class template array">array</a><span class="special"><</span><span class="identifier">T</span><span class="special">,</span> <span class="identifier">N</span><span class="special">></span><span class="special">&</span>
+ <span class="special">)</span><span class="special">;</span>
+<span class="special">}</span></pre>
</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="array.rationale"></a>Design Rationale</h3></div></div></div>
<p>
@@ -162,8 +162,8 @@
Section 8.5.1, [dcl.init.aggr], of the C++ Standard). This would
mean:
</p>
-<div class="itemizedlist"><ul type="disc"><li>
-<p>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<p class="simpara">
An array can be initialized with a
brace-enclosing, comma-separated list of initializers for the
elements of the container, written in increasing subscript
@@ -172,7 +172,7 @@
<pre class="programlisting">
<code class="computeroutput"><a class="link" href="../boost/array.html" title="Class template array">boost::array</a></code><int,4> a = { { 1, 2, 3 } };
</pre>
-<p>
+<p class="simpara">
Note that if there are fewer elements in the
initializer list, then each remaining element gets
default-initialized (thus, it has a defined value).
@@ -187,11 +187,11 @@
</strong></span>, because the rule says
that aggregates may have:
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>No user-declared constructors.</li>
-<li>No private or protected non-static data members.</li>
-<li>No base classes.</li>
-<li>No virtual functions.</li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">No user-declared constructors.</li>
+<li class="listitem">No private or protected non-static data members.</li>
+<li class="listitem">No base classes.</li>
+<li class="listitem">No virtual functions.</li>
</ul></div>
<p>
</p>
@@ -216,7 +216,7 @@
warranty.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="array.more.info"></a>For more information...</h3></div></div></div>
<p>
@@ -225,11 +225,11 @@
</p>
<div class="literallayout"><p><br>
- The C++ Standard Library - A Tutorial and Reference<br>
- by Nicolai M. Josuttis<br>
- Addison Wesley Longman, 1999<br>
- ISBN 0-201-37926-0<br>
- </p></div>
+         The C++ Standard Library - A Tutorial and Reference<br>
+         by Nicolai M. Josuttis<br>
+         Addison Wesley Longman, 1999<br>
+         ISBN 0-201-37926-0<br>
+      </p></div>
<p>
</p>
<p>
@@ -239,7 +239,7 @@
</a>
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="array.ack"></a>Acknowledgements</h3></div></div></div>
<p>Doug Gregor ported the documentation to the BoostBook format.</p>
@@ -247,7 +247,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -256,7 +256,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="remez.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="remez.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/basic_formatting.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/basic_formatting.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/basic_formatting.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Basic Formatting</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="code_blocks.html" title="Code Blocks">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="code_blocks.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="code_blocks.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.basic_formatting"></a><a class="link" href="basic_formatting.html" title="Basic Formatting">Basic Formatting</a>
</h2></div></div></div>
@@ -39,7 +39,7 @@
<dt><span class="section">Blockquote</span></dt>
<dt><span class="section">Headings</span></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.font_styles"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.font_styles" title="Font Styles">Font
Styles</a>
@@ -51,26 +51,23 @@
<span class="underline"><code class="literal">teletype with underline</code></span>.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.replaceable_text"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.replaceable_text" title="Replaceable Text">Replaceable
Text</a>
</h3></div></div></div>
<p>
- Text that is intended to be user-replaceable is
- <em class="replaceable"><code>
- rendered like this
- </code></em>
- .
+ Text that is intended to be user-replaceable is <em class="replaceable"><code>rendered like
+ this</code></em>.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.quotations"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.quotations" title="Quotations">Quotations</a>
</h3></div></div></div>
<p>
- Here we go: “<span class="quote">A question that sometimes drives me hazy: am I or are
- the others crazy?</span>”--Einstein
+ Here we go: <span class="quote">“<span class="quote">A question that sometimes drives me hazy: am I or are
+ the others crazy?</span>”</span>--Einstein
</p>
<p>
Note the proper left and right quote marks. Also, while you can simply use
@@ -81,11 +78,11 @@
Like all phrase elements, quotations may be nested. Example:
</p>
<p>
- “<span class="quote">Here's the rule for bargains: ‘<span class="quote">Do other men, for they would
- do you.</span>’ That's the true business precept.</span>”
+ <span class="quote">“<span class="quote">Here's the rule for bargains: <span class="quote">‘<span class="quote">Do other men, for they would
+ do you.</span>’</span> That's the true business precept.</span>”</span>
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.inline_code"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.inline_code" title="Inline Code">Inline
Code</a>
@@ -95,7 +92,7 @@
in it. The code should be syntax highlighted.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.links"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.links" title="Links">Links</a>
</h3></div></div></div>
@@ -103,40 +100,50 @@
Try this: <a href="http://www.boost.org" target="_top">this is <span class="bold"><strong>boost's</strong></span>
website....</a> it should be visible as a link.
</p>
+<p>
+ This is <a href="../../../../boost/math/distributions.hpp" target="_top">a link to a header
+ file (boost/math/distributions.hpp)</a>, it should be rewritable and
+ point to the website when built as a PDF.
+ </p>
+<p>
+ This is <a href="../../../../libs/regex/index.html" target="_top">a link to another library's
+ documentation (Boost.Regex)</a>, using the boost: protocol, it should
+ be rewritten to point to the website when building a PDF.
+ </p>
+<p>
+ This is <a href="../../../../libs/regex/index.html" target="_top">a link to another library's
+ documentation (Boost.Regex)</a>, using the boost:/ protocol, it should
+ be rewritten to point to the website when building a PDF.
+ </p>
+<p>
+ This is <a href="../../weighted_tail_quantile.hpp" target="_top">a relative link to a header
+ file within the test source</a>, it should be rewritten to point to the
+ website when building a PDF. Although it might be on the website yet.
+ </p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.footnotes"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.footnotes" title="Footnotes">Footnotes</a>
</h3></div></div></div>
<p>
- Here's one
- <sup>[<a name="id537164" href="#ftn.id537164" class="footnote">1</a>]</sup>
- .
+ Here's one <sup>[<a name="id769039" href="#ftn.id769039" class="footnote">1</a>]</sup>.
</p>
<p>
- And here's another
- <sup>[<a name="id537177" href="#ftn.id537177" class="footnote">2</a>]</sup>
- .
+ And here's another <sup>[<a name="id769049" href="#ftn.id769049" class="footnote">2</a>]</sup>.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.blockquote"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.blockquote" title="Blockquote">Blockquote</a>
</h3></div></div></div>
<p>
Lets indent the next paragraph:
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Here we go!!!
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ Here we go!!!
+ </p></blockquote></div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.basic_formatting.headings"></a><a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings" title="Headings">Headings</a>
</h3></div></div></div>
@@ -144,49 +151,49 @@
Now try rendering some heading styles:
</p>
<a name="document_to_test_formatting.basic_formatting.headings.heading_1"></a><h2>
-<a name="id537256"></a>
+<a name="id769110"></a>
<a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_1">Heading
1</a>
</h2>
<a name="document_to_test_formatting.basic_formatting.headings.heading_2"></a><h3>
-<a name="id537280"></a>
+<a name="id769129"></a>
<a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_2">Heading
2</a>
</h3>
<a name="document_to_test_formatting.basic_formatting.headings.heading_3"></a><h4>
-<a name="id537304"></a>
+<a name="id769147"></a>
<a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_3">Heading
3</a>
</h4>
<a name="document_to_test_formatting.basic_formatting.headings.heading_4"></a><h5>
-<a name="id537330"></a>
+<a name="id769165"></a>
<a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_4">Heading
4</a>
</h5>
<a name="document_to_test_formatting.basic_formatting.headings.heading_5"></a><h6>
-<a name="id537354"></a>
+<a name="id769184"></a>
<a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_5">Heading
5</a>
</h6>
<a name="document_to_test_formatting.basic_formatting.headings.heading_6"></a><h4>
-<a name="id537378"></a>
+<a name="id769202"></a>
<a class="link" href="basic_formatting.html#document_to_test_formatting.basic_formatting.headings.heading_6">Heading
6</a>
</h4>
</div>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id537164" href="#id537164" class="para">1</a>] </sup>
- A sample footnote
- </p></div>
-<div class="footnote"><p><sup>[<a name="ftn.id537177" href="#id537177" class="para">2</a>] </sup>
- Another sample footnote
- </p></div>
+<div class="footnote"><p><sup>[<a name="ftn.id769039" href="#id769039" class="para">1</a>] </sup>
+ A sample footnote
+ </p></div>
+<div class="footnote"><p><sup>[<a name="ftn.id769049" href="#id769049" class="para">2</a>] </sup>
+ Another sample footnote
+ </p></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -195,7 +202,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="code_blocks.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="code_blocks.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="blurbs.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/blurbs.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/blurbs.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/blurbs.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Blurbs</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="basic_formatting.html" title="Basic Formatting">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="basic_formatting.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="basic_formatting.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.blurbs"></a><a class="link" href="blurbs.html" title="Blurbs">Blurbs</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
<dt><span class="section">Admonishments</span></dt>
<dt><span class="section">Blurbs</span></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.blurbs.preformatted_text"></a><a class="link" href="blurbs.html#document_to_test_formatting.blurbs.preformatted_text" title="Preformatted text">Preformatted
text</a>
@@ -67,7 +67,7 @@
Standard deviation 1 is greater than standard deviation 2 REJECTED
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.blurbs.admonishments"></a><a class="link" href="blurbs.html#document_to_test_formatting.blurbs.admonishments" title="Admonishments">Admonishments</a>
</h3></div></div></div>
@@ -76,7 +76,7 @@
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -85,7 +85,7 @@
</table></div>
<div class="tip"><table border="0" summary="Tip">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../doc/html/images/tip.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../doc/src/images/tip.png"></td>
<th align="left">Tip</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -94,7 +94,7 @@
</table></div>
<div class="important"><table border="0" summary="Important">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../doc/html/images/important.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../doc/src/images/important.png"></td>
<th align="left">Important</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -103,7 +103,7 @@
</table></div>
<div class="caution"><table border="0" summary="Caution">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../doc/html/images/caution.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../doc/src/images/caution.png"></td>
<th align="left">Caution</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -112,7 +112,7 @@
</table></div>
<div class="warning"><table border="0" summary="Warning">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/html/images/warning.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../doc/src/images/warning.png"></td>
<th align="left">Warning</th>
</tr>
<tr><td align="left" valign="top">
@@ -125,7 +125,7 @@
</td></tr>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.blurbs.blurbs"></a><a class="link" href="blurbs.html#document_to_test_formatting.blurbs.blurbs" title="Blurbs">Blurbs</a>
</h3></div></div></div>
@@ -145,7 +145,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -154,7 +154,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="basic_formatting.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="basic_formatting.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lists_and_tables.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/code_blocks.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/code_blocks.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/code_blocks.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Code Blocks</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="../index.html" title="Document To Test Formatting">
@@ -20,21 +20,23 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.code_blocks"></a><a class="link" href="code_blocks.html" title="Code Blocks">Code Blocks</a>
</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section"><a href="code_blocks.html#document_to_test_formatting.code_blocks.embedded_code">Embedded
code</a></span></dt>
+<dt><span class="section"><a href="code_blocks.html#document_to_test_formatting.code_blocks.code_with_a_very_long_line">Code
+ With a Very Long Line</a></span></dt>
<dt><span class="section"><a href="code_blocks.html#document_to_test_formatting.code_blocks.imported_code_and_callouts">Imported
code and callouts</a></span></dt>
<dt><span class="section"><a href="code_blocks.html#document_to_test_formatting.code_blocks.larger_example">Larger
example</a></span></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.code_blocks.embedded_code"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.embedded_code" title="Embedded code">Embedded
code</a>
@@ -52,7 +54,15 @@
<span class="special">}</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="document_to_test_formatting.code_blocks.code_with_a_very_long_line"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.code_with_a_very_long_line" title="Code With a Very Long Line">Code
+ With a Very Long Line</a>
+</h3></div></div></div>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">RealType</span><span class="special">></span> <span class="identifier">RealType</span> <span class="keyword">inline</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">a</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">b</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">c</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">d</span><span c
lass="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">e</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">f</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">g</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">RealType</span><span class="special">&</span> <span class="identifier">h</span><span class="special">){</span> <span class="keyword">return</span> <span class="number">0</span><span class="special">;</span> <span class="special">}</span>
+</pre>
+</div>
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.code_blocks.imported_code_and_callouts"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.imported_code_and_callouts" title="Imported code and callouts">Imported
code and callouts</a>
@@ -61,99 +71,87 @@
Here's some code with left-placed callouts:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">class</span> <span class="identifier">x</span>
<span class="special">{</span>
<span class="keyword">public</span><span class="special">:</span>
- <span class="line_callout_bug"><a class="co" name="document_to_test_formatting2co" href="code_blocks.html#document_to_test_formatting2"><img src="../../../src/images/callouts/1.png" alt="1" border="0"></a></span><span class="identifier">x</span><span class="special">()</span> <span class="special">:</span> <span class="identifier">n</span><span class="special">(</span><span class="number">0</span><span class="special">)</span>
+ <a class="co" name="document_to_test_formatting0co" href="code_blocks.html#document_to_test_formatting0"><img src="../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="identifier">x</span><span class="special">()</span> <span class="special">:</span> <span class="identifier">n</span><span class="special">(</span><span class="number">0</span><span class="special">)</span>
<span class="special">{</span>
<span class="special">}</span>
- <span class="line_callout_bug"><a class="co" name="document_to_test_formatting3co" href="code_blocks.html#document_to_test_formatting3"><img src="../../../src/images/callouts/2.png" alt="2" border="0"></a></span><span class="special">~</span><span class="identifier">x</span><span class="special">()</span>
+ <a class="co" name="document_to_test_formatting1co" href="code_blocks.html#document_to_test_formatting1"><img src="../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a><span class="special">~</span><span class="identifier">x</span><span class="special">()</span>
<span class="special">{</span>
<span class="special">}</span>
- <span class="line_callout_bug"><a class="co" name="document_to_test_formatting4co" href="code_blocks.html#document_to_test_formatting4"><img src="../../../src/images/callouts/3.png" alt="3" border="0"></a></span><span class="keyword">int</span> <span class="identifier">get</span><span class="special">()</span> <span class="keyword">const</span>
+ <a class="co" name="document_to_test_formatting2co" href="code_blocks.html#document_to_test_formatting2"><img src="../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a><span class="keyword">int</span> <span class="identifier">get</span><span class="special">()</span> <span class="keyword">const</span>
<span class="special">{</span>
<span class="keyword">return</span> <span class="identifier">n</span><span class="special">;</span>
<span class="special">}</span>
- <span class="line_callout_bug"><a class="co" name="document_to_test_formatting5co" href="code_blocks.html#document_to_test_formatting5"><img src="../../../src/images/callouts/4.png" alt="4" border="0"></a></span><span class="keyword">void</span> <span class="identifier">set</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">n_</span><span class="special">)</span>
+ <a class="co" name="document_to_test_formatting3co" href="code_blocks.html#document_to_test_formatting3"><img src="../../../../doc/src/images/callouts/4.png" alt="4" border="0"></a><span class="keyword">void</span> <span class="identifier">set</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">n_</span><span class="special">)</span>
<span class="special">{</span>
<span class="identifier">n</span> <span class="special">=</span> <span class="identifier">n_</span><span class="special">;</span>
<span class="special">}</span>
<span class="special">};</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting2"></a>
</p></td>
+<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting0"></a>
</p></td>
<td valign="top" align="left"><p> Constructor </p></td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting3"></a>
</p></td>
+<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting1"></a>
</p></td>
<td valign="top" align="left"><p> Destructor </p></td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting4"></a>
</p></td>
+<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting2"></a>
</p></td>
<td valign="top" align="left"><p> Get the <code class="computeroutput"><span class="identifier">n</span></code>
- member variable </p></td>
+ member variable </p></td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting5"></a>
</p></td>
+<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting3"></a>
</p></td>
<td valign="top" align="left"><p> Set the <code class="computeroutput"><span class="identifier">n</span></code>
- member variable </p></td>
+ member variable </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
<p>
And again with callouts placed exactly where we put them:
</p>
<p>
- </p>
-<p>
-
+
</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">foo_bar</span><span class="special">()</span> <span class="callout_bug"><a class="co" name="document_to_test_formatting0co" href="code_blocks.html#document_to_test_formatting0"><img src="../../../src/images/callouts/1.png" alt="1" border="0"></a></span>
+<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">foo_bar</span><span class="special">()</span> <a class="co" name="document_to_test_formatting4co" href="code_blocks.html#document_to_test_formatting4"><img src="../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
<span class="special">{</span>
- <span class="keyword">return</span> <span class="string">"foo-bar"</span><span class="special">;</span> <span class="callout_bug"><a class="co" name="document_to_test_formatting1co" href="code_blocks.html#document_to_test_formatting1"><img src="../../../src/images/callouts/2.png" alt="2" border="0"></a></span>
+ <span class="keyword">return</span> <span class="string">"foo-bar"</span><span class="special">;</span> <a class="co" name="document_to_test_formatting5co" href="code_blocks.html#document_to_test_formatting5"><img src="../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>
<span class="special">}</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
-<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting0"></a> </p></td>
+<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting4"></a> </p></td>
<td valign="top" align="left"><p> The <span class="emphasis"><em>Mythical</em></span> FooBar. See <a href="http://en.wikipedia.org/wiki/Foobar" target="_top">Foobar
- for details</a> </p></td>
+ for details</a> </p></td>
</tr>
<tr>
-<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting1"></a> </p></td>
+<td width="5%" valign="top" align="left"><p><a name="document_to_test_formatting5"></a> </p></td>
<td valign="top" align="left"><p> return 'em, foo-bar man! </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.code_blocks.larger_example"></a><a class="link" href="code_blocks.html#document_to_test_formatting.code_blocks.larger_example" title="Larger example">Larger
example</a>
@@ -413,7 +411,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -422,7 +420,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basic_formatting.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/images.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/images.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/images.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Images</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="lists_and_tables.html" title="Lists and Tables">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="lists_and_tables.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="lists_and_tables.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.images"></a><a class="link" href="images.html" title="Images">Images</a>
</h2></div></div></div>
@@ -45,7 +45,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -54,7 +54,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="lists_and_tables.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="lists_and_tables.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="test.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/lists_and_tables.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/lists_and_tables.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/lists_and_tables.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Lists and Tables</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="blurbs.html" title="Blurbs">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="blurbs.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="blurbs.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.lists_and_tables"></a><a class="link" href="lists_and_tables.html" title="Lists and Tables">Lists and
Tables</a>
@@ -33,119 +33,119 @@
Lists</a></span></dt>
<dt><span class="section">Tables</span></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.lists_and_tables.lists"></a><a class="link" href="lists_and_tables.html#document_to_test_formatting.lists_and_tables.lists" title="Lists">Lists</a>
</h3></div></div></div>
<p>
A numbered list:
</p>
-<div class="orderedlist"><ol type="1">
-<li>
- One
- </li>
-<li>
- Two
- </li>
-<li>
- Three
- <div class="orderedlist"><ol type="a">
-<li>
- Three.a
- </li>
-<li>
- Three.b
- </li>
-<li>
- Three.c
- </li>
-</ol></div>
-</li>
-<li>
- Four
- <div class="orderedlist"><ol type="a"><li>
- Four.a
- <div class="orderedlist"><ol type="i">
-<li>
- Four.a.i
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ One
+ </li>
+<li class="listitem">
+ Two
+ </li>
+<li class="listitem">
+ Three
+ <div class="orderedlist"><ol class="orderedlist" type="a">
+<li class="listitem">
+ Three.a
+ </li>
+<li class="listitem">
+ Three.b
</li>
-<li>
- Four.a.ii
+<li class="listitem">
+ Three.c
</li>
</ol></div>
-</li></ol></div>
-</li>
-<li>
- Five
- </li>
+ </li>
+<li class="listitem">
+ Four
+ <div class="orderedlist"><ol class="orderedlist" type="a"><li class="listitem">
+ Four.a
+ <div class="orderedlist"><ol class="orderedlist" type="i">
+<li class="listitem">
+ Four.a.i
+ </li>
+<li class="listitem">
+ Four.a.ii
+ </li>
+</ol></div>
+ </li></ol></div>
+ </li>
+<li class="listitem">
+ Five
+ </li>
</ol></div>
<p>
An unordered list:
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- First
- </li>
-<li>
- Second
- </li>
-<li>
- Third
- </li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ First
+ </li>
+<li class="listitem">
+ Second
+ </li>
+<li class="listitem">
+ Third
+ </li>
</ul></div>
<p>
A mixture of the two:
</p>
-<div class="orderedlist"><ol type="1">
-<li>
- 1
- <div class="itemizedlist"><ul type="disc">
-<li>
- 1.a
- <div class="orderedlist"><ol type="a">
-<li>
- 1.a.1
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ 1
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ 1.a
+ <div class="orderedlist"><ol class="orderedlist" type="a">
+<li class="listitem">
+ 1.a.1
+ </li>
+<li class="listitem">
+ 1.a.2
+ </li>
+</ol></div>
</li>
-<li>
- 1.a.2
+<li class="listitem">
+ 1.b
</li>
-</ol></div>
-</li>
-<li>
- 1.b
- </li>
</ul></div>
-</li>
-<li>
- 2
- <div class="itemizedlist"><ul type="disc">
-<li>
- 2.a
- </li>
-<li>
- 2.b
- <div class="orderedlist"><ol type="a">
-<li>
- 2.b.1
+ </li>
+<li class="listitem">
+ 2
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ 2.a
</li>
-<li>
- 2.b.2
- <div class="itemizedlist"><ul type="circle">
-<li>
- 2.b.2.a
- </li>
-<li>
- 2.b.2.b
- </li>
+<li class="listitem">
+ 2.b
+ <div class="orderedlist"><ol class="orderedlist" type="a">
+<li class="listitem">
+ 2.b.1
+ </li>
+<li class="listitem">
+ 2.b.2
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ 2.b.2.a
+ </li>
+<li class="listitem">
+ 2.b.2.b
+ </li>
</ul></div>
-</li>
+ </li>
</ol></div>
-</li>
+ </li>
</ul></div>
-</li>
+ </li>
</ol></div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.lists_and_tables.variable_lists"></a><a class="link" href="lists_and_tables.html#document_to_test_formatting.lists_and_tables.variable_lists" title="Variable Lists">Variable
Lists</a>
@@ -155,20 +155,20 @@
<dl>
<dt><span class="term">term 1</span></dt>
<dd><p>
- The definition of term 1
- </p></dd>
+ The definition of term 1
+ </p></dd>
<dt><span class="term">term 2</span></dt>
<dd><p>
- The definition of term 2
- </p></dd>
+ The definition of term 2
+ </p></dd>
<dt><span class="term">term 3</span></dt>
<dd><p>
- The definition of term 3
- </p></dd>
+ The definition of term 3
+ </p></dd>
</dl>
</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.lists_and_tables.tables"></a><a class="link" href="lists_and_tables.html#document_to_test_formatting.lists_and_tables.tables" title="Tables">Tables</a>
</h3></div></div></div>
@@ -176,7 +176,7 @@
Here's a big table with code and other tricky things:
</p>
<div class="table">
-<a name="id537940"></a><p class="title"><b>Table 1. Notes on the Implementation of the Beta Distribution</b></p>
+<a name="id769721"></a><p class="title"><b>Table 1. Notes on the Implementation of the Beta Distribution</b></p>
<div class="table-contents"><table class="table" summary="Notes on the Implementation of the Beta Distribution">
<colgroup>
<col>
@@ -184,253 +184,257 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Function
- </p>
- </th>
+ <p>
+ Function
+ </p>
+ </th>
<th>
- <p>
- Implementation Notes
- </p>
- </th>
+ <p>
+ Implementation Notes
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- pdf
- </p>
- </td>
+ <p>
+ pdf
+ </p>
+ </td>
<td>
- <p>
- f(x;α,β) = x<sup>α - 1</sup> (1 - x)<sup>β -1</sup> / B(α, β)
- </p>
- <p>
- Implemented using ibeta_derivative(a, b, x).
- </p>
- </td>
+ <p>
+ f(x;α,β) = x<sup>α - 1</sup> (1 - x)<sup>β -1</sup> / B(α, β)
+ </p>
+ <p>
+ Implemented using ibeta_derivative(a, b, x).
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- cdf
- </p>
- </td>
+ <p>
+ cdf
+ </p>
+ </td>
<td>
- <p>
- Using the incomplete beta function ibeta(a, b, x)
- </p>
- </td>
+ <p>
+ Using the incomplete beta function ibeta(a, b, x)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- cdf complement
- </p>
- </td>
+ <p>
+ cdf complement
+ </p>
+ </td>
<td>
- <p>
- ibetac(a, b, x)
- </p>
- </td>
+ <p>
+ ibetac(a, b, x)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- quantile
- </p>
- </td>
+ <p>
+ quantile
+ </p>
+ </td>
<td>
- <p>
- Using the inverse incomplete beta function ibeta_inv(a, b, p)
- </p>
- </td>
+ <p>
+ Using the inverse incomplete beta function ibeta_inv(a, b, p)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- quantile from the complement
- </p>
- </td>
+ <p>
+ quantile from the complement
+ </p>
+ </td>
<td>
- <p>
- ibetac_inv(a, b, q)
- </p>
- </td>
+ <p>
+ ibetac_inv(a, b, q)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- mean
- </p>
- </td>
+ <p>
+ mean
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">a</span><span class="special">/(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">a</span><span class="special">/(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- variance
- </p>
- </td>
+ <p>
+ variance
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">a</span> <span class="special">*</span>
- <span class="identifier">b</span> <span class="special">/</span>
- <span class="special">(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">)^</span><span class="number">2</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="number">1</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">a</span> <span class="special">*</span>
+ <span class="identifier">b</span> <span class="special">/</span>
+ <span class="special">(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">)^</span><span class="number">2</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">a</span> <span class="special">+</span>
+ <span class="identifier">b</span> <span class="special">+</span>
+ <span class="number">1</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- mode
- </p>
- </td>
+ <p>
+ mode
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="special">(</span><span class="identifier">a</span><span class="special">-</span><span class="number">1</span><span class="special">)</span>
- <span class="special">/</span> <span class="special">(</span><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="number">2</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">(</span><span class="identifier">a</span><span class="special">-</span><span class="number">1</span><span class="special">)</span> <span class="special">/</span> <span class="special">(</span><span class="identifier">a</span>
+ <span class="special">+</span> <span class="identifier">b</span>
+ <span class="special">+</span> <span class="number">2</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- skewness
- </p>
- </td>
+ <p>
+ skewness
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="number">2</span> <span class="special">(</span><span class="identifier">b</span><span class="special">-</span><span class="identifier">a</span><span class="special">)</span> <span class="identifier">sqrt</span><span class="special">(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">1</span><span class="special">)/(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">2</span><span class="special">)</span> <span class="special">*</span>
- <span class="identifier">sqrt</span><span class="special">(</span><span class="identifier">a</span> <span class="special">*</span> <span class="identifier">b</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="number">2</span> <span class="special">(</span><span class="identifier">b</span><span class="special">-</span><span class="identifier">a</span><span class="special">)</span>
+ <span class="identifier">sqrt</span><span class="special">(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">1</span><span class="special">)/(</span><span class="identifier">a</span><span class="special">+</span><span class="identifier">b</span><span class="special">+</span><span class="number">2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">sqrt</span><span class="special">(</span><span class="identifier">a</span>
+ <span class="special">*</span> <span class="identifier">b</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- kurtosis excess
- </p>
- </td>
+ <p>
+ kurtosis excess
+ </p>
+ </td>
<td>
- <p>
- <span class="inlinemediaobject"><img src="../images/beta_dist_kurtosis.png" alt="beta_dist_kurtosis"></span>
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="../images/beta_dist_kurtosis.png" alt="beta_dist_kurtosis"></span>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- kurtosis
- </p>
- </td>
+ <p>
+ kurtosis
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">kurtosis</span> <span class="special">+</span>
- <span class="number">3</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">kurtosis</span> <span class="special">+</span>
+ <span class="number">3</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- parameter estimation
- </p>
- </td>
+ <p>
+ parameter estimation
+ </p>
+ </td>
<td>
- <p>
- </p>
- </td>
+ </td>
</tr>
<tr>
<td>
- <p>
- alpha
- </p>
- <p>
- from mean and variance
- </p>
- </td>
+ <p>
+ alpha
+ </p>
+ <p>
+ from mean and variance
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">mean</span> <span class="special">*</span>
- <span class="special">((</span> <span class="special">(</span><span class="identifier">mean</span> <span class="special">*</span>
- <span class="special">(</span><span class="number">1</span>
- <span class="special">-</span> <span class="identifier">mean</span><span class="special">))</span> <span class="special">/</span> <span class="identifier">variance</span><span class="special">)-</span>
- <span class="number">1</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">mean</span> <span class="special">*</span>
+ <span class="special">((</span> <span class="special">(</span><span class="identifier">mean</span> <span class="special">*</span>
+ <span class="special">(</span><span class="number">1</span>
+ <span class="special">-</span> <span class="identifier">mean</span><span class="special">))</span> <span class="special">/</span> <span class="identifier">variance</span><span class="special">)-</span>
+ <span class="number">1</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- beta
- </p>
- <p>
- from mean and variance
- </p>
- </td>
+ <p>
+ beta
+ </p>
+ <p>
+ from mean and variance
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="special">(</span><span class="number">1</span>
- <span class="special">-</span> <span class="identifier">mean</span><span class="special">)</span> <span class="special">*</span> <span class="special">(((</span><span class="identifier">mean</span>
- <span class="special">*</span> <span class="special">(</span><span class="number">1</span> <span class="special">-</span> <span class="identifier">mean</span><span class="special">))</span>
- <span class="special">/</span><span class="identifier">variance</span><span class="special">)-</span><span class="number">1</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">(</span><span class="number">1</span>
+ <span class="special">-</span> <span class="identifier">mean</span><span class="special">)</span> <span class="special">*</span> <span class="special">(((</span><span class="identifier">mean</span>
+ <span class="special">*</span> <span class="special">(</span><span class="number">1</span> <span class="special">-</span> <span class="identifier">mean</span><span class="special">))</span>
+ <span class="special">/</span><span class="identifier">variance</span><span class="special">)-</span><span class="number">1</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- The member functions <code class="computeroutput"><span class="identifier">estimate_alpha</span></code>
- and <code class="computeroutput"><span class="identifier">estimate_beta</span></code>
- </p>
- <p>
- from cdf and probability x
- </p>
- <p>
- and <span class="bold"><strong>either</strong></span> <code class="computeroutput"><span class="identifier">alpha</span></code>
- or <code class="computeroutput"><span class="identifier">beta</span></code>
- </p>
- </td>
+ <p>
+ The member functions <code class="computeroutput"><span class="identifier">estimate_alpha</span></code>
+ and <code class="computeroutput"><span class="identifier">estimate_beta</span></code>
+ </p>
+ <p>
+ from cdf and probability x
+ </p>
+ <p>
+ and <span class="bold"><strong>either</strong></span> <code class="computeroutput"><span class="identifier">alpha</span></code>
+ or <code class="computeroutput"><span class="identifier">beta</span></code>
+ </p>
+ </td>
<td>
- <p>
- Implemented in terms of the inverse incomplete beta functions
- </p>
- <p>
- ibeta_inva, and ibeta_invb respectively.
- </p>
- </td>
+ <p>
+ Implemented in terms of the inverse incomplete beta functions
+ </p>
+ <p>
+ ibeta_inva, and ibeta_invb respectively.
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">estimate_alpha</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">estimate_alpha</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">ibeta_inva</span><span class="special">(</span><span class="identifier">beta</span><span class="special">,</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">probability</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">ibeta_inva</span><span class="special">(</span><span class="identifier">beta</span><span class="special">,</span>
+ <span class="identifier">x</span><span class="special">,</span>
+ <span class="identifier">probability</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">estimate_beta</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">estimate_beta</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">ibeta_invb</span><span class="special">(</span><span class="identifier">alpha</span><span class="special">,</span>
- <span class="identifier">x</span><span class="special">,</span>
- <span class="identifier">probability</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">ibeta_invb</span><span class="special">(</span><span class="identifier">alpha</span><span class="special">,</span>
+ <span class="identifier">x</span><span class="special">,</span>
+ <span class="identifier">probability</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
@@ -440,7 +444,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -449,7 +453,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="blurbs.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="blurbs.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="images.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/remez.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/remez.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/remez.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Sample Article (The Remez Method)</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="test.html" title="test HTML4 symbols">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="test.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="test.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.remez"></a><a class="link" href="remez.html" title="Sample Article (The Remez Method)"> Sample Article (The
Remez Method)</a>
@@ -66,17 +66,17 @@
yields the smallest maximal value of the error function. Chebyshev showed that
there is a unique minimax solution for R(x) that has the following properties:
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- If R(x) is a polynomial of degree N, then there are N+2 unknowns: the N+1
- coefficients of the polynomial, and maximal value of the error function.
- </li>
-<li>
- The error function has N+1 roots, and N+2 extrema (minima and maxima).
- </li>
-<li>
- The extrema alternate in sign, and all have the same magnitude.
- </li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ If R(x) is a polynomial of degree N, then there are N+2 unknowns: the N+1
+ coefficients of the polynomial, and maximal value of the error function.
+ </li>
+<li class="listitem">
+ The error function has N+1 roots, and N+2 extrema (minima and maxima).
+ </li>
+<li class="listitem">
+ The extrema alternate in sign, and all have the same magnitude.
+ </li>
</ul></div>
<p>
That means that if we know the location of the extrema of the error function
@@ -95,7 +95,7 @@
are located!</em></span>
</p>
<a name="document_to_test_formatting.remez.the_remez_method"></a><h5>
-<a name="id539430"></a>
+<a name="id771061"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.the_remez_method">The Remez
Method</a>
</h5>
@@ -150,7 +150,7 @@
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
@@ -174,7 +174,7 @@
</td></tr>
</table></div>
<a name="document_to_test_formatting.remez.remez_step_1"></a><h5>
-<a name="id539638"></a>
+<a name="id771248"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.remez_step_1">Remez Step 1</a>
</h5>
<p>
@@ -204,7 +204,7 @@
to 5.6x10<sup>-4</sup>.
</p>
<a name="document_to_test_formatting.remez.remez_step_2"></a><h5>
-<a name="id539738"></a>
+<a name="id771343"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.remez_step_2">Remez Step 2</a>
</h5>
<p>
@@ -231,7 +231,7 @@
In our example we perform multi-point exchange.
</p>
<a name="document_to_test_formatting.remez.iteration"></a><h5>
-<a name="id539786"></a>
+<a name="id771387"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.iteration">Iteration</a>
</h5>
<p>
@@ -247,7 +247,7 @@
<span class="inlinemediaobject"><img src="../images/remez-4.png" alt="remez-4"></span>
</p>
<a name="document_to_test_formatting.remez.rational_approximations"></a><h5>
-<a name="id539846"></a>
+<a name="id771441"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.rational_approximations">Rational
Approximations</a>
</h5>
@@ -295,7 +295,7 @@
number of terms overall.
</p>
<a name="document_to_test_formatting.remez.practical_considerations"></a><h5>
-<a name="id539957"></a>
+<a name="id771551"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.practical_considerations">Practical
Considerations</a>
</h5>
@@ -401,7 +401,7 @@
minimax solution (5x10<sup>-4</sup>).
</p>
<a name="document_to_test_formatting.remez.remez_method_checklist"></a><h5>
-<a name="id540203"></a>
+<a name="id771738"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.remez_method_checklist">Remez
Method Checklist</a>
</h5>
@@ -410,52 +410,52 @@
it is by no means an exhaustive list, but is provided in the hopes that it
will prove useful.
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- Is the function smooth enough? Can it be better separated into a rapidly
- changing part, and an asymptotic part?
- </li>
-<li>
- Does the function being approximated have any "blips" in it? Check
- for problems as the function changes computation method, or if a root, or
- an infinity has been divided out. The telltale sign is if there is a narrow
- region where the Remez method will not converge.
- </li>
-<li>
- Check you have enough accuracy in your calculations: remember that the Remez
- method works on the difference between the approximation and the function
- being approximated: so you must have more digits of precision available than
- the precision of the approximation being constructed. So for example at double
- precision, you shouldn't expect to be able to get better than a float precision
- approximation.
- </li>
-<li>
- Try skewing the initial interpolated approximation to minimise the error
- before you begin the Remez steps.
- </li>
-<li>
- If the approximation won't converge or is ill-conditioned from one starting
- location, try starting from a different location.
- </li>
-<li>
- If a rational function won't converge, one can minimise a polynomial (which
- presents no problems), then rotate one term from the numerator to the denominator
- and minimise again. In theory one can continue moving terms one at a time
- from numerator to denominator, and then re-minimising, retaining the last
- set of control points at each stage.
- </li>
-<li>
- Try using a smaller interval. It may also be possible to optimise over one
- (small) interval, rescale the control points over a larger interval, and
- then re-minimise.
- </li>
-<li>
- Keep absissa values small: use a change of variable to keep the abscissa
- over, say [0, b], for some smallish value <span class="emphasis"><em>b</em></span>.
- </li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ Is the function smooth enough? Can it be better separated into a rapidly
+ changing part, and an asymptotic part?
+ </li>
+<li class="listitem">
+ Does the function being approximated have any "blips" in it?
+ Check for problems as the function changes computation method, or if a
+ root, or an infinity has been divided out. The telltale sign is if there
+ is a narrow region where the Remez method will not converge.
+ </li>
+<li class="listitem">
+ Check you have enough accuracy in your calculations: remember that the
+ Remez method works on the difference between the approximation and the
+ function being approximated: so you must have more digits of precision
+ available than the precision of the approximation being constructed. So
+ for example at double precision, you shouldn't expect to be able to get
+ better than a float precision approximation.
+ </li>
+<li class="listitem">
+ Try skewing the initial interpolated approximation to minimise the error
+ before you begin the Remez steps.
+ </li>
+<li class="listitem">
+ If the approximation won't converge or is ill-conditioned from one starting
+ location, try starting from a different location.
+ </li>
+<li class="listitem">
+ If a rational function won't converge, one can minimise a polynomial (which
+ presents no problems), then rotate one term from the numerator to the denominator
+ and minimise again. In theory one can continue moving terms one at a time
+ from numerator to denominator, and then re-minimising, retaining the last
+ set of control points at each stage.
+ </li>
+<li class="listitem">
+ Try using a smaller interval. It may also be possible to optimise over
+ one (small) interval, rescale the control points over a larger interval,
+ and then re-minimise.
+ </li>
+<li class="listitem">
+ Keep absissa values small: use a change of variable to keep the abscissa
+ over, say [0, b], for some smallish value <span class="emphasis"><em>b</em></span>.
+ </li>
</ul></div>
<a name="document_to_test_formatting.remez.references"></a><h5>
-<a name="id540285"></a>
+<a name="id771857"></a>
<a class="link" href="remez.html#document_to_test_formatting.remez.references">References</a>
</h5>
<p>
@@ -520,7 +520,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -529,7 +529,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="test.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="test.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="array.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/document_to_test_formatting/test.html
==============================================================================
--- branches/release/doc/test/gold/document_to_test_formatting/test.html (original)
+++ branches/release/doc/test/gold/document_to_test_formatting/test.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>test HTML4 symbols</title>
-<link rel="stylesheet" href="../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Document To Test Formatting">
<link rel="up" href="../index.html" title="Document To Test Formatting">
<link rel="prev" href="images.html" title="Images">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="images.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="images.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.test"></a><a class="link" href="test.html" title="test HTML4 symbols"> test HTML4 symbols</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
<dt><span class="section"><a href="test.html#document_to_test_formatting.test.test_latin1_symbols">test
Latin1 symbols</a></span></dt>
</dl></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.test.test_greek_and_math_symbols"></a><a class="link" href="test.html#document_to_test_formatting.test.test_greek_and_math_symbols" title="test Greek and Math symbols">test
Greek and Math symbols</a>
@@ -44,21 +44,21 @@
⊥, ⋅, ⌈, ⌉, ⌊, ⌋, 〈, 〉, ◊, ♠, ♣, ♥, ♦
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="document_to_test_formatting.test.test_latin1_symbols"></a><a class="link" href="test.html#document_to_test_formatting.test.test_latin1_symbols" title="test Latin1 symbols">test
Latin1 symbols</a>
</h3></div></div></div>
<p>
- , ¡, ¢, £, ¤, ¥, ¦, §, ¨, ©, ª, «, ¬, , ®, ¯, °, ±, ², ³, ´, µ, ¶, ·, ¸, ¹, º, », ¼, ½, ¾, ¿, À, Á, Â, Ã, Ä,
- Å, Æ, Ç, È, É, Ê, Ë, Ì, Í, Î, Ï, Ð, Ñ, Ò, Ó, Ô, Õ, Ö, ×, Ø, Ù, Ú, Û, Ü, Ý, Þ, ß, à, á, â, ã, ä, å, æ, ç, è, é,
- ê, ë, ì, í, î, ï, ð, ñ, ò, ó, ô, õ, ö, ÷, ø, ù, ú, û, ü, ý, þ, ÿ,
+  , ¡, ¢, £, ¤, ¥, ¦, §, ¨, ©, ª, «, ¬, ­, ®, ¯, °, ±, ², ³, ´, µ, ¶, ·, ¸, ¹, º, », ¼, ½, ¾, ¿, À, Á, Â, Ã, Ä,
+ Å, Æ, Ç, È, É, Ê, Ë, Ì, Í, Î, Ï, Ð, Ñ, Ò, Ó, Ô, Õ, Ö, ×, Ø, Ù, Ú, Û, Ü, Ý, Þ, ß, à, á, â, ã, ä, å, æ, ç, è, é,
+ ê, ë, ì, í, î, ï, ð, ñ, ò, ó, ô, õ, ö, ÷, ø, ù, ú, û, ü, ý, þ, ÿ,
</p>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<td align="right"><div class="copyright-footer">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto<p>
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)
@@ -67,7 +67,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="images.html"><img src="../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="images.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remez.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/doc/test/gold/images/accumulators/form_2.png
==============================================================================
Binary files. No diff available.
Modified: branches/release/doc/test/gold/images/accumulators/form_5.png
==============================================================================
Binary files. No diff available.
Modified: branches/release/doc/test/gold/images/accumulators/form_6.png
==============================================================================
Binary files. No diff available.
Modified: branches/release/doc/test/gold/index.html
==============================================================================
--- branches/release/doc/test/gold/index.html (original)
+++ branches/release/doc/test/gold/index.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,9 +1,9 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Document To Test Formatting</title>
-<link rel="stylesheet" href="../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot_8125">
+<link rel="stylesheet" href="../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="index.html" title="Document To Test Formatting">
<link rel="next" href="document_to_test_formatting/code_blocks.html" title="Code Blocks">
</head>
@@ -17,8 +17,8 @@
<td align="center">More</td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="document_to_test_formatting/code_blocks.html"><img src="../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="article" lang="en">
+<div class="spirit-nav"><a accesskey="n" href="document_to_test_formatting/code_blocks.html"><img src="../../../doc/src/images/next.png" alt="Next"></a></div>
+<div class="article">
<div class="titlepage">
<div>
<div><h2 class="title">
@@ -37,10 +37,10 @@
<span class="firstname">Matias</span> <span class="surname">Capeletto</span>
</h3></div>
</div></div>
-<div><p class="copyright">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
+<div><p class="copyright">Copyright © 2007 John Maddock, Joel de Guzman, Eric Niebler and Matias
Capeletto</p></div>
<div><div class="legalnotice">
-<a name="id473217"></a><p>
+<a name="id759729"></a><p>
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)
</p>
@@ -56,6 +56,8 @@
<dd><dl>
<dt><span class="section"><a href="document_to_test_formatting/code_blocks.html#document_to_test_formatting.code_blocks.embedded_code">Embedded
code</a></span></dt>
+<dt><span class="section"><a href="document_to_test_formatting/code_blocks.html#document_to_test_formatting.code_blocks.code_with_a_very_long_line">Code
+ With a Very Long Line</a></span></dt>
<dt><span class="section"><a href="document_to_test_formatting/code_blocks.html#document_to_test_formatting.code_blocks.imported_code_and_callouts">Imported
code and callouts</a></span></dt>
<dt><span class="section"><a href="document_to_test_formatting/code_blocks.html#document_to_test_formatting.code_blocks.larger_example">Larger
@@ -104,7 +106,7 @@
XML Documentation</a></span></dt>
<dd><dl>
<dt><span class="section">Introduction</span></dt>
-<dt><span class="section">Reference</span></dt>
+<dt><span class="section">Reference</span></dt>
<dt><span class="section">Design Rationale</span></dt>
<dt><span class="section">For more information...</span></dt>
<dt><span class="section">Acknowledgements</span></dt>
@@ -114,7 +116,7 @@
<dd><dl><dt><span class="section">Statistics Library Reference</span></dt></dl></dd>
</dl>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="document_to_test_formatting.introduction"></a><a class="link" href="index.html#document_to_test_formatting.introduction" title="Introduction">Introduction</a>
</h2></div></div></div>
@@ -140,10 +142,10 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: December 09, 2008 at 12:07:46 GMT</small></p></td>
+<td align="left"><p><small>Last revised: July 19, 2010 at 19:45:35 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="document_to_test_formatting/code_blocks.html"><img src="../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="spirit-nav"><a accesskey="n" href="document_to_test_formatting/code_blocks.html"><img src="../../../doc/src/images/next.png" alt="Next"></a></div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/acknowledgements.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,27 +1,27 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Acknowledgements</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section" title="Acknowledgements">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.acknowledgements"></a><a class="link" href="acknowledgements.html" title="Acknowledgements">Acknowledgements</a>
</h2></div></div></div>
@@ -68,10 +68,10 @@
Thanks to Alisdair Meredith, Fernando Cacciola, Jeff Garland, John Maddock,
Thorsten Ottosen, Tony and Giovanni Piero Deretta for participating in the
formal review and give me useful advices to improve this library. And thanks
- a lot to Ion Gaztañaga for managing the review.
+ a lot to Ion Gaztañaga for managing the review.
</p>
<a name="boost_bimap.acknowledgements.boost_bimap_team"></a><h4>
-<a name="id672804"></a>
+<a name="id880239"></a>
<a class="link" href="acknowledgements.html#boost_bimap.acknowledgements.boost_bimap_team">Boost.Bimap Team</a>
</h4>
<p>
@@ -86,7 +86,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -94,7 +94,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Bimap and Boost</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="the_tutorial/complete_instantiation_scheme.html" title="Complete instantiation scheme">
<link rel="next" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Bimap and Boost">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.bimap_and_boost"></a><a class="link" href="bimap_and_boost.html" title="Bimap and Boost">Bimap and Boost</a>
</h2></div></div></div>
@@ -45,7 +45,7 @@
</dl></dd>
<dt><span class="section">Dependencies</span></dt>
</dl></div>
-<div class="section" title="Bimap and MultiIndex">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.bimap_and_boost.bimap_and_multiindex"></a><a class="link" href="bimap_and_boost.html#boost_bimap.bimap_and_boost.bimap_and_multiindex" title="Bimap and MultiIndex">Bimap
and MultiIndex</a>
@@ -54,36 +54,18 @@
<span class="emphasis"><em>MISC</em></span> - <span class="bold"><strong>M</strong></span>ulti-<span class="bold"><strong>I</strong></span>ndex <span class="bold"><strong>S</strong></span>pecialized
<span class="bold"><strong>C</strong></span>ontainers
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Let's be generic, construct frameworks, describe the world
- in an unified way... </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> No!, it is better to be specialized, design easy-to-use components,
- offer plug-and-play objects... </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="bold"><strong> Why not take advantage of the best of both worlds?
- </strong></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Let's be generic, construct frameworks, describe the world in
+ an unified way... </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> No!, it is better to be specialized, design easy-to-use components,
+ offer plug-and-play objects... </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="bold"><strong> Why not take advantage of the best of both worlds?
+ </strong></span>
+ </p></blockquote></div>
<p>
<span class="inlinemediaobject"><img src="../images/bimap/miBimapFramework.png" alt="miBimapFramework"></span>
</p>
@@ -100,9 +82,7 @@
the best for every specialization. People may end up wrapping a B.MI container
in its own class every time they want to use it as a bidirectional map. Boost.Bimap
takes advantage of the narrower scope to produce a better interface for bidirectional
- maps
- <sup>[<a name="id583056" href="#ftn.id583056" class="footnote">2</a>]</sup>
- . There is no learning curve if you know how to use standard containers.
+ maps <sup>[<a name="id789018" href="#ftn.id789018" class="footnote">2</a>]</sup>. There is no learning curve if you know how to use standard containers.
Great effort was put into mapping the naming scheme of the STL to Boost.Bimap.
The library is designed to match the common STL containers.
</p>
@@ -126,8 +106,6 @@
This type of problem is better modelled as a database table, and <span class="bold"><strong>Boost.MultiIndex</strong></span> is the preferred choice. It is possible
that other data will need to be indexed later.
</p>
-<p>
- </p>
</div>
<div class="sidebar">
<p class="title"><b></b></p>
@@ -141,8 +119,6 @@
<p>
This problem is better modelled as a collection of relations, and <span class="bold"><strong>Boost.Bimap</strong></span> fits nicely here.
</p>
-<p>
- </p>
</div>
<p>
You can also read <a class="link" href="the_tutorial/additional_information.html" title="Additional information">Additional
@@ -151,16 +127,15 @@
</div>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id583056" href="#id583056" class="para">2</a>] </sup>
- In the same fashion, Boost.MRU will allow the creation of <span class="emphasis"><em>most
- recent updated</em></span> aware containers, hiding the complexity of
- Boost.MultiIndex.
- </p></div>
+<div class="footnote"><p><sup>[<a name="ftn.id789018" href="#id789018" class="para">2</a>] </sup>
+ In the same fashion, Boost.MRU will allow the creation of <span class="emphasis"><em>most
+ recent updated</em></span> aware containers, hiding the complexity of Boost.MultiIndex.
+ </p></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -168,7 +143,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="the_tutorial/complete_instantiation_scheme.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/boost_libraries_that_work_well_with_boost_bimap.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Boost Libraries that work well with Boost.Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../bimap_and_boost.html" title="Bimap and Boost">
<link rel="prev" href="../bimap_and_boost.html" title="Bimap and Boost">
<link rel="next" href="dependencies.html" title="Dependencies">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="dependencies.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dependencies.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Boost Libraries that work well with Boost.Bimap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap">Boost
Libraries that work well with Boost.Bimap</a>
@@ -39,7 +39,7 @@
<dt><span class="section">Boost.Xpressive</span></dt>
<dt><span class="section">Boost.Property_map</span></dt>
</dl></div>
-<div class="section" title="Introduction">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.introduction" title="Introduction">Introduction</a>
</h4></div></div></div>
@@ -52,235 +52,235 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Name
- </p>
+ <p>
+ Name
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
<th>
- <p>
- author
- </p>
+ <p>
+ author
+ </p>
</th>
<th>
- <p>
- Purpose
- </p>
+ <p>
+ Purpose
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- Boost.Serialization
- </p>
+ <p>
+ Boost.Serialization
+ </p>
</td>
<td>
- <p>
- Serialization for persistence and marshalling
- </p>
+ <p>
+ Serialization for persistence and marshalling
+ </p>
</td>
<td>
- <p>
- Robert Ramey
- </p>
+ <p>
+ Robert Ramey
+ </p>
</td>
<td>
- <p>
- Serialization support for bimap containers and iterators
- </p>
+ <p>
+ Serialization support for bimap containers and iterators
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.Assign
- </p>
+ <p>
+ Boost.Assign
+ </p>
</td>
<td>
- <p>
- Filling containers with constant or generated data has never been
- easier
- </p>
+ <p>
+ Filling containers with constant or generated data has never
+ been easier
+ </p>
</td>
<td>
- <p>
- Thorsten Ottosen
- </p>
+ <p>
+ Thorsten Ottosen
+ </p>
</td>
<td>
- <p>
- Help to fill a bimap or views of it
- </p>
+ <p>
+ Help to fill a bimap or views of it
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.Hash
- </p>
+ <p>
+ Boost.Hash
+ </p>
</td>
<td>
- <p>
- A TR1 hash function object that can be extended to hash user defined
- types
- </p>
+ <p>
+ A TR1 hash function object that can be extended to hash user
+ defined types
+ </p>
</td>
<td>
- <p>
- Daniel James
- </p>
+ <p>
+ Daniel James
+ </p>
</td>
<td>
- <p>
- Default hashing function
- </p>
+ <p>
+ Default hashing function
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.Lambda
- </p>
+ <p>
+ Boost.Lambda
+ </p>
</td>
<td>
- <p>
- Define small unnamed function objects at the actual call site,
- and more
- </p>
+ <p>
+ Define small unnamed function objects at the actual call site,
+ and more
+ </p>
</td>
<td>
- <p>
- from Jaakko Järvi, Gary Powell
- </p>
+ <p>
+ from Jaakko Järvi, Gary Powell
+ </p>
</td>
<td>
- <p>
- Functors for modify, range, lower_bound and upper_bound
- </p>
+ <p>
+ Functors for modify, range, lower_bound and upper_bound
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.Range
- </p>
+ <p>
+ Boost.Range
+ </p>
</td>
<td>
- <p>
- A new infrastructure for generic algorithms that builds on top
- of the new iterator concepts
- </p>
+ <p>
+ A new infrastructure for generic algorithms that builds on top
+ of the new iterator concepts
+ </p>
</td>
<td>
- <p>
- Thorsten Ottosen
- </p>
+ <p>
+ Thorsten Ottosen
+ </p>
</td>
<td>
- <p>
- Range based algorithms
- </p>
+ <p>
+ Range based algorithms
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.Foreach
- </p>
+ <p>
+ Boost.Foreach
+ </p>
</td>
<td>
- <p>
- BOOST_FOREACH macro for easily iterating over the elements of a
- sequence
- </p>
+ <p>
+ BOOST_FOREACH macro for easily iterating over the elements of
+ a sequence
+ </p>
</td>
<td>
- <p>
- Eric Niebler
- </p>
+ <p>
+ Eric Niebler
+ </p>
</td>
<td>
- <p>
- Iteration
- </p>
+ <p>
+ Iteration
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.Typeof
- </p>
+ <p>
+ Boost.Typeof
+ </p>
</td>
<td>
- <p>
- Typeof operator emulation
- </p>
+ <p>
+ Typeof operator emulation
+ </p>
</td>
<td>
- <p>
- Arkadiy Vertleyb, Peder Holt
- </p>
+ <p>
+ Arkadiy Vertleyb, Peder Holt
+ </p>
</td>
<td>
- <p>
- Using BOOST_AUTO while we wait for C++0x
- </p>
+ <p>
+ Using BOOST_AUTO while we wait for C++0x
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.Xpressive
- </p>
+ <p>
+ Boost.Xpressive
+ </p>
</td>
<td>
- <p>
- Regular expressions that can be written as strings or as expression
- templates
- </p>
+ <p>
+ Regular expressions that can be written as strings or as expression
+ templates
+ </p>
</td>
<td>
- <p>
- Eric Niebler
- </p>
+ <p>
+ Eric Niebler
+ </p>
</td>
<td>
- <p>
- Help to fill a bimap from a string
- </p>
+ <p>
+ Help to fill a bimap from a string
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- Boost.PropertyMap
- </p>
+ <p>
+ Boost.PropertyMap
+ </p>
</td>
<td>
- <p>
- Concepts defining interfaces which map key objects to value objects
- </p>
+ <p>
+ Concepts defining interfaces which map key objects to value objects
+ </p>
</td>
<td>
- <p>
- Jeremy Siek
- </p>
+ <p>
+ Jeremy Siek
+ </p>
</td>
<td>
- <p>
- Integration with BGL
- </p>
+ <p>
+ Integration with BGL
+ </p>
</td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Boost.Serialization">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_serialization" title="Boost.Serialization">Boost.Serialization</a>
</h4></div></div></div>
@@ -294,9 +294,7 @@
code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="keyword">int</span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
@@ -309,9 +307,9 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">ofstream</span> <span class="identifier">ofs</span><span class="special">(</span><span class="string">"data"</span><span class="special">);</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">archive</span><span class="special">::</span><span class="identifier">text_oarchive</span> <span class="identifier">oa</span><span class="special">(</span><span class="identifier">ofs</span><span class="special">);</span>
- <span class="identifier">oa</span> <span class="special"><<</span> <span class="keyword">const_cast</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">bm_type</span><span class="special">&>(</span><span class="identifier">bm</span><span class="special">);</span> <span class="callout_bug"><a class="co" name="boost_bimap16co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap16"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span>
+ <span class="identifier">oa</span> <span class="special"><<</span> <span class="keyword">const_cast</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">bm_type</span><span class="special">&>(</span><span class="identifier">bm</span><span class="special">);</span> <a class="co" name="boost_bimap16co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap16"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
- <span class="line_callout_bug"><a class="co" name="boost_bimap17co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap17"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a></span><span class="keyword">const</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span> <span class="identifier">left_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"two"</span><span class="special">);</span>
+ <a class="co" name="boost_bimap17co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap17"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a><span class="keyword">const</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span> <span class="identifier">left_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"two"</span><span class="special">);</span>
<span class="identifier">oa</span> <span class="special"><<</span> <span class="identifier">left_iter</span><span class="special">;</span>
<span class="keyword">const</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_iterator</span> <span class="identifier">right_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="number">1</span><span class="special">);</span>
@@ -341,29 +339,25 @@
<span class="special">}</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap16"></a>
</p></td>
<td valign="top" align="left"><p>
We must do a const cast because Boost.Serialization archives only save
- const objects. Read Boost.Serializartion docs for the rationale behind
- this decision </p></td>
+ const objects. Read Boost.Serializartion docs for the rationale behind
+ this decision </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap17"></a>
</p></td>
<td valign="top" align="left"><p> We can only serialize iterators if the bimap was serialized
- first. Note that the const cast is not requiered here because we create
- our iterators as const. </p></td>
+ first. Note that the const cast is not requiered here because we create
+ our iterators as const. </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
<p>
Serialization capabilities are automatically provided by just linking with
@@ -375,9 +369,9 @@
in build times, and may be necessary in those defective compilers that
fail to correctly process Boost.Serialization headers.
</p>
-<div class="warning" title="Warning"><table border="0" summary="Warning">
+<div class="warning"><table border="0" summary="Warning">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../doc/html/images/warning.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Warning]" src="../../../../../../doc/src/images/warning.png"></td>
<th align="left">Warning</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -403,7 +397,7 @@
must be done only after serializing its corresponding container.
</p>
</div>
-<div class="section" title="Boost.Assign">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_assign" title="Boost.Assign">Boost.Assign</a>
</h4></div></div></div>
@@ -429,15 +423,13 @@
<a href="../../../../example/bimap_and_boost/assign.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"> <span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">multiset_of</span><span class="special"><</span> <span class="keyword">int</span> <span class="special">>,</span> <span class="identifier">list_of</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">></span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="comment">// We can use assign::list_of to initialize the container.
</span>
- <span class="identifier">bm_type</span> <span class="identifier">bm</span> <span class="special">=</span> <span class="identifier">assign</span><span class="special">::</span><span class="identifier">list_of</span><span class="special"><</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">relation</span> <span class="special">></span> <span class="callout_bug"><a class="co" name="boost_bimap18co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap18"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span>
+ <span class="identifier">bm_type</span> <span class="identifier">bm</span> <span class="special">=</span> <span class="identifier">assign</span><span class="special">::</span><span class="identifier">list_of</span><span class="special"><</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">relation</span> <span class="special">></span> <a class="co" name="boost_bimap18co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap18"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
<span class="special">(</span> <span class="number">1</span><span class="special">,</span> <span class="string">"one"</span> <span class="special">)</span>
<span class="special">(</span> <span class="number">2</span><span class="special">,</span> <span class="string">"two"</span> <span class="special">)</span>
<span class="special">(</span> <span class="number">3</span><span class="special">,</span> <span class="string">"three"</span> <span class="special">);</span>
@@ -468,24 +460,20 @@
<span class="special">(</span> <span class="number">13</span><span class="special">,</span> <span class="string">"thirteen"</span> <span class="special">);</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap18"></a> </p></td>
<td valign="top" align="left"><p>
- Note that <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">relation</span></code> has to be used instead of
- <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span></code>. Contrary to <code class="computeroutput"><span class="identifier">value_type</span></code>, <code class="computeroutput"><span class="identifier">relation</span></code>
- type stores the elements as non const, a requirement of <code class="computeroutput"><span class="identifier">assign</span><span class="special">::</span><span class="identifier">list_of</span></code> </p></td>
+ Note that <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">relation</span></code> has to be used instead of <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span></code>. Contrary to <code class="computeroutput"><span class="identifier">value_type</span></code>, <code class="computeroutput"><span class="identifier">relation</span></code>
+ type stores the elements as non const, a requirement of <code class="computeroutput"><span class="identifier">assign</span><span class="special">::</span><span class="identifier">list_of</span></code>
+ </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
</div>
-<div class="section" title="Boost.Hash">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_hash"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_hash" title="Boost.Hash">Boost.Hash</a>
</h4></div></div></div>
@@ -511,7 +499,7 @@
the unordered set types with any user types.
</p>
</div>
-<div class="section" title="Boost.Lambda">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_lambda"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_lambda" title="Boost.Lambda">Boost.Lambda</a>
</h4></div></div></div>
@@ -533,9 +521,7 @@
<a href="../../../../example/bimap_and_boost/lambda.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="keyword">int</span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
@@ -550,11 +536,9 @@
<span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">modify_data</span><span class="special">(</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">_data</span> <span class="special">*=</span> <span class="number">10</span> <span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
-<div class="section" title="Boost.Range">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_range"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_range" title="Boost.Range">Boost.Range</a>
</h4></div></div></div>
@@ -578,9 +562,7 @@
If we have some generic functions that accepts ranges:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardReadableRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryFunctor</span> <span class="special">></span>
<span class="identifier">UnaryFunctor</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardReadableRange</span> <span class="special">&</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">UnaryFunctor</span> <span class="identifier">func</span><span class="special">)</span>
@@ -614,17 +596,13 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
We can use them with Boost.Bimap with the help of the <code class="computeroutput"><span class="identifier">range</span></code>
function.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">pair_printer</span>
<span class="special">{</span>
@@ -676,14 +654,12 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
<a href="../../../../example/bimap_and_boost/range.cpp" target="_top">Go to source code</a>
</p>
</div>
-<div class="section" title="Boost.Foreach">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_foreach" title="Boost.Foreach">Boost.Foreach</a>
</h4></div></div></div>
@@ -703,9 +679,7 @@
will be as efficient as a std::for_each iteration. Here are some examples:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">list_of</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
@@ -717,7 +691,7 @@
<span class="identifier">BOOST_FOREACH</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_reference</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span> <span class="special">)</span>
<span class="special">{</span>
- <span class="special">++</span><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span><span class="special">;</span> <span class="callout_bug"><a class="co" name="boost_bimap19co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap19"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span>
+ <span class="special">++</span><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span><span class="special">;</span> <a class="co" name="boost_bimap19co" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap19"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
<span class="special">}</span>
<span class="identifier">BOOST_FOREACH</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_const_reference</span> <span class="identifier">p</span><span class="special">,</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span> <span class="special">)</span>
@@ -727,27 +701,21 @@
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap19"></a> </p></td>
<td valign="top" align="left"><p> We can modify the right element because we have use a mutable collection
- type in the right side. </p></td>
+ type in the right side. </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
<p>
You can use it directly with ranges too:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">BOOST_FOREACH</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_reference</span> <span class="identifier">p</span><span class="special">,</span>
<span class="special">(</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">(</span><span class="string">"1"</span><span class="special">)</span> <span class="special"><=</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">_key</span> <span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">(</span><span class="string">"3"</span><span class="special">)</span> <span class="special">)</span> <span class="special">))</span>
@@ -762,14 +730,12 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
<a href="../../../../example/bimap_and_boost/foreach.cpp" target="_top">Go to source code</a>
</p>
</div>
-<div class="section" title="Boost.Typeof">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_typeof"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_typeof" title="Boost.Typeof">Boost.Typeof</a>
</h4></div></div></div>
@@ -791,9 +757,7 @@
If we have
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">tagged</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span><span class="identifier">name</span><span class="special">>,</span> <span class="identifier">tagged</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span><span class="identifier">number</span><span class="special">></span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
@@ -801,16 +765,12 @@
<span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">(</span><span class="string">"two"</span> <span class="special">,</span><span class="number">2</span><span class="special">)</span> <span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The following code snippet
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">for</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">name</span><span class="special">>::</span><span class="identifier">iterator</span> <span class="identifier">iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">name</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">();</span>
<span class="identifier">iter</span><span class="special">!=</span><span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">name</span><span class="special">>().</span><span class="identifier">end</span><span class="special">();</span> <span class="special">++</span><span class="identifier">iter</span><span class="special">)</span>
@@ -822,16 +782,12 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"2: "</span> <span class="special"><<</span> <span class="identifier">iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">name</span><span class="special">>();</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
can be rewrited as
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">for</span><span class="special">(</span> <span class="identifier">BOOST_AUTO</span><span class="special">(</span><span class="identifier">iter</span><span class="special">,</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">name</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">());</span> <span class="identifier">iter</span><span class="special">!=</span><span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">name</span><span class="special">>().</span><span class="identifier">end</span><span class="special">();</span> <span class="special">++</span><span class="identifier">iter</span><span class="special">)</span>
<span class="special">{</span>
@@ -842,14 +798,12 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"2: "</span> <span class="special"><<</span> <span class="identifier">iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">name</span><span class="special">>();</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
<a href="../../../../example/bimap_and_boost/typeof.cpp" target="_top">Go to source code</a>
</p>
</div>
-<div class="section" title="Boost.Xpressive">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_xpressive"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_xpressive" title="Boost.Xpressive">Boost.Xpressive</a>
</h4></div></div></div>
@@ -859,9 +813,7 @@
Here is an example (it is just beatifull)
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="keyword">int</span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
@@ -870,7 +822,7 @@
<span class="identifier">sregex</span> <span class="identifier">rel</span> <span class="special">=</span> <span class="special">(</span> <span class="special">(</span><span class="identifier">s1</span><span class="special">=</span> <span class="special">+</span><span class="identifier">_w</span><span class="special">)</span> <span class="special">>></span> <span class="string">" <--> "</span> <span class="special">>></span> <span class="special">(</span><span class="identifier">s2</span><span class="special">=</span> <span class="special">+</span><span class="identifier">_d</span><span class="special">)</span> <span class="special">)</span>
<span class="special">[</span>
- <span class="identifier">xp</span><span class="special">::</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">bm</span><span class="special">)->*</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">construct</span><span class="special"><</span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">>(</span><span class="identifier">s1</span><span class="special">,</span> <span class="identifier">as</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">s2</span><span class="special">))</span> <span class="special">)</span>
+ <span class="identifier">xp</span><span class="special">::</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">bm</span><span class="special">)->*</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">xp</span><span class="special">::</span><span class="identifier">construct</span><span class="special"><</span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">>(</span><span class="identifier">s1</span><span class="special">,</span> <span class="identifier">as</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">s2</span><span class="special">))</span> <span class="special">)</span>
<span class="special">];</span>
<span class="identifier">sregex</span> <span class="identifier">relations</span> <span class="special">=</span> <span class="identifier">rel</span> <span class="special">>></span> <span class="special">*(+</span><span class="identifier">_s</span> <span class="special">>></span> <span class="identifier">rel</span><span class="special">);</span>
@@ -880,14 +832,12 @@
<span class="identifier">assert</span><span class="special">(</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">==</span> <span class="number">3</span> <span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
<a href="../../../../example/bimap_and_boost/xpressive.cpp" target="_top">Go to source code</a>
</p>
</div>
-<div class="section" title="Boost.Property_map">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_property_map"></a><a class="link" href="boost_libraries_that_work_well_with_boost_bimap.html#boost_bimap.bimap_and_boost.boost_libraries_that_work_well_with_boost_bimap.boost_property_map" title="Boost.Property_map">Boost.Property_map</a>
</h4></div></div></div>
@@ -926,9 +876,7 @@
code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">AddressMap</span><span class="special">></span>
<span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="identifier">AddressMap</span> <span class="special">&</span> <span class="identifier">address_map</span><span class="special">)</span>
@@ -956,14 +904,12 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -971,7 +917,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="dependencies.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="dependencies.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/bimap_and_boost/dependencies.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Dependencies</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../bimap_and_boost.html" title="Bimap and Boost">
<link rel="prev" href="boost_libraries_that_work_well_with_boost_bimap.html" title="Boost Libraries that work well with Boost.Bimap">
<link rel="next" href="../reference.html" title="Reference">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Dependencies">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.bimap_and_boost.dependencies"></a><a class="link" href="dependencies.html" title="Dependencies">Dependencies</a>
</h3></div></div></div>
@@ -35,7 +35,7 @@
is the heart of this library.
</p>
<div class="table">
-<a name="id591722"></a><p class="title"><b>Table 1.4. Boost Libraries needed by Boost.Bimap</b></p>
+<a name="id797662"></a><p class="title"><b>Table 1.4. Boost Libraries needed by Boost.Bimap</b></p>
<div class="table-contents"><table class="table" summary="Boost Libraries needed by Boost.Bimap">
<colgroup>
<col>
@@ -44,147 +44,147 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Name
- </p>
- </th>
+ <p>
+ Name
+ </p>
+ </th>
<th>
- <p>
- Description
- </p>
- </th>
+ <p>
+ Description
+ </p>
+ </th>
<th>
- <p>
- author
- </p>
- </th>
+ <p>
+ author
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- Boost.MultiIndex
- </p>
- </td>
+ <p>
+ Boost.MultiIndex
+ </p>
+ </td>
<td>
- <p>
- Containers with multiple STL-compatible access interfaces
- </p>
- </td>
+ <p>
+ Containers with multiple STL-compatible access interfaces
+ </p>
+ </td>
<td>
- <p>
- Joaquín M López Muñoz
- </p>
- </td>
+ <p>
+ Joaquín M López Muñoz
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Boost.MPL
- </p>
- </td>
+ <p>
+ Boost.MPL
+ </p>
+ </td>
<td>
- <p>
- Template metaprogramming framework of compile-time algorithms, sequences
- and metafunction classes
- </p>
- </td>
+ <p>
+ Template metaprogramming framework of compile-time algorithms,
+ sequences and metafunction classes
+ </p>
+ </td>
<td>
- <p>
- Aleksey Gurtovoy
- </p>
- </td>
+ <p>
+ Aleksey Gurtovoy
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Boost.TypeTraits
- </p>
- </td>
+ <p>
+ Boost.TypeTraits
+ </p>
+ </td>
<td>
- <p>
- Templates for fundamental properties of types.
- </p>
- </td>
+ <p>
+ Templates for fundamental properties of types.
+ </p>
+ </td>
<td>
- <p>
- John Maddock, Steve Cleary
- </p>
- </td>
+ <p>
+ John Maddock, Steve Cleary
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Boost.enable_if
- </p>
- </td>
+ <p>
+ Boost.enable_if
+ </p>
+ </td>
<td>
- <p>
- Selective inclusion of function template overloads
- </p>
- </td>
+ <p>
+ Selective inclusion of function template overloads
+ </p>
+ </td>
<td>
- <p>
- Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine
- </p>
- </td>
+ <p>
+ Jaakko Järvi, Jeremiah Willcock, Andrew Lumsdaine
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Boost.Iterators
- </p>
- </td>
+ <p>
+ Boost.Iterators
+ </p>
+ </td>
<td>
- <p>
- Iterator construction framework, adaptors, concepts, and more.
- </p>
- </td>
+ <p>
+ Iterator construction framework, adaptors, concepts, and more.
+ </p>
+ </td>
<td>
- <p>
- Dave Abrahams, Jeremy Siek, Thomas Witt
- </p>
- </td>
+ <p>
+ Dave Abrahams, Jeremy Siek, Thomas Witt
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Boost.call_traits
- </p>
- </td>
+ <p>
+ Boost.call_traits
+ </p>
+ </td>
<td>
- <p>
- Defines types for passing parameters.
- </p>
- </td>
+ <p>
+ Defines types for passing parameters.
+ </p>
+ </td>
<td>
- <p>
- John Maddock, Howard Hinnant
- </p>
- </td>
+ <p>
+ John Maddock, Howard Hinnant
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Boost.StaticAssert
- </p>
- </td>
+ <p>
+ Boost.StaticAssert
+ </p>
+ </td>
<td>
- <p>
- Static assertions (compile time assertions).
- </p>
- </td>
+ <p>
+ Static assertions (compile time assertions).
+ </p>
+ </td>
<td>
- <p>
- John Maddock
- </p>
- </td>
+ <p>
+ John Maddock
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="id591995"></a><p class="title"><b>Table 1.5. Optional Boost Libraries</b></p>
+<a name="id797954"></a><p class="title"><b>Table 1.5. Optional Boost Libraries</b></p>
<div class="table-contents"><table class="table" summary="Optional Boost Libraries">
<colgroup>
<col>
@@ -194,170 +194,169 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Name
- </p>
- </th>
+ <p>
+ Name
+ </p>
+ </th>
<th>
- <p>
- Description
- </p>
- </th>
+ <p>
+ Description
+ </p>
+ </th>
<th>
- <p>
- author
- </p>
- </th>
+ <p>
+ author
+ </p>
+ </th>
<th>
- <p>
- Purpose
- </p>
- </th>
+ <p>
+ Purpose
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- Boost.Serialization
- </p>
- </td>
-<td>
- <p>
- Serialization for persistence and marshalling
- </p>
- </td>
-<td>
- <p>
- Robert Ramey
- </p>
- </td>
-<td>
- <p>
- Serialization support for bimap containers and iterators
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Boost.Assign
- </p>
- </td>
-<td>
- <p>
- Filling containers with constant or generated data has never been easier
- </p>
- </td>
-<td>
- <p>
- Thorsten Ottosen
- </p>
- </td>
-<td>
- <p>
- Help to fill a bimap or views of it
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Boost.Hash
- </p>
- </td>
-<td>
- <p>
- A TR1 hash function object that can be extended to hash user defined
- types
- </p>
- </td>
-<td>
- <p>
- Daniel James
- </p>
- </td>
-<td>
- <p>
- Default hashing function
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Boost.Lambda
- </p>
- </td>
-<td>
- <p>
- Define small unnamed function objects at the actual call site, and
- more
- </p>
- </td>
-<td>
- <p>
- from Jaakko Järvi, Gary Powell
- </p>
- </td>
-<td>
- <p>
- Functors for modify, range, lower_bound and upper_bound
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Boost.Range
- </p>
- </td>
-<td>
- <p>
- A new infrastructure for generic algorithms that builds on top of the
- new iterator concepts
- </p>
- </td>
-<td>
- <p>
- Thorsten Ottosen
- </p>
- </td>
-<td>
- <p>
- Range based algorithms
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- Boost.PropertyMap
- </p>
- </td>
-<td>
- <p>
- Concepts defining interfaces which map key objects to value objects
- </p>
- </td>
-<td>
- <p>
- Jeremy Siek
- </p>
- </td>
-<td>
- <p>
- Integration with BGL
- </p>
- </td>
+ <p>
+ Boost.Serialization
+ </p>
+ </td>
+<td>
+ <p>
+ Serialization for persistence and marshalling
+ </p>
+ </td>
+<td>
+ <p>
+ Robert Ramey
+ </p>
+ </td>
+<td>
+ <p>
+ Serialization support for bimap containers and iterators
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Boost.Assign
+ </p>
+ </td>
+<td>
+ <p>
+ Filling containers with constant or generated data has never been
+ easier
+ </p>
+ </td>
+<td>
+ <p>
+ Thorsten Ottosen
+ </p>
+ </td>
+<td>
+ <p>
+ Help to fill a bimap or views of it
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Boost.Hash
+ </p>
+ </td>
+<td>
+ <p>
+ A TR1 hash function object that can be extended to hash user defined
+ types
+ </p>
+ </td>
+<td>
+ <p>
+ Daniel James
+ </p>
+ </td>
+<td>
+ <p>
+ Default hashing function
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Boost.Lambda
+ </p>
+ </td>
+<td>
+ <p>
+ Define small unnamed function objects at the actual call site,
+ and more
+ </p>
+ </td>
+<td>
+ <p>
+ from Jaakko Järvi, Gary Powell
+ </p>
+ </td>
+<td>
+ <p>
+ Functors for modify, range, lower_bound and upper_bound
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Boost.Range
+ </p>
+ </td>
+<td>
+ <p>
+ A new infrastructure for generic algorithms that builds on top
+ of the new iterator concepts
+ </p>
+ </td>
+<td>
+ <p>
+ Thorsten Ottosen
+ </p>
+ </td>
+<td>
+ <p>
+ Range based algorithms
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ Boost.PropertyMap
+ </p>
+ </td>
+<td>
+ <p>
+ Concepts defining interfaces which map key objects to value objects
+ </p>
+ </td>
+<td>
+ <p>
+ Jeremy Siek
+ </p>
+ </td>
+<td>
+ <p>
+ Integration with BGL
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="id592279"></a><p class="title"><b>Table 1.6. Additional Boost Libraries needed to run
- the test-suite</b></p>
-<div class="table-contents"><table class="table" summary="Additional Boost Libraries needed to run
- the test-suite">
+<a name="id798264"></a><p class="title"><b>Table 1.6. Additional Boost Libraries needed to run the test-suite</b></p>
+<div class="table-contents"><table class="table" summary="Additional Boost Libraries needed to run the test-suite">
<colgroup>
<col>
<col>
@@ -365,38 +364,38 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Name
- </p>
- </th>
+ <p>
+ Name
+ </p>
+ </th>
<th>
- <p>
- Description
- </p>
- </th>
+ <p>
+ Description
+ </p>
+ </th>
<th>
- <p>
- author
- </p>
- </th>
+ <p>
+ author
+ </p>
+ </th>
</tr></thead>
<tbody><tr>
<td>
- <p>
- Boost.Test
- </p>
- </td>
-<td>
- <p>
- Support for simple program testing, full unit testing, and for program
- execution monitoring.
- </p>
- </td>
-<td>
- <p>
- Gennadiy Rozental
- </p>
- </td>
+ <p>
+ Boost.Test
+ </p>
+ </td>
+<td>
+ <p>
+ Support for simple program testing, full unit testing, and for
+ program execution monitoring.
+ </p>
+ </td>
+<td>
+ <p>
+ Gennadiy Rozental
+ </p>
+ </td>
</tr></tbody>
</table></div>
</div>
@@ -404,7 +403,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -412,7 +411,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="boost_libraries_that_work_well_with_boost_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/compiler_specifics.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Compiler specifics</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="reference/unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">
<link rel="next" href="performance.html" title="Performance">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Compiler specifics">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.compiler_specifics"></a><a class="link" href="compiler_specifics.html" title="Compiler specifics">Compiler specifics</a>
</h2></div></div></div>
@@ -34,298 +34,298 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Compiler
- </p>
+ <p>
+ Compiler
+ </p>
</th>
<th>
- <p>
- OS Tested
- </p>
+ <p>
+ OS Tested
+ </p>
</th>
<th>
- <p>
- State
- </p>
+ <p>
+ State
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- GCC 3.3
- </p>
+ <p>
+ GCC 3.3
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- GCC 3.4
- </p>
+ <p>
+ GCC 3.4
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- GCC 4.0
- </p>
+ <p>
+ GCC 4.0
+ </p>
</td>
<td>
- <p>
- Linux, Mac
- </p>
+ <p>
+ Linux, Mac
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- GCC 4.1
- </p>
+ <p>
+ GCC 4.1
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- GCC 4.2
- </p>
+ <p>
+ GCC 4.2
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- ICC 8.0
- </p>
+ <p>
+ ICC 8.0
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- ICC 9.0
- </p>
+ <p>
+ ICC 9.0
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- ICC 9.1
- </p>
+ <p>
+ ICC 9.1
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- GCC 4.2
- </p>
+ <p>
+ GCC 4.2
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- GCC 4.2
- </p>
+ <p>
+ GCC 4.2
+ </p>
</td>
<td>
- <p>
- Linux
- </p>
+ <p>
+ Linux
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- VS 7.1
- </p>
+ <p>
+ VS 7.1
+ </p>
</td>
<td>
- <p>
- Windows
- </p>
+ <p>
+ Windows
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- VS 8.0
- </p>
+ <p>
+ VS 8.0
+ </p>
</td>
<td>
- <p>
- Windows
- </p>
+ <p>
+ Windows
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- ICC 7.1
- </p>
+ <p>
+ ICC 7.1
+ </p>
</td>
<td>
- <p>
- Windows
- </p>
+ <p>
+ Windows
+ </p>
</td>
<td>
- <p>
- Not Supported
- </p>
+ <p>
+ Not Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- ICC 8.0
- </p>
+ <p>
+ ICC 8.0
+ </p>
</td>
<td>
- <p>
- Windows
- </p>
+ <p>
+ Windows
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- ICC 9.1
- </p>
+ <p>
+ ICC 9.1
+ </p>
</td>
<td>
- <p>
- Windows
- </p>
+ <p>
+ Windows
+ </p>
</td>
<td>
- <p>
- Supported
- </p>
+ <p>
+ Supported
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- CW 8.3
- </p>
+ <p>
+ CW 8.3
+ </p>
</td>
<td>
- <p>
- Windows
- </p>
+ <p>
+ Windows
+ </p>
</td>
<td>
- <p>
- Not Supported
- </p>
+ <p>
+ Not Supported
+ </p>
</td>
</tr>
</tbody>
</table></div>
<a name="boost_bimap.compiler_specifics.vs_7_1"></a><h3>
-<a name="id650190"></a>
+<a name="id857967"></a>
<a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_7_1">VS 7.1</a>
</h3>
<p>
@@ -334,7 +334,7 @@
in msdn is to split the .cpp in several files or upgrade your compiler.
</p>
<a name="boost_bimap.compiler_specifics.vs_8_0"></a><h3>
-<a name="id650218"></a>
+<a name="id857995"></a>
<a class="link" href="compiler_specifics.html#boost_bimap.compiler_specifics.vs_8_0">VS 8.0</a>
</h3>
<p>
@@ -352,7 +352,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -360,7 +360,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="reference/unconstrained_set_of_reference.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="performance.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Examples</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="performance.html" title="Performance">
<link rel="next" href="examples/simple_bimap.html" title="Simple Bimap">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="performance.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="performance.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Examples">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
</h2></div></div></div>
@@ -35,7 +35,7 @@
<dt><span class="section"><a href="examples/multiindex_to_bimap_path___hashed_indices.html">MultiIndex
to Bimap Path - Hashed indices</a></span></dt>
</dl></div>
-<div class="section" title="Examples list">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.examples.examples_list"></a><a class="link" href="examples.html#boost_bimap.examples.examples_list" title="Examples list">Examples list</a>
</h3></div></div></div>
@@ -44,7 +44,7 @@
find all the examples used in bimap documentation. Here is a list of them:
</p>
<div class="table">
-<a name="id650327"></a><p class="title"><b>Table 1.7. Tutorial examples</b></p>
+<a name="id858104"></a><p class="title"><b>Table 1.7. Tutorial examples</b></p>
<div class="table-contents"><table class="table" summary="Tutorial examples">
<colgroup>
<col>
@@ -52,193 +52,194 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Program
- </p>
- </th>
+ <p>
+ Program
+ </p>
+ </th>
<th>
- <p>
- Description
- </p>
- </th>
+ <p>
+ Description
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- simple_bimap.cpp
- </p>
- </td>
+ <p>
+ simple_bimap.cpp
+ </p>
+ </td>
<td>
- <p>
- Soccer world cup example
- </p>
- </td>
+ <p>
+ Soccer world cup example
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/tagged_simple_bimap.cpp" target="_top">tagged_simple_bimap.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/tagged_simple_bimap.cpp" target="_top">tagged_simple_bimap.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Soccer world cup example using user defined names
- </p>
- </td>
+ <p>
+ Soccer world cup example using user defined names
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- step_by_step.cpp
- </p>
- </td>
+ <p>
+ step_by_step.cpp
+ </p>
+ </td>
<td>
- <p>
- Basic example of the three views of bimap
- </p>
- </td>
+ <p>
+ Basic example of the three views of bimap
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/population_bimap.cpp" target="_top">population_bimap.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/population_bimap.cpp" target="_top">population_bimap.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Countries populations, using <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
- and <code class="computeroutput"><span class="identifier">multiset_of</span></code>
- </p>
- </td>
+ <p>
+ Countries populations, using <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
+ and <code class="computeroutput"><span class="identifier">multiset_of</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/repetitions_counter.cpp" target="_top">repetitions_counter.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/repetitions_counter.cpp" target="_top">repetitions_counter.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Word repetitions counter, using <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
- and <code class="computeroutput"><span class="identifier">list_of</span></code>
- </p>
- </td>
+ <p>
+ Word repetitions counter, using <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
+ and <code class="computeroutput"><span class="identifier">list_of</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- mighty_bimap.cpp
- </p>
- </td>
+ <p>
+ mighty_bimap.cpp
+ </p>
+ </td>
<td>
- <p>
- Dictionary using <code class="computeroutput"><span class="identifier">list_of_relation</span></code>
- </p>
- </td>
+ <p>
+ Dictionary using <code class="computeroutput"><span class="identifier">list_of_relation</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/user_defined_names.cpp" target="_top">user_defined_names.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/user_defined_names.cpp" target="_top">user_defined_names.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Equivalence between code with tagged and untagged code
- </p>
- </td>
+ <p>
+ Equivalence between code with tagged and untagged code
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/standard_map_comparison.cpp" target="_top">standard_map_comparison.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/standard_map_comparison.cpp" target="_top">standard_map_comparison.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Comparison between standard maps and bimap map views
- </p>
- </td>
+ <p>
+ Comparison between standard maps and bimap map views
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/at_function_examples.cpp" target="_top">at_function_examples.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/at_function_examples.cpp" target="_top">at_function_examples.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Functions <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
- and <code class="computeroutput"><span class="keyword">operator</span><span class="special">[](</span><span class="identifier">key</span><span class="special">)</span></code>
- examples
- </p>
- </td>
+ <p>
+ Functions <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>
+ and <code class="computeroutput"><span class="keyword">operator</span><span class="special">[](</span><span class="identifier">key</span><span class="special">)</span></code>
+ examples
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/tutorial_modify_and_replace.cpp" target="_top">tutorial_modify_and_replace.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/tutorial_modify_and_replace.cpp" target="_top">tutorial_modify_and_replace.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="identifier">replace</span></code> examples
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="identifier">replace</span></code> examples
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- tutorial_range.cpp
- </p>
- </td>
+ <p>
+ <a href="../../../example/tutorial_range.cpp" target="_top">tutorial_range.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">range</span><span class="special">()</span></code>
- tutorial
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">range</span><span class="special">()</span></code>
+ tutorial
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/tutorial_info_hook.cpp" target="_top">tutorial_info_hook.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/tutorial_info_hook.cpp" target="_top">tutorial_info_hook.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Additional information hooking
- </p>
- </td>
+ <p>
+ Additional information hooking
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/unconstrained_collection.cpp" target="_top">unconstrained_collection.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/unconstrained_collection.cpp" target="_top">unconstrained_collection.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Using <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
- collection type
- </p>
- </td>
+ <p>
+ Using <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
+ collection type
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="id650801"></a><p class="title"><b>Table 1.8. Bimap and Boost examples</b></p>
+<a name="id858595"></a><p class="title"><b>Table 1.8. Bimap and Boost examples</b></p>
<div class="table-contents"><table class="table" summary="Bimap and Boost examples">
<colgroup>
<col>
@@ -246,122 +247,126 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Program
- </p>
- </th>
+ <p>
+ Program
+ </p>
+ </th>
<th>
- <p>
- Description
- </p>
- </th>
+ <p>
+ Description
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- assign.cpp
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/assign.cpp" target="_top">assign.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.Assign: Methods to insert elements
- </p>
- </td>
+ <p>
+ Bimap and Boost.Assign: Methods to insert elements
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- lambda.cpp
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/lambda.cpp" target="_top">lambda.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.Lambda: new lambda placeholders
- </p>
- </td>
+ <p>
+ Bimap and Boost.Lambda: new lambda placeholders
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/bimap_and_boost/property_map.cpp" target="_top">property_map.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/property_map.cpp" target="_top">property_map.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.PropertyMap: PropertyMap support
- </p>
- </td>
+ <p>
+ Bimap and Boost.PropertyMap: PropertyMap support
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- range.cpp
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/range.cpp" target="_top">range.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.Range: Using bimaps in the new range framework
- </p>
- </td>
+ <p>
+ Bimap and Boost.Range: Using bimaps in the new range framework
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/bimap_and_boost/foreach.cpp" target="_top">foreach.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/foreach.cpp" target="_top">foreach.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.Foreach: Iterating over bimaps
- </p>
- </td>
+ <p>
+ Bimap and Boost.Foreach: Iterating over bimaps
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- typeof.cpp
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/typeof.cpp" target="_top">typeof.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x
- </p>
- </td>
+ <p>
+ Bimap and Boost.Typeof: using BOOST_AUTO while we wait for C++0x
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/bimap_and_boost/xpressive.cpp" target="_top">xpressive.cpp
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/xpressive.cpp" target="_top">xpressive.cpp
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.Xpressive: Inserting elements in a bimap
- </p>
- </td>
+ <p>
+ Bimap and Boost.Xpressive: Inserting elements in a bimap
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/bimap_and_boost/serialization.cpp" target="_top">serialization.cpp:
- </a>
- </p>
- </td>
+ <p>
+ <a href="../../../example/bimap_and_boost/serialization.cpp" target="_top">serialization.cpp:
+ </a>
+ </p>
+ </td>
<td>
- <p>
- Bimap and Boost.Serialization: Load and save bimaps and iterators
- </p>
- </td>
+ <p>
+ Bimap and Boost.Serialization: Load and save bimaps and iterators
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="id651020"></a><p class="title"><b>Table 1.9. Boost.MultiIndex to Boost.Bimap path examples</b></p>
+<a name="id858826"></a><p class="title"><b>Table 1.9. Boost.MultiIndex to Boost.Bimap path examples</b></p>
<div class="table-contents"><table class="table" summary="Boost.MultiIndex to Boost.Bimap path examples">
<colgroup>
<col>
@@ -369,55 +374,55 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Program
- </p>
- </th>
+ <p>
+ Program
+ </p>
+ </th>
<th>
- <p>
- Description
- </p>
- </th>
+ <p>
+ Description
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <a href="../../../example/mi_to_b_path/bidirectional_map.cpp" target="_top">bidirectional_map.cpp
- </a>
- </p>
- </td>
-<td>
- <p>
- Boost.MultiIndex to Boost.Bimap path example
- </p>
- </td>
+ <p>
+ <a href="../../../example/mi_to_b_path/bidirectional_map.cpp" target="_top">bidirectional_map.cpp
+ </a>
+ </p>
+ </td>
+<td>
+ <p>
+ Boost.MultiIndex to Boost.Bimap path example
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/mi_to_b_path/hashed_indices.cpp" target="_top">hashed_indices.cpp
- </a>
- </p>
- </td>
-<td>
- <p>
- Boost.MultiIndex to Boost.Bimap path example
- </p>
- </td>
+ <p>
+ <a href="../../../example/mi_to_b_path/hashed_indices.cpp" target="_top">hashed_indices.cpp
+ </a>
+ </p>
+ </td>
+<td>
+ <p>
+ Boost.MultiIndex to Boost.Bimap path example
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../example/mi_to_b_path/tagged_bidirectional_map.cpp" target="_top">tagged_bidirectional_map.cpp
- </a>
- </p>
- </td>
-<td>
- <p>
- Boost.MultiIndex to Boost.Bimap path example
- </p>
- </td>
+ <p>
+ <a href="../../../example/mi_to_b_path/tagged_bidirectional_map.cpp" target="_top">tagged_bidirectional_map.cpp
+ </a>
+ </p>
+ </td>
+<td>
+ <p>
+ Boost.MultiIndex to Boost.Bimap path example
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
@@ -427,7 +432,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -435,7 +440,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="performance.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="performance.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples/simple_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/mighty_bimap.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Mighty Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
<link rel="prev" href="simple_bimap.html" title="Simple Bimap">
<link rel="next" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex to Bimap Path - Bidirectional Map">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="simple_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="simple_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Mighty Bimap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.examples.mighty_bimap"></a><a class="link" href="mighty_bimap.html" title="Mighty Bimap">Mighty Bimap</a>
</h3></div></div></div>
@@ -34,9 +34,7 @@
<a href="../../../../example/mighty_bimap.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">string</span><span class="special">></span>
@@ -121,13 +119,11 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -135,7 +131,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="simple_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="simple_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___bidirectional_map.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>MultiIndex to Bimap Path - Bidirectional Map</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
<link rel="prev" href="mighty_bimap.html" title="Mighty Bimap">
<link rel="next" href="multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="mighty_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="MultiIndex to Bimap Path - Bidirectional Map">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map"></a><a class="link" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex to Bimap Path - Bidirectional Map">MultiIndex
to Bimap Path - Bidirectional Map</a>
@@ -42,7 +42,7 @@
</p>
</div>
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex"></a><h5>
-<a name="id655859"></a>
+<a name="id863650"></a>
<a class="link" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_multiindex">Boost.MultiIndex</a>
</h5>
<p>
@@ -50,9 +50,7 @@
code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">tokenizer</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -146,11 +144,9 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_bimap"></a><h5>
-<a name="id657572"></a>
+<a name="id865360"></a>
<a class="link" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap.examples.multiindex_to_bimap_path___bidirectional_map.boost_bimap">Boost.Bimap</a>
</h5>
<p>
@@ -158,9 +154,7 @@
code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">tokenizer</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -198,7 +192,7 @@
<span class="comment">// the second part of the element is the equivalent in English
</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">word</span> <span class="special"><<</span> <span class="string">" is said "</span>
- <span class="special"><<</span> <span class="identifier">it</span><span class="special">-></span><span class="identifier">second</span> <span class="callout_bug"><a class="co" name="boost_bimap23co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap23"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span>
+ <span class="special"><<</span> <span class="identifier">it</span><span class="special">-></span><span class="identifier">second</span> <a class="co" name="boost_bimap23co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap23"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
<span class="special"><<</span> <span class="string">" in English"</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span>
<span class="keyword">else</span>
@@ -209,7 +203,7 @@
<span class="keyword">if</span><span class="special">(</span> <span class="identifier">it2</span> <span class="special">!=</span> <span class="identifier">d</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span> <span class="special">)</span>
<span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">word</span> <span class="special"><<</span> <span class="string">" is said "</span>
- <span class="special"><<</span> <span class="identifier">it2</span><span class="special">-></span><span class="identifier">second</span> <span class="callout_bug"><a class="co" name="boost_bimap24co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap24"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a></span>
+ <span class="special"><<</span> <span class="identifier">it2</span><span class="special">-></span><span class="identifier">second</span> <a class="co" name="boost_bimap24co" href="multiindex_to_bimap_path___bidirectional_map.html#boost_bimap24"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a>
<span class="special"><<</span> <span class="string">" in Spanish"</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span>
<span class="keyword">else</span>
@@ -222,28 +216,24 @@
<span class="special">}</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap23"></a> </p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">it</span></code> is an iterator of the
- left view, so <code class="computeroutput"><span class="identifier">it</span><span class="special">-></span><span class="identifier">second</span></code> refers to the right element of
- the relation, the word in english </p></td>
+ left view, so <code class="computeroutput"><span class="identifier">it</span><span class="special">-></span><span class="identifier">second</span></code> refers to the right element of the
+ relation, the word in english </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap24"></a> </p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">it2</span></code>
- is an iterator of the right view, so <code class="computeroutput"><span class="identifier">it2</span><span class="special">-></span><span class="identifier">second</span></code>
- refers to the left element of the relation, the word in spanish </p></td>
+ is an iterator of the right view, so <code class="computeroutput"><span class="identifier">it2</span><span class="special">-></span><span class="identifier">second</span></code>
+ refers to the left element of the relation, the word in spanish </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
<p>
Or better, using tags...
@@ -253,9 +243,7 @@
source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
@@ -326,13 +314,11 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -340,7 +326,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="mighty_bimap.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/multiindex_to_bimap_path___hashed_indices.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>MultiIndex to Bimap Path - Hashed indices</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
<link rel="prev" href="multiindex_to_bimap_path___bidirectional_map.html" title="MultiIndex to Bimap Path - Bidirectional Map">
<link rel="next" href="../test_suite.html" title="Test suite">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../test_suite.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../test_suite.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="MultiIndex to Bimap Path - Hashed indices">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices"></a><a class="link" href="multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">MultiIndex
to Bimap Path - Hashed indices</a>
@@ -40,7 +40,7 @@
</p>
</div>
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex"></a><h5>
-<a name="id660222"></a>
+<a name="id867998"></a>
<a class="link" href="multiindex_to_bimap_path___hashed_indices.html#boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_multiindex">Boost.MultiIndex</a>
</h5>
<p>
@@ -48,9 +48,7 @@
code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iomanip</span><span class="special">></span>
@@ -136,20 +134,16 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_bimap"></a><h5>
-<a name="id661922"></a>
+<a name="id869694"></a>
<a class="link" href="multiindex_to_bimap_path___hashed_indices.html#boost_bimap.examples.multiindex_to_bimap_path___hashed_indices.boost_bimap">Boost.Bimap</a>
</h5>
<p>
<a href="../../../../example/mi_to_b_path/hashed_indices.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iomanip</span><span class="special">></span>
@@ -226,13 +220,11 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -240,7 +232,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../test_suite.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="multiindex_to_bimap_path___bidirectional_map.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../test_suite.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/examples/simple_bimap.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Simple Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../examples.html" title="Examples">
<link rel="prev" href="../examples.html" title="Examples">
<link rel="next" href="mighty_bimap.html" title="Mighty Bimap">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mighty_bimap.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Simple Bimap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.examples.simple_bimap"></a><a class="link" href="simple_bimap.html" title="Simple Bimap">Simple Bimap</a>
</h3></div></div></div>
@@ -33,9 +33,7 @@
<a href="../../../../example/simple_bimap.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">string</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
@@ -95,8 +93,6 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
You can rewrite it using tags to gain readability.
@@ -105,9 +101,7 @@
<a href="../../../../example/tagged_simple_bimap.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
@@ -140,12 +134,12 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Countries names ordered by their final position:"</span>
<span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
- <span class="line_callout_bug"><a class="co" name="boost_bimap20co" href="simple_bimap.html#boost_bimap20"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="keyword">for</span><span class="special">(</span> <span class="identifier">results_bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">place</span><span class="special">>::</span><span class="identifier">const_iterator</span>
+ <a class="co" name="boost_bimap20co" href="simple_bimap.html#boost_bimap20"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="keyword">for</span><span class="special">(</span> <span class="identifier">results_bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">place</span><span class="special">>::</span><span class="identifier">const_iterator</span>
<span class="identifier">i</span> <span class="special">=</span> <span class="identifier">results</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">place</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span>
<span class="identifier">iend</span> <span class="special">=</span> <span class="identifier">results</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">place</span><span class="special">>().</span><span class="identifier">end</span><span class="special">()</span> <span class="special">;</span>
<span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">iend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span> <span class="special">)</span>
<span class="special">{</span>
- <span class="line_callout_bug"><a class="co" name="boost_bimap21co" href="simple_bimap.html#boost_bimap21"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a></span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">place</span> <span class="special">>()</span> <span class="special"><<</span> <span class="string">") "</span>
+ <a class="co" name="boost_bimap21co" href="simple_bimap.html#boost_bimap21"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">place</span> <span class="special">>()</span> <span class="special"><<</span> <span class="string">") "</span>
<span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">country</span><span class="special">>()</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span>
@@ -154,13 +148,13 @@
<span class="string">"their final position:"</span>
<span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
- <span class="line_callout_bug"><a class="co" name="boost_bimap22co" href="simple_bimap.html#boost_bimap22"><img src="../../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a></span><span class="keyword">for</span><span class="special">(</span> <span class="identifier">results_bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">country</span><span class="special">>::</span><span class="identifier">const_iterator</span>
+ <a class="co" name="boost_bimap22co" href="simple_bimap.html#boost_bimap22"><img src="../../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a><span class="keyword">for</span><span class="special">(</span> <span class="identifier">results_bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">country</span><span class="special">>::</span><span class="identifier">const_iterator</span>
<span class="identifier">i</span> <span class="special">=</span> <span class="identifier">results</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">country</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span>
<span class="identifier">iend</span> <span class="special">=</span> <span class="identifier">results</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">country</span><span class="special">>().</span><span class="identifier">end</span><span class="special">()</span> <span class="special">;</span>
<span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">iend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span> <span class="special">)</span>
<span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">country</span><span class="special">>()</span> <span class="special"><<</span> <span class="string">" ends "</span>
- <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">place</span> <span class="special">>()</span> <span class="special"><<</span> <span class="string">"º"</span>
+ <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">place</span> <span class="special">>()</span> <span class="special"><<</span> <span class="string">"º"</span>
<span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span>
@@ -168,38 +162,33 @@
<span class="special">}</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap20"></a> </p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">results</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">place</span><span class="special">>()</span></code>
- is equivalent to <code class="computeroutput"><span class="identifier">results</span><span class="special">.</span><span class="identifier">right</span></code>
- </p></td>
+ is equivalent to <code class="computeroutput"><span class="identifier">results</span><span class="special">.</span><span class="identifier">right</span></code>
+ </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap21"></a> </p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">get</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">></span></code>
- works for each view of the bimap </p></td>
+ works for each view of the bimap </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap22"></a>
</p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">results</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">country</span><span class="special">>()</span></code>
- is equivalent to <code class="computeroutput"><span class="identifier">results</span><span class="special">.</span><span class="identifier">left</span></code>
- </p></td>
+ is equivalent to <code class="computeroutput"><span class="identifier">results</span><span class="special">.</span><span class="identifier">left</span></code> </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -207,7 +196,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="mighty_bimap.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../examples.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../examples.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mighty_bimap.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/future_work.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/future_work.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/future_work.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Future work</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="test_suite.html" title="Test suite">
<link rel="next" href="release_notes.html" title="Release notes">
</head>
@@ -13,21 +13,21 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Future work">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.future_work"></a><a class="link" href="future_work.html" title="Future work">Future work</a>
</h2></div></div></div>
<a name="boost_bimap.future_work.rearrange_function"></a><h4>
-<a name="id664672"></a>
+<a name="id872205"></a>
<a class="link" href="future_work.html#boost_bimap.future_work.rearrange_function">Rearrange Function</a>
</h4>
<p>
@@ -37,7 +37,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -45,7 +45,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="test_suite.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="release_notes.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/history.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/history.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/history.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>History</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="rationale/the_student_and_the_mentor.html" title="The student and the mentor">
<link rel="next" href="history/multiindex_and_bimap.html" title="MultiIndex and Bimap">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="History">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.history"></a><a class="link" href="history.html" title="History">History</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
<dt><span class="section"><a href="history/multiindex_and_bimap.html">MultiIndex
and Bimap</a></span></dt>
</dl></div>
-<div class="section" title="The long path from Code Project to Boost">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.history.the_long_path_from_code_project_to_boost"></a><a class="link" href="history.html#boost_bimap.history.the_long_path_from_code_project_to_boost" title="The long path from Code Project to Boost">The
long path from Code Project to Boost</a>
@@ -42,62 +42,62 @@
<dl>
<dt><span class="term">2002 - bimap at Code Project</span></dt>
<dd><p>
- Joaquin Lopez Muñoz posted his first <a href="http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite" target="_top">bimap
- library</a> in 2002. Tons of users have been using it. He then <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881" target="_top">asked
- the list for interest</a> in his library in 2003. Luckily, there
- was a lot of interest and Joaquin started to boostify the code. At some
- point all the developers seemed to agree that, rather than a bidirectional
- map, it would be better to work on an N-indexed set that contained Joaquin's
- library as a particular case.
- </p></dd>
+ Joaquin Lopez Muñoz posted his first <a href="http://www.codeproject.com/vcpp/stl/bimap.asp#test_suite" target="_top">bimap
+ library</a> in 2002. Tons of users have been using it. He then
+ <a href="http://aspn.activestate.com/ASPN/Mail/Message/boost/1404881" target="_top">asked
+ the list for interest</a> in his library in 2003. Luckily, there
+ was a lot of interest and Joaquin started to boostify the code. At
+ some point all the developers seemed to agree that, rather than a bidirectional
+ map, it would be better to work on an N-indexed set that contained
+ Joaquin's library as a particular case.
+ </p></dd>
<dt><span class="term">2003 - multiindex_set</span></dt>
<dd><p>
- The library grew enormously and was ready for a formal review in 2003.
- At this point, the container was a lot more powerful, but everything
- comes with a price and this new beast lacked the simplicity of the original
- bimap.
- </p></dd>
+ The library grew enormously and was ready for a formal review in 2003.
+ At this point, the container was a lot more powerful, but everything
+ comes with a price and this new beast lacked the simplicity of the
+ original bimap.
+ </p></dd>
<dt><span class="term">2004 - indexed_set</span></dt>
<dd><p>
- In 2004, the formal review ended well for the new multi-indexed container.
- This Swiss army knife introduced several new features, such as non-unique
- indexes, hashed indices and sequenced indices. In the list of improvements
- to the library, it was mentioned that a bidirectional map should be coded
- in top of this container.
- </p></dd>
+ In 2004, the formal review ended well for the new multi-indexed container.
+ This Swiss army knife introduced several new features, such as non-unique
+ indexes, hashed indices and sequenced indices. In the list of improvements
+ to the library, it was mentioned that a bidirectional map should be
+ coded in top of this container.
+ </p></dd>
<dt><span class="term">2005 - multi_index_container</span></dt>
<dd><p>
- Once in Boost, the library switched to the now familiar name "Boost.MultiIndex".
- Late in 2004, it formally became a member of Boost. Joaquin continued
- to enchance the library and added new features such as composite keys
- and random-access indices.
- </p></dd>
-<dt><span class="term">2006 - Multi Index Specialized Containers
- SoC project</span></dt>
-<dd><p>
- In 2006, during the formal review of Boost.Property_tree, the need for
- a bidirectional map container built on top of Boost.MultiIndex arose
- again. Boost entered the Google SoC 2006 as a mentor organization at
- the same time. Joaquin put himself forward as a mentor. He proposed to
- build not only a bidirectional map, but a myriad multi-indexed specialized
- containers. Matias Capeletto presented an application to code Boost.Misc
- for the SoC and was elected, along with nine other students. Matias's
- and Joaquin's SoC project ends with a working implementation of the bimap
- library that was presented in an informal review. By the end of the year
- the library was queued for a formal review.
- </p></dd>
+ Once in Boost, the library switched to the now familiar name "Boost.MultiIndex".
+ Late in 2004, it formally became a member of Boost. Joaquin continued
+ to enchance the library and added new features such as composite keys
+ and random-access indices.
+ </p></dd>
+<dt><span class="term">2006 - Multi Index Specialized Containers SoC project</span></dt>
+<dd><p>
+ In 2006, during the formal review of Boost.Property_tree, the need
+ for a bidirectional map container built on top of Boost.MultiIndex
+ arose again. Boost entered the Google SoC 2006 as a mentor organization
+ at the same time. Joaquin put himself forward as a mentor. He proposed
+ to build not only a bidirectional map, but a myriad multi-indexed specialized
+ containers. Matias Capeletto presented an application to code Boost.Misc
+ for the SoC and was elected, along with nine other students. Matias's
+ and Joaquin's SoC project ends with a working implementation of the
+ bimap library that was presented in an informal review. By the end
+ of the year the library was queued for a formal review.
+ </p></dd>
<dt><span class="term">2007 - Boost.Bimap</span></dt>
<dd><p>
- The formal review took place at the beggining of the year and Boost.Bimap
- was accepted in Boost.
- </p></dd>
+ The formal review took place at the beggining of the year and Boost.Bimap
+ was accepted in Boost.
+ </p></dd>
</dl>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -105,7 +105,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="rationale/the_student_and_the_mentor.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history/multiindex_and_bimap.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/history/multiindex_and_bimap.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>MultiIndex and Bimap</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../history.html" title="History">
<link rel="prev" href="../history.html" title="History">
<link rel="next" href="../acknowledgements.html" title="Acknowledgements">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../history.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../history.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="MultiIndex and Bimap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.history.multiindex_and_bimap"></a><a class="link" href="multiindex_and_bimap.html" title="MultiIndex and Bimap">MultiIndex
and Bimap</a>
@@ -36,62 +36,38 @@
<p>
<span class="bold"><strong>Marcin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> The biggest virtue of property_tree is easy to use interface.
- If we try to make generic tree of it, it will be compromised. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> The biggest virtue of property_tree is easy to use interface.
+ If we try to make generic tree of it, it will be compromised. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Gennadiy</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> IMO the same result (as library presents) could be achieved
- just by using multi_index. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> IMO the same result (as library presents) could be achieved
+ just by using multi_index. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Marcin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Could you elaborate more on that? I considered use of multi_index
- to implement indexing for properties, but it only affected the implementation
- part of library, not interface, and because I already had a working,
- exception safe solution, I didn't see the reason to dump it and add another
- dependency on another library. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Could you elaborate more on that? I considered use of multi_index
+ to implement indexing for properties, but it only affected the implementation
+ part of library, not interface, and because I already had a working, exception
+ safe solution, I didn't see the reason to dump it and add another dependency
+ on another library. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Gennadiy</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I mean why do I need this half baked property_tree as another
- data structure? Property tree supports nothing in itself. It's just a
- data structure. You have parsers that produce property tree out of different
- sources. But you mat as well produce maps or something else. Here for
- example All that I need to do to "implement" similar functionality
- as your property tree: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I mean why do I need this half baked property_tree as another
+ data structure? Property tree supports nothing in itself. It's just a data
+ structure. You have parsers that produce property tree out of different
+ sources. But you mat as well produce maps or something else. Here for example
+ All that I need to do to "implement" similar functionality as
+ your property tree: </em></span>
+ </p></blockquote></div>
<p>
</p>
@@ -128,15 +104,9 @@
</pre>
<p>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Use it like this: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Use it like this: </em></span>
+ </p></blockquote></div>
<p>
</p>
@@ -147,415 +117,231 @@
</pre>
<p>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Now tell me how property_tree interface is easier? And what
- is the value in 50k of Code you need to implement this data structure.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Now tell me how property_tree interface is easier? And what
+ is the value in 50k of Code you need to implement this data structure.
+ </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Thorsten</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Seriously Gennadiy, do you really see newbies writing the
- code you just did? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Seriously Gennadiy, do you really see newbies writing the code
+ you just did? </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Marcin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> What you just implemented is stripped down, bare bones version
- of property_tree that, among other things, does not allow you to produce
- human editable XML files. Now add more interface (aka get functions),
- add more archives to serialization lib, add customization, add transparent
- translation from strings to arbitrary types and vice versa. Spend some
- weeks trying to get all the corner cases right, and then some more weeks
- trying to smooth rough edges in the interface. Then write tests. Write
- docs. At the end, I believe you will not get much less code than there
- is in the library already. Maybe you get some savings by using multi_index
- instead of manual indexing. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> The reason why ptree does not use multi index is because implementation
- existed long before I considered submitting to boost, probably before
- even I knew of multi index existence. It was working well. Later, when
- I was improving it during pre-review process, I seriously considered
- using multi-index. But I decided it is not worth throwing everything
- out. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Although ptree has large interface with many functions modifying
- state of the tree, it uses "single point of change" approach.
- Every insert eventually goes through one function, which takes care of
- exception safety and keeping index in sync with data. The same applies
- to erase. This function has 9 lines of code in case of insert, and (by
- coincidence) also 9 in case of erase. By using multi index these functions
- would obviously be simplified, maybe to 4 lines each. Net gain: 10 lines
- of code (out of several hundred in ptree_implementation.hpp). </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I'm aware that there are performance gains to be reaped as
- well, but at that time I was rather focusing on getting the interface
- right. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> What you just implemented is stripped down, bare bones version
+ of property_tree that, among other things, does not allow you to produce
+ human editable XML files. Now add more interface (aka get functions), add
+ more archives to serialization lib, add customization, add transparent
+ translation from strings to arbitrary types and vice versa. Spend some
+ weeks trying to get all the corner cases right, and then some more weeks
+ trying to smooth rough edges in the interface. Then write tests. Write
+ docs. At the end, I believe you will not get much less code than there
+ is in the library already. Maybe you get some savings by using multi_index
+ instead of manual indexing. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> The reason why ptree does not use multi index is because implementation
+ existed long before I considered submitting to boost, probably before even
+ I knew of multi index existence. It was working well. Later, when I was
+ improving it during pre-review process, I seriously considered using multi-index.
+ But I decided it is not worth throwing everything out. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Although ptree has large interface with many functions modifying
+ state of the tree, it uses "single point of change" approach.
+ Every insert eventually goes through one function, which takes care of
+ exception safety and keeping index in sync with data. The same applies
+ to erase. This function has 9 lines of code in case of insert, and (by
+ coincidence) also 9 in case of erase. By using multi index these functions
+ would obviously be simplified, maybe to 4 lines each. Net gain: 10 lines
+ of code (out of several hundred in ptree_implementation.hpp). </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I'm aware that there are performance gains to be reaped as well,
+ but at that time I was rather focusing on getting the interface right.
+ </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Dave</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> That's perfectly reasonable, but (through no fault of yours)
- it misses the point I was trying to make. I guess I should have said,
- "...that demonstrates it to be the best implementation." </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> All I'm saying is that the extent to which a Boost library
- implementation should leverage other Boost libraries is not a question
- that can always be decided based on following simple guidelines, and
- that if this library is accepted, it's worth revisiting your decision.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> That's perfectly reasonable, but (through no fault of yours)
+ it misses the point I was trying to make. I guess I should have said, "...that
+ demonstrates it to be the best implementation." </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> All I'm saying is that the extent to which a Boost library implementation
+ should leverage other Boost libraries is not a question that can always
+ be decided based on following simple guidelines, and that if this library
+ is accepted, it's worth revisiting your decision. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Thorsten</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I think it is important to focus on the interface in the review,
- but I also see several benefits of an implementation that builds on Boost.MultiIndex:'
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- fewer bugs like the one Joaquin found</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- better space efficiency</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- exception-safety guarantees are immediately full-filled (I
- haven't looked, but I suspect that there are several bugs in this area)</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I think it is important to focus on the interface in the review,
+ but I also see several benefits of an implementation that builds on Boost.MultiIndex:'
+ </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- fewer bugs like the one Joaquin found</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- better space efficiency</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- exception-safety guarantees are immediately full-filled (I
+ haven't looked, but I suspect that there are several bugs in this area)</em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Daniel</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Multi_index supports everything a bimap would, but its interface
- is more cumbersome. I for one won't use a W3DOM-like library if we get
- one, but I would happily use property_tree. I've also only used multi_index
- once, and that was to use it as a bidirectional map. Property_tree covers
- other areas as well as being a potential subset of an XML library, but
- I still hold there is value in such a subset. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Multi_index supports everything a bimap would, but its interface
+ is more cumbersome. I for one won't use a W3DOM-like library if we get
+ one, but I would happily use property_tree. I've also only used multi_index
+ once, and that was to use it as a bidirectional map. Property_tree covers
+ other areas as well as being a potential subset of an XML library, but
+ I still hold there is value in such a subset. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Boris</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I haven't used program_options yet. But if I understand correctly
- both libraries seem to support storing and accessing data with strings
- that might describe some kind of hierarchy. This seems to be the core
- idea of both libraries - is this correct? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Then it wouldn't matter much what container is used. However
- a generic tree which can store data hierarchically probably makes most
- sense. If I understand correctly both libraries could make use of such
- a class? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I haven't used program_options yet. But if I understand correctly
+ both libraries seem to support storing and accessing data with strings
+ that might describe some kind of hierarchy. This seems to be the core idea
+ of both libraries - is this correct? </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Then it wouldn't matter much what container is used. However
+ a generic tree which can store data hierarchically probably makes most
+ sense. If I understand correctly both libraries could make use of such
+ a class? </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Marcin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I think generic tree container is material for another library.
- Whether property_tree should be based on it or not is a matter of internal
- implementation, and generally of little interest to users. The biggest
- value of property_tree is in its easy to use interface, that should not
- be compromised, if at all possible. I have been already reassured in
- this view by quite many people who took their time to review the library.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I think generic tree container is material for another library.
+ Whether property_tree should be based on it or not is a matter of internal
+ implementation, and generally of little interest to users. The biggest
+ value of property_tree is in its easy to use interface, that should not
+ be compromised, if at all possible. I have been already reassured in this
+ view by quite many people who took their time to review the library. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Boris</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I was trying to see the big picture: I rather prefer a C++
- standard based on a few well-known concepts like containers, iterators,
- algorithms etc. instead of having a C++ standard with hundreds of components
- which are tailored for specific needs, collaborate with only a handful
- of other components and think they provide an easy-to-use interface while
- all the easy-to-use interfaces make the whole standard less easy-to-use.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> That said I have used your property tree library myself to
- read and write a configuration file. It was indeed very easy to use.
- However it would have been even easier if it was something I had known
- before like eg. an iterator. For now I will definitely use your property
- tree library but would appreciate if existing concepts were reused many
- C++ developers are familiar with. My opinion is that your library should
- be a part of Boost but should be more generalized in the future. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I was trying to see the big picture: I rather prefer a C++ standard
+ based on a few well-known concepts like containers, iterators, algorithms
+ etc. instead of having a C++ standard with hundreds of components which
+ are tailored for specific needs, collaborate with only a handful of other
+ components and think they provide an easy-to-use interface while all the
+ easy-to-use interfaces make the whole standard less easy-to-use. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> That said I have used your property tree library myself to read
+ and write a configuration file. It was indeed very easy to use. However
+ it would have been even easier if it was something I had known before like
+ eg. an iterator. For now I will definitely use your property tree library
+ but would appreciate if existing concepts were reused many C++ developers
+ are familiar with. My opinion is that your library should be a part of
+ Boost but should be more generalized in the future. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Thorsten</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Well, I think we need both. Boost.MultiIndex is a great library
- and can do all kinds of wonderful things. But I would still like to see
- a bidirectional map (boost::bimap) written as a wrapper around it to
- get an easy and specialized interface. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Well, I think we need both. Boost.MultiIndex is a great library
+ and can do all kinds of wonderful things. But I would still like to see
+ a bidirectional map (boost::bimap) written as a wrapper around it to get
+ an easy and specialized interface. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Pavel</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Bimap is available in libs/multi-index/examples/bimap.cpp.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Bimap is available in libs/multi-index/examples/bimap.cpp.
+ </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Thorsten</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Right, but the real value comes when somebody designs a nice
- STL-like interface and write docs etc, at least that was my point. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Right, but the real value comes when somebody designs a nice
+ STL-like interface and write docs etc, at least that was my point. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Dave</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> IMO Thorsten is exactly right. This is precisely the sort
- of thing that could be added to the library as part of its ongoing maintenance
- and development (without review, of course). </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> IMO Thorsten is exactly right. This is precisely the sort of
+ thing that could be added to the library as part of its ongoing maintenance
+ and development (without review, of course). </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Thorsten, we have talked about this privately in the past,
- but I feel like bringing it to the list in the hope of getting the attention
- of potential contributors: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> There are some data structures buildable with B.MI which are
- regarded as particularly useful or common, like for instance the bidirectional
- map or bimap. A lean and mean implementation is provided in the aforementioned
- example, but certainly a much carefully crafted interface can be provided
- keeping B.MI as the implementation core: operator[], selection of 1-1/1-N/N-1/N-N
- variants, hashing/ordering, etc. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I'm afraid I don't have the time to pursue this, as the current
- roadmap for core features of B.MI is taking all the spare time I can
- dedicate to the library. For this reason, I would love to see some volunteer
- jumping in who can develop this and other singular containers using B.MI
- (a cache container comes to mind) and then propose the results here either
- as a stand alone library of as part of B.MI --I'd prefer the former so
- as to keep the size of B.MI bounded. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> If there's such a volunteer I can provide her with some help/mentoring.
- I also wonder whether this is a task suitable to be proposed for Google
- Summer of Code. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Thorsten, we have talked about this privately in the past, but
+ I feel like bringing it to the list in the hope of getting the attention
+ of potential contributors: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> There are some data structures buildable with B.MI which are
+ regarded as particularly useful or common, like for instance the bidirectional
+ map or bimap. A lean and mean implementation is provided in the aforementioned
+ example, but certainly a much carefully crafted interface can be provided
+ keeping B.MI as the implementation core: operator[], selection of 1-1/1-N/N-1/N-N
+ variants, hashing/ordering, etc. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I'm afraid I don't have the time to pursue this, as the current
+ roadmap for core features of B.MI is taking all the spare time I can dedicate
+ to the library. For this reason, I would love to see some volunteer jumping
+ in who can develop this and other singular containers using B.MI (a cache
+ container comes to mind) and then propose the results here either as a
+ stand alone library of as part of B.MI --I'd prefer the former so as to
+ keep the size of B.MI bounded. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> If there's such a volunteer I can provide her with some help/mentoring.
+ I also wonder whether this is a task suitable to be proposed for Google
+ Summer of Code. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Thorsten</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I think it would be good for SOC. All the really hard things
- are taken care of by B.MI, and so it seems reasonable for a student to
- be able to fill in the details. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I think it would be good for SOC. All the really hard things
+ are taken care of by B.MI, and so it seems reasonable for a student to
+ be able to fill in the details. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Dave</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Great! </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Great! </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Jeff</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Please write a proposal! </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Please write a proposal! </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I've just done so: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I've just done so: </em></span>
+ </p></blockquote></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -663,40 +449,22 @@
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I am planning to submit an application to SoC. I will love
- to make real the specialized containers you mention and try to include
- some useful others. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <code class="literal"> And then... after long hours of coding (and fun) this library
- saw the light. </code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="inlinemediaobject"><img src="../../images/bimap/boost.bimap.logo.png" alt="boost.bimap.logo"></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I am planning to submit an application to SoC. I will love to
+ make real the specialized containers you mention and try to include some
+ useful others. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <code class="literal"> And then... after long hours of coding (and fun) this library
+ saw the light. </code>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="inlinemediaobject"><img src="../../images/bimap/boost.bimap.logo.png" alt="boost.bimap.logo"></span>
+ </p></blockquote></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -704,7 +472,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../history.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../history.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../history.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../acknowledgements.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/introduction.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/introduction.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/introduction.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,33 +1,33 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="prev" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="prev" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="next" href="one_minute_tutorial.html" title="One minute tutorial">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Introduction">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
</h2></div></div></div>
<a name="boost_bimap.introduction.how_to_use_this_document"></a><h4>
-<a name="id554159"></a>
+<a name="id759905"></a>
<a class="link" href="introduction.html#boost_bimap.introduction.how_to_use_this_document">How to use
this document</a>
</h4>
@@ -39,43 +39,40 @@
<div class="variablelist">
<p class="title"><b></b></p>
<dl>
-<dt><span class="term">I have to finished this today, I just want
- a bidirectional map!</span></dt>
+<dt><span class="term">I have to finished this today, I just want a bidirectional map!</span></dt>
<dd><p>
- If your boss will kill you if the project is not finished by the end of
- the day, just read the <a class="link" href="one_minute_tutorial.html" title="One minute tutorial">One-minute
- tutorial</a>. If you have a background in STL, you can be testing a
- bimap within ten minutes.
- </p></dd>
-<dt><span class="term">I am a serious programmer and want to learn
- Boost.Bimap</span></dt>
+ If your boss will kill you if the project is not finished by the end
+ of the day, just read the <a class="link" href="one_minute_tutorial.html" title="One minute tutorial">One-minute
+ tutorial</a>. If you have a background in STL, you can be testing
+ a bimap within ten minutes.
+ </p></dd>
+<dt><span class="term">I am a serious programmer and want to learn Boost.Bimap</span></dt>
<dd><p>
- Boost.Bimap has a lot to offer if you are prepared to spend some time reading
- this documentation. You will need to read <a class="link" href="the_tutorial.html" title="The tutorial">The
- tutorial</a> and skim through some of the <a class="link" href="examples.html" title="Examples">Examples</a>.
- The best way to read this documentation is in the order given here. Just
- click on the arrow at the right bottom corner as you finish each page.
- You may skip the reference section, and return to it later to look up a
- function signature or to find a specific metafunction.
- </p></dd>
-<dt><span class="term">I just love C++, I want to see the inner
- workings of Boost.Bimap.</span></dt>
+ Boost.Bimap has a lot to offer if you are prepared to spend some time
+ reading this documentation. You will need to read <a class="link" href="the_tutorial.html" title="The tutorial">The
+ tutorial</a> and skim through some of the <a class="link" href="examples.html" title="Examples">Examples</a>.
+ The best way to read this documentation is in the order given here. Just
+ click on the arrow at the right bottom corner as you finish each page.
+ You may skip the reference section, and return to it later to look up
+ a function signature or to find a specific metafunction.
+ </p></dd>
+<dt><span class="term">I just love C++, I want to see the inner workings of Boost.Bimap.</span></dt>
<dd><p>
- If you are a library developer, this documentation is the best place to
- learn how Boost.Bimap is implemented. It is strongly recommended that you
- first learn to use the library as if you were the second type of programmer
- above. This library was developed in the Google SoC 2006, and the mentor
- and student generated a great deal of documentation in the building process.
- The rationale section is very large and contains a lot of information.
- There is a history section for those who might find it useful. Finally,
- in the reference section, each entity of the library is documented and
- its source code is presented.
- </p></dd>
+ If you are a library developer, this documentation is the best place
+ to learn how Boost.Bimap is implemented. It is strongly recommended that
+ you first learn to use the library as if you were the second type of
+ programmer above. This library was developed in the Google SoC 2006,
+ and the mentor and student generated a great deal of documentation in
+ the building process. The rationale section is very large and contains
+ a lot of information. There is a history section for those who might
+ find it useful. Finally, in the reference section, each entity of the
+ library is documented and its source code is presented.
+ </p></dd>
</dl>
</div>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -88,9 +85,9 @@
and enjoy!
</p></td></tr>
</table></div>
-<div class="important" title="Important"><table border="0" summary="Important">
+<div class="important"><table border="0" summary="Important">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/html/images/important.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Important]" src="../../../../../doc/src/images/important.png"></td>
<th align="left">Important</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -102,7 +99,7 @@
</p></td></tr>
</table></div>
<a name="boost_bimap.introduction.navigation"></a><h4>
-<a name="id554302"></a>
+<a name="id760051"></a>
<a class="link" href="introduction.html#boost_bimap.introduction.navigation">Navigation</a>
</h4>
<p>
@@ -111,72 +108,78 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>General</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>General</strong></span>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
-<code class="literal"><span class="bold"><strong>p</strong></span></code> - Previous page
- </li>
+ <code class="literal"><span class="bold"><strong>p</strong></span></code> - Previous
+ page
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>n</strong></span></code> - Next page
- </li>
+ <code class="literal"><span class="bold"><strong>n</strong></span></code> - Next page
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>h</strong></span></code> - home
- </li>
+ <code class="literal"><span class="bold"><strong>h</strong></span></code> - home
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>u</strong></span></code> - Up
- </li>
+ <code class="literal"><span class="bold"><strong>u</strong></span></code> - Up
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Main TOC</strong></span><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>Main TOC</strong></span>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
-<code class="literal"><span class="bold"><strong>i</strong></span></code> - Introduction
- </li>
+ <code class="literal"><span class="bold"><strong>i</strong></span></code> - Introduction
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>o</strong></span></code> - One minute tutorial
- </li>
+ <code class="literal"><span class="bold"><strong>o</strong></span></code> - One minute
+ tutorial
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>t</strong></span></code> - The tutorial
- </li>
+ <code class="literal"><span class="bold"><strong>t</strong></span></code> - The tutorial
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>b</strong></span></code> - Bimap and Boost
- </li>
+ <code class="literal"><span class="bold"><strong>b</strong></span></code> - Bimap and
+ Boost
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>r</strong></span></code> - Reference
- </li>
+ <code class="literal"><span class="bold"><strong>r</strong></span></code> - Reference
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>c</strong></span></code> - Compiler specifics
- </li>
+ <code class="literal"><span class="bold"><strong>c</strong></span></code> - Compiler
+ specifics
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>v</strong></span></code> - Performance
- </li>
+ <code class="literal"><span class="bold"><strong>v</strong></span></code> - Performance
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>e</strong></span></code> - Examples
- </li>
+ <code class="literal"><span class="bold"><strong>e</strong></span></code> - Examples
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>s</strong></span></code> - Test Suite
- </li>
+ <code class="literal"><span class="bold"><strong>s</strong></span></code> - Test Suite
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>f</strong></span></code> - Future work
- </li>
+ <code class="literal"><span class="bold"><strong>f</strong></span></code> - Future work
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>m</strong></span></code> - Release notes
- </li>
+ <code class="literal"><span class="bold"><strong>m</strong></span></code> - Release notes
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>w</strong></span></code> - Rationale
- </li>
+ <code class="literal"><span class="bold"><strong>w</strong></span></code> - Rationale
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>y</strong></span></code> - History
- </li>
+ <code class="literal"><span class="bold"><strong>y</strong></span></code> - History
+ </li>
<li class="listitem">
-<code class="literal"><span class="bold"><strong>a</strong></span></code> - Acknowledgements
- </li>
+ <code class="literal"><span class="bold"><strong>a</strong></span></code> - Acknowledgements
+ </li>
</ul></div>
-</li>
+ </li>
</ul></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -184,7 +187,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/one_minute_tutorial.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>One minute tutorial</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="introduction.html" title="Introduction">
<link rel="next" href="the_tutorial.html" title="The tutorial">
</head>
@@ -13,21 +13,21 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="One minute tutorial">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.one_minute_tutorial"></a><a class="link" href="one_minute_tutorial.html" title="One minute tutorial">One minute tutorial</a>
</h2></div></div></div>
<a name="boost_bimap.one_minute_tutorial.what_is_a_bimap_"></a><h4>
-<a name="id554565"></a>
+<a name="id760382"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.what_is_a_bimap_">What is a
bimap?</a>
</h4>
@@ -51,20 +51,19 @@
</pre>
<p>
Given this code, the following is the complete description of the resulting
- bimap.
- <sup>[<a name="id554727" href="#ftn.id554727" class="footnote">1</a>]</sup>
+ bimap. <sup>[<a name="id760544" href="#ftn.id760544" class="footnote">1</a>]</sup>
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code> is signature-compatible with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">X</span><span class="special">,</span><span class="identifier">Y</span><span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code> is signature-compatible with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">X</span><span class="special">,</span><span class="identifier">Y</span><span class="special">></span></code>
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is signature-compatible with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">Y</span><span class="special">,</span><span class="identifier">X</span><span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is signature-compatible with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">Y</span><span class="special">,</span><span class="identifier">X</span><span class="special">></span></code>
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span></code> is signature-compatible
- with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span><span class="special"><</span> <span class="identifier">relation</span><span class="special"><</span><span class="identifier">X</span><span class="special">,</span><span class="identifier">Y</span><span class="special">></span> <span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span></code> is signature-compatible
+ with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span><span class="special"><</span> <span class="identifier">relation</span><span class="special"><</span><span class="identifier">X</span><span class="special">,</span><span class="identifier">Y</span><span class="special">></span> <span class="special">></span></code>
+ </li>
</ul></div>
<p>
<span class="inlinemediaobject"><img src="../images/bimap/simple.bimap.png" alt="simple.bimap"></span>
@@ -106,7 +105,7 @@
...
</pre>
<a name="boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap"></a><h4>
-<a name="id555399"></a>
+<a name="id761226"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.layout_of_the_relation_and_the_pairs_of_a_bimap">Layout
of the relation and the pairs of a bimap</a>
</h4>
@@ -120,7 +119,7 @@
<span class="inlinemediaobject"><img src="../images/bimap/relation.and.pair.png" alt="relation.and.pair"></span>
</p>
<a name="boost_bimap.one_minute_tutorial.step_by_step"></a><h4>
-<a name="id555466"></a>
+<a name="id761293"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.step_by_step">Step by step</a>
</h4>
<p>
@@ -132,19 +131,15 @@
Lets define a bidirectional map between integers and strings:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">bimap</span><span class="special"><</span> <span class="keyword">int</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="boost_bimap.one_minute_tutorial.the_collection_of_relations_view"></a><h4>
-<a name="id555616"></a>
+<a name="id761439"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_collection_of_relations_view">The
collection of relations view</a>
</h4>
@@ -154,9 +149,7 @@
using this view.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="string">"one"</span> <span class="special">)</span> <span class="special">);</span>
<span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">(</span><span class="number">2</span><span class="special">,</span> <span class="string">"two"</span> <span class="special">)</span> <span class="special">);</span>
@@ -173,11 +166,9 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="boost_bimap.one_minute_tutorial.the_left_map_view"></a><h4>
-<a name="id556065"></a>
+<a name="id761885"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_left_map_view">The left
map view</a>
</h4>
@@ -188,11 +179,9 @@
use a standard map.
</p>
<p>
- </p>
-<p>
-
+
</p>
-<pre class="programlisting"><span class="line_callout_bug"><a class="co" name="boost_bimap0co" href="one_minute_tutorial.html#boost_bimap0"><img src="../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span><span class="special">::</span><span class="identifier">const_iterator</span> <span class="identifier">left_const_iterator</span><span class="special">;</span>
+<pre class="programlisting"><a class="co" name="boost_bimap0co" href="one_minute_tutorial.html#boost_bimap0"><img src="../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span><span class="special">::</span><span class="identifier">const_iterator</span> <span class="identifier">left_const_iterator</span><span class="special">;</span>
<span class="keyword">for</span><span class="special">(</span> <span class="identifier">left_const_iterator</span> <span class="identifier">left_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">iend</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span>
<span class="identifier">left_iter</span> <span class="special">!=</span> <span class="identifier">iend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">left_iter</span> <span class="special">)</span>
@@ -203,41 +192,38 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">first</span> <span class="special"><<</span> <span class="string">" --> "</span> <span class="special"><<</span> <span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">second</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span>
-<span class="line_callout_bug"><a class="co" name="boost_bimap1co" href="one_minute_tutorial.html#boost_bimap1"><img src="../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a></span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_const_iterator</span> <span class="identifier">left_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="number">2</span><span class="special">);</span>
+<a class="co" name="boost_bimap1co" href="one_minute_tutorial.html#boost_bimap1"><img src="../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_const_iterator</span> <span class="identifier">left_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="number">2</span><span class="special">);</span>
<span class="identifier">assert</span><span class="special">(</span> <span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">second</span> <span class="special">==</span> <span class="string">"two"</span> <span class="special">);</span>
-<span class="line_callout_bug"><a class="co" name="boost_bimap2co" href="one_minute_tutorial.html#boost_bimap2"><img src="../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a></span><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_value_type</span><span class="special">(</span> <span class="number">3</span><span class="special">,</span> <span class="string">"three"</span> <span class="special">)</span> <span class="special">);</span>
+<a class="co" name="boost_bimap2co" href="one_minute_tutorial.html#boost_bimap2"><img src="../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_value_type</span><span class="special">(</span> <span class="number">3</span><span class="special">,</span> <span class="string">"three"</span> <span class="special">)</span> <span class="special">);</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap0"></a>
</p></td>
<td valign="top" align="left"><p> The type of <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code> is <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span></code>
- and the type of <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_map</span></code>
- </p></td>
+ and the type of <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_map</span></code>
+ </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap1"></a>
</p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_</span></code>-type- can be used as a shortcut for
- the more verbose <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span><span class="special">::</span></code>-type- </p></td>
+ the more verbose <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span><span class="special">::</span></code>-type-
+ </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap2"></a>
</p></td>
-<td valign="top" align="left"><p> This line produces the same effect
- of <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">(</span><span class="number">3</span><span class="special">,</span><span class="string">"three"</span><span class="special">)</span> <span class="special">);</span></code> </p></td>
+<td valign="top" align="left"><p> This line produces the same effect of <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span>
+ <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">(</span><span class="number">3</span><span class="special">,</span><span class="string">"three"</span><span class="special">)</span> <span class="special">);</span></code> </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
<a name="boost_bimap.one_minute_tutorial.the_right_map_view"></a><h4>
-<a name="id556790"></a>
+<a name="id762598"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.the_right_map_view">The right
map view</a>
</h4>
@@ -248,9 +234,7 @@
one, exactly as with standard maps.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_const_iterator</span> <span class="identifier">right_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">find</span><span class="special">(</span><span class="string">"two"</span><span class="special">);</span>
@@ -263,25 +247,21 @@
<span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="string">"two"</span><span class="special">);</span>
-<span class="line_callout_bug"><a class="co" name="boost_bimap3co" href="one_minute_tutorial.html#boost_bimap3"><img src="../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_value_type</span><span class="special">(</span> <span class="string">"four"</span><span class="special">,</span> <span class="number">4</span> <span class="special">)</span> <span class="special">);</span>
+<a class="co" name="boost_bimap3co" href="one_minute_tutorial.html#boost_bimap3"><img src="../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_value_type</span><span class="special">(</span> <span class="string">"four"</span><span class="special">,</span> <span class="number">4</span> <span class="special">)</span> <span class="special">);</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap3"></a> </p></td>
-<td valign="top" align="left"><p> This line produces the same effect of <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">(</span><span class="number">4</span><span class="special">,</span><span class="string">"four"</span><span class="special">)</span>
- <span class="special">);</span></code> </p></td>
+<td valign="top" align="left"><p> This line produces the same effect of <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span>
+ <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">value_type</span><span class="special">(</span><span class="number">4</span><span class="special">,</span><span class="string">"four"</span><span class="special">)</span> <span class="special">);</span></code> </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
<a name="boost_bimap.one_minute_tutorial.differences_with_std__map"></a><h4>
-<a name="id557230"></a>
+<a name="id763032"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.differences_with_std__map">Differences
with std::map</a>
</h4>
@@ -312,7 +292,7 @@
<span class="identifier">assert</span><span class="special">(</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">==</span> <span class="number">1</span> <span class="special">);</span>
</pre>
<a name="boost_bimap.one_minute_tutorial.a_simple_example"></a><h4>
-<a name="id557889"></a>
+<a name="id763691"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.a_simple_example">A simple example</a>
</h4>
<p>
@@ -323,9 +303,7 @@
<a href="../../../example/simple_bimap.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">string</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
@@ -385,8 +363,6 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The output of this program will be the following:
@@ -408,7 +384,7 @@
<code class="literal">Spain ends in position 2</code>
</pre>
<a name="boost_bimap.one_minute_tutorial.continuing_the_journey"></a><h4>
-<a name="id559435"></a>
+<a name="id764963"></a>
<a class="link" href="one_minute_tutorial.html#boost_bimap.one_minute_tutorial.continuing_the_journey">Continuing
the journey</a>
</h4>
@@ -417,9 +393,9 @@
or read the <a class="link" href="reference.html" title="Reference">reference</a> section
of this documentation.
</p>
-<div class="caution" title="Caution"><table border="0" summary="Caution">
+<div class="caution"><table border="0" summary="Caution">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../doc/html/images/caution.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Caution]" src="../../../../../doc/src/images/caution.png"></td>
<th align="left">Caution</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -434,16 +410,16 @@
</table></div>
<div class="footnotes">
<br><hr width="100" align="left">
-<div class="footnote"><p><sup>[<a name="ftn.id554727" href="#id554727" class="para">1</a>] </sup>
- A type is <span class="emphasis"><em>signature-compatible</em></span> with other type if
- it has the same signature for functions and metadata. Preconditions, postconditions
- and the order of operations need not be the same.
- </p></div>
+<div class="footnote"><p><sup>[<a name="ftn.id760544" href="#id760544" class="para">1</a>] </sup>
+ A type is <span class="emphasis"><em>signature-compatible</em></span> with other type if it
+ has the same signature for functions and metadata. Preconditions, postconditions
+ and the order of operations need not be the same.
+ </p></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -451,7 +427,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/performance.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/performance.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/performance.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Performance</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="compiler_specifics.html" title="Compiler specifics">
<link rel="next" href="examples.html" title="Examples">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Performance">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.performance"></a><a class="link" href="performance.html" title="Performance">Performance</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -40,7 +40,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="compiler_specifics.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="examples.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Rationale</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="release_notes.html" title="Release notes">
<link rel="next" href="rationale/additional_features.html" title="Additional Features">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="release_notes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/additional_features.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="release_notes.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/additional_features.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Rationale">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.rationale"></a><a class="link" href="rationale.html" title="Rationale">Rationale</a>
</h2></div></div></div>
@@ -46,9 +46,9 @@
of email flowed between Joaquin and Matias. The juiciest parts of the conversations
where extracted and rearranged here.
</p>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -57,7 +57,7 @@
at developers.
</p></td></tr>
</table></div>
-<div class="section" title="General Design">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.rationale.general_design"></a><a class="link" href="rationale.html#boost_bimap.rationale.general_design" title="General Design">General Design</a>
</h3></div></div></div>
@@ -133,17 +133,17 @@
</p>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code> is signature-compatible with a
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code> is signature-compatible with a
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is signature-compatible with a
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is signature-compatible with
+ a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span></code> is signature-compatible
- with a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span><span class="special"><</span><span class="identifier">relation</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span> <span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span></code> is signature-compatible
+ with a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">set</span><span class="special"><</span><span class="identifier">relation</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span> <span class="special">></span></code>
+ </li>
</ol></div>
<p>
<span class="inlinemediaobject"><img src="../images/bimap/simple.bimap.png" alt="simple.bimap"></span>
@@ -153,7 +153,7 @@
as being simple and powerful. This is the general design.
</p>
<a name="boost_bimap.rationale.general_design.relation_implementation"></a><h5>
-<a name="id666407"></a>
+<a name="id874221"></a>
<a class="link" href="rationale.html#boost_bimap.rationale.general_design.relation_implementation">Relation
Implementation</a>
</h5>
@@ -242,9 +242,9 @@
both cases, because we require that the same code be compilable by any standards-compliant
compiler.
</p>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -254,7 +254,7 @@
</p></td></tr>
</table></div>
<a name="boost_bimap.rationale.general_design.bimap_implementation"></a><h5>
-<a name="id666981"></a>
+<a name="id874795"></a>
<a class="link" href="rationale.html#boost_bimap.rationale.general_design.bimap_implementation">Bimap
Implementation</a>
</h5>
@@ -284,7 +284,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -292,7 +292,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="release_notes.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/additional_features.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="release_notes.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale/additional_features.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale/additional_features.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Additional Features</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../rationale.html" title="Rationale">
<link rel="prev" href="../rationale.html" title="Rationale">
<link rel="next" href="code.html" title="Code">
@@ -13,22 +13,22 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Additional Features">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.rationale.additional_features"></a><a class="link" href="additional_features.html" title="Additional Features">Additional
Features</a>
</h3></div></div></div>
<a name="boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps"></a><h5>
-<a name="id667261"></a>
+<a name="id875074"></a>
<a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.n_1__n_n__hashed_maps">N-1,
N-N, hashed maps</a>
</h5>
@@ -42,13 +42,13 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- The index types of the <code class="computeroutput"><span class="identifier">multi_index_container</span></code>
- core now depends on the collection type used for each key.
- </li>
-<li class="listitem">
- The map views now change their semantics according to the collection type
- chosen.
- </li>
+ The index types of the <code class="computeroutput"><span class="identifier">multi_index_container</span></code>
+ core now depends on the collection type used for each key.
+ </li>
+<li class="listitem">
+ The map views now change their semantics according to the collection
+ type chosen.
+ </li>
</ul></div>
<p>
Boost.Bimap relies heavily on Boost.MPL to implement all of the metaprogramming
@@ -60,7 +60,7 @@
<span class="inlinemediaobject"><img src="../../images/bimap/bimap.structures.png" alt="bimap.structures"></span>
</p>
<a name="boost_bimap.rationale.additional_features.collection_type_of_relation_constraints"></a><h5>
-<a name="id667368"></a>
+<a name="id875189"></a>
<a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.collection_type_of_relation_constraints">Collection
type of relation constraints</a>
</h5>
@@ -74,29 +74,29 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- left_based
- </li>
+ left_based
+ </li>
<li class="listitem">
- right_based
- </li>
+ right_based
+ </li>
<li class="listitem">
- set_of_relation<>
- </li>
+ set_of_relation<>
+ </li>
<li class="listitem">
- multiset_of_relation<>
- </li>
+ multiset_of_relation<>
+ </li>
<li class="listitem">
- unordered_set_of_relation<>
- </li>
+ unordered_set_of_relation<>
+ </li>
<li class="listitem">
- unordered_multiset_of_relation<>
- </li>
+ unordered_multiset_of_relation<>
+ </li>
<li class="listitem">
- list_of
- </li>
+ list_of
+ </li>
<li class="listitem">
- vector_of
- </li>
+ vector_of
+ </li>
</ul></div>
<p>
In the first two cases, there are only two indices in the <code class="computeroutput"><span class="identifier">multi_index_core</span></code>,
@@ -104,7 +104,7 @@
uses further metaprogramming to define a new index if necessary.
</p>
<a name="boost_bimap.rationale.additional_features.tagged"></a><h5>
-<a name="id667455"></a>
+<a name="id875302"></a>
<a class="link" href="additional_features.html#boost_bimap.rationale.additional_features.tagged">Tagged</a>
</h5>
<p>
@@ -125,7 +125,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -133,7 +133,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../rationale.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="code.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale/code.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Code</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../rationale.html" title="Rationale">
<link rel="prev" href="additional_features.html" title="Additional Features">
<link rel="next" href="the_student_and_the_mentor.html" title="The student and the mentor">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Code">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.rationale.code"></a><a class="link" href="code.html" title="Code">Code</a>
</h3></div></div></div>
@@ -34,7 +34,7 @@
Library Requirement and Guidelines</a> as closely as possible.
</p>
<div class="table">
-<a name="id667570"></a><p class="title"><b>Table 1.10. folders in boost/bimap</b></p>
+<a name="id875417"></a><p class="title"><b>Table 1.10. folders in boost/bimap</b></p>
<div class="table-contents"><table class="table" summary="folders in boost/bimap">
<colgroup>
<col>
@@ -42,90 +42,90 @@
</colgroup>
<thead><tr>
<th>
- <p>
- name
- </p>
- </th>
+ <p>
+ name
+ </p>
+ </th>
<th>
- <p>
- what is inside?
- </p>
- </th>
+ <p>
+ what is inside?
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- user level header files
- </p>
- </td>
-<td class="auto-generated"> </td>
+ <p>
+ user level header files
+ </p>
+ </td>
+<td class="auto-generated"> </td>
</tr>
<tr>
<td>
- <p>
- tagged/
- </p>
- </td>
+ <p>
+ tagged/
+ </p>
+ </td>
<td>
- <p>
- tagged idiom
- </p>
- </td>
+ <p>
+ tagged idiom
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- relation/
- </p>
- </td>
+ <p>
+ relation/
+ </p>
+ </td>
<td>
- <p>
- the bimap data
- </p>
- </td>
+ <p>
+ the bimap data
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- container_adaptor/
- </p>
- </td>
+ <p>
+ container_adaptor/
+ </p>
+ </td>
<td>
- <p>
- easy way of adapting containers
- </p>
- </td>
+ <p>
+ easy way of adapting containers
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- views/
- </p>
- </td>
+ <p>
+ views/
+ </p>
+ </td>
<td>
- <p>
- bimap views
- </p>
- </td>
+ <p>
+ bimap views
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- property_map/
- </p>
- </td>
+ <p>
+ property_map/
+ </p>
+ </td>
<td>
- <p>
- support for property map concept
- </p>
- </td>
+ <p>
+ support for property map concept
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
<br class="table-break"><div class="table">
-<a name="id667700"></a><p class="title"><b>Table 1.11. folders in each folder</b></p>
+<a name="id875556"></a><p class="title"><b>Table 1.11. folders in each folder</b></p>
<div class="table-contents"><table class="table" summary="folders in each folder">
<colgroup>
<col>
@@ -133,51 +133,49 @@
</colgroup>
<thead><tr>
<th>
- <p>
- name
- </p>
- </th>
+ <p>
+ name
+ </p>
+ </th>
<th>
- <p>
- what is inside?
- </p>
- </th>
+ <p>
+ what is inside?
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- </p>
- </td>
+ </td>
<td>
- <p>
- class definitions
- </p>
- </td>
+ <p>
+ class definitions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- support/
- </p>
- </td>
+ <p>
+ support/
+ </p>
+ </td>
<td>
- <p>
- optional metafunctions and free functions
- </p>
- </td>
+ <p>
+ optional metafunctions and free functions
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- detail/
- </p>
- </td>
+ <p>
+ detail/
+ </p>
+ </td>
<td>
- <p>
- things not intended for the user's eyes
- </p>
- </td>
+ <p>
+ things not intended for the user's eyes
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
@@ -186,7 +184,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -194,7 +192,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="additional_features.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_student_and_the_mentor.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html
Modified: branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html
Modified: branches/release/libs/bimap/doc/html/index.html
Modified: branches/release/libs/numeric/conversion/doc/Jamfile.v2
Modified: branches/release/libs/optional/doc/Jamfile.v2
Modified: branches/release/libs/property_map/doc/dynamic_property_map.html
Deleted: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_general_requirements.html
Deleted: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html
Deleted: branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html
Deleted: branches/release/libs/range/doc/html/range/reference/algorithms/non.html
Deleted: branches/release/libs/range/doc/html/range/reference/concept_implementation/overview.html
Deleted: branches/release/libs/range/doc/html/range/reference/range_algorithm.html
Deleted: branches/release/libs/range/doc/html/range/reference/ranges/introduction.html
Deleted: branches/release/libs/range/doc/html/range/reference/ranges/reference.html
Deleted: branches/release/libs/range/doc/html/range/reference/ranges/reference/counting_range.html
Deleted: branches/release/libs/range/doc/html/range/reference/ranges/reference/irange.html
Deleted: branches/release/libs/range/doc/html/range/reference/ranges/reference/istream_range.html
Deleted: branches/release/libs/range/doc/html/range/reference/semantics/functions.html
Deleted: branches/release/libs/range/doc/html/range/reference/semantics/metafunctions.html
Deleted: branches/release/libs/range/doc/html/range/reference/synopsis.html
Deleted: branches/release/libs/range/doc/html/range/upgrade/upgrade_1_34_to_1_35.html
Deleted: branches/release/libs/range/doc/html/range/utilities/iterator_range.html
Deleted: branches/release/libs/range/doc/html/range/utilities/join.html
Deleted: branches/release/libs/range/doc/html/range/utilities/sub_range.html
Modified: branches/release/libs/spirit/phoenix/doc/html/index.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/acknowledgement.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/actors.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/algorithm.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/basics.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/composite.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/container.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/inside_phoenix.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/introduction.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/organization.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/primitives.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/references.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/starter_kit.html
Modified: branches/release/libs/spirit/phoenix/doc/html/phoenix/wrap_up.html
Modified: branches/release/libs/spirit/repository/doc/html/index.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives/karma_confix_generator.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal/subrule.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/preface.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/confix.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/distinct.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal/subrule.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive.html
Modified: branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive/flush_multi_pass.html
Modified: branches/release/tools/boostbook/doc/boostbook.xml
Modified: branches/release/tools/quickbook/doc/quickbook.qbk
Modified: branches/release/tools/release/index.html
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/rationale/the_student_and_the_mentor.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The student and the mentor</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../rationale.html" title="Rationale">
<link rel="prev" href="code.html" title="Code">
<link rel="next" href="../history.html" title="History">
@@ -13,23 +13,23 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="code.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="code.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="The student and the mentor">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.rationale.the_student_and_the_mentor"></a><a class="link" href="the_student_and_the_mentor.html" title="The student and the mentor">The
student and the mentor</a>
</h3></div></div></div>
-<div class="tip" title="Tip"><table border="0" summary="Tip">
+<div class="tip"><table border="0" summary="Tip">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/html/images/tip.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/src/images/tip.png"></td>
<th align="left">Tip</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -37,345 +37,197 @@
SoC proposal</a> first.
</p></td></tr>
</table></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <code class="literal">- The discussion starts with Joaquin trying to strip out the
- "misc" name out of the library -</code>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <code class="literal">- The discussion starts with Joaquin trying to strip out the "misc"
+ name out of the library -</code>
+ </p></blockquote></div>
<p>
<span class="inlinemediaobject"><img src="../../images/people/joaquin.png" alt="joaquin"></span>
</p>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Thinking about it, the unifying principle of MISC containers
- is perhaps misleading: certainly all miscs use multi-indexing internally,
- but this does not reflect much in the external interface (as it should
- be, OTOH). So, from the user's point of view, miscs are entirely heterogeneous
- beasts. Moreover, there isn't in your proposal any kind of global facility
- common to all miscs. What about dropping the misc principle and working
- on each container as a separate library, then? You'd have boost::bimap,
- boost::mru, etc, and no common intro to them. This also opens up the
- possibility to add other containers to the suite which aren't based on
- B.MI. What's your stance on this? Do you see a value in keeping miscs
- conceptually together? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Thinking about it, the unifying principle of MISC containers
+ is perhaps misleading: certainly all miscs use multi-indexing internally,
+ but this does not reflect much in the external interface (as it should
+ be, OTOH). So, from the user's point of view, miscs are entirely heterogeneous
+ beasts. Moreover, there isn't in your proposal any kind of global facility
+ common to all miscs. What about dropping the misc principle and working
+ on each container as a separate library, then? You'd have boost::bimap,
+ boost::mru, etc, and no common intro to them. This also opens up the possibility
+ to add other containers to the suite which aren't based on B.MI. What's
+ your stance on this? Do you see a value in keeping miscs conceptually together?
+ </em></span>
+ </p></blockquote></div>
<p>
<span class="inlinemediaobject"><img src="../../images/people/matias.png" alt="matias"></span>
</p>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> As the original proposal states only two containers (bimap
- and mru set) both based in B.MI, it was straight forward to group them
- together. When I was writing the SoC proposal I experienced a similar
- feeling when the two families begin to grow. As you say, the only common
- denominator is their internal implementation. I thought a bit about a
- more general framework to join this two families (and other internally
- related ones) and finally came up with an idea: Boost.MultiIndex! So
- I think that it is not a good idea to try to unify the two families and
- I voted in favor of get rid of the misc part of boost::misc::bimap and
- boost::misc::mru. Anyway, for my SoC application it seems OK to put the
- two families in the same project because although from the outside they
- are completely unrelated, the work I will have to do in order to build
- the libraries will be consistent and what I will learn coding the bimap
- family will be used when I start to code the mru family. When the mru
- family is in place, I will surely have learnt other things to improve
- the bimap group. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> On the other hand, I think it will be useful for the general
- user to have at least some document linked in the B.MI documentation
- that enumerates the most common cases of uses (a bimap and an mru set
- for example) and points where to find clean implementation for this useful
- containers. For now, a link to boost::bimap and other one to boost::mru
- will suffice. If you think about the title of such a document, you will
- probably come up with something like: Common Multi Index Specialized
- Containers, and we are back to our misc proposal. So, to order some ideas:
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- A new family of containers that can be accessed by both key
- will be created. (boost::bimap)</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- A new family of time aware containers will see the light.
- (boost::mru)</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- A page can be added to B.MI documentation, titled misc that
- links this new libraries.</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> This is a clearer framework for the user. They can use a mru
- container without hearing about Boost.MultiIndex at all. And B.MI users
- will get some of their common containers already implemented with an
- STL friendly interface in other libraries. And as you stated this is
- more extensible because opens the door to use other libraries in bimap
- and mru families than just Boost.MultiIndex without compromising the
- more general boost framework. The word "misc" it is going to
- disappear from the code and the documentation of bimap and mru. From
- now on the only use for it will be to identify our SoC project. I am
- thinking in a name for the bimap library. What about Boost.BidirectionalMap?
- Ideas? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Yes, Boost.Bimap. In my opinion, bimap is a well known name
- in the Boost and even in the C++ community. It sounds and is short. Why
- not to vindicate yourself as the owner of this name? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <code class="literal">- Then after a week of work -</code>
- </p>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Now that Boost.Bimap is getting some shape, I see that as
- you have told me, we must offer a "one_to_many_map" and a "multi_bimap"
- as part of the library. The framework I am actually working allowed to
- construct this kind of bidirectional maps and it is easy to understand
- from the user side. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> As the original proposal states only two containers (bimap and
+ mru set) both based in B.MI, it was straight forward to group them together.
+ When I was writing the SoC proposal I experienced a similar feeling when
+ the two families begin to grow. As you say, the only common denominator
+ is their internal implementation. I thought a bit about a more general
+ framework to join this two families (and other internally related ones)
+ and finally came up with an idea: Boost.MultiIndex! So I think that it
+ is not a good idea to try to unify the two families and I voted in favor
+ of get rid of the misc part of boost::misc::bimap and boost::misc::mru.
+ Anyway, for my SoC application it seems OK to put the two families in the
+ same project because although from the outside they are completely unrelated,
+ the work I will have to do in order to build the libraries will be consistent
+ and what I will learn coding the bimap family will be used when I start
+ to code the mru family. When the mru family is in place, I will surely
+ have learnt other things to improve the bimap group. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> On the other hand, I think it will be useful for the general
+ user to have at least some document linked in the B.MI documentation that
+ enumerates the most common cases of uses (a bimap and an mru set for example)
+ and points where to find clean implementation for this useful containers.
+ For now, a link to boost::bimap and other one to boost::mru will suffice.
+ If you think about the title of such a document, you will probably come
+ up with something like: Common Multi Index Specialized Containers, and
+ we are back to our misc proposal. So, to order some ideas: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- A new family of containers that can be accessed by both key
+ will be created. (boost::bimap)</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- A new family of time aware containers will see the light. (boost::mru)</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- A page can be added to B.MI documentation, titled misc that
+ links this new libraries.</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> This is a clearer framework for the user. They can use a mru
+ container without hearing about Boost.MultiIndex at all. And B.MI users
+ will get some of their common containers already implemented with an STL
+ friendly interface in other libraries. And as you stated this is more extensible
+ because opens the door to use other libraries in bimap and mru families
+ than just Boost.MultiIndex without compromising the more general boost
+ framework. The word "misc" it is going to disappear from the
+ code and the documentation of bimap and mru. From now on the only use for
+ it will be to identify our SoC project. I am thinking in a name for the
+ bimap library. What about Boost.BidirectionalMap? Ideas? </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> OK, I am glad we agree on this point. </em></span>
- </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Yes, Boost.Bimap. In my opinion, bimap is a well known name
+ in the Boost and even in the C++ community. It sounds and is short. Why
+ not to vindicate yourself as the owner of this name? </em></span>
+ </p></blockquote></div>
<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> With respect to the symmetry of the key access names, I have
- to agree that there is not much a difference between the following ones:
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- to - from</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- to - b</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- 0 - 1</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- left - right</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> In my opinion it is a matter of taste, but left/right sounds
- more symmetrical than the others. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I like very much the left/right notation, it is very simple
- to remember and it is a lot more symmetrical than to/from. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
+ <code class="literal">- Then after a week of work -</code>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> At first my idea was to obtain ease of use hiding the B.MI
- core, making it more STL-intuitive. Nevertheless I have realized that
- B.MI is a lot more coherent and easy to use that I had imagined. This
- makes me think again in the problem. In the design that I am coding now,
- bimap <span class="bold"><strong>is-a</strong></span> multi_index_container specializes
- with a data type very comfortable called bipair, that can be seen like
- any of the two maps that integrates it using map views. This scheme has
- great benefits for users: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - If the user already knows B.MI, he can take advantage of
- the tools that it provides and that are not present in the STL containers.
- In addition, in some cases the use to indices to see the data can be
- very useful. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - If the user does not know anything about B.MI but have an
- STL framework, the learning curve is reduced to understand the bimap
- instantiation and how a is obtained the desired map view. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Another very important benefit holds: All the algorithms done
- for B.MI continues to work with Boost.Bimap and if B.MI continues growing,
- bimap grow automatically. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Umm... This is an interesting design decision, but controversial
- in my opinion. Basically you decide to expose the implementation of bimap;
- that has advantages, as you stated, but also a nonsmall disadvantage:
- once <span class="bold"><strong>you have documented</strong></span> the implementation,
- it is not possible to change it anymore. It is a marriage with B.MI without
- the chance of divorce. The other possibility, to hide the implementation
- and to duplicate and document the provided functionality, explicitly
- or implicitly due to the same characteristics of the implementation,
- is of course heavier to maintain, but it gives a degree of freedom to
- change the guts of your software if you need to. Do not take this like
- a frontal objection, but I think that it is quite important design decision,
- not only in the context of bimap but in general. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> You are quite right here. I think we have to choose the hardest
- path and hide the B.MI core from the user. I am sending you the first
- draft of bimap along with some documentation. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Now that Boost.Bimap is getting some shape, I see that as you
+ have told me, we must offer a "one_to_many_map" and a "multi_bimap"
+ as part of the library. The framework I am actually working allowed to
+ construct this kind of bidirectional maps and it is easy to understand
+ from the user side. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> OK, I am glad we agree on this point. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> With respect to the symmetry of the key access names, I have
+ to agree that there is not much a difference between the following ones:
+ </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- to - from</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- to - b</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- 0 - 1</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- left - right</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> In my opinion it is a matter of taste, but left/right sounds
+ more symmetrical than the others. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I like very much the left/right notation, it is very simple
+ to remember and it is a lot more symmetrical than to/from. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> At first my idea was to obtain ease of use hiding the B.MI core,
+ making it more STL-intuitive. Nevertheless I have realized that B.MI is
+ a lot more coherent and easy to use that I had imagined. This makes me
+ think again in the problem. In the design that I am coding now, bimap
+ <span class="bold"><strong>is-a</strong></span> multi_index_container specializes
+ with a data type very comfortable called bipair, that can be seen like
+ any of the two maps that integrates it using map views. This scheme has
+ great benefits for users: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - If the user already knows B.MI, he can take advantage of the
+ tools that it provides and that are not present in the STL containers.
+ In addition, in some cases the use to indices to see the data can be very
+ useful. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - If the user does not know anything about B.MI but have an
+ STL framework, the learning curve is reduced to understand the bimap instantiation
+ and how a is obtained the desired map view. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Another very important benefit holds: All the algorithms done
+ for B.MI continues to work with Boost.Bimap and if B.MI continues growing,
+ bimap grow automatically. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Umm... This is an interesting design decision, but controversial
+ in my opinion. Basically you decide to expose the implementation of bimap;
+ that has advantages, as you stated, but also a nonsmall disadvantage: once
+ <span class="bold"><strong>you have documented</strong></span> the implementation,
+ it is not possible to change it anymore. It is a marriage with B.MI without
+ the chance of divorce. The other possibility, to hide the implementation
+ and to duplicate and document the provided functionality, explicitly or
+ implicitly due to the same characteristics of the implementation, is of
+ course heavier to maintain, but it gives a degree of freedom to change
+ the guts of your software if you need to. Do not take this like a frontal
+ objection, but I think that it is quite important design decision, not
+ only in the context of bimap but in general. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> You are quite right here. I think we have to choose the hardest
+ path and hide the B.MI core from the user. I am sending you the first draft
+ of bimap along with some documentation. </em></span>
+ </p></blockquote></div>
<p>
<code class="literal">- This completes the second week, the documentation was basically
the first section of this rationale -</code>
@@ -383,371 +235,195 @@
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I must confess that I am beginning to like what I see. I am
- mathematical by vocation, and when I see symmetry in a formulation I
- believe that it is in the right track. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I must confess that I am beginning to like what I see. I am
+ mathematical by vocation, and when I see symmetry in a formulation I believe
+ that it is in the right track. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> We are two mathematicians by vocation then. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> We are two mathematicians by vocation then. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I think that the part of std::set theory is very clear. To
- me, it turns out to me somewhat strange to consider the rank of a map
- (values X) like a std::set, but of course the formulation is consistent.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I think that the part of std::set theory is very clear. To me,
+ it turns out to me somewhat strange to consider the rank of a map (values
+ X) like a std::set, but of course the formulation is consistent. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I like it very much, it can be a little odd at first, but
- now that I have get used to it, it is very easy to express in the code
- my contrains on the data, and I believe that if somebody reads the code
- and sees the bimap instantiation he is not going to have problems understanding
- it. Perhaps it is easier to understand it if we use your notation: ordered_nonunique,
- unordered_unique, but this goes against our STL facade. In my opinion
- the user that comes from STL must have to learn as less as possible.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I like it very much, it can be a little odd at first, but now
+ that I have get used to it, it is very easy to express in the code my contrains
+ on the data, and I believe that if somebody reads the code and sees the
+ bimap instantiation he is not going to have problems understanding it.
+ Perhaps it is easier to understand it if we use your notation: ordered_nonunique,
+ unordered_unique, but this goes against our STL facade. In my opinion the
+ user that comes from STL must have to learn as less as possible. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Considering a relation like a <code class="computeroutput"><span class="keyword">struct</span>
- <span class="special">{</span><span class="identifier">left</span><span class="special">,</span> <span class="identifier">right</span><span class="special">}</span></code> is clean and clear. If I understand
- it well, one relation has views of type <code class="computeroutput"><span class="identifier">pair</span><span class="special">{</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">second</span><span class="special">}</span></code>, is this correct? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Considering a relation like a <code class="computeroutput"><span class="keyword">struct</span>
+ <span class="special">{</span><span class="identifier">left</span><span class="special">,</span> <span class="identifier">right</span><span class="special">}</span></code> is clean and clear. If I understand it
+ well, one relation has views of type <code class="computeroutput"><span class="identifier">pair</span><span class="special">{</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">second</span><span class="special">}</span></code>, is this correct? </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Yes, I believe that the left/right notation to express symmetry
- is great. I believe that to people is going to love it. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Yes, I believe that the left/right notation to express symmetry
+ is great. I believe that to people is going to love it. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> OK, perfect. I likes this very much: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- bm.left is compatible with std::map<A,B></em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- bm.right is compatible with std::map<B,A></em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- bm is compatible with std::set<relation<A,B>></em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> It is elegant and symmetric. I feel good vibrations here.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> OK, perfect. I likes this very much: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- bm.left is compatible with std::map<A,B></em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- bm.right is compatible with std::map<B,A></em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- bm is compatible with std::set<relation<A,B>></em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> It is elegant and symmetric. I feel good vibrations here. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Great! </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Great! </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Moving on, the support for N-1, N-N, and hashed index is very
- easy to grasp, and it fits well in framework. However I do not finish
- to understand very well the "set<relation> constraints"
- section. Will you came up with some examples of which is the meaning
- of the different cases that you enumerate? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Moving on, the support for N-1, N-N, and hashed index is very
+ easy to grasp, and it fits well in framework. However I do not finish to
+ understand very well the "set<relation> constraints" section.
+ Will you came up with some examples of which is the meaning of the different
+ cases that you enumerate? </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias - </strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Yes, I mean: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- based on the left</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- based on the right</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> The bimap core must be based on some index of multi index.
- If the index of the left is of the type hash, then in fact the main view
- is going to be an unordered_set< relation<A,B> >. Perhaps
- this is not what the user prefers and he wants to base its main view
- on the right index. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- set_of_relation </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- multiset_of_relation </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- unordered_set_of_relation </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>- unordered_multiset_of_relation </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> However, if both of them are hash indexes, the user may want
- the main view to be ordered. As we have a B.MI core this is very easy
- to support, we just have to add another index to it. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I understand it now. OK, I do not know if we have to include
- this in the first version, is going to be a functionality avalanche!
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> The user is not affected by the addition of this functionality,
- because by default it will be based on the left index that is a very
- natural behaviour. I do not think that this is functionality bloat, but
- I agree with you that it is a functionality avalanche. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> There are restrictions between the left and right set types
- and the possible main view set types. For example if some of the index
- is of unique type, then the main view cannot be of type multiset_of_relation.
- To the inverse one, if the main view is of type set_of_relation the left
- and the right index cannot be of type multi_set. All this subject of
- the unicity constrictions and the resulting interactions between indexes
- is one of the subtle subjects of B.MI. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> This can be checked at compile time and informed as an error
- in compile time. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> It can be interesting. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Yes, I mean: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- based on the left</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- based on the right</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> The bimap core must be based on some index of multi index. If
+ the index of the left is of the type hash, then in fact the main view is
+ going to be an unordered_set< relation<A,B> >. Perhaps this
+ is not what the user prefers and he wants to base its main view on the
+ right index. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- set_of_relation </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- multiset_of_relation </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- unordered_set_of_relation </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>- unordered_multiset_of_relation </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> However, if both of them are hash indexes, the user may want
+ the main view to be ordered. As we have a B.MI core this is very easy to
+ support, we just have to add another index to it. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I understand it now. OK, I do not know if we have to include
+ this in the first version, is going to be a functionality avalanche! </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> The user is not affected by the addition of this functionality,
+ because by default it will be based on the left index that is a very natural
+ behaviour. I do not think that this is functionality bloat, but I agree
+ with you that it is a functionality avalanche. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> There are restrictions between the left and right set types
+ and the possible main view set types. For example if some of the index
+ is of unique type, then the main view cannot be of type multiset_of_relation.
+ To the inverse one, if the main view is of type set_of_relation the left
+ and the right index cannot be of type multi_set. All this subject of the
+ unicity constrictions and the resulting interactions between indexes is
+ one of the subtle subjects of B.MI. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> This can be checked at compile time and informed as an error
+ in compile time. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> It can be interesting. </em></span>
+ </p></blockquote></div>
<p>
<code class="literal">- And right when everything seems to be perfect... - </code>
</p>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I have some worse news with respect to mutant, it is very
- a well designed and manageable class, unfortunately, C++ does not guarantee
- layout-compatibility almost in any case. For example, the C++ standard
- does not guarantee that the classes <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">a</span><span class="special">;</span> <span class="identifier">T2</span> <span class="identifier">b</span><span class="special">;}</span></code> and <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">;</span> <span class="identifier">T2</span> <span class="identifier">a</span><span class="special">;}</span></code> are layout-compatible, and therefore
- the trick of reinterpret_cast is an undefined behavior. I am with you
- in which that in the 100% of the cases this scheme will really work,
- but the standard is the standard. If you can look the layout-compatibility
- subject in it (http://www.kuzbass.ru/docs
- As you see, sometimes the standard is cruel. Although mutant seems a
- lost case, please do not hurry to eliminate it. We will see what can
- be done for it. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I have some worse news with respect to mutant, it is very a
+ well designed and manageable class, unfortunately, C++ does not guarantee
+ layout-compatibility almost in any case. For example, the C++ standard
+ does not guarantee that the classes <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">a</span><span class="special">;</span> <span class="identifier">T2</span>
+ <span class="identifier">b</span><span class="special">;}</span></code>
+ and <code class="computeroutput"><span class="keyword">struct</span><span class="special">{</span><span class="identifier">T1</span> <span class="identifier">b</span><span class="special">;</span> <span class="identifier">T2</span> <span class="identifier">a</span><span class="special">;}</span></code> are
+ layout-compatible, and therefore the trick of reinterpret_cast is an undefined
+ behavior. I am with you in which that in the 100% of the cases this scheme
+ will really work, but the standard is the standard. If you can look the
+ layout-compatibility subject in it (http://www.kuzbass.ru/docs
+ As you see, sometimes the standard is cruel. Although mutant seems a lost
+ case, please do not hurry to eliminate it. We will see what can be done
+ for it. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I read the standard, and you were right about it. Mutant was
- an implementation detail. It is a pity because I am sure that it will
- work perfect in any compiler. Perhaps the standard becomes more strict
- some day and mutant returns to life... We can then try a wrapper around
- a relation<A,B> that have two references named first and second
- that bind to A and B, or B and A. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I read the standard, and you were right about it. Mutant was
+ an implementation detail. It is a pity because I am sure that it will work
+ perfect in any compiler. Perhaps the standard becomes more strict some
+ day and mutant returns to life... We can then try a wrapper around a relation<A,B>
+ that have two references named first and second that bind to A and B, or
+ B and A. </em></span>
+ </p></blockquote></div>
<p>
</p>
@@ -757,537 +433,278 @@
</pre>
<p>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> It is not difficult to code the relation class in this way
- but two references are initialized with every access and the use of
- <code class="computeroutput"><span class="identifier">pba</span><span class="special">.</span><span class="identifier">first</span></code> will be slower than <code class="computeroutput"><span class="identifier">r</span><span class="special">.</span><span class="identifier">left</span></code> in most compilers. It is very
- difficult to optimize this kind of references. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> This workaround is not possible, due to technical problems
- with the expected behavior of the iterators. If the iterators of bm.left
- are of bidirectional type, then standard stated that it have to return
- an object of type const value_type& when dereferenced. You will have
- to return a const_reference_pair created in the flight, making it impossible
- to return a reference. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I understand... I have workaround for that also but surely
- the standard will attack me again! We must manage to create the class
- relation that responds as we want, the rest of the code will flow from
- this point. This clear separation between the relation class and the
- rest of the library, is going to help to us to separate the problems
- and to attack them better. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> What workaround? It already pricks my curiosity,I have dedicated
- a long time to the subject and I do not find any solution except that
- we allow the relation class to occupy more memory. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> We must achieve that the relation<A,B> size equals the
- pair<A,B> size if we want this library to be really useful. I was
- going to write my workaround and I realized that It does not work. Look
- at this: http://www.boost.org/libs/iterator/doc/new-iter-concepts.html
- Basically the problem that we are dealing is solved if we based our iterators
- on this proposal. The present standard forces that the bidirectional
- iterators also are of the type input and output. Using the new concepts
- there is no inconvenient in making our iterators "Readable Writable
- Swappable Bidirectional Traversal". Therefore the const_reference_pair
- returns to be valid. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> It is correct in the sense that you simply say that your iterators
- are less powerful than those of the std::map. It is not that it is wrong,
- simply that instead of fixing the problem, you confess it. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> OK, but in our particular case; What are the benefits of offering
- a LValue iterator against a Read Write iterator? It does not seem to
- me that it is less powerful in this case. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> The main problem with a ReadWrite is that the following thing:
- <code class="computeroutput"><span class="identifier">value_type</span> <span class="special">*</span>
- <span class="identifier">p</span><span class="special">=&(*</span><span class="identifier">it</span><span class="special">);</span></code>
- fails or stores a transitory direction in p. Is this important in the
- real life? I do not know. How frequently you store the direction of the
- elements of a map? Perhaps it is not very frequent, since the logical
- thing is to store the iterators instead of the directions of the elements.
- Let us review our options: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 1. We used mutant knowing that is not standard, but of course
- it is supported in the 100% of the cases. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 2. We used const_reference_pair and we declared the iterators
- not LValue. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 3. We found some trick that still we do not know. I have thus
- been playing with unions and things, without much luck. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 4. We leverage the restriction that views have to support
- the first, second notation. If we made this decision, there are several
- possibilities: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> a. The left map has standard semantics first/second while
- the right map has the inverse semantics. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> b. Instead of first and second we provide first() and second(),
- with which the problem is trivial. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> c. The map view do not support first/second but left/right
- as the father relation </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 5. We solve the problem using more memory than sizeof(pair<A,B>).
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> In any case, I would say that the only really unacceptable
- option is the last one. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Lets see. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 1. I want the "standard compliant" label in the
- library. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 2. This is the natural choice, but knowing that there is another
- option that always works and it is more efficient is awful. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 3. I have also tried to play with unions, the problem is that
- the union members must be POD types. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 4. This option implies a big lost to the library. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 5. Totally agree. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I want to add another option to this list. Using metaprogramming,
- the relation class checks if the compiler supports the mutant idiom.
- If it supports it then it uses it and obtains zero overhead plus LValue
- iterators, but if it do not supports it then uses const_reference_pair
- and obtains minimum overhead with ReadWrite iterators. This might be
- controversial but the advantages that mutant offers are very big and
- the truth is that I do not believe that in any actual compiler this idiom
- is not supported. This scheme would adjust perfectly to the present standard
- since we are not supposing anything. The only drawback here is that although
- the mutant approach allows to make LValue iterators we have to degrade
- they to Read Write in both cases, because we want that the same code
- can be compiled in any standard compliant compiler. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> It is not difficult to code the relation class in this way but
+ two references are initialized with every access and the use of <code class="computeroutput"><span class="identifier">pba</span><span class="special">.</span><span class="identifier">first</span></code> will be slower than <code class="computeroutput"><span class="identifier">r</span><span class="special">.</span><span class="identifier">left</span></code>
+ in most compilers. It is very difficult to optimize this kind of references.
+ </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> This workaround is not possible, due to technical problems with
+ the expected behavior of the iterators. If the iterators of bm.left are
+ of bidirectional type, then standard stated that it have to return an object
+ of type const value_type& when dereferenced. You will have to return
+ a const_reference_pair created in the flight, making it impossible to return
+ a reference. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I understand... I have workaround for that also but surely the
+ standard will attack me again! We must manage to create the class relation
+ that responds as we want, the rest of the code will flow from this point.
+ This clear separation between the relation class and the rest of the library,
+ is going to help to us to separate the problems and to attack them better.
+ </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> What workaround? It already pricks my curiosity,I have dedicated
+ a long time to the subject and I do not find any solution except that we
+ allow the relation class to occupy more memory. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> We must achieve that the relation<A,B> size equals the
+ pair<A,B> size if we want this library to be really useful. I was
+ going to write my workaround and I realized that It does not work. Look
+ at this: http://www.boost.org/libs/iterator/doc/new-iter-concepts.html
+ Basically the problem that we are dealing is solved if we based our iterators
+ on this proposal. The present standard forces that the bidirectional iterators
+ also are of the type input and output. Using the new concepts there is
+ no inconvenient in making our iterators "Readable Writable Swappable
+ Bidirectional Traversal". Therefore the const_reference_pair returns
+ to be valid. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> It is correct in the sense that you simply say that your iterators
+ are less powerful than those of the std::map. It is not that it is wrong,
+ simply that instead of fixing the problem, you confess it. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> OK, but in our particular case; What are the benefits of offering
+ a LValue iterator against a Read Write iterator? It does not seem to me
+ that it is less powerful in this case. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> The main problem with a ReadWrite is that the following thing:
+ <code class="computeroutput"><span class="identifier">value_type</span> <span class="special">*</span>
+ <span class="identifier">p</span><span class="special">=&(*</span><span class="identifier">it</span><span class="special">);</span></code>
+ fails or stores a transitory direction in p. Is this important in the real
+ life? I do not know. How frequently you store the direction of the elements
+ of a map? Perhaps it is not very frequent, since the logical thing is to
+ store the iterators instead of the directions of the elements. Let us review
+ our options: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 1. We used mutant knowing that is not standard, but of course
+ it is supported in the 100% of the cases. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 2. We used const_reference_pair and we declared the iterators
+ not LValue. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 3. We found some trick that still we do not know. I have thus
+ been playing with unions and things, without much luck. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 4. We leverage the restriction that views have to support the
+ first, second notation. If we made this decision, there are several possibilities:
+ </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> a. The left map has standard semantics first/second while the
+ right map has the inverse semantics. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> b. Instead of first and second we provide first() and second(),
+ with which the problem is trivial. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> c. The map view do not support first/second but left/right as
+ the father relation </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 5. We solve the problem using more memory than sizeof(pair<A,B>).
+ </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> In any case, I would say that the only really unacceptable option
+ is the last one. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Lets see. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 1. I want the "standard compliant" label in the library.
+ </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 2. This is the natural choice, but knowing that there is another
+ option that always works and it is more efficient is awful. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 3. I have also tried to play with unions, the problem is that
+ the union members must be POD types. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 4. This option implies a big lost to the library. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 5. Totally agree. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I want to add another option to this list. Using metaprogramming,
+ the relation class checks if the compiler supports the mutant idiom. If
+ it supports it then it uses it and obtains zero overhead plus LValue iterators,
+ but if it do not supports it then uses const_reference_pair and obtains
+ minimum overhead with ReadWrite iterators. This might be controversial
+ but the advantages that mutant offers are very big and the truth is that
+ I do not believe that in any actual compiler this idiom is not supported.
+ This scheme would adjust perfectly to the present standard since we are
+ not supposing anything. The only drawback here is that although the mutant
+ approach allows to make LValue iterators we have to degrade they to Read
+ Write in both cases, because we want that the same code can be compiled
+ in any standard compliant compiler. </em></span>
+ </p></blockquote></div>
<p>
<code class="literal">- Hopefully we find our way out of the problem -</code>
</p>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Changing the subject, I believe that the general concept of
- hooking data is good, but I do not like the way you implement it. It
- has to be easy to migrate to B.MI to anticipate the case in that Boost.Bimap
- becomes insufficient. It is more natural for a B.MI user that the data
- is accessed without the indirection of <code class="computeroutput"><span class="special">.</span><span class="identifier">data</span></code>. I do not know how this can be
- articulated in your framework. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Matias</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> I have a technical problem to implement the data_hook in this
- way. If the standard would let us use the mutant idiom directly, I can
- implement it using multiple inheritance. But as we must use const_reference_pair
- too, It becomes impossible for me to support it. We have three options
- here: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 1) relation { left, right, data } and pair_view { first, second,
- data } </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - This is more intuitive within the bimap framework, since
- it does not mix the data with the index, as a table in a data base does,
- but gives more importance to the index. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - It is not necessary that the user puts the mutable keyword
- in each member of the data class. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - This moves away just a little bit from B.MI because the
- model of it is similar to a table, but it continues to exist a clear
- path of migration. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 2) relation { left,right, d1,d2... dn } and pair_view { first,
- second, data } </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - The path to B.MI is the one you have proposed. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - It is very asymmetric. It is necessary to explain that the
- views are handled different that the relation. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - The user must place the mutable keyboards in the data class.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 3) Only relation { left,right, d1,d2... dn } </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - Simple migration path to B.MI. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> - You are not able to access the hooked data from the views.
- </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> My vote goes to the first proposal. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <span class="bold"><strong>Joaquin</strong></span>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Yes, the first option is the one that less surprises hold
- to the user. I also vote for 1. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Changing the subject, I believe that the general concept of
+ hooking data is good, but I do not like the way you implement it. It has
+ to be easy to migrate to B.MI to anticipate the case in that Boost.Bimap
+ becomes insufficient. It is more natural for a B.MI user that the data
+ is accessed without the indirection of <code class="computeroutput"><span class="special">.</span><span class="identifier">data</span></code>. I do not know how this can be articulated
+ in your framework. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Matias</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> I have a technical problem to implement the data_hook in this
+ way. If the standard would let us use the mutant idiom directly, I can
+ implement it using multiple inheritance. But as we must use const_reference_pair
+ too, It becomes impossible for me to support it. We have three options
+ here: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 1) relation { left, right, data } and pair_view { first, second,
+ data } </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - This is more intuitive within the bimap framework, since it
+ does not mix the data with the index, as a table in a data base does, but
+ gives more importance to the index. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - It is not necessary that the user puts the mutable keyword
+ in each member of the data class. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - This moves away just a little bit from B.MI because the model
+ of it is similar to a table, but it continues to exist a clear path of
+ migration. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 2) relation { left,right, d1,d2... dn } and pair_view { first,
+ second, data } </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - The path to B.MI is the one you have proposed. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - It is very asymmetric. It is necessary to explain that the
+ views are handled different that the relation. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - The user must place the mutable keyboards in the data class.
+ </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 3) Only relation { left,right, d1,d2... dn } </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - Simple migration path to B.MI. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> - You are not able to access the hooked data from the views.
+ </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> My vote goes to the first proposal. </em></span>
+ </p></blockquote></div>
+<p>
+ <span class="bold"><strong>Joaquin</strong></span>
+ </p>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Yes, the first option is the one that less surprises hold to
+ the user. I also vote for 1. </em></span>
+ </p></blockquote></div>
<p>
<code class="literal">- The third week was over -</code>
</p>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> There is still one problem that I have to solve. I need to
- know if it is necessary to create a map_view associated to nothing. If
- it is necessary there are two options: that it behaves as an empty container
- or that it throws an exception or assert when trying to use it. If it
- is not necessary, the map_view is going to keep a reference instead of
- a pointer. To me, the map_view always must be viewing something. In the
- case of the iterators being able to create them empty, makes them easy
- to use in contexts that require constructors by default, like being the
- value_type of a container, but I do not believe that this is the case
- of map_view. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> There is still one problem that I have to solve. I need to know
+ if it is necessary to create a map_view associated to nothing. If it is
+ necessary there are two options: that it behaves as an empty container
+ or that it throws an exception or assert when trying to use it. If it is
+ not necessary, the map_view is going to keep a reference instead of a pointer.
+ To me, the map_view always must be viewing something. In the case of the
+ iterators being able to create them empty, makes them easy to use in contexts
+ that require constructors by default, like being the value_type of a container,
+ but I do not believe that this is the case of map_view. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> How would an empty map_view be useful? My intuition is like
- yours, map_view would have to be always associate to something. If we
- wished to obtain the semantics "is associated or not" we can
- use a pointer to a map_view. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> How would an empty map_view be useful? My intuition is like
+ yours, map_view would have to be always associate to something. If we wished
+ to obtain the semantics "is associated or not" we can use a pointer
+ to a map_view. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> OK, then you agree to that map_views stores a reference instead
- of a pointer? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> OK, then you agree to that map_views stores a reference instead
+ of a pointer? </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Joaquin</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> It depends on the semantics you want to give to map_views,
- and in concrete to the copy of map_views. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> It depends on the semantics you want to give to map_views, and
+ in concrete to the copy of map_views. </em></span>
+ </p></blockquote></div>
<p>
</p>
@@ -1297,84 +714,42 @@
</pre>
<p>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> What is supposed to do this last line? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 1. Rebinding of x, that is to say, x points at the same container
- that y. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 2. Copy of the underlying container. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> If you want to implement 1, you cannot use references internally.
- If you want to implement 2, it is almost the same to use a reference
- or a pointer. </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> What is supposed to do this last line? </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 1. Rebinding of x, that is to say, x points at the same container
+ that y. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 2. Copy of the underlying container. </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> If you want to implement 1, you cannot use references internally.
+ If you want to implement 2, it is almost the same to use a reference or
+ a pointer. </em></span>
+ </p></blockquote></div>
<p>
<span class="bold"><strong>Matias</strong></span>
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> If I want that they behave exactly as std::maps then I must
- go for 2. But if I think they as "views" of something, I like
- 1. The question is complicated. I add another option: </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> 3. Error: operator= is declare as private in boost::bimap::map_view
- std_container </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em> Also What happens with <code class="computeroutput"><span class="identifier">std_container</span>
- <span class="special">=</span> <span class="identifier">view</span><span class="special">;</span></code>? and with <code class="computeroutput"><span class="identifier">view</span>
- <span class="special">=</span> <span class="identifier">std_container</span><span class="special">;</span></code>? </em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> If I want that they behave exactly as std::maps then I must
+ go for 2. But if I think they as "views" of something, I like
+ 1. The question is complicated. I add another option: </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> 3. Error: operator= is declare as private in boost::bimap::map_view
+ std_container </em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em> Also What happens with <code class="computeroutput"><span class="identifier">std_container</span>
+ <span class="special">=</span> <span class="identifier">view</span><span class="special">;</span></code>? and with <code class="computeroutput"><span class="identifier">view</span>
+ <span class="special">=</span> <span class="identifier">std_container</span><span class="special">;</span></code>? </em></span>
+ </p></blockquote></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -1382,7 +757,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="code.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="code.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../rationale.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../history.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Reference</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="bimap_and_boost/dependencies.html" title="Dependencies">
<link rel="next" href="reference/bimap_reference.html" title="Bimap Reference">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Reference">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h2></div></div></div>
@@ -89,7 +89,7 @@
Views</a></span></dt>
</dl></dd>
</dl></div>
-<div class="section" title="Headers">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.reference.headers"></a><a class="link" href="reference.html#boost_bimap.reference.headers" title="Headers">Headers</a>
</h3></div></div></div>
@@ -100,55 +100,55 @@
<span class="bold"><strong>Convenience</strong></span>
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
- "boost/bimap.hpp" <span class="emphasis"><em>(includes "boost/bimap/bimap.hpp"
- and imports the bimap class to boost namespace)</em></span>
-</li></ul></div>
+ "boost/bimap.hpp" <span class="emphasis"><em>(includes "boost/bimap/bimap.hpp"
+ and imports the bimap class to boost namespace)</em></span>
+ </li></ul></div>
<p>
<span class="bold"><strong>Container</strong></span>
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
- "boost/bimap/bimap.hpp" <span class="emphasis"><em>(includes "boost/bimap/set_of.hpp"
- and "boost/bimap/unconstrained_set_of.hpp")</em></span>
-</li></ul></div>
+ "boost/bimap/bimap.hpp" <span class="emphasis"><em>(includes "boost/bimap/set_of.hpp"
+ and "boost/bimap/unconstrained_set_of.hpp")</em></span>
+ </li></ul></div>
<p>
<span class="bold"><strong>Set Types</strong></span>
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- "boost/bimap/set_of.hpp"
- </li>
+ "boost/bimap/set_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/multiset_of.hpp"
- </li>
+ "boost/bimap/multiset_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/unordered_set_of.hpp"
- </li>
+ "boost/bimap/unordered_set_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/unordered_multiset_of.hpp"
- </li>
+ "boost/bimap/unordered_multiset_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/list_of.hpp"
- </li>
+ "boost/bimap/list_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/vector_of.hpp"
- </li>
+ "boost/bimap/vector_of.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/unconstrained_set_of.hpp"
- </li>
+ "boost/bimap/unconstrained_set_of.hpp"
+ </li>
</ul></div>
<p>
<span class="bold"><strong>Boost Integration</strong></span>
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- "boost/bimap/support/lambda.hpp"
- </li>
+ "boost/bimap/support/lambda.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/property_map/set_support.hpp"
- </li>
+ "boost/bimap/property_map/set_support.hpp"
+ </li>
<li class="listitem">
- "boost/bimap/property_map/unordered_set_support.hpp"
- </li>
+ "boost/bimap/property_map/unordered_set_support.hpp"
+ </li>
</ul></div>
<p>
A program using Boost.Bimap must therefore include "boost/bimap/bimap.hpp"
@@ -167,7 +167,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -175,7 +175,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bimap_and_boost/dependencies.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/bimap_reference.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/bimap_reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Bimap Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="../reference.html" title="Reference">
<link rel="next" href="set_of_reference.html" title="set_of Reference">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Bimap Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.reference.bimap_reference"></a><a class="link" href="bimap_reference.html" title="Bimap Reference">Bimap Reference</a>
</h3></div></div></div>
@@ -53,7 +53,7 @@
<dt><span class="section">Serialization</span></dt>
</dl></dd>
</dl></div>
-<div class="section" title="View concepts">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.bimap_reference.view_concepts"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.view_concepts" title="View concepts">View
concepts</a>
@@ -81,26 +81,26 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying
- </li>
+ copying
+ </li>
+<li class="listitem">
+ insertion of an element
+ </li>
+<li class="listitem">
+ hinted insertion, where a pre-existing element is suggested in order
+ to improve the efficiency of the operation
+ </li>
+<li class="listitem">
+ deletion of an element
+ </li>
<li class="listitem">
- insertion of an element
- </li>
+ replacement of the value of an element, which may trigger the rearrangement
+ of this element in one or more views, or may forbid the replacement
+ </li>
<li class="listitem">
- hinted insertion, where a pre-existing element is suggested in order
- to improve the efficiency of the operation
- </li>
-<li class="listitem">
- deletion of an element
- </li>
-<li class="listitem">
- replacement of the value of an element, which may trigger the rearrangement
- of this element in one or more views, or may forbid the replacement
- </li>
-<li class="listitem">
- modification of an element, and its subsequent rearrangement/banning
- by the various views
- </li>
+ modification of an element, and its subsequent rearrangement/banning
+ by the various views
+ </li>
</ul></div>
<p>
The last two primitives deserve some further explanation: in order to guarantee
@@ -111,9 +111,7 @@
fashion.
</p>
</div>
-<a name="complexity_signature_explanation"></a><p>
- </p>
-<div class="section" title="Complexity signature">
+<a name="complexity_signature_explanation"></a><div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.bimap_reference.complexity_signature"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.complexity_signature" title="Complexity signature">Complexity
signature</a>
@@ -131,29 +129,29 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
- copying
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
- insertion
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
- hinted insertion
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
- deletion
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
- replacement
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
- modifying
- </li>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
+ copying
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
+ insertion
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
+ hinted insertion
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
+ deletion
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
+ replacement
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>:
+ modifying
+ </li>
</ul></div>
<p>
If the collection type of the relation is <code class="computeroutput"><span class="identifier">left_based</span></code>
@@ -169,21 +167,27 @@
To abbreviate the notation, we adopt the following definitions:
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><span class="identifier">C</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">c_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">c_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span>
- <span class="identifier">c_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">I</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">i_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">i_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span>
- <span class="identifier">i_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">H</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">h_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">h_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span>
- <span class="identifier">h_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">D</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">d_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">d_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span>
- <span class="identifier">d_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">R</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">r_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">r_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span>
- <span class="identifier">r_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">M</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">m_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">m_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span>
- <span class="identifier">m_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code></li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">C</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">c_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">c_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span> <span class="identifier">c_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">I</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">i_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">i_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span> <span class="identifier">i_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">H</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">h_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">h_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span> <span class="identifier">h_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">D</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">d_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">d_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span> <span class="identifier">d_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">R</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">r_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">r_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span> <span class="identifier">r_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">M</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">m_l</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">m_r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">[</span> <span class="special">+</span> <span class="identifier">m_a</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">]</span></code>
+ </li>
</ul></div>
</div>
-<div class="section" title="Set type specification">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.bimap_reference.set_type_specification"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.set_type_specification" title="Set type specification">Set
type specification</a>
@@ -207,177 +211,173 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Side collection type
- </p>
+ <p>
+ Side collection type
+ </p>
</th>
<th>
- <p>
- Collection type of relation
- </p>
+ <p>
+ Collection type of relation
+ </p>
</th>
<th>
- <p>
- Include
- </p>
+ <p>
+ Include
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">set_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_of</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">set_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">set_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">set_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">multiset_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">multiset_of</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">multiset_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">multiset_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">multiset_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">multiset_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_set_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_set_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">unordered_set_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">unordered_set_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multiset_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multiset_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">unordered_multiset_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">unordered_multiset_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">list_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">list_of</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">list_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">list_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">list_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">list_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">vector_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">vector_of</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">vector_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">vector_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">vector_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">vector_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unconstrained_set_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unconstrained_set_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">unconstrained_set_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">unconstrained_set_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">left_based</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_based</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">right_based</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_based</span></code>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">.</span><span class="identifier">hpp</span></code>
+ </p>
</td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Tags">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.bimap_reference.tags"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.tags" title="Tags">Tags</a>
</h4></div></div></div>
@@ -387,7 +387,7 @@
uses the tagged idiom to let the user specify this tags.
</p>
</div>
-<div class="section" title='Header "boost/bimap/bimap.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.header__boost_bimap_bimap_hpp__synopsis" title='Header "boost/bimap/bimap.hpp" synopsis'>Header
"boost/bimap/bimap.hpp" synopsis</a>
@@ -484,7 +484,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title="Class template bimap">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap" title="Class template bimap">Class
template bimap</a>
@@ -506,7 +506,7 @@
<p>
This is the main component of Boost.Bimap.
</p>
-<div class="section" title="Complexity">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.complexity"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.complexity" title="Complexity">Complexity</a>
</h5></div></div></div>
@@ -515,7 +515,7 @@
we adopt the scheme outlined in the complexity signature section.
</p>
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.instantiation_types"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.instantiation_types" title="Instantiation types">Instantiation
types</a>
@@ -526,106 +526,68 @@
</p>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- LeftCollectionType and RightCollectionType are collection type specifications
- optionally tagged, or any type optionally tagged, in which case that
- side acts as a set.
- </li>
+ LeftCollectionType and RightCollectionType are collection type specifications
+ optionally tagged, or any type optionally tagged, in which case that
+ side acts as a set.
+ </li>
<li class="listitem">
- AdditionalParameter_{1/2} can be any ordered subset of:
- <div class="itemizedlist"><ul class="itemizedlist" type="disc">
+ AdditionalParameter_{1/2} can be any ordered subset of:
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- CollectionTypeOfRelation specification
- </li>
+ CollectionTypeOfRelation specification
+ </li>
<li class="listitem">
- Allocator
- </li>
+ Allocator
+ </li>
</ul></div>
-</li>
+ </li>
</ol></div>
</div>
-<div class="section" title="Nested types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.nested_types"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.nested_types" title="Nested types">Nested
types</a>
</h5></div></div></div>
<pre class="programlisting"><span class="identifier">left_tag</span><span class="special">,</span> <span class="identifier">right_tag</span>
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Tags for each side of the bimap. If the user has not specified any
- tag the tags default to <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
- and <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">right</span></code>.
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ Tags for each side of the bimap. If the user has not specified any
+ tag the tags default to <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
+ and <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">right</span></code>.
+ </p></blockquote></div>
<pre class="programlisting"><span class="identifier">left_key_type</span><span class="special">,</span> <span class="identifier">right_key_type</span>
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Key type of each side. In a <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span> </code> <code class="computeroutput"><span class="identifier">left_key_type</span></code>
- is <code class="computeroutput"><span class="identifier">A</span></code> and <code class="computeroutput"><span class="identifier">right_key_type</span></code> is <code class="computeroutput"><span class="identifier">B</span></code>. If there are tags, it is better
- to use: <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">key_type</span></code>.
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ Key type of each side. In a <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span> </code> <code class="computeroutput"><span class="identifier">left_key_type</span></code>
+ is <code class="computeroutput"><span class="identifier">A</span></code> and <code class="computeroutput"><span class="identifier">right_key_type</span></code> is <code class="computeroutput"><span class="identifier">B</span></code>.
+ If there are tags, it is better to use: <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">key_type</span></code>.
+ </p></blockquote></div>
<pre class="programlisting"><span class="identifier">left_data_type</span><span class="special">,</span> <span class="identifier">right_data_type</span>
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Data type of each side. In a bimap<A,B> left_key_type is B
- and right_key_type is A. If there are tags, it is better to use:
- <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">data_type</span></code>.
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ Data type of each side. In a bimap<A,B> left_key_type is B and
+ right_key_type is A. If there are tags, it is better to use: <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">data_type</span></code>.
+ </p></blockquote></div>
<pre class="programlisting"><span class="identifier">left_value_type</span><span class="special">,</span> <span class="identifier">right_value_type</span>
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Value type used for the views. If there are tags, it is better to
- use: <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">value_type</span></code>.
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ Value type used for the views. If there are tags, it is better to use:
+ <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">value_type</span></code>.
+ </p></blockquote></div>
<pre class="programlisting"><span class="identifier">left_iterator</span><span class="special">,</span> <span class="identifier">right_iterator</span>
<span class="identifier">left_const_iterator</span><span class="special">,</span> <span class="identifier">right_const_iterator</span>
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Iterators of the views. If there are tags, it is better to use:
- <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">iterator</span></code> and <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">const_iterator</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ Iterators of the views. If there are tags, it is better to use: <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">iterator</span></code> and <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">const_iterator</span></code>
+ </p></blockquote></div>
<pre class="programlisting"><span class="identifier">left_map</span><span class="special">,</span> <span class="identifier">right_map</span>
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- Map view type of each side. If there are tags, it is better to use:
- <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">type</span></code>.
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ Map view type of each side. If there are tags, it is better to use:
+ <code class="computeroutput"><span class="identifier">Bimap</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">type</span></code>.
+ </p></blockquote></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
copy and assignment</a>
@@ -634,92 +596,90 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Constructs an empty <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Constructs an empty <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
</ul></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">></span>
<span class="identifier">bimap</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span><span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">InputIterator</span></code>
- is a model of Input Iterator over elements of type <code class="computeroutput"><span class="identifier">relation</span></code>
- or a type convertible to <code class="computeroutput"><span class="identifier">relation</span></code>.
- last is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Constructs an empty <code class="computeroutput"><span class="identifier">bimap</span></code> and fills it with the elements
- in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>. Insertion of each element may or
- may not succeed depending on acceptance by the collection types of
- the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<a class="link" href="bimap_reference.html#complexity_signature_explanation"><span class="bold"><strong>Complexity:</strong></span></a>
- O(m*H(m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">InputIterator</span></code>
+ is a model of Input Iterator over elements of type <code class="computeroutput"><span class="identifier">relation</span></code> or a type convertible
+ to <code class="computeroutput"><span class="identifier">relation</span></code>. last
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Constructs an empty <code class="computeroutput"><span class="identifier">bimap</span></code> and fills it with the elements
+ in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>. Insertion of each element may or
+ may not succeed depending on acceptance by the collection types of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <a class="link" href="bimap_reference.html#complexity_signature_explanation"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(m*H(m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">bimap</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Constructs a copy of x, copying
- its elements as well as its internal objects (key extractors, comparison
- objects, allocator.)
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span><code class="computeroutput"><span class="special">*</span><span class="keyword">this</span> <span class="special">==</span> <span class="identifier">x</span></code>. The order of the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code> is preserved
- as well.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(x.size()*log(x.size())
- + C(x.size()))
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Constructs a copy of x,
+ copying its elements as well as its internal objects (key extractors,
+ comparison objects, allocator.)
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span> <span class="special">==</span>
+ <span class="identifier">x</span></code>. The order of the views
+ of the <code class="computeroutput"><span class="identifier">bimap</span></code> is preserved
+ as well.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> O(x.size()*log(x.size())
+ + C(x.size()))
+ </li>
</ul></div>
<pre class="programlisting"><span class="special">~</span><span class="identifier">bimap</span><span class="special">()</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Destroys the <code class="computeroutput"><span class="identifier">bimap</span></code> and all the elements contained.
- The order in which the elements are destroyed is not specified.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Destroys the <code class="computeroutput"><span class="identifier">bimap</span></code> and all the elements contained.
+ The order in which the elements are destroyed is not specified.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(n).
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span><span class="keyword">const</span> <span class="identifier">bimap</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Replaces the elements and
- internal objects of the <code class="computeroutput"><span class="identifier">bimap</span></code>
- with copies from x.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Replaces the elements and
+ internal objects of the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ with copies from x.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span><code class="computeroutput"><span class="special">*</span><span class="keyword">this</span><span class="special">==</span><span class="identifier">x</span></code>. The order on the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code> is preserved
- as well.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span><span class="special">==</span><span class="identifier">x</span></code>. The order on the views of the
+ <code class="computeroutput"><span class="identifier">bimap</span></code> is preserved
+ as well.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n + x.size()*log(x.size())
- + C(x.size())).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(n + x.size()*log(x.size())
+ + C(x.size())).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong, provided
- the copy and assignment operations of the types of <code class="computeroutput"><span class="identifier">ctor_args_list</span></code>
- do not throw.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong, provided
+ the copy and assignment operations of the types of <code class="computeroutput"><span class="identifier">ctor_args_list</span></code> do not throw.
+ </li>
</ul></div>
</div>
-<a name="reference_projection_operations"></a><p>
- </p>
-<div class="section" title="Projection operations">
+<a name="reference_projection_operations"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.projection_operations" title="Projection operations">Projection
operations</a>
@@ -731,14 +691,14 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">it1</span> <span class="special">==</span>
- <span class="identifier">i1</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
- AND <code class="computeroutput"><span class="identifier">it2</span> <span class="special">==</span>
- <span class="identifier">i2</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">it1</span> <span class="special">==</span>
+ <span class="identifier">i1</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
+ AND <code class="computeroutput"><span class="identifier">it2</span> <span class="special">==</span>
+ <span class="identifier">i2</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>,
+ </li>
<li class="listitem">
- OR <code class="computeroutput"><span class="identifier">it1</span></code> and <code class="computeroutput"><span class="identifier">it2</span></code> point to the same element.
- </li>
+ OR <code class="computeroutput"><span class="identifier">it1</span></code> and <code class="computeroutput"><span class="identifier">it2</span></code> point to the same element.
+ </li>
</ul></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">IteratorType</span> <span class="special">></span>
<span class="identifier">left_iterator</span> <span class="identifier">project_left</span><span class="special">(</span><span class="identifier">IteratorType</span> <span class="identifier">iter</span><span class="special">);</span>
@@ -748,20 +708,21 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span><code class="computeroutput"><span class="identifier">IteratorType</span></code>
- is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
- </li>
+ <span class="bold"><strong>Requires:</strong></span> <code class="computeroutput"><span class="identifier">IteratorType</span></code>
+ is a bimap view iterator. it is a valid iterator of some view of
+ <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns a left map view
+ iterator equivalent to <code class="computeroutput"><span class="identifier">it</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a left map view iterator
- equivalent to <code class="computeroutput"><span class="identifier">it</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">IteratorType</span> <span class="special">></span>
<span class="identifier">right_iterator</span> <span class="identifier">project_right</span><span class="special">(</span><span class="identifier">IteratorType</span> <span class="identifier">iter</span><span class="special">);</span>
@@ -771,20 +732,21 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span><code class="computeroutput"><span class="identifier">IteratorType</span></code>
- is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a right map view
- iterator equivalent to <code class="computeroutput"><span class="identifier">it</span></code>.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> <code class="computeroutput"><span class="identifier">IteratorType</span></code>
+ is a bimap view iterator. it is a valid iterator of some view of
+ <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns a right map view
+ iterator equivalent to <code class="computeroutput"><span class="identifier">it</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">IteratorType</span> <span class="special">></span>
<span class="identifier">iterator</span> <span class="identifier">project_up</span><span class="special">(</span><span class="identifier">IteratorType</span> <span class="identifier">iter</span><span class="special">);</span>
@@ -794,25 +756,24 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span><code class="computeroutput"><span class="identifier">IteratorType</span></code>
- is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
- </li>
+ <span class="bold"><strong>Requires:</strong></span> <code class="computeroutput"><span class="identifier">IteratorType</span></code>
+ is a bimap view iterator. it is a valid iterator of some view of
+ <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a collection of relations
- view iterator equivalent to <code class="computeroutput"><span class="identifier">it</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Returns a collection of
+ relations view iterator equivalent to <code class="computeroutput"><span class="identifier">it</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
</div>
-<a name="reference_support_for_used_defined_names"></a><p>
- </p>
-<div class="section" title="Support for user defined names">
+<a name="reference_support_for_used_defined_names"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.support_for_user_defined_names" title="Support for user defined names">Support
for user defined names</a>
@@ -822,14 +783,15 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">type</span></code> yields the type of the map view
- tagged with <code class="computeroutput"><span class="identifier">Tag</span></code>. <code class="computeroutput"><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span></code><span class="emphasis"><em>-type
- name-</em></span> is the same as <code class="computeroutput"><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">type</span><span class="special">::</span></code><span class="emphasis"><em>-type name-</em></span>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">Tag</span></code>
- is a valid user defined name of the bimap.
- </li>
+ <code class="computeroutput"><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">type</span></code> yields the type of the map
+ view tagged with <code class="computeroutput"><span class="identifier">Tag</span></code>.
+ <code class="computeroutput"><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span></code><span class="emphasis"><em>-type
+ name-</em></span> is the same as <code class="computeroutput"><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">type</span><span class="special">::</span></code><span class="emphasis"><em>-type name-</em></span>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">Tag</span></code>
+ is a valid user defined name of the bimap.
+ </li>
</ul></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Tag</span> <span class="special">></span>
<span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">by</span><span class="special">();</span>
@@ -839,20 +801,20 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">Tag</span></code>
- is a valid user defined name of the bimap.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">Tag</span></code>
+ is a valid user defined name of the bimap.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns a reference to
+ the map view tagged with <code class="computeroutput"><span class="identifier">Tag</span></code>
+ held by <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a reference to the
- map view tagged with <code class="computeroutput"><span class="identifier">Tag</span></code>
- held by <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Tag</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">IteratorType</span> <span class="special">></span>
<span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Tag</span><span class="special">>::</span><span class="identifier">iterator</span> <span class="identifier">project</span><span class="special">(</span><span class="identifier">IteratorType</span> <span class="identifier">iter</span><span class="special">);</span>
@@ -862,25 +824,26 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">Tag</span></code>
- is a valid user defined name of the bimap. <code class="computeroutput"><span class="identifier">IteratorType</span></code>
- is a bimap view iterator. it is a valid iterator of some view of <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">Tag</span></code>
+ is a valid user defined name of the bimap. <code class="computeroutput"><span class="identifier">IteratorType</span></code>
+ is a bimap view iterator. it is a valid iterator of some view of
+ <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ (i.e. does not refer to some other <code class="computeroutput"><span class="identifier">bimap</span></code>.)
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns a reference to
+ the map view tagged with <code class="computeroutput"><span class="identifier">Tag</span></code>
+ held by <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a reference to the
- map view tagged with <code class="computeroutput"><span class="identifier">Tag</span></code>
- held by <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.bimap_reference.class_template_bimap.serialization"></a><a class="link" href="bimap_reference.html#boost_bimap.reference.bimap_reference.class_template_bimap.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>
@@ -908,8 +871,8 @@
if
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<code class="computeroutput"><span class="identifier">p</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">q</span><span class="special">(</span><span class="identifier">x</span></code>'<code class="computeroutput"><span class="special">,</span><span class="identifier">y</span></code>'<code class="computeroutput"><span class="special">)</span></code>
-</li></ul></div>
+ <code class="computeroutput"><span class="identifier">p</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span> <span class="special">==</span> <span class="identifier">q</span><span class="special">(</span><span class="identifier">x</span></code>'<code class="computeroutput"><span class="special">,</span><span class="identifier">y</span></code>'<code class="computeroutput"><span class="special">)</span></code>
+ </li></ul></div>
<p>
for every <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code> of type <code class="computeroutput"><span class="identifier">T</span></code>
and <code class="computeroutput"><span class="identifier">x</span></code>' and <code class="computeroutput"><span class="identifier">y</span></code>' being restored copies of <code class="computeroutput"><span class="identifier">x</span></code> and <code class="computeroutput"><span class="identifier">y</span></code>,
@@ -924,14 +887,15 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> Value is serializable (XML-serializable).
- Additionally, each of the views of b can impose other requirements.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong with respect
- to <code class="computeroutput"><span class="identifier">b</span></code>. If an exception
- is thrown, ar may be left in an inconsistent state.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> Value is serializable
+ (XML-serializable). Additionally, each of the views of b can impose
+ other requirements.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong with respect
+ to <code class="computeroutput"><span class="identifier">b</span></code>. If an exception
+ is thrown, ar may be left in an inconsistent state.
+ </li>
</ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
@@ -942,21 +906,20 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> Value is serializable (XML-serializable).
- Additionally, each of the views of <code class="computeroutput"><span class="identifier">b</span></code>'
- can impose other requirements.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown, ar may be left in an inconsistent state.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> Value is serializable
+ (XML-serializable). Additionally, each of the views of <code class="computeroutput"><span class="identifier">b</span></code>' can impose other requirements.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown, ar may be left in an inconsistent state.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -964,7 +927,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/list_of_reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>list_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="unordered_set_of_reference.html" title="unordered_set_of Reference">
<link rel="next" href="vector_of_reference.html" title="vector_of Reference">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="unordered_set_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="list_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.reference.list_of_reference"></a><a class="link" href="list_of_reference.html" title="list_of Reference">list_of Reference</a>
</h3></div></div></div>
@@ -48,7 +48,7 @@
<dt><span class="section">Serialization</span></dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/list_of.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.header__boost_bimap_list_of_hpp__synopsis" title='Header "boost/bimap/list_of.hpp" synopsis'>Header
"boost/bimap/list_of.hpp" synopsis</a>
@@ -67,7 +67,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title="list_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views" title="list_of Views">list_of
Views</a>
@@ -110,19 +110,19 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- list_of views are not Assignable
- (like any other view.)
- </li>
-<li class="listitem">
- Unlike as in <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">list</span></code>, insertions into a list_of view
- may fail due to clashings with other views. This alters the semantics
- of the operations provided with respect to their analogues in <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">list</span></code>.
- </li>
-<li class="listitem">
- Elements in a list_of view are not mutable, and can only be changed by
- means of <code class="computeroutput"><span class="identifier">replace</span></code> and
- <code class="computeroutput"><span class="identifier">modify</span></code> member functions.
- </li>
+ list_of views are not Assignable
+ (like any other view.)
+ </li>
+<li class="listitem">
+ Unlike as in <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">list</span></code>, insertions into a list_of view
+ may fail due to clashings with other views. This alters the semantics
+ of the operations provided with respect to their analogues in <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">list</span></code>.
+ </li>
+<li class="listitem">
+ Elements in a list_of view are not mutable, and can only be changed
+ by means of <code class="computeroutput"><span class="identifier">replace</span></code>
+ and <code class="computeroutput"><span class="identifier">modify</span></code> member functions.
+ </li>
</ul></div>
<p>
Having these restrictions into account, list_of views are models of Reversible Container,
@@ -312,9 +312,7 @@
<span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="special">...</span> <span class="special">,</span> <span class="identifier">Left</span> <span class="special">></span> <span class="identifier">value_type</span><span class="special">;</span>
</pre>
-<a name="list_of_complexity_signature"></a><p>
- </p>
-<div class="section" title="Complexity signature">
+<a name="list_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.complexity_signature"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.complexity_signature" title="Complexity signature">Complexity
signature</a>
@@ -326,26 +324,30 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
- </li>
-<li class="listitem">
- insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant),
- </li>
-<li class="listitem">
- hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant),
- </li>
+ copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
+ </li>
<li class="listitem">
- deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant),
- </li>
-<li class="listitem">
- replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant),
- </li>
-<li class="listitem">
- modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant).
- </li>
+ insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant),
+ </li>
+<li class="listitem">
+ hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant),
+ </li>
+<li class="listitem">
+ deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant),
+ </li>
+<li class="listitem">
+ replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant),
+ </li>
+<li class="listitem">
+ modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant).
+ </li>
</ul></div>
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.instantiation_types"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.instantiation_types" title="Instantiation types">Instantiation
types</a>
@@ -358,14 +360,14 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> from <code class="computeroutput"><span class="identifier">list_of</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">Value</span></code> from <code class="computeroutput"><span class="identifier">list_of</span></code>,
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
+ </li>
</ul></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.constructors__copy_and_assignment"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
copy and assignment</a>
@@ -378,451 +380,422 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">a</span>
- <span class="special">=</span> <span class="identifier">b</span><span class="special">;</span></code> where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code> objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- and <code class="computeroutput"><span class="identifier">x</span></code> belong, respectively.
- </li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">a</span>
+ <span class="special">=</span> <span class="identifier">b</span><span class="special">;</span></code> where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code> objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ and <code class="computeroutput"><span class="identifier">x</span></code> belong, respectively.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
+ </li>
</ul></div>
-<a name="reference_list_of_assign_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
+<a name="reference_list_of_assign_iterator_iterator"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">assign</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">InputIterator</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
- Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
- or a type convertible to <code class="computeroutput"><span class="identifier">value_type</span></code>.
- first and last are not iterators into any views of the <code class="computeroutput"><span class="identifier">bimap</span></code> to which this view belongs.
- <code class="computeroutput"><span class="identifier">last</span></code> is reachable from
- <code class="computeroutput"><span class="identifier">first</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">InputIterator</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
+ Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
+ or a type convertible to <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ first and last are not iterators into any views of the <code class="computeroutput"><span class="identifier">bimap</span></code> to which this view belongs.
+ <code class="computeroutput"><span class="identifier">last</span></code> is reachable
+ from <code class="computeroutput"><span class="identifier">first</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">);</span></code>
-</li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">);</span></code>
+ </li>
</ul></div>
-<a name="reference_list_of_assign_size_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">assign</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
+<a name="reference_list_of_assign_size_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">assign</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
- <span class="identifier">i</span> <span class="special">=</span>
- <span class="number">0</span><span class="special">;</span>
- <span class="identifier">i</span> <span class="special"><</span>
- <span class="identifier">n</span> <span class="special">;</span>
- <span class="special">++</span><span class="identifier">n</span><span class="special">)</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">v</span><span class="special">);</span></code>
-</li></ul></div>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
+ <span class="identifier">i</span> <span class="special">=</span>
+ <span class="number">0</span><span class="special">;</span>
+ <span class="identifier">i</span> <span class="special"><</span>
+ <span class="identifier">n</span> <span class="special">;</span>
+ <span class="special">++</span><span class="identifier">n</span><span class="special">)</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">v</span><span class="special">);</span></code>
+ </li></ul></div>
</div>
-<div class="section" title="Capacity operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.capacity_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.capacity_operations" title="Capacity operations">Capacity
operations</a>
</h5></div></div></div>
-<a name="reference_list_of_resize_size_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">=</span><span class="identifier">value_type</span><span class="special">());</span>
+<a name="reference_list_of_resize_size_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">=</span><span class="identifier">value_type</span><span class="special">());</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span> <span class="special">></span> <span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span>
- <span class="identifier">n</span> <span class="special">-</span>
- <span class="identifier">size</span><span class="special">(),</span>
- <span class="identifier">x</span><span class="special">);</span></code><code class="computeroutput"><span class="keyword">else</span> <span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span> <span class="special"><</span> <span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="special">{</span></code><code class="computeroutput"> <span class="identifier">iterator</span>
- <span class="identifier">it</span> <span class="special">=</span>
- <span class="identifier">begin</span><span class="special">();</span></code><code class="computeroutput"> <span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span><span class="identifier">it</span><span class="special">,</span> <span class="identifier">n</span><span class="special">);</span></code><code class="computeroutput"> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">it</span><span class="special">,</span> <span class="identifier">end</span><span class="special">());</span></code><code class="computeroutput"><span class="special">}</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> If an expansion is requested,
- the size of the view is not guaranteed to be n after this operation
- (other views may ban insertions.)
- </li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span> <span class="special">></span> <span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span>
+ <span class="identifier">n</span> <span class="special">-</span>
+ <span class="identifier">size</span><span class="special">(),</span>
+ <span class="identifier">x</span><span class="special">);</span></code>
+ <code class="computeroutput"><span class="keyword">else</span> <span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span> <span class="special"><</span> <span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="special">{</span></code> <code class="computeroutput"> <span class="identifier">iterator</span>
+ <span class="identifier">it</span> <span class="special">=</span>
+ <span class="identifier">begin</span><span class="special">();</span></code>
+ <code class="computeroutput"> <span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span><span class="identifier">it</span><span class="special">,</span> <span class="identifier">n</span><span class="special">);</span></code>
+ <code class="computeroutput"> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">it</span><span class="special">,</span> <span class="identifier">end</span><span class="special">());</span></code>
+ <code class="computeroutput"><span class="special">}</span></code>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> If an expansion is requested,
+ the size of the view is not guaranteed to be n after this operation
+ (other views may ban insertions.)
+ </li>
</ul></div>
</div>
-<div class="section" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.modifiers"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
-<a name="reference_list_of_push_front_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_front</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_list_of_push_front_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_front</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
- at the beginning of the sequence if no other views of the <code class="computeroutput"><span class="identifier">bimap</span></code> bans the insertion.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
+ at the beginning of the sequence if no other views of the <code class="computeroutput"><span class="identifier">bimap</span></code> bans the insertion.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(I(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_list_of_push_back_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_back</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_list_of_push_back_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_back</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
- at the end of the sequence if no other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>
- bans the insertion.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
+ at the end of the sequence if no other views of the <code class="computeroutput"><span class="identifier">bimap</span></code> bans the insertion.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(I(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_list_of_insert_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_list_of_insert_iterator_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
- of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
+ of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
- before position if insertion is allowed by all other views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
+ before position if insertion is allowed by all other views of the
+ <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(I(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_list_of_insert_iterator_size_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_list_of_insert_iterator_size_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
- of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
+ of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
- <span class="identifier">i</span> <span class="special">=</span>
- <span class="number">0</span><span class="special">;</span>
- <span class="identifier">i</span> <span class="special"><</span>
- <span class="identifier">n</span><span class="special">;</span>
- <span class="special">++</span><span class="identifier">i</span><span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,</span> <span class="identifier">x</span><span class="special">);</span></code>
-</li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
+ <span class="identifier">i</span> <span class="special">=</span>
+ <span class="number">0</span><span class="special">;</span>
+ <span class="identifier">i</span> <span class="special"><</span>
+ <span class="identifier">n</span><span class="special">;</span>
+ <span class="special">++</span><span class="identifier">i</span><span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,</span> <span class="identifier">x</span><span class="special">);</span></code>
+ </li>
</ul></div>
-<a name="reference_list_of_insert_iterator_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">></span>
+<a name="reference_list_of_insert_iterator_iterator_iterator"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">></span>
<span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span><span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
- of the view. <code class="computeroutput"><span class="identifier">InputIterator</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
- Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>.
- <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any view
- of the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
- is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
+ of the view. <code class="computeroutput"><span class="identifier">InputIterator</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
+ Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any
+ view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ to which this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">while</span><span class="special">(</span><span class="identifier">first</span>
- <span class="special">!=</span> <span class="identifier">last</span><span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,</span> <span class="special">*</span><span class="identifier">first</span><span class="special">++);</span></code>
-</li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">while</span><span class="special">(</span><span class="identifier">first</span>
+ <span class="special">!=</span> <span class="identifier">last</span><span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,</span> <span class="special">*</span><span class="identifier">first</span><span class="special">++);</span></code>
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(m*I(n+m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(m*I(n+m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_erase_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
+<a name="reference_list_of_erase_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable <code class="computeroutput"><span class="identifier">iterator</span></code>
- of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable <code class="computeroutput"><span class="identifier">iterator</span></code>
+ of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
- to by <code class="computeroutput"><span class="identifier">position</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
+ to by <code class="computeroutput"><span class="identifier">position</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> An iterator pointing to the
- element immediately following the one that was deleted, or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if no such element exists.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> An iterator pointing to
+ the element immediately following the one that was deleted, or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if no such element exists.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(D(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(D(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_list_of_erase_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_list_of_erase_iterator_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
- is a valid range of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the elements in
- <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the elements in
+ <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="identifier">last</span></code>.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="identifier">last</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_list_of_replace_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_list_of_replace_iterator_value"></a><pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to the element pointed to by <code class="computeroutput"><span class="identifier">position</span></code> into the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the view belongs if replacing is allowed by all other views
- of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to the element pointed to by
+ <code class="computeroutput"><span class="identifier">position</span></code> into the
+ <code class="computeroutput"><span class="identifier">bimap</span></code> to which the
+ view belongs if replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved in all cases.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved in all cases.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_list_of_replace_key_iterator_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_list_of_replace_key_iterator_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">key_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if replacing is allowed by all other views of
- the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">key_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if replacing is allowed by all other views
+ of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_list_of_replace_data_iterator_data"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
+<a name="reference_list_of_replace_data_iterator_data"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleData</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">data_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if replacing is allowed by all other views of
- the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">data_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if replacing is allowed by all other views
+ of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_list_of_modify_key_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
+<a name="reference_list_of_modify_key_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">KeyModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">KeyModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. It is successful if the rearrangement
- is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">KeyModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. It is successful if the
+ rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
-<a name="reference_list_of_modify_data_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
+<a name="reference_list_of_modify_data_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">DataModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">DataModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. It is successful if the rearrangement
- is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">DataModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. It is successful if the
+ rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="List operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.list_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.list_operations" title="List operations">List
operations</a>
@@ -836,319 +809,299 @@
of the operations may depend on the other views belonging to the same
<code class="computeroutput"><span class="identifier">bimap</span></code>.
</p>
-<a name="reference_list_of_splice_iterator_this"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_list_of_splice_iterator_this"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">!=</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">!=</span><span class="keyword">this</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts the contents of
- <code class="computeroutput"><span class="identifier">x</span></code> before position,
- in the same order as they were in <code class="computeroutput"><span class="identifier">x</span></code>.
- Those elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts the contents of
+ <code class="computeroutput"><span class="identifier">x</span></code> before position,
+ in the same order as they were in <code class="computeroutput"><span class="identifier">x</span></code>.
+ Those elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*I(n+<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)
- + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*D(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*I(n+<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)
+ + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*D(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_splice_iterator_this_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span><span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
+<a name="reference_list_of_splice_iterator_this_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span><span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
- is a valid dereferenceable iterator <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
+ is a valid dereferenceable iterator <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
- to by <code class="computeroutput"><span class="identifier">i</span></code> before position:
- if insertion is successful, the element is erased from <code class="computeroutput"><span class="identifier">x</span></code>. In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- no copy or deletion is performed, and the operation is always successful.
- If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>, no operation is performed.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
+ to by <code class="computeroutput"><span class="identifier">i</span></code> before position:
+ if insertion is successful, the element is erased from <code class="computeroutput"><span class="identifier">x</span></code>. In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no copy or deletion is performed, and the operation is always successful.
+ If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>, no operation is performed.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no iterator or reference is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no iterator or reference is invalidated.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- constant; otherwise O(I(n) + D(n)).
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ constant; otherwise O(I(n) + D(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, strong.
+ </li>
</ul></div>
-<a name="reference_list_of_splice_iterator_this_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_list_of_splice_iterator_this_iterator_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
- and <code class="computeroutput"><span class="identifier">last</span></code> are valid
- iterators of <code class="computeroutput"><span class="identifier">x</span></code>. last
- is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- position is not in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
+ and <code class="computeroutput"><span class="identifier">last</span></code> are valid
+ iterators of <code class="computeroutput"><span class="identifier">x</span></code>. last
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ position is not in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> For each element in the range
- <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>, insertion is tried before position;
- if the operation is successful, the element is erased from x. In the
- special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- no copy or deletion is performed, and insertions are always successful.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> For each element in the
+ range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>, insertion is tried before position;
+ if the operation is successful, the element is erased from x. In
+ the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no copy or deletion is performed,
+ and insertions are always successful.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no iterator or reference is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no iterator or reference is invalidated.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- constant; otherwise O(m*I(n+m) + m*D(x.size())) where m is the number
- of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ constant; otherwise O(m*I(n+m) + m*D(x.size())) where m is the number
+ of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, basic.
+ </li>
</ul></div>
-<a name="reference_list_of_remove_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
+<a name="reference_list_of_remove_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Erases all elements of the
- view which compare equal to <code class="computeroutput"><span class="identifier">value</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Erases all elements of
+ the view which compare equal to <code class="computeroutput"><span class="identifier">value</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_remove_if_predicate"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Predicate</span> <span class="special">></span>
+<a name="reference_list_of_remove_if_predicate"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Predicate</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">Predicate</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Erases all elements <code class="computeroutput"><span class="identifier">x</span></code> of the view for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- holds.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Erases all elements <code class="computeroutput"><span class="identifier">x</span></code> of the view for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+ holds.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_unique"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">unique</span><span class="special">();</span>
+<a name="reference_list_of_unique"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">unique</span><span class="special">();</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Eliminates all but the first
- element from every consecutive group of equal elements referred to
- by the iterator <code class="computeroutput"><span class="identifier">i</span></code> in
- the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">+</span><span class="number">1</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
- for which <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span><span class="special">==*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Eliminates all but the
+ first element from every consecutive group of equal elements referred
+ to by the iterator <code class="computeroutput"><span class="identifier">i</span></code>
+ in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">+</span><span class="number">1</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code> for which <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span><span class="special">==*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_list_of_unique_predicate"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> <span class="special">></span>
+<a name="reference_list_of_unique_predicate"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">unique</span><span class="special">(</span><span class="identifier">BinaryPredicate</span> <span class="identifier">binary_pred</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Eliminates all but the first
- element from every consecutive group of elements referred to by the
- iterator i in the range [first+1,last) for which <code class="computeroutput"><span class="identifier">binary_pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">,*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">))</span></code>
- holds.
- </li>
-<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
-</ul></div>
-<a name="reference_list_of_merge_this"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">merge</span><span class="special">(</span><span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+ <span class="bold"><strong>Effects:</strong></span> Eliminates all but the
+ first element from every consecutive group of elements referred to
+ by the iterator i in the range [first+1,last) for which <code class="computeroutput"><span class="identifier">binary_pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">,*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">))</span></code>
+ holds.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
+</ul></div>
+<a name="reference_list_of_merge_this"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">merge</span><span class="special">(</span><span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
- Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted according to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Attempts to insert every
- element of <code class="computeroutput"><span class="identifier">x</span></code> into the
- corresponding position of the view (according to the order). Elements
- successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
- The resulting sequence is stable, i.e. equivalent elements of either
- container preserve their relative position. In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- no operation is performed.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Elements in the view
- and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted. Validity of iterators to the view and of non-erased elements
- of <code class="computeroutput"><span class="identifier">x</span></code> references is
- preserved.
- </li>
-<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- constant; otherwise O(n + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*I(n+<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>) + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*D(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, basic.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted according to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Attempts to insert every
+ element of <code class="computeroutput"><span class="identifier">x</span></code> into
+ the corresponding position of the view (according to the order).
+ Elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
+ The resulting sequence is stable, i.e. equivalent elements of either
+ container preserve their relative position. In the special case
+ <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no operation is performed.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Elements in the
+ view and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted. Validity of iterators to the view and of non-erased elements
+ of <code class="computeroutput"><span class="identifier">x</span></code> references is
+ preserved.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ constant; otherwise O(n + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*I(n+<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>) + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*D(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, basic.
+ </li>
</ul></div>
-<a name="reference_list_of_merge_this_compare"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Compare</span> <span class="special">></span>
+<a name="reference_list_of_merge_this_compare"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Compare</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">merge</span><span class="special">(</span><span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">comp</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
- Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted according to <code class="computeroutput"><span class="identifier">comp</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Attempts to insert every
- element of <code class="computeroutput"><span class="identifier">x</span></code> into the
- corresponding position of the view (according to <code class="computeroutput"><span class="identifier">comp</span></code>).
- Elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
- The resulting sequence is stable, i.e. equivalent elements of either
- container preserve their relative position. In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- no operation is performed.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Elements in the view
- and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted according to <code class="computeroutput"><span class="identifier">comp</span></code>.
- Validity of iterators to the view and of non-erased elements of <code class="computeroutput"><span class="identifier">x</span></code> references is preserved.
- </li>
-<li class="listitem">
-<a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- constant; otherwise O(n + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*I(n+<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>) + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*D(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, basic.
- </li>
-</ul></div>
-<a name="reference_list_of_sort"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">sort</span><span class="special">();</span>
+ <span class="bold"><strong>Requires:</strong></span> Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted according to <code class="computeroutput"><span class="identifier">comp</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Attempts to insert every
+ element of <code class="computeroutput"><span class="identifier">x</span></code> into
+ the corresponding position of the view (according to <code class="computeroutput"><span class="identifier">comp</span></code>). Elements successfully inserted
+ are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
+ The resulting sequence is stable, i.e. equivalent elements of either
+ container preserve their relative position. In the special case
+ <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no operation is performed.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Elements in the
+ view and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted according to <code class="computeroutput"><span class="identifier">comp</span></code>.
+ Validity of iterators to the view and of non-erased elements of
+ <code class="computeroutput"><span class="identifier">x</span></code> references is preserved.
+ </li>
+<li class="listitem">
+ <a class="link" href="list_of_reference.html#list_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ constant; otherwise O(n + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*I(n+<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>) + <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>*D(<code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, basic.
+ </li>
+</ul></div>
+<a name="reference_list_of_sort"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">sort</span><span class="special">();</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over value_type.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Sorts the view according
- to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
- The sorting is stable, i.e. equivalent elements preserve their relative
- position.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
- and references is preserved.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow if <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>
- does not throw; otherwise, basic.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over value_type.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Sorts the view according
+ to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
+ The sorting is stable, i.e. equivalent elements preserve their relative
+ position.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
+ and references is preserved.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow if <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>
+ does not throw; otherwise, basic.
+ </li>
</ul></div>
-<a name="reference_list_of_sort_compare"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">Compare</span> <span class="special">></span>
+<a name="reference_list_of_sort_compare"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">Compare</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">Compare</span> <span class="identifier">comp</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over value_type.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over value_type.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Sorts the view according
- to comp. The sorting is stable, i.e. equivalent elements preserve their
- relative position.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Sorts the view according
+ to comp. The sorting is stable, i.e. equivalent elements preserve
+ their relative position.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
- and references is preserved.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow if comp
- does not throw; otherwise, basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow if comp
+ does not throw; otherwise, basic.
+ </li>
</ul></div>
-<a name="reference_list_of_reverse"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">reverse</span><span class="special">();</span>
+<a name="reference_list_of_reverse"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">reverse</span><span class="special">();</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Reverses the order of the
- elements in the view.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Reverses the order of the
+ elements in the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
- and references is preserved.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(n).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Rearrange operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.rearrange_operations" title="Rearrange operations">Rearrange
operations</a>
@@ -1158,62 +1111,59 @@
(although splice provides partially overlapping functionality), perform
individual and global repositioning of elements inside the index.
</p>
-<a name="reference_list_of_relocate_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
+<a name="reference_list_of_relocate_iterator_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
- to by <code class="computeroutput"><span class="identifier">i</span></code> before <code class="computeroutput"><span class="identifier">position</span></code>. If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>,
- no operation is performed.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
+ to by <code class="computeroutput"><span class="identifier">i</span></code> before <code class="computeroutput"><span class="identifier">position</span></code>. If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>,
+ no operation is performed.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
- is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_list_of_relocate_iterator_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_list_of_relocate_iterator_iterator_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
- and <code class="computeroutput"><span class="identifier">last</span></code> are valid
- iterators of the view. <code class="computeroutput"><span class="identifier">last</span></code>
- is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- <code class="computeroutput"><span class="identifier">position</span></code> is not in
- the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
+ and <code class="computeroutput"><span class="identifier">last</span></code> are valid
+ iterators of the view. <code class="computeroutput"><span class="identifier">last</span></code>
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ <code class="computeroutput"><span class="identifier">position</span></code> is not in
+ the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> The range of elements <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code> is repositioned just before <code class="computeroutput"><span class="identifier">position</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> The range of elements
+ <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code> is repositioned just before <code class="computeroutput"><span class="identifier">position</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
- is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.list_of_reference.list_of_views.serialization"></a><a class="link" href="list_of_reference.html#boost_bimap.reference.list_of_reference.list_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>
@@ -1233,9 +1183,9 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container.
- </li></ul></div>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1244,16 +1194,14 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container. <span class="bold"><strong>Postconditions:</strong></span>
- On successful loading, each of the elements of <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span>
- <span class="identifier">end</span><span class="special">())</span></code>
- is a restored copy of the corresponding element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span>
- <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>,
- where <code class="computeroutput"><span class="identifier">i</span></code> is the position
- of the <code class="computeroutput"><span class="identifier">list_of</span></code> view
- in the container.
- </li></ul></div>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container. <span class="bold"><strong>Postconditions:</strong></span>
+ On successful loading, each of the elements of <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span>
+ <span class="identifier">end</span><span class="special">())</span></code>
+ is a restored copy of the corresponding element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>, where <code class="computeroutput"><span class="identifier">i</span></code>
+ is the position of the <code class="computeroutput"><span class="identifier">list_of</span></code>
+ view in the container.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1262,10 +1210,10 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">it</span></code>
- is a valid iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
- has been previously saved.
- </li></ul></div>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">it</span></code>
+ is a valid iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
+ has been previously saved.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1276,23 +1224,23 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- if it was dereferenceable then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>' is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>,
- otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
- <span class="special">==</span> <span class="identifier">end</span><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> It is allowed that <code class="computeroutput"><span class="identifier">it</span></code> be a <code class="computeroutput"><span class="identifier">const_iterator</span></code>
- and the restored <code class="computeroutput"><span class="identifier">it</span></code>'
- an iterator, or viceversa.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ if it was dereferenceable then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>' is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>,
+ otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
+ <span class="special">==</span> <span class="identifier">end</span><span class="special">()</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> It is allowed that <code class="computeroutput"><span class="identifier">it</span></code> be a <code class="computeroutput"><span class="identifier">const_iterator</span></code>
+ and the restored <code class="computeroutput"><span class="identifier">it</span></code>'
+ an iterator, or viceversa.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -1300,7 +1248,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="unordered_set_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/set_of_reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="bimap_reference.html" title="Bimap Reference">
<link rel="next" href="unordered_set_of_reference.html" title="unordered_set_of Reference">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bimap_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bimap_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="set_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.reference.set_of_reference"></a><a class="link" href="set_of_reference.html" title="set_of Reference">set_of Reference</a>
</h3></div></div></div>
@@ -52,7 +52,7 @@
<dt><span class="section">Serialization</span></dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/set_of.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_set_of_hpp__synopsis" title='Header "boost/bimap/set_of.hpp" synopsis'>Header
"boost/bimap/set_of.hpp" synopsis</a>
@@ -80,7 +80,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title='Header "boost/bimap/multiset_of.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.header__boost_bimap_multiset_of_hpp__synopsis" title='Header "boost/bimap/multiset_of.hpp" synopsis'>Header
"boost/bimap/multiset_of.hpp" synopsis</a>
@@ -108,7 +108,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title="Collection type specifiers set_of and multiset_of">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.collection_type_specifiers_set_of_and_multiset_of" title="Collection type specifiers set_of and multiset_of">Collection
type specifiers set_of and multiset_of</a>
@@ -119,7 +119,7 @@
coincide, so they are described together.
</p>
</div>
-<div class="section" title="[multi]set_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views" title="[multi]set_of Views">[multi]set_of
Views</a>
@@ -372,9 +372,7 @@
<span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="special">...</span> <span class="special">,</span><span class="keyword">const</span> <span class="identifier">Left</span> <span class="special">></span> <span class="identifier">value_type</span><span class="special">;</span>
</pre>
-<a name="set_of_complexity_signature"></a><p>
- </p>
-<div class="section" title="Complexity signature">
+<a name="set_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.complexity_signature" title="Complexity signature">Complexity
signature</a>
@@ -387,33 +385,31 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
- </li>
+ copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
+ </li>
<li class="listitem">
- insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
- </li>
+ insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
+ </li>
<li class="listitem">
- hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant) if the hint element precedes
- the point of insertion, <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
- otherwise,
- </li>
-<li class="listitem">
- deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (amortized
- constant),
- </li>
-<li class="listitem">
- replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant)
- if the element position does not change, <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
- otherwise,
- </li>
-<li class="listitem">
- modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant)
- if the element position does not change, <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
- otherwise.
- </li>
+ hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant) if the hint element precedes
+ the point of insertion, <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
+ otherwise,
+ </li>
+<li class="listitem">
+ deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (amortized constant),
+ </li>
+<li class="listitem">
+ replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant) if the element position does not change, <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code> otherwise,
+ </li>
+<li class="listitem">
+ modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant) if the element position does not change, <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code> otherwise.
+ </li>
</ul></div>
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.instantiation_types" title="Instantiation types">Instantiation
types</a>
@@ -424,23 +420,23 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> from the set
- specifier,
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Compare</span></code> from the set
- specifier.
- </li>
+ <code class="computeroutput"><span class="identifier">Value</span></code> from the set
+ specifier,
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">Compare</span></code> from the
+ set specifier.
+ </li>
</ul></div>
<p>
<code class="computeroutput"><span class="identifier">Compare</span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
Weak Ordering</a> on elements of <code class="computeroutput"><span class="identifier">Value</span></code>.
</p>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.constructors__copy_and_assignment"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
copy and assignment</a>
@@ -453,436 +449,420 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">a</span>
- <span class="special">=</span> <span class="identifier">b</span><span class="special">;</span></code> where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code> objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- and x belong, respectively.
- </li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">a</span>
+ <span class="special">=</span> <span class="identifier">b</span><span class="special">;</span></code> where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code> objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ and x belong, respectively.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
+ </li>
</ul></div>
</div>
-<div class="section" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.modifiers"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
-<a name="reference_set_of_insert_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_set_of_insert_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- the set view is non-unique OR no other element with equivalent
- key exists,
- </li>
+ the set view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by the other set specifications the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ AND insertion is allowed by the other set specifications the
+ <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(I(n)).
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_set_of_insert_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_set_of_insert_iterator_value"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is used as a hint to improve the efficiency of the operation. Inserts
- <code class="computeroutput"><span class="identifier">x</span></code> into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the view belongs if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is used as a hint to improve the efficiency of the operation. Inserts
+ <code class="computeroutput"><span class="identifier">x</span></code> into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the view belongs
+ if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- the set view is non-unique OR no other element with equivalent
- key exists,
- </li>
+ the set view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ AND insertion is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> On successful insertion,
- an iterator to the newly inserted element. Otherwise, an iterator to
- an element that caused the insertion to be banned. Note that more than
- one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> On successful insertion,
+ an iterator to the newly inserted element. Otherwise, an iterator
+ to an element that caused the insertion to be banned. Note that more
+ than one element can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(H(n)).
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(H(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_set_of_insert_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
+<a name="reference_set_of_insert_iterator_iterator"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">InputIterator</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
- Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
- or a type convertible to value_type. <code class="computeroutput"><span class="identifier">first</span></code>
- and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators
- into any view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which this index belongs. <code class="computeroutput"><span class="identifier">last</span></code>
- is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">iterator</span>
- <span class="identifier">hint</span> <span class="special">=</span>
- <span class="identifier">end</span><span class="special">()</span></code>;
- <code class="computeroutput"><span class="keyword">while</span><span class="special">(</span>
- <span class="identifier">first</span> <span class="special">!=</span>
- <span class="identifier">last</span> <span class="special">)</span>
- <span class="identifier">hint</span> <span class="special">=</span>
- <span class="identifier">insert</span><span class="special">(</span>
- <span class="identifier">hint</span><span class="special">,</span>
- <span class="special">*</span><span class="identifier">first</span><span class="special">++</span> <span class="special">);</span></code>
-</li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(m*H(n+m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span>
- <span class="identifier">last</span><span class="special">)</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
-</ul></div>
-<a name="reference_set_of_erase_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">InputIterator</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
+ Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
+ or a type convertible to value_type. <code class="computeroutput"><span class="identifier">first</span></code>
+ and <code class="computeroutput"><span class="identifier">last</span></code> are not
+ iterators into any view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ to which this index belongs. <code class="computeroutput"><span class="identifier">last</span></code>
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">iterator</span>
+ <span class="identifier">hint</span> <span class="special">=</span>
+ <span class="identifier">end</span><span class="special">()</span></code>;
+ <code class="computeroutput"><span class="keyword">while</span><span class="special">(</span>
+ <span class="identifier">first</span> <span class="special">!=</span>
+ <span class="identifier">last</span> <span class="special">)</span>
+ <span class="identifier">hint</span> <span class="special">=</span>
+ <span class="identifier">insert</span><span class="special">(</span>
+ <span class="identifier">hint</span><span class="special">,</span>
+ <span class="special">*</span><span class="identifier">first</span><span class="special">++</span> <span class="special">);</span></code>
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(m*H(n+m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span>
+ <span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
+</ul></div>
+<a name="reference_set_of_erase_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator if the set view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator if the set view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
+ to by <code class="computeroutput"><span class="identifier">position</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns:</strong></span> An iterator pointing to
+ the element immediately following the one that was deleted, or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if no such element exists.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(D(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
- to by <code class="computeroutput"><span class="identifier">position</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> An iterator pointing to the
- element immediately following the one that was deleted, or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if no such element exists.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(D(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_set_of_erase_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_erase_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">size_type</span> <span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the elements with
- key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the elements with
+ key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> Number of elements deleted.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> Number of elements deleted.
+ </li>
<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(log(n) + m*D(n)), where m is the number of elements deleted.
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(log(n) + m*D(n)), where m is the number of elements deleted.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_set_of_erase_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_set_of_erase_iterator_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
- is a valid range of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the elements in
- <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the elements in
+ <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> last.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> last.
+ </li>
<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(log(n) + m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(log(n) + m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_set_of_replace_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_set_of_replace_iterator_value"></a><pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to the element pointed to by <code class="computeroutput"><span class="identifier">position</span></code> into the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs if, for the value <code class="computeroutput"><span class="identifier">x</span></code><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to the element pointed to by
+ <code class="computeroutput"><span class="identifier">position</span></code> into the
+ <code class="computeroutput"><span class="identifier">bimap</span></code> to which the
+ set view belongs if, for the value <code class="computeroutput"><span class="identifier">x</span></code>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- the set view is non-unique OR no other element with equivalent
- key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
- </li>
+ the set view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
+ </li>
<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_set_of_replace_key_iterator_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_replace_key_iterator_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">key_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if,
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
- </li>
-<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">key_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if,
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
+ </li>
+<li class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_set_of_replace_data_iterator_data"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
+<a name="reference_set_of_replace_data_iterator_data"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleData</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">data_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if,
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
- </li>
-<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">data_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if,
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
+ </li>
+<li class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_set_of_modify_key_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
+<a name="reference_set_of_modify_key_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">KeyModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">KeyModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists,
- </li>
-<li class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">KeyModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. Rearrangement is successful
+ if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
+<li class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
-<a name="reference_set_of_modify_data_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
+<a name="reference_set_of_modify_data_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">DataModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">DataModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the oppositte map view is non-unique OR no other element with equivalent
- key in that view exists,
- </li>
-<li class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">DataModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. Rearrangement is successful
+ if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the oppositte map view is non-unique OR no other element with
+ equivalent key in that view exists,
+ </li>
+<li class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="set_of_reference.html#set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="Set operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.set_operations"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.set_operations" title="Set operations">Set
operations</a>
@@ -906,9 +886,7 @@
as well as being a strict weak ordering, accepts arguments of type <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>, which usually means
it has several overloads of <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>.
</p>
-<a name="reference_set_of_find_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_find_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">iterator</span> <span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
@@ -916,40 +894,36 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a pointer to an element
- whose key is equivalent to <code class="computeroutput"><span class="identifier">x</span></code>,
- or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if such an element does not exist.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns a pointer to an
+ element whose key is equivalent to <code class="computeroutput"><span class="identifier">x</span></code>,
+ or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if such an element does not exist.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
</ul></div>
-<a name="reference_set_of_count_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_count_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">size_type</span> <span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns the number of elements
- with key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns the number of elements
+ with key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n) + count(x)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n) + count(x)).
+ </li>
</ul></div>
-<a name="reference_set_of_lower_bound_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_lower_bound_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">iterator</span> <span class="identifier">lower_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
@@ -957,22 +931,20 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns an iterator pointing
- to the first element with key not less than <code class="computeroutput"><span class="identifier">x</span></code>,
- or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if such an element does not exist.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns an iterator pointing
+ to the first element with key not less than <code class="computeroutput"><span class="identifier">x</span></code>,
+ or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if such an element does not exist.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
</ul></div>
-<a name="reference_set_of_upper_bound_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_upper_bound_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">iterator</span> <span class="identifier">upper_bound</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
@@ -980,22 +952,20 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns an iterator pointing
- to the first element with key greater than <code class="computeroutput"><span class="identifier">x</span></code>,
- or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if such an element does not exist.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns an iterator pointing
+ to the first element with key greater than <code class="computeroutput"><span class="identifier">x</span></code>,
+ or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if such an element does not exist.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
</ul></div>
-<a name="reference_set_of_equal_range_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_equal_range_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">></span>
<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">key_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
@@ -1005,18 +975,18 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Equivalent to <code class="computeroutput"><span class="identifier">make_pair</span><span class="special">(</span><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Equivalent to <code class="computeroutput"><span class="identifier">make_pair</span><span class="special">(</span><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
</ul></div>
</div>
-<div class="section" title="Range operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.range_operations"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.range_operations" title="Range operations">Range
operations</a>
@@ -1037,13 +1007,13 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">LowerBounder</span></code> is a
- <code class="computeroutput"><span class="identifier">Predicate</span></code> over <code class="computeroutput"><span class="identifier">Key</span></code>,
- </li>
-<li class="listitem">
- if <code class="computeroutput"><span class="identifier">lower</span><span class="special">(</span><span class="identifier">k1</span><span class="special">)</span></code>
- and <code class="computeroutput"><span class="special">!</span><span class="identifier">comp</span><span class="special">(</span><span class="identifier">k2</span><span class="special">,</span><span class="identifier">k1</span><span class="special">)</span></code> then <code class="computeroutput"><span class="identifier">lower</span><span class="special">(</span><span class="identifier">k2</span><span class="special">)</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">LowerBounder</span></code> is a
+ <code class="computeroutput"><span class="identifier">Predicate</span></code> over <code class="computeroutput"><span class="identifier">Key</span></code>,
+ </li>
+<li class="listitem">
+ if <code class="computeroutput"><span class="identifier">lower</span><span class="special">(</span><span class="identifier">k1</span><span class="special">)</span></code>
+ and <code class="computeroutput"><span class="special">!</span><span class="identifier">comp</span><span class="special">(</span><span class="identifier">k2</span><span class="special">,</span><span class="identifier">k1</span><span class="special">)</span></code> then <code class="computeroutput"><span class="identifier">lower</span><span class="special">(</span><span class="identifier">k2</span><span class="special">)</span></code>,
+ </li>
</ul></div>
<p>
for every <code class="computeroutput"><span class="identifier">lower</span></code> of type
@@ -1054,80 +1024,77 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">UpperBounder</span></code> is a
- <code class="computeroutput"><span class="identifier">Predicate</span></code> over <code class="computeroutput"><span class="identifier">Key</span></code>,
- </li>
-<li class="listitem">
- if <code class="computeroutput"><span class="identifier">upper</span><span class="special">(</span><span class="identifier">k1</span><span class="special">)</span></code>
- and <code class="computeroutput"><span class="special">!</span><span class="identifier">comp</span><span class="special">(</span><span class="identifier">k1</span><span class="special">,</span><span class="identifier">k2</span><span class="special">)</span></code> then <code class="computeroutput"><span class="identifier">upper</span><span class="special">(</span><span class="identifier">k2</span><span class="special">)</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">UpperBounder</span></code> is a
+ <code class="computeroutput"><span class="identifier">Predicate</span></code> over <code class="computeroutput"><span class="identifier">Key</span></code>,
+ </li>
+<li class="listitem">
+ if <code class="computeroutput"><span class="identifier">upper</span><span class="special">(</span><span class="identifier">k1</span><span class="special">)</span></code>
+ and <code class="computeroutput"><span class="special">!</span><span class="identifier">comp</span><span class="special">(</span><span class="identifier">k1</span><span class="special">,</span><span class="identifier">k2</span><span class="special">)</span></code> then <code class="computeroutput"><span class="identifier">upper</span><span class="special">(</span><span class="identifier">k2</span><span class="special">)</span></code>,
+ </li>
</ul></div>
<p>
for every <code class="computeroutput"><span class="identifier">upper</span></code> of type
<code class="computeroutput"><span class="identifier">UpperBounder</span></code>, <code class="computeroutput"><span class="identifier">comp</span></code> of type <code class="computeroutput"><span class="identifier">Compare</span></code>,
and <code class="computeroutput"><span class="identifier">k1</span></code>, <code class="computeroutput"><span class="identifier">k2</span></code> of type <code class="computeroutput"><span class="identifier">Key</span></code>.
</p>
-<a name="reference_set_of_range_lower_upper"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">LowerBounder</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UpperBounder</span><span class="special">></span>
+<a name="reference_set_of_range_lower_upper"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">LowerBounder</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UpperBounder</span><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">></span> <span class="identifier">range</span><span class="special">(</span>
<span class="identifier">LowerBounder</span> <span class="identifier">lower</span><span class="special">,</span> <span class="identifier">UpperBounder</span> <span class="identifier">upper</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">LowerBounder</span></code>
- and <code class="computeroutput"><span class="identifier">UpperBounder</span></code> are
- a lower and upper bounder of <code class="computeroutput"><span class="identifier">key_compare</span></code>,
- respectively.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a pair of iterators
- pointing to the beginning and one past the end of the subsequence of
- elements satisfying lower and upper simultaneously. If no such elements
- exist, the iterators both point to the first element satisfying lower,
- or else are equal to <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code> if this latter element does not exist.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Variants:</strong></span> In place of lower or upper
- (or both), the singular value <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">bimap</span><span class="special">::</span><span class="identifier">unbounded</span></code>
- can be provided. This acts as a predicate which all values of type
- <code class="computeroutput"><span class="identifier">key_type</span></code> satisfy.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">LowerBounder</span></code>
+ and <code class="computeroutput"><span class="identifier">UpperBounder</span></code>
+ are a lower and upper bounder of <code class="computeroutput"><span class="identifier">key_compare</span></code>,
+ respectively.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns a pair of iterators
+ pointing to the beginning and one past the end of the subsequence
+ of elements satisfying lower and upper simultaneously. If no such
+ elements exist, the iterators both point to the first element satisfying
+ lower, or else are equal to <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code> if this latter element does not
+ exist.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Variants:</strong></span> In place of lower or upper
+ (or both), the singular value <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">bimap</span><span class="special">::</span><span class="identifier">unbounded</span></code>
+ can be provided. This acts as a predicate which all values of type
+ <code class="computeroutput"><span class="identifier">key_type</span></code> satisfy.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="at(), info_at() and operator[] - set_of only">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.at____info_at___and_operator_______set_of_only" title="at(), info_at() and operator[] - set_of only">at(),
info_at() and operator[] - set_of only</a>
</h5></div></div></div>
-<a name="reference_set_of_at_key_const"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_at_key_const"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="keyword">const</span> <span class="identifier">data_type</span> <span class="special">&</span> <span class="identifier">at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
- with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
- exist.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
+ with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
+ exist.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> is used.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> is used.
+ </li>
</ul></div>
<p>
The symmetry of bimap imposes some constraints on <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> and the non constant version of at()
@@ -1135,55 +1102,49 @@
Tey are only provided if the other collection type is mutable (<code class="computeroutput"><span class="identifier">list_of</span></code>, <code class="computeroutput"><span class="identifier">vector_of</span></code>
and <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>).
</p>
-<a name="reference_set_of_operator_bracket_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_operator_bracket_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">data_type</span> <span class="special">&</span> <span class="keyword">operator</span><span class="special">[](</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">return</span>
- <span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span><span class="special">(</span><span class="identifier">k</span><span class="special">,</span><span class="identifier">data_type</span><span class="special">()))-></span><span class="identifier">second</span><span class="special">;</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> is used and the other collection
- type is mutable.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">return</span>
+ <span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span><span class="special">(</span><span class="identifier">k</span><span class="special">,</span><span class="identifier">data_type</span><span class="special">()))-></span><span class="identifier">second</span><span class="special">;</span></code>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> is used and the other collection
+ type is mutable.
+ </li>
</ul></div>
-<a name="reference_set_of_at_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_at_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">data_type</span> <span class="special">&</span> <span class="identifier">at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
- with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
- exist.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> is used and the other collection
- type is mutable.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects: </strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
+ with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
+ exist.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> is used and the other collection
+ type is mutable.
+ </li>
</ul></div>
-<a name="reference_set_of_info_at_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_set_of_info_at_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">info_type</span> <span class="special">&</span> <span class="identifier">info_at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
@@ -1191,25 +1152,25 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">info_type</span></code> reference that is associated
- with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
- exist.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(log(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> and <code class="computeroutput"><span class="identifier">info_hook</span></code>
- are used
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">info_type</span></code> reference that is associated
+ with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
+ exist.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> O(log(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">set_of</span></code> and <code class="computeroutput"><span class="identifier">info_hook</span></code>
+ are used
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.set_of_reference.__multi__set_of_views.serialization"></a><a class="link" href="set_of_reference.html#boost_bimap.reference.set_of_reference.__multi__set_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>
@@ -1229,9 +1190,9 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container.
- </li></ul></div>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1241,18 +1202,17 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> In addition to the general
- requirements, <code class="computeroutput"><span class="identifier">value_comp</span><span class="special">()</span></code> must be serialization-compatible
- with <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">value_comp</span><span class="special">()</span></code>,
- where i is the position of the ordered view in the container.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- each of the elements of <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span>
- <span class="identifier">end</span><span class="special">())</span></code>
- is a restored copy of the corresponding element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span>
- <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> In addition to the general
+ requirements, <code class="computeroutput"><span class="identifier">value_comp</span><span class="special">()</span></code> must be serialization-compatible
+ with <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">value_comp</span><span class="special">()</span></code>,
+ where i is the position of the ordered view in the container.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ each of the elements of <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span>
+ <span class="identifier">end</span><span class="special">())</span></code>
+ is a restored copy of the corresponding element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>.
+ </li>
</ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
@@ -1263,10 +1223,10 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">it</span></code>
- is a valid iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
- has been previously saved.
- </li></ul></div>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">it</span></code>
+ is a valid iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
+ has been previously saved.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1277,24 +1237,24 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- if it was dereferenceable then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>' is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>,
- otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
- <span class="special">==</span> <span class="identifier">end</span><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> It is allowed that it be a
- <code class="computeroutput"><span class="identifier">const_iterator</span></code> and
- the restored <code class="computeroutput"><span class="identifier">it</span></code>' an
- iterator, or viceversa.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ if it was dereferenceable then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>' is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>,
+ otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
+ <span class="special">==</span> <span class="identifier">end</span><span class="special">()</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> It is allowed that it be a
+ <code class="computeroutput"><span class="identifier">const_iterator</span></code> and
+ the restored <code class="computeroutput"><span class="identifier">it</span></code>'
+ an iterator, or viceversa.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -1302,7 +1262,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bimap_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bimap_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/unconstrained_set_of_reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>unconstrained_set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="vector_of_reference.html" title="vector_of Reference">
<link rel="next" href="../compiler_specifics.html" title="Compiler specifics">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="unconstrained_set_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference"></a><a class="link" href="unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">unconstrained_set_of
Reference</a>
@@ -38,7 +38,7 @@
<dt><span class="section">Serialization</span></dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/unconstrained_set_of.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.header__boost_bimap_unconstrained_set_of_hpp__synopsis" title='Header "boost/bimap/unconstrained_set_of.hpp" synopsis'>Header
"boost/bimap/unconstrained_set_of.hpp" synopsis</a>
@@ -57,7 +57,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title="unconstrained_set_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views" title="unconstrained_set_of Views">unconstrained_set_of
Views</a>
@@ -111,9 +111,7 @@
<span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="special">...</span> <span class="special">,</span> <span class="identifier">Left</span> <span class="special">></span> <span class="identifier">value_type</span><span class="special">;</span>
</pre>
-<a name="unconstrained_set_of_complexity_signature"></a><p>
- </p>
-<div class="section" title="Complexity signature">
+<a name="unconstrained_set_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.complexity_signature" title="Complexity signature">Complexity
signature</a>
@@ -126,26 +124,26 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
-</li>
+ copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
+ </li>
<li class="listitem">
- insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
-</li>
+ insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
+ </li>
<li class="listitem">
- hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
-</li>
+ hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
+ </li>
<li class="listitem">
- deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
-</li>
+ deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
+ </li>
<li class="listitem">
- replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
-</li>
+ replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
+ </li>
<li class="listitem">
- modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
-</li>
+ modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span></code>
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization"></a><a class="link" href="unconstrained_set_of_reference.html#boost_bimap.reference.unconstrained_set_of_reference.unconstrained_set_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>
@@ -165,9 +163,9 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container.
- </li></ul></div>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -176,15 +174,15 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container.
- </li></ul></div>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -192,7 +190,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="vector_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../compiler_specifics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/unordered_set_of_reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>unordered_set_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="set_of_reference.html" title="set_of Reference">
<link rel="next" href="list_of_reference.html" title="list_of Reference">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="set_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="list_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="list_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="unordered_set_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference"></a><a class="link" href="unordered_set_of_reference.html" title="unordered_set_of Reference">unordered_set_of
Reference</a>
@@ -54,7 +54,7 @@
<dt><span class="section">Serialization</span></dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/unordered_set_of.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_set_of_hpp__synopsis" title='Header "boost/bimap/unordered_set_of.hpp" synopsis'>Header
"boost/bimap/unordered_set_of.hpp" synopsis</a>
@@ -84,7 +84,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title='Header "boost/bimap/unordered_multiset_of.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.header__boost_bimap_unordered_multiset_of_hpp__synopsis" title='Header "boost/bimap/unordered_multiset_of.hpp" synopsis'>Header
"boost/bimap/unordered_multiset_of.hpp" synopsis</a>
@@ -114,7 +114,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title="Collection type specifiers unordered_set_of and unordered_multiset_of">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.collection_type_specifiers_unordered_set_of_and_unordered_multiset_of" title="Collection type specifiers unordered_set_of and unordered_multiset_of">Collection
type specifiers unordered_set_of and unordered_multiset_of</a>
@@ -125,7 +125,7 @@
coincide, thus we describe them in a grouped manner.
</p>
</div>
-<div class="section" title="unordered_[multi]set_of Views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views" title="unordered_[multi]set_of Views">unordered_[multi]set_of
Views</a>
@@ -380,9 +380,7 @@
<span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="special">...</span> <span class="special">,</span><span class="keyword">const</span> <span class="identifier">Left</span> <span class="special">></span> <span class="identifier">value_type</span><span class="special">;</span>
</pre>
-<a name="unordered_set_of_complexity_signature"></a><p>
- </p>
-<div class="section" title="Complexity signature">
+<a name="unordered_set_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.complexity_signature" title="Complexity signature">Complexity
signature</a>
@@ -395,37 +393,39 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
- </li>
+ copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
+ </li>
<li class="listitem">
- insertion: average case <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>,
- </li>
+ insertion: average case <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>,
+ </li>
<li class="listitem">
- hinted insertion: average case <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>,
- </li>
+ hinted insertion: average case <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>,
+ </li>
<li class="listitem">
- deletion: average case <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>,
- </li>
+ deletion: average case <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>,
+ </li>
<li class="listitem">
- replacement:
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ replacement:
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- if the new element key is equivalent to the original, <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span>
- <span class="special">=</span> <span class="number">1</span></code>
- (constant),
- </li>
+ if the new element key is equivalent to the original, <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span>
+ <span class="special">=</span> <span class="number">1</span></code>
+ (constant),
+ </li>
<li class="listitem">
- otherwise, average case <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span>
- <span class="special">=</span> <span class="identifier">n</span></code>,
- </li>
+ otherwise, average case <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span>
+ <span class="number">1</span></code> (constant), worst case
+ <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span>
+ <span class="special">=</span> <span class="identifier">n</span></code>,
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
- modifying: average case <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>.
- </li>
+ modifying: average case <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant), worst case <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span></code>.
+ </li>
</ul></div>
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.instantiation_types" title="Instantiation types">Instantiation
types</a>
@@ -438,19 +438,19 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">Value</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Hash</span></code> from the collection
- type specifier,
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Pred</span></code> from the collection
- type specifier.
- </li>
+ <code class="computeroutput"><span class="identifier">Hash</span></code> from the collection
+ type specifier,
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">Pred</span></code> from the collection
+ type specifier.
+ </li>
</ul></div>
<p>
<code class="computeroutput"><span class="identifier">Hash</span></code> is a <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
@@ -462,7 +462,7 @@
same value for keys equivalent under <code class="computeroutput"><span class="identifier">Pred</span></code>.
</p>
</div>
-<div class="section" title="Nested types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.nested_types"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.nested_types" title="Nested types">Nested
types</a>
@@ -472,18 +472,12 @@
<span class="identifier">local_iterator</span>
<span class="identifier">const_local_iterator</span>
</pre>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- These types are models of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html" target="_top">Forward
- Iterator</a>.
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ These types are models of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html" target="_top">Forward
+ Iterator</a>.
+ </p></blockquote></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.constructors__copy_and_assignment"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
copy and assignment</a>
@@ -498,433 +492,418 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">a</span>
- <span class="special">=</span> <span class="identifier">b</span></code>;
- where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code>
- objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- and x belong, respectively.
- </li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">a</span>
+ <span class="special">=</span> <span class="identifier">b</span></code>;
+ where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ and x belong, respectively.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="special">*</span><span class="keyword">this</span><span class="special">.</span></code>
-</li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span><span class="special">.</span></code>
+ </li>
</ul></div>
</div>
-<div class="section" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.modifiers"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
-<a name="reference_unordered_set_of_insert_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_unordered_set_of_insert_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the view belongs if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the view belongs if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- the view is non-unique OR no other element with equivalent key
- exists,
- </li>
+ the view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ AND insertion is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(I(n)).
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_insert_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_unordered_set_of_insert_iterator_value"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is used as a hint to improve the efficiency of the operation. Inserts
- <code class="computeroutput"><span class="identifier">x</span></code> into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the view belongs if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is used as a hint to improve the efficiency of the operation. Inserts
+ <code class="computeroutput"><span class="identifier">x</span></code> into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the view belongs
+ if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- the view is non-unique OR no other element with equivalent key
- exists,
- </li>
+ the view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
<li class="listitem">
- AND insertion is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ AND insertion is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> On successful insertion,
- an iterator to the newly inserted element. Otherwise, an iterator to
- an element that caused the insertion to be banned. Note that more than
- one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> On successful insertion,
+ an iterator to the newly inserted element. Otherwise, an iterator
+ to an element that caused the insertion to be banned. Note that more
+ than one element can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(H(n)).
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(H(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_insert_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">></span>
+<a name="reference_unordered_set_of_insert_iterator_iterator"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">></span>
<span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">InputIterator</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
- Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>.
- <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any views
- of the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
- is reachable from first.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">iterator</span>
- <span class="identifier">hint</span> <span class="special">=</span>
- <span class="identifier">end</span><span class="special">();</span></code><code class="computeroutput"><span class="keyword">while</span><span class="special">(</span><span class="identifier">first</span> <span class="special">!=</span>
- <span class="identifier">last</span><span class="special">)</span>
- <span class="identifier">hint</span> <span class="special">=</span>
- <span class="identifier">insert</span><span class="special">(</span><span class="identifier">hint</span><span class="special">,</span> <span class="special">*</span><span class="identifier">first</span><span class="special">++);</span></code>
-</li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(m*H(n+m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span>
- <span class="identifier">last</span><span class="special">)</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
-</ul></div>
-<a name="reference_unordered_set_of_erase_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">InputIterator</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
+ Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any
+ views of the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ to which this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
+ is reachable from first.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">iterator</span>
+ <span class="identifier">hint</span> <span class="special">=</span>
+ <span class="identifier">end</span><span class="special">();</span></code>
+ <code class="computeroutput"><span class="keyword">while</span><span class="special">(</span><span class="identifier">first</span> <span class="special">!=</span>
+ <span class="identifier">last</span><span class="special">)</span>
+ <span class="identifier">hint</span> <span class="special">=</span>
+ <span class="identifier">insert</span><span class="special">(</span><span class="identifier">hint</span><span class="special">,</span>
+ <span class="special">*</span><span class="identifier">first</span><span class="special">++);</span></code>
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(m*H(n+m)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span>
+ <span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
+</ul></div>
+<a name="reference_unordered_set_of_erase_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable <code class="computeroutput"><span class="identifier">iterator</span></code>
- of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
- to by <code class="computeroutput"><span class="identifier">position</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> An <code class="computeroutput"><span class="identifier">iterator</span></code>
- pointing to the element immediately following the one that was deleted,
- or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if no such element exists.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable <code class="computeroutput"><span class="identifier">iterator</span></code>
+ of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
+ to by <code class="computeroutput"><span class="identifier">position</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns:</strong></span> An <code class="computeroutput"><span class="identifier">iterator</span></code>
+ pointing to the element immediately following the one that was deleted,
+ or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if no such element exists.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(D(n)).
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(D(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_erase_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_erase_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">size_type</span> <span class="identifier">erase</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the elements with
- key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> Number of elements deleted.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- Average case, O(1 + m*D(n)), worst case O(n + m*D(n)), where m is the
- number of elements deleted.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the elements with
+ key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns:</strong></span> Number of elements deleted.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ Average case, O(1 + m*D(n)), worst case O(n + m*D(n)), where m is
+ the number of elements deleted.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_erase_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_unordered_set_of_erase_iterator_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
- is a valid range of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the elements in
- <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the elements in
+ <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="identifier">last</span></code>.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="identifier">last</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_replace_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_unordered_set_of_replace_iterator_value"></a><pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable <code class="computeroutput"><span class="identifier">iterator</span></code>
- of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable <code class="computeroutput"><span class="identifier">iterator</span></code>
+ of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to the element pointed to by <code class="computeroutput"><span class="identifier">position</span></code> into the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the view belongs if, for the value <code class="computeroutput"><span class="identifier">x</span></code><div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to the element pointed to by
+ <code class="computeroutput"><span class="identifier">position</span></code> into the
+ <code class="computeroutput"><span class="identifier">bimap</span></code> to which the
+ view belongs if, for the value <code class="computeroutput"><span class="identifier">x</span></code>
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- the view is non-unique OR no other element with equivalent key
- exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
- </li>
+ the view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
+ </li>
<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_replace_key_iterator_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_replace_key_iterator_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">key_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if,
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
- </li>
-<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">key_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if,
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
+ </li>
+<li class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_replace_data_iterator_data"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
+<a name="reference_unordered_set_of_replace_data_iterator_data"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleData</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">data_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if,
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
- </li>
-<li class="listitem">
- AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">data_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if,
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists (except possibly <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code>),
+ </li>
+<li class="listitem">
+ AND replacing is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_modify_key_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
+<a name="reference_unordered_set_of_modify_key_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">KeyModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">KeyModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the map view is non-unique OR no other element with equivalent
- key exists,
- </li>
-<li class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">KeyModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. Rearrangement is successful
+ if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the map view is non-unique OR no other element with equivalent
+ key exists,
+ </li>
+<li class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_modify_data_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
+<a name="reference_unordered_set_of_modify_data_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">DataModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">DataModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. Rearrangement is successful if
- <div class="itemizedlist"><ul class="itemizedlist" type="circle">
-<li class="listitem">
- the oppositte map view is non-unique OR no other element with equivalent
- key in that view exists,
- </li>
-<li class="listitem">
- AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-</ul></div>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">DataModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. Rearrangement is successful
+ if
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
+<li class="listitem">
+ the oppositte map view is non-unique OR no other element with
+ equivalent key in that view exists,
+ </li>
+<li class="listitem">
+ AND rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+</ul></div>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="unordered_set_of_reference.html#unordered_set_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="Lookup">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.lookup"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.lookup" title="Lookup">Lookup</a>
</h5></div></div></div>
@@ -950,9 +929,7 @@
<code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>
member functions.
</p>
-<a name="reference_unordered_set_of_find_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_find_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">iterator</span> <span class="identifier">find</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
@@ -960,34 +937,30 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a pointer to an element
- whose key is equivalent to <code class="computeroutput"><span class="identifier">x</span></code>,
- or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if such an element does not exist.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
- worst case O(n).
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Returns a pointer to an
+ element whose key is equivalent to <code class="computeroutput"><span class="identifier">x</span></code>,
+ or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if such an element does not exist.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
+ worst case O(n).
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_count_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_count_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">size_type</span> <span class="identifier">count</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns the number of elements
- with key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Average case O(count(x)),
- worst case O(n).
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Returns the number of elements
+ with key equivalent to <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> Average case O(count(x)),
+ worst case O(n).
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_equal_range_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_equal_range_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">></span>
<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
@@ -997,44 +970,42 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns a range containing
- all elements with keys equivalent to <code class="computeroutput"><span class="identifier">x</span></code>
- (and only those).
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Returns a range containing
+ all elements with keys equivalent to <code class="computeroutput"><span class="identifier">x</span></code>
+ (and only those).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Average case O(count(x)),
- worst case O(n).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Average case O(count(x)),
+ worst case O(n).
+ </li>
</ul></div>
</div>
-<div class="section" title="at(), info_at() and operator[] - set_of only">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.at____info_at___and_operator_______set_of_only"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.at____info_at___and_operator_______set_of_only" title="at(), info_at() and operator[] - set_of only">at(),
info_at() and operator[] - set_of only</a>
</h5></div></div></div>
-<a name="reference_unordered_set_of_at_key_const"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_at_key_const"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="keyword">const</span> <span class="identifier">data_type</span> <span class="special">&</span> <span class="identifier">at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
- with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
- exist.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
- worst case O(n).
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
+ with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
+ exist.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
+ worst case O(n).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> is used.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> is used.
+ </li>
</ul></div>
<p>
The symmetry of bimap imposes some constraints on <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> and the non constant version of at()
@@ -1042,57 +1013,52 @@
Tey are only provided if the other collection type is mutable (<code class="computeroutput"><span class="identifier">list_of</span></code>, <code class="computeroutput"><span class="identifier">vector_of</span></code>
and <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>).
</p>
-<a name="reference_unordered_set_of_operator_bracket_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_operator_bracket_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">data_type</span> <span class="special">&</span> <span class="keyword">operator</span><span class="special">[](</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">return</span>
- <span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span><span class="special">(</span><span class="identifier">k</span><span class="special">,</span><span class="identifier">data_type</span><span class="special">()))-></span><span class="identifier">second</span><span class="special">;</span></code>
-</li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> If the insertion is performed
- O(I(n)), else: Average case O(1) (constant), worst case O(n).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> is used and the
- other collection type is mutable.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">return</span>
+ <span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span><span class="special">(</span><span class="identifier">k</span><span class="special">,</span><span class="identifier">data_type</span><span class="special">()))-></span><span class="identifier">second</span><span class="special">;</span></code>
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> If the insertion is
+ performed O(I(n)), else: Average case O(1) (constant), worst case
+ O(n).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> is used and the
+ other collection type is mutable.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_at_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_at_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">data_type</span> <span class="special">&</span> <span class="identifier">at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
- with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
- exist.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
- worst case O(n).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> is used and the
- other collection type is mutable.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects: </strong></span> Returns the <code class="computeroutput"><span class="identifier">data_type</span></code> reference that is associated
+ with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
+ exist.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
+ worst case O(n).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> is used and the
+ other collection type is mutable.
+ </li>
</ul></div>
-<a name="reference_unordered_set_of_info_at_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_unordered_set_of_info_at_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="identifier">info_type</span> <span class="special">&</span> <span class="identifier">info_at</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">k</span><span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
@@ -1100,53 +1066,51 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
- is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">CompatibleKey</span></code>
+ is a compatible key of <code class="computeroutput"><span class="identifier">key_compare</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">info_type</span></code> reference that is associated
- with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
- exist.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Returns the <code class="computeroutput"><span class="identifier">info_type</span></code> reference that is associated
+ with <code class="computeroutput"><span class="identifier">k</span></code>, or throws
+ <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">out_of_range</span></code> if such key does not
+ exist.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
- worst case O(n).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Average case O(1) (constant),
+ worst case O(n).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> and <code class="computeroutput"><span class="identifier">info_hook</span></code> are used
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided when <code class="computeroutput"><span class="identifier">unordered_set_of</span></code> and <code class="computeroutput"><span class="identifier">info_hook</span></code> are used
+ </li>
</ul></div>
</div>
-<div class="section" title="Hash policy">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.hash_policy" title="Hash policy">Hash
policy</a>
</h5></div></div></div>
-<a name="reference_unordered_set_of_rehash_size"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">rehash</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">);</span>
+<a name="reference_unordered_set_of_rehash_size"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">rehash</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Increases if necessary the
- number of internal buckets so that <code class="computeroutput"><span class="identifier">size</span><span class="special">()/</span><span class="identifier">bucket_count</span><span class="special">()</span></code> does not exceed the maximum load
- factor, and <code class="computeroutput"><span class="identifier">bucket_count</span><span class="special">()>=</span><span class="identifier">n</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Increases if necessary
+ the number of internal buckets so that <code class="computeroutput"><span class="identifier">size</span><span class="special">()/</span><span class="identifier">bucket_count</span><span class="special">()</span></code> does not exceed the maximum load
+ factor, and <code class="computeroutput"><span class="identifier">bucket_count</span><span class="special">()>=</span><span class="identifier">n</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
- and references to the elements contained is preserved.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
+ and references to the elements contained is preserved.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Average case O(size()),
- worst case O(size(n)2).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Average case O(size()),
+ worst case O(size(n)2).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.serialization"></a><a class="link" href="unordered_set_of_reference.html#boost_bimap.reference.unordered_set_of_reference.unordered___multi__set_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>
@@ -1164,9 +1128,9 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container.
- </li></ul></div>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1176,18 +1140,18 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> Additionally to the general
- requirements, <code class="computeroutput"><span class="identifier">key_eq</span><span class="special">()</span></code> must be serialization-compatible
- with <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">key_eq</span><span class="special">()</span></code>,
- where i is the position of the <code class="computeroutput"><span class="identifier">unordered_</span><span class="special">[</span><span class="identifier">multi</span><span class="special">]</span><span class="identifier">set_of</span></code>
- view in the container.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">end</span><span class="special">())</span></code> contains restored copies of every
- element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>, though not necessarily in the same
- order.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> Additionally to the general
+ requirements, <code class="computeroutput"><span class="identifier">key_eq</span><span class="special">()</span></code> must be serialization-compatible
+ with <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">key_eq</span><span class="special">()</span></code>,
+ where i is the position of the <code class="computeroutput"><span class="identifier">unordered_</span><span class="special">[</span><span class="identifier">multi</span><span class="special">]</span><span class="identifier">set_of</span></code>
+ view in the container.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ the range <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">end</span><span class="special">())</span></code> contains restored copies of every
+ element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>, though not necessarily in the
+ same order.
+ </li>
</ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
@@ -1198,11 +1162,11 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">it</span></code>
- is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
- of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
- has been previously saved.
- </li></ul></div>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">it</span></code>
+ is a valid <code class="computeroutput"><span class="identifier">iterator</span></code>
+ of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
+ has been previously saved.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1213,17 +1177,17 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- if <code class="computeroutput"><span class="identifier">it</span></code> was dereferenceable
- then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>'
- is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>, otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
- <span class="special">==</span> <span class="identifier">end</span><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> It is allowed that <code class="computeroutput"><span class="identifier">it</span></code> be a <code class="computeroutput"><span class="identifier">const_iterator</span></code>
- and the restored <code class="computeroutput"><span class="identifier">it</span></code>'
- an <code class="computeroutput"><span class="identifier">iterator</span></code>, or viceversa.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ if <code class="computeroutput"><span class="identifier">it</span></code> was dereferenceable
+ then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>'
+ is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>, otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
+ <span class="special">==</span> <span class="identifier">end</span><span class="special">()</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> It is allowed that <code class="computeroutput"><span class="identifier">it</span></code> be a <code class="computeroutput"><span class="identifier">const_iterator</span></code>
+ and the restored <code class="computeroutput"><span class="identifier">it</span></code>'
+ an <code class="computeroutput"><span class="identifier">iterator</span></code>, or viceversa.
+ </li>
</ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
@@ -1233,9 +1197,9 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">it</span></code>
- is a valid local iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code> has been previously saved.
- </li></ul></div>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">it</span></code>
+ is a valid local iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code> has been previously saved.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1246,31 +1210,31 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- if <code class="computeroutput"><span class="identifier">it</span></code> was dereferenceable
- then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>'
- is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>; if <code class="computeroutput"><span class="identifier">it</span></code>
- was <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
- for some n, then <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
- <span class="special">==</span> <span class="identifier">m</span></code>'<code class="computeroutput"><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code> (where <code class="computeroutput"><span class="identifier">b</span></code>
- is the original <code class="computeroutput"><span class="identifier">bimap</span></code>,
- <code class="computeroutput"><span class="identifier">b</span></code>' its restored copy
- and <code class="computeroutput"><span class="identifier">i</span></code> is the ordinal
- of the index.)
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> It is allowed that <code class="computeroutput"><span class="identifier">it</span></code> be a <code class="computeroutput"><span class="identifier">const_local_iterator</span></code>
- and the restored <code class="computeroutput"><span class="identifier">it</span></code>'
- a <code class="computeroutput"><span class="identifier">local_iterator</span></code>, or
- viceversa.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ if <code class="computeroutput"><span class="identifier">it</span></code> was dereferenceable
+ then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>'
+ is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>; if <code class="computeroutput"><span class="identifier">it</span></code>
+ was <code class="computeroutput"><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
+ for some n, then <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput">
+ <span class="special">==</span> <span class="identifier">m</span></code>'<code class="computeroutput"><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code> (where <code class="computeroutput"><span class="identifier">b</span></code>
+ is the original <code class="computeroutput"><span class="identifier">bimap</span></code>,
+ <code class="computeroutput"><span class="identifier">b</span></code>' its restored copy
+ and <code class="computeroutput"><span class="identifier">i</span></code> is the ordinal
+ of the index.)
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> It is allowed that <code class="computeroutput"><span class="identifier">it</span></code> be a <code class="computeroutput"><span class="identifier">const_local_iterator</span></code>
+ and the restored <code class="computeroutput"><span class="identifier">it</span></code>'
+ a <code class="computeroutput"><span class="identifier">local_iterator</span></code>,
+ or viceversa.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -1278,7 +1242,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="set_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="list_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="set_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="list_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/reference/vector_of_reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>vector_of Reference</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../reference.html" title="Reference">
<link rel="prev" href="list_of_reference.html" title="list_of Reference">
<link rel="next" href="unconstrained_set_of_reference.html" title="unconstrained_set_of Reference">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="list_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="list_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="vector_of Reference">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.reference.vector_of_reference"></a><a class="link" href="vector_of_reference.html" title="vector_of Reference">vector_of
Reference</a>
@@ -49,7 +49,7 @@
<dt><span class="section">Serialization</span></dt>
</dl></dd>
</dl></div>
-<div class="section" title='Header "boost/bimap/vector_of.hpp" synopsis'>
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.header__boost_bimap_vector_of_hpp__synopsis" title='Header "boost/bimap/vector_of.hpp" synopsis'>Header
"boost/bimap/vector_of.hpp" synopsis</a>
@@ -68,7 +68,7 @@
</span><span class="special">}</span> <span class="comment">// namespace boost
</span></pre>
</div>
-<div class="section" title="vector_of views">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views" title="vector_of views">vector_of
views</a>
@@ -109,18 +109,18 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- vector_of views are not Assignable
- (like any other view.)
- </li>
-<li class="listitem">
- Insertions into a vector_of view may fail due to clashings with other
- views. This alters the semantics of the operations provided with respect
- to their analogues in STL sequence containers.
- </li>
-<li class="listitem">
- Elements in a vector_of view are not mutable, and can only be changed
- by means of replace and modify member functions.
- </li>
+ vector_of views are not Assignable
+ (like any other view.)
+ </li>
+<li class="listitem">
+ Insertions into a vector_of view may fail due to clashings with other
+ views. This alters the semantics of the operations provided with respect
+ to their analogues in STL sequence containers.
+ </li>
+<li class="listitem">
+ Elements in a vector_of view are not mutable, and can only be changed
+ by means of replace and modify member functions.
+ </li>
</ul></div>
<p>
Having these restrictions into account, vector of views are models of
@@ -321,9 +321,7 @@
<span class="keyword">typedef</span> <span class="identifier">signature</span><span class="special">-</span><span class="identifier">compatible</span> <span class="identifier">with</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="special">...</span> <span class="special">,</span> <span class="identifier">Left</span> <span class="special">></span> <span class="identifier">value_type</span><span class="special">;</span>
</pre>
-<a name="vector_of_complexity_signature"></a><p>
- </p>
-<div class="section" title="Complexity signature">
+<a name="vector_of_complexity_signature"></a><div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.complexity_signature" title="Complexity signature">Complexity
signature</a>
@@ -336,26 +334,28 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
- </li>
-<li class="listitem">
- insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (amortized
- constant),
- </li>
-<li class="listitem">
- hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (amortized constant),
- </li>
-<li class="listitem">
- deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">m</span></code>,
- where m is the distance from the deleted element to the end of the
- sequence,
- </li>
-<li class="listitem">
- replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant),
- </li>
+ copying: <code class="computeroutput"><span class="identifier">c</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">n</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>,
+ </li>
<li class="listitem">
- modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (constant).
- </li>
+ insertion: <code class="computeroutput"><span class="identifier">i</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (amortized constant),
+ </li>
+<li class="listitem">
+ hinted insertion: <code class="computeroutput"><span class="identifier">h</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code> (amortized constant),
+ </li>
+<li class="listitem">
+ deletion: <code class="computeroutput"><span class="identifier">d</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">m</span></code>,
+ where m is the distance from the deleted element to the end of the
+ sequence,
+ </li>
+<li class="listitem">
+ replacement: <code class="computeroutput"><span class="identifier">r</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant),
+ </li>
+<li class="listitem">
+ modifying: <code class="computeroutput"><span class="identifier">m</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span> <span class="special">=</span> <span class="number">1</span></code>
+ (constant).
+ </li>
</ul></div>
<p>
The following expressions are also used as a convenience for writing
@@ -375,7 +375,7 @@
and <span class="emphasis"><em>relocate</em></span>, respectively.)
</p>
</div>
-<div class="section" title="Instantiation types">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.instantiation_types" title="Instantiation types">Instantiation
types</a>
@@ -388,14 +388,14 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Value</span></code> from <code class="computeroutput"><span class="identifier">vector_of</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">Value</span></code> from <code class="computeroutput"><span class="identifier">vector_of</span></code>,
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
- </li>
+ <code class="computeroutput"><span class="identifier">Allocator</span></code> from <code class="computeroutput"><span class="identifier">bimap</span></code>,
+ </li>
</ul></div>
</div>
-<div class="section" title="Constructors, copy and assignment">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.constructors__copy_and_assignment"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.constructors__copy_and_assignment" title="Constructors, copy and assignment">Constructors,
copy and assignment</a>
@@ -408,492 +408,455 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">a</span><span class="special">=</span><span class="identifier">b</span><span class="special">;</span></code> where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code> objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
- and <code class="computeroutput"><span class="identifier">x</span></code> belong, respectively.
- </li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">a</span><span class="special">=</span><span class="identifier">b</span><span class="special">;</span></code> where a and b are the <code class="computeroutput"><span class="identifier">bimap</span></code> objects to which <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>
+ and <code class="computeroutput"><span class="identifier">x</span></code> belong, respectively.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="special">*</span><span class="keyword">this</span></code>.
+ </li>
</ul></div>
-<a name="reference_vector_of_assign_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
+<a name="reference_vector_of_assign_iterator_iterator"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">assign</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">InputIterator</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
- Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
- or a type convertible to <code class="computeroutput"><span class="identifier">value_type</span></code>.
- <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any view
- of the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
- is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">InputIterator</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
+ Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
+ or a type convertible to <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any
+ view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ to which this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">);</span></code>
-</li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">);</span></code>
+ </li>
</ul></div>
-<a name="reference_vector_of_assign_size_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">assign</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
+<a name="reference_vector_of_assign_size_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">assign</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
- <span class="identifier">i</span> <span class="special">=</span>
- <span class="number">0</span><span class="special">;</span>
- <span class="identifier">i</span> <span class="special"><</span>
- <span class="identifier">n</span><span class="special">;</span>
- <span class="special">++</span><span class="identifier">n</span><span class="special">)</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">v</span><span class="special">);</span></code>
-</li></ul></div>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="identifier">clear</span><span class="special">();</span> <span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
+ <span class="identifier">i</span> <span class="special">=</span>
+ <span class="number">0</span><span class="special">;</span>
+ <span class="identifier">i</span> <span class="special"><</span>
+ <span class="identifier">n</span><span class="special">;</span>
+ <span class="special">++</span><span class="identifier">n</span><span class="special">)</span> <span class="identifier">push_back</span><span class="special">(</span><span class="identifier">v</span><span class="special">);</span></code>
+ </li></ul></div>
</div>
-<div class="section" title="Capacity operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.capacity_operations" title="Capacity operations">Capacity
operations</a>
</h5></div></div></div>
-<a name="reference_vector_of_capacity"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">size_type</span> <span class="identifier">capacity</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+<a name="reference_vector_of_capacity"></a><pre class="programlisting"><span class="identifier">size_type</span> <span class="identifier">capacity</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The total number of elements
- <code class="computeroutput"><span class="identifier">c</span></code> such that, when
- <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span>
- <span class="special"><</span> <span class="identifier">c</span></code>,
- back insertions happen in constant time (the general case as described
- by i(n) is <span class="emphasis"><em>amortized</em></span> constant time.)
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The total number of elements
+ <code class="computeroutput"><span class="identifier">c</span></code> such that, when
+ <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span>
+ <span class="special"><</span> <span class="identifier">c</span></code>,
+ back insertions happen in constant time (the general case as described
+ by i(n) is <span class="emphasis"><em>amortized</em></span> constant time.)
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Validity of iterators and references
- to elements is preserved in all insertions, regardless of the capacity
- status.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Validity of iterators and
+ references to elements is preserved in all insertions, regardless
+ of the capacity status.
+ </li>
</ul></div>
-<a name="reference_vector_of_reserve_size"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">m</span><span class="special">);</span>
+<a name="reference_vector_of_reserve_size"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">m</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> If the previous value of
- <code class="computeroutput"><span class="identifier">capacity</span><span class="special">()</span></code>
- was greater than or equal to <code class="computeroutput"><span class="identifier">m</span></code>,
- nothing is done; otherwise, the internal capacity is changed so that
- <code class="computeroutput"><span class="identifier">capacity</span><span class="special">()>=</span><span class="identifier">m</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> If the previous value of
+ <code class="computeroutput"><span class="identifier">capacity</span><span class="special">()</span></code>
+ was greater than or equal to <code class="computeroutput"><span class="identifier">m</span></code>,
+ nothing is done; otherwise, the internal capacity is changed so that
+ <code class="computeroutput"><span class="identifier">capacity</span><span class="special">()>=</span><span class="identifier">m</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> If the capacity is not
- changed, constant; otherwise O(n).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> If the capacity is not
+ changed, constant; otherwise O(n).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If the capacity
- is not changed, nothrow; otherwise, strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> If the capacity
+ is not changed, nothrow; otherwise, strong.
+ </li>
</ul></div>
-<a name="reference_vector_of_resize_size_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span> <span class="special">=</span> <span class="identifier">value_type</span><span class="special">());</span>
+<a name="reference_vector_of_resize_size_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">resize</span><span class="special">(</span><span class="identifier">size_type</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span> <span class="special">=</span> <span class="identifier">value_type</span><span class="special">());</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span> <span class="special">></span> <span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span>
- <span class="identifier">n</span><span class="special">-</span><span class="identifier">size</span><span class="special">(),</span>
- <span class="identifier">x</span><span class="special">);</span></code><code class="computeroutput"><span class="keyword">else</span> <span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span><span class="special"><</span><span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">begin</span><span class="special">()+</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">end</span><span class="special">());</span></code>
-</li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span> <span class="special">></span> <span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">end</span><span class="special">(),</span>
+ <span class="identifier">n</span><span class="special">-</span><span class="identifier">size</span><span class="special">(),</span>
+ <span class="identifier">x</span><span class="special">);</span></code>
+ <code class="computeroutput"><span class="keyword">else</span> <span class="keyword">if</span><span class="special">(</span> <span class="identifier">n</span><span class="special"><</span><span class="identifier">size</span><span class="special">()</span> <span class="special">)</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">begin</span><span class="special">()+</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">end</span><span class="special">());</span></code>
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> If an expansion is requested,
- the size of the view is not guaranteed to be n after this operation
- (other views may ban insertions.)
- </li>
+ <span class="bold"><strong>Note:</strong></span> If an expansion is requested,
+ the size of the view is not guaranteed to be n after this operation
+ (other views may ban insertions.)
+ </li>
</ul></div>
</div>
-<div class="section" title="Modifiers">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.modifiers"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.modifiers" title="Modifiers">Modifiers</a>
</h5></div></div></div>
-<a name="reference_vector_of_push_front_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_front</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_vector_of_push_front_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_front</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts x at the beginning
- of the sequence if no other view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
- bans the insertion.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts x at the beginning
+ of the sequence if no other view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ bans the insertion.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n+I(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n+I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_vector_of_push_back_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_back</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_vector_of_push_back_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">push_back</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
- at the end of the sequence if no other view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
- bans the insertion.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
+ at the end of the sequence if no other view of the <code class="computeroutput"><span class="identifier">bimap</span></code> bans the insertion.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(I(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_vector_of_insert_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_vector_of_insert_iterator_value"></a><pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="keyword">bool</span><span class="special">></span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
- before position if insertion is allowed by all other views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts <code class="computeroutput"><span class="identifier">x</span></code>
+ before position if insertion is allowed by all other views of the
+ <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> The return value is a pair
- <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code>
- is <code class="computeroutput"><span class="keyword">true</span></code> if and only if
- insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to the element inserted; otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code>
- points to an element that caused the insertion to be banned. Note that
- more than one element can be causing insertion not to be allowed.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> The return value is a pair
+ <code class="computeroutput"><span class="identifier">p</span></code>. <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>
+ if and only if insertion took place. On successful insertion, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to the element inserted;
+ otherwise, <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> points to an element that
+ caused the insertion to be banned. Note that more than one element
+ can be causing insertion not to be allowed.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(shl(end()-position,1) + I(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(shl(end()-position,1) + I(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong.
+ </li>
</ul></div>
-<a name="reference_vector_of_insert_iterator_size_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="identifier">m</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_vector_of_insert_iterator_size_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">size_type</span> <span class="identifier">m</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
- <span class="identifier">i</span> <span class="special">=</span>
- <span class="number">0</span><span class="special">;</span>
- <span class="identifier">i</span> <span class="special"><</span>
- <span class="identifier">m</span><span class="special">;</span>
- <span class="special">++</span><span class="identifier">i</span><span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,</span> <span class="identifier">x</span><span class="special">);</span></code>
-</li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">for</span><span class="special">(</span><span class="identifier">size_type</span>
+ <span class="identifier">i</span> <span class="special">=</span>
+ <span class="number">0</span><span class="special">;</span>
+ <span class="identifier">i</span> <span class="special"><</span>
+ <span class="identifier">m</span><span class="special">;</span>
+ <span class="special">++</span><span class="identifier">i</span><span class="special">)</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,</span> <span class="identifier">x</span><span class="special">);</span></code>
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(shl(end()-position,m) + m*I(n+m)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(shl(end()-position,m) + m*I(n+m)).
+ </li>
</ul></div>
-<a name="reference_vector_of_insert_iterator_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
+<a name="reference_vector_of_insert_iterator_iterator_iterator"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">InputIterator</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">insert</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">InputIterator</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
- Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
- or a type convertible to <code class="computeroutput"><span class="identifier">value_type</span></code>.
- <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any view
- of the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
- is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">InputIterator</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html" target="_top">Input
+ Iterator</a> over elements of type <code class="computeroutput"><span class="identifier">value_type</span></code>
+ or a type convertible to <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code> are not iterators into any
+ view of the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ to which this view belongs. <code class="computeroutput"><span class="identifier">last</span></code>
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects: </strong></span><code class="computeroutput"><span class="keyword">while</span><span class="special">(</span><span class="identifier">first</span><span class="special">!=</span><span class="identifier">last</span><span class="special">)</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,*</span><span class="identifier">first</span><span class="special">++);</span></code>
-</li>
+ <span class="bold"><strong>Effects: </strong></span> <code class="computeroutput"><span class="keyword">while</span><span class="special">(</span><span class="identifier">first</span><span class="special">!=</span><span class="identifier">last</span><span class="special">)</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">position</span><span class="special">,*</span><span class="identifier">first</span><span class="special">++);</span></code>
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(shl(end()-position,m) + m*I(n+m)), where m is the number of elements
- in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(shl(end()-position,m) + m*I(n+m)), where m is the number of elements
+ in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_erase_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
+<a name="reference_vector_of_erase_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
- to by <code class="computeroutput"><span class="identifier">position</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the element pointed
+ to by <code class="computeroutput"><span class="identifier">position</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> An iterator pointing to the
- element immediately following the one that was deleted, or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
- if no such element exists.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> An iterator pointing to
+ the element immediately following the one that was deleted, or <code class="computeroutput"><span class="identifier">end</span><span class="special">()</span></code>
+ if no such element exists.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(D(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(D(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_vector_of_erase_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_vector_of_erase_iterator_iterator"></a><pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">erase</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
- is a valid range of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
+ is a valid range of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Deletes the elements in
- <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Deletes the elements in
+ <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns:</strong></span> last.
- </li>
+ <span class="bold"><strong>Returns:</strong></span> last.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(m*D(n)), where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_vector_of_replace_iterator_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_vector_of_replace_iterator_value"></a><pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">replace</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value x to the
- element pointed to by position into the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the view belongs if replacing is allowed by all other views
- of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value x to
+ the element pointed to by position into the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ to which the view belongs if replacing is allowed by all other views
+ of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_vector_of_replace_key_iterator_key"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
+<a name="reference_vector_of_replace_key_iterator_key"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleKey</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">key_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if replacing is allowed by all other views of
- the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">key_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if replacing is allowed by all other views
+ of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_vector_of_replace_data_iterator_data"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
+<a name="reference_vector_of_replace_data_iterator_data"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">replace_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">CompatibleData</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
- <code class="computeroutput"><span class="identifier">data_type</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
- where <code class="computeroutput"><span class="identifier">e</span></code> is the element
- pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
- into the <code class="computeroutput"><span class="identifier">bimap</span></code> to which
- the set view belongs if replacing is allowed by all other views of
- the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of position
- is preserved in all cases.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(R(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Strong. If an exception
- is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code>
- to which the set view belongs remains in its original state.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the set view. <code class="computeroutput"><span class="identifier">CompatibleKey</span></code> can be assigned to
+ <code class="computeroutput"><span class="identifier">data_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Assigns the value <code class="computeroutput"><span class="identifier">x</span></code> to <code class="computeroutput"><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span></code>,
+ where <code class="computeroutput"><span class="identifier">e</span></code> is the element
+ pointed to by <code class="computeroutput"><span class="identifier">position</span></code>
+ into the <code class="computeroutput"><span class="identifier">bimap</span></code> to
+ which the set view belongs if replacing is allowed by all other views
+ of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of position
+ is preserved in all cases.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the replacement took place, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(R(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Strong. If an
+ exception is thrown by some user-provided operation, the <code class="computeroutput"><span class="identifier">bimap</span></code> to which the set view belongs
+ remains in its original state.
+ </li>
</ul></div>
-<a name="reference_vector_of_modify_key_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
+<a name="reference_vector_of_modify_key_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">KeyModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_key</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">KeyModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">KeyModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. It is successful if the rearrangement
- is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">KeyModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">key_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">first</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. It is successful if the
+ rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
-<a name="reference_vector_of_modify_data_iterator_modifier"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
+<a name="reference_vector_of_modify_data_iterator_modifier"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">DataModifier</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">modify_data</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">DataModifier</span> <span class="identifier">mod</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">DataModifier</span></code>
- is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
- Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
- by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of the
- <code class="computeroutput"><span class="identifier">bimap</span></code>. If the rearrangement
- fails, the element is erased. It is successful if the rearrangement
- is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
- succeeds.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Returns: </strong></span><code class="computeroutput"><span class="keyword">true</span></code>
- if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
- otherwise.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(M(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
- is thrown by some user-provided operation (except possibly mod), then
- the element pointed to by position is erased.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">DataModifier</span></code>
+ is a model of <a href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">Unary
+ Function</a> accepting arguments of type: <code class="computeroutput"><span class="identifier">data_type</span><span class="special">&</span></code>; <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Calls <code class="computeroutput"><span class="identifier">mod</span><span class="special">(</span><span class="identifier">e</span><span class="special">.</span><span class="identifier">second</span><span class="special">)</span></code> where e is the element pointed to
+ by position and rearranges <code class="computeroutput"><span class="special">*</span><span class="identifier">position</span></code> into all the views of
+ the <code class="computeroutput"><span class="identifier">bimap</span></code>. If the
+ rearrangement fails, the element is erased. It is successful if the
+ rearrangement is allowed by all other views of the <code class="computeroutput"><span class="identifier">bimap</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of <code class="computeroutput"><span class="identifier">position</span></code> is preserved if the operation
+ succeeds.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Returns: </strong></span> <code class="computeroutput"><span class="keyword">true</span></code>
+ if the operation succeeded, <code class="computeroutput"><span class="keyword">false</span></code>
+ otherwise.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(M(n)).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic. If an exception
+ is thrown by some user-provided operation (except possibly mod),
+ then the element pointed to by position is erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> Only provided for map views.
- </li>
+ <span class="bold"><strong>Note:</strong></span> Only provided for map views.
+ </li>
</ul></div>
</div>
-<div class="section" title="List operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.list_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.list_operations" title="List operations">List
operations</a>
@@ -905,315 +868,297 @@
operations exactly matches those of <code class="computeroutput"><span class="identifier">list_of</span></code>
views, but the associated complexity bounds differ in general.
</p>
-<a name="reference_vector_of_splice_iterator_this"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+<a name="reference_vector_of_splice_iterator_this"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">!=</span><span class="keyword">this</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">!=</span><span class="keyword">this</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts the contents of
- <code class="computeroutput"><span class="identifier">x</span></code> before position,
- in the same order as they were in <code class="computeroutput"><span class="identifier">x</span></code>.
- Those elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts the contents of
+ <code class="computeroutput"><span class="identifier">x</span></code> before position,
+ in the same order as they were in <code class="computeroutput"><span class="identifier">x</span></code>.
+ Those elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(shl(end()-position,x.size()) + x.size()*I(n+x.size()) + x.size()*D(x.size())).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(shl(end()-position,x.size()) + x.size()*I(n+x.size()) + x.size()*D(x.size())).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_splice_iterator_this_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span><span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
+<a name="reference_vector_of_splice_iterator_this_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span><span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
- is a valid dereferenceable iterator <code class="computeroutput"><span class="identifier">x</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
+ is a valid dereferenceable iterator <code class="computeroutput"><span class="identifier">x</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
- to by <code class="computeroutput"><span class="identifier">i</span></code> before <code class="computeroutput"><span class="identifier">position</span></code>: if insertion is successful,
- the element is erased from <code class="computeroutput"><span class="identifier">x</span></code>.
- In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no copy or deletion is performed,
- and the operation is always successful. If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>,
- no operation is performed.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
+ to by <code class="computeroutput"><span class="identifier">i</span></code> before <code class="computeroutput"><span class="identifier">position</span></code>: if insertion is successful,
+ the element is erased from <code class="computeroutput"><span class="identifier">x</span></code>.
+ In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no copy or deletion is performed,
+ and the operation is always successful. If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>,
+ no operation is performed.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no iterator or reference is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no iterator or reference is invalidated.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- O(rel(position,i,i+1)); otherwise O(shl(end()-position,1) + I(n) +
- D(n)).
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ O(rel(position,i,i+1)); otherwise O(shl(end()-position,1) + I(n)
+ + D(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, strong.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, strong.
+ </li>
</ul></div>
-<a name="reference_vector_of_splice_iterator_this_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_vector_of_splice_iterator_this_iterator_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">splice</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
- and <code class="computeroutput"><span class="identifier">last</span></code> are valid
- iterators of <code class="computeroutput"><span class="identifier">x</span></code>. <code class="computeroutput"><span class="identifier">last</span></code> is reachable from <code class="computeroutput"><span class="identifier">first</span></code>. <code class="computeroutput"><span class="identifier">position</span></code>
- is not in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
+ and <code class="computeroutput"><span class="identifier">last</span></code> are valid
+ iterators of <code class="computeroutput"><span class="identifier">x</span></code>.
+ <code class="computeroutput"><span class="identifier">last</span></code> is reachable
+ from <code class="computeroutput"><span class="identifier">first</span></code>. <code class="computeroutput"><span class="identifier">position</span></code> is not in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> For each element in the range
- <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>, insertion is tried before <code class="computeroutput"><span class="identifier">position</span></code>; if the operation is successful,
- the element is erased from <code class="computeroutput"><span class="identifier">x</span></code>.
- In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no copy or deletion is performed,
- and insertions are always successful.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> For each element in the
+ range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>, insertion is tried before <code class="computeroutput"><span class="identifier">position</span></code>; if the operation is successful,
+ the element is erased from <code class="computeroutput"><span class="identifier">x</span></code>.
+ In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no copy or deletion is performed,
+ and insertions are always successful.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no iterator or reference is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no iterator or reference is invalidated.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- O(rel(position,first,last)); otherwise O(shl(end()-position,m) + m*I(n+m)
- + m*D(x.size())) where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ O(rel(position,first,last)); otherwise O(shl(end()-position,m) +
+ m*I(n+m) + m*D(x.size())) where m is the number of elements in <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_remove_value"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
+<a name="reference_vector_of_remove_value"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">remove</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">value_type</span> <span class="special">&</span> <span class="identifier">value</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Erases all elements of the
- view which compare equal to <code class="computeroutput"><span class="identifier">value</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Erases all elements of
+ the view which compare equal to <code class="computeroutput"><span class="identifier">value</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_remove_if_predicate"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Predicate</span> <span class="special">></span>
+<a name="reference_vector_of_remove_if_predicate"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Predicate</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">Predicate</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Erases all elements <code class="computeroutput"><span class="identifier">x</span></code> of the view for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- holds.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Erases all elements <code class="computeroutput"><span class="identifier">x</span></code> of the view for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+ holds.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_unique"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">unique</span><span class="special">();</span>
+<a name="reference_vector_of_unique"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">unique</span><span class="special">();</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Eliminates all but the first
- element from every consecutive group of equal elements referred to
- by the iterator <code class="computeroutput"><span class="identifier">i</span></code> in
- the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">+</span><span class="number">1</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
- for which <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span><span class="special">==*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Eliminates all but the
+ first element from every consecutive group of equal elements referred
+ to by the iterator <code class="computeroutput"><span class="identifier">i</span></code>
+ in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">+</span><span class="number">1</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code> for which <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span><span class="special">==*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_unique_predicate"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> <span class="special">></span>
+<a name="reference_vector_of_unique_predicate"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">unique</span><span class="special">(</span><span class="identifier">BinaryPredicate</span> <span class="identifier">binary_pred</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Eliminates all but the first
- element from every consecutive group of elements referred to by the
- iterator i in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">+</span><span class="number">1</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code> for which <code class="computeroutput"><span class="identifier">binary_pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">,</span> <span class="special">*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">))</span></code> holds.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- O(n + m*D(n)), where m is the number of elements erased.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
-</ul></div>
-<a name="reference_vector_of_merge_this"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">merge</span><span class="special">(</span><span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
+ <span class="bold"><strong>Effects:</strong></span> Eliminates all but the
+ first element from every consecutive group of elements referred to
+ by the iterator i in the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">+</span><span class="number">1</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>
+ for which <code class="computeroutput"><span class="identifier">binary_pred</span><span class="special">(*</span><span class="identifier">i</span><span class="special">,</span> <span class="special">*(</span><span class="identifier">i</span><span class="special">-</span><span class="number">1</span><span class="special">))</span></code>
+ holds.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ O(n + m*D(n)), where m is the number of elements erased.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
+</ul></div>
+<a name="reference_vector_of_merge_this"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">merge</span><span class="special">(</span><span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
- Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted according to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Attempts to insert every
- element of x into the corresponding position of the view (according
- to the order). Elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>. The resulting sequence is stable,
- i.e. equivalent elements of either container preserve their relative
- position. In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no operation is performed.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Elements in the view
- and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted. Validity of iterators to the view and of non-erased elements
- of <code class="computeroutput"><span class="identifier">x</span></code> references is
- preserved.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- constant; otherwise O(n + x.size()*I(n+x.size()) + x.size()*D(x.size())).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, basic.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted according to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Attempts to insert every
+ element of x into the corresponding position of the view (according
+ to the order). Elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>. The resulting sequence is stable,
+ i.e. equivalent elements of either container preserve their relative
+ position. In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>, no operation is performed.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Elements in the
+ view and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted. Validity of iterators to the view and of non-erased elements
+ of <code class="computeroutput"><span class="identifier">x</span></code> references is
+ preserved.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ constant; otherwise O(n + x.size()*I(n+x.size()) + x.size()*D(x.size())).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_merge_this_compare"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Compare</span> <span class="special">></span>
+<a name="reference_vector_of_merge_this_compare"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Compare</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">merge</span><span class="special">(</span><span class="identifier">this_type</span> <span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">Compare</span> <span class="identifier">comp</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">Compare</span></code>
- is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
- Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted according to comp.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Attempts to insert every
- element of <code class="computeroutput"><span class="identifier">x</span></code> into the
- corresponding position of the view (according to <code class="computeroutput"><span class="identifier">comp</span></code>).
- Elements successfully inserted are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
- The resulting sequence is stable, i.e. equivalent elements of either
- container preserve their relative position. In the special case <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- no operation is performed.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Elements in the view
- and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
- are sorted according to <code class="computeroutput"><span class="identifier">comp</span></code>.
- Validity of iterators to the view and of non-erased elements of <code class="computeroutput"><span class="identifier">x</span></code> references is preserved.
- </li>
-<li class="listitem">
-<a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
- If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- constant; otherwise O(n + x.size()*I(n+x.size()) + x.size()*D(x.size())).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
- nothrow; otherwise, basic.
- </li>
-</ul></div>
-<a name="reference_vector_of_sort"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">sort</span><span class="special">();</span>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">Compare</span></code>
+ is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ Both the view and <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted according to comp.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Attempts to insert every
+ element of <code class="computeroutput"><span class="identifier">x</span></code> into
+ the corresponding position of the view (according to <code class="computeroutput"><span class="identifier">comp</span></code>). Elements successfully inserted
+ are erased from <code class="computeroutput"><span class="identifier">x</span></code>.
+ The resulting sequence is stable, i.e. equivalent elements of either
+ container preserve their relative position. In the special case
+ <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ no operation is performed.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Elements in the
+ view and remaining elements in <code class="computeroutput"><span class="identifier">x</span></code>
+ are sorted according to <code class="computeroutput"><span class="identifier">comp</span></code>.
+ Validity of iterators to the view and of non-erased elements of
+ <code class="computeroutput"><span class="identifier">x</span></code> references is preserved.
+ </li>
+<li class="listitem">
+ <a class="link" href="vector_of_reference.html#vector_of_complexity_signature"><span class="bold"><strong>Complexity:</strong></span></a>
+ If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ constant; otherwise O(n + x.size()*I(n+x.size()) + x.size()*D(x.size())).
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Exception safety:</strong></span> If <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span><span class="special">==</span><span class="keyword">this</span></code>,
+ nothrow; otherwise, basic.
+ </li>
+</ul></div>
+<a name="reference_vector_of_sort"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">sort</span><span class="special">();</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code> is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Effects:</strong></span> Sorts the view according
+ to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
+ The sorting is stable, i.e. equivalent elements preserve their relative
+ position.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Sorts the view according
- to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">value_type</span><span class="special">></span></code>.
- The sorting is stable, i.e. equivalent elements preserve their relative
- position.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
- and references is preserved.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
- </li>
-<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_sort_compare"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Compare</span> <span class="special">></span>
+<a name="reference_vector_of_sort_compare"></a><pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Compare</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">Compare</span> <span class="identifier">comp</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
- Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> Compare is a <a href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html" target="_top">Strict
+ Weak Ordering</a> over <code class="computeroutput"><span class="identifier">value_type</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Sorts the view according
- to <code class="computeroutput"><span class="identifier">comp</span></code>. The sorting
- is stable, i.e. equivalent elements preserve their relative position.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Sorts the view according
+ to <code class="computeroutput"><span class="identifier">comp</span></code>. The sorting
+ is stable, i.e. equivalent elements preserve their relative position.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
- and references is preserved.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(n*log(n)).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> Basic.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> Basic.
+ </li>
</ul></div>
-<a name="reference_vector_of_reverse"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">reverse</span><span class="special">();</span>
+<a name="reference_vector_of_reverse"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">reverse</span><span class="special">();</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Reverses the order of the
- elements in the view.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Reverses the order of the
+ elements in the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
- and references is preserved.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> Validity of iterators
+ and references is preserved.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> O(n).
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> O(n).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Rearrange operations">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.rearrange_operations" title="Rearrange operations">Rearrange
operations</a>
@@ -1223,62 +1168,59 @@
(although splice provides partially overlapping functionality), perform
individual and global repositioning of elements inside the index.
</p>
-<a name="reference_vector_of_relocate_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
+<a name="reference_vector_of_relocate_iterator_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">i</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
- is a valid dereferenceable iterator of the view.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">i</span></code>
+ is a valid dereferenceable iterator of the view.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
- to by <code class="computeroutput"><span class="identifier">i</span></code> before <code class="computeroutput"><span class="identifier">position</span></code>. If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>,
- no operation is performed.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> Inserts the element pointed
+ to by <code class="computeroutput"><span class="identifier">i</span></code> before <code class="computeroutput"><span class="identifier">position</span></code>. If <code class="computeroutput"><span class="identifier">position</span><span class="special">==</span><span class="identifier">i</span></code>,
+ no operation is performed.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
- is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
-<a name="reference_vector_of_relocate_iterator_iterator_iterator"></a><p>
- </p>
-<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
+<a name="reference_vector_of_relocate_iterator_iterator_iterator"></a><pre class="programlisting"><span class="keyword">void</span> <span class="identifier">relocate</span><span class="special">(</span><span class="identifier">iterator</span> <span class="identifier">position</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">iterator</span> <span class="identifier">last</span><span class="special">);</span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">position</span></code>
- is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
- and <code class="computeroutput"><span class="identifier">last</span></code> are valid
- iterators of the view. <code class="computeroutput"><span class="identifier">last</span></code>
- is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
- <code class="computeroutput"><span class="identifier">position</span></code> is not in
- the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
- </li>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">position</span></code>
+ is a valid iterator of the view. <code class="computeroutput"><span class="identifier">first</span></code>
+ and <code class="computeroutput"><span class="identifier">last</span></code> are valid
+ iterators of the view. <code class="computeroutput"><span class="identifier">last</span></code>
+ is reachable from <code class="computeroutput"><span class="identifier">first</span></code>.
+ <code class="computeroutput"><span class="identifier">position</span></code> is not in
+ the range <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Effects:</strong></span> The range of elements <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code> is repositioned just before <code class="computeroutput"><span class="identifier">position</span></code>.
- </li>
+ <span class="bold"><strong>Effects:</strong></span> The range of elements
+ <code class="computeroutput"><span class="special">[</span><span class="identifier">first</span><span class="special">,</span><span class="identifier">last</span><span class="special">)</span></code> is repositioned just before <code class="computeroutput"><span class="identifier">position</span></code>.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
- is invalidated.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> No iterator or reference
+ is invalidated.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Complexity:</strong></span> Constant.
- </li>
+ <span class="bold"><strong>Complexity:</strong></span> Constant.
+ </li>
<li class="listitem">
-<span class="bold"><strong>Exception safety:</strong></span> nothrow.
- </li>
+ <span class="bold"><strong>Exception safety:</strong></span> nothrow.
+ </li>
</ul></div>
</div>
-<div class="section" title="Serialization">
+<div class="section">
<div class="titlepage"><div><div><h5 class="title">
<a name="boost_bimap.reference.vector_of_reference.vector_of_views.serialization"></a><a class="link" href="vector_of_reference.html#boost_bimap.reference.vector_of_reference.vector_of_views.serialization" title="Serialization">Serialization</a>
</h5></div></div></div>
@@ -1298,9 +1240,9 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container.
- </li></ul></div>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1310,19 +1252,17 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Requires:</strong></span> No additional requirements
- to those imposed by the container.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- each of the elements of <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span>
- <span class="identifier">end</span><span class="special">())</span></code>
- is a restored copy of the corresponding element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span>
- <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>,
- where <code class="computeroutput"><span class="identifier">i</span></code> is the position
- of the <code class="computeroutput"><span class="identifier">vector_of</span></code> view
- in the container.
- </li>
+ <span class="bold"><strong>Requires:</strong></span> No additional requirements
+ to those imposed by the container.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ each of the elements of <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(),</span>
+ <span class="identifier">end</span><span class="special">())</span></code>
+ is a restored copy of the corresponding element in <code class="computeroutput"><span class="special">[</span><span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">get</span><span class="special"><</span><span class="identifier">i</span><span class="special">>().</span><span class="identifier">end</span><span class="special">())</span></code>, where <code class="computeroutput"><span class="identifier">i</span></code>
+ is the position of the <code class="computeroutput"><span class="identifier">vector_of</span></code>
+ view in the container.
+ </li>
</ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
@@ -1333,10 +1273,10 @@
</p>
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
-<span class="bold"><strong>Requires: </strong></span><code class="computeroutput"><span class="identifier">it</span></code>
- is a valid iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
- has been previously saved.
- </li></ul></div>
+ <span class="bold"><strong>Requires: </strong></span> <code class="computeroutput"><span class="identifier">it</span></code>
+ is a valid iterator of the view. The associated <code class="computeroutput"><span class="identifier">bimap</span></code>
+ has been previously saved.
+ </li></ul></div>
<div class="sidebar">
<p class="title"><b></b></p>
<p>
@@ -1347,23 +1287,23 @@
</div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Postconditions:</strong></span> On successful loading,
- if it was dereferenceable then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>' is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>,
- otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput"><span class="special">==</span><span class="identifier">end</span><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<span class="bold"><strong>Note:</strong></span> It is allowed that it be a
- <code class="computeroutput"><span class="identifier">const_iterator</span></code> and
- the restored <code class="computeroutput"><span class="identifier">it</span></code>' an
- <code class="computeroutput"><span class="identifier">iterator</span></code>, or viceversa.
- </li>
+ <span class="bold"><strong>Postconditions:</strong></span> On successful loading,
+ if it was dereferenceable then <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>' is the restored copy of <code class="computeroutput"><span class="special">*</span><span class="identifier">it</span></code>,
+ otherwise <code class="computeroutput"><span class="identifier">it</span></code>'<code class="computeroutput"><span class="special">==</span><span class="identifier">end</span><span class="special">()</span></code>.
+ </li>
+<li class="listitem">
+ <span class="bold"><strong>Note:</strong></span> It is allowed that it be a
+ <code class="computeroutput"><span class="identifier">const_iterator</span></code> and
+ the restored <code class="computeroutput"><span class="identifier">it</span></code>'
+ an <code class="computeroutput"><span class="identifier">iterator</span></code>, or viceversa.
+ </li>
</ul></div>
</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -1371,7 +1311,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="list_of_reference.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_set_of_reference.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="list_of_reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_set_of_reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/release_notes.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Release notes</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="future_work.html" title="Future work">
<link rel="next" href="rationale.html" title="Rationale">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="future_work.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="future_work.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Release notes">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.release_notes"></a><a class="link" href="release_notes.html" title="Release notes">Release notes</a>
</h2></div></div></div>
@@ -32,7 +32,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -40,7 +40,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="future_work.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="future_work.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rationale.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/test_suite.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Test suite</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="examples/multiindex_to_bimap_path___hashed_indices.html" title="MultiIndex to Bimap Path - Hashed indices">
<link rel="next" href="future_work.html" title="Future work">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Test suite">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.test_suite"></a><a class="link" href="test_suite.html" title="Test suite">Test suite</a>
</h2></div></div></div>
@@ -39,404 +39,405 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Program
- </p>
+ <p>
+ Program
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- test_tagged.cpp
- </p>
+ <p>
+ test_tagged.cpp
+ </p>
</td>
<td>
- <p>
- Tagged idiom checks
- </p>
+ <p>
+ Tagged idiom checks
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- test_mutant.cpp
- </p>
+ <p>
+ test_mutant.cpp
+ </p>
</td>
<td>
- <p>
- Test the mutant idiom
- </p>
+ <p>
+ Test the mutant idiom
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_structured_pair.cpp" target="_top">test_structured_pair.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_structured_pair.cpp" target="_top">test_structured_pair.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test structured pair class
- </p>
+ <p>
+ Test structured pair class
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_mutant_relation.cpp" target="_top">test_mutant_relation.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_mutant_relation.cpp" target="_top">test_mutant_relation.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test the relation class
- </p>
+ <p>
+ Test the relation class
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_set_of.cpp" target="_top">test_bimap_set_of.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_set_of.cpp" target="_top">test_bimap_set_of.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Library interface check
- </p>
+ <p>
+ Library interface check
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_multiset_of.cpp" target="_top">test_bimap_multiset_of.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_multiset_of.cpp" target="_top">test_bimap_multiset_of.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Library interface check
- </p>
+ <p>
+ Library interface check
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_unordered_set_of.cpp" target="_top">test_bimap_unordered_set_of.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_unordered_set_of.cpp" target="_top">test_bimap_unordered_set_of.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Library interface check
- </p>
+ <p>
+ Library interface check
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_unordered_multiset_of.cpp" target="_top">test_bimap_unordered_multiset_of.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_unordered_multiset_of.cpp" target="_top">test_bimap_unordered_multiset_of.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Library interface check
- </p>
+ <p>
+ Library interface check
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_list_of.cpp" target="_top">test_bimap_list_of.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_list_of.cpp" target="_top">test_bimap_list_of.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Library interface check
- </p>
+ <p>
+ Library interface check
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_vector_of.cpp" target="_top">test_bimap_vector_of.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_vector_of.cpp" target="_top">test_bimap_vector_of.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Library interface check
- </p>
+ <p>
+ Library interface check
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_convenience_header.cpp" target="_top">test_bimap_convenience_header.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_convenience_header.cpp" target="_top">test_bimap_convenience_header.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Library interface check
- </p>
+ <p>
+ Library interface check
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_ordered.cpp" target="_top">test_bimap_ordered.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_ordered.cpp" target="_top">test_bimap_ordered.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test set and multiset based bimaps
- </p>
+ <p>
+ Test set and multiset based bimaps
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_unordered.cpp" target="_top">test_bimap_unordered.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_unordered.cpp" target="_top">test_bimap_unordered.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test unordered_set and unordered_multiset based bimaps
- </p>
+ <p>
+ Test unordered_set and unordered_multiset based bimaps
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_sequenced.cpp" target="_top">test_bimap_sequenced.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_sequenced.cpp" target="_top">test_bimap_sequenced.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test list and vector based bimaps
- </p>
+ <p>
+ Test list and vector based bimaps
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_unconstrained.cpp" target="_top">test_bimap_unconstrained.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_unconstrained.cpp" target="_top">test_bimap_unconstrained.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test bimaps with unconstrained views
- </p>
+ <p>
+ Test bimaps with unconstrained views
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_serialization.cpp" target="_top">test_bimap_serialization.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_serialization.cpp" target="_top">test_bimap_serialization.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Serialization support checks
- </p>
+ <p>
+ Serialization support checks
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_property_map.cpp" target="_top">test_bimap_property_map.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_property_map.cpp" target="_top">test_bimap_property_map.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Property map concepts for the set and unordered set views
- </p>
+ <p>
+ Property map concepts for the set and unordered set views
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_modify.cpp" target="_top">test_bimap_modify.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_modify.cpp" target="_top">test_bimap_modify.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">replace</span></code>, <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace</span></code>, <code class="computeroutput"><span class="identifier">modify</span></code> and <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_lambda.cpp" target="_top">test_bimap_lambda.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_lambda.cpp" target="_top">test_bimap_lambda.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test lambda modified idom support
- </p>
+ <p>
+ Test lambda modified idom support
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_assign.cpp" target="_top">test_bimap_assign.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_assign.cpp" target="_top">test_bimap_assign.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Test Boost.Assign support
- </p>
+ <p>
+ Test Boost.Assign support
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_project.cpp" target="_top">test_bimap_project.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_project.cpp" target="_top">test_bimap_project.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Projection of iterators support
- </p>
+ <p>
+ Projection of iterators support
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_operator_bracket.cpp" target="_top">test_bimap_operator_bracket.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_operator_bracket.cpp" target="_top">test_bimap_operator_bracket.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code>
- and <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code>
- functions
- </p>
+ <p>
+ <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code>
+ and <code class="computeroutput"><span class="identifier">at</span><span class="special">()</span></code>
+ functions
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- test_bimap_info.cpp
- </p>
+ <p>
+ <a href="../../../test/test_bimap_info.cpp" target="_top">test_bimap_info.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Information hooking support
- </p>
+ <p>
+ Information hooking support
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/test_bimap_extra.cpp" target="_top">test_bimap_extra.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/test_bimap_extra.cpp" target="_top">test_bimap_extra.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Additional checks
- </p>
+ <p>
+ Additional checks
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/compile_fail/test_bimap_info_1.cpp" target="_top">test_bimap_info_1.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/compile_fail/test_bimap_info_1.cpp" target="_top">test_bimap_info_1.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Information hooking compilation fail test
- </p>
+ <p>
+ Information hooking compilation fail test
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/compile_fail/test_bimap_info_2.cpp" target="_top">test_bimap_info_2.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/compile_fail/test_bimap_info_2.cpp" target="_top">test_bimap_info_2.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Information hooking compilation fail test
- </p>
+ <p>
+ Information hooking compilation fail test
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/compile_fail/test_bimap_info_3.cpp" target="_top">test_bimap_info_3.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/compile_fail/test_bimap_info_3.cpp" target="_top">test_bimap_info_3.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Information hooking compilation fail test
- </p>
+ <p>
+ Information hooking compilation fail test
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/compile_fail/test_bimap_mutable_1.cpp" target="_top">test_bimap_mutable_1.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/compile_fail/test_bimap_mutable_1.cpp" target="_top">test_bimap_mutable_1.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Mutable members compilation fail test
- </p>
+ <p>
+ Mutable members compilation fail test
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/compile_fail/test_bimap_mutable_2.cpp" target="_top">test_bimap_mutable_2.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/compile_fail/test_bimap_mutable_2.cpp" target="_top">test_bimap_mutable_2.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Mutable members compilation fail test
- </p>
+ <p>
+ Mutable members compilation fail test
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <a href="../../../test/compile_fail/test_bimap_mutable_3.cpp" target="_top">test_bimap_mutable_3.cpp
- </a>
- </p>
+ <p>
+ <a href="../../../test/compile_fail/test_bimap_mutable_3.cpp" target="_top">test_bimap_mutable_3.cpp
+ </a>
+ </p>
</td>
<td>
- <p>
- Mutable members compilation fail test
- </p>
+ <p>
+ Mutable members compilation fail test
+ </p>
</td>
</tr>
</tbody>
@@ -444,7 +445,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -452,7 +453,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="examples/multiindex_to_bimap_path___hashed_indices.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="future_work.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The tutorial</title>
<link rel="stylesheet" href="../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
-<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="up" href="../index.html" title="Chapter 1. Boost.Bimap">
<link rel="prev" href="one_minute_tutorial.html" title="One minute tutorial">
<link rel="next" href="the_tutorial/discovering_the_bimap_framework.html" title="Discovering the bimap framework">
</head>
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial/discovering_the_bimap_framework.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial/discovering_the_bimap_framework.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="The tutorial">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="boost_bimap.the_tutorial"></a><a class="link" href="the_tutorial.html" title="The tutorial">The tutorial</a>
</h2></div></div></div>
@@ -84,69 +84,69 @@
<dt><span class="section"><a href="the_tutorial/complete_instantiation_scheme.html">Complete
instantiation scheme</a></span></dt>
</dl></div>
-<div class="section" title="Roadmap">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.roadmap"></a><a class="link" href="the_tutorial.html#boost_bimap.the_tutorial.roadmap" title="Roadmap">Roadmap</a>
</h3></div></div></div>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- Boost.Bimap is intuitive because it is based on the standard template library.
- New concepts are however presented to extend the standard maps to bidirectional
- maps. The first step is to gain a firm grasp of the bimap framework. The
- first section (<a class="link" href="the_tutorial/discovering_the_bimap_framework.html" title="Discovering the bimap framework">Discovering
- the bimap framework</a>) aims to explain this.
- </li>
-<li class="listitem">
- Boost.Bimap offers much more than just a one-to-one ordered unique bidirectional
- map. It is possible to control the collection type of each side of the
- relationship that the bimap represents, giving one-to-many containers,
- hashed bidirectional containers and others that may be more suitable to
- the the task at hand. The second section (<a class="link" href="the_tutorial/controlling_collection_types.html" title="Controlling collection types">Controlling
- collection types</a>) explains how to instantiate a bimap with different
- collection constraints.
- </li>
-<li class="listitem">
- The section (<a class="link" href="the_tutorial/the_collection_of_relations_type.html" title="The collection of relations type">The
- "collection of relations" type</a>) explains how to create
- new types of bidirectional maps using custom collection types.
- </li>
-<li class="listitem">
- In the section <a class="link" href="the_tutorial/differences_with_standard_maps.html" title="Differences with standard maps">Differences
- with standard maps</a> we will learn about the subtle differences between
- a bimap map view and a standard map.
- </li>
-<li class="listitem">
- The section <a class="link" href="the_tutorial/useful_functions.html" title="Useful functions">Useful
- functions</a> provides information about functions of a bimap that are
- not found in the STL.
- </li>
-<li class="listitem">
- The types of a bimap can be tagged so that each side is accessible by something
- closer to the problem than left and right. This leads to more readable,
- self-documenting code. The fourth section (<a class="link" href="the_tutorial/bimaps_with_user_defined_names.html" title="Bimaps with user defined names">Bimaps
- with user defined names</a>) shows how to use this feature.
- </li>
-<li class="listitem">
- The bimap mapping framework allows to disable a view of a bimap, including
- the standard mapping containers as a particular case. The section <a class="link" href="the_tutorial/unconstrained_sets.html" title="Unconstrained Sets">Unconstrained Sets</a>
- explains how they work.
- </li>
-<li class="listitem">
- The section <a class="link" href="the_tutorial/additional_information.html" title="Additional information">Additional
- information</a> explains how to attach information to each relation
- of a bimap.
- </li>
-<li class="listitem">
- The final section (<a class="link" href="the_tutorial/complete_instantiation_scheme.html" title="Complete instantiation scheme">Complete
- Instantiation Scheme</a>) summarizes bimap instantiation and explains
- how change the allocator type to be used.
- </li>
+ Boost.Bimap is intuitive because it is based on the standard template
+ library. New concepts are however presented to extend the standard maps
+ to bidirectional maps. The first step is to gain a firm grasp of the
+ bimap framework. The first section (<a class="link" href="the_tutorial/discovering_the_bimap_framework.html" title="Discovering the bimap framework">Discovering
+ the bimap framework</a>) aims to explain this.
+ </li>
+<li class="listitem">
+ Boost.Bimap offers much more than just a one-to-one ordered unique bidirectional
+ map. It is possible to control the collection type of each side of the
+ relationship that the bimap represents, giving one-to-many containers,
+ hashed bidirectional containers and others that may be more suitable
+ to the the task at hand. The second section (<a class="link" href="the_tutorial/controlling_collection_types.html" title="Controlling collection types">Controlling
+ collection types</a>) explains how to instantiate a bimap with different
+ collection constraints.
+ </li>
+<li class="listitem">
+ The section (<a class="link" href="the_tutorial/the_collection_of_relations_type.html" title="The collection of relations type">The
+ "collection of relations" type</a>) explains how to create
+ new types of bidirectional maps using custom collection types.
+ </li>
+<li class="listitem">
+ In the section <a class="link" href="the_tutorial/differences_with_standard_maps.html" title="Differences with standard maps">Differences
+ with standard maps</a> we will learn about the subtle differences
+ between a bimap map view and a standard map.
+ </li>
+<li class="listitem">
+ The section <a class="link" href="the_tutorial/useful_functions.html" title="Useful functions">Useful
+ functions</a> provides information about functions of a bimap that
+ are not found in the STL.
+ </li>
+<li class="listitem">
+ The types of a bimap can be tagged so that each side is accessible by
+ something closer to the problem than left and right. This leads to more
+ readable, self-documenting code. The fourth section (<a class="link" href="the_tutorial/bimaps_with_user_defined_names.html" title="Bimaps with user defined names">Bimaps
+ with user defined names</a>) shows how to use this feature.
+ </li>
+<li class="listitem">
+ The bimap mapping framework allows to disable a view of a bimap, including
+ the standard mapping containers as a particular case. The section <a class="link" href="the_tutorial/unconstrained_sets.html" title="Unconstrained Sets">Unconstrained Sets</a>
+ explains how they work.
+ </li>
+<li class="listitem">
+ The section <a class="link" href="the_tutorial/additional_information.html" title="Additional information">Additional
+ information</a> explains how to attach information to each relation
+ of a bimap.
+ </li>
+<li class="listitem">
+ The final section (<a class="link" href="the_tutorial/complete_instantiation_scheme.html" title="Complete instantiation scheme">Complete
+ Instantiation Scheme</a>) summarizes bimap instantiation and explains
+ how change the allocator type to be used.
+ </li>
</ol></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -154,7 +154,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="one_minute_tutorial.html"><img src="../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial/discovering_the_bimap_framework.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="one_minute_tutorial.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_tutorial/discovering_the_bimap_framework.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/additional_information.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Additional information</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="unconstrained_sets.html" title="Unconstrained Sets">
<link rel="next" href="complete_instantiation_scheme.html" title="Complete instantiation scheme">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Additional information">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.additional_information"></a><a class="link" href="additional_information.html" title="Additional information">Additional
information</a>
@@ -32,9 +32,7 @@
we want to represent a books and author bidirectional map.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span>
@@ -54,20 +52,18 @@
</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span> <span class="string">"Modern C++ Design"</span> <span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Suppose now that we want to store abstract of each book. We have two options:
</p>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- Books name are unique identifiers, so we can create a separate <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span> <span class="identifier">string</span><span class="special">,</span> <span class="identifier">string</span> <span class="special">></span></code>
- that relates books names with abstracts.
- </li>
+ Books name are unique identifiers, so we can create a separate <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span> <span class="identifier">string</span><span class="special">,</span> <span class="identifier">string</span> <span class="special">></span></code>
+ that relates books names with abstracts.
+ </li>
<li class="listitem">
- We can use Boost.MultiIndex for the new beast.
- </li>
+ We can use Boost.MultiIndex for the new beast.
+ </li>
</ol></div>
<p>
Option 1 is the wrong approach, if we go this path we lost what bimap has
@@ -105,9 +101,7 @@
constructor.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span>
@@ -138,22 +132,16 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">info</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Contrary to the two key types, the information will be mutable using iterators.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">i</span><span class="special">-></span><span class="identifier">info</span> <span class="special">+=</span> <span class="string">"More details about this book"</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
A new function is included in <span class="emphasis"><em>unique</em></span> map views: <code class="computeroutput"><span class="identifier">info_at</span><span class="special">(</span><span class="identifier">key</span><span class="special">)</span></code>, that
@@ -161,25 +149,19 @@
but returned the associated information instead of the data.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Print the new abstract
</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">info_at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The info member can be tagged just as the left or the right member. The following
is a rewrite of the above example using user defined names:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span>
@@ -217,8 +199,6 @@
</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">title</span><span class="special">>().</span><span class="identifier">info_at</span><span class="special">(</span><span class="string">"The C++ Programming Language"</span><span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
<a href="../../../../example/tutorial_info_hook.cpp" target="_top">Go to source code</a>
@@ -226,7 +206,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -234,7 +214,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="complete_instantiation_scheme.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/bimaps_with_user_defined_names.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Bimaps with user defined names</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="useful_functions.html" title="Useful functions">
<link rel="next" href="unconstrained_sets.html" title="Unconstrained Sets">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Bimaps with user defined names">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.bimaps_with_user_defined_names"></a><a class="link" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">Bimaps
with user defined names</a>
@@ -35,9 +35,7 @@
<a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span>
<span class="special"><</span>
@@ -85,8 +83,6 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
In Boost.Bimap there is a better way to document the code and in the meantime
@@ -114,9 +110,7 @@
<a href="../../../../example/user_defined_names.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">id</span> <span class="special">{};</span> <span class="comment">// Tag for the identification number
</span><span class="keyword">struct</span> <span class="identifier">name</span> <span class="special">{};</span> <span class="comment">// Tag for the name of the person
@@ -157,8 +151,6 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Here is a list of common structures in both tagged and untagged versions.
@@ -181,7 +173,7 @@
<span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_iterator</span> <span class="identifier">right_iter</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">begin</span><span class="special">();</span>
</pre>
<div class="table">
-<a name="id577416"></a><p class="title"><b>Table 1.3. Equivalence of expresions using user defined names</b></p>
+<a name="id782992"></a><p class="title"><b>Table 1.3. Equivalence of expresions using user defined names</b></p>
<div class="table-contents"><table class="table" summary="Equivalence of expresions using user defined names">
<colgroup>
<col>
@@ -189,184 +181,184 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Untagged version
- </p>
- </th>
+ <p>
+ Untagged version
+ </p>
+ </th>
<th>
- <p>
- Tagged version
- </p>
- </th>
+ <p>
+ Tagged version
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">by</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>::</span><span class="identifier">type</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_value_type</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_value_type</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>::</span><span class="identifier">value_type</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>::</span><span class="identifier">value_type</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>::</span><span class="identifier">iterator</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>::</span><span class="identifier">iterator</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_const_iterator</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">right_const_iterator</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>::</span><span class="identifier">const_iterator</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">::</span><span class="identifier">map_by</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>::</span><span class="identifier">const_iterator</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">left</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">left</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">right</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">right</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">first</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">first</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">second</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">second</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">first</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">first</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">second</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">second</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iter</span><span class="special">-></span><span class="identifier">get</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project_left</span><span class="special">(</span><span class="identifier">iter</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project_left</span><span class="special">(</span><span class="identifier">iter</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>(</span><span class="identifier">iter</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project</span><span class="special"><</span><span class="identifier">Left</span><span class="special">>(</span><span class="identifier">iter</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project_right</span><span class="special">(</span><span class="identifier">iter</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project_right</span><span class="special">(</span><span class="identifier">iter</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>(</span><span class="identifier">iter</span><span class="special">)</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">project</span><span class="special"><</span><span class="identifier">Right</span><span class="special">>(</span><span class="identifier">iter</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
@@ -375,7 +367,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -383,7 +375,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="useful_functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unconstrained_sets.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/complete_instantiation_scheme.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Complete instantiation scheme</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="additional_information.html" title="Additional information">
<link rel="next" href="../bimap_and_boost.html" title="Bimap and Boost">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Complete instantiation scheme">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.complete_instantiation_scheme"></a><a class="link" href="complete_instantiation_scheme.html" title="Complete instantiation scheme">Complete
instantiation scheme</a>
@@ -53,56 +53,55 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
-</li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special"><</span> <span class="identifier">Type</span> <span class="special">></span></code>
-</li>
+ Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special"><</span> <span class="identifier">Type</span>
+ <span class="special">></span></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
-</li>
+ Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special"><</span> <span class="identifier">Type</span> <span class="special">>,</span> <span class="identifier">R</span> <span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
-</li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special"><</span> <span class="identifier">LeftType</span>
- <span class="special">></span></code>
-</li>
+ Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special"><</span> <span class="identifier">LeftType</span> <span class="special">></span></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
-</li>
+ Left tag: <code class="computeroutput"><span class="identifier">member_at</span><span class="special">::</span><span class="identifier">left</span></code>
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">tagged</span><span class="special"><</span> <span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Tag</span> <span class="special">>,</span> <span class="identifier">R</span> <span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
-</li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special"><</span> <span class="identifier">LeftType</span>
- <span class="special">></span></code>
-</li>
+ Left collection type: <code class="computeroutput"><span class="identifier">set_of</span><span class="special"><</span> <span class="identifier">LeftType</span>
+ <span class="special">></span></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code>
-</li>
+ Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code>
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special"><</span> <span class="identifier">tagged</span><span class="special"><</span> <span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Tag</span> <span class="special">></span> <span class="special">>,</span> <span class="identifier">R</span> <span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
-</li>
+ Left type: <code class="computeroutput"><span class="identifier">Type</span></code>
+ </li>
<li class="listitem">
- Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special"><</span> <span class="identifier">LeftType</span>
- <span class="special">></span></code>
-</li>
+ Left collection type: <code class="computeroutput"><span class="special">{</span><span class="identifier">CollectionType</span><span class="special">}</span><span class="identifier">_of</span><span class="special"><</span> <span class="identifier">LeftType</span> <span class="special">></span></code>
+ </li>
<li class="listitem">
- Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code>
-</li>
+ Left tag: <code class="computeroutput"><span class="identifier">Tag</span></code>
+ </li>
</ul></div>
<p>
The same options are available for the second parameter.
@@ -127,107 +126,107 @@
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span><span class="identifier">SetOfRelationType</span><span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">SetOfRelationType</span><span class="special">,</span> <span class="identifier">with_info</span><span class="special"><</span><span class="identifier">Info</span><span class="special">></span> <span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: Info
- </li>
+ info: Info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">SetOfRelationType</span><span class="special">,</span> <span class="identifier">with_info</span><span class="special"><</span><span class="identifier">Info</span><span class="special">>,</span> <span class="identifier">Allocator</span><span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: Info
- </li>
+ info: Info
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">SetOfRelationType</span><span class="special">,</span> <span class="identifier">Allocator</span><span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: SetOfRelationType
- </li>
+ set_of_relation_type: SetOfRelationType
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">with_info</span><span class="special"><</span><span class="identifier">Info</span><span class="special">></span> <span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- info: Info
- </li>
+ info: Info
+ </li>
<li class="listitem">
- allocator: std::allocator
- </li>
+ allocator: std::allocator
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">with_info</span><span class="special"><</span><span class="identifier">Info</span><span class="special">>,</span> <span class="identifier">Allocator</span><span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
<pre class="programlisting"><span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">L</span><span class="special">,</span> <span class="identifier">R</span> <span class="special">,</span> <span class="identifier">Allocator</span><span class="special">></span>
</pre>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- set_of_relation_type: based on the left key type
- </li>
+ set_of_relation_type: based on the left key type
+ </li>
<li class="listitem">
- info: no info
- </li>
+ info: no info
+ </li>
<li class="listitem">
- allocator: Allocator
- </li>
+ allocator: Allocator
+ </li>
</ul></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -235,7 +234,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="additional_information.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../bimap_and_boost.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/controlling_collection_types.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Controlling collection types</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="discovering_the_bimap_framework.html" title="Discovering the bimap framework">
<link rel="next" href="the_collection_of_relations_type.html" title="The collection of relations type">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="discovering_the_bimap_framework.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="discovering_the_bimap_framework.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Controlling collection types">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.controlling_collection_types"></a><a class="link" href="controlling_collection_types.html" title="Controlling collection types">Controlling
collection types</a>
@@ -34,7 +34,7 @@
parameters</a></span></dt>
<dt><span class="section">Examples</span></dt>
</dl></div>
-<div class="section" title="Freedom of choice">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.freedom_of_choice" title="Freedom of choice">Freedom
of choice</a>
@@ -59,7 +59,7 @@
The following is the list of all supported collection types.
</p>
<div class="table">
-<a name="id561624"></a><p class="title"><b>Table 1.2. Collection of Key Types</b></p>
+<a name="id767190"></a><p class="title"><b>Table 1.2. Collection of Key Types</b></p>
<div class="table-contents"><table class="table" summary="Collection of Key Types">
<colgroup>
<col>
@@ -68,140 +68,140 @@
</colgroup>
<thead><tr>
<th>
- <p>
- name
- </p>
- </th>
+ <p>
+ name
+ </p>
+ </th>
<th>
- <p>
- Features
- </p>
- </th>
+ <p>
+ Features
+ </p>
+ </th>
<th>
- <p>
- map view type
- </p>
- </th>
+ <p>
+ map view type
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">set_of</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_of</span></code>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>ordered, unique</em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>ordered, unique</em></span>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">map</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">map</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">multiset_of</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">multiset_of</span></code>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>ordered </em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>ordered </em></span>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">multimap</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">multimap</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>hashed, unique </em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>hashed, unique </em></span>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_map</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_map</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>hashed </em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>hashed </em></span>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multimap</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multimap</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">list_of</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">list_of</span></code>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>sequenced </em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>sequenced </em></span>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">list_map</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">list_map</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">vector_of</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">vector_of</span></code>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>random access </em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>random access </em></span>
+ </p>
+ </td>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">vector_map</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">vector_map</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>unconstrained </em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>unconstrained </em></span>
+ </p>
+ </td>
<td>
- <p>
- <span class="emphasis"><em>can not be viewed</em></span>
- </p>
- </td>
+ <p>
+ <span class="emphasis"><em>can not be viewed</em></span>
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
@@ -229,16 +229,16 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code> is signature-compatible with
- <span class="bold"><strong>LeftMapType</strong></span><code class="computeroutput"><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span></code> is signature-compatible with
+ <span class="bold"><strong>LeftMapType</strong></span><code class="computeroutput"><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
+ </li>
<li class="listitem">
-<code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is signature-compatible with
- <span class="bold"><strong>RightMapType</strong></span><code class="computeroutput"><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
-</li>
+ <code class="computeroutput"><span class="identifier">bm</span><span class="special">.</span><span class="identifier">right</span></code> is signature-compatible with
+ <span class="bold"><strong>RightMapType</strong></span><code class="computeroutput"><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
+ </li>
</ul></div>
</div>
-<div class="section" title="Configuration parameters">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.controlling_collection_types.configuration_parameters"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.configuration_parameters" title="Configuration parameters">Configuration
parameters</a>
@@ -261,98 +261,99 @@
</colgroup>
<thead><tr>
<th>
- <p>
- name
- </p>
+ <p>
+ name
+ </p>
</th>
<th>
- <p>
- Additional Parameters
- </p>
+ <p>
+ Additional Parameters
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">set_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">KeyComp</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">multiset_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">KeyComp</span><span class="special">></span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">KeyComp</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">multiset_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">KeyComp</span><span class="special">></span></code>
+ </p>
</td>
<td>
- <p>
- <span class="bold"><strong>KeyComp </strong></span> is a Functor that compares
- two types using a less-than operator. By default, this is <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>.
- </p>
+ <p>
+ <span class="bold"><strong>KeyComp </strong></span> is a Functor that compares
+ two types using a less-than operator. By default, this is <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_set_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multiset_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_set_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multiset_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
+ </p>
</td>
<td>
- <p>
- <span class="bold"><strong>HashFunctor </strong></span> converts a <code class="computeroutput"><span class="identifier">T</span></code> object into an <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span></code> value. By default it is
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">hash</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>.
- </p>
- <p>
- <span class="bold"><strong>EqualKey </strong></span> is a Functor that tests
- two types for equality. By default, the equality operator is <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>.
- </p>
+ <p>
+ <span class="bold"><strong>HashFunctor </strong></span> converts a <code class="computeroutput"><span class="identifier">T</span></code> object into an <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span></code> value. By default it
+ is <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">hash</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>.
+ </p>
+ <p>
+ <span class="bold"><strong>EqualKey </strong></span> is a Functor that
+ tests two types for equality. By default, the equality operator
+ is <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">list_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">list_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>
+ </p>
</td>
<td>
- <p>
- No additional parameters.
- </p>
+ <p>
+ No additional parameters.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">vector_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">vector_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>
+ </p>
</td>
<td>
- <p>
- No additional parameters.
- </p>
+ <p>
+ No additional parameters.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unconstrained_set_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unconstrained_set_of</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>
+ </p>
</td>
<td>
- <p>
- No additional parameters.
- </p>
+ <p>
+ No additional parameters.
+ </p>
</td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Examples">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.controlling_collection_types.examples"></a><a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples" title="Examples">Examples</a>
</h4></div></div></div>
<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations"></a><h6>
-<a name="id562688"></a>
+<a name="id768285"></a>
<a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.countries_populations">Countries
Populations</a>
</h6>
@@ -361,11 +362,11 @@
</p>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- Get a list of countries in decresing order of their populations.
- </li>
+ Get a list of countries in decresing order of their populations.
+ </li>
<li class="listitem">
- Given a countrie, get their population.
- </li>
+ Given a countrie, get their population.
+ </li>
</ol></div>
<p>
Lets create the appropiate bimap.
@@ -394,9 +395,7 @@
<a href="../../../../example/population_bimap.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span>
@@ -418,7 +417,7 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Countries by their population:"</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="comment">// First requirement
-</span><span class="line_callout_bug"><a class="co" name="boost_bimap4co" href="controlling_collection_types.html#boost_bimap4"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="keyword">for</span><span class="special">(</span> <span class="identifier">population_bimap</span><span class="special">::</span><span class="identifier">right_const_iterator</span>
+</span><a class="co" name="boost_bimap4co" href="controlling_collection_types.html#boost_bimap4"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="keyword">for</span><span class="special">(</span> <span class="identifier">population_bimap</span><span class="special">::</span><span class="identifier">right_const_iterator</span>
<span class="identifier">i</span> <span class="special">=</span> <span class="identifier">pop</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">iend</span> <span class="special">=</span> <span class="identifier">pop</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span>
<span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">iend</span> <span class="special">;</span> <span class="special">++</span><span class="identifier">i</span> <span class="special">)</span>
<span class="special">{</span>
@@ -426,33 +425,29 @@
<span class="special">}</span>
<span class="comment">// Second requirement
-</span><span class="line_callout_bug"><a class="co" name="boost_bimap5co" href="controlling_collection_types.html#boost_bimap5"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a></span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Population of China: "</span> <span class="special"><<</span> <span class="identifier">pop</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="string">"China"</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
+</span><a class="co" name="boost_bimap5co" href="controlling_collection_types.html#boost_bimap5"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"Population of China: "</span> <span class="special"><<</span> <span class="identifier">pop</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="string">"China"</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap4"></a> </p></td>
<td valign="top" align="left"><p> The right map view works like a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">multimap</span><span class="special"><</span> <span class="keyword">long</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">greater</span><span class="special"><</span><span class="keyword">long</span><span class="special">></span> <span class="special">></span></code>,
- We can iterate over it to print the results in the required order. </p></td>
+ We can iterate over it to print the results in the required order. </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap5"></a> </p></td>
<td valign="top" align="left"><p> The
- left map view works like a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unordered_map</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="keyword">long</span> <span class="special">></span></code>, given the name of the country we
- can use it to search for the population in constant time </p></td>
+ left map view works like a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unordered_map</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="keyword">long</span> <span class="special">></span></code>, given the name of the country we can
+ use it to search for the population in constant time </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
<a name="boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter"></a><h6>
-<a name="id563860"></a>
+<a name="id769726"></a>
<a class="link" href="controlling_collection_types.html#boost_bimap.the_tutorial.controlling_collection_types.examples.repetitions_counter">Repetitions
counter</a>
</h6>
@@ -464,14 +459,12 @@
<a href="../../../../example/repetitions_counter.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span>
<span class="special"><</span>
<span class="identifier">unordered_set_of</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">>,</span>
- <span class="identifier">list_of</span><span class="special"><</span> <span class="identifier">counter</span> <span class="special">></span> <span class="callout_bug"><a class="co" name="boost_bimap6co" href="controlling_collection_types.html#boost_bimap6"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span>
+ <span class="identifier">list_of</span><span class="special"><</span> <span class="identifier">counter</span> <span class="special">></span> <a class="co" name="boost_bimap6co" href="controlling_collection_types.html#boost_bimap6"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a>
<span class="special">></span> <span class="identifier">word_counter</span><span class="special">;</span>
@@ -492,11 +485,11 @@
<span class="keyword">for</span><span class="special">(</span> <span class="identifier">text_tokenizer</span><span class="special">::</span><span class="identifier">const_iterator</span> <span class="identifier">it</span> <span class="special">=</span> <span class="identifier">tok</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">it_end</span> <span class="special">=</span> <span class="identifier">tok</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span>
<span class="identifier">it</span> <span class="special">!=</span> <span class="identifier">it_end</span> <span class="special">;</span> <span class="special">++</span><span class="identifier">it</span> <span class="special">)</span>
<span class="special">{</span>
- <span class="line_callout_bug"><a class="co" name="boost_bimap7co" href="controlling_collection_types.html#boost_bimap7"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a></span><span class="special">++</span> <span class="identifier">wc</span><span class="special">.</span><span class="identifier">left</span><span class="special">[*</span><span class="identifier">it</span><span class="special">];</span>
+ <a class="co" name="boost_bimap7co" href="controlling_collection_types.html#boost_bimap7"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a><span class="special">++</span> <span class="identifier">wc</span><span class="special">.</span><span class="identifier">left</span><span class="special">[*</span><span class="identifier">it</span><span class="special">];</span>
<span class="special">}</span>
<span class="comment">// list words with counters by order of appearance
-</span><span class="line_callout_bug"><a class="co" name="boost_bimap8co" href="controlling_collection_types.html#boost_bimap8"><img src="../../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a></span><span class="keyword">for</span><span class="special">(</span> <span class="identifier">word_counter</span><span class="special">::</span><span class="identifier">right_const_iterator</span>
+</span><a class="co" name="boost_bimap8co" href="controlling_collection_types.html#boost_bimap8"><img src="../../../../../../doc/src/images/callouts/3.png" alt="3" border="0"></a><span class="keyword">for</span><span class="special">(</span> <span class="identifier">word_counter</span><span class="special">::</span><span class="identifier">right_const_iterator</span>
<span class="identifier">wit</span> <span class="special">=</span> <span class="identifier">wc</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">wit_end</span> <span class="special">=</span> <span class="identifier">wc</span><span class="special">.</span><span class="identifier">right</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span>
<span class="identifier">wit</span> <span class="special">!=</span> <span class="identifier">wit_end</span><span class="special">;</span> <span class="special">++</span><span class="identifier">wit</span> <span class="special">)</span>
@@ -505,39 +498,35 @@
<span class="special">}</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap6"></a> </p></td>
-<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">counter</span></code> is an integer
- that is initialized in zero in the constructor </p></td>
+<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">counter</span></code> is an integer that
+ is initialized in zero in the constructor </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap7"></a> </p></td>
<td valign="top" align="left"><p> Because the right collection
- type is <code class="computeroutput"><span class="identifier">list_of</span></code>, the
- right data is not used a key and can be modified in the same way as with
- standard maps. </p></td>
+ type is <code class="computeroutput"><span class="identifier">list_of</span></code>, the right
+ data is not used a key and can be modified in the same way as with standard
+ maps. </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap8"></a> </p></td>
-<td valign="top" align="left"><p> When we insert the elements using the left map view, the
- element is inserted at the end of the list. </p></td>
+<td valign="top" align="left"><p> When we insert the elements using the left map view, the element
+ is inserted at the end of the list. </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -545,7 +534,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="discovering_the_bimap_framework.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="discovering_the_bimap_framework.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/differences_with_standard_maps.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Differences with standard maps</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="the_collection_of_relations_type.html" title="The collection of relations type">
<link rel="next" href="useful_functions.html" title="Useful functions">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Differences with standard maps">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps"></a><a class="link" href="differences_with_standard_maps.html" title="Differences with standard maps">Differences
with standard maps</a>
@@ -35,7 +35,7 @@
<dt><span class="section"><a href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations">Complexity
of operations</a></span></dt>
</dl></div>
-<div class="section" title="Insertion">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps.insertion"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.insertion" title="Insertion">Insertion</a>
</h4></div></div></div>
@@ -67,7 +67,7 @@
allowed by it too.
</p>
</div>
-<div class="section" title="iterator::value_type">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.iterator__value_type" title="iterator::value_type">iterator::value_type</a>
</h4></div></div></div>
@@ -102,99 +102,99 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Side collection type
- </p>
+ <p>
+ Side collection type
+ </p>
</th>
<th>
- <p>
- Dereferenced data
- </p>
+ <p>
+ Dereferenced data
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">set_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_of</span></code>
+ </p>
</td>
<td>
- <p>
- <span class="emphasis"><em>constant</em></span>
- </p>
+ <p>
+ <span class="emphasis"><em>constant</em></span>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">multiset_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">multiset_of</span></code>
+ </p>
</td>
<td>
- <p>
- <span class="emphasis"><em>constant</em></span>
- </p>
+ <p>
+ <span class="emphasis"><em>constant</em></span>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
+ </p>
</td>
<td>
- <p>
- <span class="emphasis"><em>constant</em></span>
- </p>
+ <p>
+ <span class="emphasis"><em>constant</em></span>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
+ </p>
</td>
<td>
- <p>
- <span class="emphasis"><em>constant</em></span>
- </p>
+ <p>
+ <span class="emphasis"><em>constant</em></span>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">list_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">list_of</span></code>
+ </p>
</td>
<td>
- <p>
- <span class="emphasis"><em>mutable</em></span>
- </p>
+ <p>
+ <span class="emphasis"><em>mutable</em></span>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">vector_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">vector_of</span></code>
+ </p>
</td>
<td>
- <p>
- <span class="emphasis"><em>mutable</em></span>
- </p>
+ <p>
+ <span class="emphasis"><em>mutable</em></span>
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unconstrained_set_of</span></code>
+ </p>
</td>
<td>
- <p>
- <span class="emphasis"><em>mutable</em></span>
- </p>
+ <p>
+ <span class="emphasis"><em>mutable</em></span>
+ </p>
</td>
</tr>
</tbody>
@@ -210,137 +210,137 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Bimap type
- </p>
+ <p>
+ Bimap type
+ </p>
</th>
<th>
- <p>
- Signature-compatible types
- </p>
+ <p>
+ Signature-compatible types
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">right_iterator</span></code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">B</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">A</span><span class="special">></span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">multiset_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">unordered_set_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
- <span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">right_iterator</span></code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">B</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">A</span><span class="special">></span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">set_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">list_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
- <span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">right_iterator</span></code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="keyword">const</span>
- <span class="identifier">A</span><span class="special">></span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">vector_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">set_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
- <span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span>
- <span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span>
- <span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">right_iterator</span></code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">list_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">unconstrained_set_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
- <span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">right_iterator</span></code>
- <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iterator</span></code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">B</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">A</span><span class="special">></span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">multiset_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">unordered_set_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
+ <span class="special">></span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iterator</span></code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">B</span><span class="special">,</span><span class="keyword">const</span> <span class="identifier">A</span><span class="special">></span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">set_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">list_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
+ <span class="special">></span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iterator</span></code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="keyword">const</span>
+ <span class="identifier">A</span><span class="special">></span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">vector_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">set_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
+ <span class="special">></span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span>
+ <span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="keyword">const</span>
+ <span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iterator</span></code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="keyword">const</span>
+ <span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">bimap</span><span class="special"><</span><span class="identifier">list_of</span><span class="special"><</span><span class="identifier">A</span><span class="special">>,</span><span class="identifier">unconstrained_set_of</span><span class="special"><</span><span class="identifier">B</span><span class="special">></span>
+ <span class="special">></span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">iterator</span> </code> <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">relation</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_iterator</span> </code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">A</span><span class="special">,</span><span class="identifier">B</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_iterator</span></code>
+ <span class="bold"><strong>-></strong></span> <code class="computeroutput"><span class="identifier">pair</span><span class="special"><</span><span class="identifier">B</span><span class="special">,</span><span class="identifier">A</span><span class="special">></span></code>
+ </p>
</td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="operator[] and at()">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.operator_____and_at__" title="operator[] and at()">operator[]
and at()</a>
@@ -379,9 +379,7 @@
<a href="../../../../example/at_function_examples.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">set_of</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">>,</span> <span class="identifier">list_of</span><span class="special"><</span> <span class="keyword">int</span> <span class="special">></span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
@@ -399,13 +397,9 @@
<span class="identifier">assert</span><span class="special">(</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="string">"one"</span><span class="special">)</span> <span class="special">==</span> <span class="number">1</span> <span class="special">);</span> <span class="comment">// Ok
</span></pre>
<p>
- </p>
-<p>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">multiset_of</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>,</span> <span class="identifier">unordered_set_of</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
@@ -426,11 +420,9 @@
</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
-<div class="section" title="Complexity of operations">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations"></a><a class="link" href="differences_with_standard_maps.html#boost_bimap.the_tutorial.differences_with_standard_maps.complexity_of_operations" title="Complexity of operations">Complexity
of operations</a>
@@ -443,7 +435,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -451,7 +443,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="the_collection_of_relations_type.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="useful_functions.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/discovering_the_bimap_framework.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Discovering the bimap framework</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="../the_tutorial.html" title="The tutorial">
<link rel="next" href="controlling_collection_types.html" title="Controlling collection types">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="controlling_collection_types.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Discovering the bimap framework">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework"></a><a class="link" href="discovering_the_bimap_framework.html" title="Discovering the bimap framework">Discovering
the bimap framework</a>
@@ -35,7 +35,7 @@
<dt><span class="section"><a href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework">Bimap
mapping framework</a></span></dt>
</dl></div>
-<div class="section" title="Interpreting bidirectional maps">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.interpreting_bidirectional_maps"></a><a class="link" href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.interpreting_bidirectional_maps" title="Interpreting bidirectional maps">Interpreting
bidirectional maps</a>
@@ -51,7 +51,7 @@
and data from the left collection.
</p>
</div>
-<div class="section" title="Standard mapping framework">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework"></a><a class="link" href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.standard_mapping_framework" title="Standard mapping framework">Standard
mapping framework</a>
@@ -73,7 +73,7 @@
containers.
</p>
<div class="table">
-<a name="id559754"></a><p class="title"><b>Table 1.1. std associative containers</b></p>
+<a name="id765312"></a><p class="title"><b>Table 1.1. std associative containers</b></p>
<div class="table-contents"><table class="table" summary="std associative containers">
<colgroup>
<col>
@@ -82,96 +82,96 @@
</colgroup>
<thead><tr>
<th>
- <p>
- container
- </p>
- </th>
+ <p>
+ container
+ </p>
+ </th>
<th>
- <p>
- left collection type
- </p>
- </th>
+ <p>
+ left collection type
+ </p>
+ </th>
<th>
- <p>
- right collection type
- </p>
- </th>
+ <p>
+ right collection type
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">map</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">set_of</span></code>
- </p>
- </td>
-<td>
- <p>
- no constraints
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">map</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_of</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ no constraints
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">multimap</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">multiset_of</span></code>
- </p>
- </td>
-<td>
- <p>
- no constraints
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">multimap</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">multiset_of</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ no constraints
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_map</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
- </p>
- </td>
-<td>
- <p>
- no constraints
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_map</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_set_of</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ no constraints
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multimap</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
- </p>
- </td>
-<td>
- <p>
- no constraints
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multimap</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multiset_of</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ no constraints
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
</div>
<br class="table-break">
</div>
-<div class="section" title="Bimap mapping framework">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework"></a><a class="link" href="discovering_the_bimap_framework.html#boost_bimap.the_tutorial.discovering_the_bimap_framework.bimap_mapping_framework" title="Bimap mapping framework">Bimap
mapping framework</a>
@@ -215,9 +215,9 @@
The following code snippet shows the relation between a bimap and standard
maps.
</p>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
<tr><td align="left" valign="top">
@@ -239,9 +239,7 @@
<a href="../../../../example/standard_map_comparison.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Map</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">CompatibleKey</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">CompatibleData</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">use_it</span><span class="special">(</span> <span class="identifier">Map</span> <span class="special">&</span> <span class="identifier">m</span><span class="special">,</span>
@@ -304,14 +302,12 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -319,7 +315,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="controlling_collection_types.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/the_collection_of_relations_type.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>The collection of relations type</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="controlling_collection_types.html" title="Controlling collection types">
<link rel="next" href="differences_with_standard_maps.html" title="Differences with standard maps">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="controlling_collection_types.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="differences_with_standard_maps.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="The collection of relations type">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.the_collection_of_relations_type"></a><a class="link" href="the_collection_of_relations_type.html" title="The collection of relations type">The
collection of relations type</a>
@@ -34,7 +34,7 @@
parameters</a></span></dt>
<dt><span class="section">Examples</span></dt>
</dl></div>
-<div class="section" title="A new point of view">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.a_new_point_of_view"></a><a class="link" href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.a_new_point_of_view" title="A new point of view">A
new point of view</a>
@@ -62,36 +62,36 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- left_based
- </li>
+ left_based
+ </li>
<li class="listitem">
- right_based
- </li>
+ right_based
+ </li>
<li class="listitem">
- set_of_relation<>
- </li>
+ set_of_relation<>
+ </li>
<li class="listitem">
- multiset_of_relation<>
- </li>
+ multiset_of_relation<>
+ </li>
<li class="listitem">
- unordered_set_of_relation<>
- </li>
+ unordered_set_of_relation<>
+ </li>
<li class="listitem">
- unordered_multiset_of_relation<>
- </li>
+ unordered_multiset_of_relation<>
+ </li>
<li class="listitem">
- list_of_relation
- </li>
+ list_of_relation
+ </li>
<li class="listitem">
- vector_of_relation
- </li>
+ vector_of_relation
+ </li>
<li class="listitem">
- unconstrained_set_of_relation
- </li>
+ unconstrained_set_of_relation
+ </li>
</ul></div>
-<div class="tip" title="Tip"><table border="0" summary="Tip">
+<div class="tip"><table border="0" summary="Tip">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/html/images/tip.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Tip]" src="../../../../../../doc/src/images/tip.png"></td>
<th align="left">Tip</th>
</tr>
<tr><td align="left" valign="top"><p>
@@ -118,9 +118,7 @@
<a href="../../../../example/mighty_bimap.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">string</span><span class="special">></span>
@@ -205,11 +203,9 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
-<div class="section" title="Configuration parameters">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.configuration_parameters"></a><a class="link" href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.configuration_parameters" title="Configuration parameters">Configuration
parameters</a>
@@ -236,119 +232,119 @@
</colgroup>
<thead><tr>
<th>
- <p>
- name
- </p>
+ <p>
+ name
+ </p>
</th>
<th>
- <p>
- Additional Parameters
- </p>
+ <p>
+ Additional Parameters
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">left_based</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">left_based</span></code>
+ </p>
</td>
<td>
- <p>
- Not a template.
- </p>
+ <p>
+ Not a template.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">right_based</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">right_based</span></code>
+ </p>
</td>
<td>
- <p>
- Not a template.
- </p>
+ <p>
+ Not a template.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">set_of_relation</span><span class="special"><</span><span class="identifier">KeyComp</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">multiset_of_relation</span><span class="special"><</span><span class="identifier">KeyComp</span><span class="special">></span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_of_relation</span><span class="special"><</span><span class="identifier">KeyComp</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">multiset_of_relation</span><span class="special"><</span><span class="identifier">KeyComp</span><span class="special">></span></code>
+ </p>
</td>
<td>
- <p>
- <span class="bold"><strong>KeyComp </strong></span> is a Functor that compares
- two types using less than. By default, the less-than operator is
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">_relation</span><span class="special">></span></code>.
- </p>
+ <p>
+ <span class="bold"><strong>KeyComp </strong></span> is a Functor that compares
+ two types using less than. By default, the less-than operator
+ is <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="identifier">_relation</span><span class="special">></span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_set_of_relation</span><span class="special"><</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
- </p>
- <p>
- <code class="computeroutput"><span class="identifier">unordered_multiset_of_relation</span><span class="special"><</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- <span class="bold"><strong>HashFunctor </strong></span> converts the <code class="computeroutput"><span class="identifier">relation</span></code> into an <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span></code> value. By default it is
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">hash</span><span class="special"><</span><span class="identifier">_relation</span><span class="special">></span></code>.
- </p>
- <p>
- <span class="bold"><strong>EqualKey </strong></span> is a Functor that tests
- two relations for equality. By default, the equality operator is
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special"><</span><span class="identifier">_relation</span><span class="special">></span></code>.
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_set_of_relation</span><span class="special"><</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
+ </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unordered_multiset_of_relation</span><span class="special"><</span><span class="identifier">HashFunctor</span><span class="special">,</span><span class="identifier">EqualKey</span><span class="special">></span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <span class="bold"><strong>HashFunctor </strong></span> converts the <code class="computeroutput"><span class="identifier">relation</span></code> into an <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span></code> value. By default it
+ is <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">hash</span><span class="special"><</span><span class="identifier">_relation</span><span class="special">></span></code>.
+ </p>
+ <p>
+ <span class="bold"><strong>EqualKey </strong></span> is a Functor that
+ tests two relations for equality. By default, the equality operator
+ is <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special"><</span><span class="identifier">_relation</span><span class="special">></span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">list_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">list_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- Not a template.
- </p>
+ <p>
+ Not a template.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">vector_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">vector_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- Not a template.
- </p>
+ <p>
+ Not a template.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">unconstrained_set_of_relation</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">unconstrained_set_of_relation</span></code>
+ </p>
</td>
<td>
- <p>
- Not a template.
- </p>
+ <p>
+ Not a template.
+ </p>
</td>
</tr>
</tbody>
</table></div>
</div>
-<div class="section" title="Examples">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.the_collection_of_relations_type.examples"></a><a class="link" href="the_collection_of_relations_type.html#boost_bimap.the_tutorial.the_collection_of_relations_type.examples" title="Examples">Examples</a>
</h4></div></div></div>
@@ -398,7 +394,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -406,7 +402,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="controlling_collection_types.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="differences_with_standard_maps.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="controlling_collection_types.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/unconstrained_sets.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Unconstrained Sets</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">
<link rel="next" href="additional_information.html" title="Additional information">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="additional_information.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="additional_information.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Unconstrained Sets">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.unconstrained_sets"></a><a class="link" href="unconstrained_sets.html" title="Unconstrained Sets">Unconstrained
Sets</a>
@@ -38,26 +38,24 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- A bimap type has stronger guarantees than its standard equivalent, and
- includes some useful functions (replace, modify) that the standard does
- not have.
- </li>
+ A bimap type has stronger guarantees than its standard equivalent, and
+ includes some useful functions (replace, modify) that the standard does
+ not have.
+ </li>
<li class="listitem">
- You can view the mapping as a collection of relations.
- </li>
+ You can view the mapping as a collection of relations.
+ </li>
<li class="listitem">
- Using this kind of map makes the code very extensible. If, at any moment
- of the development, the need to perform searches from the right side of
- the mapping arises, the only necessary change is to the <code class="computeroutput"><span class="keyword">typedef</span></code>.
- </li>
+ Using this kind of map makes the code very extensible. If, at any moment
+ of the development, the need to perform searches from the right side
+ of the mapping arises, the only necessary change is to the <code class="computeroutput"><span class="keyword">typedef</span></code>.
+ </li>
</ul></div>
<p>
Given this bimap instance,
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="identifier">unconstrained_set_of</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_map</span> <span class="identifier">map_type</span><span class="special">;</span>
@@ -66,32 +64,24 @@
<span class="identifier">map_type</span> <span class="special">&</span> <span class="identifier">m</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
or this standard map one
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">map</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span> <span class="keyword">int</span> <span class="special">></span> <span class="identifier">map_type</span><span class="special">;</span>
<span class="identifier">map_type</span> <span class="identifier">m</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The following code snippet is valid
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">m</span><span class="special">[</span><span class="string">"one"</span><span class="special">]</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
@@ -99,38 +89,32 @@
<span class="keyword">for</span><span class="special">(</span> <span class="identifier">map_type</span><span class="special">::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">iend</span> <span class="special">=</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span> <span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">iend</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span> <span class="special">)</span>
<span class="special">{</span>
- <span class="line_callout_bug"><a class="co" name="boost_bimap14co" href="unconstrained_sets.html#boost_bimap14"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="special">++(</span><span class="identifier">i</span><span class="special">-></span><span class="identifier">second</span><span class="special">);</span>
+ <a class="co" name="boost_bimap14co" href="unconstrained_sets.html#boost_bimap14"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="special">++(</span><span class="identifier">i</span><span class="special">-></span><span class="identifier">second</span><span class="special">);</span>
<span class="special">}</span>
<span class="identifier">m</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="string">"one"</span><span class="special">);</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap14"></a> </p></td>
<td valign="top" align="left"><p> The right collection of the bimap is mutable so its elements can be modified
- using iterators. </p></td>
+ using iterators. </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
<p>
But using a bimap has some benefits
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">map_type</span><span class="special">::</span><span class="identifier">const_iterator</span> <span class="identifier">const_iterator</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">></span> <span class="identifier">const_range</span><span class="special">;</span>
-<span class="line_callout_bug"><a class="co" name="boost_bimap15co" href="unconstrained_sets.html#boost_bimap15"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="identifier">const_range</span> <span class="identifier">r</span> <span class="special">=</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="string">"one"</span> <span class="special"><=</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">_key</span> <span class="special"><=</span> <span class="string">"two"</span> <span class="special">);</span>
+<a class="co" name="boost_bimap15co" href="unconstrained_sets.html#boost_bimap15"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="identifier">const_range</span> <span class="identifier">r</span> <span class="special">=</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="string">"one"</span> <span class="special"><=</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">_key</span> <span class="special"><=</span> <span class="string">"two"</span> <span class="special">);</span>
<span class="keyword">for</span><span class="special">(</span> <span class="identifier">const_iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">first</span><span class="special">;</span> <span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">second</span><span class="special">;</span> <span class="special">++</span><span class="identifier">i</span> <span class="special">)</span>
<span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">first</span> <span class="special"><<</span> <span class="string">"-->"</span> <span class="special"><<</span> <span class="identifier">i</span><span class="special">-></span><span class="identifier">second</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
@@ -139,19 +123,15 @@
<span class="identifier">m</span><span class="special">.</span><span class="identifier">modify_key</span><span class="special">(</span> <span class="identifier">m</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">_key</span> <span class="special">=</span> <span class="string">"1"</span> <span class="special">);</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap15"></a> </p></td>
<td valign="top" align="left"><p> This range is a model of BidirectionalRange, read the docs of Boost.Range
- for more information. </p></td>
+ for more information. </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
<p>
<a href="../../../../example/unconstrained_collection.cpp" target="_top">Go to source code</a>
@@ -159,7 +139,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -167,7 +147,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="additional_information.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="additional_information.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html (original)
+++ branches/release/libs/bimap/doc/html/boost_bimap/the_tutorial/useful_functions.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,10 +1,10 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Useful functions</title>
<link rel="stylesheet" href="../../boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="../../index.html" title="Chapter 1. Boost.Bimap">
<link rel="up" href="../the_tutorial.html" title="The tutorial">
<link rel="prev" href="differences_with_standard_maps.html" title="Differences with standard maps">
<link rel="next" href="bimaps_with_user_defined_names.html" title="Bimaps with user defined names">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="differences_with_standard_maps.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Useful functions">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="boost_bimap.the_tutorial.useful_functions"></a><a class="link" href="useful_functions.html" title="Useful functions">Useful functions</a>
</h3></div></div></div>
@@ -34,7 +34,7 @@
<dt><span class="section"><a href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges">Retrieval
of ranges</a></span></dt>
</dl></div>
-<div class="section" title="Projection of iterators">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.useful_functions.projection_of_iterators"></a><a class="link" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.projection_of_iterators" title="Projection of iterators">Projection
of iterators</a>
@@ -55,9 +55,7 @@
<a href="../../../../example/projection.cpp" target="_top">Go to source code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">,</span><span class="identifier">multiset_of</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">greater</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
@@ -77,11 +75,9 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="string">"The next younger person after Peter is "</span> <span class="special"><<</span> <span class="identifier">years_iter</span><span class="special">-></span><span class="identifier">second</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
-<div class="section" title="replace and modify">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.useful_functions.replace_and_modify"></a><a class="link" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.replace_and_modify" title="replace and modify">replace
and modify</a>
@@ -100,9 +96,7 @@
code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="keyword">int</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
@@ -128,24 +122,20 @@
<span class="keyword">bool</span> <span class="identifier">successful_replace</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">replace_data</span><span class="special">(</span> <span class="identifier">it</span><span class="special">,</span> <span class="string">"two"</span> <span class="special">);</span>
- <span class="line_callout_bug"><a class="co" name="boost_bimap9co" href="useful_functions.html#boost_bimap9"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="identifier">assert</span><span class="special">(</span> <span class="special">!</span> <span class="identifier">successful_replace</span> <span class="special">);</span>
+ <a class="co" name="boost_bimap9co" href="useful_functions.html#boost_bimap9"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="identifier">assert</span><span class="special">(</span> <span class="special">!</span> <span class="identifier">successful_replace</span> <span class="special">);</span>
<span class="identifier">assert</span><span class="special">(</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">==</span> <span class="number">2</span> <span class="special">);</span>
<span class="special">}</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap9"></a> </p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">it</span></code> is still valid here,
- and the bimap was left unchanged </p></td>
+ and the bimap was left unchanged </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
<p>
<code class="computeroutput"><span class="identifier">replace</span></code> functions performs
@@ -153,17 +143,17 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- The complexity is constant time if the changed element retains its original
- order with respect to all views; it is logarithmic otherwise.
- </li>
+ The complexity is constant time if the changed element retains its
+ original order with respect to all views; it is logarithmic otherwise.
+ </li>
<li class="listitem">
- Iterator and reference validity are preserved.
- </li>
+ Iterator and reference validity are preserved.
+ </li>
<li class="listitem">
- The operation is strongly exception-safe, i.e. the <code class="computeroutput"><span class="identifier">bimap</span></code>
- remains unchanged if some exception (originated by the system or the
- user's data types) is thrown.
- </li>
+ The operation is strongly exception-safe, i.e. the <code class="computeroutput"><span class="identifier">bimap</span></code>
+ remains unchanged if some exception (originated by the system or the
+ user's data types) is thrown.
+ </li>
</ul></div>
<p>
<code class="computeroutput"><span class="identifier">replace</span></code> functions are powerful
@@ -209,9 +199,7 @@
code</a>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span> <span class="keyword">int</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
@@ -236,27 +224,23 @@
<span class="keyword">bool</span> <span class="identifier">successful_modify</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">modify_data</span><span class="special">(</span> <span class="identifier">it</span><span class="special">,</span> <span class="identifier">_data</span> <span class="special">=</span> <span class="string">"two"</span> <span class="special">);</span>
- <span class="line_callout_bug"><a class="co" name="boost_bimap10co" href="useful_functions.html#boost_bimap10"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="identifier">assert</span><span class="special">(</span> <span class="special">!</span> <span class="identifier">successful_modify</span> <span class="special">);</span>
+ <a class="co" name="boost_bimap10co" href="useful_functions.html#boost_bimap10"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="identifier">assert</span><span class="special">(</span> <span class="special">!</span> <span class="identifier">successful_modify</span> <span class="special">);</span>
<span class="identifier">assert</span><span class="special">(</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span> <span class="special">==</span> <span class="number">1</span> <span class="special">);</span>
<span class="special">}</span>
</pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap10"></a> </p></td>
<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">it</span></code> is not longer valid
- and <code class="computeroutput"><span class="special">(</span><span class="number">1</span><span class="special">,</span><span class="string">"1"</span><span class="special">)</span></code> is removed from the bimap </p></td>
+ and <code class="computeroutput"><span class="special">(</span><span class="number">1</span><span class="special">,</span><span class="string">"1"</span><span class="special">)</span></code> is removed from the bimap </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
</div>
-<div class="section" title="Retrieval of ranges">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges"></a><a class="link" href="useful_functions.html#boost_bimap.the_tutorial.useful_functions.retrieval_of_ranges" title="Retrieval of ranges">Retrieval
of ranges</a>
@@ -271,9 +255,7 @@
<code class="computeroutput"><span class="special">[</span><span class="number">20</span><span class="special">,</span><span class="number">50</span><span class="special">]</span></code>
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
@@ -286,8 +268,6 @@
<span class="comment">// range [iter_first,iter_second) contains the elements in [20,50]
</span></pre>
<p>
- </p>
-<p>
</p>
<p>
Subtle changes to the code are required when strict inequalities are considered.
@@ -295,9 +275,7 @@
to be rewritten as
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span> <span class="identifier">iter_first</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">upper_bound</span><span class="special">(</span><span class="number">20</span><span class="special">);</span>
<span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_iterator</span> <span class="identifier">iter_second</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">lower_bound</span><span class="special">(</span><span class="number">50</span><span class="special">);</span>
@@ -305,8 +283,6 @@
<span class="comment">// range [iter_first,iter_second) contains the elements in (20,50)
</span></pre>
<p>
- </p>
-<p>
</p>
<p>
To add to this complexity, the careful programmer has to take into account
@@ -322,46 +298,41 @@
can greatly help alleviate this situation:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">typedef</span> <span class="identifier">bimap</span><span class="special"><</span><span class="keyword">int</span><span class="special">,</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="identifier">bm_type</span><span class="special">;</span>
<span class="identifier">bm_type</span> <span class="identifier">bm</span><span class="special">;</span>
<span class="comment">// ...
</span>
-<span class="line_callout_bug"><a class="co" name="boost_bimap11co" href="useful_functions.html#boost_bimap11"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_range_type</span> <span class="identifier">r</span><span class="special">;</span>
+<a class="co" name="boost_bimap11co" href="useful_functions.html#boost_bimap11"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="identifier">bm_type</span><span class="special">::</span><span class="identifier">left_range_type</span> <span class="identifier">r</span><span class="special">;</span>
-<span class="line_callout_bug"><a class="co" name="boost_bimap12co" href="useful_functions.html#boost_bimap12"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a></span><span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="number">20</span> <span class="special"><=</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">_key</span> <span class="special"><=</span> <span class="number">50</span> <span class="special">);</span> <span class="comment">// [20,50]
+<a class="co" name="boost_bimap12co" href="useful_functions.html#boost_bimap12"><img src="../../../../../../doc/src/images/callouts/2.png" alt="2" border="0"></a><span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="number">20</span> <span class="special"><=</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">_key</span> <span class="special"><=</span> <span class="number">50</span> <span class="special">);</span> <span class="comment">// [20,50]
</span>
<span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="number">20</span> <span class="special"><</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">_key</span> <span class="special"><</span> <span class="number">50</span> <span class="special">);</span> <span class="comment">// (20,50)
</span>
<span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="number">20</span> <span class="special"><=</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">_key</span> <span class="special"><</span> <span class="number">50</span> <span class="special">);</span> <span class="comment">// [20,50)
</span></pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list">
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap11"></a> </p></td>
-<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">range_type</span></code> is a handy
- typedef equal to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">></span></code>. <code class="computeroutput"><span class="identifier">const_range_type</span></code>
- is provided too, and it is equal to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">></span></code> </p></td>
+<td valign="top" align="left"><p> <code class="computeroutput"><span class="identifier">range_type</span></code> is a handy typedef
+ equal to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">></span></code>.
+ <code class="computeroutput"><span class="identifier">const_range_type</span></code> is provided
+ too, and it is equal to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">const_iterator</span><span class="special">,</span><span class="identifier">const_iterator</span><span class="special">></span></code> </p></td>
</tr>
<tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap12"></a> </p></td>
<td valign="top" align="left"><p> _key is a Boost.Lambda placeholder.
- To use it you have to include <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">support</span><span class="special">/</span><span class="identifier">lambda</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
- </p></td>
+ To use it you have to include <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">bimap</span><span class="special">/</span><span class="identifier">support</span><span class="special">/</span><span class="identifier">lambda</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p></td>
</tr>
</table></div>
<p>
- </p>
-<p>
</p>
<p>
<code class="computeroutput"><span class="identifier">range</span></code> simply accepts predicates
@@ -373,29 +344,23 @@
One or both bounds can be omitted with the special unbounded marker:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="number">20</span> <span class="special"><=</span> <span class="identifier">_key</span><span class="special">,</span> <span class="identifier">unbounded</span> <span class="special">);</span> <span class="comment">// [20,inf)
</span>
<span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="identifier">unbounded</span> <span class="special">,</span> <span class="identifier">_key</span> <span class="special"><</span> <span class="number">50</span> <span class="special">);</span> <span class="comment">// (-inf,50)
</span>
-<span class="line_callout_bug"><a class="co" name="boost_bimap13co" href="useful_functions.html#boost_bimap13"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a></span><span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="identifier">unbounded</span> <span class="special">,</span> <span class="identifier">unbounded</span> <span class="special">);</span> <span class="comment">// (-inf,inf)
+<a class="co" name="boost_bimap13co" href="useful_functions.html#boost_bimap13"><img src="../../../../../../doc/src/images/callouts/1.png" alt="1" border="0"></a><span class="identifier">r</span> <span class="special">=</span> <span class="identifier">bm</span><span class="special">.</span><span class="identifier">left</span><span class="special">.</span><span class="identifier">range</span><span class="special">(</span> <span class="identifier">unbounded</span> <span class="special">,</span> <span class="identifier">unbounded</span> <span class="special">);</span> <span class="comment">// (-inf,inf)
</span></pre>
<p>
- </p>
+ </p>
<p>
</p>
-<p>
- </p>
<div class="calloutlist"><table border="0" summary="Callout list"><tr>
<td width="5%" valign="top" align="left"><p><a name="boost_bimap13"></a> </p></td>
<td valign="top" align="left"><p> This is equivalent to std::make_pair(s.begin(),s.end()) </p></td>
</tr></table></div>
<p>
- </p>
-<p>
</p>
<p>
<a href="../../../../example/tutorial_range.cpp" target="_top">Go to source code</a>
@@ -404,7 +369,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
+<td align="right"><div class="copyright-footer">Copyright © 2006 -2007 Matias Capeletto<p>
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)
</p>
@@ -412,7 +377,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="differences_with_standard_maps.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="differences_with_standard_maps.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../the_tutorial.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bimaps_with_user_defined_names.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/bimap/doc/html/index.html (original)
+++ branches/release/libs/bimap/doc/html/index.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,33 +1,33 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Chapter 1. Boost.Bimap</title>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter 1. Boost.Bimap</title>
<link rel="stylesheet" href="boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
-<link rel="home" href="index.html" title="Chapter 1. Boost.Bimap">
+<link rel="home" href="index.html" title="Chapter 1. Boost.Bimap">
<link rel="next" href="boost_bimap/introduction.html" title="Introduction">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="boost_bimap/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="chapter" title="Chapter 1. Boost.Bimap">
+<div class="spirit-nav"><a accesskey="n" href="boost_bimap/introduction.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
+<div class="chapter">
<div class="titlepage"><div>
<div><h2 class="title">
-<a name="bimap"></a>Chapter 1. Boost.Bimap</h2></div>
+<a name="bimap"></a>Chapter 1. Boost.Bimap</h2></div>
<div><div class="author"><h3 class="author">
<span class="firstname">Matias</span> <span class="surname">Capeletto</span>
</h3></div></div>
-<div><p class="copyright">Copyright © 2006 -2007 Matias Capeletto</p></div>
-<div><div class="legalnotice" title="Legal Notice">
-<a name="id553942"></a><p>
+<div><p class="copyright">Copyright © 2006 -2007 Matias Capeletto</p></div>
+<div><div class="legalnotice">
+<a name="id759689"></a><p>
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)
</p>
@@ -115,12 +115,12 @@
<dt><span class="section">Acknowledgements</span></dt>
</dl>
</div>
-<div class="section" title="Preface">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="bimap.preface"></a><a class="link" href="index.html#bimap.preface" title="Preface">Preface</a>
</h2></div></div></div>
<a name="bimap.preface.description"></a><h4>
-<a name="id553973"></a>
+<a name="id759719"></a>
<a class="link" href="index.html#bimap.preface.description">Description</a>
</h4>
<p>
@@ -137,22 +137,22 @@
containers.
</p>
<a name="bimap.preface.influences_and_related_work"></a><h4>
-<a name="id554118"></a>
+<a name="id759864"></a>
<a class="link" href="index.html#bimap.preface.influences_and_related_work">Influences and Related
Work</a>
</h4>
<p>
The design of Boost.Bimap interface follows the standard template library.
- It has been strongly influenced by Joaquin Lopez Muñoz's Boost.MultiIndex
+ It has been strongly influenced by Joaquin Lopez Muñoz's Boost.MultiIndex
library (the heart of bimaps) and codeproject::bimap library.
</p>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: November 20, 2009 at 09:43:59 GMT</small></p></td>
+<td align="left"><p><small>Last revised: July 19, 2010 at 19:07:28 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="boost_bimap/introduction.html"><img src="../../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="spirit-nav"><a accesskey="n" href="boost_bimap/introduction.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div>
</body>
</html>
==============================================================================
--- branches/release/libs/numeric/conversion/doc/Jamfile.v2 (original)
+++ branches/release/libs/numeric/conversion/doc/Jamfile.v2 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -25,6 +25,7 @@
conversion
:
<xsl:param>boost.root=../../../../..
+ <xsl:param>html.stylesheet=boostbook.css
<xsl:param>toc.max.depth=2
<xsl:param>toc.section.depth=2
<xsl:param>chunk.section.depth=1
==============================================================================
--- branches/release/libs/optional/doc/Jamfile.v2 (original)
+++ branches/release/libs/optional/doc/Jamfile.v2 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -24,6 +24,7 @@
optional
:
<xsl:param>boost.root=../../../..
+ <xsl:param>html.stylesheet=boostbook.css
<xsl:param>toc.max.depth=2
<xsl:param>toc.section.depth=2
<xsl:param>chunk.section.depth=1
==============================================================================
--- branches/release/libs/property_map/doc/dynamic_property_map.html (original)
+++ branches/release/libs/property_map/doc/dynamic_property_map.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -5,7 +5,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta name="generator" content="Docutils 0.6: http://docutils.sourceforge.net/" />
<title>Boost Dynamic Property Maps</title>
-<link rel="stylesheet" href="../../parameter/doc/src/rst.css" type="text/css" />
+<link rel="stylesheet" href="../../parameter/doc/html/rst.css" type="text/css" />
</head>
<body>
<div class="document" id="logo-dynamic-property-maps">
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_general_requirements.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,141 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>General Requirements</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="adaptors_synopsis.html" title="Synopsis">
-<link rel="next" href="adaptors_reference.html" title="Reference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="General Requirements">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.adaptors_general_requirements"></a><a class="link" href="adaptors_general_requirements.html" title="General Requirements">
- General Requirements</a>
-</h4></div></div></div>
-<p>
- In the description of generator expressions, the following notation is
- used:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">fwdRng</span></code> is an expression
- of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
- <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">biRng</span></code> is an expression
- of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
- <code class="computeroutput"><span class="identifier">BidirectionalRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">rndRng</span></code> is an expression
- of a type <code class="computeroutput"><span class="identifier">R</span></code> that models
- <code class="computeroutput"><span class="identifier">RandomAccessRange</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">pred</span></code> is an expression
- of a type that models <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">bi_pred</span></code> is an expression
- of a type that models <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">fun</span></code> is an expression
- of a type that models <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">value</span></code>, <code class="computeroutput"><span class="identifier">new_value</span></code> and <code class="computeroutput"><span class="identifier">old_value</span></code>
- are objects convertible to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special"><</span><span class="identifier">R</span><span class="special">>::</span><span class="identifier">type</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span></code> are integer expressions convertible
- to <code class="computeroutput"><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">R</span><span class="special">>::</span><span class="identifier">type</span></code>
-</li>
-</ul></div>
-<p>
- Also note that <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_value</span><span class="special"><</span><span class="identifier">R</span><span class="special">>::</span><span class="identifier">type</span></code> must be implicitly convertible to
- the type arguments to <code class="computeroutput"><span class="identifier">pred</span></code>,
- <code class="computeroutput"><span class="identifier">bi_pred</span></code> and <code class="computeroutput"><span class="identifier">fun</span></code>.
- </p>
-<p>
- Range Category in the following adaptor descriptions refers to the minimum
- range concept required by the range passed to the adaptor. The resultant
- range is a model of the same range concept as the input range unless specified
- otherwise.
- </p>
-<p>
- Returned Range Category is the concept of the returned range. In some cases
- the returned range is of a lesser category than the range passed to the
- adaptor. For example, the <code class="computeroutput"><span class="identifier">filtered</span></code>
- adaptor returns only a <code class="computeroutput"><span class="identifier">ForwardRange</span></code>
- regardless of the input.
- </p>
-<p>
- Furthermore, the following rules apply to any expression of the form
-</p>
-<pre class="programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adaptor_generator</span>
-</pre>
-<p>
- </p>
-<p>
- 1. Applying <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- to a range <code class="computeroutput"><span class="identifier">R</span></code> (always left
- argument) and a range adapter <code class="computeroutput"><span class="identifier">RA</span></code>
- (always right argument) yields a new range type which may not conform to
- the same range concept as <code class="computeroutput"><span class="identifier">R</span></code>.
- </p>
-<p>
- 2. The return-type of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code> is otherwise unspecified.
- </p>
-<p>
- 3. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- is found by Argument Dependent Lookup (ADL) because a range adaptor is
- implemented in namespace <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span></code>.
- </p>
-<p>
- 4. <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- is used to add new behaviour <span class="emphasis"><em><span class="bold"><strong>lazily</strong></span></em></span>
- and never modifies its left argument.
- </p>
-<p>
- 5. All iterators extracted from the left argument are extracted using qualified
- calls to <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">()</span></code>
- and <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">()</span></code>.
- </p>
-<p>
- 6. In addition to the <code class="computeroutput"><span class="keyword">throw</span></code>-clauses
- below, <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>
- may throw exceptions as a result of copying iterators. If such copying
- cannot throw an exception, then neither can the whole expression.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_introduction.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,274 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction and motivation</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="../adaptors.html" title="Range Adaptors">
-<link rel="next" href="adaptors_synopsis.html" title="Synopsis">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction and motivation">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.adaptors_introduction"></a><a class="link" href="adaptors_introduction.html" title="Introduction and motivation"> Introduction
- and motivation</a>
-</h4></div></div></div>
-<p>
- A <span class="bold"><strong>Range Adaptor</strong></span> is a class that wraps
- an existing Range to provide a new Range with different behaviour. Since
- the behaviour of Ranges is determined by their associated iterators, a
- Range Adaptor simply wraps the underlying iterators with new special iterators.
- In this example
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptors</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iostream</span><span class="special">></span>
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">vector</span><span class="special">></span>
-
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- the iterators from <code class="computeroutput"><span class="identifier">vec</span></code>
- are wrapped <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>s.
- The type of the underlying Range Adapter is not documented because you
- do not need to know it. All that is relevant is that the expression
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
-</pre>
-<p>
- </p>
-<p>
- returns a Range Adaptor where the iterator type is now the iterator type
- of the range <code class="computeroutput"><span class="identifier">vec</span></code> wrapped
- in <code class="computeroutput"><span class="identifier">reverse_iterator</span></code>. The
- expression <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span></code> is called an <span class="bold"><strong>Adaptor
- Generator</strong></span>.
- </p>
-<p>
- There are two ways of constructing a range adaptor. The first is by using
- <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
- This is my preferred technique, however while discussing range adaptors
- with others it became clear that some users of the library strongly prefer
- a more familiar function syntax, so equivalent functions of the present
- tense form have been added as an alternative syntax. The equivalent to
- <code class="computeroutput"><span class="identifier">rng</span> <span class="special">|</span>
- <span class="identifier">reversed</span></code> is <code class="computeroutput"><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> for example.
- </p>
-<p>
- Why do I prefer the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code> syntax? The answer is readability:
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- This might not look so bad, but when we apply several adaptors, it becomes
- much worse. Just compare
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">)</span> <span class="special">),</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- to
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
- <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">uniqued</span><span class="special">,</span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">)</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- Furthermore, some of the adaptor generators take arguments themselves and
- these arguments are expressed with function call notation too. In those
- situations, you will really appreciate the succinctness of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
- </p>
-<a name="range.reference.adaptors.adaptors_introduction.composition_of_adaptors"></a><h6>
-<a name="id3057363"></a>
- <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.composition_of_adaptors">Composition
- of Adaptors</a>
- </h6>
-<p>
- Range Adaptors are a powerful complement to Range algorithms. The reason
- is that adaptors are <span class="emphasis"><em><span class="bold"><strong>orthogonal</strong></span></em></span>
- to algorithms. For example, consider these Range algorithms:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">)</span></code></li>
-</ul></div>
-<p>
- What should we do if we only want to copy an element <code class="computeroutput"><span class="identifier">a</span></code>
- if it satisfies some predicate, say <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code>?
- And what if we only want to count the elements that satisfy the same predicate?
- The naive answer would be to use these algorithms:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span>
- <span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">pred</span><span class="special">,</span>
- <span class="identifier">out</span> <span class="special">)</span></code></li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span>
- <span class="identifier">rng</span><span class="special">,</span>
- <span class="identifier">pred</span> <span class="special">)</span></code></li>
-</ul></div>
-<p>
- These algorithms are only defined to maintain a one to one relationship
- with the standard library algorithms. This approach of adding algorithm
- suffers a combinatorial explosion. Inevitably many algorithms are missing
- <code class="computeroutput"><span class="identifier">_if</span></code> variants and there
- is redundant development overhead for each new algorithm. The Adaptor Generator
- is the design solution to this problem.
- </p>
-<a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id3057673"></a>
- <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
- Adaptor alternative to copy_if algorithm</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">);</span>
-</pre>
-<p>
- can be expressed as
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id3057842"></a>
- <a class="link" href="adaptors_introduction.html#range.reference.adaptors.adaptors_introduction.range_adaptor_alternative_to_count_if_algorithm">Range
- Adaptor alternative to count_if algorithm</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">);</span>
-</pre>
-<p>
- can be expressed as
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- What this means is that <span class="emphasis"><em><span class="bold"><strong>no</strong></span></em></span>
- algorithm with the <code class="computeroutput"><span class="identifier">_if</span></code>
- suffix is needed. Furthermore, it turns out that algorithms with the <code class="computeroutput"><span class="identifier">_copy</span></code> suffix are not needed either. Consider
- the somewhat misdesigned <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">()</span></code> which may be used as
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- With adaptors and algorithms we can express this as
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
-<span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">));</span>
-</pre>
-<p>
- </p>
-<p>
- The latter code has several benefits:
- </p>
-<p>
- 1. it is more <span class="emphasis"><em><span class="bold"><strong>efficient</strong></span></em></span>
- because we avoid extra allocations as might happen with <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span></code>
- </p>
-<p>
- 2. it is <span class="emphasis"><em><span class="bold"><strong>flexible</strong></span></em></span>
- as we can subsequently apply even more adaptors, for example:
-</p>
-<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">)</span>
- <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- 3. it is <span class="emphasis"><em><span class="bold"><strong>safer</strong></span></em></span> because
- there is no use of an unbounded output iterator.
- </p>
-<p>
- In this manner, the <span class="emphasis"><em><span class="bold"><strong>composition</strong></span></em></span>
- of Range Adaptors has the following consequences:
- </p>
-<p>
- 1. we no longer need <code class="computeroutput"><span class="identifier">_if</span></code>,
- <code class="computeroutput"><span class="identifier">_copy</span></code>, <code class="computeroutput"><span class="identifier">_copy_if</span></code>
- and <code class="computeroutput"><span class="identifier">_n</span></code> variants of algorithms.
- </p>
-<p>
- 2. we can generate a multitude of new algorithms on the fly, for example,
- above we generated <code class="computeroutput"><span class="identifier">reverse_replace_copy_if</span><span class="special">()</span></code>
- </p>
-<p>
- In other words:
- </p>
-<p>
- <span class="bold"><strong>Range Adaptors are to algorithms what algorithms
- are to containers</strong></span>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../adaptors.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors_synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/adaptors_synopsis.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,67 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Synopsis</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../adaptors.html" title="Range Adaptors">
-<link rel="prev" href="introduction.html" title="Introduction and motivation">
-<link rel="next" href="general_requirements.html" title="General Requirements">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Synopsis">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.adaptors.adaptors_synopsis"></a><a class="link" href="adaptors_synopsis.html" title="Synopsis"> Synopsis</a>
-</h4></div></div></div>
-<p>
- The library provides the following Adapter Generator expressions:
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adjacent_filtered</span><span class="special">(</span><span class="identifier">bi_pred</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">copied</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span><span class="identifier">m</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indexed</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">indirected</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">map_keys</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">map_values</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced</span><span class="special">(</span><span class="identifier">new_value</span><span class="special">,</span> <span class="identifier">old_value</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">sliced</span><span class="special">(</span><span class="identifier">n</span><span class="special">,</span> <span class="identifier">m</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">strided</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span> <span class="special"><</span><span class="identifier">see</span> <span class="identifier">arguments</span> <span class="identifier">below</span><span class="special">></span> <span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">transformed</span><span class="special">(</span><span class="identifier">fun</span><span class="special">)</span>
-<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">uniqued</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,64 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>-mutating Non-mutating algorithms</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../algorithms.html" title="Range Algorithm">
-<link rel="prev" href="mutating/unique.html" title="unique">
-<link rel="next" href="non/adjacent_find.html" title="adjacent_find">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mutating/unique.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="-mutating Non-mutating algorithms">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.algorithms.non"></a><a class="link" href="non.html" title="-mutating Non-mutating algorithms">-mutating Non-mutating
- algorithms</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"> adjacent_find</span></dt>
-<dt><span class="section"> binary_search</span></dt>
-<dt><span class="section"> count</span></dt>
-<dt><span class="section"> equal</span></dt>
-<dt><span class="section"> equal_range</span></dt>
-<dt><span class="section"> for_each</span></dt>
-<dt><span class="section"> find</span></dt>
-<dt><span class="section"> find_end</span></dt>
-<dt><span class="section"> find_first_of</span></dt>
-<dt><span class="section"> find_if</span></dt>
-<dt><span class="section"><a href="non/lexicographical_compare.html">
- lexicographical_compare</a></span></dt>
-<dt><span class="section"> lower_bound</span></dt>
-<dt><span class="section"> max_element</span></dt>
-<dt><span class="section"> min_element</span></dt>
-<dt><span class="section"> mismatch</span></dt>
-<dt><span class="section"> search</span></dt>
-<dt><span class="section"> upper_bound</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="mutating/unique.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/overview.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,68 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Overview</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../concept_implementation.html" title="Range concept implementation">
-<link rel="prev" href="../concept_implementation.html" title="Range concept implementation">
-<link rel="next" href="synopsis.html" title="Synopsis">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Overview">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.concept_implementation.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
-</h4></div></div></div>
-<p>
- Three types of objects are currently supported by the library:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- standard-like containers
- </li>
-<li class="listitem"><code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">,</span><span class="identifier">iterator</span><span class="special">></span></code></li>
-<li class="listitem">
- built-in arrays
- </li>
-</ul></div>
-<p>
- Even though the behavior of the primary templates are exactly such that
- standard containers will be supported by default, the requirements are
- much lower than the standard container requirements. For example, the utility
- class <a class="link" href="../utilities/iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> implements the
- <a class="link" href="../extending.html" title="Extending the library">minimal interface</a> required
- to make the class a <a class="link" href="../../concepts/forward_range.html" title="Forward Range">Forward
- Range</a>.
- </p>
-<p>
- Please also see <a class="link" href="../../concepts.html" title="Range Concepts">Range concepts</a> for
- more details.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="synopsis.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/range_algorithm.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,52 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Range Algorithm</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="adaptors/adaptors_reference/uniqued.html" title="uniqued">
-<link rel="next" href="range_algorithm/range_algorithm_introduction.html" title="Introduction and motivation">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors/adaptors_reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Range Algorithm">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.range_algorithm"></a><a class="link" href="range_algorithm.html" title="Range Algorithm"> Range Algorithm</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="range_algorithm/range_algorithm_introduction.html">
- Introduction and motivation</a></span></dt>
-<dt><span class="section"><a href="range_algorithm/range_algorithm_mutating_algorithms.html">
- Mutating algorithms</a></span></dt>
-<dt><span class="section"><a href="range_algorithm/range_algorithm_non_mutating_algorithms.html">
- Non-mutating algorithms</a></span></dt>
-<dt><span class="section"></span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="adaptors/adaptors_reference/uniqued.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="range_algorithm/range_algorithm_introduction.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/introduction.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,46 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Introduction</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="../ranges.html" title="Provided Ranges">
-<link rel="next" href="reference.html" title="Reference">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Introduction">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.introduction"></a><a class="link" href="introduction.html" title="Introduction"> Introduction</a>
-</h4></div></div></div>
-<p>
- The Boost.Range library provides some of the more commonly required ranges.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../ranges.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/reference.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,50 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Reference</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../ranges.html" title="Provided Ranges">
-<link rel="prev" href="introduction.html" title="Introduction">
-<link rel="next" href="reference/counting_range.html" title="counting_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/counting_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Reference">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.ranges.reference"></a><a class="link" href="reference.html" title="Reference"> Reference</a>
-</h4></div></div></div>
-<div class="toc"><dl>
-<dt><span class="section"><a href="reference/counting_range.html">
- counting_range</a></span></dt>
-<dt><span class="section"><a href="reference/istream_range.html">
- istream_range</a></span></dt>
-<dt><span class="section"> irange</span></dt>
-</dl></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="reference/counting_range.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/reference/counting_range.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,91 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>counting_range</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="../reference.html" title="Reference">
-<link rel="next" href="istream_range.html" title="istream_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="counting_range">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.ranges.reference.counting_range"></a><a class="link" href="counting_range.html" title="counting_range">
- counting_range</a>
-</h5></div></div></div>
-<a name="range.reference.ranges.reference.counting_range.prototype"></a><h6>
-<a name="id3262203"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.reference.counting_range.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Incrementable</span> <span class="special">></span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">counting_iterator</span><span class="special"><</span><span class="identifier">Incrementable</span><span class="special">></span> <span class="special">></span>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">Incrementable</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Incrementable</span> <span class="identifier">last</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange</span> <span class="special">></span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">counting_iterator</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange</span> <span class="special">></span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">counting_iterator</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
-<span class="identifier">counting_range</span><span class="special">(</span><span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.ranges.reference.counting_range.description"></a><h6>
-<a name="id3262589"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.reference.counting_range.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">counting_range</span></code> is a function
- to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- wrapping a <code class="computeroutput"><span class="identifier">counting_iterator</span></code>
- (from Boost.Iterator).
- </p>
-<a name="range.reference.ranges.reference.counting_range.definition"></a><h6>
-<a name="id3262649"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.reference.counting_range.definition">Definition</a>
- </h6>
-<p>
- Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">counting_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.ranges.reference.counting_range.requirements"></a><h6>
-<a name="id3262714"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.reference.counting_range.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
-<code class="computeroutput"><span class="identifier">Incrementable</span></code> is a
- model of the <code class="computeroutput"><span class="identifier">Incrementable</span></code>
- Concept.
- </li></ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../reference.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/reference/irange.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,104 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>irange</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="istream_range.html" title="istream_range">
-<link rel="next" href="../../extending.html" title="Extending the library">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="istream_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../extending.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="irange">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.ranges.reference.irange"></a><a class="link" href="irange.html" title="irange"> irange</a>
-</h5></div></div></div>
-<a name="range.reference.ranges.reference.irange.prototype"></a><h6>
-<a name="id3263158"></a>
- <a class="link" href="irange.html#range.reference.ranges.reference.irange.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">></span>
-<span class="identifier">integer_range</span><span class="special"><</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator</span><span class="special"><</span><span class="identifier">Integer</span><span class="special">></span> <span class="special">></span>
-<span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">last</span><span class="special">);</span>
-
-<span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">StepSize</span><span class="special">></span>
-<span class="identifier">integer_range</span><span class="special"><</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator_with_step</span><span class="special"><</span><span class="identifier">Integer</span><span class="special">,</span> <span class="identifier">StepSize</span><span class="special">></span> <span class="special">></span>
-<span class="identifier">irange</span><span class="special">(</span><span class="identifier">Integer</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Integer</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">StepSize</span> <span class="identifier">step_size</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.ranges.reference.irange.description"></a><h6>
-<a name="id3263454"></a>
- <a class="link" href="irange.html#range.reference.ranges.reference.irange.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">irange</span></code> is a function
- to generate an Integer Range.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">irange</span></code> allows treating
- integers as a model of the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a> Concept. It should be noted that the <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code>
- parameters denoted a half-open range.
- </p>
-<a name="range.reference.ranges.reference.irange.definition"></a><h6>
-<a name="id3263535"></a>
- <a class="link" href="irange.html#range.reference.ranges.reference.irange.definition">Definition</a>
- </h6>
-<p>
- Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">irange</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-<a name="range.reference.ranges.reference.irange.requirements"></a><h6>
-<a name="id3263598"></a>
- <a class="link" href="irange.html#range.reference.ranges.reference.irange.requirements">Requirements</a>
- </h6>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">Integer</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">Integer</span></code> Concept.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">StepSize</span></code> is a model
- of the <code class="computeroutput"><span class="identifier">SignedInteger</span></code>
- Concept.
- </li>
-</ol></div>
-<a name="range.reference.ranges.reference.irange.complexity"></a><h6>
-<a name="id3263679"></a>
- <a class="link" href="irange.html#range.reference.ranges.reference.irange.complexity">Complexity</a>
- </h6>
-<p>
- Constant. Since this function generates a new range the most significant
- performance cost is incurred through the iteration of the generated range.
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="istream_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../extending.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/reference/istream_range.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,73 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>istream_range</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="counting_range.html" title="counting_range">
-<link rel="next" href="irange.html" title="irange">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="counting_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="istream_range">
-<div class="titlepage"><div><div><h5 class="title">
-<a name="range.reference.ranges.reference.istream_range"></a><a class="link" href="istream_range.html" title="istream_range">
- istream_range</a>
-</h5></div></div></div>
-<a name="range.reference.ranges.reference.istream_range.prototype"></a><h6>
-<a name="id3262788"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.reference.istream_range.prototype">Prototype</a>
- </h6>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Type</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">></span> <span class="keyword">inline</span>
-<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">></span> <span class="special">></span>
-<span class="identifier">istream_range</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_istream</span><span class="special"><</span><span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">>&</span> <span class="identifier">in</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.reference.ranges.reference.istream_range.description"></a><h6>
-<a name="id3263008"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.reference.istream_range.description">Description</a>
- </h6>
-<p>
- <code class="computeroutput"><span class="identifier">istream_range</span></code> is a function
- to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- wrapping a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span></code>.
- </p>
-<a name="range.reference.ranges.reference.istream_range.definition"></a><h6>
-<a name="id3263077"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.reference.istream_range.definition">Definition</a>
- </h6>
-<p>
- Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">istream_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="counting_range.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/semantics/functions.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,408 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Functions</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../semantics.html" title="Semantics">
-<link rel="prev" href="metafunctions.html" title="Metafunctions">
-<link rel="next" href="../adaptors.html" title="Range Adaptors">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="metafunctions.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../adaptors.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Functions">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.semantics.functions"></a><a class="link" href="functions.html" title="Functions">Functions</a>
-</h4></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Return type
- </p>
- </th>
-<th>
- <p>
- Returns
- </p>
- </th>
-<th>
- <p>
- Complexity
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">first</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
- is of type <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code> <code class="computeroutput"><span class="identifier">a</span></code>
- if <code class="computeroutput"><span class="identifier">a</span></code> is an array
- <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- if that expression would invoke a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
- otherwise
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">p</span><span class="special">.</span><span class="identifier">second</span></code> if <code class="computeroutput"><span class="identifier">p</span></code>
- is of type <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code> <code class="computeroutput"><span class="identifier">a</span>
- <span class="special">+</span> <span class="identifier">sz</span></code>
- if <code class="computeroutput"><span class="identifier">a</span></code> is an array
- of size <code class="computeroutput"><span class="identifier">sz</span></code> <code class="computeroutput"><span class="identifier">range_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- if that expression would invoke a function found by ADL <code class="computeroutput"><span class="identifier">t</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
- otherwise
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="keyword">bool</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span>
- <span class="special">==</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- -
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span>
- <span class="special">-</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_end</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">const_rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td>
- <p>
- constant time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">U</span><span class="special">></span></code> where <code class="computeroutput"><span class="identifier">U</span></code>
- is <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
- if <code class="computeroutput"><span class="identifier">x</span></code> is a pointer
- to a string and <code class="computeroutput"><span class="identifier">U</span></code>
- is <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- otherwise
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">s</span><span class="special">,</span><span class="identifier">s</span>
- <span class="special">+</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">char_traits</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">length</span><span class="special">(</span><span class="identifier">s</span><span class="special">))</span></code> if <code class="computeroutput"><span class="identifier">s</span></code>
- is a <code class="computeroutput"><span class="identifier">Char</span><span class="special">*</span></code>
- or an array of <code class="computeroutput"><span class="identifier">Char</span></code>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code> otherwise
- </p>
- </td>
-<td>
- <p>
- linear time for pointers to a string or arrays of <code class="computeroutput"><span class="identifier">Char</span></code>, constant time otherwise
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">as_array</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">X</span><span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">x</span><span class="special">),</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">x</span><span class="special">))</span></code>
- </p>
- </td>
-<td class="auto-generated"> </td>
-</tr>
-</tbody>
-</table></div>
-<p>
- The special <code class="computeroutput"><span class="identifier">const_</span></code>-named
- functions are useful when you want to document clearly that your code is
- read-only.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">as_literal</span><span class="special">()</span></code>
- can be used <span class="emphasis"><em><span class="bold"><strong>internally</strong></span></em></span>
- in string algorithm libraries such that arrays of characters are handled
- correctly.
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">as_array</span><span class="special">()</span></code>
- can be used with string algorithm libraries to make it clear that arrays
- of characters are handled like an array and not like a string.
- </p>
-<p>
- Notice that the above functions should always be called with qualification
- (<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span></code>)
- to prevent <span class="emphasis"><em><span class="bold"><strong>unintended</strong></span></em></span>
- Argument Dependent Lookup (ADL).
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="metafunctions.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../adaptors.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/semantics/metafunctions.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,236 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Metafunctions</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../semantics.html" title="Semantics">
-<link rel="prev" href="../semantics.html" title="Semantics">
-<link rel="next" href="functions.html" title="Functions">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../semantics.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Metafunctions">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="range.reference.semantics.metafunctions"></a><a class="link" href="metafunctions.html" title="Metafunctions">Metafunctions</a>
-</h4></div></div></div>
-<div class="informaltable"><table class="table">
-<colgroup>
-<col>
-<col>
-<col>
-</colgroup>
-<thead><tr>
-<th>
- <p>
- Expression
- </p>
- </th>
-<th>
- <p>
- Return type
- </p>
- </th>
-<th>
- <p>
- Complexity
- </p>
- </th>
-</tr></thead>
-<tbody>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
-
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">iterator</span>
-<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
-<span class="identifier">A</span><span class="special">*</span>
-</pre>
-<p>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
-
-</p>
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">const_iterator</span>
-<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
-<span class="keyword">const</span> <span class="identifier">A</span><span class="special">*</span>
-</pre>
-<p>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_value</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_value</span><span class="special"><</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reference</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_reference</span><span class="special"><</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_pointer</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_pointer</span><span class="special"><</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_category</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special"><</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_category</span><span class="special"><</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special"><</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span>
- <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">reverse_iterator</span><span class="special"><</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
- </p>
- </td>
-<td>
- <p>
- compile time
- </p>
- </td>
-</tr>
-</tbody>
-</table></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../semantics.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/synopsis.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,185 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Synopsis</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../reference.html" title="Reference">
-<link rel="prev" href="overview.html" title="Overview">
-<link rel="next" href="semantics.html" title="Semantics">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Synopsis">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.reference.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
-</h3></div></div></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Single Pass Range metafunctions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">struct</span> <span class="identifier">range_iterator</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">struct</span> <span class="identifier">range_value</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">struct</span> <span class="identifier">range_reference</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">struct</span> <span class="identifier">range_pointer</span><span class="special">;</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">struct</span> <span class="identifier">range_category</span><span class="special">;</span>
-
- <span class="comment">//
-</span> <span class="comment">// Forward Range metafunctions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">struct</span> <span class="identifier">range_difference</span><span class="special">;</span>
-
- <span class="comment">//
-</span> <span class="comment">// Bidirectional Range metafunctions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">struct</span> <span class="identifier">range_reverse_iterator</span><span class="special">;</span>
-
- <span class="comment">//
-</span> <span class="comment">// Single Pass Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">end</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">bool</span>
- <span class="identifier">empty</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Forward Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">distance</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Bidirectional Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">rbegin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">rend</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Random Access Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">size</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Special const Range functions
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">const_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">const_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">const_rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
- <span class="identifier">const_rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// String utilities
-</span> <span class="comment">//
-</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">></span>
- <span class="identifier">as_literal</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">></span>
- <span class="identifier">as_literal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="identifier">as_array</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="identifier">as_array</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="overview.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade/upgrade_1_34_to_1_35.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,77 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Upgrade from version 1.34</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
-<link rel="prev" href="../upgrade.html" title="Upgrade version of Boost.Range">
-<link rel="next" href="../portability.html" title="Portability">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Upgrade from version 1.34">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.upgrade.upgrade_1_34_to_1_35"></a><a class="link" href="upgrade_1_34_to_1_35.html" title="Upgrade from version 1.34"> Upgrade from version
- 1.34</a>
-</h3></div></div></div>
-<p>
- Boost version 1.35 introduced some larger refactorings of the library:
- </p>
-<div class="orderedlist"><ol class="orderedlist" type="1">
-<li class="listitem">
- Direct support for character arrays was abandoned in favor of uniform treatment
- of all arrays. Instead string algorithms can use the new function <a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">as_literal</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">size</span></code></a>
- now requires a <a class="link" href="../concepts/random_access_range.html" title="Random Access Range">Random
- Access Range</a>. The old behavior is provided as <a class="link" href="../reference/semantics/functions.html" title="Functions"><code class="computeroutput"><span class="identifier">distance</span></code></a><code class="computeroutput"><span class="special">()</span></code>.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_size</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span></code> has been completely removed in favor
- of <code class="computeroutput"><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span></code>
-</li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">boost_range_begin</span><span class="special">()</span></code>
- and <code class="computeroutput"><span class="identifier">boost_range_end</span><span class="special">()</span></code>
- have been renamed <code class="computeroutput"><span class="identifier">range_begin</span><span class="special">()</span></code> and <code class="computeroutput"><span class="identifier">range_end</span><span class="special">()</span></code> respectively.
- </li>
-<li class="listitem">
-<code class="computeroutput"><span class="identifier">range_result_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span></code> and <code class="computeroutput"><span class="identifier">range_reverse_result_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span></code>
- have been renamed <code class="computeroutput"><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span></code>
- and <code class="computeroutput"><span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span></code>.
- </li>
-<li class="listitem">
- The procedure that makes a custom type work with the library has been greatly
- simplified. See <a class="link" href="../reference/extending.html" title="Extending the library">Extending the
- library for UDTs</a> for details.
- </li>
-</ol></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/iterator_range.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,322 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Class iterator_range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="../utilities.html" title="Utilities">
-<link rel="next" href="sub_range.html" title="Class sub_range">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../utilities.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Class iterator_range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.utilities.iterator_range"></a><a class="link" href="iterator_range.html" title="Class iterator_range"> Class <code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
-</h3></div></div></div>
-<p>
- The intention of the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- class is to encapsulate two iterators so they fulfill the <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward
- Range</a> concept. A few other functions are also provided for convenience.
- </p>
-<p>
- If the template argument is not a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
- Traversal Iterator</a>, one can still use a subset of the interface.
- In particular, <code class="computeroutput"><span class="identifier">size</span><span class="special">()</span></code>
- requires Random Access Traversal Iterators whereas <code class="computeroutput"><span class="identifier">empty</span><span class="special">()</span></code> only requires Single Pass Iterators.
- </p>
-<p>
- Recall that many default constructed iterators are <span class="bold"><strong><span class="emphasis"><em>singular</em></span></strong></span>
- and hence can only be assigned, but not compared or incremented or anything.
- However, if one creates a default constructed <code class="computeroutput"><span class="identifier">iterator_range</span></code>,
- then one can still call all its member functions. This design decision avoids
- the <code class="computeroutput"><span class="identifier">iterator_range</span></code> imposing
- limitations upon ranges of iterators that are not singular. Any singularity
- limitation is simply propogated from the underlying iterator type.
- </p>
-<a name="range.utilities.iterator_range.synopsis"></a><h5>
-<a name="id2763343"></a>
- <a class="link" href="iterator_range.html#range.utilities.iterator_range.synopsis">Synopsis</a>
- </h5>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
- <span class="keyword">class</span> <span class="identifier">iterator_range</span>
- <span class="special">{</span>
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range types
-</span> <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">const_iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="identifier">iterator_difference</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">End</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
-</span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
-</span> <span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">iterator_range</span><span class="special">&</span> <span class="identifier">advance_begin</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
- <span class="identifier">iterator_range</span><span class="special">&</span> <span class="identifier">advance_end</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
- <span class="keyword">bool</span> <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
-</span> <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">size_type</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="special">};</span>
-
- <span class="comment">// stream output
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">></span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">>&</span>
- <span class="keyword">operator</span><span class="special"><<(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">>&</span> <span class="identifier">Os</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">// comparison
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">l</span><span class="special">,</span>
- <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">// external construction
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span>
- <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">></span>
- <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
- <span class="comment">// convenience
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
-<p>
- </p>
-<p>
- If an instance of <code class="computeroutput"><span class="identifier">iterator_range</span></code>
- is constructed by a client with two iterators, the client must ensure that
- the two iterators delimit a valid closed-open range [begin,end).
- </p>
-<p>
- It is worth noticing that the templated constructors and assignment operators
- allow conversion from <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">></span></code> to <code class="computeroutput"><span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">const_iterator</span><span class="special">></span></code>. Similarly, since the comparison operators
- have two template arguments, we can compare ranges whenever the iterators
- are comparable; for example when we are dealing with const and non-const
- iterators from the same container.
- </p>
-<a name="range.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id2766569"></a>
- <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_member_functions">Details
- member functions</a>
- </h5>
-<p>
- <code class="computeroutput"><span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">();</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="identifier">iterator_range</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">begin</span><span class="special">()</span> <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">&&</span>
- <span class="identifier">end</span><span class="special">()</span>
- <span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<a name="range.utilities.iterator_range.details_functions"></a><h5>
-<a name="id2766813"></a>
- <a class="link" href="iterator_range.html#range.utilities.iterator_range.details_functions">Details
- functions</a>
- </h5>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&</span>
- <span class="identifier">l</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">l</span><span class="special">)</span> <span class="special">!=</span> <span class="identifier">size</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">?</span> <span class="keyword">false</span>
- <span class="special">:</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span><span class="special">(</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&</span>
- <span class="identifier">l</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="special">!(</span> <span class="identifier">l</span> <span class="special">==</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
- <code class="computeroutput"><span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange1</span><span class="special">&</span>
- <span class="identifier">l</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">lexicographical_compare</span><span class="special">(</span>
- <span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">iterator_range</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">new_begin</span> <span class="special">=</span> <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">),</span>
-<span class="identifier">iterator</span> <span class="identifier">new_end</span> <span class="special">=</span> <span class="identifier">end</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">advance_begin</span> <span class="special">);</span>
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span> <span class="identifier">new_end</span><span class="special">,</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-<span class="keyword">return</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">new_begin</span><span class="special">,</span> <span class="identifier">new_end</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-<p>
- <code class="computeroutput"><span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span></code>
- </p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em><span class="bold"><strong>Returns</strong></span></em></span> <code class="computeroutput"><span class="identifier">Sequence</span><span class="special">(</span>
- <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
- </p>
-<p>
- </p>
-</blockquote></div>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="../utilities.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/join.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,89 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Function join</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="sub_range.html" title="Class sub_range">
-<link rel="next" href="../style_guide.html" title="Terminology and style guidelines">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sub_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../style_guide.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Function join">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.utilities.join"></a><a class="link" href="join.html" title="Function join"> Function join</a>
-</h3></div></div></div>
-<p>
- The intention of the <code class="computeroutput"><span class="identifier">join</span></code>
- function is to join two ranges into one longer range.
- </p>
-<p>
- The resultant range will have the lowest common traversal of the two ranges
- supplied as parameters.
- </p>
-<p>
- Note that the joined range incurs a performance cost due to the need to check
- if the end of a range has been reached internally during traversal.
- </p>
-<a name="range.utilities.join.synposis"></a><h5>
-<a name="id2769247"></a>
- <a class="link" href="join.html#range.utilities.join.synposis">Synposis</a>
- </h5>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
-<span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</span><span class="special"><</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">add_const</span><span class="special"><</span>
- <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span>
-<span class="special">></span>
-<span class="identifier">join</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">)</span>
-
-<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
-<span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">join_iterator</span><span class="special"><</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange2</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span>
-<span class="special">></span>
-<span class="identifier">join</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span>
-</pre>
-<p>
- </p>
-<a name="range.utilities.join.example"></a><h5>
-<a name="id2769794"></a>
- <a class="link" href="join.html#range.utilities.join.example">Example</a>
- </h5>
-<p>
- The expression <code class="computeroutput"><span class="identifier">join</span><span class="special">(</span><span class="identifier">irange</span><span class="special">(</span><span class="number">0</span><span class="special">,</span><span class="number">5</span><span class="special">),</span> <span class="identifier">irange</span><span class="special">(</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">))</span></code> would
- evaluate to a range representing an integer range <code class="computeroutput"><span class="special">[</span><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">)</span></code>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="sub_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../style_guide.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/range/doc/html/range/utilities/sub_range.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
+++ (empty file)
@@ -1,122 +0,0 @@
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Class sub_range</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
-<link rel="home" href="../../index.html" title="Chapter 1. Range 2.0">
-<link rel="up" href="../utilities.html" title="Utilities">
-<link rel="prev" href="iterator_range.html" title="Class iterator_range">
-<link rel="next" href="join.html" title="Function join">
-</head>
-<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
-<table cellpadding="2" width="100%"><tr>
-<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
-<td align="center">Home</td>
-<td align="center">Libraries</td>
-<td align="center">People</td>
-<td align="center">FAQ</td>
-<td align="center">More</td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="iterator_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-<div class="section" title="Class sub_range">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="range.utilities.sub_range"></a><a class="link" href="sub_range.html" title="Class sub_range"> Class <code class="computeroutput"><span class="identifier">sub_range</span></code></a>
-</h3></div></div></div>
-<p>
- The <code class="computeroutput"><span class="identifier">sub_range</span></code> class inherits
- all its functionality from the <a class="link" href="iterator_range.html" title="Class iterator_range"><code class="computeroutput"><span class="identifier">iterator_range</span></code></a> class. The <code class="computeroutput"><span class="identifier">sub_range</span></code> class is often easier to use
- because one must specify the <a class="link" href="../concepts/forward_range.html" title="Forward Range">Forward
- Range</a> template argument instead of an iterator. Moreover, the <code class="computeroutput"><span class="identifier">sub_range</span></code> class can propagate constness
- since it knows what a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>
- is.
- </p>
-<a name="range.utilities.sub_range.synopsis"></a><h5>
-<a name="id2767970"></a>
- <a class="link" href="sub_range.html#range.utilities.sub_range.synopsis">Synopsis</a>
- </h5>
-<p>
-
-</p>
-<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
-<span class="special">{</span>
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">class</span> <span class="identifier">sub_range</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="special">{</span>
- <span class="keyword">public</span><span class="special">:</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">const_iterator</span><span class="special">;</span>
- <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">iterator_difference</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
- <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
- <span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
- <span class="identifier">sub_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
- <span class="identifier">sub_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
- <span class="identifier">sub_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
-</span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">();</span>
- <span class="identifier">const_iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">();</span>
- <span class="identifier">const_iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
-</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">front</span><span class="special">();</span>
- <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">back</span><span class="special">();</span>
- <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
-</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
- <span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span>
- <span class="comment">// rest of interface inherited from iterator_range
-</span> <span class="special">};</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
-<p>
- </p>
-<p>
- The class should be trivial to use as seen below. Imagine that we have an
- algorithm that searches for a sub-string in a string. The result is an iterator_range,
- that delimits the match. We need to store the result from this algorithm.
- Here is an example of how we can do it with and without <code class="computeroutput"><span class="identifier">sub_range</span></code>
- </p>
-<p>
-
-</p>
-<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"hello"</span><span class="special">);</span>
-<span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">></span> <span class="identifier">ir</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
-<span class="identifier">sub_range</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="identifier">sub</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
-</pre>
-<p>
- </p>
-</div>
-<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
- 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)
- </p>
-</div></td>
-</tr></table>
-<hr>
-<div class="spirit-nav">
-<a accesskey="p" href="iterator_range.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
-</div>
-</body>
-</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/index.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/index.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,37 +1,37 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
-<title>Chapter 1. Phoenix 2.0</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="index.html" title="Chapter 1. Phoenix 2.0">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Chapter 1. Phoenix 2.0</title>
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="index.html" title="Chapter 1. Phoenix 2.0">
<link rel="next" href="phoenix/introduction.html" title="Introduction">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="phoenix/introduction.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="chapter" lang="en">
+<div class="spirit-nav"><a accesskey="n" href="phoenix/introduction.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
+<div class="chapter">
<div class="titlepage"><div>
<div><h2 class="title">
-<a name="phoenix"></a>Chapter 1. Phoenix 2.0</h2></div>
+<a name="phoenix"></a>Chapter 1. Phoenix 2.0</h2></div>
<div><div class="author"><h3 class="author">
<span class="firstname">Joel</span> <span class="surname">de Guzman</span>
</h3></div></div>
<div><div class="author"><h3 class="author">
<span class="firstname">Dan</span> <span class="surname">Marsden</span>
</h3></div></div>
-<div><p class="copyright">Copyright © 2002-2005 Joel
+<div><p class="copyright">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden</p></div>
<div><div class="legalnotice">
-<a name="id385274"></a><p>
+<a name="id759708"></a><p>
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)
</p>
@@ -91,40 +91,29 @@
<dt><span class="section">References</span></dt>
</dl>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.preface"></a>Preface</h2></div></div></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>Functional programming is so called because a program consists
- entirely of functions. The main program itself is written as a function
- which receives the program's input as its argument and delivers the program's
- output as its result. Typically the main function is defined in terms of
- other functions, which in turn are defined in terms of still more functions
- until at the bottom level the functions are language primitives.</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="bold"><b>John Hughes</b></span>-- <span class="emphasis"><em>Why Functional
- Programming Matters</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<a name="phoenix.preface"></a><a class="link" href="index.html#phoenix.preface" title="Preface">Preface</a>
+</h2></div></div></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>Functional programming is so called because a program consists
+ entirely of functions. The main program itself is written as a function which
+ receives the program's input as its argument and delivers the program's output
+ as its result. Typically the main function is defined in terms of other functions,
+ which in turn are defined in terms of still more functions until at the bottom
+ level the functions are language primitives.</em></span>
+ </p></blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="bold"><strong>John Hughes</strong></span>-- <span class="emphasis"><em>Why Functional Programming
+ Matters</em></span>
+ </p></blockquote></div>
<p>
<span class="inlinemediaobject"><img src="images/lambda_cpp.png" alt="lambda_cpp"></span>
</p>
-<a name="phoenix.preface.description"></a><h2>
-<a name="id385804"></a>
- Description
- </h2>
+<a name="phoenix.preface.description"></a><h3>
+<a name="id759789"></a>
+ <a class="link" href="index.html#phoenix.preface.description">Description</a>
+ </h3>
<p>
Phoenix enables Functional Programming (FP) in C++. The design and implementation
of Phoenix is highly influenced by FC++
@@ -141,10 +130,10 @@
the library into small pieces, without fear that the pieces won't work anymore.
The library is organized in highly independent modules and layers.
</p>
-<a name="phoenix.preface.how_to_use_this_manual"></a><h2>
-<a name="id455895"></a>
- How to use this manual
- </h2>
+<a name="phoenix.preface.how_to_use_this_manual"></a><h3>
+<a name="id759849"></a>
+ <a class="link" href="index.html#phoenix.preface.how_to_use_this_manual">How to use this manual</a>
+ </h3>
<p>
The Phoenix library is organized in logical modules. This documentation provides
a user's guide and reference for each module in the library. A simple and clear
@@ -165,8 +154,8 @@
icons precede some text to indicate:
</p>
<div class="table">
-<a name="id455925"></a><p class="title"><b>Table 1.1. Icons</b></p>
-<table class="table" summary="Icons">
+<a name="id759887"></a><p class="title"><b>Table 1.1. Icons</b></p>
+<div class="table-contents"><table class="table" summary="Icons">
<colgroup>
<col>
<col>
@@ -174,86 +163,86 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Icon
- </p>
- </th>
+ <p>
+ Icon
+ </p>
+ </th>
<th>
- <p>
- Name
- </p>
- </th>
+ <p>
+ Name
+ </p>
+ </th>
<th>
- <p>
- Meaning
- </p>
- </th>
+ <p>
+ Meaning
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="images/note.png" alt="note"></span>
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="images/note.png" alt="note"></span>
+ </p>
+ </td>
<td>
- <p>
- Note
- </p>
- </td>
+ <p>
+ Note
+ </p>
+ </td>
<td>
- <p>
- Information provided is auxiliary but will give the reader a deeper insight
- into a specific topic. May be skipped.
- </p>
- </td>
+ <p>
+ Information provided is auxiliary but will give the reader a deeper
+ insight into a specific topic. May be skipped.
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="images/alert.png" alt="alert"></span>
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="images/alert.png" alt="alert"></span>
+ </p>
+ </td>
<td>
- <p>
- Alert
- </p>
- </td>
+ <p>
+ Alert
+ </p>
+ </td>
<td>
- <p>
- Information provided is of utmost importance.
- </p>
- </td>
+ <p>
+ Information provided is of utmost importance.
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="images/tip.png" alt="tip"></span>
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="images/tip.png" alt="tip"></span>
+ </p>
+ </td>
<td>
- <p>
- Tip
- </p>
- </td>
+ <p>
+ Tip
+ </p>
+ </td>
<td>
- <p>
- A potentially useful and helpful piece of information.
- </p>
- </td>
+ <p>
+ A potentially useful and helpful piece of information.
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<p>
+<br class="table-break"><p>
This documentation is automatically generated by Spirit QuickBook documentation
tool. QuickBook can be found in the <a href="http://spirit.sourceforge.net/repository/applications/show_contents.php" target="_top">Spirit
Repository</a>.
</p>
-<a name="phoenix.preface.support"></a><h2>
-<a name="id387296"></a>
- Support
- </h2>
+<a name="phoenix.preface.support"></a><h3>
+<a name="id760065"></a>
+ <a class="link" href="index.html#phoenix.preface.support">Support</a>
+ </h3>
<p>
Please direct all questions to Spirit's mailing list. You can subscribe to
the <a href="https://lists.sourceforge.net/lists/listinfo/spirit-general" target="_top">Spirit
@@ -264,17 +253,17 @@
NNTP news portal</a> (thanks to Gmane).
The news group mirrors the mailing list. Here is a link to the archives: http://news.gmane.org/gmane.comp.parsers.spirit.general.
</p>
-<a name="phoenix.preface._emphasis_role__bold___emphasis____to_my_dear_daughter__phoenix__emphasis___emphasis_"></a><h2>
-<a name="id387363"></a>
- ...To my dear daughter, Phoenix
- </h2>
+<a name="phoenix.preface._emphasis_role__bold___emphasis____to_my_dear_daughter__phoenix__emphasis___emphasis_"></a><h3>
+<a name="id760124"></a>
+ <a class="link" href="index.html#phoenix.preface._emphasis_role__bold___emphasis____to_my_dear_daughter__phoenix__emphasis___emphasis_"><span class="bold"><strong><span class="emphasis"><em>...To my dear daughter, Phoenix</em></span></strong></span></a>
+ </h3>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: July 23, 2008 at 17:24:10 GMT</small></p></td>
+<td align="left"><p><small>Last revised: July 19, 2010 at 19:06:12 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="phoenix/introduction.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="spirit-nav"><a accesskey="n" href="phoenix/introduction.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/acknowledgement.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/acknowledgement.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Acknowledgement</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="wrap_up.html" title="Wrap Up">
<link rel="next" href="references.html" title="References">
</head>
@@ -13,70 +13,71 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="wrap_up.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="wrap_up.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.acknowledgement"></a>Acknowledgement</h2></div></div></div>
-<div class="orderedlist"><ol type="1">
-<li>
- Hartmut Kaiser implemented the original lazy casts and constructors based
- on his original work on Spirit SE "semantic expressions" (the precursor
- to Phoenix).
- </li>
-<li>
- Angus Leeming implemented the container functions on Phoenix-1 which I then
- ported to Phoenix-2.
- </li>
-<li>
- Daniel Wallin helped with the scope module, local variables, let and lambda
- and the algorithms. I frequently discuss design issues with Daniel on Yahoo
- Messenger.
- </li>
-<li>
- Jaakko Jarvi. DA Lambda MAN!
- </li>
-<li>
- Dave Abrahams, for his constant presence, wherever, whenever.
- </li>
-<li>
- Aleksey Gurtovoy, DA MPL MAN!
- </li>
-<li>
- Doug Gregor, always a source of inpiration.
- </li>
-<li>
- Dan Marsden, did almost all the work in bringing Phoenix-2 out the door.
- </li>
-<li>
- Eric Niebler did a 2.0 pre-release review and wrote some range related code
- that Phoenix stole and used in the algorithms.
- </li>
-<li>
- Thorsten Ottosen; Eric's range_ex code began life as "container_algo"
- in the old boost sandbox, by Thorsten in 2002-2003.
- </li>
-<li>
- Jeremy Siek, even prior to Thorsten, in 2001, started the "container_algo".
- </li>
-<li>
- Vladimir Prus wrote the mutating algorithms code from the Boost Wiki.
- </li>
-<li>
- Daryle Walker did a 2.0 pre-release review.
- </li>
+<a name="phoenix.acknowledgement"></a><a class="link" href="acknowledgement.html" title="Acknowledgement">Acknowledgement</a>
+</h2></div></div></div>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ Hartmut Kaiser implemented the original lazy casts and constructors based
+ on his original work on Spirit SE "semantic expressions" (the
+ precursor to Phoenix).
+ </li>
+<li class="listitem">
+ Angus Leeming implemented the container functions on Phoenix-1 which I
+ then ported to Phoenix-2.
+ </li>
+<li class="listitem">
+ Daniel Wallin helped with the scope module, local variables, let and lambda
+ and the algorithms. I frequently discuss design issues with Daniel on Yahoo
+ Messenger.
+ </li>
+<li class="listitem">
+ Jaakko Jarvi. DA Lambda MAN!
+ </li>
+<li class="listitem">
+ Dave Abrahams, for his constant presence, wherever, whenever.
+ </li>
+<li class="listitem">
+ Aleksey Gurtovoy, DA MPL MAN!
+ </li>
+<li class="listitem">
+ Doug Gregor, always a source of inpiration.
+ </li>
+<li class="listitem">
+ Dan Marsden, did almost all the work in bringing Phoenix-2 out the door.
+ </li>
+<li class="listitem">
+ Eric Niebler did a 2.0 pre-release review and wrote some range related
+ code that Phoenix stole and used in the algorithms.
+ </li>
+<li class="listitem">
+ Thorsten Ottosen; Eric's range_ex code began life as "container_algo"
+ in the old boost sandbox, by Thorsten in 2002-2003.
+ </li>
+<li class="listitem">
+ Jeremy Siek, even prior to Thorsten, in 2001, started the "container_algo".
+ </li>
+<li class="listitem">
+ Vladimir Prus wrote the mutating algorithms code from the Boost Wiki.
+ </li>
+<li class="listitem">
+ Daryle Walker did a 2.0 pre-release review.
+ </li>
</ol></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -85,7 +86,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="wrap_up.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="wrap_up.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/actors.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/actors.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Actors</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="organization.html" title="Organization">
<link rel="next" href="primitives.html" title="Primitives">
</head>
@@ -13,42 +13,42 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="organization.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="primitives.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="organization.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="primitives.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.actors"></a>Actors</h2></div></div></div>
+<a name="phoenix.actors"></a><a class="link" href="actors.html" title="Actors">Actors</a>
+</h2></div></div></div>
<p>
- The <tt class="computeroutput"><span class="identifier">Actor</span></tt> is the main concept
+ The <code class="computeroutput"><span class="identifier">Actor</span></code> is the main concept
behind the library. Actors are function objects. An actor can accept 0 to
- <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt> arguments.
+ <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code> arguments.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
- You can set <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>,
- the predefined maximum arity an actor can take. By default, <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt> is set to 10.
+<tr><td align="left" valign="top"><p>
+ You can set <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>,
+ the predefined maximum arity an actor can take. By default, <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code> is set to 10.
</p></td></tr>
</table></div>
<p>
- Phoenix supplies an <tt class="computeroutput"><span class="identifier">actor</span></tt> class
- template whose specializations model the <tt class="computeroutput"><span class="identifier">Actor</span></tt>
- concept. <tt class="computeroutput"><span class="identifier">actor</span></tt> has one template
- parameter, <tt class="computeroutput"><span class="identifier">Eval</span></tt>, that supplies
+ Phoenix supplies an <code class="computeroutput"><span class="identifier">actor</span></code> class
+ template whose specializations model the <code class="computeroutput"><span class="identifier">Actor</span></code>
+ concept. <code class="computeroutput"><span class="identifier">actor</span></code> has one template
+ parameter, <code class="computeroutput"><span class="identifier">Eval</span></code>, that supplies
the smarts to evaluate the resulting function.
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Eval</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Eval</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">actor</span> <span class="special">:</span> <span class="identifier">Eval</span>
<span class="special">{</span>
<span class="identifier">return_type</span>
@@ -67,16 +67,16 @@
</pre>
<p>
The actor class accepts the arguments through a set of function call operators
- for 0 to <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt> arities
+ for 0 to <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code> arities
(Don't worry about the details, for now. Note, for example, that we skimp over
- the details regarding <tt class="computeroutput"><span class="identifier">return_type</span></tt>).
- The arguments are then forwarded to the actor's <tt class="computeroutput"><span class="identifier">Eval</span></tt>
+ the details regarding <code class="computeroutput"><span class="identifier">return_type</span></code>).
+ The arguments are then forwarded to the actor's <code class="computeroutput"><span class="identifier">Eval</span></code>
for evaluation.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -85,7 +85,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="organization.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="primitives.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="organization.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="primitives.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/algorithm.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/algorithm.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Algorithm</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="container.html" title="Container">
<link rel="next" href="inside_phoenix.html" title="Inside Phoenix">
</head>
@@ -13,24 +13,24 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="container.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inside_phoenix.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="container.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inside_phoenix.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.algorithm"></a>Algorithm</h2></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
+</h2></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The algorithm module provides wrappers for the standard algorithms in the
- <tt class="computeroutput"><span class="special"><</span><span class="identifier">algorithm</span><span class="special">></span></tt> and <tt class="computeroutput"><span class="special"><</span><span class="identifier">numeric</span><span class="special">></span></tt>
+ <code class="computeroutput"><span class="special"><</span><span class="identifier">algorithm</span><span class="special">></span></code> and <code class="computeroutput"><span class="special"><</span><span class="identifier">numeric</span><span class="special">></span></code>
headers.
</p>
<p>
@@ -38,8 +38,7 @@
querying, modelling the Boost.MPL
library. The different algorithm classes can be included using the headers:
</p>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">iteration</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">iteration</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transformation</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">stl</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">querying</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
@@ -52,8 +51,7 @@
<p>
For example, using the standard copy algorithm to copy between 2 arrays:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
<span class="keyword">int</span> <span class="identifier">output</span><span class="special">[</span><span class="number">3</span><span class="special">];</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">array</span><span class="special">,</span> <span class="identifier">array</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">output</span><span class="special">);</span> <span class="comment">// We have to provide iterators
</span> <span class="comment">// to both the start and end of array
@@ -61,8 +59,7 @@
<p>
The analogous code using the phoenix algorithm module is:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">array</span><span class="special">[]</span> <span class="special">=</span> <span class="special">{</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">};</span>
<span class="keyword">int</span> <span class="identifier">output</span><span class="special">[</span><span class="number">3</span><span class="special">];</span>
<span class="identifier">copy</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">array</span><span class="special">,</span> <span class="identifier">output</span><span class="special">);</span> <span class="comment">// Notice only 2 arguments, the end of
</span> <span class="comment">// array is established automatically
@@ -76,874 +73,924 @@
The following tables describe the different categories of algorithms, and their
semantics.
</p>
-<div class="sidebar"><p>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
<span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Arguments in brackets denote optional parameters.
- </p></div>
+ </p>
+</div>
<div class="table">
-<a name="id486434"></a><p class="title"><b>Table 1.7. Iteration Algorithms</b></p>
-<table class="table" summary="Iteration Algorithms">
+<a name="id786989"></a><p class="title"><b>Table 1.7. Iteration Algorithms</b></p>
+<div class="table-contents"><table class="table" summary="Iteration Algorithms">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Function
- </p>
- </th>
+ <p>
+ Function
+ </p>
+ </th>
<th>
- <p>
- stl Semantics
- </p>
- </th>
+ <p>
+ stl Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
-<td>
- <p>
- <tt class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
-<td>
- <p>
- <tt class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ <code class="computeroutput"><span class="identifier">accumulate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<div class="table">
-<a name="id486741"></a><p class="title"><b>Table 1.8. Querying Algorithms</b></p>
-<table class="table" summary="Querying Algorithms">
+<br class="table-break"><div class="table">
+<a name="id787263"></a><p class="title"><b>Table 1.8. Querying Algorithms</b></p>
+<div class="table-contents"><table class="table" summary="Querying Algorithms">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Function
- </p>
- </th>
+ <p>
+ Function
+ </p>
+ </th>
<th>
- <p>
- stl Semantics
- </p>
- </th>
+ <p>
+ stl Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find_end</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">find_first_of</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">adjacent_find</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">count</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">count_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">equal</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">i</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">lower_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">upper_bound</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">binary_search</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">includes</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">min_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">max_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<div class="table">
-<a name="id489465"></a><p class="title"><b>Table 1.9. Transformation Algorithms</b></p>
-<table class="table" summary="Transformation Algorithms">
+<br class="table-break"><div class="table">
+<a name="id789681"></a><p class="title"><b>Table 1.9. Transformation Algorithms</b></p>
+<div class="table-contents"><table class="table" summary="Transformation Algorithms">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Function
- </p>
- </th>
+ <p>
+ Function
+ </p>
+ </th>
<th>
- <p>
- stl Semantics
- </p>
- </th>
+ <p>
+ stl Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">copy_backward</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">transform</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">i</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">fill</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">fill_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">generate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">generate_n</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">remove_copy_if</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unique</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">unique_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reverse_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">rotate</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">))</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">rotate_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">stable_partition</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">f</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partial_sort</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partial_sort_copy</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">n</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">n</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">nth_element</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">o</span><span class="special">[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">m</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">inplace_merge</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">m</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_union</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_intersection</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span>
+ <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span>
+ <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">r1</span><span class="special">,</span> <span class="identifier">r2</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r1</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r2</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r2</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span>
+ <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">r</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">inner_product</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f1</span><span class="special">,</span> <span class="identifier">f2</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">adjacent_difference</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">o</span><span class="special">[,</span> <span class="identifier">f</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
+<br class="table-break">
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -952,7 +999,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="container.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="inside_phoenix.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="container.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inside_phoenix.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/basics.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/basics.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Basics</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="starter_kit.html" title="Starter Kit">
<link rel="next" href="organization.html" title="Organization">
</head>
@@ -13,45 +13,46 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="starter_kit.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="starter_kit.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.basics"></a>Basics</h2></div></div></div>
+<a name="phoenix.basics"></a><a class="link" href="basics.html" title="Basics">Basics</a>
+</h2></div></div></div>
<p>
Almost everything is a function in the Phoenix library that can be evaluated
- as <tt class="computeroutput"><span class="identifier">f</span><span class="special">(</span><span class="identifier">a1</span><span class="special">,</span> <span class="identifier">a2</span><span class="special">,</span> <span class="special">...,</span> a<span class="emphasis"><em>n</em></span><span class="special">)</span></tt>, where <span class="emphasis"><em>n</em></span> is the function's
+ as <code class="computeroutput"><span class="identifier">f</span><span class="special">(</span><span class="identifier">a1</span><span class="special">,</span> <span class="identifier">a2</span><span class="special">,</span> <span class="special">...,</span> a<span class="emphasis"><em>n</em></span><span class="special">)</span></code>, where <span class="emphasis"><em>n</em></span> is the function's
arity, or number of arguments that the function expects. Operators are also
- functions. For example, <tt class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></tt> is just
- a function with arity == 2 (or binary). <tt class="computeroutput"><span class="identifier">a</span>
- <span class="special">+</span> <span class="identifier">b</span></tt>
- is the same as <tt class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></tt>, <tt class="computeroutput"><span class="identifier">a</span>
- <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="identifier">c</span></tt> is the
- same as <tt class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">),</span>
- <span class="identifier">c</span><span class="special">)</span></tt>.
+ functions. For example, <code class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></code> is just
+ a function with arity == 2 (or binary). <code class="computeroutput"><span class="identifier">a</span>
+ <span class="special">+</span> <span class="identifier">b</span></code>
+ is the same as <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">a</span>
+ <span class="special">+</span> <span class="identifier">b</span> <span class="special">+</span> <span class="identifier">c</span></code> is the
+ same as <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">add</span><span class="special">(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">),</span>
+ <span class="identifier">c</span><span class="special">)</span></code>.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
Amusingly, functions may even return functions. We shall see what this means
in a short while.
</p></td></tr>
</table></div>
-<a name="phoenix.basics.partial_function_application"></a><h2>
-<a name="id459690"></a>
- <a href="basics.html#phoenix.basics.partial_function_application">Partial Function
+<a name="phoenix.basics.partial_function_application"></a><h3>
+<a name="id763540"></a>
+ <a class="link" href="basics.html#phoenix.basics.partial_function_application">Partial Function
Application</a>
- </h2>
+ </h3>
<p>
Think of a function as a black box. You pass arguments and it returns something
back. The figure below depicts the typical scenario.
@@ -61,23 +62,23 @@
</p>
<p>
A fully evaluated function is one in which all the arguments are given. All
- functions in plain C++ are fully evaluated. When you call the <tt class="computeroutput"><span class="identifier">sin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></tt> function, you have to pass a number x. The
- function will return a result in return: the sin of x. When you call the <tt class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">)</span></tt>
+ functions in plain C++ are fully evaluated. When you call the <code class="computeroutput"><span class="identifier">sin</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> function, you have to pass a number x. The
+ function will return a result in return: the sin of x. When you call the <code class="computeroutput"><span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">)</span></code>
function, you have to pass two numbers x and y. The function will return the
- sum of the two numbers. The figure below is a fully evaluated <tt class="computeroutput"><span class="identifier">add</span></tt> function.
+ sum of the two numbers. The figure below is a fully evaluated <code class="computeroutput"><span class="identifier">add</span></code> function.
</p>
<p>
<span class="inlinemediaobject"><img src="../images/adder.png" alt="adder"></span>
</p>
<p>
A partially applied function, on the other hand, is one in which not all the
- arguments are supplied. If we are able to partially apply the function <tt class="computeroutput"><span class="identifier">add</span></tt> above, we may pass only the first argument.
+ arguments are supplied. If we are able to partially apply the function <code class="computeroutput"><span class="identifier">add</span></code> above, we may pass only the first argument.
In doing so, the function does not have all the required information it needs
to perform its task to compute and return a result. What it returns instead
is another function, a lambda function --another black box. Unlike the original
- <tt class="computeroutput"><span class="identifier">add</span></tt> function which has an arity
+ <code class="computeroutput"><span class="identifier">add</span></code> function which has an arity
of 2, the resulting lambda function has an arity of 1. Why? because we already
- supplied part of the input: <tt class="computeroutput"><span class="number">2</span></tt>
+ supplied part of the input: <code class="computeroutput"><span class="number">2</span></code>
</p>
<p>
<span class="inlinemediaobject"><img src="../images/add2.png" alt="add2"></span>
@@ -85,7 +86,7 @@
<p>
Now, when we shove in a number into our lambda function, it will return 2 plus
whatever we pass in. The lambda function essentially remembers 1) the original
- function, <tt class="computeroutput"><span class="identifier">add</span></tt>, and 2) the partial
+ function, <code class="computeroutput"><span class="identifier">add</span></code>, and 2) the partial
input, 2. The figure below illustrates a case where we pass 3 to our lambda
function, which then returns 5:
</p>
@@ -93,59 +94,58 @@
<span class="inlinemediaobject"><img src="../images/add2_call.png" alt="add2_call"></span>
</p>
<p>
- Obviously, partially applying the <tt class="computeroutput"><span class="identifier">add</span></tt>
+ Obviously, partially applying the <code class="computeroutput"><span class="identifier">add</span></code>
function, as we see above, cannot be done directly in C++ where we are expected
to supply all the arguments that a function expects. That's where the Phoenix
library comes in. The library provides the facilities to do partial function
application.
</p>
-<a name="phoenix.basics.stl_and_higher_order_functions"></a><h2>
-<a name="id459960"></a>
- <a href="basics.html#phoenix.basics.stl_and_higher_order_functions">STL and higher
+<a name="phoenix.basics.stl_and_higher_order_functions"></a><h3>
+<a name="id763771"></a>
+ <a class="link" href="basics.html#phoenix.basics.stl_and_higher_order_functions">STL and higher
order functions</a>
- </h2>
+ </h3>
<p>
So, what's all the fuss? What makes partial function application so useful?
- Recall our original example in the <a href="starter_kit.html" title="Starter Kit">previous
+ Recall our original example in the <a class="link" href="starter_kit.html" title="Starter Kit">previous
section</a>:
</p>
-<pre class="programlisting">
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
</pre>
<p>
- The expression <tt class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
- <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></tt> evaluates to a lambda function. <tt class="computeroutput"><span class="identifier">arg1</span></tt> is a placeholder for an argument to
+ The expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
+ <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> evaluates to a lambda function. <code class="computeroutput"><span class="identifier">arg1</span></code> is a placeholder for an argument to
be supplied later. Hence, since there's only one unsupplied argument, the lambda
- function has an arity 1. It just so happens that <tt class="computeroutput"><span class="identifier">find_if</span></tt>
- supplies the unsupplied argument as it loops from <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></tt>
- to <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></tt>.
+ function has an arity 1. It just so happens that <code class="computeroutput"><span class="identifier">find_if</span></code>
+ supplies the unsupplied argument as it loops from <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
+ to <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
Higher order functions are functions which can take other functions as arguments,
and may also return functions as results. Higher order functions are functions
that are treated like any other objects and can be used as arguments and
return values from functions.
</p></td></tr>
</table></div>
-<a name="phoenix.basics.lazy_evaluation"></a><h2>
-<a name="id460216"></a>
- Lazy Evaluation
- </h2>
+<a name="phoenix.basics.lazy_evaluation"></a><h3>
+<a name="id763976"></a>
+ <a class="link" href="basics.html#phoenix.basics.lazy_evaluation">Lazy Evaluation</a>
+ </h3>
<p>
In Phoenix, to put it more accurately, function evaluation has two stages:
</p>
-<div class="orderedlist"><ol type="1">
-<li>
- Partial application
- </li>
-<li>
- Final evaluation
- </li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ Partial application
+ </li>
+<li class="listitem">
+ Final evaluation
+ </li>
</ol></div>
<p>
The first stage is handled by a set of generator functions. These are your
@@ -158,17 +158,15 @@
<p>
If we look more closely, the first step involves partial function application:
</p>
-<pre class="programlisting">
-<span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span>
+<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span>
</pre>
<p>
- The second step is the actual function invocation (done inside the <tt class="computeroutput"><span class="identifier">find_if</span></tt> function. These are the back-ends
+ The second step is the actual function invocation (done inside the <code class="computeroutput"><span class="identifier">find_if</span></code> function. These are the back-ends
(often, the final invocation is never actually seen by the client). In our
- example, the <tt class="computeroutput"><span class="identifier">find_if</span></tt>, if we
+ example, the <code class="computeroutput"><span class="identifier">find_if</span></code>, if we
take a look inside, we'll see something like:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Predicate</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Predicate</span><span class="special">></span>
<span class="identifier">InputIterator</span>
<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">pred</span><span class="special">)</span>
<span class="special">{</span>
@@ -183,21 +181,20 @@
the first and second steps juxtaposed in order to illustrate the complete semantics
of Phoenix expressions. Examples:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">x</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">x</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
<span class="keyword">int</span> <span class="identifier">y</span> <span class="special">=</span> <span class="number">2</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">x</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints 1 or true
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">y</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints 0 or false
</span></pre>
-<a name="phoenix.basics.forwarding_function_problem"></a><h2>
-<a name="id460845"></a>
- <a href="basics.html#phoenix.basics.forwarding_function_problem">Forwarding Function
+<a name="phoenix.basics.forwarding_function_problem"></a><h3>
+<a name="id764488"></a>
+ <a class="link" href="basics.html#phoenix.basics.forwarding_function_problem">Forwarding Function
Problem</a>
- </h2>
+ </h3>
<p>
Usually, we, as clients, write the call-back functions while libraries (such
- as STL) provide the callee (e.g. <tt class="computeroutput"><span class="identifier">find_if</span></tt>).
+ as STL) provide the callee (e.g. <code class="computeroutput"><span class="identifier">find_if</span></code>).
In case the role is reversed, e.g. if you have to write an STL algorithm that
takes in a predicate, or develop a GUI library that accepts event handlers,
you have to be aware of a little known problem in C++ called the "<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
@@ -206,53 +203,50 @@
<p>
Look again at the code above:
</p>
-<pre class="programlisting">
-<span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">x</span><span class="special">)</span>
+<pre class="programlisting"><span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="identifier">x</span><span class="special">)</span>
</pre>
<p>
Notice that, in the second-stage (the final evaluation), we used a variable
- <tt class="computeroutput"><span class="identifier">x</span></tt>. Be aware that the second
+ <code class="computeroutput"><span class="identifier">x</span></code>. Be aware that the second
stage cannot accept non-const temporaries and literal constants. Hence, this
will fail:
</p>
-<pre class="programlisting">
-<span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="number">123</span><span class="special">)</span> <span class="comment">// Error!
+<pre class="programlisting"><span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)(</span><span class="number">123</span><span class="special">)</span> <span class="comment">// Error!
</span></pre>
<p>
Disallowing non-const rvalues partially solves the "<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
Function Problem</a>" but prohibits code like above.
</p>
-<a name="phoenix.basics.polymorphic_functions"></a><h2>
-<a name="id461055"></a>
- Polymorphic Functions
- </h2>
+<a name="phoenix.basics.polymorphic_functions"></a><h3>
+<a name="id764657"></a>
+ <a class="link" href="basics.html#phoenix.basics.polymorphic_functions">Polymorphic Functions</a>
+ </h3>
<p>
Unless otherwise noted, Phoenix generated functions are fully polymorphic.
- For instance, the <tt class="computeroutput"><span class="identifier">add</span></tt> example
+ For instance, the <code class="computeroutput"><span class="identifier">add</span></code> example
above can apply to integers, floating points, user defined complex numbers
or even strings. Example:
</p>
-<pre class="programlisting">
-<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">h</span><span class="special">(</span><span class="string">"Hello"</span><span class="special">);</span>
+<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">h</span><span class="special">(</span><span class="string">"Hello"</span><span class="special">);</span>
<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">w</span> <span class="special">=</span> <span class="string">" World"</span><span class="special">;</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">r</span> <span class="special">=</span> <span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">h</span><span class="special">,</span> <span class="identifier">w</span><span class="special">);</span>
</pre>
<p>
- evaluates to <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">(</span><span class="string">"Hello
- World"</span><span class="special">)</span></tt>. The observant
+ evaluates to <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">(</span><span class="string">"Hello
+ World"</span><span class="special">)</span></code>. The observant
reader might notice that this function call in fact takes in heterogeneous
- arguments where <tt class="computeroutput"><span class="identifier">arg1</span></tt> is of
- type <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></tt> and <tt class="computeroutput"><span class="identifier">arg2</span></tt>
- is of type <tt class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span></tt>. <tt class="computeroutput"><span class="identifier">add</span></tt>
- still works because the C++ standard library allows the expression <tt class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></tt>
- where <tt class="computeroutput"><span class="identifier">a</span></tt> is a <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></tt>
- and <tt class="computeroutput"><span class="identifier">b</span></tt> is a <tt class="computeroutput"><span class="keyword">char</span>
- <span class="keyword">const</span><span class="special">*</span></tt>.
+ arguments where <code class="computeroutput"><span class="identifier">arg1</span></code> is of
+ type <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> and <code class="computeroutput"><span class="identifier">arg2</span></code>
+ is of type <code class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span></code>. <code class="computeroutput"><span class="identifier">add</span></code>
+ still works because the C++ standard library allows the expression <code class="computeroutput"><span class="identifier">a</span> <span class="special">+</span> <span class="identifier">b</span></code>
+ where <code class="computeroutput"><span class="identifier">a</span></code> is a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code>
+ and <code class="computeroutput"><span class="identifier">b</span></code> is a <code class="computeroutput"><span class="keyword">char</span>
+ <span class="keyword">const</span><span class="special">*</span></code>.
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -261,7 +255,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="starter_kit.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="starter_kit.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="organization.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/composite.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/composite.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Composite</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="primitives.html" title="Primitives">
<link rel="next" href="container.html" title="Container">
</head>
@@ -13,18 +13,19 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="primitives.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="container.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="primitives.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="container.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.composite"></a>Composite</h2></div></div></div>
+<a name="phoenix.composite"></a><a class="link" href="composite.html" title="Composite">Composite</a>
+</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section">Function</span></dt>
<dt><span class="section">Operator</span></dt>
@@ -46,12 +47,12 @@
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
- You can set <tt class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></tt>,
- the predefined maximum actors a composite can take. By default, <tt class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></tt> is set to <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt> (See Actors).
+<tr><td align="left" valign="top"><p>
+ You can set <code class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></code>,
+ the predefined maximum actors a composite can take. By default, <code class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></code> is set to <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code> (See <a class="link" href="actors.html" title="Actors">Actors</a>).
</p></td></tr>
</table></div>
<p>
@@ -59,14 +60,14 @@
since a composite is itself an actor. This makes the composite a recursive
structure. The actual evaluation is handled by a composite specific eval policy.
</p>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.composite.function"></a>Function</h3></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.function"></a><a class="link" href="composite.html#phoenix.composite.function" title="Function">Function</a>
+</h3></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- The <tt class="computeroutput"><span class="identifier">function</span></tt> class template
+ The <code class="computeroutput"><span class="identifier">function</span></code> class template
provides a mechanism for implementing lazily evaluated functions. Syntactically,
a lazy function looks like an ordinary C/C++ function. The function call
looks familiar and feels the same as ordinary C++ functions. However, unlike
@@ -74,34 +75,34 @@
</p>
<p>
Unlike ordinary function pointers or functor objects that need to be explicitly
- bound through the bind function (see Bind),
+ bound through the bind function (see <a class="link" href="composite.html#phoenix.composite.bind" title="Bind">Bind</a>),
the argument types of these functions are automatically lazily bound.
</p>
<p>
In order to create a lazy function, we need to implement a model of the FunctionEval
- concept. For a function that takes <tt class="computeroutput"><span class="identifier">N</span></tt>
+ concept. For a function that takes <code class="computeroutput"><span class="identifier">N</span></code>
arguments, a model of FunctionEval must provide:
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- An <tt class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></tt>
- that implements that takes <tt class="computeroutput"><span class="identifier">N</span></tt>
- arguments, and implements the function logic.
- </li>
-<li>
- A nested metafunction <tt class="computeroutput"><span class="identifier">result</span><span class="special"><</span><span class="identifier">A1</span><span class="special">,</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">></span></tt> that takes the types of the <tt class="computeroutput"><span class="identifier">N</span></tt> arguments to the function and returns
- the result type of the function. (There is a special case for function
- objects that accept no arguments. Such nullary functors are only required
- to define a typedef <tt class="computeroutput"><span class="identifier">result_type</span></tt>
- that reflects the return type of its <tt class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></tt>).
- </li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ An <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>
+ that implements that takes <code class="computeroutput"><span class="identifier">N</span></code>
+ arguments, and implements the function logic.
+ </li>
+<li class="listitem">
+ A nested metafunction <code class="computeroutput"><span class="identifier">result</span><span class="special"><</span><span class="identifier">A1</span><span class="special">,</span> <span class="special">...</span> <span class="identifier">AN</span><span class="special">></span></code>
+ that takes the types of the <code class="computeroutput"><span class="identifier">N</span></code>
+ arguments to the function and returns the result type of the function.
+ (There is a special case for function objects that accept no arguments.
+ Such nullary functors are only required to define a typedef <code class="computeroutput"><span class="identifier">result_type</span></code> that reflects the return
+ type of its <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>).
+ </li>
</ul></div>
<p>
For example, the following type implements the FunctionEval concept, in order
to provide a lazy factorial function:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">factorial_impl</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">factorial_impl</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">result</span>
@@ -120,28 +121,25 @@
(See factorial.cpp)
</p>
<p>
- Having implemented the <tt class="computeroutput"><span class="identifier">factorial_impl</span></tt>
- type, we can declare and instantiate a lazy <tt class="computeroutput"><span class="identifier">factorial</span></tt>
+ Having implemented the <code class="computeroutput"><span class="identifier">factorial_impl</span></code>
+ type, we can declare and instantiate a lazy <code class="computeroutput"><span class="identifier">factorial</span></code>
function this way:
</p>
-<pre class="programlisting">
-<span class="identifier">function</span><span class="special"><</span><span class="identifier">factorial_impl</span><span class="special">></span> <span class="identifier">factorial</span><span class="special">;</span>
+<pre class="programlisting"><span class="identifier">function</span><span class="special"><</span><span class="identifier">factorial_impl</span><span class="special">></span> <span class="identifier">factorial</span><span class="special">;</span>
</pre>
<p>
- Invoking a lazy function such as <tt class="computeroutput"><span class="identifier">factorial</span></tt>
- does not immediately execute the function object <tt class="computeroutput"><span class="identifier">factorial_impl</span></tt>.
- Instead, an actor object is created
+ Invoking a lazy function such as <code class="computeroutput"><span class="identifier">factorial</span></code>
+ does not immediately execute the function object <code class="computeroutput"><span class="identifier">factorial_impl</span></code>.
+ Instead, an <a class="link" href="actors.html" title="Actors">actor</a> object is created
and returned to the caller. Example:
</p>
-<pre class="programlisting">
-<span class="identifier">factorial</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">factorial</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
</pre>
<p>
does nothing more than return an actor. A second function call will invoke
the actual factorial function. Example:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">4</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">4</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">factorial</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)(</span><span class="identifier">i</span><span class="special">);</span>
</pre>
<p>
@@ -152,69 +150,68 @@
instance of the model of FunctionEval may be passed on to the constructor.
Example:
</p>
-<pre class="programlisting">
-<span class="identifier">function</span><span class="special"><</span><span class="identifier">factorial_impl</span><span class="special">></span> <span class="identifier">factorial</span><span class="special">(</span><span class="identifier">ftor</span><span class="special">);</span>
+<pre class="programlisting"><span class="identifier">function</span><span class="special"><</span><span class="identifier">factorial_impl</span><span class="special">></span> <span class="identifier">factorial</span><span class="special">(</span><span class="identifier">ftor</span><span class="special">);</span>
</pre>
<p>
where ftor is an instance of factorial_impl (this is not necessary in this
- case as <tt class="computeroutput"><span class="identifier">factorial_impl</span></tt> does
+ case as <code class="computeroutput"><span class="identifier">factorial_impl</span></code> does
not require any state).
</p>
-<div class="sidebar"><p>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
<span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span> Take care though when using function objects with state
because they are often copied repeatedly, and state may change in one of
the copies, rather than the original.
- </p></div>
+ </p>
</div>
-<div class="section" lang="en">
+</div>
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.composite.operator"></a>Operator</h3></div></div></div>
+<a name="phoenix.composite.operator"></a><a class="link" href="composite.html#phoenix.composite.operator" title="Operator">Operator</a>
+</h3></div></div></div>
<p>
This facility provides a mechanism for lazily evaluating operators. Syntactically,
a lazy operator looks and feels like an ordinary C/C++ infix, prefix or postfix
operator. The operator application looks the same. However, unlike ordinary
operators, the actual operator execution is deferred. Samples:
</p>
-<pre class="programlisting">
-<span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span>
+<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span>
<span class="number">1</span> <span class="special">+</span> <span class="identifier">arg1</span> <span class="special">*</span> <span class="identifier">arg2</span>
<span class="number">1</span> <span class="special">/</span> <span class="special">-</span><span class="identifier">arg1</span>
<span class="identifier">arg1</span> <span class="special"><</span> <span class="number">150</span>
</pre>
<p>
- We have seen the lazy operators in action (see <a href="starter_kit.html" title="Starter Kit">Quick
+ We have seen the lazy operators in action (see <a class="link" href="starter_kit.html" title="Starter Kit">Quick
Start</a>). Let's go back and examine them a little bit further:
</p>
-<pre class="programlisting">
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
</pre>
<p>
- Through operator overloading, the expression <tt class="computeroutput"><span class="identifier">arg1</span>
- <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></tt> actually
- generates an actor. This actor object is passed on to STL's <tt class="computeroutput"><span class="identifier">find_if</span></tt> function. From the viewpoint of
+ Through operator overloading, the expression <code class="computeroutput"><span class="identifier">arg1</span>
+ <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> actually
+ generates an actor. This actor object is passed on to STL's <code class="computeroutput"><span class="identifier">find_if</span></code> function. From the viewpoint of
STL, the composite is simply a function object expecting a single argument
- of the containers value_type. For each element in <tt class="computeroutput"><span class="identifier">c</span></tt>,
- the element is passed on as an argument <tt class="computeroutput"><span class="identifier">arg1</span></tt>
+ of the containers value_type. For each element in <code class="computeroutput"><span class="identifier">c</span></code>,
+ the element is passed on as an argument <code class="computeroutput"><span class="identifier">arg1</span></code>
to the actor (function object). The actor checks if this is an odd value
- based on the expression <tt class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span>
- <span class="number">1</span></tt> where arg1 is replaced by the container's
+ based on the expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span>
+ <span class="number">1</span></code> where arg1 is replaced by the container's
element.
</p>
<p>
- Like lazy functions (see function),
+ Like lazy functions (see <a class="link" href="composite.html#phoenix.composite.function" title="Function">function</a>),
lazy operators are not immediately executed when invoked. Instead, an actor
- (see actors) object is created and
+ (see <a class="link" href="actors.html" title="Actors">actors</a>) object is created and
returned to the caller. Example:
</p>
-<pre class="programlisting">
-<span class="special">(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">arg3</span>
+<pre class="programlisting"><span class="special">(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">arg3</span>
</pre>
<p>
does nothing more than return an actor. A second function call will evaluate
the actual operators. Example:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">4</span><span class="special">,</span> <span class="identifier">j</span> <span class="special">=</span> <span class="number">5</span><span class="special">,</span> <span class="identifier">k</span> <span class="special">=</span> <span class="number">6</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">4</span><span class="special">,</span> <span class="identifier">j</span> <span class="special">=</span> <span class="number">5</span><span class="special">,</span> <span class="identifier">k</span> <span class="special">=</span> <span class="number">6</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="special">((</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">arg3</span><span class="special">)(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">j</span><span class="special">,</span> <span class="identifier">k</span><span class="special">);</span>
</pre>
<p>
@@ -223,114 +220,108 @@
<p>
Operator expressions are lazily evaluated following four simple rules:
</p>
-<div class="orderedlist"><ol type="1">
-<li>
- A binary operator, except <tt class="computeroutput"><span class="special">->*</span></tt>
- will be lazily evaluated when <span class="emphasis"><em>at least</em></span> one of its
- operands is an actor object (see actors).
- </li>
-<li>
- Unary operators are lazily evaluted if their argument is an actor object.
- </li>
-<li>
- Operator <tt class="computeroutput"><span class="special">->*</span></tt> is lazily
- evaluted if the left hand argument is an actor object.
- </li>
-<li>
- The result of a lazy operator is an actor object that can in turn allow
- the applications of rules 1 and 2.
- </li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ A binary operator, except <code class="computeroutput"><span class="special">->*</span></code>
+ will be lazily evaluated when <span class="emphasis"><em>at least</em></span> one of its
+ operands is an actor object (see <a class="link" href="actors.html" title="Actors">actors</a>).
+ </li>
+<li class="listitem">
+ Unary operators are lazily evaluted if their argument is an actor object.
+ </li>
+<li class="listitem">
+ Operator <code class="computeroutput"><span class="special">->*</span></code> is lazily
+ evaluted if the left hand argument is an actor object.
+ </li>
+<li class="listitem">
+ The result of a lazy operator is an actor object that can in turn allow
+ the applications of rules 1 and 2.
+ </li>
</ol></div>
<p>
For example, to check the following expression is lazily evaluated:
</p>
-<pre class="programlisting">
-<span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span>
+<pre class="programlisting"><span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span>
</pre>
-<div class="orderedlist"><ol type="1">
-<li>
- Following rule 1, <tt class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></tt> is lazily
- evaluated since <tt class="computeroutput"><span class="identifier">arg1</span></tt> is
- an actor (see primitives).
- </li>
-<li>
- The result of this <tt class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></tt> expression
- is an actor object, following rule 4.
- </li>
-<li>
- Continuing, <tt class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
- <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></tt> is again lazily evaluated. Rule 2.
- </li>
-<li>
- By rule 4 again, the result of <tt class="computeroutput"><span class="identifier">arg1</span>
- <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></tt> is an
- actor object.
- </li>
-<li>
- As <tt class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
- <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></tt> is an actor, <tt class="computeroutput"><span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span></tt> is lazily evaluated. Rule 2.
- </li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ Following rule 1, <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></code> is
+ lazily evaluated since <code class="computeroutput"><span class="identifier">arg1</span></code>
+ is an actor (see <a class="link" href="primitives.html" title="Primitives">primitives</a>).
+ </li>
+<li class="listitem">
+ The result of this <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span></code> expression
+ is an actor object, following rule 4.
+ </li>
+<li class="listitem">
+ Continuing, <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
+ <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is again lazily evaluated. Rule 2.
+ </li>
+<li class="listitem">
+ By rule 4 again, the result of <code class="computeroutput"><span class="identifier">arg1</span>
+ <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is
+ an actor object.
+ </li>
+<li class="listitem">
+ As <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">+</span>
+ <span class="number">3</span> <span class="special">+</span> <span class="number">6</span></code> is an actor, <code class="computeroutput"><span class="special">-(</span><span class="identifier">arg1</span> <span class="special">+</span> <span class="number">3</span> <span class="special">+</span> <span class="number">6</span><span class="special">)</span></code> is lazily evaluated. Rule 2.
+ </li>
</ol></div>
<p>
Lazy-operator application is highly contagious. In most cases, a single
- <tt class="computeroutput"><span class="identifier">argN</span></tt> actor infects all its
+ <code class="computeroutput"><span class="identifier">argN</span></code> actor infects all its
immediate neighbors within a group (first level or parenthesized expression).
</p>
<p>
Note that at least one operand of any operator must be a valid actor for
lazy evaluation to take effect. To force lazy evaluation of an ordinary expression,
- we can use <tt class="computeroutput"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></tt>, <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></tt> or <tt class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></tt>
- to transform an operand into a valid actor object (see primitives.
+ we can use <code class="computeroutput"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>, <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> or <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+ to transform an operand into a valid actor object (see <a class="link" href="primitives.html" title="Primitives">primitives</a>.
For example:
</p>
-<pre class="programlisting">
-<span class="number">1</span> <span class="special"><<</span> <span class="number">3</span><span class="special">;</span> <span class="comment">// Immediately evaluated
+<pre class="programlisting"><span class="number">1</span> <span class="special"><<</span> <span class="number">3</span><span class="special">;</span> <span class="comment">// Immediately evaluated
</span><span class="identifier">val</span><span class="special">(</span><span class="number">1</span><span class="special">)</span> <span class="special"><<</span> <span class="number">3</span><span class="special">;</span> <span class="comment">// Lazily evaluated
</span></pre>
-<a name="phoenix.composite.operator.supported_operators"></a><h2>
-<a name="id469184"></a>
- <a href="composite.html#phoenix.composite.operator.supported_operators">Supported
+<a name="phoenix.composite.operator.supported_operators"></a><h3>
+<a name="id771576"></a>
+ <a class="link" href="composite.html#phoenix.composite.operator.supported_operators">Supported
operators</a>
- </h2>
-<a name="phoenix.composite.operator.unary_operators"></a><h3>
-<a name="id469209"></a>
- Unary operators
</h3>
-<pre class="programlisting">
-<span class="identifier">prefix</span><span class="special">:</span> <span class="special">~,</span> <span class="special">!,</span> <span class="special">-,</span> <span class="special">+,</span> <span class="special">++,</span> <span class="special">--,</span> <span class="special">&</span> <span class="special">(</span><span class="identifier">reference</span><span class="special">),</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">dereference</span><span class="special">)</span>
+<a name="phoenix.composite.operator.unary_operators"></a><h4>
+<a name="id771597"></a>
+ <a class="link" href="composite.html#phoenix.composite.operator.unary_operators">Unary operators</a>
+ </h4>
+<pre class="programlisting"><span class="identifier">prefix</span><span class="special">:</span> <span class="special">~,</span> <span class="special">!,</span> <span class="special">-,</span> <span class="special">+,</span> <span class="special">++,</span> <span class="special">--,</span> <span class="special">&</span> <span class="special">(</span><span class="identifier">reference</span><span class="special">),</span> <span class="special">*</span> <span class="special">(</span><span class="identifier">dereference</span><span class="special">)</span>
<span class="identifier">postfix</span><span class="special">:</span> <span class="special">++,</span> <span class="special">--</span>
</pre>
-<a name="phoenix.composite.operator.binary_operators"></a><h3>
-<a name="id469357"></a>
- Binary operators
- </h3>
-<pre class="programlisting">
-<span class="special">=,</span> <span class="special">[],</span> <span class="special">+=,</span> <span class="special">-=,</span> <span class="special">*=,</span> <span class="special">/=,</span> <span class="special">%=,</span> <span class="special">&=,</span> <span class="special">|=,</span> <span class="special">^=,</span> <span class="special"><<=,</span> <span class="special">>>=</span>
+<a name="phoenix.composite.operator.binary_operators"></a><h4>
+<a name="id771727"></a>
+ <a class="link" href="composite.html#phoenix.composite.operator.binary_operators">Binary operators</a>
+ </h4>
+<pre class="programlisting"><span class="special">=,</span> <span class="special">[],</span> <span class="special">+=,</span> <span class="special">-=,</span> <span class="special">*=,</span> <span class="special">/=,</span> <span class="special">%=,</span> <span class="special">&=,</span> <span class="special">|=,</span> <span class="special">^=,</span> <span class="special"><<=,</span> <span class="special">>>=</span>
<span class="special">+,</span> <span class="special">-,</span> <span class="special">*,</span> <span class="special">/,</span> <span class="special">%,</span> <span class="special">&,</span> <span class="special">|,</span> <span class="special">^,</span> <span class="special"><<,</span> <span class="special">>></span>
<span class="special">==,</span> <span class="special">!=,</span> <span class="special"><,</span> <span class="special">>,</span> <span class="special"><=,</span> <span class="special">>=</span>
<span class="special">&&,</span> <span class="special">||,</span> <span class="special">->*</span>
</pre>
-<a name="phoenix.composite.operator.ternary_operator"></a><h3>
-<a name="id469580"></a>
- Ternary operator
- </h3>
-<pre class="programlisting">
-<span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span>
+<a name="phoenix.composite.operator.ternary_operator"></a><h4>
+<a name="id771926"></a>
+ <a class="link" href="composite.html#phoenix.composite.operator.ternary_operator">Ternary operator</a>
+ </h4>
+<pre class="programlisting"><span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span>
</pre>
<p>
The ternary operator deserves special mention. Since C++ does not allow us
- to overload the conditional expression: <tt class="computeroutput"><span class="identifier">c</span>
- <span class="special">?</span> <span class="identifier">a</span> <span class="special">:</span> <span class="identifier">b</span></tt>, the
+ to overload the conditional expression: <code class="computeroutput"><span class="identifier">c</span>
+ <span class="special">?</span> <span class="identifier">a</span> <span class="special">:</span> <span class="identifier">b</span></code>, the
if_else pseudo function is provided for this purpose. The behavior is identical,
albeit in a lazy manner.
</p>
-<a name="phoenix.composite.operator.member_pointer_operator"></a><h3>
-<a name="id469700"></a>
- <a href="composite.html#phoenix.composite.operator.member_pointer_operator">Member
+<a name="phoenix.composite.operator.member_pointer_operator"></a><h4>
+<a name="id772030"></a>
+ <a class="link" href="composite.html#phoenix.composite.operator.member_pointer_operator">Member
pointer operator</a>
- </h3>
-<pre class="programlisting">
-<span class="identifier">a</span><span class="special">->*</span><span class="identifier">member_object_pointer</span>
+ </h4>
+<pre class="programlisting"><span class="identifier">a</span><span class="special">->*</span><span class="identifier">member_object_pointer</span>
<span class="identifier">a</span><span class="special">->*</span><span class="identifier">member_function_pointer</span>
</pre>
<p>
@@ -342,8 +333,7 @@
If the right hand side is a member object pointer, the result is an actor
which, when evaluated, returns a reference to that member. For example:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">A</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">A</span>
<span class="special">{</span>
<span class="keyword">int</span> <span class="identifier">member</span><span class="special">;</span>
<span class="special">};</span>
@@ -357,8 +347,7 @@
If the right hand side is a member function pointer, the result is an actor
which, when invoked, calls the specified member function. For example:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">A</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">A</span>
<span class="special">{</span>
<span class="keyword">int</span> <span class="identifier">func</span><span class="special">(</span><span class="keyword">int</span><span class="special">);</span>
<span class="special">};</span>
@@ -369,140 +358,142 @@
<span class="special">(</span><span class="identifier">arg1</span><span class="special">->*&</span><span class="identifier">A</span><span class="special">::</span><span class="identifier">func</span><span class="special">)(</span><span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">i</span><span class="special">);</span> <span class="comment">// returns a->func(i)
</span></pre>
<div class="table">
-<a name="id470127"></a><p class="title"><b>Table 1.4. Include Files</b></p>
-<table class="table" summary="Include Files">
+<a name="id772403"></a><p class="title"><b>Table 1.4. Include Files</b></p>
+<div class="table-contents"><table class="table" summary="Include Files">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Operators
- </p>
- </th>
+ <p>
+ Operators
+ </p>
+ </th>
<th>
- <p>
- File
- </p>
- </th>
+ <p>
+ File
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="special">-</span></tt>, <tt class="computeroutput"><span class="special">+</span></tt>,
- <tt class="computeroutput"><span class="special">++</span></tt>, <tt class="computeroutput"><span class="special">--</span></tt>,
- <tt class="computeroutput"><span class="special">+=</span></tt>, <tt class="computeroutput"><span class="special">-=</span></tt>,
- <tt class="computeroutput"><span class="special">*=</span></tt>, <tt class="computeroutput"><span class="special">/=</span></tt>,
- <tt class="computeroutput"><span class="special">%=</span></tt>, <tt class="computeroutput"><span class="special">*</span></tt>,
- <tt class="computeroutput"><span class="special">/</span></tt>, <tt class="computeroutput"><span class="special">%</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">-</span></code>, <code class="computeroutput"><span class="special">+</span></code>,
+ <code class="computeroutput"><span class="special">++</span></code>, <code class="computeroutput"><span class="special">--</span></code>, <code class="computeroutput"><span class="special">+=</span></code>,
+ <code class="computeroutput"><span class="special">-=</span></code>, <code class="computeroutput"><span class="special">*=</span></code>, <code class="computeroutput"><span class="special">/=</span></code>,
+ <code class="computeroutput"><span class="special">%=</span></code>, <code class="computeroutput"><span class="special">*</span></code>, <code class="computeroutput"><span class="special">/</span></code>,
+ <code class="computeroutput"><span class="special">%</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">arithmetic</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">arithmetic</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="special">&=</span></tt>, <tt class="computeroutput"><span class="special">|=</span></tt>, <tt class="computeroutput"><span class="special">^=</span></tt>,
- <tt class="computeroutput"><span class="special"><<=</span></tt>, <tt class="computeroutput"><span class="special">>>=</span></tt>, <tt class="computeroutput"><span class="special">&</span></tt>,
- <tt class="computeroutput"><span class="special">|</span></tt>, <tt class="computeroutput"><span class="special">^</span></tt>,
- <tt class="computeroutput"><span class="special"><<</span></tt>, <tt class="computeroutput"><span class="special">>></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">&=</span></code>, <code class="computeroutput"><span class="special">|=</span></code>, <code class="computeroutput"><span class="special">^=</span></code>,
+ <code class="computeroutput"><span class="special"><<=</span></code>, <code class="computeroutput"><span class="special">>>=</span></code>, <code class="computeroutput"><span class="special">&</span></code>,
+ <code class="computeroutput"><span class="special">|</span></code>, <code class="computeroutput"><span class="special">^</span></code>,
+ <code class="computeroutput"><span class="special"><<</span></code>, <code class="computeroutput"><span class="special">>></span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">bitwise</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">bitwise</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="special">==</span></tt>, <tt class="computeroutput"><span class="special">!=</span></tt>,
- <tt class="computeroutput"><span class="special"><</span></tt>, <tt class="computeroutput"><span class="special"><=</span></tt>,
- <tt class="computeroutput"><span class="special">></span></tt>, <tt class="computeroutput"><span class="special">>=</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">==</span></code>, <code class="computeroutput"><span class="special">!=</span></code>, <code class="computeroutput"><span class="special"><</span></code>,
+ <code class="computeroutput"><span class="special"><=</span></code>, <code class="computeroutput"><span class="special">></span></code>, <code class="computeroutput"><span class="special">>=</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">comparison</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">comparison</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="special"><<</span></tt>, <tt class="computeroutput"><span class="special">>></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special"><<</span></code>, <code class="computeroutput"><span class="special">>></span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">io</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">io</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="special">!</span></tt>, &&, <tt class="computeroutput"><span class="special">||</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">!</span></code>, &&, <code class="computeroutput"><span class="special">||</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">logical</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">logical</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="special">&</span><span class="identifier">x</span></tt>,
- <tt class="computeroutput"><span class="special">*</span><span class="identifier">p</span></tt>,
- <tt class="computeroutput"><span class="special">=</span></tt>, <tt class="computeroutput"><span class="special">[]</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">&</span><span class="identifier">x</span></code>,
+ <code class="computeroutput"><span class="special">*</span><span class="identifier">p</span></code>,
+ <code class="computeroutput"><span class="special">=</span></code>, <code class="computeroutput"><span class="special">[]</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">self</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">self</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">if_else</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span>
+ <span class="identifier">a</span><span class="special">,</span>
+ <span class="identifier">b</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">if_else</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">if_else</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="special">->*</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="special">->*</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">member</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">/</span><span class="identifier">member</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
+<br class="table-break">
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.composite.statement"></a>Statement</h3></div></div></div>
+<a name="phoenix.composite.statement"></a><a class="link" href="composite.html#phoenix.composite.statement" title="Statement">Statement</a>
+</h3></div></div></div>
<div class="toc"><dl>
<dt><span class="section"><a href="composite.html#phoenix.composite.statement.block_statement">Block
Statement</a></span></dt>
@@ -519,7 +510,7 @@
<dt><span class="section">throw_</span></dt>
</dl></div>
<p>
- <span class="bold"><b><span class="emphasis"><em>Lazy statements...</em></span></b></span>
+ <span class="bold"><strong><span class="emphasis"><em>Lazy statements...</em></span></strong></span>
</p>
<p>
The primitives and composite building blocks presented so far are sufficiently
@@ -527,11 +518,10 @@
functions and lazy-operators. How about lazy-statements? First, an appetizer:
</p>
<p>
- Print all odd-numbered contents of an STL container using <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></tt>
+ Print all odd-numbered contents of an STL container using <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>
(all_odds.cpp):
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg1</span> <span class="special"><<</span> <span class="char">' '</span>
@@ -544,18 +534,18 @@
<p>
Yes, it is valid C++. The sample code above is as close as you can get to
the syntax of C++. This stylized C++ syntax differs from actual C++ code.
- First, the <tt class="computeroutput"><span class="keyword">if</span></tt> has a trailing
+ First, the <code class="computeroutput"><span class="keyword">if</span></code> has a trailing
underscore. Second, the block uses square brackets instead of the familiar
curly braces {}.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top">
+<tr><td align="left" valign="top">
<p>
- <span class="bold"><b>C++ in C++?</b></span>
+ <span class="bold"><strong>C++ in C++?</strong></span>
</p>
<p>
In as much as Spirit
@@ -566,31 +556,28 @@
<p>
Here are more examples with annotations. The code almost speaks for itself.
</p>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.block_statement"></a><a href="composite.html#phoenix.composite.statement.block_statement" title="Block
- Statement">Block
- Statement</a></h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">sequence</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.block_statement"></a><a class="link" href="composite.html#phoenix.composite.statement.block_statement" title="Block Statement">Block
+ Statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">sequence</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Syntax:
</p>
-<pre class="programlisting">
-<span class="identifier">statement</span><span class="special">,</span>
+<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
<span class="identifier">statement</span><span class="special">,</span>
<span class="special">....</span>
<span class="identifier">statement</span>
</pre>
<p>
Basically, these are comma separated statements. Take note that unlike
- the C/C++ semicolon, the comma is a separator put <span class="bold"><b>in-between</b></span>
+ the C/C++ semicolon, the comma is a separator put <span class="bold"><strong>in-between</strong></span>
statements. This is like Pascal's semicolon separator, rather than C/C++'s
semicolon terminator. For example:
</p>
-<pre class="programlisting">
-<span class="identifier">statement</span><span class="special">,</span>
+<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
<span class="identifier">statement</span><span class="special">,</span>
<span class="identifier">statement</span><span class="special">,</span> <span class="comment">// ERROR!
</span></pre>
@@ -599,8 +586,7 @@
can be grouped using the parentheses. Again, the last statement in a group
should not have a trailing comma.
</p>
-<pre class="programlisting">
-<span class="identifier">statement</span><span class="special">,</span>
+<pre class="programlisting"><span class="identifier">statement</span><span class="special">,</span>
<span class="identifier">statement</span><span class="special">,</span>
<span class="special">(</span>
<span class="identifier">statement</span><span class="special">,</span>
@@ -611,8 +597,7 @@
<p>
Outside the square brackets, block statements should be grouped. For example:
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="special">(</span>
<span class="identifier">do_this</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">),</span>
<span class="identifier">do_that</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
@@ -627,34 +612,32 @@
chain (and spits out an error for zero arguments).
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.if__statement"></a>if_ Statement</h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.if__statement"></a><a class="link" href="composite.html#phoenix.composite.statement.if__statement" title="if_ Statement">if_ Statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- We have seen the <tt class="computeroutput"><span class="identifier">if_</span></tt> statement.
+ We have seen the <code class="computeroutput"><span class="identifier">if_</span></code> statement.
The syntax is:
</p>
-<pre class="programlisting">
-<span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">sequenced_statements</span>
<span class="special">]</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.if_else__statement"></a>ifelse statement</h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.if_else__statement"></a><a class="link" href="composite.html#phoenix.composite.statement.if_else__statement" title="ifelse statement">if<span class="underline">else</span> statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The syntax is
</p>
-<pre class="programlisting">
-<span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">sequenced_statements</span>
<span class="special">]</span>
@@ -664,16 +647,15 @@
<span class="special">]</span>
</pre>
<p>
- Take note that <tt class="computeroutput"><span class="keyword">else</span></tt> has a
- leading dot and a trailing underscore: <tt class="computeroutput"><span class="special">.</span><span class="identifier">else_</span></tt>
+ Take note that <code class="computeroutput"><span class="keyword">else</span></code> has a
+ leading dot and a trailing underscore: <code class="computeroutput"><span class="special">.</span><span class="identifier">else_</span></code>
</p>
<p>
- Example: This code prints out all the elements and appends <tt class="computeroutput"><span class="string">" > 5"</span></tt>, <tt class="computeroutput"><span class="string">"
- == 5"</span></tt> or <tt class="computeroutput"><span class="string">" < 5"</span></tt>
+ Example: This code prints out all the elements and appends <code class="computeroutput"><span class="string">" > 5"</span></code>, <code class="computeroutput"><span class="string">"
+ == 5"</span></code> or <code class="computeroutput"><span class="string">" < 5"</span></code>
depending on the element's actual value:
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">></span> <span class="number">5</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg1</span> <span class="special"><<</span> <span class="string">" > 5\n"</span>
@@ -692,23 +674,21 @@
<span class="special">);</span>
</pre>
<p>
- Notice how the <tt class="computeroutput"><span class="identifier">if_else_</span></tt>
+ Notice how the <code class="computeroutput"><span class="identifier">if_else_</span></code>
statement is nested.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.switch__statement"></a><a href="composite.html#phoenix.composite.statement.switch__statement" title="switch_
- statement">switch_
- statement</a></h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">switch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.switch__statement"></a><a class="link" href="composite.html#phoenix.composite.statement.switch__statement" title="switch_ statement">switch_
+ statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">switch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The syntax is:
</p>
-<pre class="programlisting">
-<span class="identifier">switch_</span><span class="special">(</span><span class="identifier">integral_expression</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">switch_</span><span class="special">(</span><span class="identifier">integral_expression</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">case_</span><span class="special"><</span><span class="identifier">integral_value</span><span class="special">>(</span><span class="identifier">sequenced_statements</span><span class="special">),</span>
<span class="special">...</span>
@@ -720,12 +700,11 @@
Note unlike a normal switch statement, cases do not fall through.
</p>
<p>
- Example: This code prints out <tt class="computeroutput"><span class="string">"one"</span></tt>,
- <tt class="computeroutput"><span class="string">"two"</span></tt> or <tt class="computeroutput"><span class="string">"other value"</span></tt> depending on the
+ Example: This code prints out <code class="computeroutput"><span class="string">"one"</span></code>,
+ <code class="computeroutput"><span class="string">"two"</span></code> or <code class="computeroutput"><span class="string">"other value"</span></code> depending on the
element's actual value:
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="identifier">switch_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">case_</span><span class="special"><</span><span class="number">1</span><span class="special">>(</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"one"</span><span class="special">)</span> <span class="special"><<</span> <span class="char">'\n'</span><span class="special">),</span>
@@ -735,19 +714,17 @@
<span class="special">);</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.while__statement"></a><a href="composite.html#phoenix.composite.statement.while__statement" title="while_
- Statement">while_
- Statement</a></h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.while__statement"></a><a class="link" href="composite.html#phoenix.composite.statement.while__statement" title="while_ Statement">while_
+ Statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The syntax is:
</p>
-<pre class="programlisting">
-<span class="identifier">while_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">sequenced_statements</span>
<span class="special">]</span>
@@ -757,8 +734,7 @@
out the number at each step. A newline terminates the printout of each
value.
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="special">(</span>
<span class="identifier">while_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">--)</span>
<span class="special">[</span>
@@ -769,32 +745,30 @@
<span class="special">);</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.do_while__statement"></a>dowhile Statement</h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">do_while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.do_while__statement"></a><a class="link" href="composite.html#phoenix.composite.statement.do_while__statement" title="dowhile Statement">do<span class="underline">while</span> Statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">do_while</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The syntax is:
</p>
-<pre class="programlisting">
-<span class="identifier">do_</span>
+<pre class="programlisting"><span class="identifier">do_</span>
<span class="special">[</span>
<span class="identifier">sequenced_statements</span>
<span class="special">]</span>
<span class="special">.</span><span class="identifier">while_</span><span class="special">(</span><span class="identifier">conditional_expression</span><span class="special">)</span>
</pre>
<p>
- Again, take note that <tt class="computeroutput"><span class="keyword">while</span></tt>
- has a leading dot and a trailing underscore: <tt class="computeroutput"><span class="special">.</span><span class="identifier">while_</span></tt>
+ Again, take note that <code class="computeroutput"><span class="keyword">while</span></code>
+ has a leading dot and a trailing underscore: <code class="computeroutput"><span class="special">.</span><span class="identifier">while_</span></code>
</p>
<p>
Example: This code is almost the same as the previous example above with
a slight twist in logic.
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="special">(</span>
<span class="identifier">do_</span>
<span class="special">[</span>
@@ -806,17 +780,16 @@
<span class="special">);</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.for__statement"></a>for_ Statement</h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">for</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.for__statement"></a><a class="link" href="composite.html#phoenix.composite.statement.for__statement" title="for_ Statement">for_ Statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">for</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The syntax is:
</p>
-<pre class="programlisting">
-<span class="identifier">for_</span><span class="special">(</span><span class="identifier">init_statement</span><span class="special">,</span> <span class="identifier">conditional_expression</span><span class="special">,</span> <span class="identifier">step_statement</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">for_</span><span class="special">(</span><span class="identifier">init_statement</span><span class="special">,</span> <span class="identifier">conditional_expression</span><span class="special">,</span> <span class="identifier">step_statement</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">sequenced_statements</span>
<span class="special">]</span>
@@ -825,14 +798,13 @@
It is again very similar to the C++ for statement. Take note that the init_statement,
conditional_expression and step<span class="underline">statement are
separated by the comma instead of the semi-colon and each must be present
- (i.e. `for</span>(,,)` is invalid). This is a case where the nothing actor can be useful.
+ (i.e. `for</span>(,,)` is invalid). This is a case where the <a class="link" href="primitives.html#phoenix.primitives.nothing" title="Nothing">nothing</a> actor can be useful.
</p>
<p>
Example: This code prints each element N times where N is the element's
value. A newline terminates the printout of each value.
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">iii</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">iii</span><span class="special">;</span>
<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="special">(</span>
<span class="identifier">for_</span><span class="special">(</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">)</span> <span class="special">=</span> <span class="number">0</span><span class="special">,</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">)</span> <span class="special"><</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="special">++</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">iii</span><span class="special">))</span>
@@ -846,33 +818,31 @@
<p>
As before, all these are lazily evaluated. The result of such statements
are in fact composites that are passed on to STL's for_each function. In
- the viewpoint of <tt class="computeroutput"><span class="identifier">for_each</span></tt>,
+ the viewpoint of <code class="computeroutput"><span class="identifier">for_each</span></code>,
what was passed is just a functor, no more, no less.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
Unlike lazy functions and lazy operators, lazy statements always return
void.
</p></td></tr>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.try__catch__statement"></a><a href="composite.html#phoenix.composite.statement.try__catch__statement" title="try_
- catch_ Statement">try_
- catch_ Statement</a></h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">try_catch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.try__catch__statement"></a><a class="link" href="composite.html#phoenix.composite.statement.try__catch__statement" title="try_ catch_ Statement">try_
+ catch_ Statement</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="identifier">try_catch</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The syntax is:
</p>
-<pre class="programlisting">
-<span class="identifier">try_</span>
+<pre class="programlisting"><span class="identifier">try_</span>
<span class="special">[</span>
<span class="identifier">sequenced_statements</span>
<span class="special">]</span>
@@ -891,12 +861,11 @@
required after the catch.
</p>
<p>
- Example: The following code calls the (lazy) function <tt class="computeroutput"><span class="identifier">f</span></tt>
+ Example: The following code calls the (lazy) function <code class="computeroutput"><span class="identifier">f</span></code>
for each element, and prints messages about different exception types it
catches.
</p>
-<pre class="programlisting">
-<span class="identifier">try_</span>
+<pre class="programlisting"><span class="identifier">try_</span>
<span class="special">[</span>
<span class="identifier">f</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
<span class="special">]</span>
@@ -914,11 +883,11 @@
<span class="special">]</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.composite.statement.throw_"></a>throw_</h4></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">throw</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.statement.throw_"></a><a class="link" href="composite.html#phoenix.composite.statement.throw_" title="throw_">throw_</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">/</span><span class="keyword">throw</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
As a natural companion to the try/catch support, the statement module provides
@@ -927,22 +896,19 @@
<p>
The syntax to throw an exception is:
</p>
-<pre class="programlisting">
-<span class="identifier">throw_</span><span class="special">(</span><span class="identifier">exception_expression</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">throw_</span><span class="special">(</span><span class="identifier">exception_expression</span><span class="special">)</span>
</pre>
<p>
The syntax to rethrow an exception is:
</p>
-<pre class="programlisting">
-<span class="identifier">throw_</span><span class="special">()</span>
+<pre class="programlisting"><span class="identifier">throw_</span><span class="special">()</span>
</pre>
<p>
Example: This code extends the try/catch example, rethrowing exceptions
derived from runtime_error or exception, and translating other exception
types to runtime_errors.
</p>
-<pre class="programlisting">
-<span class="identifier">try_</span>
+<pre class="programlisting"><span class="identifier">try_</span>
<span class="special">[</span>
<span class="identifier">f</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span>
<span class="special">]</span>
@@ -964,30 +930,29 @@
</pre>
</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.composite.object"></a>Object</h3></div></div></div>
+<a name="phoenix.composite.object"></a><a class="link" href="composite.html#phoenix.composite.object" title="Object">Object</a>
+</h3></div></div></div>
<p>
The Object module deals with object construction, destruction and conversion.
The module provides <span class="emphasis"><em>"lazy"</em></span> versions of C++'s
- object constructor, <tt class="computeroutput"><span class="keyword">new</span></tt>, <tt class="computeroutput"><span class="keyword">delete</span></tt>, <tt class="computeroutput"><span class="keyword">static_cast</span></tt>,
- <tt class="computeroutput"><span class="keyword">dynamic_cast</span></tt>, <tt class="computeroutput"><span class="keyword">const_cast</span></tt> and <tt class="computeroutput"><span class="keyword">reinterpret_cast</span></tt>.
+ object constructor, <code class="computeroutput"><span class="keyword">new</span></code>, <code class="computeroutput"><span class="keyword">delete</span></code>, <code class="computeroutput"><span class="keyword">static_cast</span></code>,
+ <code class="computeroutput"><span class="keyword">dynamic_cast</span></code>, <code class="computeroutput"><span class="keyword">const_cast</span></code> and <code class="computeroutput"><span class="keyword">reinterpret_cast</span></code>.
</p>
-<a name="phoenix.composite.object.construction"></a><h2>
-<a name="id475908"></a>
- Construction
- </h2>
+<a name="phoenix.composite.object.construction"></a><h3>
+<a name="id777481"></a>
+ <a class="link" href="composite.html#phoenix.composite.object.construction">Construction</a>
+ </h3>
<p>
- <span class="bold"><b><span class="emphasis"><em>Lazy constructors...</em></span></b></span>
+ <span class="bold"><strong><span class="emphasis"><em>Lazy constructors...</em></span></strong></span>
</p>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="identifier">construct</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="identifier">construct</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Lazily construct an object from an arbitrary set of arguments:
</p>
-<pre class="programlisting">
-<span class="identifier">construct</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
+<pre class="programlisting"><span class="identifier">construct</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
</pre>
<p>
where the given parameters are the parameters to the contructor of the object
@@ -997,41 +962,38 @@
<p>
Example:
</p>
-<pre class="programlisting">
-<span class="identifier">construct</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">construct</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
</pre>
<p>
- Constructs a <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></tt> from <tt class="computeroutput"><span class="identifier">arg1</span></tt>
- and <tt class="computeroutput"><span class="identifier">arg2</span></tt>.
+ Constructs a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> from <code class="computeroutput"><span class="identifier">arg1</span></code>
+ and <code class="computeroutput"><span class="identifier">arg2</span></code>.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
The maximum number of actual parameters is limited by the preprocessor
constant PHOENIX_COMPOSITE_LIMIT. Note though, that this limit should not
- be greater than PHOENIX_LIMIT. By default, <tt class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></tt>
- is set to <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>
- (See Actors).
+ be greater than PHOENIX_LIMIT. By default, <code class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></code>
+ is set to <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>
+ (See <a class="link" href="actors.html" title="Actors">Actors</a>).
</p></td></tr>
</table></div>
-<a name="phoenix.composite.object.new"></a><h2>
-<a name="id476272"></a>
- New
- </h2>
+<a name="phoenix.composite.object.new"></a><h3>
+<a name="id777797"></a>
+ <a class="link" href="composite.html#phoenix.composite.object.new">New</a>
+ </h3>
<p>
- <span class="bold"><b><span class="emphasis"><em>Lazy new...</em></span></b></span>
+ <span class="bold"><strong><span class="emphasis"><em>Lazy new...</em></span></strong></span>
</p>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">new</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">new</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Lazily construct an object, on the heap, from an arbitrary set of arguments:
</p>
-<pre class="programlisting">
-<span class="identifier">new_</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
+<pre class="programlisting"><span class="identifier">new_</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">ctor_arg1</span><span class="special">,</span> <span class="identifier">ctor_arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ctor_argN</span><span class="special">);</span>
</pre>
<p>
where the given parameters are the parameters to the contructor of the object
@@ -1041,38 +1003,35 @@
<p>
Example:
</p>
-<pre class="programlisting">
-<span class="identifier">new_</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// note the spelling of new_ (with trailing underscore)
+<pre class="programlisting"><span class="identifier">new_</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// note the spelling of new_ (with trailing underscore)
</span></pre>
<p>
- Creates a <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></tt> from <tt class="computeroutput"><span class="identifier">arg1</span></tt>
- and <tt class="computeroutput"><span class="identifier">arg2</span></tt> on the heap.
+ Creates a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span></code> from <code class="computeroutput"><span class="identifier">arg1</span></code>
+ and <code class="computeroutput"><span class="identifier">arg2</span></code> on the heap.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
Again, the maximum number of actual parameters is limited by the preprocessor
constant PHOENIX_COMPOSITE_LIMIT. See the note above.
</p></td></tr>
</table></div>
-<a name="phoenix.composite.object.delete"></a><h2>
-<a name="id476608"></a>
- Delete
- </h2>
+<a name="phoenix.composite.object.delete"></a><h3>
+<a name="id778089"></a>
+ <a class="link" href="composite.html#phoenix.composite.object.delete">Delete</a>
+ </h3>
<p>
- <span class="bold"><b><span class="emphasis"><em>Lazy delete...</em></span></b></span>
+ <span class="bold"><strong><span class="emphasis"><em>Lazy delete...</em></span></strong></span>
</p>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">delete</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">delete</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Lazily delete an object, from the heap:
</p>
-<pre class="programlisting">
-<span class="identifier">delete_</span><span class="special">(</span><span class="identifier">arg</span><span class="special">);</span>
+<pre class="programlisting"><span class="identifier">delete_</span><span class="special">(</span><span class="identifier">arg</span><span class="special">);</span>
</pre>
<p>
where arg is assumed to be a pointer to an object.
@@ -1080,18 +1039,16 @@
<p>
Example:
</p>
-<pre class="programlisting">
-<span class="identifier">delete_</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// note the spelling of delete_ (with trailing underscore)
+<pre class="programlisting"><span class="identifier">delete_</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// note the spelling of delete_ (with trailing underscore)
</span></pre>
-<a name="phoenix.composite.object.casts"></a><h2>
-<a name="id476828"></a>
- Casts
- </h2>
+<a name="phoenix.composite.object.casts"></a><h3>
+<a name="id778280"></a>
+ <a class="link" href="composite.html#phoenix.composite.object.casts">Casts</a>
+ </h3>
<p>
- <span class="bold"><b><span class="emphasis"><em>Lazy casts...</em></span></b></span>
+ <span class="bold"><strong><span class="emphasis"><em>Lazy casts...</em></span></strong></span>
</p>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">static_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">static_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">dynamic_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">const_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">/</span><span class="keyword">reinterpret_cast</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -1102,8 +1059,7 @@
known C++ casts. Take note however that the lazy versions have a trailing
underscore.
</p>
-<pre class="programlisting">
-<span class="identifier">static_cast_</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">static_cast_</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
<span class="identifier">dynamic_cast_</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
<span class="identifier">const_cast_</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
<span class="identifier">reinterpret_cast_</span><span class="special"><</span><span class="identifier">T</span><span class="special">>(</span><span class="identifier">lambda_expression</span><span class="special">)</span>
@@ -1111,17 +1067,17 @@
<p>
Example:
</p>
-<pre class="programlisting">
-<span class="identifier">static_cast_</span><span class="special"><</span><span class="identifier">Base</span><span class="special">*>(&</span><span class="identifier">arg1</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">static_cast_</span><span class="special"><</span><span class="identifier">Base</span><span class="special">*>(&</span><span class="identifier">arg1</span><span class="special">)</span>
</pre>
<p>
- Static-casts the address of <tt class="computeroutput"><span class="identifier">arg1</span></tt>
- to a <tt class="computeroutput"><span class="identifier">Base</span><span class="special">*</span></tt>.
+ Static-casts the address of <code class="computeroutput"><span class="identifier">arg1</span></code>
+ to a <code class="computeroutput"><span class="identifier">Base</span><span class="special">*</span></code>.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.composite.scope"></a>Scope</h3></div></div></div>
+<a name="phoenix.composite.scope"></a><a class="link" href="composite.html#phoenix.composite.scope" title="Scope">Scope</a>
+</h3></div></div></div>
<p>
Up until now, the most basic ingredient is missing: creation of and access
to local variables in the stack. When recursion comes into play, you will
@@ -1140,107 +1096,97 @@
<p>
This section deals with local variables and nested lambda scopes.
</p>
-<a name="phoenix.composite.scope.local_variables"></a><h2>
-<a name="id477747"></a>
- Local Variables
- </h2>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">local_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.scope.local_variables"></a><h3>
+<a name="id778838"></a>
+ <a class="link" href="composite.html#phoenix.composite.scope.local_variables">Local Variables</a>
+ </h3>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">local_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
We use an instance of:
</p>
-<pre class="programlisting">
-<span class="identifier">actor</span><span class="special"><</span><span class="identifier">local_variable</span><span class="special"><</span><span class="identifier">Key</span><span class="special">></span> <span class="special">></span>
+<pre class="programlisting"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">local_variable</span><span class="special"><</span><span class="identifier">Key</span><span class="special">></span> <span class="special">></span>
</pre>
<p>
to represent a local variable. The local variable acts as an imaginary data-bin
- where a local, stack based data will be placed. <tt class="computeroutput"><span class="identifier">Key</span></tt>
+ where a local, stack based data will be placed. <code class="computeroutput"><span class="identifier">Key</span></code>
is an arbitrary type that is used to identify the local variable. Example:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">size_key</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">size_key</span><span class="special">;</span>
<span class="identifier">actor</span><span class="special"><</span><span class="identifier">local_variable</span><span class="special"><</span><span class="identifier">size_key</span><span class="special">></span> <span class="special">></span> <span class="identifier">size</span><span class="special">;</span>
</pre>
-<a name="phoenix.composite.scope.predefined_local_variables"></a><h2>
-<a name="id477871"></a>
- <a href="composite.html#phoenix.composite.scope.predefined_local_variables">Predefined
+<a name="phoenix.composite.scope.predefined_local_variables"></a><h3>
+<a name="id779063"></a>
+ <a class="link" href="composite.html#phoenix.composite.scope.predefined_local_variables">Predefined
Local Variables</a>
- </h2>
+ </h3>
<p>
- There are a few predefined instances of <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">local_variable</span><span class="special"><</span><span class="identifier">Key</span><span class="special">></span> <span class="special">></span></tt>
- named <tt class="computeroutput"><span class="identifier">_a</span></tt>..<tt class="computeroutput"><span class="identifier">_z</span></tt>
- that you can already use. To make use of them, simply use the <tt class="computeroutput"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span></tt>:
- </p>
-<pre class="programlisting">
-<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span><span class="special">;</span>
-</pre>
-<a name="phoenix.composite.scope.let"></a><h2>
-<a name="id478058"></a>
- let
- </h2>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">let</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+ There are a few predefined instances of <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">local_variable</span><span class="special"><</span><span class="identifier">Key</span><span class="special">></span> <span class="special">></span></code>
+ named <code class="computeroutput"><span class="identifier">_a</span></code>..<code class="computeroutput"><span class="identifier">_z</span></code>
+ that you can already use. To make use of them, simply use the <code class="computeroutput"><span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span></code>:
+ </p>
+<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">phoenix</span><span class="special">::</span><span class="identifier">local_names</span><span class="special">;</span>
+</pre>
+<a name="phoenix.composite.scope.let"></a><h3>
+<a name="id779228"></a>
+ <a class="link" href="composite.html#phoenix.composite.scope.let">let</a>
+ </h3>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">let</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
You declare local variables using the syntax:
</p>
-<pre class="programlisting">
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">let</span><span class="special">-</span><span class="identifier">body</span>
<span class="special">]</span>
</pre>
<p>
- <tt class="computeroutput"><span class="identifier">let</span></tt> allows 1..N local variable
- declarations (where N == <tt class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></tt>).
+ <code class="computeroutput"><span class="identifier">let</span></code> allows 1..N local variable
+ declarations (where N == <code class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></code>).
Each declaration follows the form:
</p>
-<pre class="programlisting">
-<span class="identifier">local</span><span class="special">-</span><span class="identifier">id</span> <span class="special">=</span> <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">expression</span>
+<pre class="programlisting"><span class="identifier">local</span><span class="special">-</span><span class="identifier">id</span> <span class="special">=</span> <span class="identifier">lambda</span><span class="special">-</span><span class="identifier">expression</span>
</pre>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
- You can set <tt class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></tt>,
+<tr><td align="left" valign="top"><p>
+ You can set <code class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></code>,
the predefined maximum local variable declarations in a let expression.
- By default, <tt class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></tt>
- is set to <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>.
+ By default, <code class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></code>
+ is set to <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>.
</p></td></tr>
</table></div>
<p>
Example:
</p>
-<pre class="programlisting">
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">123</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">123</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">_a</span> <span class="special">+</span> <span class="identifier">_b</span>
<span class="special">]</span>
</pre>
-<a name="phoenix.composite.scope.reference_preservation"></a><h2>
-<a name="id478463"></a>
- <a href="composite.html#phoenix.composite.scope.reference_preservation">Reference
+<a name="phoenix.composite.scope.reference_preservation"></a><h3>
+<a name="id779579"></a>
+ <a class="link" href="composite.html#phoenix.composite.scope.reference_preservation">Reference
Preservation</a>
- </h2>
+ </h3>
<p>
The type of the local variable assumes the type of the lambda- expression.
Type deduction is reference preserving. For example:
</p>
-<pre class="programlisting">
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="number">456</span><span class="special">)</span>
</pre>
<p>
- <tt class="computeroutput"><span class="identifier">_a</span></tt> assumes the type of <tt class="computeroutput"><span class="identifier">arg1</span></tt>: a reference to an argument, while
- <tt class="computeroutput"><span class="identifier">_b</span></tt> has type <tt class="computeroutput"><span class="keyword">int</span></tt>.
+ <code class="computeroutput"><span class="identifier">_a</span></code> assumes the type of <code class="computeroutput"><span class="identifier">arg1</span></code>: a reference to an argument, while
+ <code class="computeroutput"><span class="identifier">_b</span></code> has type <code class="computeroutput"><span class="keyword">int</span></code>.
</p>
<p>
Consider this:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">)</span>
<span class="special">[</span>
@@ -1256,8 +1202,7 @@
<p>
While with this:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">1</span><span class="special">;</span>
<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">val</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">))</span>
<span class="special">[</span>
@@ -1272,20 +1217,19 @@
</p>
<p>
Reference preservation is necessary because we need to have L-value access
- to outer lambda-scopes (especially the arguments). <tt class="computeroutput"><span class="identifier">arg</span></tt>s
- and <tt class="computeroutput"><span class="identifier">ref</span></tt>s are L-values. <tt class="computeroutput"><span class="identifier">val</span></tt>s are R-values.
+ to outer lambda-scopes (especially the arguments). <code class="computeroutput"><span class="identifier">arg</span></code>s
+ and <code class="computeroutput"><span class="identifier">ref</span></code>s are L-values. <code class="computeroutput"><span class="identifier">val</span></code>s are R-values.
</p>
-<a name="phoenix.composite.scope.visibility"></a><h2>
-<a name="id479015"></a>
- Visibility
- </h2>
+<a name="phoenix.composite.scope.visibility"></a><h3>
+<a name="id780063"></a>
+ <a class="link" href="composite.html#phoenix.composite.scope.visibility">Visibility</a>
+ </h3>
<p>
The scope and lifetimes of the local variables is limited within the let-body.
- <tt class="computeroutput"><span class="identifier">let</span></tt> blocks can be nested.
+ <code class="computeroutput"><span class="identifier">let</span></code> blocks can be nested.
A local variable may hide an outer local variable. For example:
</p>
-<pre class="programlisting">
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_x</span> <span class="special">=</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">_y</span> <span class="special">=</span> <span class="string">", World"</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_x</span> <span class="special">=</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">_y</span> <span class="special">=</span> <span class="string">", World"</span><span class="special">)</span>
<span class="special">[</span>
<span class="comment">// _x here is an int: 1
</span>
@@ -1300,8 +1244,7 @@
refer to any LHS local-id. At this point, the local-ids are not in scope
yet; they will only be in scope in the let-body. The code below is in error:
</p>
-<pre class="programlisting">
-<span class="identifier">let</span><span class="special">(</span>
+<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span>
<span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
<span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Error: _a is not in scope yet
</span><span class="special">)</span>
@@ -1316,8 +1259,7 @@
the let, the RHS of a local-declaration can refer to a local variable of
an outer scope:
</p>
-<pre class="programlisting">
-<span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">let</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">let</span><span class="special">(</span>
<span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
@@ -1328,20 +1270,18 @@
<span class="special">]</span>
<span class="special">]</span>
</pre>
-<a name="phoenix.composite.scope.lambda"></a><h2>
-<a name="id479480"></a>
- lambda
- </h2>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">lambda</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.composite.scope.lambda"></a><h3>
+<a name="id780472"></a>
+ <a class="link" href="composite.html#phoenix.composite.scope.lambda">lambda</a>
+ </h3>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">/</span><span class="identifier">lambda</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
A lot of times, you'd want to write a lazy function that accepts one or more
functions (higher order functions). STL algorithms come to mind, for example.
- Consider a lazy version of <tt class="computeroutput"><span class="identifier">stl</span><span class="special">::</span><span class="identifier">for_each</span></tt>:
+ Consider a lazy version of <code class="computeroutput"><span class="identifier">stl</span><span class="special">::</span><span class="identifier">for_each</span></code>:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">for_each_impl</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">for_each_impl</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">F</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">result</span>
@@ -1359,28 +1299,26 @@
<span class="identifier">function</span><span class="special"><</span><span class="identifier">for_each_impl</span><span class="special">></span> <span class="keyword">const</span> <span class="identifier">for_each</span> <span class="special">=</span> <span class="identifier">for_each_impl</span><span class="special">();</span>
</pre>
<p>
- Notice that the function accepts another function, <tt class="computeroutput"><span class="identifier">f</span></tt>
- as an argument. The scope of this function, <tt class="computeroutput"><span class="identifier">f</span></tt>,
- is limited within the <tt class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></tt>. When <tt class="computeroutput"><span class="identifier">f</span></tt>
- is called inside <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></tt>, it exists in a new scope, along
+ Notice that the function accepts another function, <code class="computeroutput"><span class="identifier">f</span></code>
+ as an argument. The scope of this function, <code class="computeroutput"><span class="identifier">f</span></code>,
+ is limited within the <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>. When <code class="computeroutput"><span class="identifier">f</span></code>
+ is called inside <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>, it exists in a new scope, along
with new arguments and, possibly, local variables. This new scope is not
- at all related to the outer scopes beyond the <tt class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></tt>.
+ at all related to the outer scopes beyond the <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>.
</p>
<p>
Simple syntax:
</p>
-<pre class="programlisting">
-<span class="identifier">lambda</span>
+<pre class="programlisting"><span class="identifier">lambda</span>
<span class="special">[</span>
<span class="identifier">lambda</span><span class="special">-</span><span class="identifier">body</span>
<span class="special">]</span>
</pre>
<p>
- Like <tt class="computeroutput"><span class="identifier">let</span></tt>, local variables
- may be declared, allowing 1..N local variable declarations (where N == <tt class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></tt>):
+ Like <code class="computeroutput"><span class="identifier">let</span></code>, local variables
+ may be declared, allowing 1..N local variable declarations (where N == <code class="computeroutput"><span class="identifier">PHOENIX_LOCAL_LIMIT</span></code>):
</p>
-<pre class="programlisting">
-<span class="identifier">lambda</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">lambda</span><span class="special">(</span><span class="identifier">local</span><span class="special">-</span><span class="identifier">declarations</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">lambda</span><span class="special">-</span><span class="identifier">body</span>
<span class="special">]</span>
@@ -1391,56 +1329,53 @@
to any LHS local-id. The local-ids are not in scope yet; they will be in
scope only in the lambda-body:
</p>
-<pre class="programlisting">
-<span class="identifier">lambda</span><span class="special">(</span>
+<pre class="programlisting"><span class="identifier">lambda</span><span class="special">(</span>
<span class="identifier">_a</span> <span class="special">=</span> <span class="number">1</span>
<span class="special">,</span> <span class="identifier">_b</span> <span class="special">=</span> <span class="identifier">_a</span> <span class="comment">// Error: _a is not in scope yet
</span><span class="special">)</span>
</pre>
<p>
- See <a href="composite.html#phoenix.composite.scope.visibility"><tt class="computeroutput"><span class="identifier">let</span></tt>
+ See <a class="link" href="composite.html#phoenix.composite.scope.visibility"><code class="computeroutput"><span class="identifier">let</span></code>
Visibility</a> above for more information.
</p>
<p>
- Example: Using our lazy <tt class="computeroutput"><span class="identifier">for_each</span></tt>
+ Example: Using our lazy <code class="computeroutput"><span class="identifier">for_each</span></code>
let's print all the elements in a container:
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">lambda</span><span class="special">[</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg1</span><span class="special">])</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">lambda</span><span class="special">[</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg1</span><span class="special">])</span>
</pre>
<p>
As far as the arguments are concerned (arg1..argN), the scope in which the
- lambda-body exists is totally new. The left <tt class="computeroutput"><span class="identifier">arg1</span></tt>
- refers to the argument passed to <tt class="computeroutput"><span class="identifier">for_each</span></tt>
- (a container). The right <tt class="computeroutput"><span class="identifier">arg1</span></tt>
- refers to the argument passed by <tt class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></tt>
- when we finally get to call <tt class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></tt> in our <tt class="computeroutput"><span class="identifier">for_each_impl</span></tt>
+ lambda-body exists is totally new. The left <code class="computeroutput"><span class="identifier">arg1</span></code>
+ refers to the argument passed to <code class="computeroutput"><span class="identifier">for_each</span></code>
+ (a container). The right <code class="computeroutput"><span class="identifier">arg1</span></code>
+ refers to the argument passed by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">for_each</span></code>
+ when we finally get to call <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code> in our <code class="computeroutput"><span class="identifier">for_each_impl</span></code>
above (a container element).
</p>
<p>
Yet, we may wish to get information from outer scopes. While we do not have
access to arguments in outer scopes, what we still have is access to local
variables from outer scopes. We may only be able to pass argument related
- information from outer <tt class="computeroutput"><span class="identifier">lambda</span></tt>
+ information from outer <code class="computeroutput"><span class="identifier">lambda</span></code>
scopes through the local variables.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
- This is a crucial difference between <tt class="computeroutput"><span class="identifier">let</span></tt>
- and <tt class="computeroutput"><span class="identifier">lambda</span></tt>: <tt class="computeroutput"><span class="identifier">let</span></tt> does not introduce new arguments;
- <tt class="computeroutput"><span class="identifier">lambda</span></tt> does.
+<tr><td align="left" valign="top"><p>
+ This is a crucial difference between <code class="computeroutput"><span class="identifier">let</span></code>
+ and <code class="computeroutput"><span class="identifier">lambda</span></code>: <code class="computeroutput"><span class="identifier">let</span></code> does not introduce new arguments;
+ <code class="computeroutput"><span class="identifier">lambda</span></code> does.
</p></td></tr>
</table></div>
<p>
- Another example: Using our lazy <tt class="computeroutput"><span class="identifier">for_each</span></tt>,
- and a lazy <tt class="computeroutput"><span class="identifier">push_back</span></tt>:
+ Another example: Using our lazy <code class="computeroutput"><span class="identifier">for_each</span></code>,
+ and a lazy <code class="computeroutput"><span class="identifier">push_back</span></code>:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">push_back_impl</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">push_back_impl</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">C</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">result</span>
@@ -1460,22 +1395,21 @@
<p>
write a lambda expression that accepts:
</p>
-<div class="orderedlist"><ol type="1">
-<li>
- a 2-dimensional container (e.g. <tt class="computeroutput"><span class="identifier">vector</span><span class="special"><</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span></tt>)
- </li>
-<li>
- a container element (e.g. <tt class="computeroutput"><span class="keyword">int</span></tt>)
- </li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ a 2-dimensional container (e.g. <code class="computeroutput"><span class="identifier">vector</span><span class="special"><</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span></code>)
+ </li>
+<li class="listitem">
+ a container element (e.g. <code class="computeroutput"><span class="keyword">int</span></code>)
+ </li>
</ol></div>
<p>
- and pushes-back the element to each of the <tt class="computeroutput"><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span></tt>.
+ and pushes-back the element to each of the <code class="computeroutput"><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span></code>.
</p>
<p>
Solution:
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
<span class="identifier">lambda</span><span class="special">(</span><span class="identifier">_a</span> <span class="special">=</span> <span class="identifier">arg2</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">push_back</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">_a</span><span class="special">)</span>
@@ -1484,150 +1418,139 @@
</pre>
<p>
Since we do not have access to the arguments of the outer scopes beyond the
- lambda-body, we introduce a local variable <tt class="computeroutput"><span class="identifier">_a</span></tt>
- that captures the second outer argument: <tt class="computeroutput"><span class="identifier">arg2</span></tt>.
+ lambda-body, we introduce a local variable <code class="computeroutput"><span class="identifier">_a</span></code>
+ that captures the second outer argument: <code class="computeroutput"><span class="identifier">arg2</span></code>.
Hence: _a = arg2. This local variable is visible inside the lambda scope.
</p>
<p>
(See lambda.cpp)
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.composite.bind"></a>Bind</h3></div></div></div>
+<a name="phoenix.composite.bind"></a><a class="link" href="composite.html#phoenix.composite.bind" title="Bind">Bind</a>
+</h3></div></div></div>
<p>
<span class="emphasis"><em>Binding</em></span> is the act of tying together a function to some
- arguments for deferred (lazy) evaluation. Named <a href="composite.html#phoenix.composite.function" title="Function">Lazy
+ arguments for deferred (lazy) evaluation. Named <a class="link" href="composite.html#phoenix.composite.function" title="Function">Lazy
functions</a> require a bit of typing. Unlike (unnamed) lambda expressions,
we need to write a functor somewhere offline, detached from the call site.
If you wish to transform a plain function, member function or member variable
- to a lambda expression, <tt class="computeroutput"><span class="identifier">bind</span></tt>
+ to a lambda expression, <code class="computeroutput"><span class="identifier">bind</span></code>
is your friend.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
Take note that binders are monomorphic. Rather than binding functions,
- the preferred way is to write true generic and polymorphic lazy-functions.
+ the preferred way is to write true generic and polymorphic <a class="link" href="composite.html#phoenix.composite.function" title="Function">lazy-functions</a>.
However, since most of the time we are dealing with adaptation of exisiting
code, binders get the job done faster.
</p></td></tr>
</table></div>
<p>
- There is a set of overloaded <tt class="computeroutput"><span class="identifier">bind</span></tt>
- template functions. Each <tt class="computeroutput"><span class="identifier">bind</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></tt>
- function generates a suitable binder object, a composite.
- </p>
-<a name="phoenix.composite.bind.binding_functions"></a><h2>
-<a name="id481353"></a>
- Binding Functions
- </h2>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+ There is a set of overloaded <code class="computeroutput"><span class="identifier">bind</span></code>
+ template functions. Each <code class="computeroutput"><span class="identifier">bind</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
+ function generates a suitable binder object, a <a class="link" href="composite.html" title="Composite">composite</a>.
+ </p>
+<a name="phoenix.composite.bind.binding_functions"></a><h3>
+<a name="id782121"></a>
+ <a class="link" href="composite.html#phoenix.composite.bind.binding_functions">Binding Functions</a>
+ </h3>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- Example, given a function <tt class="computeroutput"><span class="identifier">foo</span></tt>:
+ Example, given a function <code class="computeroutput"><span class="identifier">foo</span></code>:
</p>
-<pre class="programlisting">
-<span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">n</span><span class="special">)</span>
+<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">n</span><span class="special">)</span>
<span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">n</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
<span class="special">}</span>
</pre>
<p>
- Here's how the function <tt class="computeroutput"><span class="identifier">foo</span></tt>
+ Here's how the function <code class="computeroutput"><span class="identifier">foo</span></code>
may be bound:
</p>
-<pre class="programlisting">
-<span class="identifier">bind</span><span class="special">(&</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span>
</pre>
<p>
- This is now a full-fledged composite
+ This is now a full-fledged <a class="link" href="composite.html" title="Composite">composite</a>
that can finally be evaluated by another function call invocation. A second
- function call will invoke the actual <tt class="computeroutput"><span class="identifier">foo</span></tt>
+ function call will invoke the actual <code class="computeroutput"><span class="identifier">foo</span></code>
function. Example:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">4</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">4</span><span class="special">;</span>
<span class="identifier">bind</span><span class="special">(&</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)(</span><span class="identifier">i</span><span class="special">);</span>
</pre>
<p>
will print out "4".
</p>
-<a name="phoenix.composite.bind.binding_member_functions"></a><h2>
-<a name="id481759"></a>
- <a href="composite.html#phoenix.composite.bind.binding_member_functions">Binding Member
+<a name="phoenix.composite.bind.binding_member_functions"></a><h3>
+<a name="id782474"></a>
+ <a class="link" href="composite.html#phoenix.composite.bind.binding_member_functions">Binding Member
Functions</a>
- </h2>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+ </h3>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Binding member functions can be done similarly. A bound member function takes
in a pointer or reference to an object as the first argument. For instance,
given:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">xyz</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">xyz</span>
<span class="special">{</span>
<span class="keyword">void</span> <span class="identifier">foo</span><span class="special">(</span><span class="keyword">int</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="special">};</span>
</pre>
<p>
- <tt class="computeroutput"><span class="identifier">xyz</span></tt>'s <tt class="computeroutput"><span class="identifier">foo</span></tt>
+ <code class="computeroutput"><span class="identifier">xyz</span></code>'s <code class="computeroutput"><span class="identifier">foo</span></code>
member function can be bound as:
</p>
-<pre class="programlisting">
-<span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// obj is an xyz object
+<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// obj is an xyz object
</span></pre>
<p>
Take note that a lazy-member functions expects the first argument to be a
pointer or reference to an object. Both the object (reference or pointer)
and the arguments can be lazily bound. Examples:
</p>
-<pre class="programlisting">
-<span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
+<pre class="programlisting"><span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
<span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// arg1.foo(arg2)
</span><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// obj.foo(arg1)
</span><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">foo</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">,</span> <span class="number">100</span><span class="special">)</span> <span class="comment">// obj.foo(100)
</span></pre>
-<a name="phoenix.composite.bind.binding_member_variables"></a><h2>
-<a name="id482250"></a>
- <a href="composite.html#phoenix.composite.bind.binding_member_variables">Binding Member
+<a name="phoenix.composite.bind.binding_member_variables"></a><h3>
+<a name="id782905"></a>
+ <a class="link" href="composite.html#phoenix.composite.bind.binding_member_variables">Binding Member
Variables</a>
- </h2>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+ </h3>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">/</span><span class="identifier">bind_member_variable</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Member variables can also be bound much like member functions. Member variables
- are not functions. Yet, like the ref(x) that acts like a nullary function
+ are not functions. Yet, like the <a class="link" href="primitives.html#phoenix.primitives.references" title="References"><code class="computeroutput"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code></a> that acts like a nullary function
returning a reference to the data, member variables, when bound, act like
a unary function, taking in a pointer or reference to an object as its argument
and returning a reference to the bound member variable. For instance, given:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">xyz</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">xyz</span>
<span class="special">{</span>
<span class="keyword">int</span> <span class="identifier">v</span><span class="special">;</span>
<span class="special">};</span>
</pre>
<p>
- <tt class="computeroutput"><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span></tt> can be bound as:
+ <code class="computeroutput"><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span></code> can be bound as:
</p>
-<pre class="programlisting">
-<span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">)</span> <span class="comment">// obj is an xyz object
+<pre class="programlisting"><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">)</span> <span class="comment">// obj is an xyz object
</span></pre>
<p>
As noted, just like the bound member function, a bound member variable also
expects the first (and only) argument to be a pointer or reference to an
object. The object (reference or pointer) can be lazily bound. Examples:
</p>
-<pre class="programlisting">
-<span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
+<pre class="programlisting"><span class="identifier">xyz</span> <span class="identifier">obj</span><span class="special">;</span>
<span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// arg1.v
</span><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">obj</span><span class="special">)</span> <span class="comment">// obj.v
</span><span class="identifier">bind</span><span class="special">(&</span><span class="identifier">xyz</span><span class="special">::</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">)(</span><span class="identifier">obj</span><span class="special">)</span> <span class="special">=</span> <span class="number">4</span> <span class="comment">// obj.v = 4
@@ -1636,7 +1559,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -1645,7 +1568,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="primitives.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="container.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="primitives.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="container.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/container.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/container.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Container</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="composite.html" title="Composite">
<link rel="next" href="algorithm.html" title="Algorithm">
</head>
@@ -13,20 +13,20 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="composite.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="composite.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.container"></a>Container</h2></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.container"></a><a class="link" href="container.html" title="Container">Container</a>
+</h2></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
The container module predefines a set of lazy functions that work on STL containers.
@@ -38,104 +38,104 @@
Lazy functions are provided for all of the member functions of the following
containers:
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- deque
- </li>
-<li>
- list
- </li>
-<li>
- map
- </li>
-<li>
- multimap
- </li>
-<li>
- vector
- </li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ deque
+ </li>
+<li class="listitem">
+ list
+ </li>
+<li class="listitem">
+ map
+ </li>
+<li class="listitem">
+ multimap
+ </li>
+<li class="listitem">
+ vector
+ </li>
</ul></div>
<p>
Indeed, should your class have member functions with the same names and signatures
as those listed below, then it will automatically be supported. To summarize,
lazy functions are provided for member functions:
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- assign
- </li>
-<li>
- at
- </li>
-<li>
- back
- </li>
-<li>
- begin
- </li>
-<li>
- capacity
- </li>
-<li>
- clear
- </li>
-<li>
- empty
- </li>
-<li>
- end
- </li>
-<li>
- erase
- </li>
-<li>
- front
- </li>
-<li>
- get_allocator
- </li>
-<li>
- insert
- </li>
-<li>
- key_comp
- </li>
-<li>
- max_size
- </li>
-<li>
- pop_back
- </li>
-<li>
- pop_front
- </li>
-<li>
- push_back
- </li>
-<li>
- push_front
- </li>
-<li>
- rbegin
- </li>
-<li>
- rend
- </li>
-<li>
- reserve
- </li>
-<li>
- resize
- </li>
-<li>
- size
- </li>
-<li>
- splice
- </li>
-<li>
- value_comp
- </li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ assign
+ </li>
+<li class="listitem">
+ at
+ </li>
+<li class="listitem">
+ back
+ </li>
+<li class="listitem">
+ begin
+ </li>
+<li class="listitem">
+ capacity
+ </li>
+<li class="listitem">
+ clear
+ </li>
+<li class="listitem">
+ empty
+ </li>
+<li class="listitem">
+ end
+ </li>
+<li class="listitem">
+ erase
+ </li>
+<li class="listitem">
+ front
+ </li>
+<li class="listitem">
+ get_allocator
+ </li>
+<li class="listitem">
+ insert
+ </li>
+<li class="listitem">
+ key_comp
+ </li>
+<li class="listitem">
+ max_size
+ </li>
+<li class="listitem">
+ pop_back
+ </li>
+<li class="listitem">
+ pop_front
+ </li>
+<li class="listitem">
+ push_back
+ </li>
+<li class="listitem">
+ push_front
+ </li>
+<li class="listitem">
+ rbegin
+ </li>
+<li class="listitem">
+ rend
+ </li>
+<li class="listitem">
+ reserve
+ </li>
+<li class="listitem">
+ resize
+ </li>
+<li class="listitem">
+ size
+ </li>
+<li class="listitem">
+ splice
+ </li>
+<li class="listitem">
+ value_comp
+ </li>
</ul></div>
<p>
The lazy functions' names are the same as the corresponding member function.
@@ -143,417 +143,423 @@
does not use the member "dot" syntax.
</p>
<div class="table">
-<a name="id482988"></a><p class="title"><b>Table 1.5. Sample usage</b></p>
-<table class="table" summary="Sample usage">
+<a name="id783648"></a><p class="title"><b>Table 1.5. Sample usage</b></p>
+<div class="table-contents"><table class="table" summary="Sample usage">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- "Normal" version
- </p>
- </th>
+ <p>
+ "Normal" version
+ </p>
+ </th>
<th>
- <p>
- "Lazy" version
- </p>
- </th>
+ <p>
+ "Lazy" version
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">my_vector</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="number">5</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">my_vector</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="number">5</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">5</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
+ <span class="number">5</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">my_list</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">my_list</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">my_vector1</span><span class="special">.</span><span class="identifier">swap</span><span class="special">(</span><span class="identifier">my_vector2</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">my_vector1</span><span class="special">.</span><span class="identifier">swap</span><span class="special">(</span><span class="identifier">my_vector2</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">swap</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">swap</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span>
+ <span class="identifier">arg2</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<p>
+<br class="table-break"><p>
Notice that member functions with names that clash with stl algorithms are
absent. This will be provided in Phoenix's algorithm module.
</p>
<p>
- No support is provided here for lazy versions of <tt class="computeroutput"><span class="keyword">operator</span><span class="special">+=</span></tt>, <tt class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></tt> etc. Such operators are not specific to STL
- containers and lazy versions can therefore be found in operators.
+ No support is provided here for lazy versions of <code class="computeroutput"><span class="keyword">operator</span><span class="special">+=</span></code>, <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> etc. Such operators are not specific to STL
+ containers and lazy versions can therefore be found in <a class="link" href="composite.html#phoenix.composite.operator" title="Operator">operators</a>.
</p>
<p>
The following table describes the container functions and their semantics.
</p>
-<div class="sidebar"><p>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
<span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Arguments in brackets denote optional parameters.
- </p></div>
+ </p>
+</div>
<div class="table">
-<a name="id483365"></a><p class="title"><b>Table 1.6. Lazy STL Container Functions</b></p>
-<table class="table" summary="Lazy STL Container Functions">
+<a name="id783986"></a><p class="title"><b>Table 1.6. Lazy STL Container Functions</b></p>
+<div class="table-contents"><table class="table" summary="Lazy STL Container Functions">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Function
- </p>
- </th>
+ <p>
+ Function
+ </p>
+ </th>
<th>
- <p>
- Semantics
- </p>
- </th>
+ <p>
+ Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">assign</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">assign</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">assign</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">assign</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">at</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">at</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">back</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">back</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">begin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">capacity</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">capacity</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">capacity</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">clear</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">clear</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">clear</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">clear</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">empty</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">empty</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">end</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">erase</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">erase</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">front</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">front</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">get_allocator</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">get_allocator</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">get_allocator</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">get_allocator</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">insert</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">insert</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">insert</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">key_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">key_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">key_comp</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">key_comp</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">max_size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">max_size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">max_size</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">max_size</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">pop_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pop_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_back</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_back</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">push_front</span><span class="special">(</span><span class="identifier">d</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">pop_front</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">pop_front</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">rbegin</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rbegin</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rbegin</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">rend</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rend</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">rend</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">n</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">n</span><span class="special">)</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">resize</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">resize</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">resize</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">resize</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">size</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">size</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">splice</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">splice</span><span class="special">(</span><span class="identifier">c</span><span class="special">,</span> <span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">])</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">splice</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">])</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">splice</span><span class="special">(</span><span class="identifier">a</span><span class="special">[,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">])</span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">value_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">value_comp</span><span class="special">(</span><span class="identifier">c</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">value_comp</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">c</span><span class="special">.</span><span class="identifier">value_comp</span><span class="special">()</span></code>
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
+<br class="table-break">
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -562,7 +568,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="composite.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="composite.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/inside_phoenix.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/inside_phoenix.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Inside Phoenix</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="algorithm.html" title="Algorithm">
<link rel="next" href="wrap_up.html" title="Wrap Up">
</head>
@@ -13,18 +13,19 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="wrap_up.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="wrap_up.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.inside_phoenix"></a>Inside Phoenix</h2></div></div></div>
+<a name="phoenix.inside_phoenix"></a><a class="link" href="inside_phoenix.html" title="Inside Phoenix">Inside Phoenix</a>
+</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section">Actors In Detail</span></dt>
<dt><span class="section">Actor Example</span></dt>
@@ -39,40 +40,40 @@
the library. However, a microscopic view might prove to be beneficial to moderate
to advanced programmers who wish to extend the library.
</p>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside_phoenix.actors_in_detail"></a>Actors In Detail</h3></div></div></div>
-<a name="phoenix.inside_phoenix.actors_in_detail.actor_concept"></a><h3>
-<a name="id495846"></a>
- <a href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.actor_concept">Actor
+<a name="phoenix.inside_phoenix.actors_in_detail"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail" title="Actors In Detail">Actors In Detail</a>
+</h3></div></div></div>
+<a name="phoenix.inside_phoenix.actors_in_detail.actor_concept"></a><h4>
+<a name="id795342"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.actor_concept">Actor
Concept</a>
- </h3>
+ </h4>
<p>
- The main concept is the <tt class="computeroutput"><span class="identifier">Actor</span></tt>.
+ The main concept is the <code class="computeroutput"><span class="identifier">Actor</span></code>.
Actors are function objects (that can accept 0 to N arguments (where N is
a predefined maximum).
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
- You can set <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>,
- the predefined maximum arity an actor can take. By default, <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt> is set to 10.
+<tr><td align="left" valign="top"><p>
+ You can set <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>,
+ the predefined maximum arity an actor can take. By default, <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code> is set to 10.
</p></td></tr>
</table></div>
-<a name="phoenix.inside_phoenix.actors_in_detail.actor_template_class"></a><h3>
-<a name="id495923"></a>
- <a href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.actor_template_class">actor
+<a name="phoenix.inside_phoenix.actors_in_detail.actor_template_class"></a><h4>
+<a name="id795408"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.actor_template_class">actor
template class</a>
- </h3>
+ </h4>
<p>
- The <tt class="computeroutput"><span class="identifier">actor</span></tt> template class
- models the <tt class="computeroutput"><span class="identifier">Actor</span></tt> concept:
+ The <code class="computeroutput"><span class="identifier">actor</span></code> template class
+ models the <code class="computeroutput"><span class="identifier">Actor</span></code> concept:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Eval</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Eval</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">actor</span> <span class="special">:</span> <span class="identifier">Eval</span>
<span class="special">{</span>
<span class="keyword">typedef</span> <span class="identifier">Eval</span> <span class="identifier">eval_type</span><span class="special">;</span>
@@ -103,167 +104,171 @@
</span><span class="special">};</span>
</pre>
<div class="table">
-<a name="id496708"></a><p class="title"><b>Table 1.10. Actor Concept Requirements</b></p>
-<table class="table" summary="Actor Concept Requirements">
+<a name="id796097"></a><p class="title"><b>Table 1.10. Actor Concept Requirements</b></p>
+<div class="table-contents"><table class="table" summary="Actor Concept Requirements">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Expression
- </p>
- </th>
+ <p>
+ Expression
+ </p>
+ </th>
<th>
- <p>
- Result/Semantics
- </p>
- </th>
+ <p>
+ Result/Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">eval_type</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">eval_type</span></code>
+ </p>
+ </td>
<td>
- <p>
- The actor's Eval type
- </p>
- </td>
+ <p>
+ The actor's Eval type
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">()</span></code>
+ </p>
+ </td>
<td>
- <p>
- Default Constructor
- </p>
- </td>
+ <p>
+ Default Constructor
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">(</span><span class="identifier">base</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">(</span><span class="identifier">base</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- Constructor from Eval
- </p>
- </td>
+ <p>
+ Constructor from Eval
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">(</span><span class="identifier">arg0</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">argN</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">(</span><span class="identifier">arg0</span><span class="special">,</span>
+ <span class="identifier">arg1</span><span class="special">,</span>
+ <span class="special">...,</span> <span class="identifier">argN</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- Pass through constructors
- </p>
- </td>
+ <p>
+ Pass through constructors
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">x</span><span class="special">(</span><span class="identifier">arg0</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">argN</span><span class="special">)</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">x</span><span class="special">(</span><span class="identifier">arg0</span><span class="special">,</span>
+ <span class="identifier">arg1</span><span class="special">,</span>
+ <span class="special">...,</span> <span class="identifier">argN</span><span class="special">)</span></code>
+ </p>
+ </td>
<td>
- <p>
- Function call operators
- </p>
- </td>
+ <p>
+ Function call operators
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<a name="phoenix.inside_phoenix.actors_in_detail.eval_concept"></a><h3>
-<a name="id497020"></a>
- <a href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept">Eval
+<br class="table-break"><a name="phoenix.inside_phoenix.actors_in_detail.eval_concept"></a><h4>
+<a name="id796380"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept">Eval
Concept</a>
- </h3>
+ </h4>
<p>
- The <tt class="computeroutput"><span class="identifier">actor</span></tt> template class
- has a single template parameter, <tt class="computeroutput"><span class="identifier">Eval</span></tt>,
- from which it derives from. While the <tt class="computeroutput"><span class="identifier">Actor</span></tt>
- concept represents a function, the <tt class="computeroutput"><span class="identifier">Eval</span></tt>
- concept represents the function body. The requirements for <tt class="computeroutput"><span class="identifier">Eval</span></tt> are intentionally kept simple, to
+ The <code class="computeroutput"><span class="identifier">actor</span></code> template class
+ has a single template parameter, <code class="computeroutput"><span class="identifier">Eval</span></code>,
+ from which it derives from. While the <code class="computeroutput"><span class="identifier">Actor</span></code>
+ concept represents a function, the <code class="computeroutput"><span class="identifier">Eval</span></code>
+ concept represents the function body. The requirements for <code class="computeroutput"><span class="identifier">Eval</span></code> are intentionally kept simple, to
make it easy to write models of the concept. We shall see an example in the
- next section.
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actor_example" title="Actor Example">next section</a>.
</p>
<div class="table">
-<a name="id497115"></a><p class="title"><b>Table 1.11. Eval Concept Requirements</b></p>
-<table class="table" summary="Eval Concept Requirements">
+<a name="id796466"></a><p class="title"><b>Table 1.11. Eval Concept Requirements</b></p>
+<div class="table-contents"><table class="table" summary="Eval Concept Requirements">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Expression
- </p>
- </th>
+ <p>
+ Expression
+ </p>
+ </th>
<th>
- <p>
- Result/Semantics
- </p>
- </th>
+ <p>
+ Result/Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">env</span><span class="special">)</span></tt>
- </p>
- </td>
-<td>
- <p>
- Evaluates the function (see Environment below)
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">env</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Evaluates the function (see Environment below)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">result</span><span class="special"><</span><span class="identifier">Env</span><span class="special">>::</span><span class="identifier">type</span></tt>
- </p>
- </td>
-<td>
- <p>
- The return type of eval (see Environment below)
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">result</span><span class="special"><</span><span class="identifier">Env</span><span class="special">>::</span><span class="identifier">type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The return type of eval (see Environment below)
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<a name="phoenix.inside_phoenix.actors_in_detail.constructors"></a><h3>
-<a name="id497287"></a>
- Constructors
- </h3>
+<br class="table-break"><a name="phoenix.inside_phoenix.actors_in_detail.constructors"></a><h4>
+<a name="id796619"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.constructors">Constructors</a>
+ </h4>
<p>
In addition to a default constructor and an constructor from a Eval object,
there are templated (pass through) constructors for 1 to N arguments (N ==
- <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>). These constructors
- simply forward the arguments to the <tt class="computeroutput"><span class="identifier">base</span></tt>.
+ <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>). These constructors
+ simply forward the arguments to the <code class="computeroutput"><span class="identifier">base</span></code>.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top">
+<tr><td align="left" valign="top">
<p>
- <span class="bold"><b>Parametric Base Class Pattern</b></span>
+ <span class="bold"><strong>Parametric Base Class Pattern</strong></span>
</p>
<p>
Notice that actor derives from its template argument Eval. This is the
@@ -277,172 +282,168 @@
</p>
</td></tr>
</table></div>
-<a name="phoenix.inside_phoenix.actors_in_detail.function_call_operators"></a><h3>
-<a name="id497372"></a>
- <a href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.function_call_operators">Function
+<a name="phoenix.inside_phoenix.actors_in_detail.function_call_operators"></a><h4>
+<a name="id796684"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.function_call_operators">Function
Call Operators</a>
- </h3>
+ </h4>
<p>
- There are N function call operators for 0 to N arguments (N == <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>). The actor class accepts
- the arguments and forwards the arguments to the actor's base <tt class="computeroutput"><span class="identifier">Eval</span></tt> for evaluation.
+ There are N function call operators for 0 to N arguments (N == <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>). The actor class accepts
+ the arguments and forwards the arguments to the actor's base <code class="computeroutput"><span class="identifier">Eval</span></code> for evaluation.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top">
+<tr><td align="left" valign="top">
<p>
- <span class="bold"><b>Forwarding Function Problem</b></span>
+ <span class="bold"><strong>Forwarding Function Problem</strong></span>
</p>
<p>
The function call operators cannot accept non-const temporaries and literal
constants. There is a known issue with current C++ called the "<a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
Function Problem</a>". The problem is that given an arbitrary
- function <tt class="computeroutput"><span class="identifier">F</span></tt>, using current
- C++ language rules, one cannot create a forwarding function <tt class="computeroutput"><span class="identifier">FF</span></tt> that transparently assumes the arguments
- of <tt class="computeroutput"><span class="identifier">F</span></tt>. Disallowing non-const
+ function <code class="computeroutput"><span class="identifier">F</span></code>, using current
+ C++ language rules, one cannot create a forwarding function <code class="computeroutput"><span class="identifier">FF</span></code> that transparently assumes the arguments
+ of <code class="computeroutput"><span class="identifier">F</span></code>. Disallowing non-const
rvalues arguments partially solves the problem but prohibits code such
- as <tt class="computeroutput"><span class="identifier">f</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">);</span></tt>.
+ as <code class="computeroutput"><span class="identifier">f</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">);</span></code>.
</p>
</td></tr>
</table></div>
-<a name="phoenix.inside_phoenix.actors_in_detail.environment"></a><h3>
-<a name="id497544"></a>
- Environment
- </h3>
-<p>
- On an actor function call, before calling the actor's <tt class="computeroutput"><span class="identifier">Eval</span><span class="special">::</span><span class="identifier">eval</span></tt>
- for evaluation, the actor creates an <span class="emphasis"><em><span class="bold"><b>environment</b></span></em></span>.
- Basically, the environment packages the arguments in a tuple. The <tt class="computeroutput"><span class="identifier">Environment</span></tt> is a concept, of which, the
- <tt class="computeroutput"><span class="identifier">basic_environment</span></tt> template
+<a name="phoenix.inside_phoenix.actors_in_detail.environment"></a><h4>
+<a name="id796836"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.environment">Environment</a>
+ </h4>
+<p>
+ On an actor function call, before calling the actor's <code class="computeroutput"><span class="identifier">Eval</span><span class="special">::</span><span class="identifier">eval</span></code>
+ for evaluation, the actor creates an <span class="emphasis"><em><span class="bold"><strong>environment</strong></span></em></span>.
+ Basically, the environment packages the arguments in a tuple. The <code class="computeroutput"><span class="identifier">Environment</span></code> is a concept, of which, the
+ <code class="computeroutput"><span class="identifier">basic_environment</span></code> template
class is a model of.
</p>
<div class="table">
-<a name="id497623"></a><p class="title"><b>Table 1.12. Environment Concept Requirements</b></p>
-<table class="table" summary="Environment Concept Requirements">
+<a name="id796904"></a><p class="title"><b>Table 1.12. Environment Concept Requirements</b></p>
+<div class="table-contents"><table class="table" summary="Environment Concept Requirements">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Expression
- </p>
- </th>
+ <p>
+ Expression
+ </p>
+ </th>
<th>
- <p>
- Result/Semantics
- </p>
- </th>
+ <p>
+ Result/Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">args</span><span class="special">()</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">args</span><span class="special">()</span></code>
+ </p>
+ </td>
<td>
- <p>
- The arguments in a tie (a tuple of references)
- </p>
- </td>
+ <p>
+ The arguments in a tie (a tuple of references)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">args_type</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">args_type</span></code>
+ </p>
+ </td>
<td>
- <p>
- The arguments' types in an MPL sequence
- </p>
- </td>
+ <p>
+ The arguments' types in an MPL sequence
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">tie_type</span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">tie_type</span></code>
+ </p>
+ </td>
<td>
- <p>
- The tie (tuple of references) type
- </p>
- </td>
+ <p>
+ The tie (tuple of references) type
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<p>
+<br class="table-break"><p>
Schematically:
</p>
<p>
<span class="inlinemediaobject"><img src="../images/funnel_in.png" alt="funnel_in"></span>
</p>
<p>
- Other parts of the library (e.g. the scope module) extends the <tt class="computeroutput"><span class="identifier">Environment</span></tt> concept to hold other information
+ Other parts of the library (e.g. the scope module) extends the <code class="computeroutput"><span class="identifier">Environment</span></code> concept to hold other information
such as local variables, etc.
</p>
-<a name="phoenix.inside_phoenix.actors_in_detail.apply_actor"></a><h3>
-<a name="id497839"></a>
- apply_actor
- </h3>
+<a name="phoenix.inside_phoenix.actors_in_detail.apply_actor"></a><h4>
+<a name="id797100"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.apply_actor">apply_actor</a>
+ </h4>
<p>
- <tt class="computeroutput"><span class="identifier">apply_actor</span></tt> is a standard
- MPL style metafunction that simply calls the Action's <tt class="computeroutput"><span class="identifier">result</span></tt>
+ <code class="computeroutput"><span class="identifier">apply_actor</span></code> is a standard
+ MPL style metafunction that simply calls the Action's <code class="computeroutput"><span class="identifier">result</span></code>
nested metafunction:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Action</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Action</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">apply_actor</span>
<span class="special">{</span>
<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">Action</span><span class="special">::</span><span class="keyword">template</span> <span class="identifier">result</span><span class="special"><</span><span class="identifier">Env</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">type</span><span class="special">;</span>
<span class="special">};</span>
</pre>
<p>
- After evaluating the arguments and doing some computation, the <tt class="computeroutput"><span class="identifier">eval</span></tt> member function returns something
- back to the client. To do this, the forwarding function (the actor's <tt class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></tt>)
+ After evaluating the arguments and doing some computation, the <code class="computeroutput"><span class="identifier">eval</span></code> member function returns something
+ back to the client. To do this, the forwarding function (the actor's <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>)
needs to know the return type of the eval member function that it is calling.
- For this purpose, models of <tt class="computeroutput"><span class="identifier">Eval</span></tt>
+ For this purpose, models of <code class="computeroutput"><span class="identifier">Eval</span></code>
are required to provide a nested template class:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">result</span><span class="special">;</span>
</pre>
<p>
- This nested class provides the result type information returned by the <tt class="computeroutput"><span class="identifier">Eval</span></tt>'s <tt class="computeroutput"><span class="identifier">eval</span></tt>
- member function. The nested template class <tt class="computeroutput"><span class="identifier">result</span></tt>
- should have a typedef <tt class="computeroutput"><span class="identifier">type</span></tt>
- that reflects the return type of its member function <tt class="computeroutput"><span class="identifier">eval</span></tt>.
+ This nested class provides the result type information returned by the <code class="computeroutput"><span class="identifier">Eval</span></code>'s <code class="computeroutput"><span class="identifier">eval</span></code>
+ member function. The nested template class <code class="computeroutput"><span class="identifier">result</span></code>
+ should have a typedef <code class="computeroutput"><span class="identifier">type</span></code>
+ that reflects the return type of its member function <code class="computeroutput"><span class="identifier">eval</span></code>.
</p>
<p>
- For reference, here's a typical <tt class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></tt> that accepts two arguments:
+ For reference, here's a typical <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code> that accepts two arguments:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">apply_actor</span><span class="special"><</span><span class="identifier">eval_type</span><span class="special">,</span> <span class="identifier">basic_environment</span><span class="special"><</span><span class="identifier">T0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">></span> <span class="special">>::</span><span class="identifier">type</span>
<span class="keyword">operator</span><span class="special">()(</span><span class="identifier">T0</span><span class="special">&</span> <span class="identifier">_0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">&</span> <span class="identifier">_1</span><span class="special">)</span> <span class="keyword">const</span>
<span class="special">{</span>
<span class="keyword">return</span> <span class="identifier">eval_type</span><span class="special">::</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">basic_environment</span><span class="special"><</span><span class="identifier">T0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">>(</span><span class="identifier">_0</span><span class="special">,</span> <span class="identifier">_1</span><span class="special">));</span>
<span class="special">}</span>
</pre>
-<a name="phoenix.inside_phoenix.actors_in_detail.actor_result"></a><h3>
-<a name="id498520"></a>
- actor_result
- </h3>
+<a name="phoenix.inside_phoenix.actors_in_detail.actor_result"></a><h4>
+<a name="id797697"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.actor_result">actor_result</a>
+ </h4>
<p>
- For reasons of symmetry to the family of <tt class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></tt> there is a special metafunction usable
- for actor result type calculation named <tt class="computeroutput"><span class="identifier">actor_result</span></tt>.
+ For reasons of symmetry to the family of <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code> there is a special metafunction usable
+ for actor result type calculation named <code class="computeroutput"><span class="identifier">actor_result</span></code>.
This metafunction allows us to directly to specify the types of the parameters
- to be passed to the <tt class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></tt> function. Here's a typical <tt class="computeroutput"><span class="identifier">actor_result</span></tt> that accepts two arguments:
+ to be passed to the <code class="computeroutput"><span class="identifier">actor</span><span class="special">::</span><span class="keyword">operator</span><span class="special">()</span></code> function. Here's a typical <code class="computeroutput"><span class="identifier">actor_result</span></code> that accepts two arguments:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Action</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Action</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T0</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">T1</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">actor_result</span>
<span class="special">{</span>
<span class="keyword">typedef</span> <span class="identifier">basic_environment</span><span class="special"><</span><span class="identifier">T0</span><span class="special">,</span> <span class="identifier">T1</span><span class="special">></span> <span class="identifier">env_type</span><span class="special">;</span>
@@ -450,19 +451,19 @@
<span class="special">};</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside_phoenix.actor_example"></a>Actor Example</h3></div></div></div>
+<a name="phoenix.inside_phoenix.actor_example"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actor_example" title="Actor Example">Actor Example</a>
+</h3></div></div></div>
<p>
Let us see a very simple prototypical example of an actor. This is not a
- toy example. This is actually part of the library. Remember the reference?.
+ toy example. This is actually part of the library. Remember the <a class="link" href="primitives.html#phoenix.primitives.references" title="References"><code class="computeroutput"><span class="identifier">reference</span></code></a>?.
</p>
<p>
- First, we have a model of the <tt class="computeroutput"><span class="identifier">Eval</span></tt>
- concept: the <tt class="computeroutput"><span class="identifier">reference</span></tt>:
+ First, we have a model of the <code class="computeroutput"><span class="identifier">Eval</span></code>
+ concept: the <code class="computeroutput"><span class="identifier">reference</span></code>:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">reference</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">></span>
@@ -484,14 +485,13 @@
<span class="special">};</span>
</pre>
<p>
- Models of <tt class="computeroutput"><span class="identifier">Eval</span></tt> are never
+ Models of <code class="computeroutput"><span class="identifier">Eval</span></code> are never
created directly and its instances never exist alone. We have to wrap it
- inside the <tt class="computeroutput"><span class="identifier">actor</span></tt> template
- class to be useful. The <tt class="computeroutput"><span class="identifier">ref</span></tt>
+ inside the <code class="computeroutput"><span class="identifier">actor</span></code> template
+ class to be useful. The <code class="computeroutput"><span class="identifier">ref</span></code>
template function does this for us:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
<span class="identifier">actor</span><span class="special"><</span><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span>
<span class="identifier">ref</span><span class="special">(</span><span class="identifier">T</span><span class="special">&</span> <span class="identifier">v</span><span class="special">)</span>
<span class="special">{</span>
@@ -499,69 +499,68 @@
<span class="special">}</span>
</pre>
<p>
- The <tt class="computeroutput"><span class="identifier">reference</span></tt> template class
- conforms to the Eval concept. It has a nested <tt class="computeroutput"><span class="identifier">result</span></tt> metafunction that reflects the return
- type of its <tt class="computeroutput"><span class="identifier">eval</span></tt> member function,
- which peforms the actual function. <tt class="computeroutput"><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></tt>
- stores a reference to a <tt class="computeroutput"><span class="identifier">T</span></tt>.
- Its <tt class="computeroutput"><span class="identifier">eval</span></tt> member function
- simply returns the reference. It does not make use of the environment <tt class="computeroutput"><span class="identifier">Env</span></tt>.
+ The <code class="computeroutput"><span class="identifier">reference</span></code> template class
+ conforms to the <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a> concept. It has a nested <code class="computeroutput"><span class="identifier">result</span></code> metafunction that reflects the return
+ type of its <code class="computeroutput"><span class="identifier">eval</span></code> member function,
+ which peforms the actual function. <code class="computeroutput"><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code>
+ stores a reference to a <code class="computeroutput"><span class="identifier">T</span></code>.
+ Its <code class="computeroutput"><span class="identifier">eval</span></code> member function
+ simply returns the reference. It does not make use of the environment <code class="computeroutput"><span class="identifier">Env</span></code>.
</p>
<p>
<span class="emphasis"><em>Pretty simple...</em></span>
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside_phoenix.composites_in_detail"></a><a href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail" title="Composites
- In Detail">Composites
- In Detail</a></h3></div></div></div>
+<a name="phoenix.inside_phoenix.composites_in_detail"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail" title="Composites In Detail">Composites
+ In Detail</a>
+</h3></div></div></div>
<p>
We stated before that composites are actors that are composed of zero or
- more actors (see Composite). This
+ more actors (see <a class="link" href="composite.html" title="Composite">Composite</a>). This
is not quite accurate. The definition was sufficient at that point where
we opted to keep things simple and not bury the reader with details which
she might not need anyway.
</p>
<p>
- Actually, a composite is a model of the Eval concept (more on this later).
+ Actually, a composite is a model of the <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a> concept (more on this later).
At the same time, it is also composed of 0..N (where N is a predefined maximum)
- Eval instances and an eval policy.
- The individual Eval instances are stored in a tuple.
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a> instances and an eval policy.
+ The individual <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a> instances are stored in a tuple.
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
In a sense, the original definition of "composite", more or less,
- will do just fine because Eval instances never exist alone
- and are always wrapped in an <tt class="computeroutput"><span class="identifier">actor</span></tt>
+ will do just fine because <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a> instances never exist alone
+ and are always wrapped in an <code class="computeroutput"><span class="identifier">actor</span></code>
template class which inherits from it anyway. The resulting actor IS-AN
- Eval.
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a>.
</p></td></tr>
</table></div>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
- You can set <tt class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></tt>,
- the predefined maximum <tt class="computeroutput"><span class="identifier">Eval</span></tt>s
- (actors) a composite can take. By default, <tt class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></tt>
- is set to <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>
- (See Actors).
+<tr><td align="left" valign="top"><p>
+ You can set <code class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></code>,
+ the predefined maximum <code class="computeroutput"><span class="identifier">Eval</span></code>s
+ (actors) a composite can take. By default, <code class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></code>
+ is set to <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>
+ (See <a class="link" href="actors.html" title="Actors">Actors</a>).
</p></td></tr>
</table></div>
-<a name="phoenix.inside_phoenix.composites_in_detail.composite_template_class"></a><h2>
-<a name="id499816"></a>
- <a href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.composite_template_class">composite
+<a name="phoenix.inside_phoenix.composites_in_detail.composite_template_class"></a><h3>
+<a name="id798837"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.composite_template_class">composite
template class</a>
- </h2>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">EvalPolicy</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">EvalTuple</span><span class="special">></span>
+ </h3>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">EvalPolicy</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">EvalTuple</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">composite</span> <span class="special">:</span> <span class="identifier">EvalTuple</span>
<span class="special">{</span>
<span class="keyword">typedef</span> <span class="identifier">EvalTuple</span> <span class="identifier">base_type</span><span class="special">;</span>
@@ -589,27 +588,27 @@
<span class="identifier">eval</span><span class="special">(</span><span class="identifier">Env</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">env</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="special">};</span>
</pre>
-<a name="phoenix.inside_phoenix.composites_in_detail.evaltuple"></a><h2>
-<a name="id500422"></a>
- EvalTuple
- </h2>
-<p>
- <tt class="computeroutput"><span class="identifier">EvalTuple</span></tt>, holds all the
- Eval instances. The <tt class="computeroutput"><span class="identifier">composite</span></tt> template class inherits from
- it. In addition to a default constructor and a constructor from an <tt class="computeroutput"><span class="identifier">EvalTuple</span></tt> object, there are templated (pass
- through) constructors for 1 to N arguments (again, where N == <tt class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></tt>). These constructors
- simply forward the arguments to the <tt class="computeroutput"><span class="identifier">EvalTuple</span></tt>
+<a name="phoenix.inside_phoenix.composites_in_detail.evaltuple"></a><h3>
+<a name="id799366"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.evaltuple">EvalTuple</a>
+ </h3>
+<p>
+ <code class="computeroutput"><span class="identifier">EvalTuple</span></code>, holds all the
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a> instances. The <code class="computeroutput"><span class="identifier">composite</span></code> template class inherits from
+ it. In addition to a default constructor and a constructor from an <code class="computeroutput"><span class="identifier">EvalTuple</span></code> object, there are templated (pass
+ through) constructors for 1 to N arguments (again, where N == <code class="computeroutput"><span class="identifier">PHOENIX_COMPOSITE_LIMIT</span></code>). These constructors
+ simply forward the arguments to the <code class="computeroutput"><span class="identifier">EvalTuple</span></code>
base class.
</p>
-<a name="phoenix.inside_phoenix.composites_in_detail.evalpolicy"></a><h2>
-<a name="id500533"></a>
- EvalPolicy
- </h2>
-<p>
- The composite's <tt class="computeroutput"><span class="identifier">eval</span></tt> member
- function calls its <tt class="computeroutput"><span class="identifier">EvalPolicy</span></tt>'s
- <tt class="computeroutput"><span class="identifier">eval</span></tt> member function (a static
- member function) passing in the environment
+<a name="phoenix.inside_phoenix.composites_in_detail.evalpolicy"></a><h3>
+<a name="id799463"></a>
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.evalpolicy">EvalPolicy</a>
+ </h3>
+<p>
+ The composite's <code class="computeroutput"><span class="identifier">eval</span></code> member
+ function calls its <code class="computeroutput"><span class="identifier">EvalPolicy</span></code>'s
+ <code class="computeroutput"><span class="identifier">eval</span></code> member function (a static
+ member function) passing in the <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.environment">environment</a>
and each of its actors, in parallel. The following diagram illustrates what's
happening:
</p>
@@ -617,67 +616,68 @@
<span class="inlinemediaobject"><img src="../images/funnel_out.png" alt="funnel_out"></span>
</p>
<div class="table">
-<a name="id500623"></a><p class="title"><b>Table 1.13. EvalPolicy Requirements</b></p>
-<table class="table" summary="EvalPolicy Requirements">
+<a name="id799542"></a><p class="title"><b>Table 1.13. EvalPolicy Requirements</b></p>
+<div class="table-contents"><table class="table" summary="EvalPolicy Requirements">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Expression
- </p>
- </th>
+ <p>
+ Expression
+ </p>
+ </th>
<th>
- <p>
- Result/Semantics
- </p>
- </th>
+ <p>
+ Result/Semantics
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">eval</span><span class="special"><</span><span class="identifier">RT</span><span class="special">>(</span><span class="identifier">env</span><span class="special">,</span> <span class="identifier">eval0</span><span class="special">,</span>
- <span class="identifier">eval1</span><span class="special">,</span>
- <span class="special">...,</span> <span class="identifier">evalN</span><span class="special">)</span></tt>
- </p>
- </td>
-<td>
- <p>
- Evaluate the composite
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">x</span><span class="special">.</span><span class="identifier">eval</span><span class="special"><</span><span class="identifier">RT</span><span class="special">>(</span><span class="identifier">env</span><span class="special">,</span>
+ <span class="identifier">eval0</span><span class="special">,</span>
+ <span class="identifier">eval1</span><span class="special">,</span>
+ <span class="special">...,</span> <span class="identifier">evalN</span><span class="special">)</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ Evaluate the composite
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <tt class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">result</span><span class="special"><</span><span class="identifier">Env</span><span class="special">,</span> <span class="identifier">Eval0</span><span class="special">,</span>
- <span class="identifier">Eval1</span><span class="special">,</span>
- <span class="identifier">Eval2</span><span class="special">,</span>
- <span class="special">...,</span> <span class="identifier">EvalN</span><span class="special">>::</span><span class="identifier">type</span></tt>
- </p>
- </td>
-<td>
- <p>
- The return type of eval
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="identifier">T</span><span class="special">::</span><span class="identifier">result</span><span class="special"><</span><span class="identifier">Env</span><span class="special">,</span>
+ <span class="identifier">Eval0</span><span class="special">,</span>
+ <span class="identifier">Eval1</span><span class="special">,</span>
+ <span class="identifier">Eval2</span><span class="special">,</span>
+ <span class="special">...,</span> <span class="identifier">EvalN</span><span class="special">>::</span><span class="identifier">type</span></code>
+ </p>
+ </td>
+<td>
+ <p>
+ The return type of eval
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<p>
- The <tt class="computeroutput"><span class="identifier">EvalPolicy</span></tt> is expected
- to have a nested template class <tt class="computeroutput"><span class="identifier">result</span></tt>
- which has a typedef <tt class="computeroutput"><span class="identifier">type</span></tt>
- that reflects the return type of its member function <tt class="computeroutput"><span class="identifier">eval</span></tt>.
+<br class="table-break"><p>
+ The <code class="computeroutput"><span class="identifier">EvalPolicy</span></code> is expected
+ to have a nested template class <code class="computeroutput"><span class="identifier">result</span></code>
+ which has a typedef <code class="computeroutput"><span class="identifier">type</span></code>
+ that reflects the return type of its member function <code class="computeroutput"><span class="identifier">eval</span></code>.
Here's a typical example of the composite's eval member function for a 2-actor
composite:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">result</span><span class="special"><</span><span class="identifier">Env</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">eval</span><span class="special">(</span><span class="identifier">Env</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">env</span><span class="special">)</span> <span class="keyword">const</span>
<span class="special">{</span>
@@ -690,9 +690,10 @@
</span><span class="special">}</span>
</pre>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside_phoenix.composing"></a>Composing</h3></div></div></div>
+<a name="phoenix.inside_phoenix.composing"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composing" title="Composing">Composing</a>
+</h3></div></div></div>
<div class="toc"><dl>
<dt><span class="section">compose</span></dt>
<dt><span class="section">as_composite</span></dt>
@@ -704,73 +705,68 @@
are used to generate the composites. Using expression templates, we implement
a DSEL (Domain Specific Embedded Language) that mimicks native C++. You've
seen this DSEL in action in the preceding sections. It is most evident in
- the Statement section.
+ the <a class="link" href="composite.html#phoenix.composite.statement" title="Statement">Statement</a> section.
</p>
<p>
There are some facilities in the library to make composition of composites
- easier. We have a set of overloaded <tt class="computeroutput"><span class="identifier">compose</span></tt>
- functions and an <tt class="computeroutput"><span class="identifier">as_composite</span></tt>
+ easier. We have a set of overloaded <code class="computeroutput"><span class="identifier">compose</span></code>
+ functions and an <code class="computeroutput"><span class="identifier">as_composite</span></code>
metafunction. Together, these helpers make composing a breeze. We'll provide
- an <a href="inside_phoenix.html#phoenix.inside_phoenix.composing.composite_example" title="Composite
- Example">example
+ an <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composing.composite_example" title="Composite Example">example
of a composite</a> later to see why.
</p>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.inside_phoenix.composing.compose"></a>compose</h4></div></div></div>
-<pre class="programlisting">
-<span class="identifier">compose</span><span class="special"><</span><span class="identifier">EvalPolicy</span><span class="special">>(</span><span class="identifier">arg0</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">argN</span><span class="special">);</span>
+<a name="phoenix.inside_phoenix.composing.compose"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composing.compose" title="compose">compose</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="identifier">compose</span><span class="special"><</span><span class="identifier">EvalPolicy</span><span class="special">>(</span><span class="identifier">arg0</span><span class="special">,</span> <span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">argN</span><span class="special">);</span>
</pre>
<p>
- Given an EvalPolicy and some arguments
- <tt class="computeroutput"><span class="identifier">arg0</span></tt>...argN, returns a
- proper <tt class="computeroutput"><span class="identifier">composite</span></tt>. The arguments
+ Given an <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.evalpolicy"><code class="computeroutput"><span class="identifier">EvalPolicy</span></code></a> and some arguments
+ <code class="computeroutput"><span class="identifier">arg0</span></code>...argN, returns a
+ proper <code class="computeroutput"><span class="identifier">composite</span></code>. The arguments
may or may not be phoenix actors (primitives of composites). If not, the
arguments are converted to actors appropriately. For example:
</p>
-<pre class="programlisting">
-<span class="identifier">compose</span><span class="special"><</span><span class="identifier">X</span><span class="special">>(</span><span class="number">3</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">compose</span><span class="special"><</span><span class="identifier">X</span><span class="special">>(</span><span class="number">3</span><span class="special">)</span>
</pre>
<p>
- converts the argument <tt class="computeroutput"><span class="number">3</span></tt> to
- an <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">>(</span><span class="number">3</span><span class="special">)</span></tt>.
+ converts the argument <code class="computeroutput"><span class="number">3</span></code> to
+ an <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">>(</span><span class="number">3</span><span class="special">)</span></code>.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.inside_phoenix.composing.as_composite"></a>as_composite</h4></div></div></div>
-<pre class="programlisting">
-<span class="identifier">as_composite</span><span class="special"><</span><span class="identifier">EvalPolicy</span><span class="special">,</span> <span class="identifier">Arg0</span><span class="special">,</span> <span class="identifier">Arg1</span><span class="special">,</span> <span class="identifier">Arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ArgN</span><span class="special">>::</span><span class="identifier">type</span>
+<a name="phoenix.inside_phoenix.composing.as_composite"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composing.as_composite" title="as_composite">as_composite</a>
+</h4></div></div></div>
+<pre class="programlisting"><span class="identifier">as_composite</span><span class="special"><</span><span class="identifier">EvalPolicy</span><span class="special">,</span> <span class="identifier">Arg0</span><span class="special">,</span> <span class="identifier">Arg1</span><span class="special">,</span> <span class="identifier">Arg2</span><span class="special">,</span> <span class="special">...,</span> <span class="identifier">ArgN</span><span class="special">>::</span><span class="identifier">type</span>
</pre>
<p>
- This is the metafunction counterpart of <tt class="computeroutput"><span class="identifier">compose</span></tt>.
- Given an EvalPolicy and some argument types
- <tt class="computeroutput"><span class="identifier">Arg0</span></tt>...ArgN, returns a
- proper <tt class="computeroutput"><span class="identifier">composite</span></tt> type.
+ This is the metafunction counterpart of <code class="computeroutput"><span class="identifier">compose</span></code>.
+ Given an <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.evalpolicy"><code class="computeroutput"><span class="identifier">EvalPolicy</span></code></a> and some argument types
+ <code class="computeroutput"><span class="identifier">Arg0</span></code>...ArgN, returns a
+ proper <code class="computeroutput"><span class="identifier">composite</span></code> type.
For example:
</p>
-<pre class="programlisting">
-<span class="identifier">as_composite</span><span class="special"><</span><span class="identifier">X</span><span class="special">,</span> <span class="keyword">int</span><span class="special">>::</span><span class="identifier">type</span>
+<pre class="programlisting"><span class="identifier">as_composite</span><span class="special"><</span><span class="identifier">X</span><span class="special">,</span> <span class="keyword">int</span><span class="special">>::</span><span class="identifier">type</span>
</pre>
<p>
- is the composite type of the <tt class="computeroutput"><span class="identifier">compose</span><span class="special"><</span><span class="identifier">X</span><span class="special">>(</span><span class="number">3</span><span class="special">)</span></tt>
+ is the composite type of the <code class="computeroutput"><span class="identifier">compose</span><span class="special"><</span><span class="identifier">X</span><span class="special">>(</span><span class="number">3</span><span class="special">)</span></code>
expression above.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="phoenix.inside_phoenix.composing.composite_example"></a><a href="inside_phoenix.html#phoenix.inside_phoenix.composing.composite_example" title="Composite
- Example">Composite
- Example</a></h4></div></div></div>
+<a name="phoenix.inside_phoenix.composing.composite_example"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composing.composite_example" title="Composite Example">Composite
+ Example</a>
+</h4></div></div></div>
<p>
Now, let's examine an example. Again, this is not a toy example. This is
- actually part of the library. Remember the <a href="composite.html#phoenix.composite.statement.while__statement" title="while_
- Statement"><tt class="computeroutput"><span class="identifier">while_</span></tt></a> lazy statement? Putting
+ actually part of the library. Remember the <a class="link" href="composite.html#phoenix.composite.statement.while__statement" title="while_ Statement"><code class="computeroutput"><span class="identifier">while_</span></code></a> lazy statement? Putting
together everything we've learned so far, we will present it here in its
entirety (verbatim):
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">while_eval</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">while_eval</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Env</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Cond</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">result</span>
@@ -811,26 +807,24 @@
<span class="special">}</span>
</pre>
<p>
- <tt class="computeroutput"><span class="identifier">while_eval</span></tt> is an example
- of an EvalPolicy. <tt class="computeroutput"><span class="identifier">while_gen</span></tt>
- and <tt class="computeroutput"><span class="identifier">while_</span></tt> are the expression
+ <code class="computeroutput"><span class="identifier">while_eval</span></code> is an example
+ of an <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.evalpolicy"><code class="computeroutput"><span class="identifier">EvalPolicy</span></code></a>. <code class="computeroutput"><span class="identifier">while_gen</span></code>
+ and <code class="computeroutput"><span class="identifier">while_</span></code> are the expression
template front ends. Let's break this apart to understand what's happening.
Let's start at the bottom. It's easier that way.
</p>
<p>
When you write:
</p>
-<pre class="programlisting">
-<span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
</pre>
<p>
- we generate an instance of <tt class="computeroutput"><span class="identifier">while_gen</span><span class="special"><</span><span class="identifier">Cond</span><span class="special">></span></tt>, where <tt class="computeroutput"><span class="identifier">Cond</span></tt>
- is the type of <tt class="computeroutput"><span class="identifier">cond</span></tt>. <tt class="computeroutput"><span class="identifier">cond</span></tt> can be an arbitrarily complex actor
- expression. The <tt class="computeroutput"><span class="identifier">while_gen</span></tt>
- template class has an <tt class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></tt> accepting another expression. If we write:
+ we generate an instance of <code class="computeroutput"><span class="identifier">while_gen</span><span class="special"><</span><span class="identifier">Cond</span><span class="special">></span></code>, where <code class="computeroutput"><span class="identifier">Cond</span></code>
+ is the type of <code class="computeroutput"><span class="identifier">cond</span></code>. <code class="computeroutput"><span class="identifier">cond</span></code> can be an arbitrarily complex actor
+ expression. The <code class="computeroutput"><span class="identifier">while_gen</span></code>
+ template class has an <code class="computeroutput"><span class="keyword">operator</span><span class="special">[]</span></code> accepting another expression. If we write:
</p>
-<pre class="programlisting">
-<span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">while_</span><span class="special">(</span><span class="identifier">cond</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">do_</span>
<span class="special">]</span>
@@ -838,17 +832,15 @@
<p>
it will generate a proper composite with the type:
</p>
-<pre class="programlisting">
-<span class="identifier">as_composite</span><span class="special"><</span><span class="identifier">while_eval</span><span class="special">,</span> <span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">>::</span><span class="identifier">type</span>
+<pre class="programlisting"><span class="identifier">as_composite</span><span class="special"><</span><span class="identifier">while_eval</span><span class="special">,</span> <span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">>::</span><span class="identifier">type</span>
</pre>
<p>
- where <tt class="computeroutput"><span class="identifier">Cond</span></tt> is the type
- of <tt class="computeroutput"><span class="identifier">cond</span></tt> and <tt class="computeroutput"><span class="identifier">Do</span></tt> is the type of <tt class="computeroutput"><span class="identifier">do_</span></tt>.
- Notice how we are using phoenix's composition
- (<tt class="computeroutput"><span class="identifier">compose</span></tt> and <tt class="computeroutput"><span class="identifier">as_composite</span></tt>) mechanisms here
+ where <code class="computeroutput"><span class="identifier">Cond</span></code> is the type
+ of <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">Do</span></code> is the type of <code class="computeroutput"><span class="identifier">do_</span></code>.
+ Notice how we are using phoenix's <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composing" title="Composing">composition</a>
+ (<code class="computeroutput"><span class="identifier">compose</span></code> and <code class="computeroutput"><span class="identifier">as_composite</span></code>) mechanisms here
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Do</span><span class="special">></span>
<span class="identifier">actor</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">as_composite</span><span class="special"><</span><span class="identifier">while_eval</span><span class="special">,</span> <span class="identifier">Cond</span><span class="special">,</span> <span class="identifier">Do</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span>
<span class="keyword">operator</span><span class="special">[](</span><span class="identifier">Do</span> <span class="keyword">const</span><span class="special">&</span> <span class="identifier">do_</span><span class="special">)</span> <span class="keyword">const</span>
<span class="special">{</span>
@@ -856,25 +848,25 @@
<span class="special">}</span>
</pre>
<p>
- Finally, the <tt class="computeroutput"><span class="identifier">while_eval</span></tt>
+ Finally, the <code class="computeroutput"><span class="identifier">while_eval</span></code>
does its thing:
</p>
-<pre class="programlisting">
-<span class="keyword">while</span> <span class="special">(</span><span class="identifier">cond</span><span class="special">.</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">env</span><span class="special">))</span>
+<pre class="programlisting"><span class="keyword">while</span> <span class="special">(</span><span class="identifier">cond</span><span class="special">.</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">env</span><span class="special">))</span>
<span class="identifier">do_</span><span class="special">.</span><span class="identifier">eval</span><span class="special">(</span><span class="identifier">env</span><span class="special">);</span>
</pre>
<p>
- <tt class="computeroutput"><span class="identifier">cond</span></tt> and <tt class="computeroutput"><span class="identifier">do_</span></tt>, at this point, are instances of
- Eval. <tt class="computeroutput"><span class="identifier">cond</span></tt>
- and <tt class="computeroutput"><span class="identifier">do_</span></tt> are the Eval elements held by the composite's
- EvalTuple. <tt class="computeroutput"><span class="identifier">env</span></tt>
- is the Environment.
+ <code class="computeroutput"><span class="identifier">cond</span></code> and <code class="computeroutput"><span class="identifier">do_</span></code>, at this point, are instances of
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a>. <code class="computeroutput"><span class="identifier">cond</span></code>
+ and <code class="computeroutput"><span class="identifier">do_</span></code> are the <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.eval_concept"><code class="computeroutput"><span class="identifier">Eval</span></code></a> elements held by the composite's
+ <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.composites_in_detail.evaltuple"><code class="computeroutput"><span class="identifier">EvalTuple</span></code></a>. <code class="computeroutput"><span class="identifier">env</span></code>
+ is the <a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.actors_in_detail.environment"><code class="computeroutput"><span class="identifier">Environment</span></code></a>.
</p>
</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.inside_phoenix.extending"></a>Extending</h3></div></div></div>
+<a name="phoenix.inside_phoenix.extending"></a><a class="link" href="inside_phoenix.html#phoenix.inside_phoenix.extending" title="Extending">Extending</a>
+</h3></div></div></div>
<p>
We've shown how it is very easy to extend phoenix by writing new primitives
and composites. The modular design of Phoenix makes it extremely extensible.
@@ -894,7 +886,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -903,7 +895,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="wrap_up.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="wrap_up.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/introduction.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/introduction.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,30 +1,31 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="prev" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="prev" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="next" href="starter_kit.html" title="Starter Kit">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.introduction"></a>Introduction</h2></div></div></div>
+<a name="phoenix.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
+</h2></div></div></div>
<p>
<span class="inlinemediaobject"><img src="../images/banner.png" alt="banner"></span>
</p>
@@ -55,7 +56,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -64,7 +65,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="starter_kit.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/organization.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/organization.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Organization</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="basics.html" title="Basics">
<link rel="next" href="actors.html" title="Actors">
</head>
@@ -13,18 +13,19 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="basics.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="actors.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="basics.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="actors.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.organization"></a>Organization</h2></div></div></div>
+<a name="phoenix.organization"></a><a class="link" href="organization.html" title="Organization">Organization</a>
+</h2></div></div></div>
<p>
Care and attention to detail was given, painstakingly, to the design and implementation
of Phoenix.
@@ -46,25 +47,25 @@
The library has grown from the original Phoenix but still comprises only header
files. There are no object files to link against.
</p>
-<a name="phoenix.organization.core"></a><h2>
-<a name="id461546"></a>
- Core
- </h2>
+<a name="phoenix.organization.core"></a><h3>
+<a name="id765034"></a>
+ <a class="link" href="organization.html#phoenix.organization.core">Core</a>
+ </h3>
<p>
The lowest two layers comprise the core.
</p>
<p>
- The <tt class="computeroutput"><span class="identifier">Actor</span></tt> is the main concept
+ The <code class="computeroutput"><span class="identifier">Actor</span></code> is the main concept
behind the library. Lazy functions are abstracted as actors. There are only
2 kinds of actors:
</p>
-<div class="orderedlist"><ol type="1">
-<li>
- Primitives
- </li>
-<li>
- Composites
- </li>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ Primitives
+ </li>
+<li class="listitem">
+ Composites
+ </li>
</ol></div>
<p>
Primitives provide the basic building blocks of functionality within Phoenix.
@@ -76,272 +77,275 @@
again be another composite.
</p>
<div class="table">
-<a name="id461610"></a><p class="title"><b>Table 1.2. Modules</b></p>
-<table class="table" summary="Modules">
+<a name="id765093"></a><p class="title"><b>Table 1.2. Modules</b></p>
+<div class="table-contents"><table class="table" summary="Modules">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Module
- </p>
- </th>
+ <p>
+ Module
+ </p>
+ </th>
<th>
- <p>
- Description
- </p>
- </th>
+ <p>
+ Description
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- Function
- </p>
- </td>
+ <p>
+ Function
+ </p>
+ </td>
<td>
- <p>
- Lazy functions support (e.g. <tt class="computeroutput"><span class="identifier">add</span></tt>)
- </p>
- </td>
+ <p>
+ Lazy functions support (e.g. <code class="computeroutput"><span class="identifier">add</span></code>)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Operator
- </p>
- </td>
+ <p>
+ Operator
+ </p>
+ </td>
<td>
- <p>
- Lazy operators support (e.g. <tt class="computeroutput"><span class="special">+</span></tt>)
- </p>
- </td>
+ <p>
+ Lazy operators support (e.g. <code class="computeroutput"><span class="special">+</span></code>)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Statement
- </p>
- </td>
+ <p>
+ Statement
+ </p>
+ </td>
<td>
- <p>
- Lazy statments (e.g. <tt class="computeroutput"><span class="identifier">if_</span></tt>,
- <tt class="computeroutput"><span class="identifier">while_</span></tt>)
- </p>
- </td>
+ <p>
+ Lazy statments (e.g. <code class="computeroutput"><span class="identifier">if_</span></code>,
+ <code class="computeroutput"><span class="identifier">while_</span></code>)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Object
- </p>
- </td>
+ <p>
+ Object
+ </p>
+ </td>
<td>
- <p>
- Lazy casts (e.g. <tt class="computeroutput"><span class="identifier">static_cast_</span></tt>),
- object creation destruction (e.g. <tt class="computeroutput"><span class="identifier">new_</span></tt>,
- <tt class="computeroutput"><span class="identifier">delete_</span></tt>)
- </p>
- </td>
+ <p>
+ Lazy casts (e.g. <code class="computeroutput"><span class="identifier">static_cast_</span></code>),
+ object creation destruction (e.g. <code class="computeroutput"><span class="identifier">new_</span></code>,
+ <code class="computeroutput"><span class="identifier">delete_</span></code>)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Scope
- </p>
- </td>
+ <p>
+ Scope
+ </p>
+ </td>
<td>
- <p>
- Support for scopes, local variables and lambda-lambda
- </p>
- </td>
+ <p>
+ Support for scopes, local variables and lambda-lambda
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Bind
- </p>
- </td>
+ <p>
+ Bind
+ </p>
+ </td>
<td>
- <p>
- Lazy functions from free functions, member functions or member variables.
- </p>
- </td>
+ <p>
+ Lazy functions from free functions, member functions or member variables.
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Container
- </p>
- </td>
+ <p>
+ Container
+ </p>
+ </td>
<td>
- <p>
- Set of predefined "lazy" functions that work on STL containers
- and sequences (e.g. <tt class="computeroutput"><span class="identifier">push_back</span></tt>).
- </p>
- </td>
+ <p>
+ Set of predefined "lazy" functions that work on STL containers
+ and sequences (e.g. <code class="computeroutput"><span class="identifier">push_back</span></code>).
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Algorithm
- </p>
- </td>
+ <p>
+ Algorithm
+ </p>
+ </td>
<td>
- <p>
- Set of predefined "lazy" versions of the STL algorithms (e.g.
- <tt class="computeroutput"><span class="identifier">find_if</span></tt>).
- </p>
- </td>
+ <p>
+ Set of predefined "lazy" versions of the STL algorithms
+ (e.g. <code class="computeroutput"><span class="identifier">find_if</span></code>).
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<p>
+<br class="table-break"><p>
Each module is defined in a header file with the same name. For example, the
- core module is defined in <tt class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>.
+ core module is defined in <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>.
</p>
<div class="table">
-<a name="id461986"></a><p class="title"><b>Table 1.3. Includes</b></p>
-<table class="table" summary="Includes">
+<a name="id765410"></a><p class="title"><b>Table 1.3. Includes</b></p>
+<div class="table-contents"><table class="table" summary="Includes">
<colgroup>
<col>
<col>
</colgroup>
<thead><tr>
<th>
- <p>
- Module
- </p>
- </th>
+ <p>
+ Module
+ </p>
+ </th>
<th>
- <p>
- File
- </p>
- </th>
+ <p>
+ File
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- Core
- </p>
- </td>
+ <p>
+ Core
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Function
- </p>
- </td>
+ <p>
+ Function
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">function</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Operator
- </p>
- </td>
+ <p>
+ Operator
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="keyword">operator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Statement
- </p>
- </td>
+ <p>
+ Statement
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">statement</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Object
- </p>
- </td>
+ <p>
+ Object
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">object</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Scope
- </p>
- </td>
+ <p>
+ Scope
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">scope</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Bind
- </p>
- </td>
+ <p>
+ Bind
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">bind</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Container
- </p>
- </td>
+ <p>
+ Container
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">container</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- Algorithm
- </p>
- </td>
+ <p>
+ Algorithm
+ </p>
+ </td>
<td>
- <p>
- <tt class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></tt>
- </p>
- </td>
+ <p>
+ <code class="computeroutput"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code>
+ </p>
+ </td>
</tr>
</tbody>
-</table>
+</table></div>
</div>
-<div class="sidebar"><p>
+<br class="table-break"><div class="sidebar">
+<p class="title"><b></b></p>
+<p>
<span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Finer grained include files are available per feature;
see the succeeding sections.
- </p></div>
+ </p>
+</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -350,7 +354,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="basics.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="actors.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="basics.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="actors.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/primitives.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/primitives.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Primitives</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="actors.html" title="Actors">
<link rel="next" href="composite.html" title="Composite">
</head>
@@ -13,18 +13,19 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="actors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="composite.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="actors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="composite.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.primitives"></a>Primitives</h2></div></div></div>
+<a name="phoenix.primitives"></a><a class="link" href="primitives.html" title="Primitives">Primitives</a>
+</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section">Arguments</span></dt>
<dt><span class="section">Values</span></dt>
@@ -38,92 +39,86 @@
is extensible. New primitives can be added anytime. Right out of the box, there
are only a few primitives. This section shall deal with these preset primitives.
</p>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.primitives.arguments"></a>Arguments</h3></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">argument</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.primitives.arguments"></a><a class="link" href="primitives.html#phoenix.primitives.arguments" title="Arguments">Arguments</a>
+</h3></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">argument</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
We use an instance of:
</p>
-<pre class="programlisting">
-<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="identifier">N</span><span class="special">></span> <span class="special">></span>
+<pre class="programlisting"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="identifier">N</span><span class="special">></span> <span class="special">></span>
</pre>
<p>
to represent the Nth function argument. The argument placeholder acts as
an imaginary data-bin where a function argument will be placed.
</p>
-<a name="phoenix.primitives.arguments.predefined_arguments"></a><h2>
-<a name="id463599"></a>
- <a href="primitives.html#phoenix.primitives.arguments.predefined_arguments">Predefined
+<a name="phoenix.primitives.arguments.predefined_arguments"></a><h3>
+<a name="id766693"></a>
+ <a class="link" href="primitives.html#phoenix.primitives.arguments.predefined_arguments">Predefined
Arguments</a>
- </h2>
+ </h3>
<p>
- There are a few predefined instances of <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="identifier">N</span><span class="special">></span>
- <span class="special">></span></tt> named <tt class="computeroutput"><span class="identifier">arg1</span></tt>..<tt class="computeroutput"><span class="identifier">argN</span></tt>, and its BLL
- counterpart <tt class="computeroutput"><span class="identifier">_1</span></tt>..<tt class="computeroutput"><span class="identifier">_N</span></tt>. (where N is a predefined maximum).
+ There are a few predefined instances of <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="identifier">N</span><span class="special">></span>
+ <span class="special">></span></code> named <code class="computeroutput"><span class="identifier">arg1</span></code>..<code class="computeroutput"><span class="identifier">argN</span></code>, and its BLL
+ counterpart <code class="computeroutput"><span class="identifier">_1</span></code>..<code class="computeroutput"><span class="identifier">_N</span></code>. (where N is a predefined maximum).
</p>
<p>
- Here are some sample preset definitions of <tt class="computeroutput"><span class="identifier">arg1</span></tt>..<tt class="computeroutput"><span class="identifier">argN</span></tt>
+ Here are some sample preset definitions of <code class="computeroutput"><span class="identifier">arg1</span></code>..<code class="computeroutput"><span class="identifier">argN</span></code>
</p>
-<pre class="programlisting">
-<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">arg1</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">>();</span>
+<pre class="programlisting"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">arg1</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">>();</span>
<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">1</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">arg2</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">1</span><span class="special">>();</span>
<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">2</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">arg3</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">2</span><span class="special">>();</span>
</pre>
<p>
and its BLL
- <tt class="computeroutput"><span class="identifier">_1</span></tt>..<tt class="computeroutput"><span class="identifier">_N</span></tt>
+ <code class="computeroutput"><span class="identifier">_1</span></code>..<code class="computeroutput"><span class="identifier">_N</span></code>
style counterparts:
</p>
-<pre class="programlisting">
-<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">_1</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">>();</span>
+<pre class="programlisting"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">_1</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">>();</span>
<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">1</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">_2</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">1</span><span class="special">>();</span>
<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">2</span><span class="special">></span> <span class="special">></span> <span class="keyword">const</span> <span class="identifier">_3</span> <span class="special">=</span> <span class="identifier">argument</span><span class="special"><</span><span class="number">2</span><span class="special">>();</span>
</pre>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
- You can set <tt class="computeroutput"><span class="identifier">PHOENIX_ARG_LIMIT</span></tt>,
- the predefined maximum placeholder index. By default, <tt class="computeroutput"><span class="identifier">PHOENIX_ARG_LIMIT</span></tt>
- is set to <tt class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></tt>
- (See Actors).
+<tr><td align="left" valign="top"><p>
+ You can set <code class="computeroutput"><span class="identifier">PHOENIX_ARG_LIMIT</span></code>,
+ the predefined maximum placeholder index. By default, <code class="computeroutput"><span class="identifier">PHOENIX_ARG_LIMIT</span></code>
+ is set to <code class="computeroutput"><span class="identifier">PHOENIX_LIMIT</span></code>
+ (See <a class="link" href="actors.html" title="Actors">Actors</a>).
</p></td></tr>
</table></div>
-<a name="phoenix.primitives.arguments.user_defined_arguments"></a><h2>
-<a name="id464325"></a>
- <a href="primitives.html#phoenix.primitives.arguments.user_defined_arguments">User
+<a name="phoenix.primitives.arguments.user_defined_arguments"></a><h3>
+<a name="id767253"></a>
+ <a class="link" href="primitives.html#phoenix.primitives.arguments.user_defined_arguments">User
Defined Arguments</a>
- </h2>
+ </h3>
<p>
- When appropriate, you can define your own <tt class="computeroutput"><span class="identifier">argument</span><span class="special"><</span><span class="identifier">N</span><span class="special">></span></tt>
+ When appropriate, you can define your own <code class="computeroutput"><span class="identifier">argument</span><span class="special"><</span><span class="identifier">N</span><span class="special">></span></code>
names. For example:
</p>
-<pre class="programlisting">
-<span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">></span> <span class="special">></span> <span class="identifier">x</span><span class="special">;</span> <span class="comment">// note zero based index
+<pre class="programlisting"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">argument</span><span class="special"><</span><span class="number">0</span><span class="special">></span> <span class="special">></span> <span class="identifier">x</span><span class="special">;</span> <span class="comment">// note zero based index
</span></pre>
<p>
- <tt class="computeroutput"><span class="identifier">x</span></tt> may now be used as a parameter
+ <code class="computeroutput"><span class="identifier">x</span></code> may now be used as a parameter
to a lazy function:
</p>
-<pre class="programlisting">
-<span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
</pre>
<p>
which is equivalent to:
</p>
-<pre class="programlisting">
-<span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
</pre>
-<a name="phoenix.primitives.arguments.evaluating_an_argument"></a><h2>
-<a name="id464544"></a>
- <a href="primitives.html#phoenix.primitives.arguments.evaluating_an_argument">Evaluating
+<a name="phoenix.primitives.arguments.evaluating_an_argument"></a><h3>
+<a name="id767420"></a>
+ <a class="link" href="primitives.html#phoenix.primitives.arguments.evaluating_an_argument">Evaluating
an Argument</a>
- </h2>
+ </h3>
<p>
An argument, when evaluated, selects the Nth argument from the those passed
in by the client.
@@ -131,8 +126,7 @@
<p>
For example:
</p>
-<pre class="programlisting">
-<span class="keyword">char</span> <span class="identifier">c</span> <span class="special">=</span> <span class="char">'A'</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">char</span> <span class="identifier">c</span> <span class="special">=</span> <span class="char">'A'</span><span class="special">;</span>
<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">123</span><span class="special">;</span>
<span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
@@ -143,53 +137,49 @@
<p>
will print out:
</p>
-<pre class="programlisting">
-<span class="identifier">A</span>
+<pre class="programlisting"><span class="identifier">A</span>
<span class="number">123</span>
<span class="identifier">Hello</span> <span class="identifier">World</span>
</pre>
-<a name="phoenix.primitives.arguments.extra_arguments"></a><h2>
-<a name="id464915"></a>
- Extra Arguments
- </h2>
+<a name="phoenix.primitives.arguments.extra_arguments"></a><h3>
+<a name="id767715"></a>
+ <a class="link" href="primitives.html#phoenix.primitives.arguments.extra_arguments">Extra Arguments</a>
+ </h3>
<p>
In C and C++, a function can have extra arguments that are not at all used
by the function body itself. These extra arguments are simply ignored.
</p>
<p>
Phoenix also allows extra arguments to be passed. For example, recall our
- original <tt class="computeroutput"><span class="identifier">add</span></tt> function:
+ original <code class="computeroutput"><span class="identifier">add</span></code> function:
</p>
-<pre class="programlisting">
-<span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span>
</pre>
<p>
We know now that partially applying this function results to a function that
expects 2 arguments. However, the library is a bit more lenient and allows
- the caller to supply more arguments than is actually required. Thus, <tt class="computeroutput"><span class="identifier">add</span></tt> actually allows 2 <span class="emphasis"><em>or more</em></span>
+ the caller to supply more arguments than is actually required. Thus, <code class="computeroutput"><span class="identifier">add</span></code> actually allows 2 <span class="emphasis"><em>or more</em></span>
arguments. For instance, with:
</p>
-<pre class="programlisting">
-<span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">,</span> <span class="identifier">z</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)(</span><span class="identifier">x</span><span class="special">,</span> <span class="identifier">y</span><span class="special">,</span> <span class="identifier">z</span><span class="special">)</span>
</pre>
<p>
- the third argument <tt class="computeroutput"><span class="identifier">z</span></tt> is ignored.
+ the third argument <code class="computeroutput"><span class="identifier">z</span></code> is ignored.
Taking this further, in-between arguments are also ignored. Example:
</p>
-<pre class="programlisting">
-<span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg5</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">,</span> <span class="identifier">e</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg5</span><span class="special">)(</span><span class="identifier">a</span><span class="special">,</span> <span class="identifier">b</span><span class="special">,</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">d</span><span class="special">,</span> <span class="identifier">e</span><span class="special">)</span>
</pre>
<p>
- Here, arguments b, c, and d are ignored. The function <tt class="computeroutput"><span class="identifier">add</span></tt>
- takes in the first argument (<tt class="computeroutput"><span class="identifier">arg1</span></tt>)
- and the fifth argument (<tt class="computeroutput"><span class="identifier">arg5</span></tt>).
+ Here, arguments b, c, and d are ignored. The function <code class="computeroutput"><span class="identifier">add</span></code>
+ takes in the first argument (<code class="computeroutput"><span class="identifier">arg1</span></code>)
+ and the fifth argument (<code class="computeroutput"><span class="identifier">arg5</span></code>).
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
There are a few reasons why enforcing strict arity is not desireable. A
case in point is the callback function. Typical callback functions provide
more information than is actually needed. Lambda functions are often used
@@ -197,112 +187,103 @@
</p></td></tr>
</table></div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.primitives.values"></a>Values</h3></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">value</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.primitives.values"></a><a class="link" href="primitives.html#phoenix.primitives.values" title="Values">Values</a>
+</h3></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">value</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Whenever we see a constant in a partially applied function, an
</p>
-<pre class="programlisting">
-<span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span>
+<pre class="programlisting"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span>
</pre>
<p>
(where T is the type of the constant) is automatically created for us. For
instance:
</p>
-<pre class="programlisting">
-<span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="number">6</span><span class="special">)</span>
</pre>
<p>
- Passing a second argument, <tt class="computeroutput"><span class="number">6</span></tt>,
- an <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span></tt>
+ Passing a second argument, <code class="computeroutput"><span class="number">6</span></code>,
+ an <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="special">></span></code>
is implicitly created behind the scenes. This is also equivalent to:
</p>
-<pre class="programlisting">
-<span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">val</span><span class="special">(</span><span class="number">6</span><span class="special">))</span>
+<pre class="programlisting"><span class="identifier">add</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">val</span><span class="special">(</span><span class="number">6</span><span class="special">))</span>
</pre>
<p>
- <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></tt> generates
- an <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span></tt> where <tt class="computeroutput"><span class="identifier">T</span></tt>
- is the type of <tt class="computeroutput"><span class="identifier">x</span></tt>. In most
- cases, there's no need to explicitly use <tt class="computeroutput"><span class="identifier">val</span></tt>,
+ <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code> generates
+ an <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span></code> where <code class="computeroutput"><span class="identifier">T</span></code>
+ is the type of <code class="computeroutput"><span class="identifier">x</span></code>. In most
+ cases, there's no need to explicitly use <code class="computeroutput"><span class="identifier">val</span></code>,
but, as we'll see later on, there are situations where this is unavoidable.
</p>
-<a name="phoenix.primitives.values.evaluating_a_value"></a><h2>
-<a name="id465687"></a>
- <a href="primitives.html#phoenix.primitives.values.evaluating_a_value">Evaluating a
+<a name="phoenix.primitives.values.evaluating_a_value"></a><h3>
+<a name="id768309"></a>
+ <a class="link" href="primitives.html#phoenix.primitives.values.evaluating_a_value">Evaluating a
Value</a>
- </h2>
+ </h3>
<p>
Like arguments, values are also actors. As such, values can be evaluated.
Invoking a value gives the value's identity. Example:
</p>
-<pre class="programlisting">
-<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special"><<</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"Hello World"</span><span class="special">)();</span>
+<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special"><<</span> <span class="identifier">val</span><span class="special">(</span><span class="string">"Hello World"</span><span class="special">)();</span>
</pre>
<p>
prints out "3 Hello World".
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.primitives.references"></a>References</h3></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">reference</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.primitives.references"></a><a class="link" href="primitives.html#phoenix.primitives.references" title="References">References</a>
+</h3></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">reference</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
Values are immutable constants. Attempting to modify a value will result
in a compile time error. When we want the function to modify the parameter,
- we use a reference instead. For instance, imagine a lazy function <tt class="computeroutput"><span class="identifier">add_assign</span></tt>:
+ we use a reference instead. For instance, imagine a lazy function <code class="computeroutput"><span class="identifier">add_assign</span></code>:
</p>
-<pre class="programlisting">
-<span class="keyword">void</span> <span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">T</span><span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">y</span><span class="special">)</span> <span class="special">{</span> <span class="identifier">x</span> <span class="special">+=</span> <span class="identifier">y</span><span class="special">;</span> <span class="special">}</span> <span class="comment">// pseudo code
+<pre class="programlisting"><span class="keyword">void</span> <span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">T</span><span class="special">&</span> <span class="identifier">x</span><span class="special">,</span> <span class="identifier">T</span> <span class="identifier">y</span><span class="special">)</span> <span class="special">{</span> <span class="identifier">x</span> <span class="special">+=</span> <span class="identifier">y</span><span class="special">;</span> <span class="special">}</span> <span class="comment">// pseudo code
</span></pre>
<p>
Here, we want the first function argument, x, to be mutable. Obviously, we
cannot write:
</p>
-<pre class="programlisting">
-<span class="identifier">add_assign</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span> <span class="comment">// error first argument is immutable
+<pre class="programlisting"><span class="identifier">add_assign</span><span class="special">(</span><span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">)</span> <span class="comment">// error first argument is immutable
</span></pre>
<p>
In C++, we can pass in a reference to a variable as the first argument in
our example above. Yet, by default, the library forces arguments passed to
- partially applied functions functions to be immutable values (see Values).
+ partially applied functions functions to be immutable values (see <a class="link" href="primitives.html#phoenix.primitives.values" title="Values">Values</a>).
To achieve our intent, we use:
</p>
-<pre class="programlisting">
-<span class="identifier">actor</span><span class="special"><</span><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span>
+<pre class="programlisting"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span>
</pre>
<p>
- This is similar to <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
- <span class="special">></span></tt> above but instead holds a reference
+ This is similar to <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
+ <span class="special">></span></code> above but instead holds a reference
to a variable.
</p>
<p>
- We normally don't instantiate <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
- <span class="special">></span></tt> objects directly. Instead we
- use <tt class="computeroutput"><span class="identifier">ref</span></tt>. For example (where
- <tt class="computeroutput"><span class="identifier">i</span></tt> is an <tt class="computeroutput"><span class="keyword">int</span></tt>
+ We normally don't instantiate <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
+ <span class="special">></span></code> objects directly. Instead we
+ use <code class="computeroutput"><span class="identifier">ref</span></code>. For example (where
+ <code class="computeroutput"><span class="identifier">i</span></code> is an <code class="computeroutput"><span class="keyword">int</span></code>
variable):
</p>
-<pre class="programlisting">
-<span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">),</span> <span class="number">2</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">add_assign</span><span class="special">(</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">),</span> <span class="number">2</span><span class="special">)</span>
</pre>
-<a name="phoenix.primitives.references.evaluating_a_reference"></a><h2>
-<a name="id466317"></a>
- <a href="primitives.html#phoenix.primitives.references.evaluating_a_reference">Evaluating
+<a name="phoenix.primitives.references.evaluating_a_reference"></a><h3>
+<a name="id769065"></a>
+ <a class="link" href="primitives.html#phoenix.primitives.references.evaluating_a_reference">Evaluating
a Reference</a>
- </h2>
+ </h3>
<p>
References are actors. Hence, references can be evaluated. Such invocation
gives the references's identity. Example:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)()</span> <span class="special"><<</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">s</span><span class="special">)();</span>
</pre>
@@ -310,39 +291,39 @@
prints out "3 Hello World"
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.primitives.constant_references"></a>Constant References</h3></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">reference</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.primitives.constant_references"></a><a class="link" href="primitives.html#phoenix.primitives.constant_references" title="Constant References">Constant References</a>
+</h3></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">reference</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- Another free function <tt class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></tt>
- may also be used. <tt class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></tt> creates
- an <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&></span> <span class="special">></span></tt>
- object. This is similar to <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
- <span class="special">></span></tt> but when the data to be passed
- as argument to a function is heavy and expensive to copy by value, the <tt class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></tt> offers a lighter alternative.
+ Another free function <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></code>
+ may also be used. <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></code> creates
+ an <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">reference</span><span class="special"><</span><span class="identifier">T</span> <span class="keyword">const</span><span class="special">&></span> <span class="special">></span></code>
+ object. This is similar to <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">value</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
+ <span class="special">></span></code> but when the data to be passed
+ as argument to a function is heavy and expensive to copy by value, the <code class="computeroutput"><span class="identifier">cref</span><span class="special">(</span><span class="identifier">cv</span><span class="special">)</span></code> offers a lighter alternative.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.primitives.nothing"></a>Nothing</h3></div></div></div>
-<pre class="programlisting">
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">nothing</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
+<a name="phoenix.primitives.nothing"></a><a class="link" href="primitives.html#phoenix.primitives.nothing" title="Nothing">Nothing</a>
+</h3></div></div></div>
+<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">home</span><span class="special">/</span><span class="identifier">phoenix</span><span class="special">/</span><span class="identifier">core</span><span class="special">/</span><span class="identifier">nothing</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- Finally, the <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">null_actor</span><span class="special">></span></tt>
- does nothing; (a "bum", if you will :-). There's a sole <tt class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">null_actor</span><span class="special">></span></tt>
+ Finally, the <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">null_actor</span><span class="special">></span></code>
+ does nothing; (a "bum", if you will :-). There's a sole <code class="computeroutput"><span class="identifier">actor</span><span class="special"><</span><span class="identifier">null_actor</span><span class="special">></span></code>
instance named "nothing". This actor is actually useful in situations
- where we don't want to do anything. (See <a href="composite.html#phoenix.composite.statement.for__statement" title="for_ Statement">for_
+ where we don't want to do anything. (See <a class="link" href="composite.html#phoenix.composite.statement.for__statement" title="for_ Statement">for_
Statement</a> for example).
</p>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -351,7 +332,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="actors.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="composite.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="actors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="composite.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/references.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/references.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,81 +1,82 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>References</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="acknowledgement.html" title="Acknowledgement">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="acknowledgement.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="acknowledgement.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.references"></a>References</h2></div></div></div>
-<div class="orderedlist"><ol type="1">
-<li>
- Why Functional Programming Matters, John Hughes, 1989. Available online at
- http://www.math.chalmers.se/~rjmh/Papers/whyfp.html.
- </li>
-<li>
- Boost.Lambda library, Jaakko Jarvi, 1999-2004 Jaakko Jarvi, Gary Powell.
- Available online at http://www.boost.org/libs/lambda/.
- </li>
-<li>
- Functional Programming in C++ using the FC++ Library: a short article introducing
- FC++, Brian McNamara and Yannis Smaragdakis, August 2003. Available online
- at http://www.cc.gatech.edu/~yannis/fc++/.
- </li>
-<li>
- Side-effects and partial function application in C++, Jaakko Jarvi and Gary
- Powell, 2001. Available online at http://osl.iu.edu/~jajarvi/publications/papers/mpool01.pdf.
- </li>
-<li>
- Spirit Version 1.8.1, Joel de Guzman, Nov 2004. Available online at http://www.boost.org/libs/spirit/.
- </li>
-<li>
- The Boost MPL Library, Aleksey Gurtovoy and David Abrahams, 2002-2004. Available
- online at http://www.boost.org/libs/mpl/.
- </li>
-<li>
- Generic Programming Redesign of Patterns, Proceedings of the 5th European
- Conference on Pattern Languages of Programs, (EuroPLoP'2000) Irsee, Germany,
- July 2000. Available online at http://www.coldewey.com/europlop2000/papers/geraud%2Bduret.zip.
- </li>
-<li>
- A Gentle Introduction to Haskell, Paul Hudak, John Peterson and Joseph Fasel,
- 1999. Available online at http://www.haskell.org/tutorial/.
- </li>
-<li>
- Large scale software design, John Lackos, ISBN 0201633620, Addison-Wesley,
- July 1996.
- </li>
-<li>
- Design Patterns, Elements of Reusable Object-Oriented Software, Erich Gamma,
- Richard Helm, Ralph Jhonson, and John Vlissides, Addison-Wesley, 1995.
- </li>
-<li>
- The Forwarding Problem: Arguments Peter Dimov, Howard E. Hinnant, Dave Abrahams,
- September 09, 2002. Available online: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
- Function Problem</a>.
- </li>
+<a name="phoenix.references"></a><a class="link" href="references.html" title="References">References</a>
+</h2></div></div></div>
+<div class="orderedlist"><ol class="orderedlist" type="1">
+<li class="listitem">
+ Why Functional Programming Matters, John Hughes, 1989. Available online
+ at http://www.math.chalmers.se/~rjmh/Papers/whyfp.html.
+ </li>
+<li class="listitem">
+ Boost.Lambda library, Jaakko Jarvi, 1999-2004 Jaakko Jarvi, Gary Powell.
+ Available online at http://www.boost.org/libs/lambda/.
+ </li>
+<li class="listitem">
+ Functional Programming in C++ using the FC++ Library: a short article introducing
+ FC++, Brian McNamara and Yannis Smaragdakis, August 2003. Available online
+ at http://www.cc.gatech.edu/~yannis/fc++/.
+ </li>
+<li class="listitem">
+ Side-effects and partial function application in C++, Jaakko Jarvi and
+ Gary Powell, 2001. Available online at http://osl.iu.edu/~jajarvi/publications/papers/mpool01.pdf.
+ </li>
+<li class="listitem">
+ Spirit Version 1.8.1, Joel de Guzman, Nov 2004. Available online at http://www.boost.org/libs/spirit/.
+ </li>
+<li class="listitem">
+ The Boost MPL Library, Aleksey Gurtovoy and David Abrahams, 2002-2004.
+ Available online at http://www.boost.org/libs/mpl/.
+ </li>
+<li class="listitem">
+ Generic Programming Redesign of Patterns, Proceedings of the 5th European
+ Conference on Pattern Languages of Programs, (EuroPLoP'2000) Irsee, Germany,
+ July 2000. Available online at http://www.coldewey.com/europlop2000/papers/geraud%2Bduret.zip.
+ </li>
+<li class="listitem">
+ A Gentle Introduction to Haskell, Paul Hudak, John Peterson and Joseph
+ Fasel, 1999. Available online at http://www.haskell.org/tutorial/.
+ </li>
+<li class="listitem">
+ Large scale software design, John Lackos, ISBN 0201633620, Addison-Wesley,
+ July 1996.
+ </li>
+<li class="listitem">
+ Design Patterns, Elements of Reusable Object-Oriented Software, Erich Gamma,
+ Richard Helm, Ralph Jhonson, and John Vlissides, Addison-Wesley, 1995.
+ </li>
+<li class="listitem">
+ The Forwarding Problem: Arguments Peter Dimov, Howard E. Hinnant, Dave
+ Abrahams, September 09, 2002. Available online: <a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2002/n1385.htm" target="_top">Forwarding
+ Function Problem</a>.
+ </li>
</ol></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -84,7 +85,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="acknowledgement.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="acknowledgement.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/starter_kit.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/starter_kit.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Starter Kit</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="introduction.html" title="Introduction">
<link rel="next" href="basics.html" title="Basics">
</head>
@@ -13,18 +13,19 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.starter_kit"></a>Starter Kit</h2></div></div></div>
+<a name="phoenix.starter_kit"></a><a class="link" href="starter_kit.html" title="Starter Kit">Starter Kit</a>
+</h2></div></div></div>
<div class="toc"><dl>
<dt><span class="section">Values</span></dt>
<dt><span class="section">References</span></dt>
@@ -58,10 +59,10 @@
to provide you with annotated exemplars instead. Hopefully, this will get you
into high gear quickly.
</p>
-<a name="phoenix.starter_kit.functors_everywhere"></a><h2>
-<a name="id387510"></a>
- Functors everywhere
- </h2>
+<a name="phoenix.starter_kit.functors_everywhere"></a><h3>
+<a name="id760240"></a>
+ <a class="link" href="starter_kit.html#phoenix.starter_kit.functors_everywhere">Functors everywhere</a>
+ </h3>
<p>
Phoenix is built on function objects (functors). The functor is the main building
block. We compose functors to build more complex functors... to build more
@@ -69,72 +70,73 @@
</p>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
Functors are so ubiquitous in Phoenix that, in the manual, the words <span class="emphasis"><em>"functor"</em></span>
and <span class="emphasis"><em>"function"</em></span> are used interchangeably.
</p></td></tr>
</table></div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.values"></a>Values</h3></div></div></div>
+<a name="phoenix.starter_kit.values"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.values" title="Values">Values</a>
+</h3></div></div></div>
<p>
Values are functions! Examples:
</p>
-<pre class="programlisting">
-<span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
<span class="identifier">val</span><span class="special">(</span><span class="string">"Hello, World"</span><span class="special">)</span>
</pre>
<p>
The first evaluates to a nullary function (a function taking no arguments)
- that returns an <tt class="computeroutput"><span class="keyword">int</span></tt>, <tt class="computeroutput"><span class="number">3</span></tt>. The second evaluates to a nullary function
- that returns a <tt class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">(&)[</span><span class="number">13</span><span class="special">]</span></tt>, <tt class="computeroutput"><span class="string">"Hello,
- World"</span></tt>.
- </p>
-<a name="phoenix.starter_kit.values.lazy_evaluation"></a><h2>
-<a name="id385403"></a>
- Lazy Evaluation
- </h2>
+ that returns an <code class="computeroutput"><span class="keyword">int</span></code>, <code class="computeroutput"><span class="number">3</span></code>. The second evaluates to a nullary function
+ that returns a <code class="computeroutput"><span class="keyword">char</span> <span class="keyword">const</span><span class="special">(&)[</span><span class="number">13</span><span class="special">]</span></code>, <code class="computeroutput"><span class="string">"Hello,
+ World"</span></code>.
+ </p>
+<a name="phoenix.starter_kit.values.lazy_evaluation"></a><h3>
+<a name="id760388"></a>
+ <a class="link" href="starter_kit.html#phoenix.starter_kit.values.lazy_evaluation">Lazy Evaluation</a>
+ </h3>
<p>
- Confused? <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></tt> is a unary
+ Confused? <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code> is a unary
function, you say? Yes it is. However, read carefully: <span class="emphasis"><em>"evaluates
- to a nullary function"</em></span>. <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></tt>
- evaluates to (returns) a nullary function. Aha! <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></tt>
- returns a function! So, since <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></tt>
+ to a nullary function"</em></span>. <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
+ evaluates to (returns) a nullary function. Aha! <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
+ returns a function! So, since <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code>
returns a function, you can invoke it. Example:
</p>
-<pre class="programlisting">
-<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
+<pre class="programlisting"><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)()</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
(See values.cpp)
</p>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about values here.
- </p></div>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about values <a class="link" href="primitives.html#phoenix.primitives.values" title="Values">here.</a>
+ </p>
+</div>
<p>
The second function call (the one with no arguments) calls the nullary function
- which then returns <tt class="computeroutput"><span class="number">3</span></tt>. The need
+ which then returns <code class="computeroutput"><span class="number">3</span></code>. The need
for a second function call is the reason why the function is said to be
- <span class="bold"><b><span class="emphasis"><em>Lazily Evaluated</em></span></b></span>. The
+ <span class="bold"><strong><span class="emphasis"><em>Lazily Evaluated</em></span></strong></span>. The
first call doesn't do anything. You need a second call to finally evaluate
the thing. The first call lazily evaluates the function; i.e. doesn't do
anything and defers the evaluation for later.
</p>
-<a name="phoenix.starter_kit.values.callbacks"></a><h2>
-<a name="id456050"></a>
- Callbacks
- </h2>
+<a name="phoenix.starter_kit.values.callbacks"></a><h3>
+<a name="id760603"></a>
+ <a class="link" href="starter_kit.html#phoenix.starter_kit.values.callbacks">Callbacks</a>
+ </h3>
<p>
It may not be immediately apparent how lazy evaluation can be useful by just
looking at the example above. Putting the first and second function call
- in a single line is really not very useful. However, thinking of <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></tt> as a callback function (and in most cases
+ in a single line is really not very useful. However, thinking of <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span></code> as a callback function (and in most cases
they are actually used that way), will make it clear. Example:
</p>
-<pre class="programlisting">
-<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">F</span><span class="special">></span>
+<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">F</span><span class="special">></span>
<span class="keyword">void</span> <span class="identifier">print</span><span class="special">(</span><span class="identifier">F</span> <span class="identifier">f</span><span class="special">)</span>
<span class="special">{</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">f</span><span class="special">()</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span>
@@ -152,42 +154,45 @@
(See callback.cpp)
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.references"></a>References</h3></div></div></div>
+<a name="phoenix.starter_kit.references"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.references" title="References">References</a>
+</h3></div></div></div>
<p>
References are functions. They hold a reference to a value stored somehere.
For example, given:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
</pre>
<p>
- we create <tt class="computeroutput"><span class="identifier">references</span></tt> to
- <tt class="computeroutput"><span class="identifier">i</span></tt> and <tt class="computeroutput"><span class="identifier">s</span></tt>
+ we create <code class="computeroutput"><span class="identifier">references</span></code> to
+ <code class="computeroutput"><span class="identifier">i</span></code> and <code class="computeroutput"><span class="identifier">s</span></code>
this way:
</p>
-<pre class="programlisting">
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span>
<span class="identifier">ref</span><span class="special">(</span><span class="identifier">s</span><span class="special">)</span>
</pre>
<p>
- Like <tt class="computeroutput"><span class="identifier">val</span></tt>, the expressions
- above evaluates to a nullary function; the first one returning an <tt class="computeroutput"><span class="keyword">int</span><span class="special">&</span></tt>,
- and the second one returning a <tt class="computeroutput"><span class="keyword">char</span>
- <span class="keyword">const</span><span class="special">*&</span></tt>.
+ Like <code class="computeroutput"><span class="identifier">val</span></code>, the expressions
+ above evaluates to a nullary function; the first one returning an <code class="computeroutput"><span class="keyword">int</span><span class="special">&</span></code>,
+ and the second one returning a <code class="computeroutput"><span class="keyword">char</span>
+ <span class="keyword">const</span><span class="special">*&</span></code>.
</p>
<p>
(See references.cpp)
</p>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about references here.
- </p></div>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about references <a class="link" href="primitives.html#phoenix.primitives.references" title="References">here.</a>
+ </p>
+</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.arguments"></a>Arguments</h3></div></div></div>
+<a name="phoenix.starter_kit.arguments"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.arguments" title="Arguments">Arguments</a>
+</h3></div></div></div>
<p>
Arguments are also functions? You bet!
</p>
@@ -198,17 +203,15 @@
arg3, arg4 and so on (and it's BLL
counterparts: _1, _2, _3, _4 and so on). Examples:
</p>
-<pre class="programlisting">
-<span class="identifier">arg1</span> <span class="comment">// one-or-more argument function that returns its first argument
+<pre class="programlisting"><span class="identifier">arg1</span> <span class="comment">// one-or-more argument function that returns its first argument
</span><span class="identifier">arg2</span> <span class="comment">// two-or-more argument function that returns its second argument
</span><span class="identifier">arg3</span> <span class="comment">// three-or-more argument function that returns its third argument
</span></pre>
<p>
- <tt class="computeroutput"><span class="identifier">argN</span></tt> returns the Nth argument.
+ <code class="computeroutput"><span class="identifier">argN</span></code> returns the Nth argument.
Examples:
</p>
-<pre class="programlisting">
-<span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
+<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">i</span> <span class="special">=</span> <span class="number">3</span><span class="special">;</span>
<span class="keyword">char</span> <span class="keyword">const</span><span class="special">*</span> <span class="identifier">s</span> <span class="special">=</span> <span class="string">"Hello World"</span><span class="special">;</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg1</span><span class="special">(</span><span class="identifier">i</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints 3
</span><span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg2</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)</span> <span class="special"><<</span> <span class="identifier">endl</span><span class="special">;</span> <span class="comment">// prints "Hello World"
@@ -216,61 +219,65 @@
<p>
(See arguments.cpp)
</p>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about arguments here.
- </p></div>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about arguments <a class="link" href="primitives.html#phoenix.primitives.arguments" title="Arguments">here.</a>
+ </p>
+</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.composites"></a>Composites</h3></div></div></div>
+<a name="phoenix.starter_kit.composites"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.composites" title="Composites">Composites</a>
+</h3></div></div></div>
<p>
- What we have seen so far, are what are called <span class="bold"><b>primitives</b></span>.
+ What we have seen so far, are what are called <span class="bold"><strong>primitives</strong></span>.
You can think of primitives (such as values, references and arguments) as
atoms.
</p>
<p>
Things start to get interesting when we start <span class="emphasis"><em>composing</em></span>
- primitives to form <span class="bold"><b>composites</b></span>. The composites
+ primitives to form <span class="bold"><strong>composites</strong></span>. The composites
can, in turn, be composed to form even more complex composites.
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_operators"></a>Lazy Operators</h3></div></div></div>
+<a name="phoenix.starter_kit.lazy_operators"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.lazy_operators" title="Lazy Operators">Lazy Operators</a>
+</h3></div></div></div>
<p>
You can use the usual set of operators to form composites. Examples:
</p>
-<pre class="programlisting">
-<span class="identifier">arg1</span> <span class="special">*</span> <span class="identifier">arg1</span>
+<pre class="programlisting"><span class="identifier">arg1</span> <span class="special">*</span> <span class="identifier">arg1</span>
<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">arg1</span> <span class="special">+</span> <span class="identifier">ref</span><span class="special">(</span><span class="identifier">z</span><span class="special">)</span>
<span class="identifier">arg1</span> <span class="special">=</span> <span class="identifier">arg2</span> <span class="special">+</span> <span class="special">(</span><span class="number">3</span> <span class="special">*</span> <span class="identifier">arg3</span><span class="special">)</span>
<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="identifier">arg1</span><span class="special">[</span><span class="identifier">arg2</span><span class="special">]</span> <span class="comment">// assuming arg1 is indexable and arg2 is a valid index
</span></pre>
<p>
- Note the expression: <tt class="computeroutput"><span class="number">3</span> <span class="special">*</span>
- <span class="identifier">arg3</span></tt>. This expression is actually
- a short-hand equivalent to: <tt class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
- <span class="special">*</span> <span class="identifier">arg3</span></tt>.
+ Note the expression: <code class="computeroutput"><span class="number">3</span> <span class="special">*</span>
+ <span class="identifier">arg3</span></code>. This expression is actually
+ a short-hand equivalent to: <code class="computeroutput"><span class="identifier">val</span><span class="special">(</span><span class="number">3</span><span class="special">)</span>
+ <span class="special">*</span> <span class="identifier">arg3</span></code>.
In most cases, like above, you can get away with it. But in some cases, you
- will have to explicitly wrap your values in <tt class="computeroutput"><span class="identifier">val</span></tt>.
+ will have to explicitly wrap your values in <code class="computeroutput"><span class="identifier">val</span></code>.
Rules of thumb:
</p>
-<div class="itemizedlist"><ul type="disc">
-<li>
- In a binary expression (e.g. <tt class="computeroutput"><span class="number">3</span> <span class="special">*</span> <span class="identifier">arg3</span></tt>),
- at least one of the operands must be a phoenix primitive or composite.
- </li>
-<li>
- In a unary expression (e.g. <tt class="computeroutput"><span class="identifier">arg1</span><span class="special">++</span></tt>), the single operand must be a phoenix
- primitive or composite.
- </li>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ In a binary expression (e.g. <code class="computeroutput"><span class="number">3</span>
+ <span class="special">*</span> <span class="identifier">arg3</span></code>),
+ at least one of the operands must be a phoenix primitive or composite.
+ </li>
+<li class="listitem">
+ In a unary expression (e.g. <code class="computeroutput"><span class="identifier">arg1</span><span class="special">++</span></code>), the single operand must be a phoenix
+ primitive or composite.
+ </li>
</ul></div>
<p>
If these basic rules are not followed, the result is either in error, or
is immediately evaluated. Some examples:
</p>
-<pre class="programlisting">
-<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="number">123</span> <span class="comment">// lazy
+<pre class="programlisting"><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">=</span> <span class="number">123</span> <span class="comment">// lazy
</span><span class="identifier">x</span> <span class="special">=</span> <span class="number">123</span> <span class="comment">// immediate
</span>
<span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">)[</span><span class="number">0</span><span class="special">]</span> <span class="comment">// lazy
@@ -281,78 +288,80 @@
</span><span class="identifier">x</span><span class="special">[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)]</span> <span class="comment">// illegal (x is not a phoenix primitive or composite)
</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">x</span><span class="special">[</span><span class="identifier">ref</span><span class="special">(</span><span class="identifier">i</span><span class="special">)])</span> <span class="comment">// illegal (x is not a phoenix primitive or composite)
</span></pre>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about operators here.
- </p></div>
-<a name="phoenix.starter_kit.lazy_operators.first_practical_example"></a><h2>
-<a name="id457702"></a>
- <a href="starter_kit.html#phoenix.starter_kit.lazy_operators.first_practical_example">First
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about operators <a class="link" href="composite.html#phoenix.composite.operator" title="Operator">here.</a>
+ </p>
+</div>
+<a name="phoenix.starter_kit.lazy_operators.first_practical_example"></a><h3>
+<a name="id761945"></a>
+ <a class="link" href="starter_kit.html#phoenix.starter_kit.lazy_operators.first_practical_example">First
Practical Example</a>
- </h2>
+ </h3>
<p>
We've covered enough ground to present a real world example. We want to find
the first odd number in an STL container. Normally we use a functor (function
- object) or a function pointer and pass that in to STL's <tt class="computeroutput"><span class="identifier">find_if</span></tt>
+ object) or a function pointer and pass that in to STL's <code class="computeroutput"><span class="identifier">find_if</span></code>
generic function:
</p>
<p>
Write a function:
</p>
-<pre class="programlisting">
-<span class="keyword">bool</span>
+<pre class="programlisting"><span class="keyword">bool</span>
<span class="identifier">is_odd</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">arg1</span><span class="special">)</span>
<span class="special">{</span>
<span class="keyword">return</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span>
<span class="special">}</span>
</pre>
<p>
- Pass a pointer to the function to STL's <tt class="computeroutput"><span class="identifier">find_if</span></tt>
+ Pass a pointer to the function to STL's <code class="computeroutput"><span class="identifier">find_if</span></code>
algorithm:
</p>
-<pre class="programlisting">
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="special">&</span><span class="identifier">is_odd</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="special">&</span><span class="identifier">is_odd</span><span class="special">)</span>
</pre>
<p>
Using Phoenix, the same can be achieved directly with a one-liner:
</p>
-<pre class="programlisting">
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">arg1</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">)</span>
</pre>
<p>
- The expression <tt class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
- <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></tt> automagically creates a functor with the
+ The expression <code class="computeroutput"><span class="identifier">arg1</span> <span class="special">%</span>
+ <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> automagically creates a functor with the
expected behavior. In FP, this unnamed function is called a lambda function.
Unlike the function pointer version, which is monomorphic (expects and works
only with a fixed type int argument), the Phoenix version is fully polymorphic
and works with any container (of ints, of longs, of bignum, etc.) as long
- as its elements can handle the <tt class="computeroutput"><span class="identifier">arg1</span>
- <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></tt> expression.
+ as its elements can handle the <code class="computeroutput"><span class="identifier">arg1</span>
+ <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span></code> expression.
</p>
<p>
(See find_if.cpp)
</p>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> ...<span class="bold"><b>That's it, we're done</b></span>.
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> ...<span class="bold"><strong>That's it, we're done</strong></span>.
Well if you wish to know a little bit more, read on...
- </p></div>
+ </p>
+</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_statements"></a>Lazy Statements</h3></div></div></div>
+<a name="phoenix.starter_kit.lazy_statements"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.lazy_statements" title="Lazy Statements">Lazy Statements</a>
+</h3></div></div></div>
<p>
Lazy statements? Sure. There are lazy versions of the C++ statements we all
know and love. For example:
</p>
-<pre class="programlisting">
-<span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">></span> <span class="number">5</span><span class="special">)</span>
+<pre class="programlisting"><span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">></span> <span class="number">5</span><span class="special">)</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg1</span>
</pre>
<p>
Say, for example, we wish to print all the elements that are greater than
5 (separated by a comma) in a vector. Here's how we write it:
</p>
-<pre class="programlisting">
-<span class="identifier">for_each</span><span class="special">(</span><span class="identifier">v</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">v</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
+<pre class="programlisting"><span class="identifier">for_each</span><span class="special">(</span><span class="identifier">v</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">v</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span>
<span class="identifier">if_</span><span class="special">(</span><span class="identifier">arg1</span> <span class="special">></span> <span class="number">5</span><span class="special">)</span>
<span class="special">[</span>
<span class="identifier">cout</span> <span class="special"><<</span> <span class="identifier">arg1</span> <span class="special"><<</span> <span class="string">", "</span>
@@ -362,43 +371,49 @@
<p>
(See if.cpp)
</p>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about statements here.
- </p></div>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about statements <a class="link" href="composite.html#phoenix.composite.statement" title="Statement">here.</a>
+ </p>
+</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.construct__new__delete__casts"></a><a href="starter_kit.html#phoenix.starter_kit.construct__new__delete__casts" title="Construct,
- New, Delete, Casts">Construct,
- New, Delete, Casts</a></h3></div></div></div>
+<a name="phoenix.starter_kit.construct__new__delete__casts"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.construct__new__delete__casts" title="Construct, New, Delete, Casts">Construct,
+ New, Delete, Casts</a>
+</h3></div></div></div>
<p>
You'll probably want to work with objects. There are lazy versions of constructor
- calls, <tt class="computeroutput"><span class="keyword">new</span></tt>, <tt class="computeroutput"><span class="keyword">delete</span></tt>
+ calls, <code class="computeroutput"><span class="keyword">new</span></code>, <code class="computeroutput"><span class="keyword">delete</span></code>
and the suite of C++ casts. Examples:
</p>
-<pre class="programlisting">
-<span class="identifier">construct</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// constructs a std::string from arg1, arg2
+<pre class="programlisting"><span class="identifier">construct</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// constructs a std::string from arg1, arg2
</span><span class="identifier">new_</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">>(</span><span class="identifier">arg1</span><span class="special">,</span> <span class="identifier">arg2</span><span class="special">)</span> <span class="comment">// makes a new std::string from arg1, arg2
</span><span class="identifier">delete_</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// deletes arg1 (assumed to be a pointer)
</span><span class="identifier">static_cast_</span><span class="special"><</span><span class="keyword">int</span><span class="special">*>(</span><span class="identifier">arg1</span><span class="special">)</span> <span class="comment">// static_cast's arg1 to an int*
</span></pre>
<div class="note"><table border="0" summary="Note">
<tr>
-<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/html/images/note.png"></td>
+<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td>
<th align="left">Note</th>
</tr>
-<tr><td colspan="2" align="left" valign="top"><p>
+<tr><td align="left" valign="top"><p>
Take note that, by convention, names that conflict with C++ reserved words
- are appended with a single trailing underscore <tt class="computeroutput"><span class="char">'_'</span></tt>
+ are appended with a single trailing underscore <code class="computeroutput"><span class="char">'_'</span></code>
</p></td></tr>
</table></div>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about this here.
- </p></div>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> Learn more about this <a class="link" href="composite.html#phoenix.composite.object" title="Object">here.</a>
+ </p>
+</div>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.lazy_functions"></a>Lazy Functions</h3></div></div></div>
+<a name="phoenix.starter_kit.lazy_functions"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.lazy_functions" title="Lazy Functions">Lazy Functions</a>
+</h3></div></div></div>
<p>
As you write more lambda functions, you'll notice certain patterns that you
wish to refactor as reusable functions. When you reach that point, you'll
@@ -408,11 +423,10 @@
</p>
<p>
Lazy functions are your friends. The library provides a facility to make
- lazy functions. The code below is a rewrite of the <tt class="computeroutput"><span class="identifier">is_odd</span></tt>
+ lazy functions. The code below is a rewrite of the <code class="computeroutput"><span class="identifier">is_odd</span></code>
function using the facility:
</p>
-<pre class="programlisting">
-<span class="keyword">struct</span> <span class="identifier">is_odd_impl</span>
+<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">is_odd_impl</span>
<span class="special">{</span>
<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Arg</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">result</span>
@@ -429,73 +443,76 @@
<span class="identifier">function</span><span class="special"><</span><span class="identifier">is_odd_impl</span><span class="special">></span> <span class="identifier">is_odd</span><span class="special">;</span>
</pre>
-<a name="phoenix.starter_kit.lazy_functions.things_to_note_"></a><h2>
-<a name="id459051"></a>
- <a href="starter_kit.html#phoenix.starter_kit.lazy_functions.things_to_note_">Things
+<a name="phoenix.starter_kit.lazy_functions.things_to_note_"></a><h3>
+<a name="id763023"></a>
+ <a class="link" href="starter_kit.html#phoenix.starter_kit.lazy_functions.things_to_note_">Things
to note:</a>
- </h2>
-<div class="itemizedlist"><ul type="disc">
-<li>
-<tt class="computeroutput"><span class="identifier">result</span></tt> is a nested metafunction
- that reflects the return type of the function (in this case, bool). This
- makes the function fully polymorphic: It can work with arbitrary <tt class="computeroutput"><span class="identifier">Arg</span></tt> types.
- </li>
-<li>
- There are as many Args in the <tt class="computeroutput"><span class="identifier">result</span></tt>
- metafunction as in the actual <tt class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></tt>.
- </li>
-<li>
-<tt class="computeroutput"><span class="identifier">is_odd_impl</span></tt> implements
- the function.
- </li>
-<li>
-<tt class="computeroutput"><span class="identifier">is_odd</span></tt>, an instance of
- <tt class="computeroutput"><span class="identifier">function</span><span class="special"><</span><span class="identifier">is_odd_impl</span><span class="special">></span></tt>,
- is the lazy function.
- </li>
+ </h3>
+<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">result</span></code> is a nested metafunction
+ that reflects the return type of the function (in this case, bool). This
+ makes the function fully polymorphic: It can work with arbitrary <code class="computeroutput"><span class="identifier">Arg</span></code> types.
+ </li>
+<li class="listitem">
+ There are as many Args in the <code class="computeroutput"><span class="identifier">result</span></code>
+ metafunction as in the actual <code class="computeroutput"><span class="keyword">operator</span><span class="special">()</span></code>.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">is_odd_impl</span></code> implements
+ the function.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">is_odd</span></code>, an instance of
+ <code class="computeroutput"><span class="identifier">function</span><span class="special"><</span><span class="identifier">is_odd_impl</span><span class="special">></span></code>,
+ is the lazy function.
+ </li>
</ul></div>
<p>
- Now, <tt class="computeroutput"><span class="identifier">is_odd</span></tt> is a truly lazy
+ Now, <code class="computeroutput"><span class="identifier">is_odd</span></code> is a truly lazy
function that we can use in conjunction with the rest of phoenix. Example:
</p>
-<pre class="programlisting">
-<span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">is_odd</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">));</span>
+<pre class="programlisting"><span class="identifier">find_if</span><span class="special">(</span><span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">is_odd</span><span class="special">(</span><span class="identifier">arg1</span><span class="special">));</span>
</pre>
<p>
(See function.cpp)
</p>
-<a name="phoenix.starter_kit.lazy_functions.predefined_lazy_functions"></a><h2>
-<a name="id459305"></a>
- <a href="starter_kit.html#phoenix.starter_kit.lazy_functions.predefined_lazy_functions">Predefined
+<a name="phoenix.starter_kit.lazy_functions.predefined_lazy_functions"></a><h3>
+<a name="id763234"></a>
+ <a class="link" href="starter_kit.html#phoenix.starter_kit.lazy_functions.predefined_lazy_functions">Predefined
Lazy Functions</a>
- </h2>
+ </h3>
<p>
The library is chock full of STL savvy, predefined lazy functions covering
the whole of the STL containers, iterators and algorithms. For example, there
are lazy versions of container related operations such as assign, at, back,
- begin, pop_back, pop_front, push_back, push_front, etc. (See Container).
+ begin, pop_back, pop_front, push_back, push_front, etc. (See <a class="link" href="container.html" title="Container">Container</a>).
</p>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
-<a name="phoenix.starter_kit.more"></a>More</h3></div></div></div>
+<a name="phoenix.starter_kit.more"></a><a class="link" href="starter_kit.html#phoenix.starter_kit.more" title="More">More</a>
+</h3></div></div></div>
<p>
As mentioned earlier, this chapter is not a thorough discourse of the library.
It is meant only to cover enough ground to get you into high gear as quickly
- as possible. Some advanced stuff is not discussed here (e.g. Scopes);
+ as possible. Some advanced stuff is not discussed here (e.g. <a class="link" href="composite.html#phoenix.composite.scope" title="Scope">Scopes</a>);
nor are features that provide alternative (short-hand) ways to do the same
- things (e.g. Bind vs. Lazy
+ things (e.g. <a class="link" href="composite.html#phoenix.composite.bind" title="Bind">Bind</a> vs. Lazy
Functions).
</p>
-<div class="sidebar"><p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> ...<span class="bold"><b>If you still wish to learn
- more, the read on...</b></span>
- </p></div>
+<div class="sidebar">
+<p class="title"><b></b></p>
+<p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span> ...<span class="bold"><strong>If you still wish to learn
+ more, the read on...</strong></span>
+ </p>
+</div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -504,7 +521,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="basics.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="introduction.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="basics.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/phoenix/doc/html/phoenix/wrap_up.html (original)
+++ branches/release/libs/spirit/phoenix/doc/html/phoenix/wrap_up.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1,11 +1,11 @@
<html>
<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Wrap Up</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.66.1">
-<link rel="start" href="../index.html" title="Chapter 1. Phoenix 2.0">
-<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
+<link rel="home" href="../index.html" title="Chapter 1. Phoenix 2.0">
+<link rel="up" href="../index.html" title="Chapter 1. Phoenix 2.0">
<link rel="prev" href="inside_phoenix.html" title="Inside Phoenix">
<link rel="next" href="acknowledgement.html" title="Acknowledgement">
</head>
@@ -13,18 +13,19 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="inside_phoenix.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgement.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inside_phoenix.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" lang="en">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
-<a name="phoenix.wrap_up"></a>Wrap Up</h2></div></div></div>
+<a name="phoenix.wrap_up"></a><a class="link" href="wrap_up.html" title="Wrap Up">Wrap Up</a>
+</h2></div></div></div>
<p>
Sooner or later more FP techniques become standard practice as people find
the true value of this programming discipline outside the academe and into
@@ -37,21 +38,15 @@
<p>
Let me quote Doug Gregor of Boost.org. About functional style programming libraries:
</p>
-<div class="blockquote"><blockquote class="blockquote">
-<p>
- </p>
-<p>
- <span class="emphasis"><em>They're gaining acceptance, but are somewhat stunted by the ubiquitousness
- of broken compilers. The C++ community is moving deeper into the so-called
- "STL- style" programming paradigm, which brings many aspects
- of functional programming into the fold. Look at, for instance, the Spirit
- parser to see how such function objects can be used to build Yacc-like
- grammars with semantic actions that can build abstract syntax trees on
- the fly. This type of functional composition is gaining momentum.</em></span>
- </p>
-<p>
- </p>
-</blockquote></div>
+<div class="blockquote"><blockquote class="blockquote"><p>
+ <span class="emphasis"><em>They're gaining acceptance, but are somewhat stunted by the ubiquitousness
+ of broken compilers. The C++ community is moving deeper into the so-called
+ "STL- style" programming paradigm, which brings many aspects of
+ functional programming into the fold. Look at, for instance, the Spirit parser
+ to see how such function objects can be used to build Yacc-like grammars
+ with semantic actions that can build abstract syntax trees on the fly. This
+ type of functional composition is gaining momentum.</em></span>
+ </p></blockquote></div>
<p>
Indeed. Phoenix is another attempt to introduce more FP techniques into the
mainstream. Not only is it a tool that will make life easier for the programmer.
@@ -67,7 +62,7 @@
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
-<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
+<td align="right"><div class="copyright-footer">Copyright © 2002-2005 Joel
de Guzman, Dan Marsden<p>
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)
@@ -76,7 +71,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="inside_phoenix.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgement.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="inside_phoenix.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="acknowledgement.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/index.html (original)
+++ branches/release/libs/spirit/repository/doc/html/index.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Spirit Repository 0.1</title>
-<link rel="stylesheet" href="../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="index.html" title="Spirit Repository 0.1">
<link rel="next" href="spirit_repository/preface.html" title="Preface">
</head>
@@ -11,14 +11,14 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="spirit_repository/preface.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a></div>
-<div class="article" title="Spirit Repository 0.1">
+<div class="spirit-nav"><a accesskey="n" href="spirit_repository/preface.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
+<div class="article">
<div class="titlepage">
<div>
<div><h2 class="title">
@@ -32,8 +32,8 @@
</h3></div>
</div></div>
<div><p class="copyright">Copyright © 2001-2010 Joel de Guzman, Hartmut Kaiser</p></div>
-<div><div class="legalnotice" title="Legal Notice">
-<a name="id619442"></a><p>
+<div><div class="legalnotice">
+<a name="id759740"></a><p>
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)
</p>
@@ -79,10 +79,10 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: December 30, 2009 at 16:13:16 GMT</small></p></td>
+<td align="left"><p><small>Last revised: July 19, 2010 at 19:04:13 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
-<div class="spirit-nav"><a accesskey="n" href="spirit_repository/preface.html"><img src="../../../../../doc/html/images/next.png" alt="Next"></a></div>
+<div class="spirit-nav"><a accesskey="n" href="spirit_repository/preface.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a></div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Karma Components</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../index.html" title="Spirit Repository 0.1">
<link rel="prev" href="qi_components/nonterminal/subrule.html" title="Qi subrules">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="qi_components/nonterminal/subrule.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="karma_components/directives.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="qi_components/nonterminal/subrule.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="karma_components/directives.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Karma Components">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="spirit_repository.karma_components"></a><a class="link" href="karma_components.html" title="Karma Components">Karma Components</a>
</h2></div></div></div>
@@ -47,7 +47,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="qi_components/nonterminal/subrule.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="karma_components/directives.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="qi_components/nonterminal/subrule.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="karma_components/directives.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Karma Generator Directives</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../karma_components.html" title="Karma Components">
<link rel="prev" href="../karma_components.html" title="Karma Components">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../karma_components.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../karma_components.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Karma Generator Directives">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="spirit_repository.karma_components.directives"></a><a class="link" href="directives.html" title="Karma Generator Directives"> Karma
Generator Directives</a>
@@ -40,7 +40,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../karma_components.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../karma_components.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives/karma_confix_generator.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/directives/karma_confix_generator.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Karma Confix Generator</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../directives.html" title="Karma Generator Directives">
<link rel="prev" href="../directives.html" title="Karma Generator Directives">
@@ -13,22 +13,22 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Karma Confix Generator">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="spirit_repository.karma_components.directives.karma_confix_generator"></a><a class="link" href="karma_confix_generator.html" title="Karma Confix Generator">Karma
Confix Generator</a>
</h4></div></div></div>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.description"></a><h6>
-<a name="id635192"></a>
+<a name="id771856"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.description">Description</a>
</h6>
<p>
@@ -93,20 +93,20 @@
tag using a simple: <code class="computeroutput"><span class="identifier">ol</span><span class="special">[</span><span class="string">"Some text"</span><span class="special">]</span></code> (which results in <code class="computeroutput"><span class="special"><</span><span class="identifier">ol</span><span class="special">></span><span class="identifier">Some</span> <span class="identifier">text</span><span class="special"></</span><span class="identifier">ol</span><span class="special">></span></code>).
</p>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.header"></a><h6>
-<a name="id636089"></a>
+<a name="id772961"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.header">Header</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/repository/home/karma/directive/confix.hpp>
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">karma_confix</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.synopsis"></a><h6>
-<a name="id636162"></a>
+<a name="id773061"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><span class="identifier">confix</span><span class="special">(</span><span class="identifier">prefix</span><span class="special">,</span> <span class="identifier">suffix</span><span class="special">)[</span><span class="identifier">subject</span><span class="special">]</span>
</pre>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.parameters"></a><h6>
-<a name="id636210"></a>
+<a name="id773128"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.parameters">Parameters</a>
</h6>
<div class="informaltable"><table class="table">
@@ -116,57 +116,57 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Parameter
- </p>
+ <p>
+ Parameter
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">prefix</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">prefix</span></code>
+ </p>
</td>
<td>
- <p>
- The generator construct to use to format the opening (the prefix).
- The prefix is the part generated <span class="emphasis"><em>before</em></span> any
- output as generated by the <code class="computeroutput"><span class="identifier">subject</span></code>.
- </p>
+ <p>
+ The generator construct to use to format the opening (the prefix).
+ The prefix is the part generated <span class="emphasis"><em>before</em></span>
+ any output as generated by the <code class="computeroutput"><span class="identifier">subject</span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">suffix</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">suffix</span></code>
+ </p>
</td>
<td>
- <p>
- The generator construct to use to format the ending (the suffix).
- The suffix is the part generated <span class="emphasis"><em>after</em></span> any
- output as generated by the <code class="computeroutput"><span class="identifier">subject</span></code>.
- </p>
+ <p>
+ The generator construct to use to format the ending (the suffix).
+ The suffix is the part generated <span class="emphasis"><em>after</em></span> any
+ output as generated by the <code class="computeroutput"><span class="identifier">subject</span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">subject</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">subject</span></code>
+ </p>
</td>
<td>
- <p>
- The generator construct to use to format the actual output in between
- the <code class="computeroutput"><span class="identifier">prefix</span></code> and
- <code class="computeroutput"><span class="identifier">suffix</span></code> parts.
- </p>
+ <p>
+ The generator construct to use to format the actual output in
+ between the <code class="computeroutput"><span class="identifier">prefix</span></code>
+ and <code class="computeroutput"><span class="identifier">suffix</span></code> parts.
+ </p>
</td>
</tr>
</tbody>
@@ -175,7 +175,7 @@
All three parameters can be arbitrary complex generators themselves.
</p>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.attribute"></a><h6>
-<a name="id636368"></a>
+<a name="id773327"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.attribute">Attribute</a>
</h6>
<p>
@@ -187,7 +187,7 @@
</p>
<pre class="programlisting"><span class="identifier">a</span><span class="special">:</span> <span class="identifier">A</span> <span class="special">--></span> <span class="identifier">confix</span><span class="special">(</span><span class="identifier">p</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)[</span><span class="identifier">a</span><span class="special">]:</span> <span class="identifier">A</span>
</pre>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../images/note.png"></td>
<th align="left">Note</th>
@@ -202,7 +202,7 @@
</p></td></tr>
</table></div>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.example"></a><h6>
-<a name="id636544"></a>
+<a name="id773559"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.example">Example</a>
</h6>
<p>
@@ -211,7 +211,7 @@
styles and a function prototype (for the full example code see here: confix.cpp)
</p>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.prerequisites"></a><h6>
-<a name="id636574"></a>
+<a name="id773606"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.prerequisites">Prerequisites</a>
</h6>
<p>
@@ -221,35 +221,27 @@
generator.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">karma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">karma_confix</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
To make all the code below more readable we introduce the following namespaces.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">ascii</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">repository</span><span class="special">::</span><span class="identifier">confix</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.generating_different_comment_styles"></a><h6>
-<a name="id636817"></a>
+<a name="id773903"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.generating_different_comment_styles">Generating
Different Comment Styles</a>
</h6>
@@ -258,9 +250,7 @@
a C++ comment:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// C++ comment
</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span>
@@ -271,8 +261,6 @@
</span> <span class="special">)</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
This code snippet will obviouly generate <code class="computeroutput"><span class="comment">//
@@ -280,9 +268,7 @@
comment proves to be straightforward:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// C comment
</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span> <span class="special"><<</span>
@@ -293,15 +279,13 @@
</span> <span class="special">)</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
which again will generate <code class="computeroutput"><span class="comment">/* This is a comment
*/</span> </code>.
</p>
<a name="spirit_repository.karma_components.directives.karma_confix_generator.generating_a_function_prototype"></a><h6>
-<a name="id638757"></a>
+<a name="id774271"></a>
<a class="link" href="karma_confix_generator.html#spirit_repository.karma_components.directives.karma_confix_generator.generating_a_function_prototype">Generating
a Function Prototype</a>
</h6>
@@ -310,9 +294,7 @@
names is simple as well:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="comment">// Generate a function call with an arbitrary parameter list
</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">></span> <span class="identifier">parameters</span><span class="special">;</span>
@@ -328,8 +310,6 @@
</span> <span class="special">)</span> <span class="special"><<</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">endl</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
which generates the expected output: <code class="computeroutput"><span class="identifier">func</span><span class="special">(</span><span class="identifier">par1</span><span class="special">,</span><span class="identifier">par2</span><span class="special">,</span><span class="identifier">par3</span><span class="special">)</span></code>.
@@ -345,7 +325,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Karma Generator Non-terminals</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../karma_components.html" title="Karma Components">
<link rel="prev" href="directives/karma_confix_generator.html" title="Karma Confix Generator">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Karma Generator Non-terminals">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="spirit_repository.karma_components.nonterminal"></a><a class="link" href="nonterminal.html" title="Karma Generator Non-terminals"> Karma
Generator Non-terminals</a>
@@ -40,7 +40,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="directives/karma_confix_generator.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../karma_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal/subrule.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/karma_components/nonterminal/subrule.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Karma subrules</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../nonterminal.html" title="Karma Generator Non-terminals">
<link rel="prev" href="../nonterminal.html" title="Karma Generator Non-terminals">
@@ -12,22 +12,22 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section" title="Karma subrules">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="spirit_repository.karma_components.nonterminal.subrule"></a><a class="link" href="subrule.html" title="Karma subrules">
Karma subrules</a>
</h4></div></div></div>
<a name="spirit_repository.karma_components.nonterminal.subrule.description"></a><h6>
-<a name="id639090"></a>
+<a name="id774685"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.description">Description</a>
</h6>
<p>
@@ -49,20 +49,18 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- subrules can only be defined and used within the same generator expression.
- A subrule cannot be defined at one location, and then used in another
- location.
- </li>
+ subrules can only be defined and used within the same generator expression.
+ A subrule cannot be defined at one location, and then used in another
+ location.
+ </li>
<li class="listitem">
- subrules put a massive strain on the C++ compiler. They increase compile
- times and memory usage during compilation, and also increase the risk
- of hitting compiler limits and/or bugs.
- </li>
+ subrules put a massive strain on the C++ compiler. They increase compile
+ times and memory usage during compilation, and also increase the risk
+ of hitting compiler limits and/or bugs.
+ </li>
</ul></div>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">entry</span> <span class="special">%=</span> <span class="special">(</span>
<span class="identifier">ast_node</span> <span class="special">%=</span> <span class="identifier">int_</span> <span class="special">|</span> <span class="identifier">binary_node</span> <span class="special">|</span> <span class="identifier">unary_node</span>
@@ -73,8 +71,6 @@
<span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The example above can be found here: ../../example/karma/calc2_ast_dump_sr.cpp
@@ -89,21 +85,21 @@
parts), whereas the rest can use rules and grammars.
</p>
<a name="spirit_repository.karma_components.nonterminal.subrule.header"></a><h6>
-<a name="id639352"></a>
+<a name="id775027"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.header">Header</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/repository/home/karma/nonterminal/subrule.hpp>
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">karma_subrule</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="spirit_repository.karma_components.nonterminal.subrule.synopsis__declaration_"></a><h6>
-<a name="id639428"></a>
+<a name="id775127"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.synopsis__declaration_">Synopsis
(declaration)</a>
</h6>
<pre class="programlisting"><span class="identifier">subrule</span><span class="special"><</span><span class="identifier">ID</span><span class="special">,</span> <span class="identifier">A1</span><span class="special">,</span> <span class="identifier">A2</span><span class="special">></span> <span class="identifier">sr</span><span class="special">(</span><span class="identifier">name</span><span class="special">);</span>
</pre>
<a name="spirit_repository.karma_components.nonterminal.subrule.parameters__declaration_"></a><h6>
-<a name="id639493"></a>
+<a name="id775212"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.parameters__declaration_">Parameters
(declaration)</a>
</h6>
@@ -114,66 +110,66 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Parameter
- </p>
+ <p>
+ Parameter
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">ID</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">ID</span></code>
+ </p>
</td>
<td>
- <p>
- Required numeric argument. Gives the subrule a unique 'identification
- tag'.
- </p>
+ <p>
+ Required numeric argument. Gives the subrule a unique 'identification
+ tag'.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">A1</span></code>, <code class="computeroutput"><span class="identifier">A2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">A1</span></code>, <code class="computeroutput"><span class="identifier">A2</span></code>
+ </p>
</td>
<td>
- <p>
- Optional types, can be specified in any order. Can be one of 1.
- signature, 2. locals (see rules reference for more information
- on those parameters).
- </p>
- <p>
- Note that the delimiter type need not be specified in the parameters,
- unlike with grammars and rules. Subrules will automatically use
- the delimiter type which is in effect when they are invoked.
- </p>
+ <p>
+ Optional types, can be specified in any order. Can be one of
+ 1. signature, 2. locals (see rules reference for more information
+ on those parameters).
+ </p>
+ <p>
+ Note that the delimiter type need not be specified in the parameters,
+ unlike with grammars and rules. Subrules will automatically use
+ the delimiter type which is in effect when they are invoked.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">name</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">name</span></code>
+ </p>
</td>
<td>
- <p>
- Optional string. Gives the subrule a name, useful for debugging
- and error handling.
- </p>
+ <p>
+ Optional string. Gives the subrule a name, useful for debugging
+ and error handling.
+ </p>
</td>
</tr>
</tbody>
</table></div>
<a name="spirit_repository.karma_components.nonterminal.subrule.synopsis__usage_"></a><h6>
-<a name="id639622"></a>
+<a name="id775374"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.synopsis__usage_">Synopsis
(usage)</a>
</h6>
@@ -202,7 +198,7 @@
<span class="special">)(</span><span class="identifier">a1</span><span class="special">,</span> <span class="identifier">a2</span><span class="special">,</span> <span class="special">...)</span> <span class="comment">// Arguments to group, i.e. to start subrule srA
</span></pre>
<a name="spirit_repository.karma_components.nonterminal.subrule.parameters__usage_"></a><h6>
-<a name="id639858"></a>
+<a name="id775661"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.parameters__usage_">Parameters
(usage)</a>
</h6>
@@ -213,120 +209,120 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Parameter
- </p>
+ <p>
+ Parameter
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">sr1</span></code>, <code class="computeroutput"><span class="identifier">sr2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">sr1</span></code>, <code class="computeroutput"><span class="identifier">sr2</span></code>
+ </p>
</td>
<td>
- <p>
- Subrules with different IDs.
- </p>
+ <p>
+ Subrules with different IDs.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">expr1</span></code>, <code class="computeroutput"><span class="identifier">expr2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">expr1</span></code>, <code class="computeroutput"><span class="identifier">expr2</span></code>
+ </p>
</td>
<td>
- <p>
- Generator expressions. Can include <code class="computeroutput"><span class="identifier">sr1</span></code>
- and <code class="computeroutput"><span class="identifier">sr2</span></code>, as well
- as any other valid generator expressions.
- </p>
+ <p>
+ Generator expressions. Can include <code class="computeroutput"><span class="identifier">sr1</span></code>
+ and <code class="computeroutput"><span class="identifier">sr2</span></code>, as well
+ as any other valid generator expressions.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">srA</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">srA</span></code>
+ </p>
</td>
<td>
- <p>
- Subrule with a synthesized attribute and inherited attributes.
- </p>
+ <p>
+ Subrule with a synthesized attribute and inherited attributes.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">srB</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">srB</span></code>
+ </p>
</td>
<td>
- <p>
- Subrule with a synthesized attribute.
- </p>
+ <p>
+ Subrule with a synthesized attribute.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">srC</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">srC</span></code>
+ </p>
</td>
<td>
- <p>
- Subrule with inherited attributes.
- </p>
+ <p>
+ Subrule with inherited attributes.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">exprA</span></code>, <code class="computeroutput"><span class="identifier">exprB</span></code>, <code class="computeroutput"><span class="identifier">exprC</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">exprA</span></code>, <code class="computeroutput"><span class="identifier">exprB</span></code>, <code class="computeroutput"><span class="identifier">exprC</span></code>
+ </p>
</td>
<td>
- <p>
- Generator expressions.
- </p>
+ <p>
+ Generator expressions.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">a1</span></code>, <code class="computeroutput"><span class="identifier">a2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">a1</span></code>, <code class="computeroutput"><span class="identifier">a2</span></code>
+ </p>
</td>
<td>
- <p>
- Arguments passed to the subrule group. They are passed as inherited
- attributes to the group's start subrule, <code class="computeroutput"><span class="identifier">srA</span></code>.
- </p>
+ <p>
+ Arguments passed to the subrule group. They are passed as inherited
+ attributes to the group's start subrule, <code class="computeroutput"><span class="identifier">srA</span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">c1</span></code>, <code class="computeroutput"><span class="identifier">c2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">c1</span></code>, <code class="computeroutput"><span class="identifier">c2</span></code>
+ </p>
</td>
<td>
- <p>
- Arguments passed as inherited attributes to subrule <code class="computeroutput"><span class="identifier">srC</span></code>.
- </p>
+ <p>
+ Arguments passed as inherited attributes to subrule <code class="computeroutput"><span class="identifier">srC</span></code>.
+ </p>
</td>
</tr>
</tbody>
</table></div>
<a name="spirit_repository.karma_components.nonterminal.subrule.groups"></a><h6>
-<a name="id640172"></a>
+<a name="id776039"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.groups">Groups</a>
</h6>
<p>
@@ -371,7 +367,7 @@
</span><span class="special">;</span>
</pre>
<a name="spirit_repository.karma_components.nonterminal.subrule.attributes"></a><h6>
-<a name="id640566"></a>
+<a name="id776523"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.attributes">Attributes</a>
</h6>
<p>
@@ -380,27 +376,27 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- the type of its synthesized attribute is the one specified in the subrule's
- signature, if any. Otherwise it is <code class="computeroutput"><span class="identifier">unused_type</span></code>.
- </li>
+ the type of its synthesized attribute is the one specified in the subrule's
+ signature, if any. Otherwise it is <code class="computeroutput"><span class="identifier">unused_type</span></code>.
+ </li>
<li class="listitem">
- the types of its inherited attributes are the ones specified in the subrule's
- signature, if any. Otherwise the subrule has no inherited attributes.
- </li>
+ the types of its inherited attributes are the ones specified in the
+ subrule's signature, if any. Otherwise the subrule has no inherited
+ attributes.
+ </li>
<li class="listitem">
- an auto-subrule can be defined by assigning it with the <code class="computeroutput"><span class="special">%=</span></code> syntax. In this case, the subrule's
- synthesized attribute is automatically propagated to the RHS generator's
- attribute.
- </li>
+ an auto-subrule can be defined by assigning it with the <code class="computeroutput"><span class="special">%=</span></code> syntax. In this case, the subrule's
+ synthesized attribute is automatically propagated to the RHS generator's
+ attribute.
+ </li>
<li class="listitem">
- the Phoenix placeholders <code class="computeroutput"><span class="identifier">_val</span></code>,
- <code class="computeroutput"><span class="identifier">_r1</span></code>, <code class="computeroutput"><span class="identifier">_r2</span></code>,
- ... are available to refer to the subrule's synthesized and inherited
- attributes, if present.
- </li>
+ the Phoenix placeholders <code class="computeroutput"><span class="identifier">_val</span></code>,
+ <code class="computeroutput"><span class="identifier">_r1</span></code>, <code class="computeroutput"><span class="identifier">_r2</span></code>, ... are available to refer to
+ the subrule's synthesized and inherited attributes, if present.
+ </li>
</ul></div>
<a name="spirit_repository.karma_components.nonterminal.subrule.locals"></a><h6>
-<a name="id640639"></a>
+<a name="id776641"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.locals">Locals</a>
</h6>
<p>
@@ -410,16 +406,14 @@
refer to the subrule's locals, if present.
</p>
<a name="spirit_repository.karma_components.nonterminal.subrule.example"></a><h6>
-<a name="id640675"></a>
+<a name="id776689"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.example">Example</a>
</h6>
<p>
Some includes:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">karma</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">karma_subrule</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -428,32 +422,24 @@
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">phoenix_fusion</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Some using declarations:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">ascii</span><span class="special">;</span>
<span class="keyword">namespace</span> <span class="identifier">repo</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">repository</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
A grammar containing only one rule, defined with a group of 2 subrules:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">mini_xml_generator</span>
@@ -478,8 +464,6 @@
<span class="special">};</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The definitions of the <code class="computeroutput"><span class="identifier">mini_xml</span></code>
@@ -488,7 +472,7 @@
<a href="../../../../../example/karma/mini_xml_karma_sr.cpp" target="_top">../../example/karma/mini_xml_karma_sr.cpp</a>
</p>
<a name="spirit_repository.karma_components.nonterminal.subrule.performance"></a><h6>
-<a name="id642253"></a>
+<a name="id777754"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.performance">Performance</a>
</h6>
<p>
@@ -499,7 +483,7 @@
subrules is very similar, so performance is very similar too).
</p>
<a name="spirit_repository.karma_components.nonterminal.subrule.notes"></a><h6>
-<a name="id642290"></a>
+<a name="id777801"></a>
<a class="link" href="subrule.html#spirit_repository.karma_components.nonterminal.subrule.notes">Notes</a>
</h6>
<p>
@@ -523,7 +507,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a>
+<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/preface.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/preface.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Preface</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../index.html" title="Spirit Repository 0.1">
<link rel="prev" href="../index.html" title="Spirit Repository 0.1">
@@ -13,21 +13,21 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Preface">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="spirit_repository.preface"></a><a class="link" href="preface.html" title="Preface">Preface</a>
</h2></div></div></div>
<a name="spirit_repository.preface.the_spirit_repository"></a><h4>
-<a name="id619472"></a>
+<a name="id759774"></a>
<a class="link" href="preface.html#spirit_repository.preface.the_spirit_repository">The Spirit
Repository</a>
</h4>
@@ -77,7 +77,7 @@
core library.
</p>
<a name="spirit_repository.preface.how_to_use_this_manual"></a><h4>
-<a name="id619560"></a>
+<a name="id759903"></a>
<a class="link" href="preface.html#spirit_repository.preface.how_to_use_this_manual">How to use
this manual</a>
</h4>
@@ -86,7 +86,7 @@
icons precede some text to indicate:
</p>
<div class="table">
-<a name="id619574"></a><p class="title"><b>Table 1. Icons</b></p>
+<a name="id759921"></a><p class="title"><b>Table 1. Icons</b></p>
<div class="table-contents"><table class="table" summary="Icons">
<colgroup>
<col>
@@ -95,108 +95,109 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Icon
- </p>
- </th>
+ <p>
+ Icon
+ </p>
+ </th>
<th>
- <p>
- Name
- </p>
- </th>
+ <p>
+ Name
+ </p>
+ </th>
<th>
- <p>
- Meaning
- </p>
- </th>
+ <p>
+ Meaning
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span>
- </p>
- </td>
-<td>
- <p>
- Note
- </p>
- </td>
-<td>
- <p>
- Generally useful information (an aside that doesn't fit in the flow of
- the text)
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="../images/note.png" alt="note"></span>
+ </p>
+ </td>
+<td>
+ <p>
+ Note
+ </p>
+ </td>
+<td>
+ <p>
+ Generally useful information (an aside that doesn't fit in the flow
+ of the text)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span>
- </p>
- </td>
-<td>
- <p>
- Tip
- </p>
- </td>
-<td>
- <p>
- Suggestion on how to do something (especially something that not be obvious)
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="../images/tip.png" alt="tip"></span>
+ </p>
+ </td>
+<td>
+ <p>
+ Tip
+ </p>
+ </td>
+<td>
+ <p>
+ Suggestion on how to do something (especially something that not
+ be obvious)
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="../images/important.png" alt="important"></span>
- </p>
- </td>
-<td>
- <p>
- Important
- </p>
- </td>
-<td>
- <p>
- Important note on something to take particular notice of
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="../images/important.png" alt="important"></span>
+ </p>
+ </td>
+<td>
+ <p>
+ Important
+ </p>
+ </td>
+<td>
+ <p>
+ Important note on something to take particular notice of
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="../images/caution.png" alt="caution"></span>
- </p>
- </td>
-<td>
- <p>
- Caution
- </p>
- </td>
-<td>
- <p>
- Take special care with this - it may not be what you expect and may cause
- bad results
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="../images/caution.png" alt="caution"></span>
+ </p>
+ </td>
+<td>
+ <p>
+ Caution
+ </p>
+ </td>
+<td>
+ <p>
+ Take special care with this - it may not be what you expect and may
+ cause bad results
+ </p>
+ </td>
</tr>
<tr>
<td>
- <p>
- <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span>
- </p>
- </td>
-<td>
- <p>
- Danger
- </p>
- </td>
-<td>
- <p>
- This is likely to cause serious trouble if ignored
- </p>
- </td>
+ <p>
+ <span class="inlinemediaobject"><img src="../images/alert.png" alt="alert"></span>
+ </p>
+ </td>
+<td>
+ <p>
+ Danger
+ </p>
+ </td>
+<td>
+ <p>
+ This is likely to cause serious trouble if ignored
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
@@ -207,7 +208,7 @@
Tools</a>.
</p>
<a name="spirit_repository.preface.support"></a><h4>
-<a name="id619815"></a>
+<a name="id760179"></a>
<a class="link" href="preface.html#spirit_repository.preface.support">Support</a>
</h4>
<p>
@@ -231,7 +232,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../index.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../index.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi Components</title>
-<link rel="stylesheet" href="../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../index.html" title="Spirit Repository 0.1">
<link rel="prev" href="preface.html" title="Preface">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="preface.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components/primitive.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="preface.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components/primitive.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi Components">
+<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="spirit_repository.qi_components"></a><a class="link" href="qi_components.html" title="Qi Components">Qi Components</a>
</h2></div></div></div>
@@ -55,7 +55,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="preface.html"><img src="../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components/primitive.html"><img src="../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="preface.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="qi_components/primitive.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi Parser Directives</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../qi_components.html" title="Qi Components">
<link rel="prev" href="primitive/flush_multi_pass.html" title="Qi flush_multi_pass parser">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="directives/confix.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="directives/confix.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi Parser Directives">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="spirit_repository.qi_components.directives"></a><a class="link" href="directives.html" title="Qi Parser Directives"> Qi Parser
Directives</a>
@@ -44,7 +44,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="directives/confix.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="directives/confix.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/confix.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/confix.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi Confix Parser Directive</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../directives.html" title="Qi Parser Directives">
<link rel="prev" href="../directives.html" title="Qi Parser Directives">
@@ -13,22 +13,22 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="distinct.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="distinct.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi Confix Parser Directive">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="spirit_repository.qi_components.directives.confix"></a><a class="link" href="confix.html" title="Qi Confix Parser Directive">
Qi Confix Parser Directive</a>
</h4></div></div></div>
<a name="spirit_repository.qi_components.directives.confix.description"></a><h6>
-<a name="id623313"></a>
+<a name="id761680"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.description">Description</a>
</h6>
<p>
@@ -78,7 +78,7 @@
<pre class="programlisting"><span class="identifier">c_comment</span><span class="special">[*(</span><span class="identifier">char_</span> <span class="special">-</span> <span class="string">"*/"</span><span class="special">)]</span> <span class="comment">// C style comment
</span><span class="identifier">cpp_comment</span><span class="special">[*(</span><span class="identifier">char_</span> <span class="special">-</span> <span class="identifier">eol</span><span class="special">)]</span> <span class="comment">// C++ style comment
</span></pre>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../images/note.png"></td>
<th align="left">Note</th>
@@ -88,27 +88,27 @@
<span class="identifier">suffix</span><span class="special">)</span></code>
parser in <span class="emphasis"><em>Spirit.Classic</em></span> was equivalent to the sequence
<code class="computeroutput"><span class="identifier">prefix</span> <span class="special">>></span>
- <span class="special">(</span><span class="identifier">subject</span>
+ <span class="special">*(</span><span class="identifier">subject</span>
<span class="special">-</span> <span class="identifier">suffix</span><span class="special">)</span> <span class="special">>></span> <span class="identifier">suffix</span><span class="special">,</span> <span class="identifier">the</span> <span class="emphasis"><em>Spirit.Qi</em></span> </code>confix`
directive will not perform this refactoring any more. This simplifies
the code and makes things more explicit.
</p></td></tr>
</table></div>
<a name="spirit_repository.qi_components.directives.confix.header"></a><h6>
-<a name="id624081"></a>
+<a name="id762520"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.header">Header</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/repository/home/qi/directive/confix.hpp>
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_confix</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="spirit_repository.qi_components.directives.confix.synopsis"></a><h6>
-<a name="id624159"></a>
+<a name="id762608"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><span class="identifier">confix</span><span class="special">(</span><span class="identifier">prefix</span><span class="special">,</span> <span class="identifier">suffix</span><span class="special">)[</span><span class="identifier">subject</span><span class="special">]</span>
</pre>
<a name="spirit_repository.qi_components.directives.confix.parameters"></a><h6>
-<a name="id624212"></a>
+<a name="id762664"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.parameters">Parameters</a>
</h6>
<div class="informaltable"><table class="table">
@@ -118,52 +118,52 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Parameter
- </p>
+ <p>
+ Parameter
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">prefix</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">prefix</span></code>
+ </p>
</td>
<td>
- <p>
- The parser for the opening (the prefix).
- </p>
+ <p>
+ The parser for the opening (the prefix).
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">suffix</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">suffix</span></code>
+ </p>
</td>
<td>
- <p>
- The parser for the ending (the suffix).
- </p>
+ <p>
+ The parser for the ending (the suffix).
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">subject</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">subject</span></code>
+ </p>
</td>
<td>
- <p>
- The parser for the input sequence between the <code class="computeroutput"><span class="identifier">prefix</span></code>
- and <code class="computeroutput"><span class="identifier">suffix</span></code> parts.
- </p>
+ <p>
+ The parser for the input sequence between the <code class="computeroutput"><span class="identifier">prefix</span></code>
+ and <code class="computeroutput"><span class="identifier">suffix</span></code> parts.
+ </p>
</td>
</tr>
</tbody>
@@ -172,7 +172,7 @@
All three parameters can be arbitrarily complex parsers themselves.
</p>
<a name="spirit_repository.qi_components.directives.confix.attribute"></a><h6>
-<a name="id624354"></a>
+<a name="id762814"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.attribute">Attribute</a>
</h6>
<p>
@@ -184,7 +184,7 @@
</p>
<pre class="programlisting"><span class="identifier">a</span><span class="special">:</span> <span class="identifier">A</span><span class="special">,</span> <span class="identifier">p</span><span class="special">:</span> <span class="identifier">P</span><span class="special">,</span> <span class="identifier">s</span><span class="special">:</span> <span class="identifier">S</span><span class="special">:</span> <span class="special">--></span> <span class="identifier">confix</span><span class="special">(</span><span class="identifier">p</span><span class="special">,</span> <span class="identifier">s</span><span class="special">)[</span><span class="identifier">a</span><span class="special">]:</span> <span class="identifier">A</span>
</pre>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../images/note.png"></td>
<th align="left">Note</th>
@@ -198,7 +198,7 @@
</p></td></tr>
</table></div>
<a name="spirit_repository.qi_components.directives.confix.example"></a><h6>
-<a name="id624591"></a>
+<a name="id763077"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.example">Example</a>
</h6>
<p>
@@ -208,7 +208,7 @@
see confix.cpp)
</p>
<a name="spirit_repository.qi_components.directives.confix.prerequisites"></a><h6>
-<a name="id624626"></a>
+<a name="id763116"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.prerequisites">Prerequisites</a>
</h6>
<p>
@@ -217,25 +217,19 @@
for the new <code class="computeroutput"><span class="identifier">confix</span></code> directive.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_confix</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
In order to make the examples below more readable we import a number of
elements into the current namespace:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">eol</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">lexeme</span><span class="special">;</span>
@@ -247,11 +241,9 @@
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">repository</span><span class="special">::</span><span class="identifier">confix</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="spirit_repository.qi_components.directives.confix.parsing_different_comment_styles"></a><h6>
-<a name="id625044"></a>
+<a name="id763572"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.parsing_different_comment_styles">Parsing
Different Comment Styles</a>
</h6>
@@ -260,9 +252,7 @@
a C++ comment:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">parse_cpp_comment</span><span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&</span> <span class="identifier">attr</span><span class="special">)</span>
@@ -277,8 +267,6 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
This function will obviously parse input such as "<code class="computeroutput"><span class="comment">//
@@ -286,9 +274,7 @@
comment proves to be straightforward:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">parse_c_comment</span><span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&</span> <span class="identifier">attr</span><span class="special">)</span>
@@ -303,15 +289,13 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
which again will be able to parse e.g. "<code class="computeroutput"><span class="comment">/*
This is a comment */</span> </code>".
</p>
<a name="spirit_repository.qi_components.directives.confix.parsing_tagged_data"></a><h6>
-<a name="id626988"></a>
+<a name="id764198"></a>
<a class="link" href="confix.html#spirit_repository.qi_components.directives.confix.parsing_tagged_data">Parsing
Tagged Data</a>
</h6>
@@ -320,9 +304,7 @@
is not very hard, either:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">parse_tagged</span><span class="special">(</span><span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">&</span> <span class="identifier">attr</span><span class="special">)</span>
@@ -338,8 +320,6 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -352,7 +332,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="distinct.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../directives.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="distinct.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/distinct.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/directives/distinct.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi Distinct Parser Directive</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../directives.html" title="Qi Parser Directives">
<link rel="prev" href="confix.html" title="Qi Confix Parser Directive">
@@ -13,22 +13,22 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="confix.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="confix.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi Distinct Parser Directive">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="spirit_repository.qi_components.directives.distinct"></a><a class="link" href="distinct.html" title="Qi Distinct Parser Directive">
Qi Distinct Parser Directive</a>
</h4></div></div></div>
<a name="spirit_repository.qi_components.directives.distinct.description"></a><h6>
-<a name="id627341"></a>
+<a name="id764582"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.description">Description</a>
</h6>
<p>
@@ -73,9 +73,7 @@
see distinct.cpp):
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">spirit</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">;</span>
<span class="keyword">namespace</span> <span class="identifier">ascii</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">ascii</span><span class="special">;</span>
@@ -128,8 +126,6 @@
<span class="identifier">keyword_tag_type</span> <span class="keyword">const</span> <span class="identifier">keyword</span> <span class="special">=</span> <span class="identifier">distinct_spec</span><span class="special">(</span><span class="identifier">char_spec</span><span class="special">(</span><span class="identifier">keyword_spec</span><span class="special">));</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
These definitions define a new Qi parser recognizing keywords! This allows
@@ -144,20 +140,20 @@
above.
</p>
<a name="spirit_repository.qi_components.directives.distinct.header"></a><h6>
-<a name="id628578"></a>
+<a name="id765952"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.header">Header</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/repository/home/qi/directive/distinct.hpp>
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_distinct</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="spirit_repository.qi_components.directives.distinct.synopsis"></a><h6>
-<a name="id628656"></a>
+<a name="id766039"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><span class="identifier">distinct</span><span class="special">(</span><span class="identifier">tail</span><span class="special">)[</span><span class="identifier">subject</span><span class="special">]</span>
</pre>
<a name="spirit_repository.qi_components.directives.distinct.parameters"></a><h6>
-<a name="id628700"></a>
+<a name="id766087"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.parameters">Parameters</a>
</h6>
<div class="informaltable"><table class="table">
@@ -167,41 +163,41 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Parameter
- </p>
+ <p>
+ Parameter
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">tail</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">tail</span></code>
+ </p>
</td>
<td>
- <p>
- The parser construct specifying what whould not follow the subject
- in order to match the overall expression.
- </p>
+ <p>
+ The parser construct specifying what whould not follow the subject
+ in order to match the overall expression.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">subject</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">subject</span></code>
+ </p>
</td>
<td>
- <p>
- The parser construct to use to match the current input. The distinct
- directive makes sure that no unexpected partial matches occur.
- </p>
+ <p>
+ The parser construct to use to match the current input. The distinct
+ directive makes sure that no unexpected partial matches occur.
+ </p>
</td>
</tr>
</tbody>
@@ -210,7 +206,7 @@
All two parameters can be arbitrary complex parsers themselves.
</p>
<a name="spirit_repository.qi_components.directives.distinct.attribute"></a><h6>
-<a name="id628804"></a>
+<a name="id766199"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.attribute">Attribute</a>
</h6>
<p>
@@ -224,7 +220,7 @@
<pre class="programlisting"><span class="identifier">a</span><span class="special">:</span> <span class="identifier">A</span><span class="special">,</span> <span class="identifier">b</span><span class="special">:</span> <span class="identifier">B</span> <span class="special">--></span> <span class="identifier">distinct</span><span class="special">(</span><span class="identifier">b</span><span class="special">)[</span><span class="identifier">a</span><span class="special">]:</span> <span class="identifier">A</span>
</pre>
<a name="spirit_repository.qi_components.directives.distinct.example"></a><h6>
-<a name="id629198"></a>
+<a name="id766328"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.example">Example</a>
</h6>
<p>
@@ -232,7 +228,7 @@
parser. distinct.cpp)
</p>
<a name="spirit_repository.qi_components.directives.distinct.prerequisites"></a><h6>
-<a name="id629230"></a>
+<a name="id766365"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.prerequisites">Prerequisites</a>
</h6>
<p>
@@ -241,35 +237,27 @@
for the new <code class="computeroutput"><span class="identifier">distinct</span></code> generator.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_distinct</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
To make all the code below more readable we introduce the following namespaces.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">ascii</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">repository</span><span class="special">::</span><span class="identifier">distinct</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="spirit_repository.qi_components.directives.distinct.using_the_distinct_directive_to_match_keywords"></a><h6>
-<a name="id629474"></a>
+<a name="id766632"></a>
<a class="link" href="distinct.html#spirit_repository.qi_components.directives.distinct.using_the_distinct_directive_to_match_keywords">Using
The Distinct Directive to Match keywords</a>
</h6>
@@ -281,9 +269,7 @@
followed by an optional <code class="computeroutput"><span class="string">"--"</span></code>):
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"description ident"</span><span class="special">);</span>
@@ -295,11 +281,9 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
- </p>
+ </p>
<p>
-
+
</p>
<pre class="programlisting"><span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"description--ident"</span><span class="special">);</span>
@@ -311,17 +295,13 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The last example shows that the <code class="computeroutput"><span class="identifier">distinct</span><span class="special">[]</span></code> parser component correctly refuses to
match "description-ident":
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="special">{</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"description-ident"</span><span class="special">);</span>
@@ -333,8 +313,6 @@
<span class="special">}</span>
</pre>
<p>
- </p>
-<p>
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
@@ -347,7 +325,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="confix.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="confix.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../directives.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi Parser Non-terminals</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../qi_components.html" title="Qi Components">
<link rel="prev" href="directives/distinct.html" title="Qi Distinct Parser Directive">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="directives/distinct.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="directives/distinct.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi Parser Non-terminals">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="spirit_repository.qi_components.nonterminal"></a><a class="link" href="nonterminal.html" title="Qi Parser Non-terminals"> Qi Parser
Non-terminals</a>
@@ -40,7 +40,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="directives/distinct.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="directives/distinct.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nonterminal/subrule.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal/subrule.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/nonterminal/subrule.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi subrules</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../nonterminal.html" title="Qi Parser Non-terminals">
<link rel="prev" href="../nonterminal.html" title="Qi Parser Non-terminals">
@@ -13,22 +13,22 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../karma_components.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../karma_components.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi subrules">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="spirit_repository.qi_components.nonterminal.subrule"></a><a class="link" href="subrule.html" title="Qi subrules">
Qi subrules</a>
</h4></div></div></div>
<a name="spirit_repository.qi_components.nonterminal.subrule.description"></a><h6>
-<a name="id630408"></a>
+<a name="id767651"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.description">Description</a>
</h6>
<p>
@@ -50,20 +50,18 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- subrules can only be defined and used within the same parser expression.
- A subrule cannot be defined at one location, and then used in another
- location.
- </li>
+ subrules can only be defined and used within the same parser expression.
+ A subrule cannot be defined at one location, and then used in another
+ location.
+ </li>
<li class="listitem">
- subrules put a massive strain on the C++ compiler. They increase compile
- times and memory usage during compilation, and also increase the risk
- of hitting compiler limits and/or bugs.
- </li>
+ subrules put a massive strain on the C++ compiler. They increase compile
+ times and memory usage during compilation, and also increase the risk
+ of hitting compiler limits and/or bugs.
+ </li>
</ul></div>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="identifier">entry</span> <span class="special">=</span> <span class="special">(</span>
<span class="identifier">expression</span> <span class="special">=</span>
@@ -86,8 +84,6 @@
<span class="special">);</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The example above can be found here: ../../example/qi/calc1_sr.cpp
@@ -101,21 +97,21 @@
most performance-critical parts), whereas the rest can use rules and grammars.
</p>
<a name="spirit_repository.qi_components.nonterminal.subrule.header"></a><h6>
-<a name="id630796"></a>
+<a name="id768089"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.header">Header</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/repository/home/qi/nonterminal/subrule.hpp>
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_subrule</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="spirit_repository.qi_components.nonterminal.subrule.synopsis__declaration_"></a><h6>
-<a name="id630872"></a>
+<a name="id768178"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.synopsis__declaration_">Synopsis
(declaration)</a>
</h6>
<pre class="programlisting"><span class="identifier">subrule</span><span class="special"><</span><span class="identifier">ID</span><span class="special">,</span> <span class="identifier">A1</span><span class="special">,</span> <span class="identifier">A2</span><span class="special">></span> <span class="identifier">sr</span><span class="special">(</span><span class="identifier">name</span><span class="special">);</span>
</pre>
<a name="spirit_repository.qi_components.nonterminal.subrule.parameters__declaration_"></a><h6>
-<a name="id630936"></a>
+<a name="id768255"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.parameters__declaration_">Parameters
(declaration)</a>
</h6>
@@ -126,66 +122,66 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Parameter
- </p>
+ <p>
+ Parameter
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">ID</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">ID</span></code>
+ </p>
</td>
<td>
- <p>
- Required numeric argument. Gives the subrule a unique 'identification
- tag'.
- </p>
+ <p>
+ Required numeric argument. Gives the subrule a unique 'identification
+ tag'.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">A1</span></code>, <code class="computeroutput"><span class="identifier">A2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">A1</span></code>, <code class="computeroutput"><span class="identifier">A2</span></code>
+ </p>
</td>
<td>
- <p>
- Optional types, can be specified in any order. Can be one of 1.
- signature, 2. locals (see rules reference for more information
- on those parameters).
- </p>
- <p>
- Note that the skipper type need not be specified in the parameters,
- unlike with grammars and rules. Subrules will automatically use
- the skipper type which is in effect when they are invoked.
- </p>
+ <p>
+ Optional types, can be specified in any order. Can be one of
+ 1. signature, 2. locals (see rules reference for more information
+ on those parameters).
+ </p>
+ <p>
+ Note that the skipper type need not be specified in the parameters,
+ unlike with grammars and rules. Subrules will automatically use
+ the skipper type which is in effect when they are invoked.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">name</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">name</span></code>
+ </p>
</td>
<td>
- <p>
- Optional string. Gives the subrule a name, useful for debugging
- and error handling.
- </p>
+ <p>
+ Optional string. Gives the subrule a name, useful for debugging
+ and error handling.
+ </p>
</td>
</tr>
</tbody>
</table></div>
<a name="spirit_repository.qi_components.nonterminal.subrule.synopsis__usage_"></a><h6>
-<a name="id631066"></a>
+<a name="id768407"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.synopsis__usage_">Synopsis
(usage)</a>
</h6>
@@ -214,7 +210,7 @@
<span class="special">)(</span><span class="identifier">a1</span><span class="special">,</span> <span class="identifier">a2</span><span class="special">,</span> <span class="special">...)</span> <span class="comment">// Arguments to group, i.e. to start subrule srA
</span></pre>
<a name="spirit_repository.qi_components.nonterminal.subrule.parameters__usage_"></a><h6>
-<a name="id631301"></a>
+<a name="id768670"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.parameters__usage_">Parameters
(usage)</a>
</h6>
@@ -225,120 +221,120 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Parameter
- </p>
+ <p>
+ Parameter
+ </p>
</th>
<th>
- <p>
- Description
- </p>
+ <p>
+ Description
+ </p>
</th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">sr1</span></code>, <code class="computeroutput"><span class="identifier">sr2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">sr1</span></code>, <code class="computeroutput"><span class="identifier">sr2</span></code>
+ </p>
</td>
<td>
- <p>
- Subrules with different IDs.
- </p>
+ <p>
+ Subrules with different IDs.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">expr1</span></code>, <code class="computeroutput"><span class="identifier">expr2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">expr1</span></code>, <code class="computeroutput"><span class="identifier">expr2</span></code>
+ </p>
</td>
<td>
- <p>
- Parser expressions. Can include <code class="computeroutput"><span class="identifier">sr1</span></code>
- and <code class="computeroutput"><span class="identifier">sr2</span></code>, as well
- as any other valid parser expressions.
- </p>
+ <p>
+ Parser expressions. Can include <code class="computeroutput"><span class="identifier">sr1</span></code>
+ and <code class="computeroutput"><span class="identifier">sr2</span></code>, as well
+ as any other valid parser expressions.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">srA</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">srA</span></code>
+ </p>
</td>
<td>
- <p>
- Subrule with a synthesized attribute and inherited attributes.
- </p>
+ <p>
+ Subrule with a synthesized attribute and inherited attributes.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">srB</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">srB</span></code>
+ </p>
</td>
<td>
- <p>
- Subrule with a synthesized attribute.
- </p>
+ <p>
+ Subrule with a synthesized attribute.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">srC</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">srC</span></code>
+ </p>
</td>
<td>
- <p>
- Subrule with inherited attributes.
- </p>
+ <p>
+ Subrule with inherited attributes.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">exprA</span></code>, <code class="computeroutput"><span class="identifier">exprB</span></code>, <code class="computeroutput"><span class="identifier">exprC</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">exprA</span></code>, <code class="computeroutput"><span class="identifier">exprB</span></code>, <code class="computeroutput"><span class="identifier">exprC</span></code>
+ </p>
</td>
<td>
- <p>
- Parser expressions.
- </p>
+ <p>
+ Parser expressions.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">a1</span></code>, <code class="computeroutput"><span class="identifier">a2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">a1</span></code>, <code class="computeroutput"><span class="identifier">a2</span></code>
+ </p>
</td>
<td>
- <p>
- Arguments passed to the subrule group. They are passed as inherited
- attributes to the group's start subrule, <code class="computeroutput"><span class="identifier">srA</span></code>.
- </p>
+ <p>
+ Arguments passed to the subrule group. They are passed as inherited
+ attributes to the group's start subrule, <code class="computeroutput"><span class="identifier">srA</span></code>.
+ </p>
</td>
</tr>
<tr>
<td>
- <p>
- <code class="computeroutput"><span class="identifier">c1</span></code>, <code class="computeroutput"><span class="identifier">c2</span></code>
- </p>
+ <p>
+ <code class="computeroutput"><span class="identifier">c1</span></code>, <code class="computeroutput"><span class="identifier">c2</span></code>
+ </p>
</td>
<td>
- <p>
- Arguments passed as inherited attributes to subrule <code class="computeroutput"><span class="identifier">srC</span></code>.
- </p>
+ <p>
+ Arguments passed as inherited attributes to subrule <code class="computeroutput"><span class="identifier">srC</span></code>.
+ </p>
</td>
</tr>
</tbody>
</table></div>
<a name="spirit_repository.qi_components.nonterminal.subrule.groups"></a><h6>
-<a name="id632980"></a>
+<a name="id769280"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.groups">Groups</a>
</h6>
<p>
@@ -383,7 +379,7 @@
</span><span class="special">;</span>
</pre>
<a name="spirit_repository.qi_components.nonterminal.subrule.attributes"></a><h6>
-<a name="id633381"></a>
+<a name="id769725"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.attributes">Attributes</a>
</h6>
<p>
@@ -392,26 +388,27 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- the type of its synthesized attribute is the one specified in the subrule's
- signature, if any. Otherwise it is <code class="computeroutput"><span class="identifier">unused_type</span></code>.
- </li>
+ the type of its synthesized attribute is the one specified in the subrule's
+ signature, if any. Otherwise it is <code class="computeroutput"><span class="identifier">unused_type</span></code>.
+ </li>
<li class="listitem">
- the types of its inherited attributes are the ones specified in the subrule's
- signature, if any. Otherwise the subrule has no inherited attributes.
- </li>
+ the types of its inherited attributes are the ones specified in the
+ subrule's signature, if any. Otherwise the subrule has no inherited
+ attributes.
+ </li>
<li class="listitem">
- an auto-subrule can be defined by assigning it with the <code class="computeroutput"><span class="special">%=</span></code> syntax. In this case, the RHS parser's
- attribute is automatically propagated to the subrule's synthesized attribute.
- </li>
+ an auto-subrule can be defined by assigning it with the <code class="computeroutput"><span class="special">%=</span></code> syntax. In this case, the RHS parser's
+ attribute is automatically propagated to the subrule's synthesized
+ attribute.
+ </li>
<li class="listitem">
- the Phoenix placeholders <code class="computeroutput"><span class="identifier">_val</span></code>,
- <code class="computeroutput"><span class="identifier">_r1</span></code>, <code class="computeroutput"><span class="identifier">_r2</span></code>,
- ... are available to refer to the subrule's synthesized and inherited
- attributes, if present.
- </li>
+ the Phoenix placeholders <code class="computeroutput"><span class="identifier">_val</span></code>,
+ <code class="computeroutput"><span class="identifier">_r1</span></code>, <code class="computeroutput"><span class="identifier">_r2</span></code>, ... are available to refer to
+ the subrule's synthesized and inherited attributes, if present.
+ </li>
</ul></div>
<a name="spirit_repository.qi_components.nonterminal.subrule.locals"></a><h6>
-<a name="id633457"></a>
+<a name="id769830"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.locals">Locals</a>
</h6>
<p>
@@ -421,16 +418,14 @@
refer to the subrule's locals, if present.
</p>
<a name="spirit_repository.qi_components.nonterminal.subrule.example"></a><h6>
-<a name="id633493"></a>
+<a name="id769872"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.example">Example</a>
</h6>
<p>
Some includes:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_subrule</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -438,32 +433,24 @@
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">phoenix_operator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
Some using declarations:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">qi</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">qi</span><span class="special">;</span>
<span class="keyword">namespace</span> <span class="identifier">repo</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">repository</span><span class="special">;</span>
<span class="keyword">namespace</span> <span class="identifier">ascii</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">ascii</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
A grammar containing only one rule, defined with a group of 5 subrules:
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">mini_xml_grammar</span>
@@ -511,8 +498,6 @@
<span class="special">};</span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
The definitions of the <code class="computeroutput"><span class="identifier">mini_xml</span></code>
@@ -521,7 +506,7 @@
<a href="../../../../../example/qi/mini_xml2_sr.cpp" target="_top">../../example/qi/mini_xml2_sr.cpp</a>
</p>
<a name="spirit_repository.qi_components.nonterminal.subrule.performance"></a><h6>
-<a name="id634763"></a>
+<a name="id771325"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.performance">Performance</a>
</h6>
<p>
@@ -529,7 +514,7 @@
examples to subrules, with various compilers.
</p>
<div class="table">
-<a name="id634779"></a><p class="title"><b>Table 2. Subrules performance</b></p>
+<a name="id771345"></a><p class="title"><b>Table 2. Subrules performance</b></p>
<div class="table-contents"><table class="table" summary="Subrules performance">
<colgroup>
<col>
@@ -540,220 +525,220 @@
</colgroup>
<thead><tr>
<th>
- <p>
- Example
- </p>
- </th>
+ <p>
+ Example
+ </p>
+ </th>
<th>
- <p>
- Compiler
- </p>
- </th>
+ <p>
+ Compiler
+ </p>
+ </th>
<th>
- <p>
- Speed (run-time)
- </p>
- </th>
+ <p>
+ Speed (run-time)
+ </p>
+ </th>
<th>
- <p>
- Time (compile-time)
- </p>
- </th>
+ <p>
+ Time (compile-time)
+ </p>
+ </th>
<th>
- <p>
- Memory (compile-time)
- </p>
- </th>
+ <p>
+ Memory (compile-time)
+ </p>
+ </th>
</tr></thead>
<tbody>
<tr>
<td>
- <p>
- calc1_sr
- </p>
- </td>
-<td>
- <p>
- gcc 4.4.1
- </p>
- </td>
-<td>
- <p>
- +6%
- </p>
- </td>
-<td>
- <p>
- n/a
- </p>
- </td>
-<td>
- <p>
- n/a
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- calc1_sr
- </p>
- </td>
-<td>
- <p>
- Visual C++ 2008 (VC9)
- </p>
- </td>
-<td>
- <p>
- +5%
- </p>
- </td>
-<td>
- <p>
- n/a
- </p>
- </td>
-<td>
- <p>
- n/a
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- mini_xml2_sr
- </p>
- </td>
-<td>
- <p>
- gcc 3.4.6
- </p>
- </td>
-<td>
- <p>
- -1%
- </p>
- </td>
-<td>
- <p>
- +54%
- </p>
- </td>
-<td>
- <p>
- +32%
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- mini_xml2_sr
- </p>
- </td>
-<td>
- <p>
- gcc 4.1.2
- </p>
- </td>
-<td>
- <p>
- +5%
- </p>
- </td>
-<td>
- <p>
- +58%
- </p>
- </td>
-<td>
- <p>
- +25%
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- mini_xml2_sr
- </p>
- </td>
-<td>
- <p>
- gcc 4.4.1
- </p>
- </td>
-<td>
- <p>
- +8%
- </p>
- </td>
-<td>
- <p>
- +20%
- </p>
- </td>
-<td>
- <p>
- +14%
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- mini_xml2_sr
- </p>
- </td>
-<td>
- <p>
- Visual C++ 2005 (VC8) SP1
- </p>
- </td>
-<td>
- <p>
- +1%
- </p>
- </td>
-<td>
- <p>
- +33%
- </p>
- </td>
-<td>
- <p>
- +27%
- </p>
- </td>
-</tr>
-<tr>
-<td>
- <p>
- mini_xml2_sr
- </p>
- </td>
-<td>
- <p>
- Visual C++ 2008 (VC9)
- </p>
- </td>
-<td>
- <p>
- +9%
- </p>
- </td>
-<td>
- <p>
- +52%
- </p>
- </td>
-<td>
- <p>
- +40%
- </p>
- </td>
+ <p>
+ calc1_sr
+ </p>
+ </td>
+<td>
+ <p>
+ gcc 4.4.1
+ </p>
+ </td>
+<td>
+ <p>
+ +6%
+ </p>
+ </td>
+<td>
+ <p>
+ n/a
+ </p>
+ </td>
+<td>
+ <p>
+ n/a
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ calc1_sr
+ </p>
+ </td>
+<td>
+ <p>
+ Visual C++ 2008 (VC9)
+ </p>
+ </td>
+<td>
+ <p>
+ +5%
+ </p>
+ </td>
+<td>
+ <p>
+ n/a
+ </p>
+ </td>
+<td>
+ <p>
+ n/a
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ mini_xml2_sr
+ </p>
+ </td>
+<td>
+ <p>
+ gcc 3.4.6
+ </p>
+ </td>
+<td>
+ <p>
+ -1%
+ </p>
+ </td>
+<td>
+ <p>
+ +54%
+ </p>
+ </td>
+<td>
+ <p>
+ +32%
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ mini_xml2_sr
+ </p>
+ </td>
+<td>
+ <p>
+ gcc 4.1.2
+ </p>
+ </td>
+<td>
+ <p>
+ +5%
+ </p>
+ </td>
+<td>
+ <p>
+ +58%
+ </p>
+ </td>
+<td>
+ <p>
+ +25%
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ mini_xml2_sr
+ </p>
+ </td>
+<td>
+ <p>
+ gcc 4.4.1
+ </p>
+ </td>
+<td>
+ <p>
+ +8%
+ </p>
+ </td>
+<td>
+ <p>
+ +20%
+ </p>
+ </td>
+<td>
+ <p>
+ +14%
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ mini_xml2_sr
+ </p>
+ </td>
+<td>
+ <p>
+ Visual C++ 2005 (VC8) SP1
+ </p>
+ </td>
+<td>
+ <p>
+ +1%
+ </p>
+ </td>
+<td>
+ <p>
+ +33%
+ </p>
+ </td>
+<td>
+ <p>
+ +27%
+ </p>
+ </td>
+</tr>
+<tr>
+<td>
+ <p>
+ mini_xml2_sr
+ </p>
+ </td>
+<td>
+ <p>
+ Visual C++ 2008 (VC9)
+ </p>
+ </td>
+<td>
+ <p>
+ +9%
+ </p>
+ </td>
+<td>
+ <p>
+ +52%
+ </p>
+ </td>
+<td>
+ <p>
+ +40%
+ </p>
+ </td>
</tr>
</tbody>
</table></div>
@@ -763,20 +748,20 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<span class="bold"><strong>Speed (run-time)</strong></span>: speed-up of the parser
- resulting from the use of subrules (higher is better).
- </li>
+ <span class="bold"><strong>Speed (run-time)</strong></span>: speed-up of the
+ parser resulting from the use of subrules (higher is better).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Time (compile-time)</strong></span>: increase in compile
- time (lower is better).
- </li>
+ <span class="bold"><strong>Time (compile-time)</strong></span>: increase in compile
+ time (lower is better).
+ </li>
<li class="listitem">
-<span class="bold"><strong>Memory (compile-time)</strong></span>: increase in compiler
- memory usage (lower is better).
- </li>
+ <span class="bold"><strong>Memory (compile-time)</strong></span>: increase in
+ compiler memory usage (lower is better).
+ </li>
</ul></div>
<a name="spirit_repository.qi_components.nonterminal.subrule.notes"></a><h6>
-<a name="id635118"></a>
+<a name="id771740"></a>
<a class="link" href="subrule.html#spirit_repository.qi_components.nonterminal.subrule.notes">Notes</a>
</h6>
<p>
@@ -800,7 +785,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../../karma_components.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../nonterminal.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../karma_components.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi Parser Primitives</title>
-<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../qi_components.html" title="Qi Components">
<link rel="prev" href="../qi_components.html" title="Qi Components">
@@ -13,16 +13,16 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../qi_components.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../qi_components.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi Parser Primitives">
+<div class="section">
<div class="titlepage"><div><div><h3 class="title">
<a name="spirit_repository.qi_components.primitive"></a><a class="link" href="primitive.html" title="Qi Parser Primitives"> Qi Parser
Primitives</a>
@@ -40,7 +40,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../qi_components.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../qi_components.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../qi_components.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="primitive/flush_multi_pass.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive/flush_multi_pass.html (original)
+++ branches/release/libs/spirit/repository/doc/html/spirit_repository/qi_components/primitive/flush_multi_pass.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -2,8 +2,8 @@
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Qi flush_multi_pass parser</title>
-<link rel="stylesheet" href="../../../../../../../../doc/html/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.75.0">
+<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Spirit Repository 0.1">
<link rel="up" href="../primitive.html" title="Qi Parser Primitives">
<link rel="prev" href="../primitive.html" title="Qi Parser Primitives">
@@ -13,22 +13,22 @@
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td>
<td align="center">Home</td>
-<td align="center">Libraries</td>
+<td align="center">Libraries</td>
<td align="center">People</td>
<td align="center">FAQ</td>
<td align="center">More</td>
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../primitive.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../primitive.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../directives.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../primitive.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../primitive.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../directives.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section" title="Qi flush_multi_pass parser">
+<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="spirit_repository.qi_components.primitive.flush_multi_pass"></a><a class="link" href="flush_multi_pass.html" title="Qi flush_multi_pass parser">
Qi flush_multi_pass parser</a>
</h4></div></div></div>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.description"></a><h6>
-<a name="id619892"></a>
+<a name="id760277"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.description">Description</a>
</h6>
<p>
@@ -53,20 +53,20 @@
<code class="computeroutput"><span class="identifier">eps</span></code>).
</p>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.header"></a><h6>
-<a name="id620000"></a>
+<a name="id760413"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.header">Header</a>
</h6>
<pre class="programlisting"><span class="comment">// forwards to <boost/spirit/repository/home/qi/primitive/flush_multi_pass.hpp>
</span><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_flush_multi_pass</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.synopsis"></a><h6>
-<a name="id620073"></a>
+<a name="id760502"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><span class="identifier">flush_multi_pass</span>
</pre>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.parameters"></a><h6>
-<a name="id620094"></a>
+<a name="id760531"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.parameters">Parameters</a>
</h6>
<p>
@@ -74,7 +74,7 @@
not require any parameters.
</p>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.attribute"></a><h6>
-<a name="id620118"></a>
+<a name="id760563"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.attribute">Attribute</a>
</h6>
<p>
@@ -84,7 +84,7 @@
<pre class="programlisting"><span class="identifier">flush_multi_pass</span> <span class="special">--></span> <span class="identifier">unused</span>
</pre>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.example"></a><h6>
-<a name="id620168"></a>
+<a name="id760623"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.example">Example</a>
</h6>
<p>
@@ -96,7 +96,7 @@
a function prototype (for the full example code see here: flush_multi_pass.cpp)
</p>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.prerequisites"></a><h6>
-<a name="id620200"></a>
+<a name="id760666"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.prerequisites">Prerequisites</a>
</h6>
<p>
@@ -106,34 +106,26 @@
parser.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">spirit</span><span class="special">/</span><span class="identifier">repository</span><span class="special">/</span><span class="identifier">include</span><span class="special">/</span><span class="identifier">qi_flush_multi_pass</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
</pre>
<p>
- </p>
-<p>
</p>
<p>
To make all the code below more readable we introduce the following namespaces.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">spirit</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">;</span>
<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">spirit</span><span class="special">::</span><span class="identifier">repository</span><span class="special">::</span><span class="identifier">flush_multi_pass</span><span class="special">;</span>
</pre>
<p>
- </p>
-<p>
</p>
<a name="spirit_repository.qi_components.primitive.flush_multi_pass.clearing_the_internal_buffer"></a><h6>
-<a name="id620416"></a>
+<a name="id760902"></a>
<a class="link" href="flush_multi_pass.html#spirit_repository.qi_components.primitive.flush_multi_pass.clearing_the_internal_buffer">Clearing
the internal buffer</a>
</h6>
@@ -147,9 +139,7 @@
purpose.
</p>
<p>
- </p>
-<p>
-
+
</p>
<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Skipper</span><span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">preprocessor</span> <span class="special">:</span> <span class="identifier">spirit</span><span class="special">::</span><span class="identifier">qi</span><span class="special">::</span><span class="identifier">grammar</span><span class="special"><</span><span class="identifier">Iterator</span><span class="special">,</span> <span class="identifier">Skipper</span><span class="special">></span>
@@ -188,10 +178,8 @@
<span class="special">};</span>
</pre>
<p>
- </p>
-<p>
</p>
-<div class="note" title="Note"><table border="0" summary="Note">
+<div class="note"><table border="0" summary="Note">
<tr>
<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../images/note.png"></td>
<th align="left">Note</th>
@@ -213,7 +201,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../primitive.html"><img src="../../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../primitive.html"><img src="../../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="../directives.html"><img src="../../../../../../../../doc/html/images/next.png" alt="Next"></a>
+<a accesskey="p" href="../primitive.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../primitive.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../directives.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
==============================================================================
--- branches/release/tools/boostbook/doc/boostbook.xml (original)
+++ branches/release/tools/boostbook/doc/boostbook.xml 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -210,7 +210,7 @@
documentation for libraries that do not require Doxygen. To
test this, change into the directory <filename
class="directory">$BOOST_ROOT/libs/function/doc</filename> and
- run the command <code>bjam --v2</code>: it should produce HTML
+ run the command <code>bjam</code>: it should produce HTML
documentation for the Boost.Function library in the
<code>html</code> subdirectory.</para>
</section>
@@ -287,7 +287,7 @@
<para>To test PDF generation, switch to the directory <filename
class="directory">$BOOST_ROOT/libs/function/doc</filename> and
- execute the command <command>bjam --v2 pdf</command>. In the
+ execute the command <command>bjam pdf</command>. In the
absence of any errors, Apache FOP will be executed to transform
the XSL:FO output of DocBook into a PDF file.</para>
</section>
@@ -300,8 +300,8 @@
documentation. First, change to the directory
<code>$BOOST_ROOT/doc</code> and remove (or make writable) the
<code>.html</code> files in
- <code>$BOOST_ROOT/doc/html</code>. Then, run <code>bjam
- --v2</code> to build HTML documentation. You should see several
+ <code>$BOOST_ROOT/doc/html</code>. Then, run <code>bjam</code>
+ to build HTML documentation. You should see several
warnings like these while DocBook documentation is being built
from BoostBook documentation:</para>
@@ -316,12 +316,12 @@
documentation for Boost will be available in
<code>$BOOST_ROOT/doc/html</code>. You can also create HTML
documentation in a single (large!) HTML file with the command line
- <code>bjam --v2 onehtml</code>, or Unix man pages with the command
- line <code>bjam --v2 man</code>. The complete list of output
+ <code>bjam onehtml</code>, or Unix man pages with the command
+ line <code>bjam man</code>. The complete list of output
formats is listed in <xref
linkend="boostbook.output.formats"/>. Several output formats can
be passed to a single invocation of <code>bjam</code>, e.g.,
- <code>bjam --v2 html man docbook</code> would generate HTML
+ <code>bjam html man docbook</code> would generate HTML
(multiple files), man pages, and DocBook documentation.</para>
<table id="boostbook.output.formats">
==============================================================================
--- branches/release/tools/quickbook/doc/quickbook.qbk (original)
+++ branches/release/tools/quickbook/doc/quickbook.qbk 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -1943,7 +1943,7 @@
# Go to Quickbook's source directory (`BOOST_ROOT/tools/quickbook`).
-# Build the utility by issuing `bjam --v2`.
+# Build the utility by issuing `bjam`.
# Copy the resulting `quickbook` binary (located under the
`BOOST_ROOT/bin.v2` hierarchy) to a safe place. Following our previous
@@ -2033,7 +2033,7 @@
# Go to Quickbook's source directory (`BOOST_ROOT\tools\quickbook`).
-# Build the utility by issuing `bjam --v2`.
+# Build the utility by issuing `bjam`.
# Copy the resulting `quickbook.exe` binary (located under the
`BOOST_ROOT\bin.v2` hierarchy) to a safe place. Following our previous
@@ -2084,7 +2084,7 @@
# Go to Quickbook's source directory (`BOOST_ROOT/tools/quickbook`).
-# Build the utility by issuing `bjam --v2`.
+# Build the utility by issuing `bjam`.
# Copy the resulting `quickbook` binary (located under the
`BOOST_ROOT/bin.v2` hierarchy) to a safe place. The traditional location is
==============================================================================
--- branches/release/tools/release/index.html (original)
+++ branches/release/tools/release/index.html 2010-07-19 19:29:09 EDT (Mon, 19 Jul 2010)
@@ -6,7 +6,7 @@
<meta name="ProgId" content="FrontPage.Editor.Document">
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<title>Release Scripts</title>
-<link rel="stylesheet" type="text/css" href="../../doc/html/minimal.css">
+<link rel="stylesheet" type="text/css" href="../../doc/src/minimal.css">
</head>
<body>